/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.xml -s ../benchexec/../../../trunk/examples/settings/default/automizer/svcomp-Reach-32bit-Automizer_Default.epf --traceabstraction.automaton.type.used.in.concurrency.analysis FINITE_AUTOMATA -i ../../../trunk/examples/svcomp/weaver/parallel-parallel-sum-equiv.wvr.c -------------------------------------------------------------------------------- This is Ultimate 0.3.0-wip.dk.cfg-lbe-improvements-94356ea-m [2025-04-13 18:06:45,755 INFO L188 SettingsManager]: Resetting all preferences to default values... [2025-04-13 18:06:45,793 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 18:06:45,796 WARN L101 SettingsManager]: Preference file contains the following unknown settings: [2025-04-13 18:06:45,796 WARN L103 SettingsManager]: * de.uni_freiburg.informatik.ultimate.core.Log level for class [2025-04-13 18:06:45,809 INFO L130 SettingsManager]: Preferences different from defaults after loading the file: [2025-04-13 18:06:45,810 INFO L151 SettingsManager]: Preferences of UltimateCore differ from their defaults: [2025-04-13 18:06:45,810 INFO L153 SettingsManager]: * Log level for class=de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher=ERROR; [2025-04-13 18:06:45,810 INFO L151 SettingsManager]: Preferences of Boogie Preprocessor differ from their defaults: [2025-04-13 18:06:45,810 INFO L153 SettingsManager]: * Use memory slicer=true [2025-04-13 18:06:45,810 INFO L151 SettingsManager]: Preferences of Boogie Procedure Inliner differ from their defaults: [2025-04-13 18:06:45,810 INFO L153 SettingsManager]: * Ignore calls to procedures called more than once=ONLY_FOR_SEQUENTIAL_PROGRAMS [2025-04-13 18:06:45,810 INFO L151 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2025-04-13 18:06:45,810 INFO L153 SettingsManager]: * Create parallel compositions if possible=false [2025-04-13 18:06:45,810 INFO L153 SettingsManager]: * Use SBE=true [2025-04-13 18:06:45,810 INFO L151 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2025-04-13 18:06:45,811 INFO L153 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2025-04-13 18:06:45,811 INFO L153 SettingsManager]: * sizeof long=4 [2025-04-13 18:06:45,811 INFO L153 SettingsManager]: * Overapproximate operations on floating types=true [2025-04-13 18:06:45,811 INFO L153 SettingsManager]: * sizeof POINTER=4 [2025-04-13 18:06:45,811 INFO L153 SettingsManager]: * Check division by zero=IGNORE [2025-04-13 18:06:45,811 INFO L153 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2025-04-13 18:06:45,811 INFO L153 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2025-04-13 18:06:45,811 INFO L153 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2025-04-13 18:06:45,811 INFO L153 SettingsManager]: * sizeof long double=12 [2025-04-13 18:06:45,811 INFO L153 SettingsManager]: * Check if freed pointer was valid=false [2025-04-13 18:06:45,811 INFO L153 SettingsManager]: * Behaviour of calls to undefined functions=OVERAPPROXIMATE_BEHAVIOUR [2025-04-13 18:06:45,811 INFO L153 SettingsManager]: * Use constant arrays=true [2025-04-13 18:06:45,811 INFO L151 SettingsManager]: Preferences of IcfgBuilder differ from their defaults: [2025-04-13 18:06:45,811 INFO L153 SettingsManager]: * Size of a code block=SequenceOfStatements [2025-04-13 18:06:45,811 INFO L153 SettingsManager]: * Only consider context switches at boundaries of atomic blocks=true [2025-04-13 18:06:45,811 INFO L153 SettingsManager]: * SMT solver=External_DefaultMode [2025-04-13 18:06:45,812 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2025-04-13 18:06:45,812 INFO L151 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2025-04-13 18:06:45,812 INFO L153 SettingsManager]: * Size of a code block=SequenceOfStatements [2025-04-13 18:06:45,812 INFO L153 SettingsManager]: * Only consider context switches at boundaries of atomic blocks=true [2025-04-13 18:06:45,812 INFO L153 SettingsManager]: * SMT solver=External_DefaultMode [2025-04-13 18:06:45,812 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2025-04-13 18:06:45,812 INFO L151 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2025-04-13 18:06:45,812 INFO L153 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2025-04-13 18:06:45,812 INFO L153 SettingsManager]: * Compute procedure contracts=false [2025-04-13 18:06:45,812 INFO L153 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopHeads [2025-04-13 18:06:45,812 INFO L153 SettingsManager]: * Trace refinement strategy=CAMEL [2025-04-13 18:06:45,812 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2025-04-13 18:06:45,812 INFO L153 SettingsManager]: * Automaton type used in concurrency analysis=PETRI_NET [2025-04-13 18:06:45,812 INFO L153 SettingsManager]: * Order on configurations for Petri net unfoldings=DBO [2025-04-13 18:06:45,812 INFO L153 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode [2025-04-13 18:06:45,812 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 [2025-04-13 18:06:46,031 INFO L75 nceAwareModelManager]: Repository-Root is: /tmp [2025-04-13 18:06:46,038 INFO L261 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2025-04-13 18:06:46,040 INFO L217 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2025-04-13 18:06:46,041 INFO L270 PluginConnector]: Initializing CDTParser... [2025-04-13 18:06:46,041 INFO L274 PluginConnector]: CDTParser initialized [2025-04-13 18:06:46,042 INFO L431 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/../../../trunk/examples/svcomp/weaver/parallel-parallel-sum-equiv.wvr.c [2025-04-13 18:06:47,339 INFO L538 CDTParser]: Created temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/c6a72cbe6/4696d601d0694e758a3b5fa37649f992/FLAG04241d266 [2025-04-13 18:06:47,546 INFO L389 CDTParser]: Found 1 translation units. [2025-04-13 18:06:47,547 INFO L178 CDTParser]: Scanning /storage/repos/ultimate/trunk/examples/svcomp/weaver/parallel-parallel-sum-equiv.wvr.c [2025-04-13 18:06:47,552 INFO L432 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/c6a72cbe6/4696d601d0694e758a3b5fa37649f992/FLAG04241d266 [2025-04-13 18:06:48,341 INFO L440 CDTParser]: Successfully deleted /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/c6a72cbe6/4696d601d0694e758a3b5fa37649f992 [2025-04-13 18:06:48,344 INFO L299 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2025-04-13 18:06:48,347 INFO L133 ToolchainWalker]: Walking toolchain with 5 elements. [2025-04-13 18:06:48,348 INFO L112 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2025-04-13 18:06:48,348 INFO L270 PluginConnector]: Initializing CACSL2BoogieTranslator... [2025-04-13 18:06:48,357 INFO L274 PluginConnector]: CACSL2BoogieTranslator initialized [2025-04-13 18:06:48,358 INFO L184 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 13.04 06:06:48" (1/1) ... [2025-04-13 18:06:48,359 INFO L204 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@13c770db and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 13.04 06:06:48, skipping insertion in model container [2025-04-13 18:06:48,359 INFO L184 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 13.04 06:06:48" (1/1) ... [2025-04-13 18:06:48,373 INFO L175 MainTranslator]: Built tables and reachable declarations [2025-04-13 18:06:48,572 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/parallel-parallel-sum-equiv.wvr.c[3822,3835] [2025-04-13 18:06:48,584 INFO L210 PostProcessor]: Analyzing one entry point: main [2025-04-13 18:06:48,591 INFO L200 MainTranslator]: Completed pre-run [2025-04-13 18:06:48,616 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/parallel-parallel-sum-equiv.wvr.c[3822,3835] [2025-04-13 18:06:48,620 INFO L210 PostProcessor]: Analyzing one entry point: main [2025-04-13 18:06:48,631 INFO L204 MainTranslator]: Completed translation [2025-04-13 18:06:48,632 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 13.04 06:06:48 WrapperNode [2025-04-13 18:06:48,632 INFO L131 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2025-04-13 18:06:48,633 INFO L112 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2025-04-13 18:06:48,633 INFO L270 PluginConnector]: Initializing Boogie Procedure Inliner... [2025-04-13 18:06:48,633 INFO L274 PluginConnector]: Boogie Procedure Inliner initialized [2025-04-13 18:06:48,639 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 13.04 06:06:48" (1/1) ... [2025-04-13 18:06:48,649 INFO L184 PluginConnector]: Executing the observer Inliner from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 13.04 06:06:48" (1/1) ... [2025-04-13 18:06:48,682 INFO L138 Inliner]: procedures = 26, calls = 53, calls flagged for inlining = 18, calls inlined = 22, statements flattened = 245 [2025-04-13 18:06:48,682 INFO L131 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2025-04-13 18:06:48,683 INFO L112 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2025-04-13 18:06:48,683 INFO L270 PluginConnector]: Initializing Boogie Preprocessor... [2025-04-13 18:06:48,683 INFO L274 PluginConnector]: Boogie Preprocessor initialized [2025-04-13 18:06:48,690 INFO L184 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 13.04 06:06:48" (1/1) ... [2025-04-13 18:06:48,691 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 13.04 06:06:48" (1/1) ... [2025-04-13 18:06:48,698 INFO L184 PluginConnector]: Executing the observer MemorySlicer from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 13.04 06:06:48" (1/1) ... [2025-04-13 18:06:48,716 INFO L175 MemorySlicer]: Split 6 memory accesses to 2 slices as follows [2, 4]. 67 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 18:06:48,717 INFO L184 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 13.04 06:06:48" (1/1) ... [2025-04-13 18:06:48,717 INFO L184 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 13.04 06:06:48" (1/1) ... [2025-04-13 18:06:48,726 INFO L184 PluginConnector]: Executing the observer ReplaceArrayAssignments from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 13.04 06:06:48" (1/1) ... [2025-04-13 18:06:48,727 INFO L184 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 13.04 06:06:48" (1/1) ... [2025-04-13 18:06:48,733 INFO L184 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 13.04 06:06:48" (1/1) ... [2025-04-13 18:06:48,734 INFO L184 PluginConnector]: Executing the observer LTLStepAnnotator from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 13.04 06:06:48" (1/1) ... [2025-04-13 18:06:48,735 INFO L184 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 13.04 06:06:48" (1/1) ... [2025-04-13 18:06:48,742 INFO L131 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2025-04-13 18:06:48,743 INFO L112 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2025-04-13 18:06:48,743 INFO L270 PluginConnector]: Initializing RCFGBuilder... [2025-04-13 18:06:48,743 INFO L274 PluginConnector]: RCFGBuilder initialized [2025-04-13 18:06:48,744 INFO L184 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 13.04 06:06:48" (1/1) ... [2025-04-13 18:06:48,748 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2025-04-13 18:06:48,758 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2025-04-13 18:06:48,773 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 18:06:48,776 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 18:06:48,792 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocInit [2025-04-13 18:06:48,792 INFO L130 BoogieDeclarations]: Found specification of procedure write~int#0 [2025-04-13 18:06:48,792 INFO L130 BoogieDeclarations]: Found specification of procedure write~int#1 [2025-04-13 18:06:48,792 INFO L130 BoogieDeclarations]: Found specification of procedure read~int#0 [2025-04-13 18:06:48,792 INFO L130 BoogieDeclarations]: Found specification of procedure read~int#1 [2025-04-13 18:06:48,792 INFO L130 BoogieDeclarations]: Found specification of procedure thread1 [2025-04-13 18:06:48,792 INFO L138 BoogieDeclarations]: Found implementation of procedure thread1 [2025-04-13 18:06:48,792 INFO L130 BoogieDeclarations]: Found specification of procedure thread2 [2025-04-13 18:06:48,793 INFO L138 BoogieDeclarations]: Found implementation of procedure thread2 [2025-04-13 18:06:48,793 INFO L130 BoogieDeclarations]: Found specification of procedure thread3 [2025-04-13 18:06:48,793 INFO L138 BoogieDeclarations]: Found implementation of procedure thread3 [2025-04-13 18:06:48,793 INFO L130 BoogieDeclarations]: Found specification of procedure thread4 [2025-04-13 18:06:48,793 INFO L138 BoogieDeclarations]: Found implementation of procedure thread4 [2025-04-13 18:06:48,793 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int#0 [2025-04-13 18:06:48,793 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int#1 [2025-04-13 18:06:48,793 INFO L130 BoogieDeclarations]: Found specification of procedure __VERIFIER_atomic_end [2025-04-13 18:06:48,793 INFO L130 BoogieDeclarations]: Found specification of procedure __VERIFIER_atomic_begin [2025-04-13 18:06:48,793 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocOnHeap [2025-04-13 18:06:48,793 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2025-04-13 18:06:48,793 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2025-04-13 18:06:48,794 WARN L203 CfgBuilder]: User set CodeBlockSize to SequenceOfStatements but program contains fork statements. Overwriting the user preferences and setting CodeBlockSize to OneNontrivialStatement. [2025-04-13 18:06:48,889 INFO L234 CfgBuilder]: Building ICFG [2025-04-13 18:06:48,890 INFO L260 CfgBuilder]: Building CFG for each procedure with an implementation [2025-04-13 18:06:49,229 INFO L279 CfgBuilder]: Omitted future-live optimization because the input is a concurrent program. [2025-04-13 18:06:49,230 INFO L289 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2025-04-13 18:06:49,230 INFO L294 CfgBuilder]: Performing block encoding [2025-04-13 18:06:49,528 INFO L313 CfgBuilder]: Removed 3 assume(true) statements. [2025-04-13 18:06:49,529 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 13.04 06:06:49 BoogieIcfgContainer [2025-04-13 18:06:49,529 INFO L131 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2025-04-13 18:06:49,531 INFO L112 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2025-04-13 18:06:49,531 INFO L270 PluginConnector]: Initializing TraceAbstraction... [2025-04-13 18:06:49,535 INFO L274 PluginConnector]: TraceAbstraction initialized [2025-04-13 18:06:49,535 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 13.04 06:06:48" (1/3) ... [2025-04-13 18:06:49,536 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@6cd367bd and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 13.04 06:06:49, skipping insertion in model container [2025-04-13 18:06:49,536 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 13.04 06:06:48" (2/3) ... [2025-04-13 18:06:49,536 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@6cd367bd and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 13.04 06:06:49, skipping insertion in model container [2025-04-13 18:06:49,536 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 13.04 06:06:49" (3/3) ... [2025-04-13 18:06:49,537 INFO L128 eAbstractionObserver]: Analyzing ICFG parallel-parallel-sum-equiv.wvr.c [2025-04-13 18:06:49,549 INFO L217 ceAbstractionStarter]: Automizer settings: Hoare:LoopHeads NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2025-04-13 18:06:49,551 INFO L151 ceAbstractionStarter]: Applying trace abstraction to ICFG parallel-parallel-sum-equiv.wvr.c that has 5 procedures, 44 locations, 43 edges, 1 initial locations, 4 loop locations, and 1 error locations. [2025-04-13 18:06:49,551 INFO L490 ceAbstractionStarter]: Constructing petrified ICFG for 1 thread instances. [2025-04-13 18:06:49,613 INFO L143 ThreadInstanceAdder]: Constructed 10 joinOtherThreadTransitions. [2025-04-13 18:06:49,635 INFO L113 iNet2FiniteAutomaton]: Start petriNet2FiniteAutomaton. Operand has 59 places, 52 transitions, 144 flow [2025-04-13 18:06:49,769 INFO L135 iNet2FiniteAutomaton]: Finished petriNet2FiniteAutomaton. Result has 2263 states, 2262 states have (on average 3.8417329796640143) internal successors, (8690), 2262 states have internal predecessors, (8690), 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 18:06:49,806 INFO L339 AbstractCegarLoop]: ======== Iteration 0 == of CEGAR loop == AllErrorsAtOnce ======== [2025-04-13 18:06:49,821 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;@1c1f4d3e, mLbeIndependenceSettings=[IndependenceType=SEMANTIC, AbstractionType=NONE, UseConditional=false, UseSemiCommutativity=true, Solver=Z3, SolverTimeout=1000ms] [2025-04-13 18:06:49,821 INFO L341 AbstractCegarLoop]: Starting to check reachability of 7 error locations. [2025-04-13 18:06:49,836 INFO L278 IsEmpty]: Start isEmpty. Operand has 2263 states, 2262 states have (on average 3.8417329796640143) internal successors, (8690), 2262 states have internal predecessors, (8690), 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 18:06:49,921 INFO L284 IsEmpty]: Finished isEmpty. Found accepting run of length 33 [2025-04-13 18:06:49,921 INFO L210 NwaCegarLoop]: Found error trace [2025-04-13 18:06:49,922 INFO L218 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-04-13 18:06:49,922 INFO L403 AbstractCegarLoop]: === Iteration 1 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [thread1Err0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES, thread1Err3INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION (and 4 more)] === [2025-04-13 18:06:49,930 INFO L155 PredicateUnifier]: Initialized classic predicate unifier [2025-04-13 18:06:49,930 INFO L85 PathProgramCache]: Analyzing trace with hash 1191465682, now seen corresponding path program 1 times [2025-04-13 18:06:49,940 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-04-13 18:06:49,940 INFO L324 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [195436246] [2025-04-13 18:06:49,941 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-04-13 18:06:49,941 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-04-13 18:06:50,073 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 32 statements into 1 equivalence classes. [2025-04-13 18:06:50,140 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 32 of 32 statements. [2025-04-13 18:06:50,145 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-04-13 18:06:50,145 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-04-13 18:06:50,532 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 18:06:50,532 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-04-13 18:06:50,532 INFO L324 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [195436246] [2025-04-13 18:06:50,533 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [195436246] provided 1 perfect and 0 imperfect interpolant sequences [2025-04-13 18:06:50,533 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-04-13 18:06:50,533 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2025-04-13 18:06:50,534 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1353317850] [2025-04-13 18:06:50,534 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-04-13 18:06:50,541 INFO L562 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2025-04-13 18:06:50,541 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-04-13 18:06:50,568 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2025-04-13 18:06:50,569 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2025-04-13 18:06:50,583 INFO L87 Difference]: Start difference. First operand has 2263 states, 2262 states have (on average 3.8417329796640143) internal successors, (8690), 2262 states have internal predecessors, (8690), 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 4 states, 3 states have (on average 10.666666666666666) internal successors, (32), 4 states have internal predecessors, (32), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-04-13 18:06:51,170 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-04-13 18:06:51,171 INFO L93 Difference]: Finished difference Result 5255 states and 20382 transitions. [2025-04-13 18:06:51,176 INFO L140 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2025-04-13 18:06:51,177 INFO L79 Accepts]: Start accepts. Automaton has has 4 states, 3 states have (on average 10.666666666666666) internal successors, (32), 4 states have internal predecessors, (32), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 32 [2025-04-13 18:06:51,177 INFO L85 Accepts]: Finished accepts. some prefix is accepted. [2025-04-13 18:06:51,297 INFO L225 Difference]: With dead ends: 5255 [2025-04-13 18:06:51,301 INFO L226 Difference]: Without dead ends: 5112 [2025-04-13 18:06:51,312 INFO L436 NwaCegarLoop]: 0 DeclaredPredicates, 4 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=9, Invalid=11, Unknown=0, NotChecked=0, Total=20 [2025-04-13 18:06:51,319 INFO L437 NwaCegarLoop]: 5 mSDtfsCounter, 68 mSDsluCounter, 8 mSDsCounter, 0 mSdLazyCounter, 182 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 68 SdHoareTripleChecker+Valid, 13 SdHoareTripleChecker+Invalid, 182 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 182 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.3s IncrementalHoareTripleChecker+Time [2025-04-13 18:06:51,319 INFO L438 NwaCegarLoop]: SdHoareTripleChecker [68 Valid, 13 Invalid, 182 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 182 Invalid, 0 Unknown, 0 Unchecked, 0.3s Time] [2025-04-13 18:06:51,360 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 5112 states. [2025-04-13 18:06:51,610 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 5112 to 2694. [2025-04-13 18:06:51,618 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 2694 states, 2693 states have (on average 3.8362421091719274) internal successors, (10331), 2693 states have internal predecessors, (10331), 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 18:06:51,638 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 2694 states to 2694 states and 10331 transitions. [2025-04-13 18:06:51,651 INFO L79 Accepts]: Start accepts. Automaton has 2694 states and 10331 transitions. Word has length 32 [2025-04-13 18:06:51,656 INFO L85 Accepts]: Finished accepts. word is rejected. [2025-04-13 18:06:51,656 INFO L485 AbstractCegarLoop]: Abstraction has 2694 states and 10331 transitions. [2025-04-13 18:06:51,656 INFO L486 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 3 states have (on average 10.666666666666666) internal successors, (32), 4 states have internal predecessors, (32), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-04-13 18:06:51,656 INFO L278 IsEmpty]: Start isEmpty. Operand 2694 states and 10331 transitions. [2025-04-13 18:06:51,704 INFO L284 IsEmpty]: Finished isEmpty. Found accepting run of length 33 [2025-04-13 18:06:51,705 INFO L210 NwaCegarLoop]: Found error trace [2025-04-13 18:06:51,705 INFO L218 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-04-13 18:06:51,705 WARN L466 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable0 [2025-04-13 18:06:51,705 INFO L403 AbstractCegarLoop]: === Iteration 2 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [thread1Err0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES, thread1Err3INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION (and 4 more)] === [2025-04-13 18:06:51,706 INFO L155 PredicateUnifier]: Initialized classic predicate unifier [2025-04-13 18:06:51,706 INFO L85 PathProgramCache]: Analyzing trace with hash -1038461654, now seen corresponding path program 2 times [2025-04-13 18:06:51,706 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-04-13 18:06:51,706 INFO L324 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1604540589] [2025-04-13 18:06:51,706 INFO L95 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST1 [2025-04-13 18:06:51,706 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-04-13 18:06:51,732 INFO L108 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 partitioned 32 statements into 1 equivalence classes. [2025-04-13 18:06:51,760 INFO L111 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 issued 1 check-sat command(s) and asserted 32 of 32 statements. [2025-04-13 18:06:51,760 INFO L114 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 issued 1 check-sat command(s) [2025-04-13 18:06:51,760 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-04-13 18:06:51,933 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 18:06:51,933 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-04-13 18:06:51,933 INFO L324 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1604540589] [2025-04-13 18:06:51,933 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1604540589] provided 1 perfect and 0 imperfect interpolant sequences [2025-04-13 18:06:51,933 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-04-13 18:06:51,933 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2025-04-13 18:06:51,933 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1038108216] [2025-04-13 18:06:51,933 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-04-13 18:06:51,934 INFO L562 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2025-04-13 18:06:51,934 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-04-13 18:06:51,935 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2025-04-13 18:06:51,935 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2025-04-13 18:06:51,935 INFO L87 Difference]: Start difference. First operand 2694 states and 10331 transitions. Second operand has 4 states, 3 states have (on average 10.666666666666666) internal successors, (32), 4 states have internal predecessors, (32), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-04-13 18:06:52,465 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-04-13 18:06:52,466 INFO L93 Difference]: Finished difference Result 6294 states and 24391 transitions. [2025-04-13 18:06:52,466 INFO L140 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2025-04-13 18:06:52,466 INFO L79 Accepts]: Start accepts. Automaton has has 4 states, 3 states have (on average 10.666666666666666) internal successors, (32), 4 states have internal predecessors, (32), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 32 [2025-04-13 18:06:52,469 INFO L85 Accepts]: Finished accepts. some prefix is accepted. [2025-04-13 18:06:52,565 INFO L225 Difference]: With dead ends: 6294 [2025-04-13 18:06:52,565 INFO L226 Difference]: Without dead ends: 6151 [2025-04-13 18:06:52,573 INFO L436 NwaCegarLoop]: 0 DeclaredPredicates, 5 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=9, Invalid=11, Unknown=0, NotChecked=0, Total=20 [2025-04-13 18:06:52,574 INFO L437 NwaCegarLoop]: 6 mSDtfsCounter, 46 mSDsluCounter, 7 mSDsCounter, 0 mSdLazyCounter, 174 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 46 SdHoareTripleChecker+Valid, 13 SdHoareTripleChecker+Invalid, 174 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 174 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.2s IncrementalHoareTripleChecker+Time [2025-04-13 18:06:52,574 INFO L438 NwaCegarLoop]: SdHoareTripleChecker [46 Valid, 13 Invalid, 174 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 174 Invalid, 0 Unknown, 0 Unchecked, 0.2s Time] [2025-04-13 18:06:52,593 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 6151 states. [2025-04-13 18:06:52,844 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 6151 to 3074. [2025-04-13 18:06:52,851 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 3074 states, 3073 states have (on average 3.827855515782623) internal successors, (11763), 3073 states have internal predecessors, (11763), 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 18:06:52,870 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3074 states to 3074 states and 11763 transitions. [2025-04-13 18:06:52,878 INFO L79 Accepts]: Start accepts. Automaton has 3074 states and 11763 transitions. Word has length 32 [2025-04-13 18:06:52,879 INFO L85 Accepts]: Finished accepts. word is rejected. [2025-04-13 18:06:52,879 INFO L485 AbstractCegarLoop]: Abstraction has 3074 states and 11763 transitions. [2025-04-13 18:06:52,879 INFO L486 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 3 states have (on average 10.666666666666666) internal successors, (32), 4 states have internal predecessors, (32), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-04-13 18:06:52,879 INFO L278 IsEmpty]: Start isEmpty. Operand 3074 states and 11763 transitions. [2025-04-13 18:06:52,889 INFO L284 IsEmpty]: Finished isEmpty. Found accepting run of length 36 [2025-04-13 18:06:52,889 INFO L210 NwaCegarLoop]: Found error trace [2025-04-13 18:06:52,890 INFO L218 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-04-13 18:06:52,890 WARN L466 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable1 [2025-04-13 18:06:52,890 INFO L403 AbstractCegarLoop]: === Iteration 3 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [thread1Err0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES, thread1Err3INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION (and 4 more)] === [2025-04-13 18:06:52,894 INFO L155 PredicateUnifier]: Initialized classic predicate unifier [2025-04-13 18:06:52,894 INFO L85 PathProgramCache]: Analyzing trace with hash 1298374583, now seen corresponding path program 1 times [2025-04-13 18:06:52,894 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-04-13 18:06:52,894 INFO L324 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [682809550] [2025-04-13 18:06:52,894 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-04-13 18:06:52,894 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-04-13 18:06:52,910 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 35 statements into 1 equivalence classes. [2025-04-13 18:06:52,930 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 35 of 35 statements. [2025-04-13 18:06:52,930 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-04-13 18:06:52,930 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-04-13 18:06:53,103 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 18:06:53,103 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-04-13 18:06:53,103 INFO L324 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [682809550] [2025-04-13 18:06:53,104 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [682809550] provided 1 perfect and 0 imperfect interpolant sequences [2025-04-13 18:06:53,104 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-04-13 18:06:53,104 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2025-04-13 18:06:53,104 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [372375904] [2025-04-13 18:06:53,104 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-04-13 18:06:53,104 INFO L562 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2025-04-13 18:06:53,104 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-04-13 18:06:53,104 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2025-04-13 18:06:53,104 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=8, Invalid=12, Unknown=0, NotChecked=0, Total=20 [2025-04-13 18:06:53,105 INFO L87 Difference]: Start difference. First operand 3074 states and 11763 transitions. Second operand has 5 states, 5 states have (on average 7.0) internal successors, (35), 4 states have internal predecessors, (35), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-04-13 18:06:53,694 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-04-13 18:06:53,694 INFO L93 Difference]: Finished difference Result 7340 states and 28222 transitions. [2025-04-13 18:06:53,694 INFO L140 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2025-04-13 18:06:53,694 INFO L79 Accepts]: Start accepts. Automaton has has 5 states, 5 states have (on average 7.0) internal successors, (35), 4 states have internal predecessors, (35), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 35 [2025-04-13 18:06:53,694 INFO L85 Accepts]: Finished accepts. some prefix is accepted. [2025-04-13 18:06:53,804 INFO L225 Difference]: With dead ends: 7340 [2025-04-13 18:06:53,805 INFO L226 Difference]: Without dead ends: 5394 [2025-04-13 18:06:53,810 INFO L436 NwaCegarLoop]: 0 DeclaredPredicates, 4 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=8, Invalid=12, Unknown=0, NotChecked=0, Total=20 [2025-04-13 18:06:53,811 INFO L437 NwaCegarLoop]: 5 mSDtfsCounter, 66 mSDsluCounter, 11 mSDsCounter, 0 mSdLazyCounter, 204 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 66 SdHoareTripleChecker+Valid, 16 SdHoareTripleChecker+Invalid, 204 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 204 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.3s IncrementalHoareTripleChecker+Time [2025-04-13 18:06:53,811 INFO L438 NwaCegarLoop]: SdHoareTripleChecker [66 Valid, 16 Invalid, 204 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 204 Invalid, 0 Unknown, 0 Unchecked, 0.3s Time] [2025-04-13 18:06:53,820 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 5394 states. [2025-04-13 18:06:54,027 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 5394 to 4399. [2025-04-13 18:06:54,055 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 4399 states, 4398 states have (on average 3.813324238290132) internal successors, (16771), 4398 states have internal predecessors, (16771), 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 18:06:54,094 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4399 states to 4399 states and 16771 transitions. [2025-04-13 18:06:54,103 INFO L79 Accepts]: Start accepts. Automaton has 4399 states and 16771 transitions. Word has length 35 [2025-04-13 18:06:54,104 INFO L85 Accepts]: Finished accepts. word is rejected. [2025-04-13 18:06:54,104 INFO L485 AbstractCegarLoop]: Abstraction has 4399 states and 16771 transitions. [2025-04-13 18:06:54,104 INFO L486 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 7.0) internal successors, (35), 4 states have internal predecessors, (35), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-04-13 18:06:54,104 INFO L278 IsEmpty]: Start isEmpty. Operand 4399 states and 16771 transitions. [2025-04-13 18:06:54,116 INFO L284 IsEmpty]: Finished isEmpty. Found accepting run of length 36 [2025-04-13 18:06:54,116 INFO L210 NwaCegarLoop]: Found error trace [2025-04-13 18:06:54,117 INFO L218 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-04-13 18:06:54,117 WARN L466 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable2 [2025-04-13 18:06:54,117 INFO L403 AbstractCegarLoop]: === Iteration 4 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [thread1Err0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES, thread1Err3INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION (and 4 more)] === [2025-04-13 18:06:54,118 INFO L155 PredicateUnifier]: Initialized classic predicate unifier [2025-04-13 18:06:54,118 INFO L85 PathProgramCache]: Analyzing trace with hash 1273387272, now seen corresponding path program 1 times [2025-04-13 18:06:54,118 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-04-13 18:06:54,118 INFO L324 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [9188866] [2025-04-13 18:06:54,118 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-04-13 18:06:54,118 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-04-13 18:06:54,130 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 35 statements into 1 equivalence classes. [2025-04-13 18:06:54,144 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 35 of 35 statements. [2025-04-13 18:06:54,145 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-04-13 18:06:54,145 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-04-13 18:06:54,340 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 18:06:54,341 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-04-13 18:06:54,341 INFO L324 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [9188866] [2025-04-13 18:06:54,341 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [9188866] provided 1 perfect and 0 imperfect interpolant sequences [2025-04-13 18:06:54,341 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-04-13 18:06:54,341 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2025-04-13 18:06:54,341 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1187972859] [2025-04-13 18:06:54,341 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-04-13 18:06:54,344 INFO L562 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2025-04-13 18:06:54,344 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-04-13 18:06:54,344 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2025-04-13 18:06:54,345 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=8, Invalid=12, Unknown=0, NotChecked=0, Total=20 [2025-04-13 18:06:54,345 INFO L87 Difference]: Start difference. First operand 4399 states and 16771 transitions. Second operand has 5 states, 5 states have (on average 7.0) internal successors, (35), 4 states have internal predecessors, (35), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-04-13 18:06:54,750 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-04-13 18:06:54,750 INFO L93 Difference]: Finished difference Result 5744 states and 21639 transitions. [2025-04-13 18:06:54,751 INFO L140 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2025-04-13 18:06:54,751 INFO L79 Accepts]: Start accepts. Automaton has has 5 states, 5 states have (on average 7.0) internal successors, (35), 4 states have internal predecessors, (35), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 35 [2025-04-13 18:06:54,751 INFO L85 Accepts]: Finished accepts. some prefix is accepted. [2025-04-13 18:06:54,783 INFO L225 Difference]: With dead ends: 5744 [2025-04-13 18:06:54,783 INFO L226 Difference]: Without dead ends: 3075 [2025-04-13 18:06:54,793 INFO L436 NwaCegarLoop]: 0 DeclaredPredicates, 4 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=8, Invalid=12, Unknown=0, NotChecked=0, Total=20 [2025-04-13 18:06:54,796 INFO L437 NwaCegarLoop]: 4 mSDtfsCounter, 28 mSDsluCounter, 8 mSDsCounter, 0 mSdLazyCounter, 146 mSolverCounterSat, 1 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 28 SdHoareTripleChecker+Valid, 12 SdHoareTripleChecker+Invalid, 147 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 1 IncrementalHoareTripleChecker+Valid, 146 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.2s IncrementalHoareTripleChecker+Time [2025-04-13 18:06:54,797 INFO L438 NwaCegarLoop]: SdHoareTripleChecker [28 Valid, 12 Invalid, 147 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [1 Valid, 146 Invalid, 0 Unknown, 0 Unchecked, 0.2s Time] [2025-04-13 18:06:54,807 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 3075 states. [2025-04-13 18:06:54,950 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 3075 to 3075. [2025-04-13 18:06:54,972 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 3075 states, 3074 states have (on average 3.826935588809369) internal successors, (11764), 3074 states have internal predecessors, (11764), 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 18:06:55,000 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3075 states to 3075 states and 11764 transitions. [2025-04-13 18:06:55,009 INFO L79 Accepts]: Start accepts. Automaton has 3075 states and 11764 transitions. Word has length 35 [2025-04-13 18:06:55,009 INFO L85 Accepts]: Finished accepts. word is rejected. [2025-04-13 18:06:55,009 INFO L485 AbstractCegarLoop]: Abstraction has 3075 states and 11764 transitions. [2025-04-13 18:06:55,009 INFO L486 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 7.0) internal successors, (35), 4 states have internal predecessors, (35), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-04-13 18:06:55,012 INFO L278 IsEmpty]: Start isEmpty. Operand 3075 states and 11764 transitions. [2025-04-13 18:06:55,031 INFO L284 IsEmpty]: Finished isEmpty. Found accepting run of length 37 [2025-04-13 18:06:55,032 INFO L210 NwaCegarLoop]: Found error trace [2025-04-13 18:06:55,032 INFO L218 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-04-13 18:06:55,032 WARN L466 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable3 [2025-04-13 18:06:55,032 INFO L403 AbstractCegarLoop]: === Iteration 5 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [thread1Err0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES, thread1Err3INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION (and 4 more)] === [2025-04-13 18:06:55,033 INFO L155 PredicateUnifier]: Initialized classic predicate unifier [2025-04-13 18:06:55,033 INFO L85 PathProgramCache]: Analyzing trace with hash -494671412, now seen corresponding path program 1 times [2025-04-13 18:06:55,033 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-04-13 18:06:55,033 INFO L324 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1719050011] [2025-04-13 18:06:55,033 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-04-13 18:06:55,033 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-04-13 18:06:55,052 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 36 statements into 1 equivalence classes. [2025-04-13 18:06:55,069 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 36 of 36 statements. [2025-04-13 18:06:55,070 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-04-13 18:06:55,070 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-04-13 18:06:55,271 INFO L134 CoverageAnalysis]: Checked inductivity of 2 backedges. 1 proven. 1 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-04-13 18:06:55,271 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-04-13 18:06:55,271 INFO L324 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1719050011] [2025-04-13 18:06:55,272 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1719050011] provided 0 perfect and 1 imperfect interpolant sequences [2025-04-13 18:06:55,272 INFO L324 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [2038645802] [2025-04-13 18:06:55,272 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-04-13 18:06:55,272 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-04-13 18:06:55,272 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2025-04-13 18:06:55,275 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 18:06:55,276 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 18:06:55,384 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 36 statements into 1 equivalence classes. [2025-04-13 18:06:55,426 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 36 of 36 statements. [2025-04-13 18:06:55,427 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-04-13 18:06:55,427 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-04-13 18:06:55,433 INFO L256 TraceCheckSpWp]: Trace formula consists of 242 conjuncts, 7 conjuncts are in the unsatisfiable core [2025-04-13 18:06:55,436 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-04-13 18:06:55,547 INFO L134 CoverageAnalysis]: Checked inductivity of 2 backedges. 1 proven. 1 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-04-13 18:06:55,547 INFO L312 TraceCheckSpWp]: Computing backward predicates... [2025-04-13 18:06:55,629 INFO L134 CoverageAnalysis]: Checked inductivity of 2 backedges. 1 proven. 1 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-04-13 18:06:55,629 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [2038645802] provided 0 perfect and 2 imperfect interpolant sequences [2025-04-13 18:06:55,629 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2025-04-13 18:06:55,629 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [5, 5, 5] total 11 [2025-04-13 18:06:55,629 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1850798620] [2025-04-13 18:06:55,630 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2025-04-13 18:06:55,630 INFO L562 AbstractCegarLoop]: INTERPOLANT automaton has 12 states [2025-04-13 18:06:55,630 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-04-13 18:06:55,630 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 12 interpolants. [2025-04-13 18:06:55,630 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=45, Invalid=87, Unknown=0, NotChecked=0, Total=132 [2025-04-13 18:06:55,630 INFO L87 Difference]: Start difference. First operand 3075 states and 11764 transitions. Second operand has 12 states, 12 states have (on average 4.0) internal successors, (48), 11 states have internal predecessors, (48), 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 18:06:56,388 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-04-13 18:06:56,389 INFO L93 Difference]: Finished difference Result 7341 states and 28223 transitions. [2025-04-13 18:06:56,389 INFO L140 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2025-04-13 18:06:56,389 INFO L79 Accepts]: Start accepts. Automaton has has 12 states, 12 states have (on average 4.0) internal successors, (48), 11 states have internal predecessors, (48), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 36 [2025-04-13 18:06:56,390 INFO L85 Accepts]: Finished accepts. some prefix is accepted. [2025-04-13 18:06:56,441 INFO L225 Difference]: With dead ends: 7341 [2025-04-13 18:06:56,441 INFO L226 Difference]: Without dead ends: 5395 [2025-04-13 18:06:56,454 INFO L436 NwaCegarLoop]: 0 DeclaredPredicates, 75 GetRequests, 64 SyntacticMatches, 1 SemanticMatches, 10 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 38 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=45, Invalid=87, Unknown=0, NotChecked=0, Total=132 [2025-04-13 18:06:56,455 INFO L437 NwaCegarLoop]: 5 mSDtfsCounter, 196 mSDsluCounter, 18 mSDsCounter, 0 mSdLazyCounter, 302 mSolverCounterSat, 1 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.3s Time, 0 mProtectedPredicate, 0 mProtectedAction, 196 SdHoareTripleChecker+Valid, 23 SdHoareTripleChecker+Invalid, 303 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 1 IncrementalHoareTripleChecker+Valid, 302 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.5s IncrementalHoareTripleChecker+Time [2025-04-13 18:06:56,455 INFO L438 NwaCegarLoop]: SdHoareTripleChecker [196 Valid, 23 Invalid, 303 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [1 Valid, 302 Invalid, 0 Unknown, 0 Unchecked, 0.5s Time] [2025-04-13 18:06:56,469 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 5395 states. [2025-04-13 18:06:56,699 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 5395 to 4400. [2025-04-13 18:06:56,721 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 4400 states, 4399 states have (on average 3.8126847010684246) internal successors, (16772), 4399 states have internal predecessors, (16772), 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 18:06:56,745 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4400 states to 4400 states and 16772 transitions. [2025-04-13 18:06:56,752 INFO L79 Accepts]: Start accepts. Automaton has 4400 states and 16772 transitions. Word has length 36 [2025-04-13 18:06:56,753 INFO L85 Accepts]: Finished accepts. word is rejected. [2025-04-13 18:06:56,754 INFO L485 AbstractCegarLoop]: Abstraction has 4400 states and 16772 transitions. [2025-04-13 18:06:56,754 INFO L486 AbstractCegarLoop]: INTERPOLANT automaton has has 12 states, 12 states have (on average 4.0) internal successors, (48), 11 states have internal predecessors, (48), 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 18:06:56,754 INFO L278 IsEmpty]: Start isEmpty. Operand 4400 states and 16772 transitions. [2025-04-13 18:06:56,765 INFO L284 IsEmpty]: Finished isEmpty. Found accepting run of length 37 [2025-04-13 18:06:56,765 INFO L210 NwaCegarLoop]: Found error trace [2025-04-13 18:06:56,765 INFO L218 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-04-13 18:06:56,772 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (2)] Forceful destruction successful, exit code 0 [2025-04-13 18:06:56,969 WARN L466 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable4,2 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-04-13 18:06:56,969 INFO L403 AbstractCegarLoop]: === Iteration 6 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [thread1Err0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES, thread1Err3INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION (and 4 more)] === [2025-04-13 18:06:56,969 INFO L155 PredicateUnifier]: Initialized classic predicate unifier [2025-04-13 18:06:56,970 INFO L85 PathProgramCache]: Analyzing trace with hash -519658723, now seen corresponding path program 1 times [2025-04-13 18:06:56,970 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-04-13 18:06:56,970 INFO L324 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1383749153] [2025-04-13 18:06:56,970 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-04-13 18:06:56,970 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-04-13 18:06:56,977 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 36 statements into 1 equivalence classes. [2025-04-13 18:06:56,985 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 36 of 36 statements. [2025-04-13 18:06:56,985 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-04-13 18:06:56,985 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-04-13 18:06:57,110 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 18:06:57,110 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-04-13 18:06:57,110 INFO L324 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1383749153] [2025-04-13 18:06:57,110 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1383749153] provided 0 perfect and 1 imperfect interpolant sequences [2025-04-13 18:06:57,110 INFO L324 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1273929007] [2025-04-13 18:06:57,110 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-04-13 18:06:57,110 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-04-13 18:06:57,111 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2025-04-13 18:06:57,114 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 18:06:57,115 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 18:06:57,176 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 36 statements into 1 equivalence classes. [2025-04-13 18:06:57,206 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 36 of 36 statements. [2025-04-13 18:06:57,206 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-04-13 18:06:57,206 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-04-13 18:06:57,207 INFO L256 TraceCheckSpWp]: Trace formula consists of 242 conjuncts, 7 conjuncts are in the unsatisfiable core [2025-04-13 18:06:57,208 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-04-13 18:06:57,280 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 18:06:57,280 INFO L312 TraceCheckSpWp]: Computing backward predicates... [2025-04-13 18:06:57,336 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 18:06:57,336 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1273929007] provided 0 perfect and 2 imperfect interpolant sequences [2025-04-13 18:06:57,336 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2025-04-13 18:06:57,336 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [5, 5, 5] total 11 [2025-04-13 18:06:57,337 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1590480525] [2025-04-13 18:06:57,337 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2025-04-13 18:06:57,337 INFO L562 AbstractCegarLoop]: INTERPOLANT automaton has 12 states [2025-04-13 18:06:57,337 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-04-13 18:06:57,337 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 12 interpolants. [2025-04-13 18:06:57,337 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=45, Invalid=87, Unknown=0, NotChecked=0, Total=132 [2025-04-13 18:06:57,337 INFO L87 Difference]: Start difference. First operand 4400 states and 16772 transitions. Second operand has 12 states, 12 states have (on average 5.0) internal successors, (60), 11 states have internal predecessors, (60), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-04-13 18:06:57,646 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-04-13 18:06:57,646 INFO L93 Difference]: Finished difference Result 6326 states and 23823 transitions. [2025-04-13 18:06:57,647 INFO L140 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2025-04-13 18:06:57,647 INFO L79 Accepts]: Start accepts. Automaton has has 12 states, 12 states have (on average 5.0) internal successors, (60), 11 states have internal predecessors, (60), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 36 [2025-04-13 18:06:57,647 INFO L85 Accepts]: Finished accepts. some prefix is accepted. [2025-04-13 18:06:57,663 INFO L225 Difference]: With dead ends: 6326 [2025-04-13 18:06:57,663 INFO L226 Difference]: Without dead ends: 2782 [2025-04-13 18:06:57,670 INFO L436 NwaCegarLoop]: 0 DeclaredPredicates, 75 GetRequests, 64 SyntacticMatches, 1 SemanticMatches, 10 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 38 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=45, Invalid=87, Unknown=0, NotChecked=0, Total=132 [2025-04-13 18:06:57,670 INFO L437 NwaCegarLoop]: 4 mSDtfsCounter, 55 mSDsluCounter, 21 mSDsCounter, 0 mSdLazyCounter, 280 mSolverCounterSat, 4 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 55 SdHoareTripleChecker+Valid, 25 SdHoareTripleChecker+Invalid, 284 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 4 IncrementalHoareTripleChecker+Valid, 280 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.2s IncrementalHoareTripleChecker+Time [2025-04-13 18:06:57,671 INFO L438 NwaCegarLoop]: SdHoareTripleChecker [55 Valid, 25 Invalid, 284 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [4 Valid, 280 Invalid, 0 Unknown, 0 Unchecked, 0.2s Time] [2025-04-13 18:06:57,676 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 2782 states. [2025-04-13 18:06:57,749 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 2782 to 2782. [2025-04-13 18:06:57,754 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 2782 states, 2781 states have (on average 3.725638259618842) internal successors, (10361), 2781 states have internal predecessors, (10361), 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 18:06:57,763 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 2782 states to 2782 states and 10361 transitions. [2025-04-13 18:06:57,770 INFO L79 Accepts]: Start accepts. Automaton has 2782 states and 10361 transitions. Word has length 36 [2025-04-13 18:06:57,770 INFO L85 Accepts]: Finished accepts. word is rejected. [2025-04-13 18:06:57,770 INFO L485 AbstractCegarLoop]: Abstraction has 2782 states and 10361 transitions. [2025-04-13 18:06:57,770 INFO L486 AbstractCegarLoop]: INTERPOLANT automaton has has 12 states, 12 states have (on average 5.0) internal successors, (60), 11 states have internal predecessors, (60), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-04-13 18:06:57,770 INFO L278 IsEmpty]: Start isEmpty. Operand 2782 states and 10361 transitions. [2025-04-13 18:06:57,777 INFO L284 IsEmpty]: Finished isEmpty. Found accepting run of length 38 [2025-04-13 18:06:57,777 INFO L210 NwaCegarLoop]: Found error trace [2025-04-13 18:06:57,777 INFO L218 NwaCegarLoop]: trace histogram [2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-04-13 18:06:57,784 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 18:06:57,978 WARN L466 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 3 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable5 [2025-04-13 18:06:57,978 INFO L403 AbstractCegarLoop]: === Iteration 7 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [thread1Err0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES, thread1Err3INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION (and 4 more)] === [2025-04-13 18:06:57,979 INFO L155 PredicateUnifier]: Initialized classic predicate unifier [2025-04-13 18:06:57,979 INFO L85 PathProgramCache]: Analyzing trace with hash -244522409, now seen corresponding path program 2 times [2025-04-13 18:06:57,979 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-04-13 18:06:57,979 INFO L324 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [359267800] [2025-04-13 18:06:57,979 INFO L95 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST1 [2025-04-13 18:06:57,979 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-04-13 18:06:57,993 INFO L108 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 partitioned 37 statements into 2 equivalence classes. [2025-04-13 18:06:58,009 INFO L111 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) and asserted 37 of 37 statements. [2025-04-13 18:06:58,010 INFO L114 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) [2025-04-13 18:06:58,010 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-04-13 18:06:58,105 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 18:06:58,105 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-04-13 18:06:58,106 INFO L324 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [359267800] [2025-04-13 18:06:58,106 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [359267800] provided 0 perfect and 1 imperfect interpolant sequences [2025-04-13 18:06:58,106 INFO L324 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1611117451] [2025-04-13 18:06:58,106 INFO L95 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST1 [2025-04-13 18:06:58,106 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-04-13 18:06:58,106 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2025-04-13 18:06:58,109 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 18:06:58,109 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 18:06:58,165 INFO L108 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 partitioned 37 statements into 2 equivalence classes. [2025-04-13 18:06:58,188 INFO L111 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) and asserted 37 of 37 statements. [2025-04-13 18:06:58,188 INFO L114 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) [2025-04-13 18:06:58,188 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-04-13 18:06:58,189 INFO L256 TraceCheckSpWp]: Trace formula consists of 251 conjuncts, 7 conjuncts are in the unsatisfiable core [2025-04-13 18:06:58,190 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-04-13 18:06:58,251 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 18:06:58,252 INFO L312 TraceCheckSpWp]: Computing backward predicates... [2025-04-13 18:06:58,305 INFO L134 CoverageAnalysis]: Checked inductivity of 4 backedges. 3 proven. 0 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2025-04-13 18:06:58,305 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1611117451] provided 1 perfect and 1 imperfect interpolant sequences [2025-04-13 18:06:58,305 INFO L185 FreeRefinementEngine]: Found 1 perfect and 2 imperfect interpolant sequences. [2025-04-13 18:06:58,305 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [5, 5] total 11 [2025-04-13 18:06:58,306 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1007805285] [2025-04-13 18:06:58,306 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-04-13 18:06:58,306 INFO L562 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2025-04-13 18:06:58,306 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-04-13 18:06:58,306 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2025-04-13 18:06:58,306 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=42, Invalid=90, Unknown=0, NotChecked=0, Total=132 [2025-04-13 18:06:58,306 INFO L87 Difference]: Start difference. First operand 2782 states and 10361 transitions. Second operand has 6 states, 6 states have (on average 6.166666666666667) internal successors, (37), 5 states have internal predecessors, (37), 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 18:06:58,425 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-04-13 18:06:58,425 INFO L93 Difference]: Finished difference Result 3834 states and 14367 transitions. [2025-04-13 18:06:58,425 INFO L140 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2025-04-13 18:06:58,426 INFO L79 Accepts]: Start accepts. Automaton has has 6 states, 6 states have (on average 6.166666666666667) internal successors, (37), 5 states have internal predecessors, (37), 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 37 [2025-04-13 18:06:58,426 INFO L85 Accepts]: Finished accepts. some prefix is accepted. [2025-04-13 18:06:58,440 INFO L225 Difference]: With dead ends: 3834 [2025-04-13 18:06:58,440 INFO L226 Difference]: Without dead ends: 2923 [2025-04-13 18:06:58,442 INFO L436 NwaCegarLoop]: 0 DeclaredPredicates, 79 GetRequests, 67 SyntacticMatches, 1 SemanticMatches, 11 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 27 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=50, Invalid=106, Unknown=0, NotChecked=0, Total=156 [2025-04-13 18:06:58,443 INFO L437 NwaCegarLoop]: 4 mSDtfsCounter, 132 mSDsluCounter, 3 mSDsCounter, 0 mSdLazyCounter, 95 mSolverCounterSat, 1 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 132 SdHoareTripleChecker+Valid, 7 SdHoareTripleChecker+Invalid, 96 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 1 IncrementalHoareTripleChecker+Valid, 95 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2025-04-13 18:06:58,443 INFO L438 NwaCegarLoop]: SdHoareTripleChecker [132 Valid, 7 Invalid, 96 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [1 Valid, 95 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2025-04-13 18:06:58,446 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 2923 states. [2025-04-13 18:06:58,516 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 2923 to 2427. [2025-04-13 18:06:58,520 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 2427 states, 2426 states have (on average 3.760923330585326) internal successors, (9124), 2426 states have internal predecessors, (9124), 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 18:06:58,525 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 2427 states to 2427 states and 9124 transitions. [2025-04-13 18:06:58,529 INFO L79 Accepts]: Start accepts. Automaton has 2427 states and 9124 transitions. Word has length 37 [2025-04-13 18:06:58,529 INFO L85 Accepts]: Finished accepts. word is rejected. [2025-04-13 18:06:58,529 INFO L485 AbstractCegarLoop]: Abstraction has 2427 states and 9124 transitions. [2025-04-13 18:06:58,529 INFO L486 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 6 states have (on average 6.166666666666667) internal successors, (37), 5 states have internal predecessors, (37), 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 18:06:58,529 INFO L278 IsEmpty]: Start isEmpty. Operand 2427 states and 9124 transitions. [2025-04-13 18:06:58,534 INFO L284 IsEmpty]: Finished isEmpty. Found accepting run of length 38 [2025-04-13 18:06:58,534 INFO L210 NwaCegarLoop]: Found error trace [2025-04-13 18:06:58,534 INFO L218 NwaCegarLoop]: trace histogram [2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-04-13 18:06:58,541 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 18:06:58,735 WARN L466 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable6,4 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-04-13 18:06:58,735 INFO L403 AbstractCegarLoop]: === Iteration 8 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [thread1Err0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES, thread1Err3INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION (and 4 more)] === [2025-04-13 18:06:58,735 INFO L155 PredicateUnifier]: Initialized classic predicate unifier [2025-04-13 18:06:58,736 INFO L85 PathProgramCache]: Analyzing trace with hash -269509720, now seen corresponding path program 2 times [2025-04-13 18:06:58,736 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-04-13 18:06:58,736 INFO L324 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [821719868] [2025-04-13 18:06:58,736 INFO L95 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST1 [2025-04-13 18:06:58,736 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-04-13 18:06:58,744 INFO L108 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 partitioned 37 statements into 2 equivalence classes. [2025-04-13 18:06:58,751 INFO L111 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 issued 1 check-sat command(s) and asserted 35 of 37 statements. [2025-04-13 18:06:58,751 INFO L114 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 issued 1 check-sat command(s) [2025-04-13 18:06:58,751 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-04-13 18:06:58,804 INFO L134 CoverageAnalysis]: Checked inductivity of 3 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 3 trivial. 0 not checked. [2025-04-13 18:06:58,804 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-04-13 18:06:58,804 INFO L324 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [821719868] [2025-04-13 18:06:58,804 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [821719868] provided 1 perfect and 0 imperfect interpolant sequences [2025-04-13 18:06:58,804 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-04-13 18:06:58,804 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2025-04-13 18:06:58,804 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1941964554] [2025-04-13 18:06:58,805 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-04-13 18:06:58,805 INFO L562 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2025-04-13 18:06:58,805 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-04-13 18:06:58,805 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2025-04-13 18:06:58,805 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=8, Invalid=12, Unknown=0, NotChecked=0, Total=20 [2025-04-13 18:06:58,805 INFO L87 Difference]: Start difference. First operand 2427 states and 9124 transitions. Second operand has 5 states, 5 states have (on average 7.2) internal successors, (36), 5 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 18:06:59,008 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-04-13 18:06:59,008 INFO L93 Difference]: Finished difference Result 4370 states and 16259 transitions. [2025-04-13 18:06:59,009 INFO L140 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2025-04-13 18:06:59,009 INFO L79 Accepts]: Start accepts. Automaton has has 5 states, 5 states have (on average 7.2) internal successors, (36), 5 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 37 [2025-04-13 18:06:59,009 INFO L85 Accepts]: Finished accepts. some prefix is accepted. [2025-04-13 18:06:59,024 INFO L225 Difference]: With dead ends: 4370 [2025-04-13 18:06:59,024 INFO L226 Difference]: Without dead ends: 3766 [2025-04-13 18:06:59,026 INFO L436 NwaCegarLoop]: 0 DeclaredPredicates, 7 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 5 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=18, Invalid=24, Unknown=0, NotChecked=0, Total=42 [2025-04-13 18:06:59,026 INFO L437 NwaCegarLoop]: 7 mSDtfsCounter, 70 mSDsluCounter, 10 mSDsCounter, 0 mSdLazyCounter, 231 mSolverCounterSat, 1 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 70 SdHoareTripleChecker+Valid, 17 SdHoareTripleChecker+Invalid, 232 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 1 IncrementalHoareTripleChecker+Valid, 231 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2025-04-13 18:06:59,026 INFO L438 NwaCegarLoop]: SdHoareTripleChecker [70 Valid, 17 Invalid, 232 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [1 Valid, 231 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2025-04-13 18:06:59,031 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 3766 states. [2025-04-13 18:06:59,084 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 3766 to 2435. [2025-04-13 18:06:59,087 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 2435 states, 2434 states have (on average 3.7567789646672143) internal successors, (9144), 2434 states have internal predecessors, (9144), 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 18:06:59,091 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 2435 states to 2435 states and 9144 transitions. [2025-04-13 18:06:59,097 INFO L79 Accepts]: Start accepts. Automaton has 2435 states and 9144 transitions. Word has length 37 [2025-04-13 18:06:59,097 INFO L85 Accepts]: Finished accepts. word is rejected. [2025-04-13 18:06:59,097 INFO L485 AbstractCegarLoop]: Abstraction has 2435 states and 9144 transitions. [2025-04-13 18:06:59,097 INFO L486 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 7.2) internal successors, (36), 5 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 18:06:59,098 INFO L278 IsEmpty]: Start isEmpty. Operand 2435 states and 9144 transitions. [2025-04-13 18:06:59,102 INFO L284 IsEmpty]: Finished isEmpty. Found accepting run of length 38 [2025-04-13 18:06:59,102 INFO L210 NwaCegarLoop]: Found error trace [2025-04-13 18:06:59,102 INFO L218 NwaCegarLoop]: trace histogram [2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-04-13 18:06:59,102 WARN L466 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable7 [2025-04-13 18:06:59,102 INFO L403 AbstractCegarLoop]: === Iteration 9 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [thread1Err0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES, thread1Err3INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION (and 4 more)] === [2025-04-13 18:06:59,102 INFO L155 PredicateUnifier]: Initialized classic predicate unifier [2025-04-13 18:06:59,102 INFO L85 PathProgramCache]: Analyzing trace with hash 1999469538, now seen corresponding path program 3 times [2025-04-13 18:06:59,102 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-04-13 18:06:59,102 INFO L324 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1685209847] [2025-04-13 18:06:59,102 INFO L95 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST2 [2025-04-13 18:06:59,102 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-04-13 18:06:59,109 INFO L108 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST2 partitioned 37 statements into 2 equivalence classes. [2025-04-13 18:06:59,120 INFO L111 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST2 issued 2 check-sat command(s) and asserted 37 of 37 statements. [2025-04-13 18:06:59,120 INFO L114 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST2 issued 2 check-sat command(s) [2025-04-13 18:06:59,120 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-04-13 18:06:59,185 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 18:06:59,186 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-04-13 18:06:59,186 INFO L324 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1685209847] [2025-04-13 18:06:59,186 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1685209847] provided 0 perfect and 1 imperfect interpolant sequences [2025-04-13 18:06:59,186 INFO L324 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1738926454] [2025-04-13 18:06:59,186 INFO L95 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST2 [2025-04-13 18:06:59,186 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-04-13 18:06:59,186 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2025-04-13 18:06:59,188 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 18:06:59,189 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 18:06:59,239 INFO L108 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST2 partitioned 37 statements into 2 equivalence classes. [2025-04-13 18:06:59,262 INFO L111 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST2 issued 2 check-sat command(s) and asserted 37 of 37 statements. [2025-04-13 18:06:59,262 INFO L114 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST2 issued 2 check-sat command(s) [2025-04-13 18:06:59,262 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-04-13 18:06:59,264 INFO L256 TraceCheckSpWp]: Trace formula consists of 251 conjuncts, 7 conjuncts are in the unsatisfiable core [2025-04-13 18:06:59,277 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-04-13 18:06:59,326 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 18:06:59,326 INFO L312 TraceCheckSpWp]: Computing backward predicates... [2025-04-13 18:06:59,375 INFO L134 CoverageAnalysis]: Checked inductivity of 4 backedges. 3 proven. 0 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2025-04-13 18:06:59,375 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1738926454] provided 1 perfect and 1 imperfect interpolant sequences [2025-04-13 18:06:59,375 INFO L185 FreeRefinementEngine]: Found 1 perfect and 2 imperfect interpolant sequences. [2025-04-13 18:06:59,375 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [5, 5] total 11 [2025-04-13 18:06:59,376 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [216685929] [2025-04-13 18:06:59,376 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-04-13 18:06:59,376 INFO L562 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2025-04-13 18:06:59,376 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-04-13 18:06:59,376 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2025-04-13 18:06:59,376 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=42, Invalid=90, Unknown=0, NotChecked=0, Total=132 [2025-04-13 18:06:59,376 INFO L87 Difference]: Start difference. First operand 2435 states and 9144 transitions. Second operand has 6 states, 6 states have (on average 6.166666666666667) internal successors, (37), 5 states have internal predecessors, (37), 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 18:06:59,513 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-04-13 18:06:59,513 INFO L93 Difference]: Finished difference Result 3766 states and 14246 transitions. [2025-04-13 18:06:59,514 INFO L140 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2025-04-13 18:06:59,514 INFO L79 Accepts]: Start accepts. Automaton has has 6 states, 6 states have (on average 6.166666666666667) internal successors, (37), 5 states have internal predecessors, (37), 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 37 [2025-04-13 18:06:59,514 INFO L85 Accepts]: Finished accepts. some prefix is accepted. [2025-04-13 18:06:59,526 INFO L225 Difference]: With dead ends: 3766 [2025-04-13 18:06:59,526 INFO L226 Difference]: Without dead ends: 2965 [2025-04-13 18:06:59,528 INFO L436 NwaCegarLoop]: 0 DeclaredPredicates, 78 GetRequests, 66 SyntacticMatches, 1 SemanticMatches, 11 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 27 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=50, Invalid=106, Unknown=0, NotChecked=0, Total=156 [2025-04-13 18:06:59,530 INFO L437 NwaCegarLoop]: 5 mSDtfsCounter, 66 mSDsluCounter, 3 mSDsCounter, 0 mSdLazyCounter, 114 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 66 SdHoareTripleChecker+Valid, 8 SdHoareTripleChecker+Invalid, 114 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 114 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2025-04-13 18:06:59,530 INFO L438 NwaCegarLoop]: SdHoareTripleChecker [66 Valid, 8 Invalid, 114 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 114 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2025-04-13 18:06:59,534 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 2965 states. [2025-04-13 18:06:59,594 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 2965 to 2696. [2025-04-13 18:06:59,599 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 2696 states, 2695 states have (on average 3.7669758812615957) internal successors, (10152), 2695 states have internal predecessors, (10152), 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 18:06:59,604 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 2696 states to 2696 states and 10152 transitions. [2025-04-13 18:06:59,609 INFO L79 Accepts]: Start accepts. Automaton has 2696 states and 10152 transitions. Word has length 37 [2025-04-13 18:06:59,610 INFO L85 Accepts]: Finished accepts. word is rejected. [2025-04-13 18:06:59,611 INFO L485 AbstractCegarLoop]: Abstraction has 2696 states and 10152 transitions. [2025-04-13 18:06:59,611 INFO L486 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 6 states have (on average 6.166666666666667) internal successors, (37), 5 states have internal predecessors, (37), 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 18:06:59,612 INFO L278 IsEmpty]: Start isEmpty. Operand 2696 states and 10152 transitions. [2025-04-13 18:06:59,619 INFO L284 IsEmpty]: Finished isEmpty. Found accepting run of length 41 [2025-04-13 18:06:59,619 INFO L210 NwaCegarLoop]: Found error trace [2025-04-13 18:06:59,619 INFO L218 NwaCegarLoop]: trace histogram [2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-04-13 18:06:59,625 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 18:06:59,824 WARN L466 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable8,5 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-04-13 18:06:59,824 INFO L403 AbstractCegarLoop]: === Iteration 10 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [thread1Err0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES, thread1Err3INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION (and 4 more)] === [2025-04-13 18:06:59,824 INFO L155 PredicateUnifier]: Initialized classic predicate unifier [2025-04-13 18:06:59,824 INFO L85 PathProgramCache]: Analyzing trace with hash -373563549, now seen corresponding path program 1 times [2025-04-13 18:06:59,824 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-04-13 18:06:59,825 INFO L324 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [944827648] [2025-04-13 18:06:59,825 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-04-13 18:06:59,825 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-04-13 18:06:59,832 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 40 statements into 1 equivalence classes. [2025-04-13 18:06:59,847 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 40 of 40 statements. [2025-04-13 18:06:59,847 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-04-13 18:06:59,847 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-04-13 18:07:00,384 INFO L134 CoverageAnalysis]: Checked inductivity of 4 backedges. 0 proven. 4 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-04-13 18:07:00,384 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-04-13 18:07:00,384 INFO L324 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [944827648] [2025-04-13 18:07:00,385 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [944827648] provided 0 perfect and 1 imperfect interpolant sequences [2025-04-13 18:07:00,385 INFO L324 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [940809676] [2025-04-13 18:07:00,385 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-04-13 18:07:00,385 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-04-13 18:07:00,385 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2025-04-13 18:07:00,386 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 18:07:00,388 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 18:07:00,436 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 40 statements into 1 equivalence classes. [2025-04-13 18:07:00,458 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 40 of 40 statements. [2025-04-13 18:07:00,458 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-04-13 18:07:00,458 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-04-13 18:07:00,460 INFO L256 TraceCheckSpWp]: Trace formula consists of 266 conjuncts, 25 conjuncts are in the unsatisfiable core [2025-04-13 18:07:00,461 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-04-13 18:07:00,556 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 19 treesize of output 7 [2025-04-13 18:07:00,571 INFO L134 CoverageAnalysis]: Checked inductivity of 4 backedges. 0 proven. 1 refuted. 0 times theorem prover too weak. 3 trivial. 0 not checked. [2025-04-13 18:07:00,571 INFO L312 TraceCheckSpWp]: Computing backward predicates... [2025-04-13 18:07:00,649 INFO L325 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2025-04-13 18:07:00,650 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 20 treesize of output 14 [2025-04-13 18:07:00,663 INFO L134 CoverageAnalysis]: Checked inductivity of 4 backedges. 0 proven. 1 refuted. 0 times theorem prover too weak. 3 trivial. 0 not checked. [2025-04-13 18:07:00,663 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [940809676] provided 0 perfect and 2 imperfect interpolant sequences [2025-04-13 18:07:00,664 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2025-04-13 18:07:00,664 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [10, 7, 7] total 18 [2025-04-13 18:07:00,664 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1963663996] [2025-04-13 18:07:00,664 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2025-04-13 18:07:00,664 INFO L562 AbstractCegarLoop]: INTERPOLANT automaton has 19 states [2025-04-13 18:07:00,664 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-04-13 18:07:00,664 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 19 interpolants. [2025-04-13 18:07:00,664 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=53, Invalid=289, Unknown=0, NotChecked=0, Total=342 [2025-04-13 18:07:00,665 INFO L87 Difference]: Start difference. First operand 2696 states and 10152 transitions. Second operand has 19 states, 18 states have (on average 4.277777777777778) internal successors, (77), 19 states have internal predecessors, (77), 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 18:07:01,755 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-04-13 18:07:01,755 INFO L93 Difference]: Finished difference Result 7096 states and 27035 transitions. [2025-04-13 18:07:01,755 INFO L140 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 14 states. [2025-04-13 18:07:01,756 INFO L79 Accepts]: Start accepts. Automaton has has 19 states, 18 states have (on average 4.277777777777778) internal successors, (77), 19 states have internal predecessors, (77), 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 40 [2025-04-13 18:07:01,756 INFO L85 Accepts]: Finished accepts. some prefix is accepted. [2025-04-13 18:07:01,782 INFO L225 Difference]: With dead ends: 7096 [2025-04-13 18:07:01,783 INFO L226 Difference]: Without dead ends: 6821 [2025-04-13 18:07:01,787 INFO L436 NwaCegarLoop]: 0 DeclaredPredicates, 95 GetRequests, 71 SyntacticMatches, 0 SemanticMatches, 24 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 104 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=95, Invalid=555, Unknown=0, NotChecked=0, Total=650 [2025-04-13 18:07:01,788 INFO L437 NwaCegarLoop]: 11 mSDtfsCounter, 394 mSDsluCounter, 106 mSDsCounter, 0 mSdLazyCounter, 1850 mSolverCounterSat, 3 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.6s Time, 0 mProtectedPredicate, 0 mProtectedAction, 394 SdHoareTripleChecker+Valid, 117 SdHoareTripleChecker+Invalid, 1853 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 3 IncrementalHoareTripleChecker+Valid, 1850 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.7s IncrementalHoareTripleChecker+Time [2025-04-13 18:07:01,788 INFO L438 NwaCegarLoop]: SdHoareTripleChecker [394 Valid, 117 Invalid, 1853 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [3 Valid, 1850 Invalid, 0 Unknown, 0 Unchecked, 0.7s Time] [2025-04-13 18:07:01,798 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 6821 states. [2025-04-13 18:07:01,913 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 6821 to 3020. [2025-04-13 18:07:01,917 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 3020 states, 3019 states have (on average 3.7946339847631667) internal successors, (11456), 3019 states have internal predecessors, (11456), 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 18:07:01,923 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3020 states to 3020 states and 11456 transitions. [2025-04-13 18:07:01,930 INFO L79 Accepts]: Start accepts. Automaton has 3020 states and 11456 transitions. Word has length 40 [2025-04-13 18:07:01,932 INFO L85 Accepts]: Finished accepts. word is rejected. [2025-04-13 18:07:01,932 INFO L485 AbstractCegarLoop]: Abstraction has 3020 states and 11456 transitions. [2025-04-13 18:07:01,932 INFO L486 AbstractCegarLoop]: INTERPOLANT automaton has has 19 states, 18 states have (on average 4.277777777777778) internal successors, (77), 19 states have internal predecessors, (77), 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 18:07:01,932 INFO L278 IsEmpty]: Start isEmpty. Operand 3020 states and 11456 transitions. [2025-04-13 18:07:01,951 INFO L284 IsEmpty]: Finished isEmpty. Found accepting run of length 41 [2025-04-13 18:07:01,951 INFO L210 NwaCegarLoop]: Found error trace [2025-04-13 18:07:01,952 INFO L218 NwaCegarLoop]: trace histogram [2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-04-13 18:07:01,958 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (6)] Ended with exit code 0 [2025-04-13 18:07:02,155 WARN L466 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 6 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable9 [2025-04-13 18:07:02,155 INFO L403 AbstractCegarLoop]: === Iteration 11 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [thread1Err0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES, thread1Err3INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION (and 4 more)] === [2025-04-13 18:07:02,156 INFO L155 PredicateUnifier]: Initialized classic predicate unifier [2025-04-13 18:07:02,156 INFO L85 PathProgramCache]: Analyzing trace with hash 270982276, now seen corresponding path program 1 times [2025-04-13 18:07:02,156 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-04-13 18:07:02,157 INFO L324 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1682970290] [2025-04-13 18:07:02,157 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-04-13 18:07:02,157 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-04-13 18:07:02,164 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 40 statements into 1 equivalence classes. [2025-04-13 18:07:02,177 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 40 of 40 statements. [2025-04-13 18:07:02,177 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-04-13 18:07:02,177 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-04-13 18:07:02,782 INFO L134 CoverageAnalysis]: Checked inductivity of 5 backedges. 0 proven. 5 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-04-13 18:07:02,782 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-04-13 18:07:02,783 INFO L324 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1682970290] [2025-04-13 18:07:02,783 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1682970290] provided 0 perfect and 1 imperfect interpolant sequences [2025-04-13 18:07:02,783 INFO L324 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1577667465] [2025-04-13 18:07:02,783 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-04-13 18:07:02,783 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-04-13 18:07:02,783 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2025-04-13 18:07:02,789 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 18:07:02,794 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 18:07:02,889 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 40 statements into 1 equivalence classes. [2025-04-13 18:07:02,925 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 40 of 40 statements. [2025-04-13 18:07:02,925 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-04-13 18:07:02,925 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-04-13 18:07:02,926 INFO L256 TraceCheckSpWp]: Trace formula consists of 266 conjuncts, 25 conjuncts are in the unsatisfiable core [2025-04-13 18:07:02,928 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-04-13 18:07:03,094 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 19 treesize of output 7 [2025-04-13 18:07:03,114 INFO L134 CoverageAnalysis]: Checked inductivity of 5 backedges. 0 proven. 2 refuted. 0 times theorem prover too weak. 3 trivial. 0 not checked. [2025-04-13 18:07:03,114 INFO L312 TraceCheckSpWp]: Computing backward predicates... [2025-04-13 18:07:03,237 INFO L325 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2025-04-13 18:07:03,238 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 20 treesize of output 14 [2025-04-13 18:07:03,248 INFO L134 CoverageAnalysis]: Checked inductivity of 5 backedges. 0 proven. 2 refuted. 0 times theorem prover too weak. 3 trivial. 0 not checked. [2025-04-13 18:07:03,248 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1577667465] provided 0 perfect and 2 imperfect interpolant sequences [2025-04-13 18:07:03,248 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2025-04-13 18:07:03,248 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [10, 7, 7] total 18 [2025-04-13 18:07:03,249 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [559239755] [2025-04-13 18:07:03,249 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2025-04-13 18:07:03,249 INFO L562 AbstractCegarLoop]: INTERPOLANT automaton has 19 states [2025-04-13 18:07:03,249 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-04-13 18:07:03,249 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 19 interpolants. [2025-04-13 18:07:03,249 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=53, Invalid=289, Unknown=0, NotChecked=0, Total=342 [2025-04-13 18:07:03,249 INFO L87 Difference]: Start difference. First operand 3020 states and 11456 transitions. Second operand has 19 states, 18 states have (on average 4.5) internal successors, (81), 19 states have internal predecessors, (81), 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 18:07:04,841 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-04-13 18:07:04,842 INFO L93 Difference]: Finished difference Result 7111 states and 27172 transitions. [2025-04-13 18:07:04,842 INFO L140 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 14 states. [2025-04-13 18:07:04,842 INFO L79 Accepts]: Start accepts. Automaton has has 19 states, 18 states have (on average 4.5) internal successors, (81), 19 states have internal predecessors, (81), 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 40 [2025-04-13 18:07:04,843 INFO L85 Accepts]: Finished accepts. some prefix is accepted. [2025-04-13 18:07:04,899 INFO L225 Difference]: With dead ends: 7111 [2025-04-13 18:07:04,899 INFO L226 Difference]: Without dead ends: 6860 [2025-04-13 18:07:04,911 INFO L436 NwaCegarLoop]: 0 DeclaredPredicates, 95 GetRequests, 71 SyntacticMatches, 0 SemanticMatches, 24 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 104 ImplicationChecksByTransitivity, 0.3s TimeCoverageRelationStatistics Valid=95, Invalid=555, Unknown=0, NotChecked=0, Total=650 [2025-04-13 18:07:04,911 INFO L437 NwaCegarLoop]: 11 mSDtfsCounter, 340 mSDsluCounter, 118 mSDsCounter, 0 mSdLazyCounter, 2125 mSolverCounterSat, 3 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.8s Time, 0 mProtectedPredicate, 0 mProtectedAction, 340 SdHoareTripleChecker+Valid, 129 SdHoareTripleChecker+Invalid, 2128 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 3 IncrementalHoareTripleChecker+Valid, 2125 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 1.1s IncrementalHoareTripleChecker+Time [2025-04-13 18:07:04,911 INFO L438 NwaCegarLoop]: SdHoareTripleChecker [340 Valid, 129 Invalid, 2128 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [3 Valid, 2125 Invalid, 0 Unknown, 0 Unchecked, 1.1s Time] [2025-04-13 18:07:04,928 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 6860 states. [2025-04-13 18:07:05,283 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 6860 to 3172. [2025-04-13 18:07:05,302 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 3172 states, 3171 states have (on average 3.7918637653736993) internal successors, (12024), 3171 states have internal predecessors, (12024), 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 18:07:05,323 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3172 states to 3172 states and 12024 transitions. [2025-04-13 18:07:05,339 INFO L79 Accepts]: Start accepts. Automaton has 3172 states and 12024 transitions. Word has length 40 [2025-04-13 18:07:05,339 INFO L85 Accepts]: Finished accepts. word is rejected. [2025-04-13 18:07:05,339 INFO L485 AbstractCegarLoop]: Abstraction has 3172 states and 12024 transitions. [2025-04-13 18:07:05,339 INFO L486 AbstractCegarLoop]: INTERPOLANT automaton has has 19 states, 18 states have (on average 4.5) internal successors, (81), 19 states have internal predecessors, (81), 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 18:07:05,339 INFO L278 IsEmpty]: Start isEmpty. Operand 3172 states and 12024 transitions. [2025-04-13 18:07:05,350 INFO L284 IsEmpty]: Finished isEmpty. Found accepting run of length 41 [2025-04-13 18:07:05,350 INFO L210 NwaCegarLoop]: Found error trace [2025-04-13 18:07:05,350 INFO L218 NwaCegarLoop]: trace histogram [2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-04-13 18:07:05,368 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 18:07:05,558 WARN L466 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable10,7 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-04-13 18:07:05,560 INFO L403 AbstractCegarLoop]: === Iteration 12 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [thread1Err0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES, thread1Err3INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION (and 4 more)] === [2025-04-13 18:07:05,560 INFO L155 PredicateUnifier]: Initialized classic predicate unifier [2025-04-13 18:07:05,560 INFO L85 PathProgramCache]: Analyzing trace with hash 1203365121, now seen corresponding path program 2 times [2025-04-13 18:07:05,560 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-04-13 18:07:05,560 INFO L324 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1845558526] [2025-04-13 18:07:05,560 INFO L95 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST1 [2025-04-13 18:07:05,560 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-04-13 18:07:05,580 INFO L108 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 partitioned 40 statements into 2 equivalence classes. [2025-04-13 18:07:05,593 INFO L111 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 issued 1 check-sat command(s) and asserted 38 of 40 statements. [2025-04-13 18:07:05,593 INFO L114 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 issued 1 check-sat command(s) [2025-04-13 18:07:05,593 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-04-13 18:07:05,980 INFO L134 CoverageAnalysis]: Checked inductivity of 3 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 3 trivial. 0 not checked. [2025-04-13 18:07:05,980 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-04-13 18:07:05,980 INFO L324 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1845558526] [2025-04-13 18:07:05,980 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1845558526] provided 1 perfect and 0 imperfect interpolant sequences [2025-04-13 18:07:05,980 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-04-13 18:07:05,980 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [8] imperfect sequences [] total 8 [2025-04-13 18:07:05,980 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [701164764] [2025-04-13 18:07:05,980 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-04-13 18:07:05,981 INFO L562 AbstractCegarLoop]: INTERPOLANT automaton has 9 states [2025-04-13 18:07:05,981 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-04-13 18:07:05,981 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2025-04-13 18:07:05,981 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=18, Invalid=54, Unknown=0, NotChecked=0, Total=72 [2025-04-13 18:07:05,981 INFO L87 Difference]: Start difference. First operand 3172 states and 12024 transitions. Second operand has 9 states, 8 states have (on average 4.875) internal successors, (39), 9 states have internal predecessors, (39), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-04-13 18:07:06,860 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-04-13 18:07:06,860 INFO L93 Difference]: Finished difference Result 6137 states and 23401 transitions. [2025-04-13 18:07:06,860 INFO L140 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 11 states. [2025-04-13 18:07:06,861 INFO L79 Accepts]: Start accepts. Automaton has has 9 states, 8 states have (on average 4.875) internal successors, (39), 9 states have internal predecessors, (39), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 40 [2025-04-13 18:07:06,861 INFO L85 Accepts]: Finished accepts. some prefix is accepted. [2025-04-13 18:07:06,906 INFO L225 Difference]: With dead ends: 6137 [2025-04-13 18:07:06,907 INFO L226 Difference]: Without dead ends: 5862 [2025-04-13 18:07:06,913 INFO L436 NwaCegarLoop]: 0 DeclaredPredicates, 10 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 9 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 8 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=27, Invalid=83, Unknown=0, NotChecked=0, Total=110 [2025-04-13 18:07:06,913 INFO L437 NwaCegarLoop]: 10 mSDtfsCounter, 206 mSDsluCounter, 47 mSDsCounter, 0 mSdLazyCounter, 805 mSolverCounterSat, 1 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.4s Time, 0 mProtectedPredicate, 0 mProtectedAction, 206 SdHoareTripleChecker+Valid, 57 SdHoareTripleChecker+Invalid, 806 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 1 IncrementalHoareTripleChecker+Valid, 805 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.5s IncrementalHoareTripleChecker+Time [2025-04-13 18:07:06,917 INFO L438 NwaCegarLoop]: SdHoareTripleChecker [206 Valid, 57 Invalid, 806 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [1 Valid, 805 Invalid, 0 Unknown, 0 Unchecked, 0.5s Time] [2025-04-13 18:07:06,928 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 5862 states. [2025-04-13 18:07:07,311 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 5862 to 3336. [2025-04-13 18:07:07,321 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 3336 states, 3335 states have (on average 3.814092953523238) internal successors, (12720), 3335 states have internal predecessors, (12720), 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 18:07:07,349 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3336 states to 3336 states and 12720 transitions. [2025-04-13 18:07:07,369 INFO L79 Accepts]: Start accepts. Automaton has 3336 states and 12720 transitions. Word has length 40 [2025-04-13 18:07:07,370 INFO L85 Accepts]: Finished accepts. word is rejected. [2025-04-13 18:07:07,370 INFO L485 AbstractCegarLoop]: Abstraction has 3336 states and 12720 transitions. [2025-04-13 18:07:07,370 INFO L486 AbstractCegarLoop]: INTERPOLANT automaton has has 9 states, 8 states have (on average 4.875) internal successors, (39), 9 states have internal predecessors, (39), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-04-13 18:07:07,370 INFO L278 IsEmpty]: Start isEmpty. Operand 3336 states and 12720 transitions. [2025-04-13 18:07:07,390 INFO L284 IsEmpty]: Finished isEmpty. Found accepting run of length 41 [2025-04-13 18:07:07,390 INFO L210 NwaCegarLoop]: Found error trace [2025-04-13 18:07:07,391 INFO L218 NwaCegarLoop]: trace histogram [2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-04-13 18:07:07,391 WARN L466 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable11 [2025-04-13 18:07:07,392 INFO L403 AbstractCegarLoop]: === Iteration 13 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [thread1Err0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES, thread1Err3INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION (and 4 more)] === [2025-04-13 18:07:07,392 INFO L155 PredicateUnifier]: Initialized classic predicate unifier [2025-04-13 18:07:07,392 INFO L85 PathProgramCache]: Analyzing trace with hash 1763897890, now seen corresponding path program 2 times [2025-04-13 18:07:07,392 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-04-13 18:07:07,392 INFO L324 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1015420607] [2025-04-13 18:07:07,392 INFO L95 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST1 [2025-04-13 18:07:07,392 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-04-13 18:07:07,408 INFO L108 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 partitioned 40 statements into 2 equivalence classes. [2025-04-13 18:07:07,438 INFO L111 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) and asserted 40 of 40 statements. [2025-04-13 18:07:07,438 INFO L114 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) [2025-04-13 18:07:07,438 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-04-13 18:07:08,284 INFO L134 CoverageAnalysis]: Checked inductivity of 4 backedges. 0 proven. 4 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-04-13 18:07:08,284 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-04-13 18:07:08,284 INFO L324 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1015420607] [2025-04-13 18:07:08,284 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1015420607] provided 0 perfect and 1 imperfect interpolant sequences [2025-04-13 18:07:08,284 INFO L324 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1783758165] [2025-04-13 18:07:08,284 INFO L95 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST1 [2025-04-13 18:07:08,284 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-04-13 18:07:08,285 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2025-04-13 18:07:08,290 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 18:07:08,292 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 18:07:08,387 INFO L108 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 partitioned 40 statements into 2 equivalence classes. [2025-04-13 18:07:08,432 INFO L111 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) and asserted 40 of 40 statements. [2025-04-13 18:07:08,433 INFO L114 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) [2025-04-13 18:07:08,433 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-04-13 18:07:08,438 INFO L256 TraceCheckSpWp]: Trace formula consists of 266 conjuncts, 41 conjuncts are in the unsatisfiable core [2025-04-13 18:07:08,440 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-04-13 18:07:08,461 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 18:07:08,763 INFO L325 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2025-04-13 18:07:08,763 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 17 treesize of output 15 [2025-04-13 18:07:08,856 INFO L134 CoverageAnalysis]: Checked inductivity of 4 backedges. 0 proven. 4 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-04-13 18:07:08,857 INFO L312 TraceCheckSpWp]: Computing backward predicates... [2025-04-13 18:07:09,293 INFO L134 CoverageAnalysis]: Checked inductivity of 4 backedges. 0 proven. 1 refuted. 0 times theorem prover too weak. 3 trivial. 0 not checked. [2025-04-13 18:07:09,293 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1783758165] provided 0 perfect and 2 imperfect interpolant sequences [2025-04-13 18:07:09,293 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2025-04-13 18:07:09,293 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [12, 11, 8] total 23 [2025-04-13 18:07:09,293 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1557741446] [2025-04-13 18:07:09,294 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2025-04-13 18:07:09,294 INFO L562 AbstractCegarLoop]: INTERPOLANT automaton has 24 states [2025-04-13 18:07:09,294 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-04-13 18:07:09,294 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 24 interpolants. [2025-04-13 18:07:09,294 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=101, Invalid=451, Unknown=0, NotChecked=0, Total=552 [2025-04-13 18:07:09,295 INFO L87 Difference]: Start difference. First operand 3336 states and 12720 transitions. Second operand has 24 states, 23 states have (on average 3.869565217391304) internal successors, (89), 24 states have internal predecessors, (89), 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 18:07:13,752 WARN L532 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 3.93s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [1] [2025-04-13 18:07:20,473 WARN L532 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 4.02s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [1] [2025-04-13 18:07:24,819 WARN L532 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 4.00s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [1] [2025-04-13 18:07:29,952 WARN L532 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 4.00s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [1] [2025-04-13 18:07:31,709 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-04-13 18:07:31,709 INFO L93 Difference]: Finished difference Result 13157 states and 49964 transitions. [2025-04-13 18:07:31,709 INFO L140 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 46 states. [2025-04-13 18:07:31,710 INFO L79 Accepts]: Start accepts. Automaton has has 24 states, 23 states have (on average 3.869565217391304) internal successors, (89), 24 states have internal predecessors, (89), 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 40 [2025-04-13 18:07:31,710 INFO L85 Accepts]: Finished accepts. some prefix is accepted. [2025-04-13 18:07:31,796 INFO L225 Difference]: With dead ends: 13157 [2025-04-13 18:07:31,797 INFO L226 Difference]: Without dead ends: 12019 [2025-04-13 18:07:31,812 INFO L436 NwaCegarLoop]: 0 DeclaredPredicates, 132 GetRequests, 68 SyntacticMatches, 0 SemanticMatches, 64 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1170 ImplicationChecksByTransitivity, 2.2s TimeCoverageRelationStatistics Valid=741, Invalid=3549, Unknown=0, NotChecked=0, Total=4290 [2025-04-13 18:07:31,813 INFO L437 NwaCegarLoop]: 11 mSDtfsCounter, 1002 mSDsluCounter, 145 mSDsCounter, 0 mSdLazyCounter, 2417 mSolverCounterSat, 31 mSolverCounterUnsat, 4 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 18.6s Time, 0 mProtectedPredicate, 0 mProtectedAction, 1002 SdHoareTripleChecker+Valid, 156 SdHoareTripleChecker+Invalid, 2452 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 31 IncrementalHoareTripleChecker+Valid, 2417 IncrementalHoareTripleChecker+Invalid, 4 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 19.0s IncrementalHoareTripleChecker+Time [2025-04-13 18:07:31,813 INFO L438 NwaCegarLoop]: SdHoareTripleChecker [1002 Valid, 156 Invalid, 2452 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [31 Valid, 2417 Invalid, 4 Unknown, 0 Unchecked, 19.0s Time] [2025-04-13 18:07:31,833 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 12019 states. [2025-04-13 18:07:32,433 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 12019 to 3524. [2025-04-13 18:07:32,437 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 3524 states, 3523 states have (on average 3.8279875106443373) internal successors, (13486), 3523 states have internal predecessors, (13486), 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 18:07:32,445 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3524 states to 3524 states and 13486 transitions. [2025-04-13 18:07:32,454 INFO L79 Accepts]: Start accepts. Automaton has 3524 states and 13486 transitions. Word has length 40 [2025-04-13 18:07:32,454 INFO L85 Accepts]: Finished accepts. word is rejected. [2025-04-13 18:07:32,454 INFO L485 AbstractCegarLoop]: Abstraction has 3524 states and 13486 transitions. [2025-04-13 18:07:32,455 INFO L486 AbstractCegarLoop]: INTERPOLANT automaton has has 24 states, 23 states have (on average 3.869565217391304) internal successors, (89), 24 states have internal predecessors, (89), 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 18:07:32,455 INFO L278 IsEmpty]: Start isEmpty. Operand 3524 states and 13486 transitions. [2025-04-13 18:07:32,461 INFO L284 IsEmpty]: Finished isEmpty. Found accepting run of length 41 [2025-04-13 18:07:32,461 INFO L210 NwaCegarLoop]: Found error trace [2025-04-13 18:07:32,461 INFO L218 NwaCegarLoop]: trace histogram [2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-04-13 18:07:32,468 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (8)] Forceful destruction successful, exit code 0 [2025-04-13 18:07:32,664 WARN L466 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable12,8 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-04-13 18:07:32,664 INFO L403 AbstractCegarLoop]: === Iteration 14 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [thread1Err0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES, thread1Err3INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION (and 4 more)] === [2025-04-13 18:07:32,665 INFO L155 PredicateUnifier]: Initialized classic predicate unifier [2025-04-13 18:07:32,665 INFO L85 PathProgramCache]: Analyzing trace with hash -901309951, now seen corresponding path program 3 times [2025-04-13 18:07:32,665 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-04-13 18:07:32,665 INFO L324 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [594789257] [2025-04-13 18:07:32,665 INFO L95 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST2 [2025-04-13 18:07:32,665 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-04-13 18:07:32,672 INFO L108 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST2 partitioned 40 statements into 2 equivalence classes. [2025-04-13 18:07:32,685 INFO L111 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST2 issued 1 check-sat command(s) and asserted 38 of 40 statements. [2025-04-13 18:07:32,686 INFO L114 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST2 issued 1 check-sat command(s) [2025-04-13 18:07:32,686 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-04-13 18:07:32,869 INFO L134 CoverageAnalysis]: Checked inductivity of 3 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 3 trivial. 0 not checked. [2025-04-13 18:07:32,869 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-04-13 18:07:32,869 INFO L324 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [594789257] [2025-04-13 18:07:32,869 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [594789257] provided 1 perfect and 0 imperfect interpolant sequences [2025-04-13 18:07:32,869 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-04-13 18:07:32,870 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2025-04-13 18:07:32,870 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [721428580] [2025-04-13 18:07:32,870 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-04-13 18:07:32,870 INFO L562 AbstractCegarLoop]: INTERPOLANT automaton has 8 states [2025-04-13 18:07:32,870 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-04-13 18:07:32,870 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2025-04-13 18:07:32,870 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=16, Invalid=40, Unknown=0, NotChecked=0, Total=56 [2025-04-13 18:07:32,871 INFO L87 Difference]: Start difference. First operand 3524 states and 13486 transitions. Second operand has 8 states, 7 states have (on average 5.571428571428571) internal successors, (39), 8 states have internal predecessors, (39), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-04-13 18:07:34,205 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-04-13 18:07:34,205 INFO L93 Difference]: Finished difference Result 5965 states and 22863 transitions. [2025-04-13 18:07:34,205 INFO L140 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 10 states. [2025-04-13 18:07:34,205 INFO L79 Accepts]: Start accepts. Automaton has has 8 states, 7 states have (on average 5.571428571428571) internal successors, (39), 8 states have internal predecessors, (39), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 40 [2025-04-13 18:07:34,205 INFO L85 Accepts]: Finished accepts. some prefix is accepted. [2025-04-13 18:07:34,230 INFO L225 Difference]: With dead ends: 5965 [2025-04-13 18:07:34,231 INFO L226 Difference]: Without dead ends: 5690 [2025-04-13 18:07:34,233 INFO L436 NwaCegarLoop]: 0 DeclaredPredicates, 11 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 9 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 6 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=31, Invalid=79, Unknown=0, NotChecked=0, Total=110 [2025-04-13 18:07:34,234 INFO L437 NwaCegarLoop]: 9 mSDtfsCounter, 161 mSDsluCounter, 38 mSDsCounter, 0 mSdLazyCounter, 686 mSolverCounterSat, 1 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.3s Time, 0 mProtectedPredicate, 0 mProtectedAction, 161 SdHoareTripleChecker+Valid, 47 SdHoareTripleChecker+Invalid, 687 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 1 IncrementalHoareTripleChecker+Valid, 686 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.4s IncrementalHoareTripleChecker+Time [2025-04-13 18:07:34,234 INFO L438 NwaCegarLoop]: SdHoareTripleChecker [161 Valid, 47 Invalid, 687 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [1 Valid, 686 Invalid, 0 Unknown, 0 Unchecked, 0.4s Time] [2025-04-13 18:07:34,240 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 5690 states. [2025-04-13 18:07:34,615 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 5690 to 3548. [2025-04-13 18:07:34,620 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 3548 states, 3547 states have (on average 3.8285875387651536) internal successors, (13580), 3547 states have internal predecessors, (13580), 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 18:07:34,627 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3548 states to 3548 states and 13580 transitions. [2025-04-13 18:07:34,636 INFO L79 Accepts]: Start accepts. Automaton has 3548 states and 13580 transitions. Word has length 40 [2025-04-13 18:07:34,636 INFO L85 Accepts]: Finished accepts. word is rejected. [2025-04-13 18:07:34,636 INFO L485 AbstractCegarLoop]: Abstraction has 3548 states and 13580 transitions. [2025-04-13 18:07:34,637 INFO L486 AbstractCegarLoop]: INTERPOLANT automaton has has 8 states, 7 states have (on average 5.571428571428571) internal successors, (39), 8 states have internal predecessors, (39), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-04-13 18:07:34,637 INFO L278 IsEmpty]: Start isEmpty. Operand 3548 states and 13580 transitions. [2025-04-13 18:07:34,643 INFO L284 IsEmpty]: Finished isEmpty. Found accepting run of length 41 [2025-04-13 18:07:34,643 INFO L210 NwaCegarLoop]: Found error trace [2025-04-13 18:07:34,643 INFO L218 NwaCegarLoop]: trace histogram [2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-04-13 18:07:34,643 WARN L466 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable13 [2025-04-13 18:07:34,644 INFO L403 AbstractCegarLoop]: === Iteration 15 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [thread1Err0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES, thread1Err3INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION (and 4 more)] === [2025-04-13 18:07:34,644 INFO L155 PredicateUnifier]: Initialized classic predicate unifier [2025-04-13 18:07:34,644 INFO L85 PathProgramCache]: Analyzing trace with hash -417627879, now seen corresponding path program 4 times [2025-04-13 18:07:34,645 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-04-13 18:07:34,645 INFO L324 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [735016792] [2025-04-13 18:07:34,645 INFO L95 rtionOrderModulation]: Changing assertion order to TERMS_WITH_SMALL_CONSTANTS_FIRST [2025-04-13 18:07:34,645 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-04-13 18:07:34,652 INFO L108 AnnotateAndAsserter]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST partitioned 40 statements into 2 equivalence classes. [2025-04-13 18:07:34,665 INFO L111 AnnotateAndAsserter]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST issued 2 check-sat command(s) and asserted 40 of 40 statements. [2025-04-13 18:07:34,666 INFO L114 AnnotateAndAsserter]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST issued 2 check-sat command(s) [2025-04-13 18:07:34,666 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-04-13 18:07:34,856 INFO L134 CoverageAnalysis]: Checked inductivity of 4 backedges. 0 proven. 1 refuted. 0 times theorem prover too weak. 3 trivial. 0 not checked. [2025-04-13 18:07:34,857 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-04-13 18:07:34,857 INFO L324 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [735016792] [2025-04-13 18:07:34,857 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [735016792] provided 0 perfect and 1 imperfect interpolant sequences [2025-04-13 18:07:34,857 INFO L324 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [918914848] [2025-04-13 18:07:34,857 INFO L95 rtionOrderModulation]: Changing assertion order to TERMS_WITH_SMALL_CONSTANTS_FIRST [2025-04-13 18:07:34,857 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-04-13 18:07:34,857 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2025-04-13 18:07:34,859 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 18:07:34,860 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 18:07:34,914 INFO L108 AnnotateAndAsserter]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST partitioned 40 statements into 2 equivalence classes. [2025-04-13 18:07:34,934 INFO L111 AnnotateAndAsserter]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST issued 2 check-sat command(s) and asserted 40 of 40 statements. [2025-04-13 18:07:34,935 INFO L114 AnnotateAndAsserter]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST issued 2 check-sat command(s) [2025-04-13 18:07:34,935 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-04-13 18:07:34,937 INFO L256 TraceCheckSpWp]: Trace formula consists of 266 conjuncts, 25 conjuncts are in the unsatisfiable core [2025-04-13 18:07:34,938 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-04-13 18:07:35,026 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 19 treesize of output 7 [2025-04-13 18:07:35,059 INFO L134 CoverageAnalysis]: Checked inductivity of 4 backedges. 0 proven. 1 refuted. 0 times theorem prover too weak. 3 trivial. 0 not checked. [2025-04-13 18:07:35,059 INFO L312 TraceCheckSpWp]: Computing backward predicates... [2025-04-13 18:07:35,128 INFO L325 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2025-04-13 18:07:35,128 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 20 treesize of output 14 [2025-04-13 18:07:35,136 INFO L134 CoverageAnalysis]: Checked inductivity of 4 backedges. 0 proven. 1 refuted. 0 times theorem prover too weak. 3 trivial. 0 not checked. [2025-04-13 18:07:35,136 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [918914848] provided 0 perfect and 2 imperfect interpolant sequences [2025-04-13 18:07:35,136 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2025-04-13 18:07:35,136 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [7, 7, 7] total 13 [2025-04-13 18:07:35,136 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [153917308] [2025-04-13 18:07:35,136 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2025-04-13 18:07:35,137 INFO L562 AbstractCegarLoop]: INTERPOLANT automaton has 14 states [2025-04-13 18:07:35,137 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-04-13 18:07:35,137 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 14 interpolants. [2025-04-13 18:07:35,137 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=37, Invalid=145, Unknown=0, NotChecked=0, Total=182 [2025-04-13 18:07:35,137 INFO L87 Difference]: Start difference. First operand 3548 states and 13580 transitions. Second operand has 14 states, 13 states have (on average 5.230769230769231) internal successors, (68), 14 states have internal predecessors, (68), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-04-13 18:07:36,290 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-04-13 18:07:36,290 INFO L93 Difference]: Finished difference Result 5966 states and 22849 transitions. [2025-04-13 18:07:36,290 INFO L140 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 10 states. [2025-04-13 18:07:36,290 INFO L79 Accepts]: Start accepts. Automaton has has 14 states, 13 states have (on average 5.230769230769231) internal successors, (68), 14 states have internal predecessors, (68), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 40 [2025-04-13 18:07:36,290 INFO L85 Accepts]: Finished accepts. some prefix is accepted. [2025-04-13 18:07:36,311 INFO L225 Difference]: With dead ends: 5966 [2025-04-13 18:07:36,312 INFO L226 Difference]: Without dead ends: 5715 [2025-04-13 18:07:36,313 INFO L436 NwaCegarLoop]: 0 DeclaredPredicates, 91 GetRequests, 74 SyntacticMatches, 0 SemanticMatches, 17 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 36 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=73, Invalid=269, Unknown=0, NotChecked=0, Total=342 [2025-04-13 18:07:36,314 INFO L437 NwaCegarLoop]: 9 mSDtfsCounter, 276 mSDsluCounter, 59 mSDsCounter, 0 mSdLazyCounter, 1015 mSolverCounterSat, 1 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.4s Time, 0 mProtectedPredicate, 0 mProtectedAction, 276 SdHoareTripleChecker+Valid, 68 SdHoareTripleChecker+Invalid, 1016 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 1 IncrementalHoareTripleChecker+Valid, 1015 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.5s IncrementalHoareTripleChecker+Time [2025-04-13 18:07:36,314 INFO L438 NwaCegarLoop]: SdHoareTripleChecker [276 Valid, 68 Invalid, 1016 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [1 Valid, 1015 Invalid, 0 Unknown, 0 Unchecked, 0.5s Time] [2025-04-13 18:07:36,319 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 5715 states. [2025-04-13 18:07:36,593 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 5715 to 3659. [2025-04-13 18:07:36,597 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 3659 states, 3658 states have (on average 3.8264078731547295) internal successors, (13997), 3658 states have internal predecessors, (13997), 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 18:07:36,603 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3659 states to 3659 states and 13997 transitions. [2025-04-13 18:07:36,612 INFO L79 Accepts]: Start accepts. Automaton has 3659 states and 13997 transitions. Word has length 40 [2025-04-13 18:07:36,612 INFO L85 Accepts]: Finished accepts. word is rejected. [2025-04-13 18:07:36,612 INFO L485 AbstractCegarLoop]: Abstraction has 3659 states and 13997 transitions. [2025-04-13 18:07:36,612 INFO L486 AbstractCegarLoop]: INTERPOLANT automaton has has 14 states, 13 states have (on average 5.230769230769231) internal successors, (68), 14 states have internal predecessors, (68), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-04-13 18:07:36,612 INFO L278 IsEmpty]: Start isEmpty. Operand 3659 states and 13997 transitions. [2025-04-13 18:07:36,618 INFO L284 IsEmpty]: Finished isEmpty. Found accepting run of length 41 [2025-04-13 18:07:36,618 INFO L210 NwaCegarLoop]: Found error trace [2025-04-13 18:07:36,618 INFO L218 NwaCegarLoop]: trace histogram [2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-04-13 18:07:36,626 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 18:07:36,818 WARN L466 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 9 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable14 [2025-04-13 18:07:36,819 INFO L403 AbstractCegarLoop]: === Iteration 16 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [thread1Err0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES, thread1Err3INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION (and 4 more)] === [2025-04-13 18:07:36,819 INFO L155 PredicateUnifier]: Initialized classic predicate unifier [2025-04-13 18:07:36,819 INFO L85 PathProgramCache]: Analyzing trace with hash 1460759360, now seen corresponding path program 3 times [2025-04-13 18:07:36,819 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-04-13 18:07:36,819 INFO L324 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [243845205] [2025-04-13 18:07:36,820 INFO L95 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST2 [2025-04-13 18:07:36,820 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-04-13 18:07:36,825 INFO L108 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST2 partitioned 40 statements into 2 equivalence classes. [2025-04-13 18:07:36,834 INFO L111 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST2 issued 2 check-sat command(s) and asserted 40 of 40 statements. [2025-04-13 18:07:36,834 INFO L114 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST2 issued 2 check-sat command(s) [2025-04-13 18:07:36,834 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-04-13 18:07:37,192 INFO L134 CoverageAnalysis]: Checked inductivity of 4 backedges. 0 proven. 4 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-04-13 18:07:37,192 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-04-13 18:07:37,192 INFO L324 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [243845205] [2025-04-13 18:07:37,193 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [243845205] provided 0 perfect and 1 imperfect interpolant sequences [2025-04-13 18:07:37,193 INFO L324 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [472627558] [2025-04-13 18:07:37,193 INFO L95 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST2 [2025-04-13 18:07:37,193 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-04-13 18:07:37,193 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2025-04-13 18:07:37,195 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 18:07:37,196 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 18:07:37,247 INFO L108 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST2 partitioned 40 statements into 2 equivalence classes. [2025-04-13 18:07:37,269 INFO L111 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST2 issued 2 check-sat command(s) and asserted 40 of 40 statements. [2025-04-13 18:07:37,270 INFO L114 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST2 issued 2 check-sat command(s) [2025-04-13 18:07:37,270 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-04-13 18:07:37,271 INFO L256 TraceCheckSpWp]: Trace formula consists of 266 conjuncts, 41 conjuncts are in the unsatisfiable core [2025-04-13 18:07:37,272 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-04-13 18:07:37,282 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 18:07:37,410 INFO L354 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 15 treesize of output 7 [2025-04-13 18:07:37,440 INFO L134 CoverageAnalysis]: Checked inductivity of 4 backedges. 0 proven. 4 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-04-13 18:07:37,441 INFO L312 TraceCheckSpWp]: Computing backward predicates... [2025-04-13 18:07:37,539 INFO L134 CoverageAnalysis]: Checked inductivity of 4 backedges. 0 proven. 1 refuted. 0 times theorem prover too weak. 3 trivial. 0 not checked. [2025-04-13 18:07:37,540 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [472627558] provided 0 perfect and 2 imperfect interpolant sequences [2025-04-13 18:07:37,540 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2025-04-13 18:07:37,540 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [11, 10, 7] total 20 [2025-04-13 18:07:37,540 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [425951790] [2025-04-13 18:07:37,540 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2025-04-13 18:07:37,540 INFO L562 AbstractCegarLoop]: INTERPOLANT automaton has 21 states [2025-04-13 18:07:37,540 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-04-13 18:07:37,540 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 21 interpolants. [2025-04-13 18:07:37,540 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=61, Invalid=359, Unknown=0, NotChecked=0, Total=420 [2025-04-13 18:07:37,541 INFO L87 Difference]: Start difference. First operand 3659 states and 13997 transitions. Second operand has 21 states, 20 states have (on average 4.25) internal successors, (85), 21 states have internal predecessors, (85), 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 18:07:39,024 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-04-13 18:07:39,025 INFO L93 Difference]: Finished difference Result 6213 states and 23774 transitions. [2025-04-13 18:07:39,025 INFO L140 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 15 states. [2025-04-13 18:07:39,025 INFO L79 Accepts]: Start accepts. Automaton has has 21 states, 20 states have (on average 4.25) internal successors, (85), 21 states have internal predecessors, (85), 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 40 [2025-04-13 18:07:39,025 INFO L85 Accepts]: Finished accepts. some prefix is accepted. [2025-04-13 18:07:39,044 INFO L225 Difference]: With dead ends: 6213 [2025-04-13 18:07:39,044 INFO L226 Difference]: Without dead ends: 5992 [2025-04-13 18:07:39,046 INFO L436 NwaCegarLoop]: 0 DeclaredPredicates, 101 GetRequests, 71 SyntacticMatches, 0 SemanticMatches, 30 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 194 ImplicationChecksByTransitivity, 0.3s TimeCoverageRelationStatistics Valid=150, Invalid=842, Unknown=0, NotChecked=0, Total=992 [2025-04-13 18:07:39,046 INFO L437 NwaCegarLoop]: 9 mSDtfsCounter, 358 mSDsluCounter, 114 mSDsCounter, 0 mSdLazyCounter, 1893 mSolverCounterSat, 4 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.6s Time, 0 mProtectedPredicate, 0 mProtectedAction, 358 SdHoareTripleChecker+Valid, 123 SdHoareTripleChecker+Invalid, 1897 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 4 IncrementalHoareTripleChecker+Valid, 1893 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.7s IncrementalHoareTripleChecker+Time [2025-04-13 18:07:39,046 INFO L438 NwaCegarLoop]: SdHoareTripleChecker [358 Valid, 123 Invalid, 1897 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [4 Valid, 1893 Invalid, 0 Unknown, 0 Unchecked, 0.7s Time] [2025-04-13 18:07:39,052 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 5992 states. [2025-04-13 18:07:39,368 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 5992 to 3697. [2025-04-13 18:07:39,372 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 3697 states, 3696 states have (on average 3.8284632034632033) internal successors, (14150), 3696 states have internal predecessors, (14150), 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 18:07:39,379 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3697 states to 3697 states and 14150 transitions. [2025-04-13 18:07:39,385 INFO L79 Accepts]: Start accepts. Automaton has 3697 states and 14150 transitions. Word has length 40 [2025-04-13 18:07:39,385 INFO L85 Accepts]: Finished accepts. word is rejected. [2025-04-13 18:07:39,385 INFO L485 AbstractCegarLoop]: Abstraction has 3697 states and 14150 transitions. [2025-04-13 18:07:39,385 INFO L486 AbstractCegarLoop]: INTERPOLANT automaton has has 21 states, 20 states have (on average 4.25) internal successors, (85), 21 states have internal predecessors, (85), 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 18:07:39,385 INFO L278 IsEmpty]: Start isEmpty. Operand 3697 states and 14150 transitions. [2025-04-13 18:07:39,391 INFO L284 IsEmpty]: Finished isEmpty. Found accepting run of length 41 [2025-04-13 18:07:39,392 INFO L210 NwaCegarLoop]: Found error trace [2025-04-13 18:07:39,392 INFO L218 NwaCegarLoop]: trace histogram [2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-04-13 18:07:39,399 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (10)] Ended with exit code 0 [2025-04-13 18:07:39,596 WARN L466 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 10 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable15 [2025-04-13 18:07:39,596 INFO L403 AbstractCegarLoop]: === Iteration 17 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [thread1Err0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES, thread1Err3INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION (and 4 more)] === [2025-04-13 18:07:39,597 INFO L155 PredicateUnifier]: Initialized classic predicate unifier [2025-04-13 18:07:39,597 INFO L85 PathProgramCache]: Analyzing trace with hash -177082876, now seen corresponding path program 4 times [2025-04-13 18:07:39,597 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-04-13 18:07:39,597 INFO L324 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [362149192] [2025-04-13 18:07:39,597 INFO L95 rtionOrderModulation]: Changing assertion order to TERMS_WITH_SMALL_CONSTANTS_FIRST [2025-04-13 18:07:39,597 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-04-13 18:07:39,602 INFO L108 AnnotateAndAsserter]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST partitioned 40 statements into 2 equivalence classes. [2025-04-13 18:07:39,607 INFO L111 AnnotateAndAsserter]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST issued 2 check-sat command(s) and asserted 40 of 40 statements. [2025-04-13 18:07:39,607 INFO L114 AnnotateAndAsserter]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST issued 2 check-sat command(s) [2025-04-13 18:07:39,607 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-04-13 18:07:39,744 INFO L134 CoverageAnalysis]: Checked inductivity of 3 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 3 trivial. 0 not checked. [2025-04-13 18:07:39,744 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-04-13 18:07:39,744 INFO L324 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [362149192] [2025-04-13 18:07:39,744 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [362149192] provided 1 perfect and 0 imperfect interpolant sequences [2025-04-13 18:07:39,744 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-04-13 18:07:39,744 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2025-04-13 18:07:39,744 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1122759283] [2025-04-13 18:07:39,744 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-04-13 18:07:39,744 INFO L562 AbstractCegarLoop]: INTERPOLANT automaton has 8 states [2025-04-13 18:07:39,745 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-04-13 18:07:39,745 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2025-04-13 18:07:39,745 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=15, Invalid=41, Unknown=0, NotChecked=0, Total=56 [2025-04-13 18:07:39,745 INFO L87 Difference]: Start difference. First operand 3697 states and 14150 transitions. Second operand has 8 states, 7 states have (on average 5.571428571428571) internal successors, (39), 8 states have internal predecessors, (39), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-04-13 18:07:40,742 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-04-13 18:07:40,742 INFO L93 Difference]: Finished difference Result 5946 states and 22845 transitions. [2025-04-13 18:07:40,743 INFO L140 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 10 states. [2025-04-13 18:07:40,744 INFO L79 Accepts]: Start accepts. Automaton has has 8 states, 7 states have (on average 5.571428571428571) internal successors, (39), 8 states have internal predecessors, (39), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 40 [2025-04-13 18:07:40,744 INFO L85 Accepts]: Finished accepts. some prefix is accepted. [2025-04-13 18:07:40,761 INFO L225 Difference]: With dead ends: 5946 [2025-04-13 18:07:40,761 INFO L226 Difference]: Without dead ends: 5695 [2025-04-13 18:07:40,763 INFO L436 NwaCegarLoop]: 0 DeclaredPredicates, 12 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 10 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 5 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=35, Invalid=97, Unknown=0, NotChecked=0, Total=132 [2025-04-13 18:07:40,763 INFO L437 NwaCegarLoop]: 9 mSDtfsCounter, 177 mSDsluCounter, 42 mSDsCounter, 0 mSdLazyCounter, 759 mSolverCounterSat, 1 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.3s Time, 0 mProtectedPredicate, 0 mProtectedAction, 177 SdHoareTripleChecker+Valid, 51 SdHoareTripleChecker+Invalid, 760 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 1 IncrementalHoareTripleChecker+Valid, 759 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.3s IncrementalHoareTripleChecker+Time [2025-04-13 18:07:40,764 INFO L438 NwaCegarLoop]: SdHoareTripleChecker [177 Valid, 51 Invalid, 760 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [1 Valid, 759 Invalid, 0 Unknown, 0 Unchecked, 0.3s Time] [2025-04-13 18:07:40,768 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 5695 states. [2025-04-13 18:07:41,056 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 5695 to 3697. [2025-04-13 18:07:41,060 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 3697 states, 3696 states have (on average 3.8284632034632033) internal successors, (14150), 3696 states have internal predecessors, (14150), 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 18:07:41,067 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3697 states to 3697 states and 14150 transitions. [2025-04-13 18:07:41,075 INFO L79 Accepts]: Start accepts. Automaton has 3697 states and 14150 transitions. Word has length 40 [2025-04-13 18:07:41,075 INFO L85 Accepts]: Finished accepts. word is rejected. [2025-04-13 18:07:41,075 INFO L485 AbstractCegarLoop]: Abstraction has 3697 states and 14150 transitions. [2025-04-13 18:07:41,075 INFO L486 AbstractCegarLoop]: INTERPOLANT automaton has has 8 states, 7 states have (on average 5.571428571428571) internal successors, (39), 8 states have internal predecessors, (39), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-04-13 18:07:41,075 INFO L278 IsEmpty]: Start isEmpty. Operand 3697 states and 14150 transitions. [2025-04-13 18:07:41,081 INFO L284 IsEmpty]: Finished isEmpty. Found accepting run of length 41 [2025-04-13 18:07:41,081 INFO L210 NwaCegarLoop]: Found error trace [2025-04-13 18:07:41,081 INFO L218 NwaCegarLoop]: trace histogram [2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-04-13 18:07:41,081 WARN L466 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable16 [2025-04-13 18:07:41,081 INFO L403 AbstractCegarLoop]: === Iteration 18 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [thread1Err0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES, thread1Err3INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION (and 4 more)] === [2025-04-13 18:07:41,081 INFO L155 PredicateUnifier]: Initialized classic predicate unifier [2025-04-13 18:07:41,081 INFO L85 PathProgramCache]: Analyzing trace with hash -1454958281, now seen corresponding path program 5 times [2025-04-13 18:07:41,081 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-04-13 18:07:41,082 INFO L324 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [367237714] [2025-04-13 18:07:41,082 INFO L95 rtionOrderModulation]: Changing assertion order to INSIDE_LOOP_FIRST1 [2025-04-13 18:07:41,082 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-04-13 18:07:41,087 INFO L108 AnnotateAndAsserter]: Assert order INSIDE_LOOP_FIRST1 partitioned 40 statements into 2 equivalence classes. [2025-04-13 18:07:41,094 INFO L111 AnnotateAndAsserter]: Assert order INSIDE_LOOP_FIRST1 issued 2 check-sat command(s) and asserted 40 of 40 statements. [2025-04-13 18:07:41,094 INFO L114 AnnotateAndAsserter]: Assert order INSIDE_LOOP_FIRST1 issued 2 check-sat command(s) [2025-04-13 18:07:41,094 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-04-13 18:07:41,475 INFO L134 CoverageAnalysis]: Checked inductivity of 3 backedges. 0 proven. 3 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-04-13 18:07:41,475 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-04-13 18:07:41,475 INFO L324 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [367237714] [2025-04-13 18:07:41,475 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [367237714] provided 0 perfect and 1 imperfect interpolant sequences [2025-04-13 18:07:41,475 INFO L324 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [26541283] [2025-04-13 18:07:41,475 INFO L95 rtionOrderModulation]: Changing assertion order to INSIDE_LOOP_FIRST1 [2025-04-13 18:07:41,476 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-04-13 18:07:41,476 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2025-04-13 18:07:41,477 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 18:07:41,479 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 18:07:41,534 INFO L108 AnnotateAndAsserter]: Assert order INSIDE_LOOP_FIRST1 partitioned 40 statements into 2 equivalence classes. [2025-04-13 18:07:41,554 INFO L111 AnnotateAndAsserter]: Assert order INSIDE_LOOP_FIRST1 issued 2 check-sat command(s) and asserted 40 of 40 statements. [2025-04-13 18:07:41,554 INFO L114 AnnotateAndAsserter]: Assert order INSIDE_LOOP_FIRST1 issued 2 check-sat command(s) [2025-04-13 18:07:41,554 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-04-13 18:07:41,556 INFO L256 TraceCheckSpWp]: Trace formula consists of 266 conjuncts, 35 conjuncts are in the unsatisfiable core [2025-04-13 18:07:41,557 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-04-13 18:07:41,666 INFO L354 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 15 treesize of output 7 [2025-04-13 18:07:41,685 INFO L134 CoverageAnalysis]: Checked inductivity of 3 backedges. 0 proven. 2 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2025-04-13 18:07:41,685 INFO L312 TraceCheckSpWp]: Computing backward predicates... [2025-04-13 18:07:41,741 INFO L325 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2025-04-13 18:07:41,741 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 25 treesize of output 16 [2025-04-13 18:07:41,770 INFO L134 CoverageAnalysis]: Checked inductivity of 3 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 3 trivial. 0 not checked. [2025-04-13 18:07:41,770 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [26541283] provided 1 perfect and 1 imperfect interpolant sequences [2025-04-13 18:07:41,770 INFO L185 FreeRefinementEngine]: Found 1 perfect and 2 imperfect interpolant sequences. [2025-04-13 18:07:41,770 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [7] imperfect sequences [11, 9] total 18 [2025-04-13 18:07:41,771 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [695550352] [2025-04-13 18:07:41,771 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-04-13 18:07:41,771 INFO L562 AbstractCegarLoop]: INTERPOLANT automaton has 8 states [2025-04-13 18:07:41,771 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-04-13 18:07:41,771 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2025-04-13 18:07:41,771 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=58, Invalid=284, Unknown=0, NotChecked=0, Total=342 [2025-04-13 18:07:41,771 INFO L87 Difference]: Start difference. First operand 3697 states and 14150 transitions. Second operand has 8 states, 7 states have (on average 5.571428571428571) internal successors, (39), 8 states have internal predecessors, (39), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-04-13 18:07:43,120 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-04-13 18:07:43,121 INFO L93 Difference]: Finished difference Result 6263 states and 23988 transitions. [2025-04-13 18:07:43,121 INFO L140 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2025-04-13 18:07:43,121 INFO L79 Accepts]: Start accepts. Automaton has has 8 states, 7 states have (on average 5.571428571428571) internal successors, (39), 8 states have internal predecessors, (39), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 40 [2025-04-13 18:07:43,121 INFO L85 Accepts]: Finished accepts. some prefix is accepted. [2025-04-13 18:07:43,143 INFO L225 Difference]: With dead ends: 6263 [2025-04-13 18:07:43,144 INFO L226 Difference]: Without dead ends: 5988 [2025-04-13 18:07:43,146 INFO L436 NwaCegarLoop]: 0 DeclaredPredicates, 93 GetRequests, 73 SyntacticMatches, 0 SemanticMatches, 20 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 107 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=76, Invalid=386, Unknown=0, NotChecked=0, Total=462 [2025-04-13 18:07:43,147 INFO L437 NwaCegarLoop]: 10 mSDtfsCounter, 132 mSDsluCounter, 53 mSDsCounter, 0 mSdLazyCounter, 817 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.3s Time, 0 mProtectedPredicate, 0 mProtectedAction, 132 SdHoareTripleChecker+Valid, 63 SdHoareTripleChecker+Invalid, 817 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 817 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.4s IncrementalHoareTripleChecker+Time [2025-04-13 18:07:43,147 INFO L438 NwaCegarLoop]: SdHoareTripleChecker [132 Valid, 63 Invalid, 817 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 817 Invalid, 0 Unknown, 0 Unchecked, 0.4s Time] [2025-04-13 18:07:43,158 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 5988 states. [2025-04-13 18:07:43,696 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 5988 to 3965. [2025-04-13 18:07:43,701 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 3965 states, 3964 states have (on average 3.850151362260343) internal successors, (15262), 3964 states have internal predecessors, (15262), 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 18:07:43,711 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3965 states to 3965 states and 15262 transitions. [2025-04-13 18:07:43,721 INFO L79 Accepts]: Start accepts. Automaton has 3965 states and 15262 transitions. Word has length 40 [2025-04-13 18:07:43,721 INFO L85 Accepts]: Finished accepts. word is rejected. [2025-04-13 18:07:43,721 INFO L485 AbstractCegarLoop]: Abstraction has 3965 states and 15262 transitions. [2025-04-13 18:07:43,721 INFO L486 AbstractCegarLoop]: INTERPOLANT automaton has has 8 states, 7 states have (on average 5.571428571428571) internal successors, (39), 8 states have internal predecessors, (39), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-04-13 18:07:43,721 INFO L278 IsEmpty]: Start isEmpty. Operand 3965 states and 15262 transitions. [2025-04-13 18:07:43,731 INFO L284 IsEmpty]: Finished isEmpty. Found accepting run of length 41 [2025-04-13 18:07:43,731 INFO L210 NwaCegarLoop]: Found error trace [2025-04-13 18:07:43,731 INFO L218 NwaCegarLoop]: trace histogram [2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-04-13 18:07:43,738 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (11)] Forceful destruction successful, exit code 0 [2025-04-13 18:07:43,936 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,SelfDestructingSolverStorable17 [2025-04-13 18:07:43,936 INFO L403 AbstractCegarLoop]: === Iteration 19 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [thread1Err0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES, thread1Err3INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION (and 4 more)] === [2025-04-13 18:07:43,936 INFO L155 PredicateUnifier]: Initialized classic predicate unifier [2025-04-13 18:07:43,941 INFO L85 PathProgramCache]: Analyzing trace with hash -590248296, now seen corresponding path program 5 times [2025-04-13 18:07:43,941 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-04-13 18:07:43,941 INFO L324 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [27377655] [2025-04-13 18:07:43,941 INFO L95 rtionOrderModulation]: Changing assertion order to INSIDE_LOOP_FIRST1 [2025-04-13 18:07:43,941 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-04-13 18:07:43,948 INFO L108 AnnotateAndAsserter]: Assert order INSIDE_LOOP_FIRST1 partitioned 40 statements into 2 equivalence classes. [2025-04-13 18:07:43,967 INFO L111 AnnotateAndAsserter]: Assert order INSIDE_LOOP_FIRST1 issued 2 check-sat command(s) and asserted 40 of 40 statements. [2025-04-13 18:07:43,967 INFO L114 AnnotateAndAsserter]: Assert order INSIDE_LOOP_FIRST1 issued 2 check-sat command(s) [2025-04-13 18:07:43,967 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-04-13 18:07:44,588 INFO L134 CoverageAnalysis]: Checked inductivity of 4 backedges. 0 proven. 4 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-04-13 18:07:44,588 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-04-13 18:07:44,588 INFO L324 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [27377655] [2025-04-13 18:07:44,588 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [27377655] provided 0 perfect and 1 imperfect interpolant sequences [2025-04-13 18:07:44,588 INFO L324 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [446057101] [2025-04-13 18:07:44,588 INFO L95 rtionOrderModulation]: Changing assertion order to INSIDE_LOOP_FIRST1 [2025-04-13 18:07:44,588 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-04-13 18:07:44,589 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2025-04-13 18:07:44,593 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 18:07:44,595 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 18:07:44,702 INFO L108 AnnotateAndAsserter]: Assert order INSIDE_LOOP_FIRST1 partitioned 40 statements into 2 equivalence classes. [2025-04-13 18:07:44,739 INFO L111 AnnotateAndAsserter]: Assert order INSIDE_LOOP_FIRST1 issued 2 check-sat command(s) and asserted 40 of 40 statements. [2025-04-13 18:07:44,739 INFO L114 AnnotateAndAsserter]: Assert order INSIDE_LOOP_FIRST1 issued 2 check-sat command(s) [2025-04-13 18:07:44,739 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-04-13 18:07:44,744 INFO L256 TraceCheckSpWp]: Trace formula consists of 266 conjuncts, 25 conjuncts are in the unsatisfiable core [2025-04-13 18:07:44,745 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-04-13 18:07:44,936 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 19 treesize of output 7 [2025-04-13 18:07:44,969 INFO L134 CoverageAnalysis]: Checked inductivity of 4 backedges. 0 proven. 1 refuted. 0 times theorem prover too weak. 3 trivial. 0 not checked. [2025-04-13 18:07:44,969 INFO L312 TraceCheckSpWp]: Computing backward predicates... [2025-04-13 18:07:45,055 INFO L325 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2025-04-13 18:07:45,055 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 25 treesize of output 16 [2025-04-13 18:07:45,096 INFO L134 CoverageAnalysis]: Checked inductivity of 4 backedges. 0 proven. 1 refuted. 0 times theorem prover too weak. 3 trivial. 0 not checked. [2025-04-13 18:07:45,096 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [446057101] provided 0 perfect and 2 imperfect interpolant sequences [2025-04-13 18:07:45,096 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2025-04-13 18:07:45,097 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [9, 7, 7] total 15 [2025-04-13 18:07:45,097 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [497650603] [2025-04-13 18:07:45,097 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2025-04-13 18:07:45,097 INFO L562 AbstractCegarLoop]: INTERPOLANT automaton has 16 states [2025-04-13 18:07:45,097 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-04-13 18:07:45,097 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 16 interpolants. [2025-04-13 18:07:45,097 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=41, Invalid=199, Unknown=0, NotChecked=0, Total=240 [2025-04-13 18:07:45,098 INFO L87 Difference]: Start difference. First operand 3965 states and 15262 transitions. Second operand has 16 states, 15 states have (on average 4.133333333333334) internal successors, (62), 16 states have internal predecessors, (62), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-04-13 18:07:46,532 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-04-13 18:07:46,532 INFO L93 Difference]: Finished difference Result 6099 states and 23414 transitions. [2025-04-13 18:07:46,533 INFO L140 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 11 states. [2025-04-13 18:07:46,533 INFO L79 Accepts]: Start accepts. Automaton has has 16 states, 15 states have (on average 4.133333333333334) internal successors, (62), 16 states have internal predecessors, (62), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 40 [2025-04-13 18:07:46,533 INFO L85 Accepts]: Finished accepts. some prefix is accepted. [2025-04-13 18:07:46,552 INFO L225 Difference]: With dead ends: 6099 [2025-04-13 18:07:46,553 INFO L226 Difference]: Without dead ends: 5848 [2025-04-13 18:07:46,554 INFO L436 NwaCegarLoop]: 0 DeclaredPredicates, 89 GetRequests, 74 SyntacticMatches, 0 SemanticMatches, 15 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 29 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=46, Invalid=226, Unknown=0, NotChecked=0, Total=272 [2025-04-13 18:07:46,554 INFO L437 NwaCegarLoop]: 10 mSDtfsCounter, 168 mSDsluCounter, 77 mSDsCounter, 0 mSdLazyCounter, 1122 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.5s Time, 0 mProtectedPredicate, 0 mProtectedAction, 168 SdHoareTripleChecker+Valid, 87 SdHoareTripleChecker+Invalid, 1122 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 1122 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.6s IncrementalHoareTripleChecker+Time [2025-04-13 18:07:46,554 INFO L438 NwaCegarLoop]: SdHoareTripleChecker [168 Valid, 87 Invalid, 1122 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 1122 Invalid, 0 Unknown, 0 Unchecked, 0.6s Time] [2025-04-13 18:07:46,559 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 5848 states. [2025-04-13 18:07:46,922 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 5848 to 3877. [2025-04-13 18:07:46,933 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 3877 states, 3876 states have (on average 3.8328173374613) internal successors, (14856), 3876 states have internal predecessors, (14856), 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 18:07:46,943 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3877 states to 3877 states and 14856 transitions. [2025-04-13 18:07:46,950 INFO L79 Accepts]: Start accepts. Automaton has 3877 states and 14856 transitions. Word has length 40 [2025-04-13 18:07:46,950 INFO L85 Accepts]: Finished accepts. word is rejected. [2025-04-13 18:07:46,950 INFO L485 AbstractCegarLoop]: Abstraction has 3877 states and 14856 transitions. [2025-04-13 18:07:46,950 INFO L486 AbstractCegarLoop]: INTERPOLANT automaton has has 16 states, 15 states have (on average 4.133333333333334) internal successors, (62), 16 states have internal predecessors, (62), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-04-13 18:07:46,950 INFO L278 IsEmpty]: Start isEmpty. Operand 3877 states and 14856 transitions. [2025-04-13 18:07:46,956 INFO L284 IsEmpty]: Finished isEmpty. Found accepting run of length 41 [2025-04-13 18:07:46,956 INFO L210 NwaCegarLoop]: Found error trace [2025-04-13 18:07:46,956 INFO L218 NwaCegarLoop]: trace histogram [2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-04-13 18:07:46,961 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (12)] Forceful destruction successful, exit code 0 [2025-04-13 18:07:47,159 WARN L466 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable18,12 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-04-13 18:07:47,159 INFO L403 AbstractCegarLoop]: === Iteration 20 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [thread1Err0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES, thread1Err3INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION (and 4 more)] === [2025-04-13 18:07:47,159 INFO L155 PredicateUnifier]: Initialized classic predicate unifier [2025-04-13 18:07:47,160 INFO L85 PathProgramCache]: Analyzing trace with hash 735333943, now seen corresponding path program 6 times [2025-04-13 18:07:47,160 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-04-13 18:07:47,160 INFO L324 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1301838957] [2025-04-13 18:07:47,160 INFO L95 rtionOrderModulation]: Changing assertion order to MIX_INSIDE_OUTSIDE [2025-04-13 18:07:47,160 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-04-13 18:07:47,167 INFO L108 AnnotateAndAsserter]: Assert order MIX_INSIDE_OUTSIDE partitioned 40 statements into 2 equivalence classes. [2025-04-13 18:07:47,171 INFO L111 AnnotateAndAsserter]: Assert order MIX_INSIDE_OUTSIDE issued 1 check-sat command(s) and asserted 38 of 40 statements. [2025-04-13 18:07:47,172 INFO L114 AnnotateAndAsserter]: Assert order MIX_INSIDE_OUTSIDE issued 1 check-sat command(s) [2025-04-13 18:07:47,172 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-04-13 18:07:47,308 INFO L134 CoverageAnalysis]: Checked inductivity of 3 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 3 trivial. 0 not checked. [2025-04-13 18:07:47,309 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-04-13 18:07:47,309 INFO L324 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1301838957] [2025-04-13 18:07:47,309 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1301838957] provided 1 perfect and 0 imperfect interpolant sequences [2025-04-13 18:07:47,309 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-04-13 18:07:47,309 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [8] imperfect sequences [] total 8 [2025-04-13 18:07:47,309 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [76173332] [2025-04-13 18:07:47,309 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-04-13 18:07:47,309 INFO L562 AbstractCegarLoop]: INTERPOLANT automaton has 9 states [2025-04-13 18:07:47,309 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-04-13 18:07:47,310 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2025-04-13 18:07:47,310 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=20, Invalid=52, Unknown=0, NotChecked=0, Total=72 [2025-04-13 18:07:47,310 INFO L87 Difference]: Start difference. First operand 3877 states and 14856 transitions. Second operand has 9 states, 8 states have (on average 4.875) internal successors, (39), 9 states have internal predecessors, (39), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-04-13 18:07:48,437 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-04-13 18:07:48,438 INFO L93 Difference]: Finished difference Result 5811 states and 22262 transitions. [2025-04-13 18:07:48,438 INFO L140 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 10 states. [2025-04-13 18:07:48,438 INFO L79 Accepts]: Start accepts. Automaton has has 9 states, 8 states have (on average 4.875) internal successors, (39), 9 states have internal predecessors, (39), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 40 [2025-04-13 18:07:48,438 INFO L85 Accepts]: Finished accepts. some prefix is accepted. [2025-04-13 18:07:48,455 INFO L225 Difference]: With dead ends: 5811 [2025-04-13 18:07:48,455 INFO L226 Difference]: Without dead ends: 5536 [2025-04-13 18:07:48,457 INFO L436 NwaCegarLoop]: 0 DeclaredPredicates, 9 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 8 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 6 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=25, Invalid=65, Unknown=0, NotChecked=0, Total=90 [2025-04-13 18:07:48,457 INFO L437 NwaCegarLoop]: 9 mSDtfsCounter, 141 mSDsluCounter, 43 mSDsCounter, 0 mSdLazyCounter, 701 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.3s Time, 0 mProtectedPredicate, 0 mProtectedAction, 141 SdHoareTripleChecker+Valid, 52 SdHoareTripleChecker+Invalid, 701 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 701 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.3s IncrementalHoareTripleChecker+Time [2025-04-13 18:07:48,457 INFO L438 NwaCegarLoop]: SdHoareTripleChecker [141 Valid, 52 Invalid, 701 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 701 Invalid, 0 Unknown, 0 Unchecked, 0.3s Time] [2025-04-13 18:07:48,461 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 5536 states. [2025-04-13 18:07:48,837 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 5536 to 3901. [2025-04-13 18:07:48,841 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 3901 states, 3900 states have (on average 3.8333333333333335) internal successors, (14950), 3900 states have internal predecessors, (14950), 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 18:07:48,850 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3901 states to 3901 states and 14950 transitions. [2025-04-13 18:07:48,856 INFO L79 Accepts]: Start accepts. Automaton has 3901 states and 14950 transitions. Word has length 40 [2025-04-13 18:07:48,856 INFO L85 Accepts]: Finished accepts. word is rejected. [2025-04-13 18:07:48,856 INFO L485 AbstractCegarLoop]: Abstraction has 3901 states and 14950 transitions. [2025-04-13 18:07:48,856 INFO L486 AbstractCegarLoop]: INTERPOLANT automaton has has 9 states, 8 states have (on average 4.875) internal successors, (39), 9 states have internal predecessors, (39), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-04-13 18:07:48,856 INFO L278 IsEmpty]: Start isEmpty. Operand 3901 states and 14950 transitions. [2025-04-13 18:07:48,862 INFO L284 IsEmpty]: Finished isEmpty. Found accepting run of length 41 [2025-04-13 18:07:48,862 INFO L210 NwaCegarLoop]: Found error trace [2025-04-13 18:07:48,862 INFO L218 NwaCegarLoop]: trace histogram [2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-04-13 18:07:48,862 WARN L466 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable19 [2025-04-13 18:07:48,862 INFO L403 AbstractCegarLoop]: === Iteration 21 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [thread1Err0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES, thread1Err3INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION (and 4 more)] === [2025-04-13 18:07:48,862 INFO L155 PredicateUnifier]: Initialized classic predicate unifier [2025-04-13 18:07:48,862 INFO L85 PathProgramCache]: Analyzing trace with hash 1523193231, now seen corresponding path program 7 times [2025-04-13 18:07:48,862 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-04-13 18:07:48,863 INFO L324 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1366134569] [2025-04-13 18:07:48,863 INFO L95 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2025-04-13 18:07:48,863 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-04-13 18:07:48,868 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 40 statements into 1 equivalence classes. [2025-04-13 18:07:48,873 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 40 of 40 statements. [2025-04-13 18:07:48,873 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-04-13 18:07:48,873 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-04-13 18:07:49,129 INFO L134 CoverageAnalysis]: Checked inductivity of 4 backedges. 0 proven. 4 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-04-13 18:07:49,129 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-04-13 18:07:49,129 INFO L324 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1366134569] [2025-04-13 18:07:49,129 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1366134569] provided 0 perfect and 1 imperfect interpolant sequences [2025-04-13 18:07:49,129 INFO L324 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [2118518197] [2025-04-13 18:07:49,130 INFO L95 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2025-04-13 18:07:49,130 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-04-13 18:07:49,130 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2025-04-13 18:07:49,131 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 18:07:49,133 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 18:07:49,192 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 40 statements into 1 equivalence classes. [2025-04-13 18:07:49,216 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 40 of 40 statements. [2025-04-13 18:07:49,216 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-04-13 18:07:49,216 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-04-13 18:07:49,217 INFO L256 TraceCheckSpWp]: Trace formula consists of 266 conjuncts, 25 conjuncts are in the unsatisfiable core [2025-04-13 18:07:49,218 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-04-13 18:07:49,303 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 19 treesize of output 7 [2025-04-13 18:07:49,323 INFO L134 CoverageAnalysis]: Checked inductivity of 4 backedges. 0 proven. 1 refuted. 0 times theorem prover too weak. 3 trivial. 0 not checked. [2025-04-13 18:07:49,323 INFO L312 TraceCheckSpWp]: Computing backward predicates... [2025-04-13 18:07:49,375 INFO L325 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2025-04-13 18:07:49,375 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 25 treesize of output 16 [2025-04-13 18:07:49,394 INFO L134 CoverageAnalysis]: Checked inductivity of 4 backedges. 0 proven. 1 refuted. 0 times theorem prover too weak. 3 trivial. 0 not checked. [2025-04-13 18:07:49,394 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [2118518197] provided 0 perfect and 2 imperfect interpolant sequences [2025-04-13 18:07:49,394 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2025-04-13 18:07:49,394 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [10, 7, 7] total 18 [2025-04-13 18:07:49,394 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [145430751] [2025-04-13 18:07:49,394 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2025-04-13 18:07:49,394 INFO L562 AbstractCegarLoop]: INTERPOLANT automaton has 19 states [2025-04-13 18:07:49,394 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-04-13 18:07:49,395 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 19 interpolants. [2025-04-13 18:07:49,395 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=58, Invalid=284, Unknown=0, NotChecked=0, Total=342 [2025-04-13 18:07:49,395 INFO L87 Difference]: Start difference. First operand 3901 states and 14950 transitions. Second operand has 19 states, 18 states have (on average 4.166666666666667) internal successors, (75), 19 states have internal predecessors, (75), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-04-13 18:07:50,620 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-04-13 18:07:50,620 INFO L93 Difference]: Finished difference Result 5816 states and 22264 transitions. [2025-04-13 18:07:50,621 INFO L140 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 13 states. [2025-04-13 18:07:50,621 INFO L79 Accepts]: Start accepts. Automaton has has 19 states, 18 states have (on average 4.166666666666667) internal successors, (75), 19 states have internal predecessors, (75), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 40 [2025-04-13 18:07:50,621 INFO L85 Accepts]: Finished accepts. some prefix is accepted. [2025-04-13 18:07:50,639 INFO L225 Difference]: With dead ends: 5816 [2025-04-13 18:07:50,639 INFO L226 Difference]: Without dead ends: 5565 [2025-04-13 18:07:50,641 INFO L436 NwaCegarLoop]: 0 DeclaredPredicates, 95 GetRequests, 71 SyntacticMatches, 0 SemanticMatches, 24 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 121 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=100, Invalid=550, Unknown=0, NotChecked=0, Total=650 [2025-04-13 18:07:50,641 INFO L437 NwaCegarLoop]: 9 mSDtfsCounter, 180 mSDsluCounter, 77 mSDsCounter, 0 mSdLazyCounter, 1192 mSolverCounterSat, 1 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.3s Time, 0 mProtectedPredicate, 0 mProtectedAction, 180 SdHoareTripleChecker+Valid, 86 SdHoareTripleChecker+Invalid, 1193 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 1 IncrementalHoareTripleChecker+Valid, 1192 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.4s IncrementalHoareTripleChecker+Time [2025-04-13 18:07:50,641 INFO L438 NwaCegarLoop]: SdHoareTripleChecker [180 Valid, 86 Invalid, 1193 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [1 Valid, 1192 Invalid, 0 Unknown, 0 Unchecked, 0.4s Time] [2025-04-13 18:07:50,645 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 5565 states. [2025-04-13 18:07:51,023 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 5565 to 3853. [2025-04-13 18:07:51,027 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 3853 states, 3852 states have (on average 3.8343717549325027) internal successors, (14770), 3852 states have internal predecessors, (14770), 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 18:07:51,034 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3853 states to 3853 states and 14770 transitions. [2025-04-13 18:07:51,039 INFO L79 Accepts]: Start accepts. Automaton has 3853 states and 14770 transitions. Word has length 40 [2025-04-13 18:07:51,039 INFO L85 Accepts]: Finished accepts. word is rejected. [2025-04-13 18:07:51,039 INFO L485 AbstractCegarLoop]: Abstraction has 3853 states and 14770 transitions. [2025-04-13 18:07:51,039 INFO L486 AbstractCegarLoop]: INTERPOLANT automaton has has 19 states, 18 states have (on average 4.166666666666667) internal successors, (75), 19 states have internal predecessors, (75), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-04-13 18:07:51,039 INFO L278 IsEmpty]: Start isEmpty. Operand 3853 states and 14770 transitions. [2025-04-13 18:07:51,045 INFO L284 IsEmpty]: Finished isEmpty. Found accepting run of length 41 [2025-04-13 18:07:51,045 INFO L210 NwaCegarLoop]: Found error trace [2025-04-13 18:07:51,045 INFO L218 NwaCegarLoop]: trace histogram [2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-04-13 18:07:51,051 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (13)] Forceful destruction successful, exit code 0 [2025-04-13 18:07:51,248 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,SelfDestructingSolverStorable20 [2025-04-13 18:07:51,248 INFO L403 AbstractCegarLoop]: === Iteration 22 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [thread1Err0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES, thread1Err3INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION (and 4 more)] === [2025-04-13 18:07:51,248 INFO L155 PredicateUnifier]: Initialized classic predicate unifier [2025-04-13 18:07:51,248 INFO L85 PathProgramCache]: Analyzing trace with hash -1197564042, now seen corresponding path program 6 times [2025-04-13 18:07:51,248 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-04-13 18:07:51,248 INFO L324 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [947528941] [2025-04-13 18:07:51,248 INFO L95 rtionOrderModulation]: Changing assertion order to MIX_INSIDE_OUTSIDE [2025-04-13 18:07:51,248 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-04-13 18:07:51,253 INFO L108 AnnotateAndAsserter]: Assert order MIX_INSIDE_OUTSIDE partitioned 40 statements into 2 equivalence classes. [2025-04-13 18:07:51,260 INFO L111 AnnotateAndAsserter]: Assert order MIX_INSIDE_OUTSIDE issued 2 check-sat command(s) and asserted 40 of 40 statements. [2025-04-13 18:07:51,260 INFO L114 AnnotateAndAsserter]: Assert order MIX_INSIDE_OUTSIDE issued 2 check-sat command(s) [2025-04-13 18:07:51,260 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-04-13 18:07:51,538 INFO L134 CoverageAnalysis]: Checked inductivity of 4 backedges. 0 proven. 4 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-04-13 18:07:51,538 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-04-13 18:07:51,538 INFO L324 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [947528941] [2025-04-13 18:07:51,538 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [947528941] provided 0 perfect and 1 imperfect interpolant sequences [2025-04-13 18:07:51,538 INFO L324 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1553211402] [2025-04-13 18:07:51,538 INFO L95 rtionOrderModulation]: Changing assertion order to MIX_INSIDE_OUTSIDE [2025-04-13 18:07:51,538 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-04-13 18:07:51,539 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2025-04-13 18:07:51,540 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 18:07:51,541 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 18:07:51,593 INFO L108 AnnotateAndAsserter]: Assert order MIX_INSIDE_OUTSIDE partitioned 40 statements into 2 equivalence classes. [2025-04-13 18:07:51,614 INFO L111 AnnotateAndAsserter]: Assert order MIX_INSIDE_OUTSIDE issued 2 check-sat command(s) and asserted 40 of 40 statements. [2025-04-13 18:07:51,614 INFO L114 AnnotateAndAsserter]: Assert order MIX_INSIDE_OUTSIDE issued 2 check-sat command(s) [2025-04-13 18:07:51,614 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-04-13 18:07:51,615 INFO L256 TraceCheckSpWp]: Trace formula consists of 266 conjuncts, 35 conjuncts are in the unsatisfiable core [2025-04-13 18:07:51,616 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-04-13 18:07:51,772 INFO L354 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 15 treesize of output 7 [2025-04-13 18:07:51,796 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 18:07:51,796 INFO L312 TraceCheckSpWp]: Computing backward predicates... [2025-04-13 18:07:51,856 INFO L325 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2025-04-13 18:07:51,856 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 25 treesize of output 16 [2025-04-13 18:07:51,890 INFO L134 CoverageAnalysis]: Checked inductivity of 4 backedges. 0 proven. 1 refuted. 0 times theorem prover too weak. 3 trivial. 0 not checked. [2025-04-13 18:07:51,890 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1553211402] provided 0 perfect and 2 imperfect interpolant sequences [2025-04-13 18:07:51,890 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2025-04-13 18:07:51,890 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [11, 9, 7] total 19 [2025-04-13 18:07:51,890 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [90579460] [2025-04-13 18:07:51,890 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2025-04-13 18:07:51,891 INFO L562 AbstractCegarLoop]: INTERPOLANT automaton has 20 states [2025-04-13 18:07:51,891 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-04-13 18:07:51,891 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 20 interpolants. [2025-04-13 18:07:51,891 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=59, Invalid=321, Unknown=0, NotChecked=0, Total=380 [2025-04-13 18:07:51,891 INFO L87 Difference]: Start difference. First operand 3853 states and 14770 transitions. Second operand has 20 states, 19 states have (on average 4.421052631578948) internal successors, (84), 20 states have internal predecessors, (84), 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 18:07:53,848 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-04-13 18:07:53,849 INFO L93 Difference]: Finished difference Result 6060 states and 23246 transitions. [2025-04-13 18:07:53,849 INFO L140 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 14 states. [2025-04-13 18:07:53,849 INFO L79 Accepts]: Start accepts. Automaton has has 20 states, 19 states have (on average 4.421052631578948) internal successors, (84), 20 states have internal predecessors, (84), 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 40 [2025-04-13 18:07:53,849 INFO L85 Accepts]: Finished accepts. some prefix is accepted. [2025-04-13 18:07:53,870 INFO L225 Difference]: With dead ends: 6060 [2025-04-13 18:07:53,871 INFO L226 Difference]: Without dead ends: 5839 [2025-04-13 18:07:53,873 INFO L436 NwaCegarLoop]: 0 DeclaredPredicates, 99 GetRequests, 72 SyntacticMatches, 0 SemanticMatches, 27 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 168 ImplicationChecksByTransitivity, 0.3s TimeCoverageRelationStatistics Valid=121, Invalid=691, Unknown=0, NotChecked=0, Total=812 [2025-04-13 18:07:53,879 INFO L437 NwaCegarLoop]: 9 mSDtfsCounter, 273 mSDsluCounter, 79 mSDsCounter, 0 mSdLazyCounter, 1280 mSolverCounterSat, 3 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.5s Time, 0 mProtectedPredicate, 0 mProtectedAction, 273 SdHoareTripleChecker+Valid, 88 SdHoareTripleChecker+Invalid, 1283 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 3 IncrementalHoareTripleChecker+Valid, 1280 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.6s IncrementalHoareTripleChecker+Time [2025-04-13 18:07:53,879 INFO L438 NwaCegarLoop]: SdHoareTripleChecker [273 Valid, 88 Invalid, 1283 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [3 Valid, 1280 Invalid, 0 Unknown, 0 Unchecked, 0.6s Time] [2025-04-13 18:07:53,889 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 5839 states. [2025-04-13 18:07:54,573 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 5839 to 3923. [2025-04-13 18:07:54,587 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 3923 states, 3922 states have (on average 3.8304436511983684) internal successors, (15023), 3922 states have internal predecessors, (15023), 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 18:07:54,597 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3923 states to 3923 states and 15023 transitions. [2025-04-13 18:07:54,605 INFO L79 Accepts]: Start accepts. Automaton has 3923 states and 15023 transitions. Word has length 40 [2025-04-13 18:07:54,605 INFO L85 Accepts]: Finished accepts. word is rejected. [2025-04-13 18:07:54,605 INFO L485 AbstractCegarLoop]: Abstraction has 3923 states and 15023 transitions. [2025-04-13 18:07:54,605 INFO L486 AbstractCegarLoop]: INTERPOLANT automaton has has 20 states, 19 states have (on average 4.421052631578948) internal successors, (84), 20 states have internal predecessors, (84), 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 18:07:54,606 INFO L278 IsEmpty]: Start isEmpty. Operand 3923 states and 15023 transitions. [2025-04-13 18:07:54,612 INFO L284 IsEmpty]: Finished isEmpty. Found accepting run of length 41 [2025-04-13 18:07:54,612 INFO L210 NwaCegarLoop]: Found error trace [2025-04-13 18:07:54,612 INFO L218 NwaCegarLoop]: trace histogram [2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-04-13 18:07:54,654 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 18:07:54,849 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,SelfDestructingSolverStorable21 [2025-04-13 18:07:54,850 INFO L403 AbstractCegarLoop]: === Iteration 23 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [thread1Err0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES, thread1Err3INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION (and 4 more)] === [2025-04-13 18:07:54,850 INFO L155 PredicateUnifier]: Initialized classic predicate unifier [2025-04-13 18:07:54,850 INFO L85 PathProgramCache]: Analyzing trace with hash 1763738234, now seen corresponding path program 7 times [2025-04-13 18:07:54,850 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-04-13 18:07:54,850 INFO L324 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2102716218] [2025-04-13 18:07:54,850 INFO L95 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2025-04-13 18:07:54,850 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-04-13 18:07:54,857 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 40 statements into 1 equivalence classes. [2025-04-13 18:07:54,870 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 40 of 40 statements. [2025-04-13 18:07:54,870 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-04-13 18:07:54,870 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-04-13 18:07:55,433 INFO L134 CoverageAnalysis]: Checked inductivity of 3 backedges. 0 proven. 3 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-04-13 18:07:55,433 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-04-13 18:07:55,433 INFO L324 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2102716218] [2025-04-13 18:07:55,433 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [2102716218] provided 0 perfect and 1 imperfect interpolant sequences [2025-04-13 18:07:55,433 INFO L324 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [663446714] [2025-04-13 18:07:55,433 INFO L95 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2025-04-13 18:07:55,433 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-04-13 18:07:55,434 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2025-04-13 18:07:55,440 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 18:07:55,442 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 18:07:55,554 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 40 statements into 1 equivalence classes. [2025-04-13 18:07:55,585 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 40 of 40 statements. [2025-04-13 18:07:55,585 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-04-13 18:07:55,585 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-04-13 18:07:55,590 INFO L256 TraceCheckSpWp]: Trace formula consists of 266 conjuncts, 25 conjuncts are in the unsatisfiable core [2025-04-13 18:07:55,591 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-04-13 18:07:55,701 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 19 treesize of output 7 [2025-04-13 18:07:55,721 INFO L134 CoverageAnalysis]: Checked inductivity of 3 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 3 trivial. 0 not checked. [2025-04-13 18:07:55,722 INFO L308 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2025-04-13 18:07:55,722 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [663446714] provided 1 perfect and 0 imperfect interpolant sequences [2025-04-13 18:07:55,722 INFO L185 FreeRefinementEngine]: Found 1 perfect and 1 imperfect interpolant sequences. [2025-04-13 18:07:55,722 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [7] imperfect sequences [10] total 14 [2025-04-13 18:07:55,722 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1735620923] [2025-04-13 18:07:55,722 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-04-13 18:07:55,723 INFO L562 AbstractCegarLoop]: INTERPOLANT automaton has 8 states [2025-04-13 18:07:55,723 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-04-13 18:07:55,724 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2025-04-13 18:07:55,725 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=43, Invalid=167, Unknown=0, NotChecked=0, Total=210 [2025-04-13 18:07:55,725 INFO L87 Difference]: Start difference. First operand 3923 states and 15023 transitions. Second operand has 8 states, 7 states have (on average 5.571428571428571) internal successors, (39), 8 states have internal predecessors, (39), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-04-13 18:07:57,267 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-04-13 18:07:57,268 INFO L93 Difference]: Finished difference Result 5673 states and 21793 transitions. [2025-04-13 18:07:57,268 INFO L140 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2025-04-13 18:07:57,268 INFO L79 Accepts]: Start accepts. Automaton has has 8 states, 7 states have (on average 5.571428571428571) internal successors, (39), 8 states have internal predecessors, (39), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 40 [2025-04-13 18:07:57,268 INFO L85 Accepts]: Finished accepts. some prefix is accepted. [2025-04-13 18:07:57,291 INFO L225 Difference]: With dead ends: 5673 [2025-04-13 18:07:57,291 INFO L226 Difference]: Without dead ends: 5422 [2025-04-13 18:07:57,293 INFO L436 NwaCegarLoop]: 0 DeclaredPredicates, 50 GetRequests, 36 SyntacticMatches, 0 SemanticMatches, 14 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 40 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=49, Invalid=191, Unknown=0, NotChecked=0, Total=240 [2025-04-13 18:07:57,294 INFO L437 NwaCegarLoop]: 9 mSDtfsCounter, 116 mSDsluCounter, 40 mSDsCounter, 0 mSdLazyCounter, 677 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.3s Time, 0 mProtectedPredicate, 0 mProtectedAction, 116 SdHoareTripleChecker+Valid, 49 SdHoareTripleChecker+Invalid, 677 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 677 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.4s IncrementalHoareTripleChecker+Time [2025-04-13 18:07:57,295 INFO L438 NwaCegarLoop]: SdHoareTripleChecker [116 Valid, 49 Invalid, 677 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 677 Invalid, 0 Unknown, 0 Unchecked, 0.4s Time] [2025-04-13 18:07:57,300 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 5422 states. [2025-04-13 18:07:57,950 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 5422 to 3901. [2025-04-13 18:07:57,956 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 3901 states, 3900 states have (on average 3.829230769230769) internal successors, (14934), 3900 states have internal predecessors, (14934), 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 18:07:57,965 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3901 states to 3901 states and 14934 transitions. [2025-04-13 18:07:57,973 INFO L79 Accepts]: Start accepts. Automaton has 3901 states and 14934 transitions. Word has length 40 [2025-04-13 18:07:57,973 INFO L85 Accepts]: Finished accepts. word is rejected. [2025-04-13 18:07:57,973 INFO L485 AbstractCegarLoop]: Abstraction has 3901 states and 14934 transitions. [2025-04-13 18:07:57,973 INFO L486 AbstractCegarLoop]: INTERPOLANT automaton has has 8 states, 7 states have (on average 5.571428571428571) internal successors, (39), 8 states have internal predecessors, (39), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-04-13 18:07:57,973 INFO L278 IsEmpty]: Start isEmpty. Operand 3901 states and 14934 transitions. [2025-04-13 18:07:57,982 INFO L284 IsEmpty]: Finished isEmpty. Found accepting run of length 41 [2025-04-13 18:07:57,982 INFO L210 NwaCegarLoop]: Found error trace [2025-04-13 18:07:57,985 INFO L218 NwaCegarLoop]: trace histogram [2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-04-13 18:07:57,993 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (15)] Ended with exit code 0 [2025-04-13 18:07:58,191 WARN L466 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable22,15 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-04-13 18:07:58,191 INFO L403 AbstractCegarLoop]: === Iteration 24 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [thread1Err0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES, thread1Err3INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION (and 4 more)] === [2025-04-13 18:07:58,191 INFO L155 PredicateUnifier]: Initialized classic predicate unifier [2025-04-13 18:07:58,191 INFO L85 PathProgramCache]: Analyzing trace with hash 435717327, now seen corresponding path program 8 times [2025-04-13 18:07:58,192 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-04-13 18:07:58,192 INFO L324 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [631196215] [2025-04-13 18:07:58,192 INFO L95 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST1 [2025-04-13 18:07:58,192 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-04-13 18:07:58,205 INFO L108 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 partitioned 40 statements into 2 equivalence classes. [2025-04-13 18:07:58,214 INFO L111 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 issued 1 check-sat command(s) and asserted 38 of 40 statements. [2025-04-13 18:07:58,214 INFO L114 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 issued 1 check-sat command(s) [2025-04-13 18:07:58,214 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-04-13 18:07:58,552 INFO L134 CoverageAnalysis]: Checked inductivity of 3 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 3 trivial. 0 not checked. [2025-04-13 18:07:58,553 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-04-13 18:07:58,553 INFO L324 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [631196215] [2025-04-13 18:07:58,553 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [631196215] provided 1 perfect and 0 imperfect interpolant sequences [2025-04-13 18:07:58,553 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-04-13 18:07:58,553 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2025-04-13 18:07:58,553 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [331083357] [2025-04-13 18:07:58,553 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-04-13 18:07:58,554 INFO L562 AbstractCegarLoop]: INTERPOLANT automaton has 8 states [2025-04-13 18:07:58,554 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-04-13 18:07:58,554 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2025-04-13 18:07:58,554 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=18, Invalid=38, Unknown=0, NotChecked=0, Total=56 [2025-04-13 18:07:58,554 INFO L87 Difference]: Start difference. First operand 3901 states and 14934 transitions. Second operand has 8 states, 7 states have (on average 5.571428571428571) internal successors, (39), 8 states have internal predecessors, (39), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-04-13 18:08:00,172 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-04-13 18:08:00,173 INFO L93 Difference]: Finished difference Result 5857 states and 22445 transitions. [2025-04-13 18:08:00,173 INFO L140 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2025-04-13 18:08:00,173 INFO L79 Accepts]: Start accepts. Automaton has has 8 states, 7 states have (on average 5.571428571428571) internal successors, (39), 8 states have internal predecessors, (39), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 40 [2025-04-13 18:08:00,173 INFO L85 Accepts]: Finished accepts. some prefix is accepted. [2025-04-13 18:08:00,196 INFO L225 Difference]: With dead ends: 5857 [2025-04-13 18:08:00,197 INFO L226 Difference]: Without dead ends: 5582 [2025-04-13 18:08:00,199 INFO L436 NwaCegarLoop]: 0 DeclaredPredicates, 9 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 7 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 6 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=24, Invalid=48, Unknown=0, NotChecked=0, Total=72 [2025-04-13 18:08:00,205 INFO L437 NwaCegarLoop]: 8 mSDtfsCounter, 98 mSDsluCounter, 31 mSDsCounter, 0 mSdLazyCounter, 575 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.5s Time, 0 mProtectedPredicate, 0 mProtectedAction, 98 SdHoareTripleChecker+Valid, 39 SdHoareTripleChecker+Invalid, 575 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 575 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.6s IncrementalHoareTripleChecker+Time [2025-04-13 18:08:00,205 INFO L438 NwaCegarLoop]: SdHoareTripleChecker [98 Valid, 39 Invalid, 575 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 575 Invalid, 0 Unknown, 0 Unchecked, 0.6s Time] [2025-04-13 18:08:00,210 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 5582 states. [2025-04-13 18:08:00,853 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 5582 to 3973. [2025-04-13 18:08:00,859 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 3973 states, 3972 states have (on average 3.8308157099697886) internal successors, (15216), 3972 states have internal predecessors, (15216), 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 18:08:00,868 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3973 states to 3973 states and 15216 transitions. [2025-04-13 18:08:00,876 INFO L79 Accepts]: Start accepts. Automaton has 3973 states and 15216 transitions. Word has length 40 [2025-04-13 18:08:00,876 INFO L85 Accepts]: Finished accepts. word is rejected. [2025-04-13 18:08:00,876 INFO L485 AbstractCegarLoop]: Abstraction has 3973 states and 15216 transitions. [2025-04-13 18:08:00,876 INFO L486 AbstractCegarLoop]: INTERPOLANT automaton has has 8 states, 7 states have (on average 5.571428571428571) internal successors, (39), 8 states have internal predecessors, (39), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-04-13 18:08:00,876 INFO L278 IsEmpty]: Start isEmpty. Operand 3973 states and 15216 transitions. [2025-04-13 18:08:00,884 INFO L284 IsEmpty]: Finished isEmpty. Found accepting run of length 41 [2025-04-13 18:08:00,884 INFO L210 NwaCegarLoop]: Found error trace [2025-04-13 18:08:00,885 INFO L218 NwaCegarLoop]: trace histogram [2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-04-13 18:08:00,885 WARN L466 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable23 [2025-04-13 18:08:00,885 INFO L403 AbstractCegarLoop]: === Iteration 25 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [thread1Err0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES, thread1Err3INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION (and 4 more)] === [2025-04-13 18:08:00,886 INFO L155 PredicateUnifier]: Initialized classic predicate unifier [2025-04-13 18:08:00,886 INFO L85 PathProgramCache]: Analyzing trace with hash -670744901, now seen corresponding path program 9 times [2025-04-13 18:08:00,886 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-04-13 18:08:00,886 INFO L324 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1666407070] [2025-04-13 18:08:00,886 INFO L95 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST2 [2025-04-13 18:08:00,886 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-04-13 18:08:00,892 INFO L108 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST2 partitioned 40 statements into 2 equivalence classes. [2025-04-13 18:08:00,905 INFO L111 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST2 issued 1 check-sat command(s) and asserted 38 of 40 statements. [2025-04-13 18:08:00,905 INFO L114 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST2 issued 1 check-sat command(s) [2025-04-13 18:08:00,905 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-04-13 18:08:01,140 INFO L134 CoverageAnalysis]: Checked inductivity of 3 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 3 trivial. 0 not checked. [2025-04-13 18:08:01,140 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-04-13 18:08:01,140 INFO L324 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1666407070] [2025-04-13 18:08:01,140 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1666407070] provided 1 perfect and 0 imperfect interpolant sequences [2025-04-13 18:08:01,140 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-04-13 18:08:01,141 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [8] imperfect sequences [] total 8 [2025-04-13 18:08:01,141 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [5585472] [2025-04-13 18:08:01,141 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-04-13 18:08:01,141 INFO L562 AbstractCegarLoop]: INTERPOLANT automaton has 9 states [2025-04-13 18:08:01,141 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-04-13 18:08:01,141 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2025-04-13 18:08:01,141 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=23, Invalid=49, Unknown=0, NotChecked=0, Total=72 [2025-04-13 18:08:01,141 INFO L87 Difference]: Start difference. First operand 3973 states and 15216 transitions. Second operand has 9 states, 8 states have (on average 4.875) internal successors, (39), 9 states have internal predecessors, (39), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-04-13 18:08:02,711 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-04-13 18:08:02,711 INFO L93 Difference]: Finished difference Result 5800 states and 22200 transitions. [2025-04-13 18:08:02,712 INFO L140 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 10 states. [2025-04-13 18:08:02,712 INFO L79 Accepts]: Start accepts. Automaton has has 9 states, 8 states have (on average 4.875) internal successors, (39), 9 states have internal predecessors, (39), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 40 [2025-04-13 18:08:02,712 INFO L85 Accepts]: Finished accepts. some prefix is accepted. [2025-04-13 18:08:02,734 INFO L225 Difference]: With dead ends: 5800 [2025-04-13 18:08:02,735 INFO L226 Difference]: Without dead ends: 5549 [2025-04-13 18:08:02,736 INFO L436 NwaCegarLoop]: 0 DeclaredPredicates, 9 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 8 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 8 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=29, Invalid=61, Unknown=0, NotChecked=0, Total=90 [2025-04-13 18:08:02,738 INFO L437 NwaCegarLoop]: 8 mSDtfsCounter, 134 mSDsluCounter, 40 mSDsCounter, 0 mSdLazyCounter, 731 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.3s Time, 0 mProtectedPredicate, 0 mProtectedAction, 134 SdHoareTripleChecker+Valid, 48 SdHoareTripleChecker+Invalid, 731 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 731 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.4s IncrementalHoareTripleChecker+Time [2025-04-13 18:08:02,738 INFO L438 NwaCegarLoop]: SdHoareTripleChecker [134 Valid, 48 Invalid, 731 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 731 Invalid, 0 Unknown, 0 Unchecked, 0.4s Time] [2025-04-13 18:08:02,743 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 5549 states. [2025-04-13 18:08:03,401 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 5549 to 3949. [2025-04-13 18:08:03,406 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 3949 states, 3948 states have (on average 3.830293819655522) internal successors, (15122), 3948 states have internal predecessors, (15122), 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 18:08:03,414 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3949 states to 3949 states and 15122 transitions. [2025-04-13 18:08:03,424 INFO L79 Accepts]: Start accepts. Automaton has 3949 states and 15122 transitions. Word has length 40 [2025-04-13 18:08:03,424 INFO L85 Accepts]: Finished accepts. word is rejected. [2025-04-13 18:08:03,424 INFO L485 AbstractCegarLoop]: Abstraction has 3949 states and 15122 transitions. [2025-04-13 18:08:03,424 INFO L486 AbstractCegarLoop]: INTERPOLANT automaton has has 9 states, 8 states have (on average 4.875) internal successors, (39), 9 states have internal predecessors, (39), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-04-13 18:08:03,424 INFO L278 IsEmpty]: Start isEmpty. Operand 3949 states and 15122 transitions. [2025-04-13 18:08:03,430 INFO L284 IsEmpty]: Finished isEmpty. Found accepting run of length 41 [2025-04-13 18:08:03,430 INFO L210 NwaCegarLoop]: Found error trace [2025-04-13 18:08:03,430 INFO L218 NwaCegarLoop]: trace histogram [2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-04-13 18:08:03,430 WARN L466 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable24 [2025-04-13 18:08:03,430 INFO L403 AbstractCegarLoop]: === Iteration 26 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [thread1Err0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES, thread1Err3INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION (and 4 more)] === [2025-04-13 18:08:03,432 INFO L155 PredicateUnifier]: Initialized classic predicate unifier [2025-04-13 18:08:03,432 INFO L85 PathProgramCache]: Analyzing trace with hash 1523632563, now seen corresponding path program 10 times [2025-04-13 18:08:03,432 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-04-13 18:08:03,432 INFO L324 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [690283929] [2025-04-13 18:08:03,432 INFO L95 rtionOrderModulation]: Changing assertion order to TERMS_WITH_SMALL_CONSTANTS_FIRST [2025-04-13 18:08:03,432 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-04-13 18:08:03,438 INFO L108 AnnotateAndAsserter]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST partitioned 40 statements into 2 equivalence classes. [2025-04-13 18:08:03,452 INFO L111 AnnotateAndAsserter]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST issued 2 check-sat command(s) and asserted 40 of 40 statements. [2025-04-13 18:08:03,452 INFO L114 AnnotateAndAsserter]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST issued 2 check-sat command(s) [2025-04-13 18:08:03,453 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-04-13 18:08:03,778 INFO L134 CoverageAnalysis]: Checked inductivity of 3 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 3 trivial. 0 not checked. [2025-04-13 18:08:03,778 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-04-13 18:08:03,778 INFO L324 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [690283929] [2025-04-13 18:08:03,778 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [690283929] provided 1 perfect and 0 imperfect interpolant sequences [2025-04-13 18:08:03,778 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-04-13 18:08:03,779 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2025-04-13 18:08:03,779 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1513927479] [2025-04-13 18:08:03,779 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-04-13 18:08:03,779 INFO L562 AbstractCegarLoop]: INTERPOLANT automaton has 8 states [2025-04-13 18:08:03,779 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-04-13 18:08:03,780 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2025-04-13 18:08:03,780 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=15, Invalid=41, Unknown=0, NotChecked=0, Total=56 [2025-04-13 18:08:03,780 INFO L87 Difference]: Start difference. First operand 3949 states and 15122 transitions. Second operand has 8 states, 7 states have (on average 5.571428571428571) internal successors, (39), 8 states have internal predecessors, (39), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-04-13 18:08:05,443 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-04-13 18:08:05,443 INFO L93 Difference]: Finished difference Result 6132 states and 23469 transitions. [2025-04-13 18:08:05,443 INFO L140 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 10 states. [2025-04-13 18:08:05,444 INFO L79 Accepts]: Start accepts. Automaton has has 8 states, 7 states have (on average 5.571428571428571) internal successors, (39), 8 states have internal predecessors, (39), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 40 [2025-04-13 18:08:05,444 INFO L85 Accepts]: Finished accepts. some prefix is accepted. [2025-04-13 18:08:05,468 INFO L225 Difference]: With dead ends: 6132 [2025-04-13 18:08:05,468 INFO L226 Difference]: Without dead ends: 5881 [2025-04-13 18:08:05,471 INFO L436 NwaCegarLoop]: 0 DeclaredPredicates, 12 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 10 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 6 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=35, Invalid=97, Unknown=0, NotChecked=0, Total=132 [2025-04-13 18:08:05,472 INFO L437 NwaCegarLoop]: 8 mSDtfsCounter, 142 mSDsluCounter, 34 mSDsCounter, 0 mSdLazyCounter, 648 mSolverCounterSat, 1 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.4s Time, 0 mProtectedPredicate, 0 mProtectedAction, 142 SdHoareTripleChecker+Valid, 42 SdHoareTripleChecker+Invalid, 649 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 1 IncrementalHoareTripleChecker+Valid, 648 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.6s IncrementalHoareTripleChecker+Time [2025-04-13 18:08:05,473 INFO L438 NwaCegarLoop]: SdHoareTripleChecker [142 Valid, 42 Invalid, 649 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [1 Valid, 648 Invalid, 0 Unknown, 0 Unchecked, 0.6s Time] [2025-04-13 18:08:05,479 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 5881 states. [2025-04-13 18:08:06,008 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 5881 to 4171. [2025-04-13 18:08:06,014 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 4171 states, 4170 states have (on average 3.826378896882494) internal successors, (15956), 4170 states have internal predecessors, (15956), 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 18:08:06,036 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4171 states to 4171 states and 15956 transitions. [2025-04-13 18:08:06,057 INFO L79 Accepts]: Start accepts. Automaton has 4171 states and 15956 transitions. Word has length 40 [2025-04-13 18:08:06,057 INFO L85 Accepts]: Finished accepts. word is rejected. [2025-04-13 18:08:06,057 INFO L485 AbstractCegarLoop]: Abstraction has 4171 states and 15956 transitions. [2025-04-13 18:08:06,057 INFO L486 AbstractCegarLoop]: INTERPOLANT automaton has has 8 states, 7 states have (on average 5.571428571428571) internal successors, (39), 8 states have internal predecessors, (39), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-04-13 18:08:06,058 INFO L278 IsEmpty]: Start isEmpty. Operand 4171 states and 15956 transitions. [2025-04-13 18:08:06,077 INFO L284 IsEmpty]: Finished isEmpty. Found accepting run of length 41 [2025-04-13 18:08:06,077 INFO L210 NwaCegarLoop]: Found error trace [2025-04-13 18:08:06,077 INFO L218 NwaCegarLoop]: trace histogram [2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-04-13 18:08:06,077 WARN L466 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable25 [2025-04-13 18:08:06,078 INFO L403 AbstractCegarLoop]: === Iteration 27 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [thread1Err0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES, thread1Err3INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION (and 4 more)] === [2025-04-13 18:08:06,081 INFO L155 PredicateUnifier]: Initialized classic predicate unifier [2025-04-13 18:08:06,082 INFO L85 PathProgramCache]: Analyzing trace with hash -184465698, now seen corresponding path program 8 times [2025-04-13 18:08:06,082 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-04-13 18:08:06,082 INFO L324 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [204692385] [2025-04-13 18:08:06,082 INFO L95 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST1 [2025-04-13 18:08:06,082 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-04-13 18:08:06,088 INFO L108 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 partitioned 40 statements into 2 equivalence classes. [2025-04-13 18:08:06,102 INFO L111 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) and asserted 40 of 40 statements. [2025-04-13 18:08:06,102 INFO L114 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) [2025-04-13 18:08:06,102 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-04-13 18:08:06,661 INFO L134 CoverageAnalysis]: Checked inductivity of 4 backedges. 0 proven. 4 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-04-13 18:08:06,661 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-04-13 18:08:06,661 INFO L324 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [204692385] [2025-04-13 18:08:06,661 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [204692385] provided 0 perfect and 1 imperfect interpolant sequences [2025-04-13 18:08:06,661 INFO L324 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [2047805940] [2025-04-13 18:08:06,661 INFO L95 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST1 [2025-04-13 18:08:06,661 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-04-13 18:08:06,661 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2025-04-13 18:08:06,665 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 18:08:06,684 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 18:08:06,885 INFO L108 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 partitioned 40 statements into 2 equivalence classes. [2025-04-13 18:08:06,924 INFO L111 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) and asserted 40 of 40 statements. [2025-04-13 18:08:06,924 INFO L114 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) [2025-04-13 18:08:06,924 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-04-13 18:08:06,929 INFO L256 TraceCheckSpWp]: Trace formula consists of 266 conjuncts, 41 conjuncts are in the unsatisfiable core [2025-04-13 18:08:06,931 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-04-13 18:08:06,941 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 18:08:07,242 INFO L354 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 15 treesize of output 7 [2025-04-13 18:08:07,259 INFO L134 CoverageAnalysis]: Checked inductivity of 4 backedges. 0 proven. 4 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-04-13 18:08:07,259 INFO L312 TraceCheckSpWp]: Computing backward predicates... [2025-04-13 18:08:07,605 INFO L134 CoverageAnalysis]: Checked inductivity of 4 backedges. 0 proven. 1 refuted. 0 times theorem prover too weak. 3 trivial. 0 not checked. [2025-04-13 18:08:07,605 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [2047805940] provided 0 perfect and 2 imperfect interpolant sequences [2025-04-13 18:08:07,606 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2025-04-13 18:08:07,606 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [11, 11, 8] total 22 [2025-04-13 18:08:07,606 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1686272836] [2025-04-13 18:08:07,606 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2025-04-13 18:08:07,606 INFO L562 AbstractCegarLoop]: INTERPOLANT automaton has 23 states [2025-04-13 18:08:07,606 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-04-13 18:08:07,606 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 23 interpolants. [2025-04-13 18:08:07,606 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=90, Invalid=416, Unknown=0, NotChecked=0, Total=506 [2025-04-13 18:08:07,607 INFO L87 Difference]: Start difference. First operand 4171 states and 15956 transitions. Second operand has 23 states, 22 states have (on average 3.8636363636363638) internal successors, (85), 23 states have internal predecessors, (85), 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 18:08:11,124 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-04-13 18:08:11,125 INFO L93 Difference]: Finished difference Result 6945 states and 25926 transitions. [2025-04-13 18:08:11,125 INFO L140 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 28 states. [2025-04-13 18:08:11,125 INFO L79 Accepts]: Start accepts. Automaton has has 23 states, 22 states have (on average 3.8636363636363638) internal successors, (85), 23 states have internal predecessors, (85), 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 40 [2025-04-13 18:08:11,125 INFO L85 Accepts]: Finished accepts. some prefix is accepted. [2025-04-13 18:08:11,144 INFO L225 Difference]: With dead ends: 6945 [2025-04-13 18:08:11,145 INFO L226 Difference]: Without dead ends: 6736 [2025-04-13 18:08:11,147 INFO L436 NwaCegarLoop]: 0 DeclaredPredicates, 111 GetRequests, 69 SyntacticMatches, 0 SemanticMatches, 42 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 434 ImplicationChecksByTransitivity, 1.0s TimeCoverageRelationStatistics Valid=313, Invalid=1579, Unknown=0, NotChecked=0, Total=1892 [2025-04-13 18:08:11,147 INFO L437 NwaCegarLoop]: 13 mSDtfsCounter, 443 mSDsluCounter, 165 mSDsCounter, 0 mSdLazyCounter, 2332 mSolverCounterSat, 19 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 1.3s Time, 0 mProtectedPredicate, 0 mProtectedAction, 443 SdHoareTripleChecker+Valid, 178 SdHoareTripleChecker+Invalid, 2351 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 19 IncrementalHoareTripleChecker+Valid, 2332 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 1.5s IncrementalHoareTripleChecker+Time [2025-04-13 18:08:11,147 INFO L438 NwaCegarLoop]: SdHoareTripleChecker [443 Valid, 178 Invalid, 2351 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [19 Valid, 2332 Invalid, 0 Unknown, 0 Unchecked, 1.5s Time] [2025-04-13 18:08:11,152 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 6736 states. [2025-04-13 18:08:11,664 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 6736 to 4319. [2025-04-13 18:08:11,669 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 4319 states, 4318 states have (on average 3.837424733672997) internal successors, (16570), 4318 states have internal predecessors, (16570), 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 18:08:11,677 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4319 states to 4319 states and 16570 transitions. [2025-04-13 18:08:11,683 INFO L79 Accepts]: Start accepts. Automaton has 4319 states and 16570 transitions. Word has length 40 [2025-04-13 18:08:11,683 INFO L85 Accepts]: Finished accepts. word is rejected. [2025-04-13 18:08:11,683 INFO L485 AbstractCegarLoop]: Abstraction has 4319 states and 16570 transitions. [2025-04-13 18:08:11,683 INFO L486 AbstractCegarLoop]: INTERPOLANT automaton has has 23 states, 22 states have (on average 3.8636363636363638) internal successors, (85), 23 states have internal predecessors, (85), 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 18:08:11,683 INFO L278 IsEmpty]: Start isEmpty. Operand 4319 states and 16570 transitions. [2025-04-13 18:08:11,689 INFO L284 IsEmpty]: Finished isEmpty. Found accepting run of length 41 [2025-04-13 18:08:11,689 INFO L210 NwaCegarLoop]: Found error trace [2025-04-13 18:08:11,689 INFO L218 NwaCegarLoop]: trace histogram [2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-04-13 18:08:11,696 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (16)] Ended with exit code 0 [2025-04-13 18:08:11,890 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,SelfDestructingSolverStorable26 [2025-04-13 18:08:11,890 INFO L403 AbstractCegarLoop]: === Iteration 28 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [thread1Err0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES, thread1Err3INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION (and 4 more)] === [2025-04-13 18:08:11,890 INFO L155 PredicateUnifier]: Initialized classic predicate unifier [2025-04-13 18:08:11,890 INFO L85 PathProgramCache]: Analyzing trace with hash 1753189278, now seen corresponding path program 9 times [2025-04-13 18:08:11,890 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-04-13 18:08:11,891 INFO L324 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1544049940] [2025-04-13 18:08:11,891 INFO L95 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST2 [2025-04-13 18:08:11,891 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-04-13 18:08:11,897 INFO L108 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST2 partitioned 40 statements into 2 equivalence classes. [2025-04-13 18:08:11,902 INFO L111 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST2 issued 2 check-sat command(s) and asserted 40 of 40 statements. [2025-04-13 18:08:11,902 INFO L114 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST2 issued 2 check-sat command(s) [2025-04-13 18:08:11,902 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-04-13 18:08:12,040 INFO L134 CoverageAnalysis]: Checked inductivity of 4 backedges. 0 proven. 1 refuted. 0 times theorem prover too weak. 3 trivial. 0 not checked. [2025-04-13 18:08:12,040 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-04-13 18:08:12,040 INFO L324 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1544049940] [2025-04-13 18:08:12,040 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1544049940] provided 0 perfect and 1 imperfect interpolant sequences [2025-04-13 18:08:12,040 INFO L324 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1973166672] [2025-04-13 18:08:12,040 INFO L95 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST2 [2025-04-13 18:08:12,040 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-04-13 18:08:12,040 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2025-04-13 18:08:12,042 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 18:08:12,043 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 18:08:12,101 INFO L108 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST2 partitioned 40 statements into 2 equivalence classes. [2025-04-13 18:08:12,119 INFO L111 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST2 issued 2 check-sat command(s) and asserted 40 of 40 statements. [2025-04-13 18:08:12,119 INFO L114 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST2 issued 2 check-sat command(s) [2025-04-13 18:08:12,119 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-04-13 18:08:12,120 INFO L256 TraceCheckSpWp]: Trace formula consists of 266 conjuncts, 41 conjuncts are in the unsatisfiable core [2025-04-13 18:08:12,121 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-04-13 18:08:12,148 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 18:08:12,307 INFO L325 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2025-04-13 18:08:12,308 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 17 treesize of output 15 [2025-04-13 18:08:12,337 INFO L134 CoverageAnalysis]: Checked inductivity of 4 backedges. 0 proven. 4 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-04-13 18:08:12,337 INFO L312 TraceCheckSpWp]: Computing backward predicates... [2025-04-13 18:08:12,535 INFO L134 CoverageAnalysis]: Checked inductivity of 4 backedges. 0 proven. 1 refuted. 0 times theorem prover too weak. 3 trivial. 0 not checked. [2025-04-13 18:08:12,536 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1973166672] provided 0 perfect and 2 imperfect interpolant sequences [2025-04-13 18:08:12,536 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2025-04-13 18:08:12,536 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [8, 11, 8] total 23 [2025-04-13 18:08:12,536 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1643100204] [2025-04-13 18:08:12,536 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2025-04-13 18:08:12,536 INFO L562 AbstractCegarLoop]: INTERPOLANT automaton has 24 states [2025-04-13 18:08:12,536 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-04-13 18:08:12,536 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 24 interpolants. [2025-04-13 18:08:12,537 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=91, Invalid=461, Unknown=0, NotChecked=0, Total=552 [2025-04-13 18:08:12,537 INFO L87 Difference]: Start difference. First operand 4319 states and 16570 transitions. Second operand has 24 states, 23 states have (on average 3.782608695652174) internal successors, (87), 24 states have internal predecessors, (87), 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 18:08:16,474 WARN L532 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 3.47s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [1] [2025-04-13 18:08:20,490 WARN L532 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 4.00s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [1] [2025-04-13 18:08:24,503 WARN L532 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 4.00s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [1] [2025-04-13 18:08:27,573 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-04-13 18:08:27,573 INFO L93 Difference]: Finished difference Result 7302 states and 27700 transitions. [2025-04-13 18:08:27,573 INFO L140 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 29 states. [2025-04-13 18:08:27,573 INFO L79 Accepts]: Start accepts. Automaton has has 24 states, 23 states have (on average 3.782608695652174) internal successors, (87), 24 states have internal predecessors, (87), 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 40 [2025-04-13 18:08:27,573 INFO L85 Accepts]: Finished accepts. some prefix is accepted. [2025-04-13 18:08:27,598 INFO L225 Difference]: With dead ends: 7302 [2025-04-13 18:08:27,598 INFO L226 Difference]: Without dead ends: 7093 [2025-04-13 18:08:27,601 INFO L436 NwaCegarLoop]: 0 DeclaredPredicates, 110 GetRequests, 65 SyntacticMatches, 0 SemanticMatches, 45 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 550 ImplicationChecksByTransitivity, 0.7s TimeCoverageRelationStatistics Valid=339, Invalid=1823, Unknown=0, NotChecked=0, Total=2162 [2025-04-13 18:08:27,601 INFO L437 NwaCegarLoop]: 10 mSDtfsCounter, 557 mSDsluCounter, 143 mSDsCounter, 0 mSdLazyCounter, 2226 mSolverCounterSat, 22 mSolverCounterUnsat, 3 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 12.7s Time, 0 mProtectedPredicate, 0 mProtectedAction, 557 SdHoareTripleChecker+Valid, 153 SdHoareTripleChecker+Invalid, 2251 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 22 IncrementalHoareTripleChecker+Valid, 2226 IncrementalHoareTripleChecker+Invalid, 3 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 12.9s IncrementalHoareTripleChecker+Time [2025-04-13 18:08:27,602 INFO L438 NwaCegarLoop]: SdHoareTripleChecker [557 Valid, 153 Invalid, 2251 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [22 Valid, 2226 Invalid, 3 Unknown, 0 Unchecked, 12.9s Time] [2025-04-13 18:08:27,609 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 7093 states. [2025-04-13 18:08:28,306 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 7093 to 4671. [2025-04-13 18:08:28,312 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 4671 states, 4670 states have (on average 3.867665952890792) internal successors, (18062), 4670 states have internal predecessors, (18062), 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 18:08:28,323 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4671 states to 4671 states and 18062 transitions. [2025-04-13 18:08:28,332 INFO L79 Accepts]: Start accepts. Automaton has 4671 states and 18062 transitions. Word has length 40 [2025-04-13 18:08:28,332 INFO L85 Accepts]: Finished accepts. word is rejected. [2025-04-13 18:08:28,332 INFO L485 AbstractCegarLoop]: Abstraction has 4671 states and 18062 transitions. [2025-04-13 18:08:28,332 INFO L486 AbstractCegarLoop]: INTERPOLANT automaton has has 24 states, 23 states have (on average 3.782608695652174) internal successors, (87), 24 states have internal predecessors, (87), 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 18:08:28,332 INFO L278 IsEmpty]: Start isEmpty. Operand 4671 states and 18062 transitions. [2025-04-13 18:08:28,344 INFO L284 IsEmpty]: Finished isEmpty. Found accepting run of length 41 [2025-04-13 18:08:28,344 INFO L210 NwaCegarLoop]: Found error trace [2025-04-13 18:08:28,344 INFO L218 NwaCegarLoop]: trace histogram [2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-04-13 18:08:28,358 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (17)] Ended with exit code 0 [2025-04-13 18:08:28,546 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,SelfDestructingSolverStorable27 [2025-04-13 18:08:28,546 INFO L403 AbstractCegarLoop]: === Iteration 29 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [thread1Err0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES, thread1Err3INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION (and 4 more)] === [2025-04-13 18:08:28,546 INFO L155 PredicateUnifier]: Initialized classic predicate unifier [2025-04-13 18:08:28,546 INFO L85 PathProgramCache]: Analyzing trace with hash -794976838, now seen corresponding path program 10 times [2025-04-13 18:08:28,546 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-04-13 18:08:28,546 INFO L324 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1335981526] [2025-04-13 18:08:28,546 INFO L95 rtionOrderModulation]: Changing assertion order to TERMS_WITH_SMALL_CONSTANTS_FIRST [2025-04-13 18:08:28,547 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-04-13 18:08:28,553 INFO L108 AnnotateAndAsserter]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST partitioned 40 statements into 2 equivalence classes. [2025-04-13 18:08:28,561 INFO L111 AnnotateAndAsserter]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST issued 2 check-sat command(s) and asserted 40 of 40 statements. [2025-04-13 18:08:28,561 INFO L114 AnnotateAndAsserter]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST issued 2 check-sat command(s) [2025-04-13 18:08:28,561 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-04-13 18:08:28,805 INFO L134 CoverageAnalysis]: Checked inductivity of 4 backedges. 0 proven. 1 refuted. 0 times theorem prover too weak. 3 trivial. 0 not checked. [2025-04-13 18:08:28,805 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-04-13 18:08:28,805 INFO L324 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1335981526] [2025-04-13 18:08:28,805 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1335981526] provided 0 perfect and 1 imperfect interpolant sequences [2025-04-13 18:08:28,805 INFO L324 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1130009102] [2025-04-13 18:08:28,805 INFO L95 rtionOrderModulation]: Changing assertion order to TERMS_WITH_SMALL_CONSTANTS_FIRST [2025-04-13 18:08:28,805 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-04-13 18:08:28,805 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2025-04-13 18:08:28,807 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 18:08:28,809 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 18:08:28,872 INFO L108 AnnotateAndAsserter]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST partitioned 40 statements into 2 equivalence classes. [2025-04-13 18:08:28,893 INFO L111 AnnotateAndAsserter]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST issued 2 check-sat command(s) and asserted 40 of 40 statements. [2025-04-13 18:08:28,893 INFO L114 AnnotateAndAsserter]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST issued 2 check-sat command(s) [2025-04-13 18:08:28,893 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-04-13 18:08:28,894 INFO L256 TraceCheckSpWp]: Trace formula consists of 266 conjuncts, 25 conjuncts are in the unsatisfiable core [2025-04-13 18:08:28,903 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-04-13 18:08:29,057 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 19 treesize of output 7 [2025-04-13 18:08:29,084 INFO L134 CoverageAnalysis]: Checked inductivity of 4 backedges. 0 proven. 1 refuted. 0 times theorem prover too weak. 3 trivial. 0 not checked. [2025-04-13 18:08:29,084 INFO L312 TraceCheckSpWp]: Computing backward predicates... [2025-04-13 18:08:29,157 INFO L325 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2025-04-13 18:08:29,157 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 25 treesize of output 16 [2025-04-13 18:08:29,206 INFO L134 CoverageAnalysis]: Checked inductivity of 4 backedges. 0 proven. 1 refuted. 0 times theorem prover too weak. 3 trivial. 0 not checked. [2025-04-13 18:08:29,206 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1130009102] provided 0 perfect and 2 imperfect interpolant sequences [2025-04-13 18:08:29,206 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2025-04-13 18:08:29,206 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [7, 7, 7] total 14 [2025-04-13 18:08:29,207 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1491750165] [2025-04-13 18:08:29,207 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2025-04-13 18:08:29,218 INFO L562 AbstractCegarLoop]: INTERPOLANT automaton has 15 states [2025-04-13 18:08:29,218 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-04-13 18:08:29,219 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 15 interpolants. [2025-04-13 18:08:29,219 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=43, Invalid=167, Unknown=0, NotChecked=0, Total=210 [2025-04-13 18:08:29,219 INFO L87 Difference]: Start difference. First operand 4671 states and 18062 transitions. Second operand has 15 states, 14 states have (on average 4.857142857142857) internal successors, (68), 15 states have internal predecessors, (68), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-04-13 18:08:31,237 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-04-13 18:08:31,237 INFO L93 Difference]: Finished difference Result 6711 states and 25857 transitions. [2025-04-13 18:08:31,237 INFO L140 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 12 states. [2025-04-13 18:08:31,238 INFO L79 Accepts]: Start accepts. Automaton has has 15 states, 14 states have (on average 4.857142857142857) internal successors, (68), 15 states have internal predecessors, (68), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 40 [2025-04-13 18:08:31,239 INFO L85 Accepts]: Finished accepts. some prefix is accepted. [2025-04-13 18:08:31,267 INFO L225 Difference]: With dead ends: 6711 [2025-04-13 18:08:31,267 INFO L226 Difference]: Without dead ends: 6490 [2025-04-13 18:08:31,270 INFO L436 NwaCegarLoop]: 0 DeclaredPredicates, 89 GetRequests, 73 SyntacticMatches, 0 SemanticMatches, 16 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 40 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=63, Invalid=243, Unknown=0, NotChecked=0, Total=306 [2025-04-13 18:08:31,271 INFO L437 NwaCegarLoop]: 8 mSDtfsCounter, 210 mSDsluCounter, 59 mSDsCounter, 0 mSdLazyCounter, 1069 mSolverCounterSat, 2 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.5s Time, 0 mProtectedPredicate, 0 mProtectedAction, 210 SdHoareTripleChecker+Valid, 67 SdHoareTripleChecker+Invalid, 1071 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 2 IncrementalHoareTripleChecker+Valid, 1069 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.6s IncrementalHoareTripleChecker+Time [2025-04-13 18:08:31,272 INFO L438 NwaCegarLoop]: SdHoareTripleChecker [210 Valid, 67 Invalid, 1071 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [2 Valid, 1069 Invalid, 0 Unknown, 0 Unchecked, 0.6s Time] [2025-04-13 18:08:31,282 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 6490 states. [2025-04-13 18:08:32,012 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 6490 to 4599. [2025-04-13 18:08:32,018 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 4599 states, 4598 states have (on average 3.861244019138756) internal successors, (17754), 4598 states have internal predecessors, (17754), 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 18:08:32,032 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4599 states to 4599 states and 17754 transitions. [2025-04-13 18:08:32,039 INFO L79 Accepts]: Start accepts. Automaton has 4599 states and 17754 transitions. Word has length 40 [2025-04-13 18:08:32,039 INFO L85 Accepts]: Finished accepts. word is rejected. [2025-04-13 18:08:32,040 INFO L485 AbstractCegarLoop]: Abstraction has 4599 states and 17754 transitions. [2025-04-13 18:08:32,040 INFO L486 AbstractCegarLoop]: INTERPOLANT automaton has has 15 states, 14 states have (on average 4.857142857142857) internal successors, (68), 15 states have internal predecessors, (68), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-04-13 18:08:32,040 INFO L278 IsEmpty]: Start isEmpty. Operand 4599 states and 17754 transitions. [2025-04-13 18:08:32,048 INFO L284 IsEmpty]: Finished isEmpty. Found accepting run of length 41 [2025-04-13 18:08:32,048 INFO L210 NwaCegarLoop]: Found error trace [2025-04-13 18:08:32,048 INFO L218 NwaCegarLoop]: trace histogram [2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-04-13 18:08:32,055 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (18)] Ended with exit code 0 [2025-04-13 18:08:32,248 WARN L466 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 18 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable28 [2025-04-13 18:08:32,248 INFO L403 AbstractCegarLoop]: === Iteration 30 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [thread1Err0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES, thread1Err3INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION (and 4 more)] === [2025-04-13 18:08:32,249 INFO L155 PredicateUnifier]: Initialized classic predicate unifier [2025-04-13 18:08:32,249 INFO L85 PathProgramCache]: Analyzing trace with hash -931554056, now seen corresponding path program 11 times [2025-04-13 18:08:32,249 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-04-13 18:08:32,249 INFO L324 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2528729] [2025-04-13 18:08:32,249 INFO L95 rtionOrderModulation]: Changing assertion order to INSIDE_LOOP_FIRST1 [2025-04-13 18:08:32,249 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-04-13 18:08:32,255 INFO L108 AnnotateAndAsserter]: Assert order INSIDE_LOOP_FIRST1 partitioned 40 statements into 2 equivalence classes. [2025-04-13 18:08:32,268 INFO L111 AnnotateAndAsserter]: Assert order INSIDE_LOOP_FIRST1 issued 2 check-sat command(s) and asserted 40 of 40 statements. [2025-04-13 18:08:32,269 INFO L114 AnnotateAndAsserter]: Assert order INSIDE_LOOP_FIRST1 issued 2 check-sat command(s) [2025-04-13 18:08:32,269 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-04-13 18:08:32,727 INFO L134 CoverageAnalysis]: Checked inductivity of 3 backedges. 0 proven. 3 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-04-13 18:08:32,728 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-04-13 18:08:32,728 INFO L324 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2528729] [2025-04-13 18:08:32,728 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [2528729] provided 0 perfect and 1 imperfect interpolant sequences [2025-04-13 18:08:32,728 INFO L324 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1020208417] [2025-04-13 18:08:32,728 INFO L95 rtionOrderModulation]: Changing assertion order to INSIDE_LOOP_FIRST1 [2025-04-13 18:08:32,728 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-04-13 18:08:32,728 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2025-04-13 18:08:32,730 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 18:08:32,732 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 18:08:32,795 INFO L108 AnnotateAndAsserter]: Assert order INSIDE_LOOP_FIRST1 partitioned 40 statements into 2 equivalence classes. [2025-04-13 18:08:32,817 INFO L111 AnnotateAndAsserter]: Assert order INSIDE_LOOP_FIRST1 issued 2 check-sat command(s) and asserted 40 of 40 statements. [2025-04-13 18:08:32,818 INFO L114 AnnotateAndAsserter]: Assert order INSIDE_LOOP_FIRST1 issued 2 check-sat command(s) [2025-04-13 18:08:32,818 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-04-13 18:08:32,819 INFO L256 TraceCheckSpWp]: Trace formula consists of 266 conjuncts, 35 conjuncts are in the unsatisfiable core [2025-04-13 18:08:32,820 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-04-13 18:08:32,910 INFO L354 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 15 treesize of output 7 [2025-04-13 18:08:32,933 INFO L134 CoverageAnalysis]: Checked inductivity of 3 backedges. 0 proven. 2 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2025-04-13 18:08:32,933 INFO L312 TraceCheckSpWp]: Computing backward predicates... [2025-04-13 18:08:32,985 INFO L325 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2025-04-13 18:08:32,986 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 25 treesize of output 16 [2025-04-13 18:08:33,040 INFO L134 CoverageAnalysis]: Checked inductivity of 3 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 3 trivial. 0 not checked. [2025-04-13 18:08:33,040 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1020208417] provided 1 perfect and 1 imperfect interpolant sequences [2025-04-13 18:08:33,040 INFO L185 FreeRefinementEngine]: Found 1 perfect and 2 imperfect interpolant sequences. [2025-04-13 18:08:33,040 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [7] imperfect sequences [10, 9] total 16 [2025-04-13 18:08:33,040 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1206813205] [2025-04-13 18:08:33,041 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-04-13 18:08:33,041 INFO L562 AbstractCegarLoop]: INTERPOLANT automaton has 8 states [2025-04-13 18:08:33,041 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-04-13 18:08:33,041 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2025-04-13 18:08:33,041 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=49, Invalid=223, Unknown=0, NotChecked=0, Total=272 [2025-04-13 18:08:33,041 INFO L87 Difference]: Start difference. First operand 4599 states and 17754 transitions. Second operand has 8 states, 7 states have (on average 5.571428571428571) internal successors, (39), 8 states have internal predecessors, (39), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-04-13 18:08:34,710 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-04-13 18:08:34,710 INFO L93 Difference]: Finished difference Result 6284 states and 24245 transitions. [2025-04-13 18:08:34,711 INFO L140 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2025-04-13 18:08:34,711 INFO L79 Accepts]: Start accepts. Automaton has has 8 states, 7 states have (on average 5.571428571428571) internal successors, (39), 8 states have internal predecessors, (39), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 40 [2025-04-13 18:08:34,711 INFO L85 Accepts]: Finished accepts. some prefix is accepted. [2025-04-13 18:08:34,733 INFO L225 Difference]: With dead ends: 6284 [2025-04-13 18:08:34,733 INFO L226 Difference]: Without dead ends: 6063 [2025-04-13 18:08:34,736 INFO L436 NwaCegarLoop]: 0 DeclaredPredicates, 92 GetRequests, 73 SyntacticMatches, 0 SemanticMatches, 19 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 69 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=74, Invalid=346, Unknown=0, NotChecked=0, Total=420 [2025-04-13 18:08:34,737 INFO L437 NwaCegarLoop]: 8 mSDtfsCounter, 112 mSDsluCounter, 45 mSDsCounter, 0 mSdLazyCounter, 791 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.3s Time, 0 mProtectedPredicate, 0 mProtectedAction, 112 SdHoareTripleChecker+Valid, 53 SdHoareTripleChecker+Invalid, 791 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 791 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.4s IncrementalHoareTripleChecker+Time [2025-04-13 18:08:34,738 INFO L438 NwaCegarLoop]: SdHoareTripleChecker [112 Valid, 53 Invalid, 791 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 791 Invalid, 0 Unknown, 0 Unchecked, 0.4s Time] [2025-04-13 18:08:34,744 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 6063 states. [2025-04-13 18:08:35,422 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 6063 to 4621. [2025-04-13 18:08:35,429 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 4621 states, 4620 states have (on average 3.8621212121212123) internal successors, (17843), 4620 states have internal predecessors, (17843), 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 18:08:35,441 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4621 states to 4621 states and 17843 transitions. [2025-04-13 18:08:35,449 INFO L79 Accepts]: Start accepts. Automaton has 4621 states and 17843 transitions. Word has length 40 [2025-04-13 18:08:35,450 INFO L85 Accepts]: Finished accepts. word is rejected. [2025-04-13 18:08:35,450 INFO L485 AbstractCegarLoop]: Abstraction has 4621 states and 17843 transitions. [2025-04-13 18:08:35,450 INFO L486 AbstractCegarLoop]: INTERPOLANT automaton has has 8 states, 7 states have (on average 5.571428571428571) internal successors, (39), 8 states have internal predecessors, (39), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-04-13 18:08:35,450 INFO L278 IsEmpty]: Start isEmpty. Operand 4621 states and 17843 transitions. [2025-04-13 18:08:35,462 INFO L284 IsEmpty]: Finished isEmpty. Found accepting run of length 41 [2025-04-13 18:08:35,462 INFO L210 NwaCegarLoop]: Found error trace [2025-04-13 18:08:35,466 INFO L218 NwaCegarLoop]: trace histogram [2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-04-13 18:08:35,480 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (19)] Forceful destruction successful, exit code 0 [2025-04-13 18:08:35,667 WARN L466 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable29,19 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-04-13 18:08:35,667 INFO L403 AbstractCegarLoop]: === Iteration 31 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [thread1Err0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES, thread1Err3INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION (and 4 more)] === [2025-04-13 18:08:35,667 INFO L155 PredicateUnifier]: Initialized classic predicate unifier [2025-04-13 18:08:35,668 INFO L85 PathProgramCache]: Analyzing trace with hash 2029748220, now seen corresponding path program 12 times [2025-04-13 18:08:35,668 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-04-13 18:08:35,668 INFO L324 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2079638208] [2025-04-13 18:08:35,669 INFO L95 rtionOrderModulation]: Changing assertion order to MIX_INSIDE_OUTSIDE [2025-04-13 18:08:35,669 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-04-13 18:08:35,674 INFO L108 AnnotateAndAsserter]: Assert order MIX_INSIDE_OUTSIDE partitioned 40 statements into 2 equivalence classes. [2025-04-13 18:08:35,686 INFO L111 AnnotateAndAsserter]: Assert order MIX_INSIDE_OUTSIDE issued 1 check-sat command(s) and asserted 38 of 40 statements. [2025-04-13 18:08:35,687 INFO L114 AnnotateAndAsserter]: Assert order MIX_INSIDE_OUTSIDE issued 1 check-sat command(s) [2025-04-13 18:08:35,687 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-04-13 18:08:35,921 INFO L134 CoverageAnalysis]: Checked inductivity of 3 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 3 trivial. 0 not checked. [2025-04-13 18:08:35,921 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-04-13 18:08:35,921 INFO L324 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2079638208] [2025-04-13 18:08:35,921 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [2079638208] provided 1 perfect and 0 imperfect interpolant sequences [2025-04-13 18:08:35,922 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-04-13 18:08:35,922 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [8] imperfect sequences [] total 8 [2025-04-13 18:08:35,922 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [606304834] [2025-04-13 18:08:35,922 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-04-13 18:08:35,922 INFO L562 AbstractCegarLoop]: INTERPOLANT automaton has 9 states [2025-04-13 18:08:35,922 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-04-13 18:08:35,922 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2025-04-13 18:08:35,922 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=23, Invalid=49, Unknown=0, NotChecked=0, Total=72 [2025-04-13 18:08:35,922 INFO L87 Difference]: Start difference. First operand 4621 states and 17843 transitions. Second operand has 9 states, 8 states have (on average 4.875) internal successors, (39), 9 states have internal predecessors, (39), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-04-13 18:08:37,852 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-04-13 18:08:37,853 INFO L93 Difference]: Finished difference Result 6235 states and 24073 transitions. [2025-04-13 18:08:37,853 INFO L140 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 10 states. [2025-04-13 18:08:37,853 INFO L79 Accepts]: Start accepts. Automaton has has 9 states, 8 states have (on average 4.875) internal successors, (39), 9 states have internal predecessors, (39), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 40 [2025-04-13 18:08:37,853 INFO L85 Accepts]: Finished accepts. some prefix is accepted. [2025-04-13 18:08:37,875 INFO L225 Difference]: With dead ends: 6235 [2025-04-13 18:08:37,875 INFO L226 Difference]: Without dead ends: 5984 [2025-04-13 18:08:37,877 INFO L436 NwaCegarLoop]: 0 DeclaredPredicates, 9 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 8 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 8 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=29, Invalid=61, Unknown=0, NotChecked=0, Total=90 [2025-04-13 18:08:37,877 INFO L437 NwaCegarLoop]: 8 mSDtfsCounter, 120 mSDsluCounter, 45 mSDsCounter, 0 mSdLazyCounter, 718 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.4s Time, 0 mProtectedPredicate, 0 mProtectedAction, 120 SdHoareTripleChecker+Valid, 53 SdHoareTripleChecker+Invalid, 718 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 718 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.5s IncrementalHoareTripleChecker+Time [2025-04-13 18:08:37,878 INFO L438 NwaCegarLoop]: SdHoareTripleChecker [120 Valid, 53 Invalid, 718 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 718 Invalid, 0 Unknown, 0 Unchecked, 0.5s Time] [2025-04-13 18:08:37,882 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 5984 states. [2025-04-13 18:08:38,532 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 5984 to 4599. [2025-04-13 18:08:38,538 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 4599 states, 4598 states have (on average 3.861244019138756) internal successors, (17754), 4598 states have internal predecessors, (17754), 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 18:08:38,549 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4599 states to 4599 states and 17754 transitions. [2025-04-13 18:08:38,559 INFO L79 Accepts]: Start accepts. Automaton has 4599 states and 17754 transitions. Word has length 40 [2025-04-13 18:08:38,559 INFO L85 Accepts]: Finished accepts. word is rejected. [2025-04-13 18:08:38,559 INFO L485 AbstractCegarLoop]: Abstraction has 4599 states and 17754 transitions. [2025-04-13 18:08:38,559 INFO L486 AbstractCegarLoop]: INTERPOLANT automaton has has 9 states, 8 states have (on average 4.875) internal successors, (39), 9 states have internal predecessors, (39), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-04-13 18:08:38,560 INFO L278 IsEmpty]: Start isEmpty. Operand 4599 states and 17754 transitions. [2025-04-13 18:08:38,568 INFO L284 IsEmpty]: Finished isEmpty. Found accepting run of length 41 [2025-04-13 18:08:38,568 INFO L210 NwaCegarLoop]: Found error trace [2025-04-13 18:08:38,568 INFO L218 NwaCegarLoop]: trace histogram [2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-04-13 18:08:38,569 WARN L466 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable30 [2025-04-13 18:08:38,570 INFO L403 AbstractCegarLoop]: === Iteration 32 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [thread1Err0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES, thread1Err3INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION (and 4 more)] === [2025-04-13 18:08:38,570 INFO L155 PredicateUnifier]: Initialized classic predicate unifier [2025-04-13 18:08:38,570 INFO L85 PathProgramCache]: Analyzing trace with hash 289537621, now seen corresponding path program 11 times [2025-04-13 18:08:38,570 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-04-13 18:08:38,570 INFO L324 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1116433184] [2025-04-13 18:08:38,570 INFO L95 rtionOrderModulation]: Changing assertion order to INSIDE_LOOP_FIRST1 [2025-04-13 18:08:38,570 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-04-13 18:08:38,575 INFO L108 AnnotateAndAsserter]: Assert order INSIDE_LOOP_FIRST1 partitioned 40 statements into 2 equivalence classes. [2025-04-13 18:08:38,593 INFO L111 AnnotateAndAsserter]: Assert order INSIDE_LOOP_FIRST1 issued 2 check-sat command(s) and asserted 40 of 40 statements. [2025-04-13 18:08:38,593 INFO L114 AnnotateAndAsserter]: Assert order INSIDE_LOOP_FIRST1 issued 2 check-sat command(s) [2025-04-13 18:08:38,593 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-04-13 18:08:38,904 INFO L134 CoverageAnalysis]: Checked inductivity of 4 backedges. 0 proven. 4 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-04-13 18:08:38,905 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-04-13 18:08:38,905 INFO L324 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1116433184] [2025-04-13 18:08:38,905 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1116433184] provided 0 perfect and 1 imperfect interpolant sequences [2025-04-13 18:08:38,905 INFO L324 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1003761866] [2025-04-13 18:08:38,905 INFO L95 rtionOrderModulation]: Changing assertion order to INSIDE_LOOP_FIRST1 [2025-04-13 18:08:38,905 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-04-13 18:08:38,905 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2025-04-13 18:08:38,907 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 18:08:38,909 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 18:08:38,988 INFO L108 AnnotateAndAsserter]: Assert order INSIDE_LOOP_FIRST1 partitioned 40 statements into 2 equivalence classes. [2025-04-13 18:08:39,009 INFO L111 AnnotateAndAsserter]: Assert order INSIDE_LOOP_FIRST1 issued 2 check-sat command(s) and asserted 40 of 40 statements. [2025-04-13 18:08:39,009 INFO L114 AnnotateAndAsserter]: Assert order INSIDE_LOOP_FIRST1 issued 2 check-sat command(s) [2025-04-13 18:08:39,009 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-04-13 18:08:39,010 INFO L256 TraceCheckSpWp]: Trace formula consists of 266 conjuncts, 35 conjuncts are in the unsatisfiable core [2025-04-13 18:08:39,011 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-04-13 18:08:39,184 INFO L354 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 15 treesize of output 7 [2025-04-13 18:08:39,197 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 18:08:39,197 INFO L312 TraceCheckSpWp]: Computing backward predicates... [2025-04-13 18:08:39,271 INFO L325 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2025-04-13 18:08:39,272 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 25 treesize of output 16 [2025-04-13 18:08:39,292 INFO L134 CoverageAnalysis]: Checked inductivity of 4 backedges. 0 proven. 1 refuted. 0 times theorem prover too weak. 3 trivial. 0 not checked. [2025-04-13 18:08:39,292 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1003761866] provided 0 perfect and 2 imperfect interpolant sequences [2025-04-13 18:08:39,292 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2025-04-13 18:08:39,292 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [9, 9, 7] total 20 [2025-04-13 18:08:39,292 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1029942270] [2025-04-13 18:08:39,292 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2025-04-13 18:08:39,293 INFO L562 AbstractCegarLoop]: INTERPOLANT automaton has 21 states [2025-04-13 18:08:39,293 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-04-13 18:08:39,294 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 21 interpolants. [2025-04-13 18:08:39,294 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=67, Invalid=353, Unknown=0, NotChecked=0, Total=420 [2025-04-13 18:08:39,294 INFO L87 Difference]: Start difference. First operand 4599 states and 17754 transitions. Second operand has 21 states, 20 states have (on average 4.2) internal successors, (84), 21 states have internal predecessors, (84), 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 18:08:41,409 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-04-13 18:08:41,409 INFO L93 Difference]: Finished difference Result 7089 states and 27319 transitions. [2025-04-13 18:08:41,409 INFO L140 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 12 states. [2025-04-13 18:08:41,410 INFO L79 Accepts]: Start accepts. Automaton has has 21 states, 20 states have (on average 4.2) internal successors, (84), 21 states have internal predecessors, (84), 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 40 [2025-04-13 18:08:41,410 INFO L85 Accepts]: Finished accepts. some prefix is accepted. [2025-04-13 18:08:41,439 INFO L225 Difference]: With dead ends: 7089 [2025-04-13 18:08:41,439 INFO L226 Difference]: Without dead ends: 6814 [2025-04-13 18:08:41,442 INFO L436 NwaCegarLoop]: 0 DeclaredPredicates, 95 GetRequests, 71 SyntacticMatches, 0 SemanticMatches, 24 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 126 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=95, Invalid=555, Unknown=0, NotChecked=0, Total=650 [2025-04-13 18:08:41,445 INFO L437 NwaCegarLoop]: 11 mSDtfsCounter, 203 mSDsluCounter, 103 mSDsCounter, 0 mSdLazyCounter, 1416 mSolverCounterSat, 1 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.5s Time, 0 mProtectedPredicate, 0 mProtectedAction, 203 SdHoareTripleChecker+Valid, 114 SdHoareTripleChecker+Invalid, 1417 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 1 IncrementalHoareTripleChecker+Valid, 1416 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.7s IncrementalHoareTripleChecker+Time [2025-04-13 18:08:41,445 INFO L438 NwaCegarLoop]: SdHoareTripleChecker [203 Valid, 114 Invalid, 1417 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [1 Valid, 1416 Invalid, 0 Unknown, 0 Unchecked, 0.7s Time] [2025-04-13 18:08:41,457 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 6814 states. [2025-04-13 18:08:42,219 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 6814 to 4879. [2025-04-13 18:08:42,225 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 4879 states, 4878 states have (on average 3.874128741287413) internal successors, (18898), 4878 states have internal predecessors, (18898), 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 18:08:42,237 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4879 states to 4879 states and 18898 transitions. [2025-04-13 18:08:42,245 INFO L79 Accepts]: Start accepts. Automaton has 4879 states and 18898 transitions. Word has length 40 [2025-04-13 18:08:42,245 INFO L85 Accepts]: Finished accepts. word is rejected. [2025-04-13 18:08:42,245 INFO L485 AbstractCegarLoop]: Abstraction has 4879 states and 18898 transitions. [2025-04-13 18:08:42,245 INFO L486 AbstractCegarLoop]: INTERPOLANT automaton has has 21 states, 20 states have (on average 4.2) internal successors, (84), 21 states have internal predecessors, (84), 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 18:08:42,245 INFO L278 IsEmpty]: Start isEmpty. Operand 4879 states and 18898 transitions. [2025-04-13 18:08:42,252 INFO L284 IsEmpty]: Finished isEmpty. Found accepting run of length 41 [2025-04-13 18:08:42,253 INFO L210 NwaCegarLoop]: Found error trace [2025-04-13 18:08:42,253 INFO L218 NwaCegarLoop]: trace histogram [2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-04-13 18:08:42,259 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (20)] Forceful destruction successful, exit code 0 [2025-04-13 18:08:42,457 WARN L466 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable31,20 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-04-13 18:08:42,457 INFO L403 AbstractCegarLoop]: === Iteration 33 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [thread1Err0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES, thread1Err3INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION (and 4 more)] === [2025-04-13 18:08:42,457 INFO L155 PredicateUnifier]: Initialized classic predicate unifier [2025-04-13 18:08:42,457 INFO L85 PathProgramCache]: Analyzing trace with hash -2044632138, now seen corresponding path program 13 times [2025-04-13 18:08:42,457 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-04-13 18:08:42,457 INFO L324 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [167630650] [2025-04-13 18:08:42,457 INFO L95 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2025-04-13 18:08:42,457 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-04-13 18:08:42,467 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 40 statements into 1 equivalence classes. [2025-04-13 18:08:42,480 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 40 of 40 statements. [2025-04-13 18:08:42,480 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-04-13 18:08:42,481 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-04-13 18:08:42,921 INFO L134 CoverageAnalysis]: Checked inductivity of 5 backedges. 0 proven. 5 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-04-13 18:08:42,922 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-04-13 18:08:42,922 INFO L324 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [167630650] [2025-04-13 18:08:42,922 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [167630650] provided 0 perfect and 1 imperfect interpolant sequences [2025-04-13 18:08:42,923 INFO L324 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [546017315] [2025-04-13 18:08:42,923 INFO L95 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2025-04-13 18:08:42,923 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-04-13 18:08:42,923 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2025-04-13 18:08:42,927 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 18:08:42,928 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 18:08:42,994 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 40 statements into 1 equivalence classes. [2025-04-13 18:08:43,013 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 40 of 40 statements. [2025-04-13 18:08:43,013 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-04-13 18:08:43,013 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-04-13 18:08:43,014 INFO L256 TraceCheckSpWp]: Trace formula consists of 266 conjuncts, 25 conjuncts are in the unsatisfiable core [2025-04-13 18:08:43,015 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-04-13 18:08:43,148 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 19 treesize of output 7 [2025-04-13 18:08:43,168 INFO L134 CoverageAnalysis]: Checked inductivity of 5 backedges. 0 proven. 2 refuted. 0 times theorem prover too weak. 3 trivial. 0 not checked. [2025-04-13 18:08:43,168 INFO L312 TraceCheckSpWp]: Computing backward predicates... [2025-04-13 18:08:43,277 INFO L325 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2025-04-13 18:08:43,277 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 25 treesize of output 16 [2025-04-13 18:08:43,295 INFO L134 CoverageAnalysis]: Checked inductivity of 5 backedges. 0 proven. 2 refuted. 0 times theorem prover too weak. 3 trivial. 0 not checked. [2025-04-13 18:08:43,295 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [546017315] provided 0 perfect and 2 imperfect interpolant sequences [2025-04-13 18:08:43,295 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2025-04-13 18:08:43,295 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [11, 7, 7] total 20 [2025-04-13 18:08:43,295 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [629893176] [2025-04-13 18:08:43,295 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2025-04-13 18:08:43,296 INFO L562 AbstractCegarLoop]: INTERPOLANT automaton has 21 states [2025-04-13 18:08:43,296 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-04-13 18:08:43,296 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 21 interpolants. [2025-04-13 18:08:43,296 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=76, Invalid=344, Unknown=0, NotChecked=0, Total=420 [2025-04-13 18:08:43,296 INFO L87 Difference]: Start difference. First operand 4879 states and 18898 transitions. Second operand has 21 states, 20 states have (on average 4.25) internal successors, (85), 21 states have internal predecessors, (85), 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 18:08:45,578 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-04-13 18:08:45,578 INFO L93 Difference]: Finished difference Result 6983 states and 26974 transitions. [2025-04-13 18:08:45,578 INFO L140 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 14 states. [2025-04-13 18:08:45,578 INFO L79 Accepts]: Start accepts. Automaton has has 21 states, 20 states have (on average 4.25) internal successors, (85), 21 states have internal predecessors, (85), 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 40 [2025-04-13 18:08:45,578 INFO L85 Accepts]: Finished accepts. some prefix is accepted. [2025-04-13 18:08:45,603 INFO L225 Difference]: With dead ends: 6983 [2025-04-13 18:08:45,603 INFO L226 Difference]: Without dead ends: 6732 [2025-04-13 18:08:45,606 INFO L436 NwaCegarLoop]: 0 DeclaredPredicates, 98 GetRequests, 73 SyntacticMatches, 0 SemanticMatches, 25 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 183 ImplicationChecksByTransitivity, 0.3s TimeCoverageRelationStatistics Valid=110, Invalid=592, Unknown=0, NotChecked=0, Total=702 [2025-04-13 18:08:45,607 INFO L437 NwaCegarLoop]: 11 mSDtfsCounter, 182 mSDsluCounter, 122 mSDsCounter, 0 mSdLazyCounter, 1615 mSolverCounterSat, 3 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.6s Time, 0 mProtectedPredicate, 0 mProtectedAction, 182 SdHoareTripleChecker+Valid, 133 SdHoareTripleChecker+Invalid, 1618 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 3 IncrementalHoareTripleChecker+Valid, 1615 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.8s IncrementalHoareTripleChecker+Time [2025-04-13 18:08:45,607 INFO L438 NwaCegarLoop]: SdHoareTripleChecker [182 Valid, 133 Invalid, 1618 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [3 Valid, 1615 Invalid, 0 Unknown, 0 Unchecked, 0.8s Time] [2025-04-13 18:08:45,619 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 6732 states. [2025-04-13 18:08:46,366 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 6732 to 4815. [2025-04-13 18:08:46,373 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 4815 states, 4814 states have (on average 3.862899875363523) internal successors, (18596), 4814 states have internal predecessors, (18596), 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 18:08:46,384 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4815 states to 4815 states and 18596 transitions. [2025-04-13 18:08:46,393 INFO L79 Accepts]: Start accepts. Automaton has 4815 states and 18596 transitions. Word has length 40 [2025-04-13 18:08:46,393 INFO L85 Accepts]: Finished accepts. word is rejected. [2025-04-13 18:08:46,393 INFO L485 AbstractCegarLoop]: Abstraction has 4815 states and 18596 transitions. [2025-04-13 18:08:46,393 INFO L486 AbstractCegarLoop]: INTERPOLANT automaton has has 21 states, 20 states have (on average 4.25) internal successors, (85), 21 states have internal predecessors, (85), 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 18:08:46,393 INFO L278 IsEmpty]: Start isEmpty. Operand 4815 states and 18596 transitions. [2025-04-13 18:08:46,401 INFO L284 IsEmpty]: Finished isEmpty. Found accepting run of length 41 [2025-04-13 18:08:46,401 INFO L210 NwaCegarLoop]: Found error trace [2025-04-13 18:08:46,401 INFO L218 NwaCegarLoop]: trace histogram [2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-04-13 18:08:46,409 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (21)] Forceful destruction successful, exit code 0 [2025-04-13 18:08:46,601 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,SelfDestructingSolverStorable32 [2025-04-13 18:08:46,602 INFO L403 AbstractCegarLoop]: === Iteration 34 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [thread1Err0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES, thread1Err3INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION (and 4 more)] === [2025-04-13 18:08:46,602 INFO L155 PredicateUnifier]: Initialized classic predicate unifier [2025-04-13 18:08:46,602 INFO L85 PathProgramCache]: Analyzing trace with hash -1815137451, now seen corresponding path program 12 times [2025-04-13 18:08:46,602 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-04-13 18:08:46,602 INFO L324 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2011922993] [2025-04-13 18:08:46,602 INFO L95 rtionOrderModulation]: Changing assertion order to MIX_INSIDE_OUTSIDE [2025-04-13 18:08:46,602 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-04-13 18:08:46,608 INFO L108 AnnotateAndAsserter]: Assert order MIX_INSIDE_OUTSIDE partitioned 40 statements into 2 equivalence classes. [2025-04-13 18:08:46,614 INFO L111 AnnotateAndAsserter]: Assert order MIX_INSIDE_OUTSIDE issued 1 check-sat command(s) and asserted 38 of 40 statements. [2025-04-13 18:08:46,615 INFO L114 AnnotateAndAsserter]: Assert order MIX_INSIDE_OUTSIDE issued 1 check-sat command(s) [2025-04-13 18:08:46,615 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-04-13 18:08:46,759 INFO L134 CoverageAnalysis]: Checked inductivity of 3 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 3 trivial. 0 not checked. [2025-04-13 18:08:46,759 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-04-13 18:08:46,759 INFO L324 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2011922993] [2025-04-13 18:08:46,759 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [2011922993] provided 1 perfect and 0 imperfect interpolant sequences [2025-04-13 18:08:46,759 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-04-13 18:08:46,760 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2025-04-13 18:08:46,760 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1023709853] [2025-04-13 18:08:46,760 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-04-13 18:08:46,761 INFO L562 AbstractCegarLoop]: INTERPOLANT automaton has 8 states [2025-04-13 18:08:46,761 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-04-13 18:08:46,761 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2025-04-13 18:08:46,761 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=18, Invalid=38, Unknown=0, NotChecked=0, Total=56 [2025-04-13 18:08:46,762 INFO L87 Difference]: Start difference. First operand 4815 states and 18596 transitions. Second operand has 8 states, 7 states have (on average 5.571428571428571) internal successors, (39), 8 states have internal predecessors, (39), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-04-13 18:08:48,294 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-04-13 18:08:48,294 INFO L93 Difference]: Finished difference Result 6641 states and 25609 transitions. [2025-04-13 18:08:48,294 INFO L140 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2025-04-13 18:08:48,295 INFO L79 Accepts]: Start accepts. Automaton has has 8 states, 7 states have (on average 5.571428571428571) internal successors, (39), 8 states have internal predecessors, (39), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 40 [2025-04-13 18:08:48,295 INFO L85 Accepts]: Finished accepts. some prefix is accepted. [2025-04-13 18:08:48,317 INFO L225 Difference]: With dead ends: 6641 [2025-04-13 18:08:48,318 INFO L226 Difference]: Without dead ends: 6366 [2025-04-13 18:08:48,321 INFO L436 NwaCegarLoop]: 0 DeclaredPredicates, 8 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 6 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 6 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=18, Invalid=38, Unknown=0, NotChecked=0, Total=56 [2025-04-13 18:08:48,321 INFO L437 NwaCegarLoop]: 10 mSDtfsCounter, 81 mSDsluCounter, 32 mSDsCounter, 0 mSdLazyCounter, 481 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 81 SdHoareTripleChecker+Valid, 42 SdHoareTripleChecker+Invalid, 481 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 481 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.3s IncrementalHoareTripleChecker+Time [2025-04-13 18:08:48,321 INFO L438 NwaCegarLoop]: SdHoareTripleChecker [81 Valid, 42 Invalid, 481 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 481 Invalid, 0 Unknown, 0 Unchecked, 0.3s Time] [2025-04-13 18:08:48,326 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 6366 states. [2025-04-13 18:08:49,009 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 6366 to 4839. [2025-04-13 18:08:49,014 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 4839 states, 4838 states have (on average 3.863166597767673) internal successors, (18690), 4838 states have internal predecessors, (18690), 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 18:08:49,023 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4839 states to 4839 states and 18690 transitions. [2025-04-13 18:08:49,030 INFO L79 Accepts]: Start accepts. Automaton has 4839 states and 18690 transitions. Word has length 40 [2025-04-13 18:08:49,030 INFO L85 Accepts]: Finished accepts. word is rejected. [2025-04-13 18:08:49,030 INFO L485 AbstractCegarLoop]: Abstraction has 4839 states and 18690 transitions. [2025-04-13 18:08:49,030 INFO L486 AbstractCegarLoop]: INTERPOLANT automaton has has 8 states, 7 states have (on average 5.571428571428571) internal successors, (39), 8 states have internal predecessors, (39), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-04-13 18:08:49,030 INFO L278 IsEmpty]: Start isEmpty. Operand 4839 states and 18690 transitions. [2025-04-13 18:08:49,037 INFO L284 IsEmpty]: Finished isEmpty. Found accepting run of length 41 [2025-04-13 18:08:49,037 INFO L210 NwaCegarLoop]: Found error trace [2025-04-13 18:08:49,037 INFO L218 NwaCegarLoop]: trace histogram [2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-04-13 18:08:49,037 WARN L466 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable33 [2025-04-13 18:08:49,037 INFO L403 AbstractCegarLoop]: === Iteration 35 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [thread1Err0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES, thread1Err3INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION (and 4 more)] === [2025-04-13 18:08:49,037 INFO L155 PredicateUnifier]: Initialized classic predicate unifier [2025-04-13 18:08:49,037 INFO L85 PathProgramCache]: Analyzing trace with hash 68809389, now seen corresponding path program 13 times [2025-04-13 18:08:49,037 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-04-13 18:08:49,037 INFO L324 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [366112617] [2025-04-13 18:08:49,037 INFO L95 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2025-04-13 18:08:49,037 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-04-13 18:08:49,042 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 40 statements into 1 equivalence classes. [2025-04-13 18:08:49,046 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 40 of 40 statements. [2025-04-13 18:08:49,046 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-04-13 18:08:49,046 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-04-13 18:08:49,270 INFO L134 CoverageAnalysis]: Checked inductivity of 4 backedges. 0 proven. 4 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-04-13 18:08:49,270 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-04-13 18:08:49,270 INFO L324 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [366112617] [2025-04-13 18:08:49,270 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [366112617] provided 0 perfect and 1 imperfect interpolant sequences [2025-04-13 18:08:49,270 INFO L324 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [242141653] [2025-04-13 18:08:49,270 INFO L95 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2025-04-13 18:08:49,270 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-04-13 18:08:49,270 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2025-04-13 18:08:49,272 INFO L229 MonitoredProcess]: Starting monitored process 22 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2025-04-13 18:08:49,274 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (22)] Waiting until timeout for monitored process [2025-04-13 18:08:49,334 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 40 statements into 1 equivalence classes. [2025-04-13 18:08:49,351 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 40 of 40 statements. [2025-04-13 18:08:49,351 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-04-13 18:08:49,351 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-04-13 18:08:49,352 INFO L256 TraceCheckSpWp]: Trace formula consists of 266 conjuncts, 25 conjuncts are in the unsatisfiable core [2025-04-13 18:08:49,352 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-04-13 18:08:49,426 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 19 treesize of output 7 [2025-04-13 18:08:49,442 INFO L134 CoverageAnalysis]: Checked inductivity of 4 backedges. 0 proven. 1 refuted. 0 times theorem prover too weak. 3 trivial. 0 not checked. [2025-04-13 18:08:49,442 INFO L312 TraceCheckSpWp]: Computing backward predicates... [2025-04-13 18:08:49,496 INFO L325 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2025-04-13 18:08:49,497 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 25 treesize of output 16 [2025-04-13 18:08:49,511 INFO L134 CoverageAnalysis]: Checked inductivity of 4 backedges. 0 proven. 1 refuted. 0 times theorem prover too weak. 3 trivial. 0 not checked. [2025-04-13 18:08:49,511 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [242141653] provided 0 perfect and 2 imperfect interpolant sequences [2025-04-13 18:08:49,511 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2025-04-13 18:08:49,511 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [10, 7, 7] total 18 [2025-04-13 18:08:49,511 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1110199233] [2025-04-13 18:08:49,511 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2025-04-13 18:08:49,511 INFO L562 AbstractCegarLoop]: INTERPOLANT automaton has 19 states [2025-04-13 18:08:49,511 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-04-13 18:08:49,512 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 19 interpolants. [2025-04-13 18:08:49,512 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=61, Invalid=281, Unknown=0, NotChecked=0, Total=342 [2025-04-13 18:08:49,512 INFO L87 Difference]: Start difference. First operand 4839 states and 18690 transitions. Second operand has 19 states, 18 states have (on average 4.222222222222222) internal successors, (76), 19 states have internal predecessors, (76), 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 18:08:51,208 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-04-13 18:08:51,208 INFO L93 Difference]: Finished difference Result 6642 states and 25595 transitions. [2025-04-13 18:08:51,209 INFO L140 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 12 states. [2025-04-13 18:08:51,209 INFO L79 Accepts]: Start accepts. Automaton has has 19 states, 18 states have (on average 4.222222222222222) internal successors, (76), 19 states have internal predecessors, (76), 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 40 [2025-04-13 18:08:51,209 INFO L85 Accepts]: Finished accepts. some prefix is accepted. [2025-04-13 18:08:51,228 INFO L225 Difference]: With dead ends: 6642 [2025-04-13 18:08:51,228 INFO L226 Difference]: Without dead ends: 6391 [2025-04-13 18:08:51,229 INFO L436 NwaCegarLoop]: 0 DeclaredPredicates, 97 GetRequests, 74 SyntacticMatches, 0 SemanticMatches, 23 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 122 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=95, Invalid=505, Unknown=0, NotChecked=0, Total=600 [2025-04-13 18:08:51,229 INFO L437 NwaCegarLoop]: 10 mSDtfsCounter, 188 mSDsluCounter, 70 mSDsCounter, 0 mSdLazyCounter, 1044 mSolverCounterSat, 1 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.3s Time, 0 mProtectedPredicate, 0 mProtectedAction, 188 SdHoareTripleChecker+Valid, 80 SdHoareTripleChecker+Invalid, 1045 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 1 IncrementalHoareTripleChecker+Valid, 1044 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.4s IncrementalHoareTripleChecker+Time [2025-04-13 18:08:51,229 INFO L438 NwaCegarLoop]: SdHoareTripleChecker [188 Valid, 80 Invalid, 1045 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [1 Valid, 1044 Invalid, 0 Unknown, 0 Unchecked, 0.4s Time] [2025-04-13 18:08:51,234 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 6391 states. [2025-04-13 18:08:51,893 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 6391 to 4791. [2025-04-13 18:08:51,898 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 4791 states, 4790 states have (on average 3.864300626304802) internal successors, (18510), 4790 states have internal predecessors, (18510), 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 18:08:51,907 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4791 states to 4791 states and 18510 transitions. [2025-04-13 18:08:51,915 INFO L79 Accepts]: Start accepts. Automaton has 4791 states and 18510 transitions. Word has length 40 [2025-04-13 18:08:51,916 INFO L85 Accepts]: Finished accepts. word is rejected. [2025-04-13 18:08:51,916 INFO L485 AbstractCegarLoop]: Abstraction has 4791 states and 18510 transitions. [2025-04-13 18:08:51,916 INFO L486 AbstractCegarLoop]: INTERPOLANT automaton has has 19 states, 18 states have (on average 4.222222222222222) internal successors, (76), 19 states have internal predecessors, (76), 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 18:08:51,916 INFO L278 IsEmpty]: Start isEmpty. Operand 4791 states and 18510 transitions. [2025-04-13 18:08:51,922 INFO L284 IsEmpty]: Finished isEmpty. Found accepting run of length 41 [2025-04-13 18:08:51,923 INFO L210 NwaCegarLoop]: Found error trace [2025-04-13 18:08:51,923 INFO L218 NwaCegarLoop]: trace histogram [2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-04-13 18:08:51,929 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (22)] Forceful destruction successful, exit code 0 [2025-04-13 18:08:52,123 WARN L466 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 22 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable34 [2025-04-13 18:08:52,124 INFO L403 AbstractCegarLoop]: === Iteration 36 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [thread1Err0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES, thread1Err3INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION (and 4 more)] === [2025-04-13 18:08:52,124 INFO L155 PredicateUnifier]: Initialized classic predicate unifier [2025-04-13 18:08:52,124 INFO L85 PathProgramCache]: Analyzing trace with hash 546931860, now seen corresponding path program 14 times [2025-04-13 18:08:52,124 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-04-13 18:08:52,124 INFO L324 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1218217770] [2025-04-13 18:08:52,124 INFO L95 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST1 [2025-04-13 18:08:52,124 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-04-13 18:08:52,129 INFO L108 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 partitioned 40 statements into 2 equivalence classes. [2025-04-13 18:08:52,134 INFO L111 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) and asserted 40 of 40 statements. [2025-04-13 18:08:52,134 INFO L114 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) [2025-04-13 18:08:52,134 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-04-13 18:08:52,420 INFO L134 CoverageAnalysis]: Checked inductivity of 4 backedges. 0 proven. 4 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-04-13 18:08:52,420 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-04-13 18:08:52,420 INFO L324 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1218217770] [2025-04-13 18:08:52,420 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1218217770] provided 0 perfect and 1 imperfect interpolant sequences [2025-04-13 18:08:52,420 INFO L324 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [860355650] [2025-04-13 18:08:52,421 INFO L95 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST1 [2025-04-13 18:08:52,421 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-04-13 18:08:52,421 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2025-04-13 18:08:52,422 INFO L229 MonitoredProcess]: Starting monitored process 23 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2025-04-13 18:08:52,424 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (23)] Waiting until timeout for monitored process [2025-04-13 18:08:52,483 INFO L108 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 partitioned 40 statements into 2 equivalence classes. [2025-04-13 18:08:52,501 INFO L111 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) and asserted 40 of 40 statements. [2025-04-13 18:08:52,501 INFO L114 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) [2025-04-13 18:08:52,501 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-04-13 18:08:52,502 INFO L256 TraceCheckSpWp]: Trace formula consists of 266 conjuncts, 41 conjuncts are in the unsatisfiable core [2025-04-13 18:08:52,503 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-04-13 18:08:52,511 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 18:08:52,599 INFO L354 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 15 treesize of output 7 [2025-04-13 18:08:52,623 INFO L134 CoverageAnalysis]: Checked inductivity of 4 backedges. 0 proven. 4 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-04-13 18:08:52,623 INFO L312 TraceCheckSpWp]: Computing backward predicates... [2025-04-13 18:08:52,699 INFO L134 CoverageAnalysis]: Checked inductivity of 4 backedges. 0 proven. 1 refuted. 0 times theorem prover too weak. 3 trivial. 0 not checked. [2025-04-13 18:08:52,699 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [860355650] provided 0 perfect and 2 imperfect interpolant sequences [2025-04-13 18:08:52,699 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2025-04-13 18:08:52,699 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [11, 10, 7] total 19 [2025-04-13 18:08:52,699 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1324065627] [2025-04-13 18:08:52,699 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2025-04-13 18:08:52,699 INFO L562 AbstractCegarLoop]: INTERPOLANT automaton has 20 states [2025-04-13 18:08:52,699 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-04-13 18:08:52,700 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 20 interpolants. [2025-04-13 18:08:52,700 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=62, Invalid=318, Unknown=0, NotChecked=0, Total=380 [2025-04-13 18:08:52,700 INFO L87 Difference]: Start difference. First operand 4791 states and 18510 transitions. Second operand has 20 states, 19 states have (on average 4.315789473684211) internal successors, (82), 20 states have internal predecessors, (82), 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 18:08:54,731 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-04-13 18:08:54,731 INFO L93 Difference]: Finished difference Result 6890 states and 26591 transitions. [2025-04-13 18:08:54,732 INFO L140 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 13 states. [2025-04-13 18:08:54,732 INFO L79 Accepts]: Start accepts. Automaton has has 20 states, 19 states have (on average 4.315789473684211) internal successors, (82), 20 states have internal predecessors, (82), 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 40 [2025-04-13 18:08:54,732 INFO L85 Accepts]: Finished accepts. some prefix is accepted. [2025-04-13 18:08:54,757 INFO L225 Difference]: With dead ends: 6890 [2025-04-13 18:08:54,757 INFO L226 Difference]: Without dead ends: 6669 [2025-04-13 18:08:54,761 INFO L436 NwaCegarLoop]: 0 DeclaredPredicates, 103 GetRequests, 77 SyntacticMatches, 0 SemanticMatches, 26 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 154 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=120, Invalid=636, Unknown=0, NotChecked=0, Total=756 [2025-04-13 18:08:54,762 INFO L437 NwaCegarLoop]: 10 mSDtfsCounter, 224 mSDsluCounter, 94 mSDsCounter, 0 mSdLazyCounter, 1363 mSolverCounterSat, 3 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.4s Time, 0 mProtectedPredicate, 0 mProtectedAction, 224 SdHoareTripleChecker+Valid, 104 SdHoareTripleChecker+Invalid, 1366 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 3 IncrementalHoareTripleChecker+Valid, 1363 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.5s IncrementalHoareTripleChecker+Time [2025-04-13 18:08:54,762 INFO L438 NwaCegarLoop]: SdHoareTripleChecker [224 Valid, 104 Invalid, 1366 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [3 Valid, 1363 Invalid, 0 Unknown, 0 Unchecked, 0.5s Time] [2025-04-13 18:08:54,771 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 6669 states. [2025-04-13 18:08:55,531 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 6669 to 4861. [2025-04-13 18:08:55,538 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 4861 states, 4860 states have (on average 3.8606995884773663) internal successors, (18763), 4860 states have internal predecessors, (18763), 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 18:08:55,550 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4861 states to 4861 states and 18763 transitions. [2025-04-13 18:08:55,558 INFO L79 Accepts]: Start accepts. Automaton has 4861 states and 18763 transitions. Word has length 40 [2025-04-13 18:08:55,558 INFO L85 Accepts]: Finished accepts. word is rejected. [2025-04-13 18:08:55,558 INFO L485 AbstractCegarLoop]: Abstraction has 4861 states and 18763 transitions. [2025-04-13 18:08:55,558 INFO L486 AbstractCegarLoop]: INTERPOLANT automaton has has 20 states, 19 states have (on average 4.315789473684211) internal successors, (82), 20 states have internal predecessors, (82), 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 18:08:55,558 INFO L278 IsEmpty]: Start isEmpty. Operand 4861 states and 18763 transitions. [2025-04-13 18:08:55,568 INFO L284 IsEmpty]: Finished isEmpty. Found accepting run of length 41 [2025-04-13 18:08:55,569 INFO L210 NwaCegarLoop]: Found error trace [2025-04-13 18:08:55,569 INFO L218 NwaCegarLoop]: trace histogram [2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-04-13 18:08:55,576 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (23)] Forceful destruction successful, exit code 0 [2025-04-13 18:08:55,769 WARN L466 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable35,23 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-04-13 18:08:55,769 INFO L403 AbstractCegarLoop]: === Iteration 37 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [thread1Err0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES, thread1Err3INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION (and 4 more)] === [2025-04-13 18:08:55,771 INFO L155 PredicateUnifier]: Initialized classic predicate unifier [2025-04-13 18:08:55,771 INFO L85 PathProgramCache]: Analyzing trace with hash 309354392, now seen corresponding path program 15 times [2025-04-13 18:08:55,771 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-04-13 18:08:55,771 INFO L324 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1386080326] [2025-04-13 18:08:55,771 INFO L95 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST2 [2025-04-13 18:08:55,771 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-04-13 18:08:55,780 INFO L108 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST2 partitioned 40 statements into 2 equivalence classes. [2025-04-13 18:08:55,793 INFO L111 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST2 issued 1 check-sat command(s) and asserted 38 of 40 statements. [2025-04-13 18:08:55,793 INFO L114 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST2 issued 1 check-sat command(s) [2025-04-13 18:08:55,793 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-04-13 18:08:55,971 INFO L134 CoverageAnalysis]: Checked inductivity of 3 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 3 trivial. 0 not checked. [2025-04-13 18:08:55,971 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-04-13 18:08:55,971 INFO L324 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1386080326] [2025-04-13 18:08:55,971 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1386080326] provided 1 perfect and 0 imperfect interpolant sequences [2025-04-13 18:08:55,971 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-04-13 18:08:55,971 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [8] imperfect sequences [] total 8 [2025-04-13 18:08:55,971 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [473855180] [2025-04-13 18:08:55,971 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-04-13 18:08:55,972 INFO L562 AbstractCegarLoop]: INTERPOLANT automaton has 9 states [2025-04-13 18:08:55,972 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-04-13 18:08:55,973 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2025-04-13 18:08:55,973 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=23, Invalid=49, Unknown=0, NotChecked=0, Total=72 [2025-04-13 18:08:55,973 INFO L87 Difference]: Start difference. First operand 4861 states and 18763 transitions. Second operand has 9 states, 8 states have (on average 4.875) internal successors, (39), 9 states have internal predecessors, (39), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-04-13 18:08:57,648 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-04-13 18:08:57,648 INFO L93 Difference]: Finished difference Result 6453 states and 24937 transitions. [2025-04-13 18:08:57,649 INFO L140 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2025-04-13 18:08:57,649 INFO L79 Accepts]: Start accepts. Automaton has has 9 states, 8 states have (on average 4.875) internal successors, (39), 9 states have internal predecessors, (39), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 40 [2025-04-13 18:08:57,650 INFO L85 Accepts]: Finished accepts. some prefix is accepted. [2025-04-13 18:08:57,678 INFO L225 Difference]: With dead ends: 6453 [2025-04-13 18:08:57,678 INFO L226 Difference]: Without dead ends: 6202 [2025-04-13 18:08:57,681 INFO L436 NwaCegarLoop]: 0 DeclaredPredicates, 8 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 7 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 8 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=23, Invalid=49, Unknown=0, NotChecked=0, Total=72 [2025-04-13 18:08:57,682 INFO L437 NwaCegarLoop]: 10 mSDtfsCounter, 121 mSDsluCounter, 35 mSDsCounter, 0 mSdLazyCounter, 576 mSolverCounterSat, 1 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 121 SdHoareTripleChecker+Valid, 45 SdHoareTripleChecker+Invalid, 577 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 1 IncrementalHoareTripleChecker+Valid, 576 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.3s IncrementalHoareTripleChecker+Time [2025-04-13 18:08:57,682 INFO L438 NwaCegarLoop]: SdHoareTripleChecker [121 Valid, 45 Invalid, 577 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [1 Valid, 576 Invalid, 0 Unknown, 0 Unchecked, 0.3s Time] [2025-04-13 18:08:57,688 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 6202 states. [2025-04-13 18:08:58,469 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 6202 to 4839. [2025-04-13 18:08:58,477 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 4839 states, 4838 states have (on average 3.859859446052088) internal successors, (18674), 4838 states have internal predecessors, (18674), 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 18:08:58,491 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4839 states to 4839 states and 18674 transitions. [2025-04-13 18:08:58,503 INFO L79 Accepts]: Start accepts. Automaton has 4839 states and 18674 transitions. Word has length 40 [2025-04-13 18:08:58,503 INFO L85 Accepts]: Finished accepts. word is rejected. [2025-04-13 18:08:58,503 INFO L485 AbstractCegarLoop]: Abstraction has 4839 states and 18674 transitions. [2025-04-13 18:08:58,503 INFO L486 AbstractCegarLoop]: INTERPOLANT automaton has has 9 states, 8 states have (on average 4.875) internal successors, (39), 9 states have internal predecessors, (39), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-04-13 18:08:58,504 INFO L278 IsEmpty]: Start isEmpty. Operand 4839 states and 18674 transitions. [2025-04-13 18:08:58,514 INFO L284 IsEmpty]: Finished isEmpty. Found accepting run of length 41 [2025-04-13 18:08:58,514 INFO L210 NwaCegarLoop]: Found error trace [2025-04-13 18:08:58,514 INFO L218 NwaCegarLoop]: trace histogram [2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-04-13 18:08:58,514 WARN L466 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable36 [2025-04-13 18:08:58,514 INFO L403 AbstractCegarLoop]: === Iteration 38 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [thread1Err0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES, thread1Err3INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION (and 4 more)] === [2025-04-13 18:08:58,515 INFO L155 PredicateUnifier]: Initialized classic predicate unifier [2025-04-13 18:08:58,515 INFO L85 PathProgramCache]: Analyzing trace with hash -2114754067, now seen corresponding path program 14 times [2025-04-13 18:08:58,515 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-04-13 18:08:58,515 INFO L324 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2097384371] [2025-04-13 18:08:58,515 INFO L95 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST1 [2025-04-13 18:08:58,515 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-04-13 18:08:58,522 INFO L108 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 partitioned 40 statements into 2 equivalence classes. [2025-04-13 18:08:58,528 INFO L111 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 issued 1 check-sat command(s) and asserted 38 of 40 statements. [2025-04-13 18:08:58,528 INFO L114 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 issued 1 check-sat command(s) [2025-04-13 18:08:58,528 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-04-13 18:08:58,708 INFO L134 CoverageAnalysis]: Checked inductivity of 3 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 3 trivial. 0 not checked. [2025-04-13 18:08:58,709 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-04-13 18:08:58,709 INFO L324 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2097384371] [2025-04-13 18:08:58,709 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [2097384371] provided 1 perfect and 0 imperfect interpolant sequences [2025-04-13 18:08:58,709 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-04-13 18:08:58,709 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [8] imperfect sequences [] total 8 [2025-04-13 18:08:58,709 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1426974233] [2025-04-13 18:08:58,709 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-04-13 18:08:58,710 INFO L562 AbstractCegarLoop]: INTERPOLANT automaton has 9 states [2025-04-13 18:08:58,710 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-04-13 18:08:58,711 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2025-04-13 18:08:58,711 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=20, Invalid=52, Unknown=0, NotChecked=0, Total=72 [2025-04-13 18:08:58,711 INFO L87 Difference]: Start difference. First operand 4839 states and 18674 transitions. Second operand has 9 states, 8 states have (on average 4.875) internal successors, (39), 9 states have internal predecessors, (39), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-04-13 18:09:00,434 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-04-13 18:09:00,434 INFO L93 Difference]: Finished difference Result 6711 states and 25886 transitions. [2025-04-13 18:09:00,435 INFO L140 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 10 states. [2025-04-13 18:09:00,435 INFO L79 Accepts]: Start accepts. Automaton has has 9 states, 8 states have (on average 4.875) internal successors, (39), 9 states have internal predecessors, (39), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 40 [2025-04-13 18:09:00,435 INFO L85 Accepts]: Finished accepts. some prefix is accepted. [2025-04-13 18:09:00,518 INFO L225 Difference]: With dead ends: 6711 [2025-04-13 18:09:00,518 INFO L226 Difference]: Without dead ends: 6436 [2025-04-13 18:09:00,519 INFO L436 NwaCegarLoop]: 0 DeclaredPredicates, 10 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 8 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 6 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=25, Invalid=65, Unknown=0, NotChecked=0, Total=90 [2025-04-13 18:09:00,520 INFO L437 NwaCegarLoop]: 9 mSDtfsCounter, 111 mSDsluCounter, 37 mSDsCounter, 0 mSdLazyCounter, 595 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.3s Time, 0 mProtectedPredicate, 0 mProtectedAction, 111 SdHoareTripleChecker+Valid, 46 SdHoareTripleChecker+Invalid, 595 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 595 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.3s IncrementalHoareTripleChecker+Time [2025-04-13 18:09:00,520 INFO L438 NwaCegarLoop]: SdHoareTripleChecker [111 Valid, 46 Invalid, 595 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 595 Invalid, 0 Unknown, 0 Unchecked, 0.3s Time] [2025-04-13 18:09:00,524 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 6436 states. [2025-04-13 18:09:01,244 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 6436 to 4911. [2025-04-13 18:09:01,252 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 4911 states, 4910 states have (on average 3.860692464358452) internal successors, (18956), 4910 states have internal predecessors, (18956), 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 18:09:01,263 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4911 states to 4911 states and 18956 transitions. [2025-04-13 18:09:01,273 INFO L79 Accepts]: Start accepts. Automaton has 4911 states and 18956 transitions. Word has length 40 [2025-04-13 18:09:01,275 INFO L85 Accepts]: Finished accepts. word is rejected. [2025-04-13 18:09:01,275 INFO L485 AbstractCegarLoop]: Abstraction has 4911 states and 18956 transitions. [2025-04-13 18:09:01,275 INFO L486 AbstractCegarLoop]: INTERPOLANT automaton has has 9 states, 8 states have (on average 4.875) internal successors, (39), 9 states have internal predecessors, (39), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-04-13 18:09:01,275 INFO L278 IsEmpty]: Start isEmpty. Operand 4911 states and 18956 transitions. [2025-04-13 18:09:01,283 INFO L284 IsEmpty]: Finished isEmpty. Found accepting run of length 41 [2025-04-13 18:09:01,283 INFO L210 NwaCegarLoop]: Found error trace [2025-04-13 18:09:01,283 INFO L218 NwaCegarLoop]: trace histogram [2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-04-13 18:09:01,283 WARN L466 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable37 [2025-04-13 18:09:01,283 INFO L403 AbstractCegarLoop]: === Iteration 39 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [thread1Err0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES, thread1Err3INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION (and 4 more)] === [2025-04-13 18:09:01,284 INFO L155 PredicateUnifier]: Initialized classic predicate unifier [2025-04-13 18:09:01,284 INFO L85 PathProgramCache]: Analyzing trace with hash -2125128743, now seen corresponding path program 15 times [2025-04-13 18:09:01,284 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-04-13 18:09:01,284 INFO L324 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [425464925] [2025-04-13 18:09:01,284 INFO L95 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST2 [2025-04-13 18:09:01,284 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-04-13 18:09:01,289 INFO L108 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST2 partitioned 40 statements into 2 equivalence classes. [2025-04-13 18:09:01,293 INFO L111 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST2 issued 1 check-sat command(s) and asserted 38 of 40 statements. [2025-04-13 18:09:01,293 INFO L114 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST2 issued 1 check-sat command(s) [2025-04-13 18:09:01,293 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-04-13 18:09:01,517 INFO L134 CoverageAnalysis]: Checked inductivity of 3 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 3 trivial. 0 not checked. [2025-04-13 18:09:01,517 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-04-13 18:09:01,517 INFO L324 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [425464925] [2025-04-13 18:09:01,517 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [425464925] provided 1 perfect and 0 imperfect interpolant sequences [2025-04-13 18:09:01,517 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-04-13 18:09:01,517 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [8] imperfect sequences [] total 8 [2025-04-13 18:09:01,517 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [938282564] [2025-04-13 18:09:01,517 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-04-13 18:09:01,517 INFO L562 AbstractCegarLoop]: INTERPOLANT automaton has 9 states [2025-04-13 18:09:01,517 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-04-13 18:09:01,518 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2025-04-13 18:09:01,518 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=22, Invalid=50, Unknown=0, NotChecked=0, Total=72 [2025-04-13 18:09:01,518 INFO L87 Difference]: Start difference. First operand 4911 states and 18956 transitions. Second operand has 9 states, 8 states have (on average 4.875) internal successors, (39), 9 states have internal predecessors, (39), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-04-13 18:09:03,350 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-04-13 18:09:03,350 INFO L93 Difference]: Finished difference Result 6658 states and 25657 transitions. [2025-04-13 18:09:03,350 INFO L140 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 10 states. [2025-04-13 18:09:03,351 INFO L79 Accepts]: Start accepts. Automaton has has 9 states, 8 states have (on average 4.875) internal successors, (39), 9 states have internal predecessors, (39), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 40 [2025-04-13 18:09:03,351 INFO L85 Accepts]: Finished accepts. some prefix is accepted. [2025-04-13 18:09:03,375 INFO L225 Difference]: With dead ends: 6658 [2025-04-13 18:09:03,375 INFO L226 Difference]: Without dead ends: 6407 [2025-04-13 18:09:03,377 INFO L436 NwaCegarLoop]: 0 DeclaredPredicates, 10 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 8 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 5 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=27, Invalid=63, Unknown=0, NotChecked=0, Total=90 [2025-04-13 18:09:03,377 INFO L437 NwaCegarLoop]: 9 mSDtfsCounter, 124 mSDsluCounter, 38 mSDsCounter, 0 mSdLazyCounter, 668 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.3s Time, 0 mProtectedPredicate, 0 mProtectedAction, 124 SdHoareTripleChecker+Valid, 47 SdHoareTripleChecker+Invalid, 668 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 668 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.4s IncrementalHoareTripleChecker+Time [2025-04-13 18:09:03,377 INFO L438 NwaCegarLoop]: SdHoareTripleChecker [124 Valid, 47 Invalid, 668 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 668 Invalid, 0 Unknown, 0 Unchecked, 0.4s Time] [2025-04-13 18:09:03,385 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 6407 states. [2025-04-13 18:09:04,112 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 6407 to 4887. [2025-04-13 18:09:04,123 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 4887 states, 4886 states have (on average 3.8604175194433075) internal successors, (18862), 4886 states have internal predecessors, (18862), 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 18:09:04,233 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4887 states to 4887 states and 18862 transitions. [2025-04-13 18:09:04,244 INFO L79 Accepts]: Start accepts. Automaton has 4887 states and 18862 transitions. Word has length 40 [2025-04-13 18:09:04,245 INFO L85 Accepts]: Finished accepts. word is rejected. [2025-04-13 18:09:04,245 INFO L485 AbstractCegarLoop]: Abstraction has 4887 states and 18862 transitions. [2025-04-13 18:09:04,245 INFO L486 AbstractCegarLoop]: INTERPOLANT automaton has has 9 states, 8 states have (on average 4.875) internal successors, (39), 9 states have internal predecessors, (39), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-04-13 18:09:04,245 INFO L278 IsEmpty]: Start isEmpty. Operand 4887 states and 18862 transitions. [2025-04-13 18:09:04,253 INFO L284 IsEmpty]: Finished isEmpty. Found accepting run of length 41 [2025-04-13 18:09:04,253 INFO L210 NwaCegarLoop]: Found error trace [2025-04-13 18:09:04,253 INFO L218 NwaCegarLoop]: trace histogram [2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-04-13 18:09:04,254 WARN L466 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable38 [2025-04-13 18:09:04,254 INFO L403 AbstractCegarLoop]: === Iteration 40 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [thread1Err0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES, thread1Err3INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION (and 4 more)] === [2025-04-13 18:09:04,254 INFO L155 PredicateUnifier]: Initialized classic predicate unifier [2025-04-13 18:09:04,254 INFO L85 PathProgramCache]: Analyzing trace with hash -1026838831, now seen corresponding path program 16 times [2025-04-13 18:09:04,254 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-04-13 18:09:04,254 INFO L324 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [393820313] [2025-04-13 18:09:04,254 INFO L95 rtionOrderModulation]: Changing assertion order to TERMS_WITH_SMALL_CONSTANTS_FIRST [2025-04-13 18:09:04,254 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-04-13 18:09:04,260 INFO L108 AnnotateAndAsserter]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST partitioned 40 statements into 2 equivalence classes. [2025-04-13 18:09:04,264 INFO L111 AnnotateAndAsserter]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST issued 2 check-sat command(s) and asserted 40 of 40 statements. [2025-04-13 18:09:04,264 INFO L114 AnnotateAndAsserter]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST issued 2 check-sat command(s) [2025-04-13 18:09:04,264 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-04-13 18:09:04,468 INFO L134 CoverageAnalysis]: Checked inductivity of 3 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 3 trivial. 0 not checked. [2025-04-13 18:09:04,468 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-04-13 18:09:04,468 INFO L324 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [393820313] [2025-04-13 18:09:04,468 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [393820313] provided 1 perfect and 0 imperfect interpolant sequences [2025-04-13 18:09:04,469 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-04-13 18:09:04,469 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2025-04-13 18:09:04,470 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1119492936] [2025-04-13 18:09:04,470 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-04-13 18:09:04,471 INFO L562 AbstractCegarLoop]: INTERPOLANT automaton has 8 states [2025-04-13 18:09:04,471 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-04-13 18:09:04,471 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2025-04-13 18:09:04,471 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=15, Invalid=41, Unknown=0, NotChecked=0, Total=56 [2025-04-13 18:09:04,471 INFO L87 Difference]: Start difference. First operand 4887 states and 18862 transitions. Second operand has 8 states, 7 states have (on average 5.571428571428571) internal successors, (39), 8 states have internal predecessors, (39), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-04-13 18:09:06,454 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-04-13 18:09:06,455 INFO L93 Difference]: Finished difference Result 6990 states and 26926 transitions. [2025-04-13 18:09:06,455 INFO L140 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 10 states. [2025-04-13 18:09:06,455 INFO L79 Accepts]: Start accepts. Automaton has has 8 states, 7 states have (on average 5.571428571428571) internal successors, (39), 8 states have internal predecessors, (39), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 40 [2025-04-13 18:09:06,455 INFO L85 Accepts]: Finished accepts. some prefix is accepted. [2025-04-13 18:09:06,484 INFO L225 Difference]: With dead ends: 6990 [2025-04-13 18:09:06,484 INFO L226 Difference]: Without dead ends: 6739 [2025-04-13 18:09:06,488 INFO L436 NwaCegarLoop]: 0 DeclaredPredicates, 12 GetRequests, 4 SyntacticMatches, 0 SemanticMatches, 8 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=25, Invalid=65, Unknown=0, NotChecked=0, Total=90 [2025-04-13 18:09:06,488 INFO L437 NwaCegarLoop]: 9 mSDtfsCounter, 112 mSDsluCounter, 47 mSDsCounter, 0 mSdLazyCounter, 864 mSolverCounterSat, 1 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.4s Time, 0 mProtectedPredicate, 0 mProtectedAction, 112 SdHoareTripleChecker+Valid, 56 SdHoareTripleChecker+Invalid, 865 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 1 IncrementalHoareTripleChecker+Valid, 864 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.5s IncrementalHoareTripleChecker+Time [2025-04-13 18:09:06,488 INFO L438 NwaCegarLoop]: SdHoareTripleChecker [112 Valid, 56 Invalid, 865 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [1 Valid, 864 Invalid, 0 Unknown, 0 Unchecked, 0.5s Time] [2025-04-13 18:09:06,495 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 6739 states. [2025-04-13 18:09:07,293 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 6739 to 4791. [2025-04-13 18:09:07,300 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 4791 states, 4790 states have (on average 3.862630480167015) internal successors, (18502), 4790 states have internal predecessors, (18502), 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 18:09:07,313 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4791 states to 4791 states and 18502 transitions. [2025-04-13 18:09:07,321 INFO L79 Accepts]: Start accepts. Automaton has 4791 states and 18502 transitions. Word has length 40 [2025-04-13 18:09:07,321 INFO L85 Accepts]: Finished accepts. word is rejected. [2025-04-13 18:09:07,321 INFO L485 AbstractCegarLoop]: Abstraction has 4791 states and 18502 transitions. [2025-04-13 18:09:07,321 INFO L486 AbstractCegarLoop]: INTERPOLANT automaton has has 8 states, 7 states have (on average 5.571428571428571) internal successors, (39), 8 states have internal predecessors, (39), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-04-13 18:09:07,322 INFO L278 IsEmpty]: Start isEmpty. Operand 4791 states and 18502 transitions. [2025-04-13 18:09:07,329 INFO L284 IsEmpty]: Finished isEmpty. Found accepting run of length 41 [2025-04-13 18:09:07,329 INFO L210 NwaCegarLoop]: Found error trace [2025-04-13 18:09:07,329 INFO L218 NwaCegarLoop]: trace histogram [2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-04-13 18:09:07,329 WARN L466 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable39 [2025-04-13 18:09:07,330 INFO L403 AbstractCegarLoop]: === Iteration 41 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [thread1Err0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES, thread1Err3INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION (and 4 more)] === [2025-04-13 18:09:07,330 INFO L155 PredicateUnifier]: Initialized classic predicate unifier [2025-04-13 18:09:07,330 INFO L85 PathProgramCache]: Analyzing trace with hash -1638849540, now seen corresponding path program 16 times [2025-04-13 18:09:07,330 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-04-13 18:09:07,330 INFO L324 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [543515605] [2025-04-13 18:09:07,330 INFO L95 rtionOrderModulation]: Changing assertion order to TERMS_WITH_SMALL_CONSTANTS_FIRST [2025-04-13 18:09:07,330 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-04-13 18:09:07,338 INFO L108 AnnotateAndAsserter]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST partitioned 40 statements into 2 equivalence classes. [2025-04-13 18:09:07,346 INFO L111 AnnotateAndAsserter]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST issued 2 check-sat command(s) and asserted 40 of 40 statements. [2025-04-13 18:09:07,347 INFO L114 AnnotateAndAsserter]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST issued 2 check-sat command(s) [2025-04-13 18:09:07,347 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-04-13 18:09:07,590 INFO L134 CoverageAnalysis]: Checked inductivity of 4 backedges. 0 proven. 1 refuted. 0 times theorem prover too weak. 3 trivial. 0 not checked. [2025-04-13 18:09:07,590 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-04-13 18:09:07,590 INFO L324 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [543515605] [2025-04-13 18:09:07,590 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [543515605] provided 0 perfect and 1 imperfect interpolant sequences [2025-04-13 18:09:07,590 INFO L324 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1681031153] [2025-04-13 18:09:07,590 INFO L95 rtionOrderModulation]: Changing assertion order to TERMS_WITH_SMALL_CONSTANTS_FIRST [2025-04-13 18:09:07,593 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-04-13 18:09:07,594 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2025-04-13 18:09:07,598 INFO L229 MonitoredProcess]: Starting monitored process 24 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2025-04-13 18:09:07,603 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (24)] Waiting until timeout for monitored process [2025-04-13 18:09:07,680 INFO L108 AnnotateAndAsserter]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST partitioned 40 statements into 2 equivalence classes. [2025-04-13 18:09:07,700 INFO L111 AnnotateAndAsserter]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST issued 2 check-sat command(s) and asserted 40 of 40 statements. [2025-04-13 18:09:07,701 INFO L114 AnnotateAndAsserter]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST issued 2 check-sat command(s) [2025-04-13 18:09:07,701 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-04-13 18:09:07,704 INFO L256 TraceCheckSpWp]: Trace formula consists of 266 conjuncts, 25 conjuncts are in the unsatisfiable core [2025-04-13 18:09:07,705 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-04-13 18:09:07,821 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 19 treesize of output 7 [2025-04-13 18:09:07,842 INFO L134 CoverageAnalysis]: Checked inductivity of 4 backedges. 0 proven. 1 refuted. 0 times theorem prover too weak. 3 trivial. 0 not checked. [2025-04-13 18:09:07,842 INFO L312 TraceCheckSpWp]: Computing backward predicates... [2025-04-13 18:09:07,886 INFO L325 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2025-04-13 18:09:07,887 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 25 treesize of output 16 [2025-04-13 18:09:07,959 INFO L134 CoverageAnalysis]: Checked inductivity of 4 backedges. 0 proven. 1 refuted. 0 times theorem prover too weak. 3 trivial. 0 not checked. [2025-04-13 18:09:07,960 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1681031153] provided 0 perfect and 2 imperfect interpolant sequences [2025-04-13 18:09:07,960 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2025-04-13 18:09:07,960 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [7, 7, 7] total 14 [2025-04-13 18:09:07,960 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [959567015] [2025-04-13 18:09:07,960 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2025-04-13 18:09:07,960 INFO L562 AbstractCegarLoop]: INTERPOLANT automaton has 15 states [2025-04-13 18:09:07,960 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-04-13 18:09:07,961 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 15 interpolants. [2025-04-13 18:09:07,961 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=41, Invalid=169, Unknown=0, NotChecked=0, Total=210 [2025-04-13 18:09:07,961 INFO L87 Difference]: Start difference. First operand 4791 states and 18502 transitions. Second operand has 15 states, 14 states have (on average 5.357142857142857) internal successors, (75), 15 states have internal predecessors, (75), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-04-13 18:09:10,356 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-04-13 18:09:10,357 INFO L93 Difference]: Finished difference Result 6884 states and 26603 transitions. [2025-04-13 18:09:10,357 INFO L140 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 12 states. [2025-04-13 18:09:10,357 INFO L79 Accepts]: Start accepts. Automaton has has 15 states, 14 states have (on average 5.357142857142857) internal successors, (75), 15 states have internal predecessors, (75), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 40 [2025-04-13 18:09:10,357 INFO L85 Accepts]: Finished accepts. some prefix is accepted. [2025-04-13 18:09:10,386 INFO L225 Difference]: With dead ends: 6884 [2025-04-13 18:09:10,386 INFO L226 Difference]: Without dead ends: 6663 [2025-04-13 18:09:10,388 INFO L436 NwaCegarLoop]: 0 DeclaredPredicates, 92 GetRequests, 76 SyntacticMatches, 0 SemanticMatches, 16 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 36 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=57, Invalid=249, Unknown=0, NotChecked=0, Total=306 [2025-04-13 18:09:10,389 INFO L437 NwaCegarLoop]: 9 mSDtfsCounter, 184 mSDsluCounter, 72 mSDsCounter, 0 mSdLazyCounter, 1254 mSolverCounterSat, 2 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.5s Time, 0 mProtectedPredicate, 0 mProtectedAction, 184 SdHoareTripleChecker+Valid, 81 SdHoareTripleChecker+Invalid, 1256 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 2 IncrementalHoareTripleChecker+Valid, 1254 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.6s IncrementalHoareTripleChecker+Time [2025-04-13 18:09:10,389 INFO L438 NwaCegarLoop]: SdHoareTripleChecker [184 Valid, 81 Invalid, 1256 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [2 Valid, 1254 Invalid, 0 Unknown, 0 Unchecked, 0.6s Time] [2025-04-13 18:09:10,394 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 6663 states. [2025-04-13 18:09:11,159 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 6663 to 4835. [2025-04-13 18:09:11,165 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 4835 states, 4834 states have (on average 3.864294580057923) internal successors, (18680), 4834 states have internal predecessors, (18680), 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 18:09:11,176 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4835 states to 4835 states and 18680 transitions. [2025-04-13 18:09:11,184 INFO L79 Accepts]: Start accepts. Automaton has 4835 states and 18680 transitions. Word has length 40 [2025-04-13 18:09:11,185 INFO L85 Accepts]: Finished accepts. word is rejected. [2025-04-13 18:09:11,185 INFO L485 AbstractCegarLoop]: Abstraction has 4835 states and 18680 transitions. [2025-04-13 18:09:11,185 INFO L486 AbstractCegarLoop]: INTERPOLANT automaton has has 15 states, 14 states have (on average 5.357142857142857) internal successors, (75), 15 states have internal predecessors, (75), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-04-13 18:09:11,185 INFO L278 IsEmpty]: Start isEmpty. Operand 4835 states and 18680 transitions. [2025-04-13 18:09:11,192 INFO L284 IsEmpty]: Finished isEmpty. Found accepting run of length 41 [2025-04-13 18:09:11,192 INFO L210 NwaCegarLoop]: Found error trace [2025-04-13 18:09:11,193 INFO L218 NwaCegarLoop]: trace histogram [2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-04-13 18:09:11,199 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (24)] Forceful destruction successful, exit code 0 [2025-04-13 18:09:11,394 WARN L466 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable40,24 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-04-13 18:09:11,395 INFO L403 AbstractCegarLoop]: === Iteration 42 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [thread1Err0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES, thread1Err3INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION (and 4 more)] === [2025-04-13 18:09:11,395 INFO L155 PredicateUnifier]: Initialized classic predicate unifier [2025-04-13 18:09:11,395 INFO L85 PathProgramCache]: Analyzing trace with hash 812941846, now seen corresponding path program 17 times [2025-04-13 18:09:11,395 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-04-13 18:09:11,395 INFO L324 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [545123694] [2025-04-13 18:09:11,395 INFO L95 rtionOrderModulation]: Changing assertion order to INSIDE_LOOP_FIRST1 [2025-04-13 18:09:11,395 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-04-13 18:09:11,401 INFO L108 AnnotateAndAsserter]: Assert order INSIDE_LOOP_FIRST1 partitioned 40 statements into 2 equivalence classes. [2025-04-13 18:09:11,409 INFO L111 AnnotateAndAsserter]: Assert order INSIDE_LOOP_FIRST1 issued 2 check-sat command(s) and asserted 40 of 40 statements. [2025-04-13 18:09:11,410 INFO L114 AnnotateAndAsserter]: Assert order INSIDE_LOOP_FIRST1 issued 2 check-sat command(s) [2025-04-13 18:09:11,410 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-04-13 18:09:11,710 INFO L134 CoverageAnalysis]: Checked inductivity of 3 backedges. 0 proven. 3 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-04-13 18:09:11,711 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-04-13 18:09:11,711 INFO L324 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [545123694] [2025-04-13 18:09:11,711 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [545123694] provided 0 perfect and 1 imperfect interpolant sequences [2025-04-13 18:09:11,711 INFO L324 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [743673505] [2025-04-13 18:09:11,711 INFO L95 rtionOrderModulation]: Changing assertion order to INSIDE_LOOP_FIRST1 [2025-04-13 18:09:11,711 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-04-13 18:09:11,711 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2025-04-13 18:09:11,713 INFO L229 MonitoredProcess]: Starting monitored process 25 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2025-04-13 18:09:11,714 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (25)] Waiting until timeout for monitored process [2025-04-13 18:09:11,784 INFO L108 AnnotateAndAsserter]: Assert order INSIDE_LOOP_FIRST1 partitioned 40 statements into 2 equivalence classes. [2025-04-13 18:09:11,804 INFO L111 AnnotateAndAsserter]: Assert order INSIDE_LOOP_FIRST1 issued 2 check-sat command(s) and asserted 40 of 40 statements. [2025-04-13 18:09:11,804 INFO L114 AnnotateAndAsserter]: Assert order INSIDE_LOOP_FIRST1 issued 2 check-sat command(s) [2025-04-13 18:09:11,804 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-04-13 18:09:11,805 INFO L256 TraceCheckSpWp]: Trace formula consists of 266 conjuncts, 35 conjuncts are in the unsatisfiable core [2025-04-13 18:09:11,806 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-04-13 18:09:11,898 INFO L354 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 15 treesize of output 7 [2025-04-13 18:09:11,917 INFO L134 CoverageAnalysis]: Checked inductivity of 3 backedges. 0 proven. 2 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2025-04-13 18:09:11,917 INFO L312 TraceCheckSpWp]: Computing backward predicates... [2025-04-13 18:09:11,963 INFO L325 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2025-04-13 18:09:11,963 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 25 treesize of output 16 [2025-04-13 18:09:12,004 INFO L134 CoverageAnalysis]: Checked inductivity of 3 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 3 trivial. 0 not checked. [2025-04-13 18:09:12,004 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [743673505] provided 1 perfect and 1 imperfect interpolant sequences [2025-04-13 18:09:12,004 INFO L185 FreeRefinementEngine]: Found 1 perfect and 2 imperfect interpolant sequences. [2025-04-13 18:09:12,004 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [7] imperfect sequences [10, 9] total 16 [2025-04-13 18:09:12,004 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [636292750] [2025-04-13 18:09:12,004 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-04-13 18:09:12,005 INFO L562 AbstractCegarLoop]: INTERPOLANT automaton has 8 states [2025-04-13 18:09:12,005 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-04-13 18:09:12,005 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2025-04-13 18:09:12,005 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=47, Invalid=225, Unknown=0, NotChecked=0, Total=272 [2025-04-13 18:09:12,005 INFO L87 Difference]: Start difference. First operand 4835 states and 18680 transitions. Second operand has 8 states, 7 states have (on average 5.571428571428571) internal successors, (39), 8 states have internal predecessors, (39), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-04-13 18:09:13,849 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-04-13 18:09:13,849 INFO L93 Difference]: Finished difference Result 6554 states and 25321 transitions. [2025-04-13 18:09:13,849 INFO L140 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2025-04-13 18:09:13,849 INFO L79 Accepts]: Start accepts. Automaton has has 8 states, 7 states have (on average 5.571428571428571) internal successors, (39), 8 states have internal predecessors, (39), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 40 [2025-04-13 18:09:13,849 INFO L85 Accepts]: Finished accepts. some prefix is accepted. [2025-04-13 18:09:13,870 INFO L225 Difference]: With dead ends: 6554 [2025-04-13 18:09:13,870 INFO L226 Difference]: Without dead ends: 6333 [2025-04-13 18:09:13,871 INFO L436 NwaCegarLoop]: 0 DeclaredPredicates, 96 GetRequests, 77 SyntacticMatches, 0 SemanticMatches, 19 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 71 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=69, Invalid=351, Unknown=0, NotChecked=0, Total=420 [2025-04-13 18:09:13,871 INFO L437 NwaCegarLoop]: 9 mSDtfsCounter, 102 mSDsluCounter, 45 mSDsCounter, 0 mSdLazyCounter, 756 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.3s Time, 0 mProtectedPredicate, 0 mProtectedAction, 102 SdHoareTripleChecker+Valid, 54 SdHoareTripleChecker+Invalid, 756 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 756 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.4s IncrementalHoareTripleChecker+Time [2025-04-13 18:09:13,871 INFO L438 NwaCegarLoop]: SdHoareTripleChecker [102 Valid, 54 Invalid, 756 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 756 Invalid, 0 Unknown, 0 Unchecked, 0.4s Time] [2025-04-13 18:09:13,876 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 6333 states. [2025-04-13 18:09:14,584 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 6333 to 4857. [2025-04-13 18:09:14,590 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 4857 states, 4856 states have (on average 3.8651153212520595) internal successors, (18769), 4856 states have internal predecessors, (18769), 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 18:09:14,600 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4857 states to 4857 states and 18769 transitions. [2025-04-13 18:09:14,608 INFO L79 Accepts]: Start accepts. Automaton has 4857 states and 18769 transitions. Word has length 40 [2025-04-13 18:09:14,608 INFO L85 Accepts]: Finished accepts. word is rejected. [2025-04-13 18:09:14,608 INFO L485 AbstractCegarLoop]: Abstraction has 4857 states and 18769 transitions. [2025-04-13 18:09:14,608 INFO L486 AbstractCegarLoop]: INTERPOLANT automaton has has 8 states, 7 states have (on average 5.571428571428571) internal successors, (39), 8 states have internal predecessors, (39), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-04-13 18:09:14,609 INFO L278 IsEmpty]: Start isEmpty. Operand 4857 states and 18769 transitions. [2025-04-13 18:09:14,615 INFO L284 IsEmpty]: Finished isEmpty. Found accepting run of length 41 [2025-04-13 18:09:14,615 INFO L210 NwaCegarLoop]: Found error trace [2025-04-13 18:09:14,616 INFO L218 NwaCegarLoop]: trace histogram [2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-04-13 18:09:14,622 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (25)] Forceful destruction successful, exit code 0 [2025-04-13 18:09:14,816 WARN L466 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable41,25 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-04-13 18:09:14,816 INFO L403 AbstractCegarLoop]: === Iteration 43 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [thread1Err0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES, thread1Err3INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION (and 4 more)] === [2025-04-13 18:09:14,816 INFO L155 PredicateUnifier]: Initialized classic predicate unifier [2025-04-13 18:09:14,816 INFO L85 PathProgramCache]: Analyzing trace with hash 575364378, now seen corresponding path program 18 times [2025-04-13 18:09:14,816 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-04-13 18:09:14,817 INFO L324 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1982601205] [2025-04-13 18:09:14,817 INFO L95 rtionOrderModulation]: Changing assertion order to MIX_INSIDE_OUTSIDE [2025-04-13 18:09:14,817 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-04-13 18:09:14,821 INFO L108 AnnotateAndAsserter]: Assert order MIX_INSIDE_OUTSIDE partitioned 40 statements into 2 equivalence classes. [2025-04-13 18:09:14,825 INFO L111 AnnotateAndAsserter]: Assert order MIX_INSIDE_OUTSIDE issued 1 check-sat command(s) and asserted 38 of 40 statements. [2025-04-13 18:09:14,825 INFO L114 AnnotateAndAsserter]: Assert order MIX_INSIDE_OUTSIDE issued 1 check-sat command(s) [2025-04-13 18:09:14,825 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-04-13 18:09:14,929 INFO L134 CoverageAnalysis]: Checked inductivity of 3 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 3 trivial. 0 not checked. [2025-04-13 18:09:14,930 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-04-13 18:09:14,930 INFO L324 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1982601205] [2025-04-13 18:09:14,930 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1982601205] provided 1 perfect and 0 imperfect interpolant sequences [2025-04-13 18:09:14,930 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-04-13 18:09:14,930 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [8] imperfect sequences [] total 8 [2025-04-13 18:09:14,930 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1054574083] [2025-04-13 18:09:14,930 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-04-13 18:09:14,930 INFO L562 AbstractCegarLoop]: INTERPOLANT automaton has 9 states [2025-04-13 18:09:14,930 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-04-13 18:09:14,930 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2025-04-13 18:09:14,930 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=22, Invalid=50, Unknown=0, NotChecked=0, Total=72 [2025-04-13 18:09:14,930 INFO L87 Difference]: Start difference. First operand 4857 states and 18769 transitions. Second operand has 9 states, 8 states have (on average 4.875) internal successors, (39), 9 states have internal predecessors, (39), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-04-13 18:09:16,555 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-04-13 18:09:16,555 INFO L93 Difference]: Finished difference Result 6505 states and 25149 transitions. [2025-04-13 18:09:16,555 INFO L140 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 10 states. [2025-04-13 18:09:16,555 INFO L79 Accepts]: Start accepts. Automaton has has 9 states, 8 states have (on average 4.875) internal successors, (39), 9 states have internal predecessors, (39), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 40 [2025-04-13 18:09:16,555 INFO L85 Accepts]: Finished accepts. some prefix is accepted. [2025-04-13 18:09:16,576 INFO L225 Difference]: With dead ends: 6505 [2025-04-13 18:09:16,577 INFO L226 Difference]: Without dead ends: 6254 [2025-04-13 18:09:16,578 INFO L436 NwaCegarLoop]: 0 DeclaredPredicates, 10 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 8 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 5 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=27, Invalid=63, Unknown=0, NotChecked=0, Total=90 [2025-04-13 18:09:16,578 INFO L437 NwaCegarLoop]: 9 mSDtfsCounter, 119 mSDsluCounter, 36 mSDsCounter, 0 mSdLazyCounter, 591 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 119 SdHoareTripleChecker+Valid, 45 SdHoareTripleChecker+Invalid, 591 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 591 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.2s IncrementalHoareTripleChecker+Time [2025-04-13 18:09:16,578 INFO L438 NwaCegarLoop]: SdHoareTripleChecker [119 Valid, 45 Invalid, 591 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 591 Invalid, 0 Unknown, 0 Unchecked, 0.2s Time] [2025-04-13 18:09:16,583 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 6254 states. [2025-04-13 18:09:17,303 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 6254 to 4791. [2025-04-13 18:09:17,310 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 4791 states, 4790 states have (on average 3.862630480167015) internal successors, (18502), 4790 states have internal predecessors, (18502), 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 18:09:17,319 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4791 states to 4791 states and 18502 transitions. [2025-04-13 18:09:17,328 INFO L79 Accepts]: Start accepts. Automaton has 4791 states and 18502 transitions. Word has length 40 [2025-04-13 18:09:17,328 INFO L85 Accepts]: Finished accepts. word is rejected. [2025-04-13 18:09:17,328 INFO L485 AbstractCegarLoop]: Abstraction has 4791 states and 18502 transitions. [2025-04-13 18:09:17,328 INFO L486 AbstractCegarLoop]: INTERPOLANT automaton has has 9 states, 8 states have (on average 4.875) internal successors, (39), 9 states have internal predecessors, (39), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-04-13 18:09:17,328 INFO L278 IsEmpty]: Start isEmpty. Operand 4791 states and 18502 transitions. [2025-04-13 18:09:17,336 INFO L284 IsEmpty]: Finished isEmpty. Found accepting run of length 41 [2025-04-13 18:09:17,336 INFO L210 NwaCegarLoop]: Found error trace [2025-04-13 18:09:17,336 INFO L218 NwaCegarLoop]: trace histogram [2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-04-13 18:09:17,336 WARN L466 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable42 [2025-04-13 18:09:17,336 INFO L403 AbstractCegarLoop]: === Iteration 44 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [thread1Err0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES, thread1Err3INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION (and 4 more)] === [2025-04-13 18:09:17,336 INFO L155 PredicateUnifier]: Initialized classic predicate unifier [2025-04-13 18:09:17,337 INFO L85 PathProgramCache]: Analyzing trace with hash -1228266003, now seen corresponding path program 17 times [2025-04-13 18:09:17,337 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-04-13 18:09:17,337 INFO L324 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [25196675] [2025-04-13 18:09:17,337 INFO L95 rtionOrderModulation]: Changing assertion order to INSIDE_LOOP_FIRST1 [2025-04-13 18:09:17,337 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-04-13 18:09:17,343 INFO L108 AnnotateAndAsserter]: Assert order INSIDE_LOOP_FIRST1 partitioned 40 statements into 2 equivalence classes. [2025-04-13 18:09:17,348 INFO L111 AnnotateAndAsserter]: Assert order INSIDE_LOOP_FIRST1 issued 2 check-sat command(s) and asserted 40 of 40 statements. [2025-04-13 18:09:17,348 INFO L114 AnnotateAndAsserter]: Assert order INSIDE_LOOP_FIRST1 issued 2 check-sat command(s) [2025-04-13 18:09:17,348 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-04-13 18:09:17,532 INFO L134 CoverageAnalysis]: Checked inductivity of 4 backedges. 0 proven. 4 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-04-13 18:09:17,532 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-04-13 18:09:17,532 INFO L324 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [25196675] [2025-04-13 18:09:17,532 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [25196675] provided 0 perfect and 1 imperfect interpolant sequences [2025-04-13 18:09:17,532 INFO L324 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [710954636] [2025-04-13 18:09:17,532 INFO L95 rtionOrderModulation]: Changing assertion order to INSIDE_LOOP_FIRST1 [2025-04-13 18:09:17,532 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-04-13 18:09:17,533 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2025-04-13 18:09:17,538 INFO L229 MonitoredProcess]: Starting monitored process 26 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2025-04-13 18:09:17,543 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (26)] Waiting until timeout for monitored process [2025-04-13 18:09:17,614 INFO L108 AnnotateAndAsserter]: Assert order INSIDE_LOOP_FIRST1 partitioned 40 statements into 2 equivalence classes. [2025-04-13 18:09:17,634 INFO L111 AnnotateAndAsserter]: Assert order INSIDE_LOOP_FIRST1 issued 2 check-sat command(s) and asserted 40 of 40 statements. [2025-04-13 18:09:17,634 INFO L114 AnnotateAndAsserter]: Assert order INSIDE_LOOP_FIRST1 issued 2 check-sat command(s) [2025-04-13 18:09:17,634 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-04-13 18:09:17,635 INFO L256 TraceCheckSpWp]: Trace formula consists of 266 conjuncts, 35 conjuncts are in the unsatisfiable core [2025-04-13 18:09:17,636 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-04-13 18:09:17,743 INFO L354 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 15 treesize of output 7 [2025-04-13 18:09:17,761 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 18:09:17,761 INFO L312 TraceCheckSpWp]: Computing backward predicates... [2025-04-13 18:09:17,823 INFO L325 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2025-04-13 18:09:17,823 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 20 treesize of output 14 [2025-04-13 18:09:17,836 INFO L134 CoverageAnalysis]: Checked inductivity of 4 backedges. 0 proven. 1 refuted. 0 times theorem prover too weak. 3 trivial. 0 not checked. [2025-04-13 18:09:17,836 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [710954636] provided 0 perfect and 2 imperfect interpolant sequences [2025-04-13 18:09:17,836 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2025-04-13 18:09:17,836 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [9, 9, 7] total 19 [2025-04-13 18:09:17,836 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1603133053] [2025-04-13 18:09:17,836 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2025-04-13 18:09:17,837 INFO L562 AbstractCegarLoop]: INTERPOLANT automaton has 20 states [2025-04-13 18:09:17,837 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-04-13 18:09:17,837 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 20 interpolants. [2025-04-13 18:09:17,837 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=54, Invalid=326, Unknown=0, NotChecked=0, Total=380 [2025-04-13 18:09:17,837 INFO L87 Difference]: Start difference. First operand 4791 states and 18502 transitions. Second operand has 20 states, 19 states have (on average 3.8421052631578947) internal successors, (73), 20 states have internal predecessors, (73), 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 18:09:20,006 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-04-13 18:09:20,006 INFO L93 Difference]: Finished difference Result 7113 states and 27453 transitions. [2025-04-13 18:09:20,007 INFO L140 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 19 states. [2025-04-13 18:09:20,007 INFO L79 Accepts]: Start accepts. Automaton has has 20 states, 19 states have (on average 3.8421052631578947) internal successors, (73), 20 states have internal predecessors, (73), 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 40 [2025-04-13 18:09:20,007 INFO L85 Accepts]: Finished accepts. some prefix is accepted. [2025-04-13 18:09:20,029 INFO L225 Difference]: With dead ends: 7113 [2025-04-13 18:09:20,029 INFO L226 Difference]: Without dead ends: 6838 [2025-04-13 18:09:20,031 INFO L436 NwaCegarLoop]: 0 DeclaredPredicates, 111 GetRequests, 80 SyntacticMatches, 0 SemanticMatches, 31 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 152 ImplicationChecksByTransitivity, 0.3s TimeCoverageRelationStatistics Valid=162, Invalid=894, Unknown=0, NotChecked=0, Total=1056 [2025-04-13 18:09:20,031 INFO L437 NwaCegarLoop]: 12 mSDtfsCounter, 246 mSDsluCounter, 123 mSDsCounter, 0 mSdLazyCounter, 1775 mSolverCounterSat, 2 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.5s Time, 0 mProtectedPredicate, 0 mProtectedAction, 246 SdHoareTripleChecker+Valid, 135 SdHoareTripleChecker+Invalid, 1777 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 2 IncrementalHoareTripleChecker+Valid, 1775 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.6s IncrementalHoareTripleChecker+Time [2025-04-13 18:09:20,031 INFO L438 NwaCegarLoop]: SdHoareTripleChecker [246 Valid, 135 Invalid, 1777 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [2 Valid, 1775 Invalid, 0 Unknown, 0 Unchecked, 0.6s Time] [2025-04-13 18:09:20,036 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 6838 states. [2025-04-13 18:09:20,758 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 6838 to 4935. [2025-04-13 18:09:20,764 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 4935 states, 4934 states have (on average 3.8617754357519254) internal successors, (19054), 4934 states have internal predecessors, (19054), 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 18:09:20,774 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4935 states to 4935 states and 19054 transitions. [2025-04-13 18:09:20,782 INFO L79 Accepts]: Start accepts. Automaton has 4935 states and 19054 transitions. Word has length 40 [2025-04-13 18:09:20,783 INFO L85 Accepts]: Finished accepts. word is rejected. [2025-04-13 18:09:20,783 INFO L485 AbstractCegarLoop]: Abstraction has 4935 states and 19054 transitions. [2025-04-13 18:09:20,783 INFO L486 AbstractCegarLoop]: INTERPOLANT automaton has has 20 states, 19 states have (on average 3.8421052631578947) internal successors, (73), 20 states have internal predecessors, (73), 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 18:09:20,783 INFO L278 IsEmpty]: Start isEmpty. Operand 4935 states and 19054 transitions. [2025-04-13 18:09:20,790 INFO L284 IsEmpty]: Finished isEmpty. Found accepting run of length 41 [2025-04-13 18:09:20,790 INFO L210 NwaCegarLoop]: Found error trace [2025-04-13 18:09:20,790 INFO L218 NwaCegarLoop]: trace histogram [2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-04-13 18:09:20,796 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (26)] Ended with exit code 0 [2025-04-13 18:09:20,994 WARN L466 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 26 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable43 [2025-04-13 18:09:20,994 INFO L403 AbstractCegarLoop]: === Iteration 45 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [thread1Err0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES, thread1Err3INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION (and 4 more)] === [2025-04-13 18:09:20,994 INFO L155 PredicateUnifier]: Initialized classic predicate unifier [2025-04-13 18:09:20,994 INFO L85 PathProgramCache]: Analyzing trace with hash 790091097, now seen corresponding path program 18 times [2025-04-13 18:09:20,994 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-04-13 18:09:20,994 INFO L324 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1659305754] [2025-04-13 18:09:20,994 INFO L95 rtionOrderModulation]: Changing assertion order to MIX_INSIDE_OUTSIDE [2025-04-13 18:09:20,995 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-04-13 18:09:20,999 INFO L108 AnnotateAndAsserter]: Assert order MIX_INSIDE_OUTSIDE partitioned 40 statements into 2 equivalence classes. [2025-04-13 18:09:21,003 INFO L111 AnnotateAndAsserter]: Assert order MIX_INSIDE_OUTSIDE issued 1 check-sat command(s) and asserted 38 of 40 statements. [2025-04-13 18:09:21,003 INFO L114 AnnotateAndAsserter]: Assert order MIX_INSIDE_OUTSIDE issued 1 check-sat command(s) [2025-04-13 18:09:21,003 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-04-13 18:09:21,107 INFO L134 CoverageAnalysis]: Checked inductivity of 3 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 3 trivial. 0 not checked. [2025-04-13 18:09:21,107 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-04-13 18:09:21,107 INFO L324 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1659305754] [2025-04-13 18:09:21,107 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1659305754] provided 1 perfect and 0 imperfect interpolant sequences [2025-04-13 18:09:21,107 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-04-13 18:09:21,107 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [8] imperfect sequences [] total 8 [2025-04-13 18:09:21,107 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1965074325] [2025-04-13 18:09:21,107 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-04-13 18:09:21,108 INFO L562 AbstractCegarLoop]: INTERPOLANT automaton has 9 states [2025-04-13 18:09:21,108 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-04-13 18:09:21,108 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2025-04-13 18:09:21,108 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=20, Invalid=52, Unknown=0, NotChecked=0, Total=72 [2025-04-13 18:09:21,108 INFO L87 Difference]: Start difference. First operand 4935 states and 19054 transitions. Second operand has 9 states, 8 states have (on average 4.875) internal successors, (39), 9 states have internal predecessors, (39), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-04-13 18:09:23,049 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-04-13 18:09:23,049 INFO L93 Difference]: Finished difference Result 7318 states and 28190 transitions. [2025-04-13 18:09:23,049 INFO L140 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 12 states. [2025-04-13 18:09:23,049 INFO L79 Accepts]: Start accepts. Automaton has has 9 states, 8 states have (on average 4.875) internal successors, (39), 9 states have internal predecessors, (39), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 40 [2025-04-13 18:09:23,049 INFO L85 Accepts]: Finished accepts. some prefix is accepted. [2025-04-13 18:09:23,072 INFO L225 Difference]: With dead ends: 7318 [2025-04-13 18:09:23,072 INFO L226 Difference]: Without dead ends: 7067 [2025-04-13 18:09:23,074 INFO L436 NwaCegarLoop]: 0 DeclaredPredicates, 16 GetRequests, 5 SyntacticMatches, 0 SemanticMatches, 11 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 11 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=42, Invalid=114, Unknown=0, NotChecked=0, Total=156 [2025-04-13 18:09:23,074 INFO L437 NwaCegarLoop]: 11 mSDtfsCounter, 151 mSDsluCounter, 55 mSDsCounter, 0 mSdLazyCounter, 883 mSolverCounterSat, 2 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.3s Time, 0 mProtectedPredicate, 0 mProtectedAction, 151 SdHoareTripleChecker+Valid, 66 SdHoareTripleChecker+Invalid, 885 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 2 IncrementalHoareTripleChecker+Valid, 883 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.3s IncrementalHoareTripleChecker+Time [2025-04-13 18:09:23,074 INFO L438 NwaCegarLoop]: SdHoareTripleChecker [151 Valid, 66 Invalid, 885 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [2 Valid, 883 Invalid, 0 Unknown, 0 Unchecked, 0.3s Time] [2025-04-13 18:09:23,079 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 7067 states. [2025-04-13 18:09:23,834 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 7067 to 4911. [2025-04-13 18:09:23,838 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 4911 states, 4910 states have (on average 3.8615071283095723) internal successors, (18960), 4910 states have internal predecessors, (18960), 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 18:09:23,847 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4911 states to 4911 states and 18960 transitions. [2025-04-13 18:09:23,854 INFO L79 Accepts]: Start accepts. Automaton has 4911 states and 18960 transitions. Word has length 40 [2025-04-13 18:09:23,854 INFO L85 Accepts]: Finished accepts. word is rejected. [2025-04-13 18:09:23,854 INFO L485 AbstractCegarLoop]: Abstraction has 4911 states and 18960 transitions. [2025-04-13 18:09:23,854 INFO L486 AbstractCegarLoop]: INTERPOLANT automaton has has 9 states, 8 states have (on average 4.875) internal successors, (39), 9 states have internal predecessors, (39), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-04-13 18:09:23,854 INFO L278 IsEmpty]: Start isEmpty. Operand 4911 states and 18960 transitions. [2025-04-13 18:09:23,860 INFO L284 IsEmpty]: Finished isEmpty. Found accepting run of length 41 [2025-04-13 18:09:23,860 INFO L210 NwaCegarLoop]: Found error trace [2025-04-13 18:09:23,860 INFO L218 NwaCegarLoop]: trace histogram [2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-04-13 18:09:23,861 WARN L466 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable44 [2025-04-13 18:09:23,861 INFO L403 AbstractCegarLoop]: === Iteration 46 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [thread1Err0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES, thread1Err3INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION (and 4 more)] === [2025-04-13 18:09:23,861 INFO L155 PredicateUnifier]: Initialized classic predicate unifier [2025-04-13 18:09:23,861 INFO L85 PathProgramCache]: Analyzing trace with hash -140350767, now seen corresponding path program 19 times [2025-04-13 18:09:23,861 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-04-13 18:09:23,861 INFO L324 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [616697003] [2025-04-13 18:09:23,861 INFO L95 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2025-04-13 18:09:23,861 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-04-13 18:09:23,866 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 40 statements into 1 equivalence classes. [2025-04-13 18:09:23,870 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 40 of 40 statements. [2025-04-13 18:09:23,870 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-04-13 18:09:23,870 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-04-13 18:09:24,071 INFO L134 CoverageAnalysis]: Checked inductivity of 3 backedges. 0 proven. 3 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-04-13 18:09:24,071 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-04-13 18:09:24,072 INFO L324 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [616697003] [2025-04-13 18:09:24,072 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [616697003] provided 0 perfect and 1 imperfect interpolant sequences [2025-04-13 18:09:24,072 INFO L324 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [582575984] [2025-04-13 18:09:24,072 INFO L95 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2025-04-13 18:09:24,072 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-04-13 18:09:24,072 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2025-04-13 18:09:24,073 INFO L229 MonitoredProcess]: Starting monitored process 27 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2025-04-13 18:09:24,074 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (27)] Waiting until timeout for monitored process [2025-04-13 18:09:24,140 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 40 statements into 1 equivalence classes. [2025-04-13 18:09:24,156 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 40 of 40 statements. [2025-04-13 18:09:24,156 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-04-13 18:09:24,156 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-04-13 18:09:24,157 INFO L256 TraceCheckSpWp]: Trace formula consists of 266 conjuncts, 25 conjuncts are in the unsatisfiable core [2025-04-13 18:09:24,158 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-04-13 18:09:24,223 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 19 treesize of output 7 [2025-04-13 18:09:24,235 INFO L134 CoverageAnalysis]: Checked inductivity of 3 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 3 trivial. 0 not checked. [2025-04-13 18:09:24,235 INFO L308 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2025-04-13 18:09:24,235 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [582575984] provided 1 perfect and 0 imperfect interpolant sequences [2025-04-13 18:09:24,235 INFO L185 FreeRefinementEngine]: Found 1 perfect and 1 imperfect interpolant sequences. [2025-04-13 18:09:24,235 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [7] imperfect sequences [10] total 15 [2025-04-13 18:09:24,235 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1200923747] [2025-04-13 18:09:24,235 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-04-13 18:09:24,235 INFO L562 AbstractCegarLoop]: INTERPOLANT automaton has 8 states [2025-04-13 18:09:24,235 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-04-13 18:09:24,235 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2025-04-13 18:09:24,235 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=44, Invalid=196, Unknown=0, NotChecked=0, Total=240 [2025-04-13 18:09:24,235 INFO L87 Difference]: Start difference. First operand 4911 states and 18960 transitions. Second operand has 8 states, 7 states have (on average 5.571428571428571) internal successors, (39), 8 states have internal predecessors, (39), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-04-13 18:09:26,194 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-04-13 18:09:26,194 INFO L93 Difference]: Finished difference Result 7468 states and 28797 transitions. [2025-04-13 18:09:26,195 INFO L140 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 10 states. [2025-04-13 18:09:26,195 INFO L79 Accepts]: Start accepts. Automaton has has 8 states, 7 states have (on average 5.571428571428571) internal successors, (39), 8 states have internal predecessors, (39), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 40 [2025-04-13 18:09:26,195 INFO L85 Accepts]: Finished accepts. some prefix is accepted. [2025-04-13 18:09:26,217 INFO L225 Difference]: With dead ends: 7468 [2025-04-13 18:09:26,217 INFO L226 Difference]: Without dead ends: 7217 [2025-04-13 18:09:26,219 INFO L436 NwaCegarLoop]: 0 DeclaredPredicates, 53 GetRequests, 37 SyntacticMatches, 0 SemanticMatches, 16 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 56 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=54, Invalid=252, Unknown=0, NotChecked=0, Total=306 [2025-04-13 18:09:26,220 INFO L437 NwaCegarLoop]: 12 mSDtfsCounter, 122 mSDsluCounter, 58 mSDsCounter, 0 mSdLazyCounter, 1013 mSolverCounterSat, 1 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.3s Time, 0 mProtectedPredicate, 0 mProtectedAction, 122 SdHoareTripleChecker+Valid, 70 SdHoareTripleChecker+Invalid, 1014 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 1 IncrementalHoareTripleChecker+Valid, 1013 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.3s IncrementalHoareTripleChecker+Time [2025-04-13 18:09:26,220 INFO L438 NwaCegarLoop]: SdHoareTripleChecker [122 Valid, 70 Invalid, 1014 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [1 Valid, 1013 Invalid, 0 Unknown, 0 Unchecked, 0.3s Time] [2025-04-13 18:09:26,225 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 7217 states. [2025-04-13 18:09:26,965 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 7217 to 4863. [2025-04-13 18:09:26,970 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 4863 states, 4862 states have (on average 3.8609625668449197) internal successors, (18772), 4862 states have internal predecessors, (18772), 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 18:09:26,979 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4863 states to 4863 states and 18772 transitions. [2025-04-13 18:09:26,986 INFO L79 Accepts]: Start accepts. Automaton has 4863 states and 18772 transitions. Word has length 40 [2025-04-13 18:09:26,986 INFO L85 Accepts]: Finished accepts. word is rejected. [2025-04-13 18:09:26,987 INFO L485 AbstractCegarLoop]: Abstraction has 4863 states and 18772 transitions. [2025-04-13 18:09:26,987 INFO L486 AbstractCegarLoop]: INTERPOLANT automaton has has 8 states, 7 states have (on average 5.571428571428571) internal successors, (39), 8 states have internal predecessors, (39), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-04-13 18:09:26,987 INFO L278 IsEmpty]: Start isEmpty. Operand 4863 states and 18772 transitions. [2025-04-13 18:09:26,993 INFO L284 IsEmpty]: Finished isEmpty. Found accepting run of length 41 [2025-04-13 18:09:26,993 INFO L210 NwaCegarLoop]: Found error trace [2025-04-13 18:09:26,993 INFO L218 NwaCegarLoop]: trace histogram [2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-04-13 18:09:27,000 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (27)] Ended with exit code 0 [2025-04-13 18:09:27,194 WARN L466 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 27 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable45 [2025-04-13 18:09:27,194 INFO L403 AbstractCegarLoop]: === Iteration 47 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [thread1Err0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES, thread1Err3INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION (and 4 more)] === [2025-04-13 18:09:27,194 INFO L155 PredicateUnifier]: Initialized classic predicate unifier [2025-04-13 18:09:27,194 INFO L85 PathProgramCache]: Analyzing trace with hash 697311233, now seen corresponding path program 20 times [2025-04-13 18:09:27,194 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-04-13 18:09:27,194 INFO L324 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1478838841] [2025-04-13 18:09:27,194 INFO L95 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST1 [2025-04-13 18:09:27,194 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-04-13 18:09:27,199 INFO L108 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 partitioned 40 statements into 2 equivalence classes. [2025-04-13 18:09:27,205 INFO L111 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) and asserted 40 of 40 statements. [2025-04-13 18:09:27,205 INFO L114 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) [2025-04-13 18:09:27,205 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-04-13 18:09:27,435 INFO L134 CoverageAnalysis]: Checked inductivity of 4 backedges. 0 proven. 4 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-04-13 18:09:27,435 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-04-13 18:09:27,435 INFO L324 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1478838841] [2025-04-13 18:09:27,435 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1478838841] provided 0 perfect and 1 imperfect interpolant sequences [2025-04-13 18:09:27,435 INFO L324 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [438472939] [2025-04-13 18:09:27,435 INFO L95 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST1 [2025-04-13 18:09:27,435 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-04-13 18:09:27,435 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2025-04-13 18:09:27,437 INFO L229 MonitoredProcess]: Starting monitored process 28 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2025-04-13 18:09:27,438 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (28)] Waiting until timeout for monitored process [2025-04-13 18:09:27,503 INFO L108 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 partitioned 40 statements into 2 equivalence classes. [2025-04-13 18:09:27,520 INFO L111 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) and asserted 40 of 40 statements. [2025-04-13 18:09:27,520 INFO L114 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) [2025-04-13 18:09:27,520 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-04-13 18:09:27,521 INFO L256 TraceCheckSpWp]: Trace formula consists of 266 conjuncts, 41 conjuncts are in the unsatisfiable core [2025-04-13 18:09:27,522 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-04-13 18:09:27,528 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 18:09:27,627 INFO L325 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2025-04-13 18:09:27,627 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 17 treesize of output 15 [2025-04-13 18:09:27,658 INFO L134 CoverageAnalysis]: Checked inductivity of 4 backedges. 0 proven. 4 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-04-13 18:09:27,658 INFO L312 TraceCheckSpWp]: Computing backward predicates... [2025-04-13 18:09:27,812 INFO L134 CoverageAnalysis]: Checked inductivity of 4 backedges. 0 proven. 1 refuted. 0 times theorem prover too weak. 3 trivial. 0 not checked. [2025-04-13 18:09:27,812 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [438472939] provided 0 perfect and 2 imperfect interpolant sequences [2025-04-13 18:09:27,812 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2025-04-13 18:09:27,812 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [11, 11, 8] total 23 [2025-04-13 18:09:27,812 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1765814560] [2025-04-13 18:09:27,812 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2025-04-13 18:09:27,812 INFO L562 AbstractCegarLoop]: INTERPOLANT automaton has 24 states [2025-04-13 18:09:27,812 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-04-13 18:09:27,812 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 24 interpolants. [2025-04-13 18:09:27,813 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=86, Invalid=466, Unknown=0, NotChecked=0, Total=552 [2025-04-13 18:09:27,813 INFO L87 Difference]: Start difference. First operand 4863 states and 18772 transitions. Second operand has 24 states, 23 states have (on average 3.4782608695652173) internal successors, (80), 24 states have internal predecessors, (80), 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 18:09:30,919 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-04-13 18:09:30,919 INFO L93 Difference]: Finished difference Result 9123 states and 34696 transitions. [2025-04-13 18:09:30,920 INFO L140 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 19 states. [2025-04-13 18:09:30,920 INFO L79 Accepts]: Start accepts. Automaton has has 24 states, 23 states have (on average 3.4782608695652173) internal successors, (80), 24 states have internal predecessors, (80), 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 40 [2025-04-13 18:09:30,920 INFO L85 Accepts]: Finished accepts. some prefix is accepted. [2025-04-13 18:09:30,945 INFO L225 Difference]: With dead ends: 9123 [2025-04-13 18:09:30,946 INFO L226 Difference]: Without dead ends: 8884 [2025-04-13 18:09:30,948 INFO L436 NwaCegarLoop]: 0 DeclaredPredicates, 111 GetRequests, 77 SyntacticMatches, 0 SemanticMatches, 34 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 263 ImplicationChecksByTransitivity, 0.4s TimeCoverageRelationStatistics Valid=203, Invalid=1057, Unknown=0, NotChecked=0, Total=1260 [2025-04-13 18:09:30,948 INFO L437 NwaCegarLoop]: 17 mSDtfsCounter, 515 mSDsluCounter, 151 mSDsCounter, 0 mSdLazyCounter, 2136 mSolverCounterSat, 14 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.7s Time, 0 mProtectedPredicate, 0 mProtectedAction, 515 SdHoareTripleChecker+Valid, 168 SdHoareTripleChecker+Invalid, 2150 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 14 IncrementalHoareTripleChecker+Valid, 2136 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.8s IncrementalHoareTripleChecker+Time [2025-04-13 18:09:30,948 INFO L438 NwaCegarLoop]: SdHoareTripleChecker [515 Valid, 168 Invalid, 2150 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [14 Valid, 2136 Invalid, 0 Unknown, 0 Unchecked, 0.8s Time] [2025-04-13 18:09:30,954 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 8884 states. [2025-04-13 18:09:31,771 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 8884 to 5235. [2025-04-13 18:09:31,778 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 5235 states, 5234 states have (on average 3.8588077951853266) internal successors, (20197), 5234 states have internal predecessors, (20197), 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 18:09:31,789 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5235 states to 5235 states and 20197 transitions. [2025-04-13 18:09:31,797 INFO L79 Accepts]: Start accepts. Automaton has 5235 states and 20197 transitions. Word has length 40 [2025-04-13 18:09:31,797 INFO L85 Accepts]: Finished accepts. word is rejected. [2025-04-13 18:09:31,797 INFO L485 AbstractCegarLoop]: Abstraction has 5235 states and 20197 transitions. [2025-04-13 18:09:31,797 INFO L486 AbstractCegarLoop]: INTERPOLANT automaton has has 24 states, 23 states have (on average 3.4782608695652173) internal successors, (80), 24 states have internal predecessors, (80), 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 18:09:31,797 INFO L278 IsEmpty]: Start isEmpty. Operand 5235 states and 20197 transitions. [2025-04-13 18:09:31,804 INFO L284 IsEmpty]: Finished isEmpty. Found accepting run of length 41 [2025-04-13 18:09:31,804 INFO L210 NwaCegarLoop]: Found error trace [2025-04-13 18:09:31,804 INFO L218 NwaCegarLoop]: trace histogram [2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-04-13 18:09:31,810 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (28)] Forceful destruction successful, exit code 0 [2025-04-13 18:09:32,004 WARN L466 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 28 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable46 [2025-04-13 18:09:32,005 INFO L403 AbstractCegarLoop]: === Iteration 48 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [thread1Err0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES, thread1Err3INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION (and 4 more)] === [2025-04-13 18:09:32,005 INFO L155 PredicateUnifier]: Initialized classic predicate unifier [2025-04-13 18:09:32,005 INFO L85 PathProgramCache]: Analyzing trace with hash 1750675635, now seen corresponding path program 21 times [2025-04-13 18:09:32,005 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-04-13 18:09:32,005 INFO L324 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1988743731] [2025-04-13 18:09:32,005 INFO L95 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST2 [2025-04-13 18:09:32,005 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-04-13 18:09:32,010 INFO L108 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST2 partitioned 40 statements into 2 equivalence classes. [2025-04-13 18:09:32,014 INFO L111 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST2 issued 1 check-sat command(s) and asserted 38 of 40 statements. [2025-04-13 18:09:32,014 INFO L114 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST2 issued 1 check-sat command(s) [2025-04-13 18:09:32,014 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-04-13 18:09:32,114 INFO L134 CoverageAnalysis]: Checked inductivity of 3 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 3 trivial. 0 not checked. [2025-04-13 18:09:32,114 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-04-13 18:09:32,114 INFO L324 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1988743731] [2025-04-13 18:09:32,114 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1988743731] provided 1 perfect and 0 imperfect interpolant sequences [2025-04-13 18:09:32,114 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-04-13 18:09:32,114 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2025-04-13 18:09:32,114 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [443461535] [2025-04-13 18:09:32,115 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-04-13 18:09:32,115 INFO L562 AbstractCegarLoop]: INTERPOLANT automaton has 8 states [2025-04-13 18:09:32,115 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-04-13 18:09:32,115 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2025-04-13 18:09:32,115 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=14, Invalid=42, Unknown=0, NotChecked=0, Total=56 [2025-04-13 18:09:32,115 INFO L87 Difference]: Start difference. First operand 5235 states and 20197 transitions. Second operand has 8 states, 7 states have (on average 5.571428571428571) internal successors, (39), 8 states have internal predecessors, (39), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-04-13 18:09:34,640 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-04-13 18:09:34,640 INFO L93 Difference]: Finished difference Result 9044 states and 34588 transitions. [2025-04-13 18:09:34,640 INFO L140 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 12 states. [2025-04-13 18:09:34,640 INFO L79 Accepts]: Start accepts. Automaton has has 8 states, 7 states have (on average 5.571428571428571) internal successors, (39), 8 states have internal predecessors, (39), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 40 [2025-04-13 18:09:34,640 INFO L85 Accepts]: Finished accepts. some prefix is accepted. [2025-04-13 18:09:34,665 INFO L225 Difference]: With dead ends: 9044 [2025-04-13 18:09:34,666 INFO L226 Difference]: Without dead ends: 8793 [2025-04-13 18:09:34,668 INFO L436 NwaCegarLoop]: 0 DeclaredPredicates, 16 GetRequests, 6 SyntacticMatches, 0 SemanticMatches, 10 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 10 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=30, Invalid=102, Unknown=0, NotChecked=0, Total=132 [2025-04-13 18:09:34,668 INFO L437 NwaCegarLoop]: 14 mSDtfsCounter, 161 mSDsluCounter, 59 mSDsCounter, 0 mSdLazyCounter, 1032 mSolverCounterSat, 2 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.3s Time, 0 mProtectedPredicate, 0 mProtectedAction, 161 SdHoareTripleChecker+Valid, 73 SdHoareTripleChecker+Invalid, 1034 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 2 IncrementalHoareTripleChecker+Valid, 1032 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.4s IncrementalHoareTripleChecker+Time [2025-04-13 18:09:34,668 INFO L438 NwaCegarLoop]: SdHoareTripleChecker [161 Valid, 73 Invalid, 1034 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [2 Valid, 1032 Invalid, 0 Unknown, 0 Unchecked, 0.4s Time] [2025-04-13 18:09:34,674 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 8793 states. [2025-04-13 18:09:35,506 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 8793 to 5195. [2025-04-13 18:09:35,511 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 5195 states, 5194 states have (on average 3.844050827878321) internal successors, (19966), 5194 states have internal predecessors, (19966), 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 18:09:35,521 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5195 states to 5195 states and 19966 transitions. [2025-04-13 18:09:35,530 INFO L79 Accepts]: Start accepts. Automaton has 5195 states and 19966 transitions. Word has length 40 [2025-04-13 18:09:35,530 INFO L85 Accepts]: Finished accepts. word is rejected. [2025-04-13 18:09:35,530 INFO L485 AbstractCegarLoop]: Abstraction has 5195 states and 19966 transitions. [2025-04-13 18:09:35,530 INFO L486 AbstractCegarLoop]: INTERPOLANT automaton has has 8 states, 7 states have (on average 5.571428571428571) internal successors, (39), 8 states have internal predecessors, (39), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-04-13 18:09:35,530 INFO L278 IsEmpty]: Start isEmpty. Operand 5195 states and 19966 transitions. [2025-04-13 18:09:35,537 INFO L284 IsEmpty]: Finished isEmpty. Found accepting run of length 41 [2025-04-13 18:09:35,537 INFO L210 NwaCegarLoop]: Found error trace [2025-04-13 18:09:35,537 INFO L218 NwaCegarLoop]: trace histogram [2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-04-13 18:09:35,538 WARN L466 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable47 [2025-04-13 18:09:35,538 INFO L403 AbstractCegarLoop]: === Iteration 49 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [thread1Err0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES, thread1Err3INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION (and 4 more)] === [2025-04-13 18:09:35,538 INFO L155 PredicateUnifier]: Initialized classic predicate unifier [2025-04-13 18:09:35,538 INFO L85 PathProgramCache]: Analyzing trace with hash -201418308, now seen corresponding path program 19 times [2025-04-13 18:09:35,538 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-04-13 18:09:35,538 INFO L324 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [471609976] [2025-04-13 18:09:35,538 INFO L95 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2025-04-13 18:09:35,538 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-04-13 18:09:35,543 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 40 statements into 1 equivalence classes. [2025-04-13 18:09:35,548 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 40 of 40 statements. [2025-04-13 18:09:35,548 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-04-13 18:09:35,548 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-04-13 18:09:35,758 INFO L134 CoverageAnalysis]: Checked inductivity of 4 backedges. 0 proven. 4 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-04-13 18:09:35,758 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-04-13 18:09:35,758 INFO L324 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [471609976] [2025-04-13 18:09:35,758 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [471609976] provided 0 perfect and 1 imperfect interpolant sequences [2025-04-13 18:09:35,759 INFO L324 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [267849964] [2025-04-13 18:09:35,759 INFO L95 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2025-04-13 18:09:35,759 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-04-13 18:09:35,759 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2025-04-13 18:09:35,760 INFO L229 MonitoredProcess]: Starting monitored process 29 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2025-04-13 18:09:35,761 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (29)] Waiting until timeout for monitored process [2025-04-13 18:09:35,828 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 40 statements into 1 equivalence classes. [2025-04-13 18:09:35,845 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 40 of 40 statements. [2025-04-13 18:09:35,846 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-04-13 18:09:35,846 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-04-13 18:09:35,847 INFO L256 TraceCheckSpWp]: Trace formula consists of 266 conjuncts, 25 conjuncts are in the unsatisfiable core [2025-04-13 18:09:35,847 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-04-13 18:09:35,908 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 19 treesize of output 7 [2025-04-13 18:09:35,918 INFO L134 CoverageAnalysis]: Checked inductivity of 4 backedges. 0 proven. 1 refuted. 0 times theorem prover too weak. 3 trivial. 0 not checked. [2025-04-13 18:09:35,918 INFO L312 TraceCheckSpWp]: Computing backward predicates... [2025-04-13 18:09:35,969 INFO L325 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2025-04-13 18:09:35,969 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 20 treesize of output 14 [2025-04-13 18:09:35,987 INFO L134 CoverageAnalysis]: Checked inductivity of 4 backedges. 0 proven. 1 refuted. 0 times theorem prover too weak. 3 trivial. 0 not checked. [2025-04-13 18:09:35,987 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [267849964] provided 0 perfect and 2 imperfect interpolant sequences [2025-04-13 18:09:35,987 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2025-04-13 18:09:35,987 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [10, 7, 7] total 18 [2025-04-13 18:09:35,987 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [967044422] [2025-04-13 18:09:35,987 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2025-04-13 18:09:35,987 INFO L562 AbstractCegarLoop]: INTERPOLANT automaton has 19 states [2025-04-13 18:09:35,987 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-04-13 18:09:35,988 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 19 interpolants. [2025-04-13 18:09:35,988 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=53, Invalid=289, Unknown=0, NotChecked=0, Total=342 [2025-04-13 18:09:35,988 INFO L87 Difference]: Start difference. First operand 5195 states and 19966 transitions. Second operand has 19 states, 18 states have (on average 4.111111111111111) internal successors, (74), 19 states have internal predecessors, (74), 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 18:09:39,040 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-04-13 18:09:39,040 INFO L93 Difference]: Finished difference Result 9590 states and 36947 transitions. [2025-04-13 18:09:39,041 INFO L140 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 15 states. [2025-04-13 18:09:39,041 INFO L79 Accepts]: Start accepts. Automaton has has 19 states, 18 states have (on average 4.111111111111111) internal successors, (74), 19 states have internal predecessors, (74), 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 40 [2025-04-13 18:09:39,041 INFO L85 Accepts]: Finished accepts. some prefix is accepted. [2025-04-13 18:09:39,070 INFO L225 Difference]: With dead ends: 9590 [2025-04-13 18:09:39,070 INFO L226 Difference]: Without dead ends: 9369 [2025-04-13 18:09:39,073 INFO L436 NwaCegarLoop]: 0 DeclaredPredicates, 101 GetRequests, 76 SyntacticMatches, 0 SemanticMatches, 25 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 111 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=102, Invalid=600, Unknown=0, NotChecked=0, Total=702 [2025-04-13 18:09:39,073 INFO L437 NwaCegarLoop]: 14 mSDtfsCounter, 248 mSDsluCounter, 142 mSDsCounter, 0 mSdLazyCounter, 2302 mSolverCounterSat, 3 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.6s Time, 0 mProtectedPredicate, 0 mProtectedAction, 248 SdHoareTripleChecker+Valid, 156 SdHoareTripleChecker+Invalid, 2305 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 3 IncrementalHoareTripleChecker+Valid, 2302 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.7s IncrementalHoareTripleChecker+Time [2025-04-13 18:09:39,073 INFO L438 NwaCegarLoop]: SdHoareTripleChecker [248 Valid, 156 Invalid, 2305 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [3 Valid, 2302 Invalid, 0 Unknown, 0 Unchecked, 0.7s Time] [2025-04-13 18:09:39,080 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 9369 states. [2025-04-13 18:09:39,939 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 9369 to 5309. [2025-04-13 18:09:39,945 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 5309 states, 5308 states have (on average 3.8443858327053504) internal successors, (20406), 5308 states have internal predecessors, (20406), 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 18:09:39,955 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5309 states to 5309 states and 20406 transitions. [2025-04-13 18:09:39,963 INFO L79 Accepts]: Start accepts. Automaton has 5309 states and 20406 transitions. Word has length 40 [2025-04-13 18:09:39,963 INFO L85 Accepts]: Finished accepts. word is rejected. [2025-04-13 18:09:39,963 INFO L485 AbstractCegarLoop]: Abstraction has 5309 states and 20406 transitions. [2025-04-13 18:09:39,963 INFO L486 AbstractCegarLoop]: INTERPOLANT automaton has has 19 states, 18 states have (on average 4.111111111111111) internal successors, (74), 19 states have internal predecessors, (74), 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 18:09:39,963 INFO L278 IsEmpty]: Start isEmpty. Operand 5309 states and 20406 transitions. [2025-04-13 18:09:39,971 INFO L284 IsEmpty]: Finished isEmpty. Found accepting run of length 41 [2025-04-13 18:09:39,971 INFO L210 NwaCegarLoop]: Found error trace [2025-04-13 18:09:39,971 INFO L218 NwaCegarLoop]: trace histogram [2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-04-13 18:09:39,977 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (29)] Ended with exit code 0 [2025-04-13 18:09:40,171 WARN L466 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable48,29 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-04-13 18:09:40,172 INFO L403 AbstractCegarLoop]: === Iteration 50 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [thread1Err0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES, thread1Err3INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION (and 4 more)] === [2025-04-13 18:09:40,172 INFO L155 PredicateUnifier]: Initialized classic predicate unifier [2025-04-13 18:09:40,172 INFO L85 PathProgramCache]: Analyzing trace with hash -1141296682, now seen corresponding path program 20 times [2025-04-13 18:09:40,172 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-04-13 18:09:40,172 INFO L324 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1389848753] [2025-04-13 18:09:40,172 INFO L95 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST1 [2025-04-13 18:09:40,172 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-04-13 18:09:40,179 INFO L108 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 partitioned 40 statements into 2 equivalence classes. [2025-04-13 18:09:40,183 INFO L111 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) and asserted 40 of 40 statements. [2025-04-13 18:09:40,184 INFO L114 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) [2025-04-13 18:09:40,184 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-04-13 18:09:40,451 INFO L134 CoverageAnalysis]: Checked inductivity of 4 backedges. 0 proven. 4 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-04-13 18:09:40,451 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-04-13 18:09:40,451 INFO L324 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1389848753] [2025-04-13 18:09:40,451 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1389848753] provided 0 perfect and 1 imperfect interpolant sequences [2025-04-13 18:09:40,451 INFO L324 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [192123511] [2025-04-13 18:09:40,452 INFO L95 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST1 [2025-04-13 18:09:40,452 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-04-13 18:09:40,452 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2025-04-13 18:09:40,453 INFO L229 MonitoredProcess]: Starting monitored process 30 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2025-04-13 18:09:40,455 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (30)] Waiting until timeout for monitored process [2025-04-13 18:09:40,523 INFO L108 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 partitioned 40 statements into 2 equivalence classes. [2025-04-13 18:09:40,541 INFO L111 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) and asserted 40 of 40 statements. [2025-04-13 18:09:40,541 INFO L114 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) [2025-04-13 18:09:40,541 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-04-13 18:09:40,542 INFO L256 TraceCheckSpWp]: Trace formula consists of 266 conjuncts, 41 conjuncts are in the unsatisfiable core [2025-04-13 18:09:40,543 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-04-13 18:09:40,550 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 18:09:40,645 INFO L354 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 15 treesize of output 7 [2025-04-13 18:09:40,662 INFO L134 CoverageAnalysis]: Checked inductivity of 4 backedges. 0 proven. 4 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-04-13 18:09:40,662 INFO L312 TraceCheckSpWp]: Computing backward predicates... [2025-04-13 18:09:40,740 INFO L134 CoverageAnalysis]: Checked inductivity of 4 backedges. 0 proven. 1 refuted. 0 times theorem prover too weak. 3 trivial. 0 not checked. [2025-04-13 18:09:40,741 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [192123511] provided 0 perfect and 2 imperfect interpolant sequences [2025-04-13 18:09:40,741 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2025-04-13 18:09:40,741 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [11, 10, 7] total 21 [2025-04-13 18:09:40,741 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1346272862] [2025-04-13 18:09:40,741 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2025-04-13 18:09:40,741 INFO L562 AbstractCegarLoop]: INTERPOLANT automaton has 22 states [2025-04-13 18:09:40,741 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-04-13 18:09:40,741 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 22 interpolants. [2025-04-13 18:09:40,742 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=67, Invalid=395, Unknown=0, NotChecked=0, Total=462 [2025-04-13 18:09:40,742 INFO L87 Difference]: Start difference. First operand 5309 states and 20406 transitions. Second operand has 22 states, 21 states have (on average 3.761904761904762) internal successors, (79), 22 states have internal predecessors, (79), 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 18:09:43,511 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-04-13 18:09:43,511 INFO L93 Difference]: Finished difference Result 7744 states and 29876 transitions. [2025-04-13 18:09:43,511 INFO L140 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 20 states. [2025-04-13 18:09:43,511 INFO L79 Accepts]: Start accepts. Automaton has has 22 states, 21 states have (on average 3.761904761904762) internal successors, (79), 22 states have internal predecessors, (79), 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 40 [2025-04-13 18:09:43,511 INFO L85 Accepts]: Finished accepts. some prefix is accepted. [2025-04-13 18:09:43,536 INFO L225 Difference]: With dead ends: 7744 [2025-04-13 18:09:43,536 INFO L226 Difference]: Without dead ends: 7523 [2025-04-13 18:09:43,538 INFO L436 NwaCegarLoop]: 0 DeclaredPredicates, 112 GetRequests, 79 SyntacticMatches, 0 SemanticMatches, 33 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 231 ImplicationChecksByTransitivity, 0.3s TimeCoverageRelationStatistics Valid=175, Invalid=1015, Unknown=0, NotChecked=0, Total=1190 [2025-04-13 18:09:43,539 INFO L437 NwaCegarLoop]: 12 mSDtfsCounter, 326 mSDsluCounter, 131 mSDsCounter, 0 mSdLazyCounter, 2069 mSolverCounterSat, 11 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.6s Time, 0 mProtectedPredicate, 0 mProtectedAction, 326 SdHoareTripleChecker+Valid, 143 SdHoareTripleChecker+Invalid, 2080 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 11 IncrementalHoareTripleChecker+Valid, 2069 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.7s IncrementalHoareTripleChecker+Time [2025-04-13 18:09:43,539 INFO L438 NwaCegarLoop]: SdHoareTripleChecker [326 Valid, 143 Invalid, 2080 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [11 Valid, 2069 Invalid, 0 Unknown, 0 Unchecked, 0.7s Time] [2025-04-13 18:09:43,544 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 7523 states. [2025-04-13 18:09:44,401 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 7523 to 5353. [2025-04-13 18:09:44,407 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 5353 states, 5352 states have (on average 3.8460388639760836) internal successors, (20584), 5352 states have internal predecessors, (20584), 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 18:09:44,417 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5353 states to 5353 states and 20584 transitions. [2025-04-13 18:09:44,425 INFO L79 Accepts]: Start accepts. Automaton has 5353 states and 20584 transitions. Word has length 40 [2025-04-13 18:09:44,425 INFO L85 Accepts]: Finished accepts. word is rejected. [2025-04-13 18:09:44,425 INFO L485 AbstractCegarLoop]: Abstraction has 5353 states and 20584 transitions. [2025-04-13 18:09:44,425 INFO L486 AbstractCegarLoop]: INTERPOLANT automaton has has 22 states, 21 states have (on average 3.761904761904762) internal successors, (79), 22 states have internal predecessors, (79), 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 18:09:44,425 INFO L278 IsEmpty]: Start isEmpty. Operand 5353 states and 20584 transitions. [2025-04-13 18:09:44,432 INFO L284 IsEmpty]: Finished isEmpty. Found accepting run of length 41 [2025-04-13 18:09:44,432 INFO L210 NwaCegarLoop]: Found error trace [2025-04-13 18:09:44,432 INFO L218 NwaCegarLoop]: trace histogram [2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-04-13 18:09:44,439 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (30)] Forceful destruction successful, exit code 0 [2025-04-13 18:09:44,633 WARN L466 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 30 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable49 [2025-04-13 18:09:44,633 INFO L403 AbstractCegarLoop]: === Iteration 51 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [thread1Err0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES, thread1Err3INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION (and 4 more)] === [2025-04-13 18:09:44,633 INFO L155 PredicateUnifier]: Initialized classic predicate unifier [2025-04-13 18:09:44,633 INFO L85 PathProgramCache]: Analyzing trace with hash -486173734, now seen corresponding path program 21 times [2025-04-13 18:09:44,633 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-04-13 18:09:44,633 INFO L324 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1622707275] [2025-04-13 18:09:44,633 INFO L95 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST2 [2025-04-13 18:09:44,633 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-04-13 18:09:44,638 INFO L108 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST2 partitioned 40 statements into 2 equivalence classes. [2025-04-13 18:09:44,641 INFO L111 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST2 issued 1 check-sat command(s) and asserted 38 of 40 statements. [2025-04-13 18:09:44,641 INFO L114 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST2 issued 1 check-sat command(s) [2025-04-13 18:09:44,641 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-04-13 18:09:44,747 INFO L134 CoverageAnalysis]: Checked inductivity of 3 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 3 trivial. 0 not checked. [2025-04-13 18:09:44,747 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-04-13 18:09:44,747 INFO L324 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1622707275] [2025-04-13 18:09:44,747 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1622707275] provided 1 perfect and 0 imperfect interpolant sequences [2025-04-13 18:09:44,747 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-04-13 18:09:44,747 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [8] imperfect sequences [] total 8 [2025-04-13 18:09:44,747 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1162760073] [2025-04-13 18:09:44,747 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-04-13 18:09:44,747 INFO L562 AbstractCegarLoop]: INTERPOLANT automaton has 9 states [2025-04-13 18:09:44,747 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-04-13 18:09:44,748 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2025-04-13 18:09:44,748 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=19, Invalid=53, Unknown=0, NotChecked=0, Total=72 [2025-04-13 18:09:44,748 INFO L87 Difference]: Start difference. First operand 5353 states and 20584 transitions. Second operand has 9 states, 8 states have (on average 4.875) internal successors, (39), 9 states have internal predecessors, (39), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-04-13 18:09:46,818 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-04-13 18:09:46,818 INFO L93 Difference]: Finished difference Result 7298 states and 28132 transitions. [2025-04-13 18:09:46,818 INFO L140 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 11 states. [2025-04-13 18:09:46,818 INFO L79 Accepts]: Start accepts. Automaton has has 9 states, 8 states have (on average 4.875) internal successors, (39), 9 states have internal predecessors, (39), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 40 [2025-04-13 18:09:46,818 INFO L85 Accepts]: Finished accepts. some prefix is accepted. [2025-04-13 18:09:46,841 INFO L225 Difference]: With dead ends: 7298 [2025-04-13 18:09:46,841 INFO L226 Difference]: Without dead ends: 7077 [2025-04-13 18:09:46,843 INFO L436 NwaCegarLoop]: 0 DeclaredPredicates, 14 GetRequests, 4 SyntacticMatches, 0 SemanticMatches, 10 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 8 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=34, Invalid=98, Unknown=0, NotChecked=0, Total=132 [2025-04-13 18:09:46,843 INFO L437 NwaCegarLoop]: 12 mSDtfsCounter, 121 mSDsluCounter, 54 mSDsCounter, 0 mSdLazyCounter, 862 mSolverCounterSat, 1 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.3s Time, 0 mProtectedPredicate, 0 mProtectedAction, 121 SdHoareTripleChecker+Valid, 66 SdHoareTripleChecker+Invalid, 863 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 1 IncrementalHoareTripleChecker+Valid, 862 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.3s IncrementalHoareTripleChecker+Time [2025-04-13 18:09:46,843 INFO L438 NwaCegarLoop]: SdHoareTripleChecker [121 Valid, 66 Invalid, 863 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [1 Valid, 862 Invalid, 0 Unknown, 0 Unchecked, 0.3s Time] [2025-04-13 18:09:46,848 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 7077 states. [2025-04-13 18:09:47,767 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 7077 to 5375. [2025-04-13 18:09:47,774 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 5375 states, 5374 states have (on average 3.8468552288797917) internal successors, (20673), 5374 states have internal predecessors, (20673), 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 18:09:47,787 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5375 states to 5375 states and 20673 transitions. [2025-04-13 18:09:47,796 INFO L79 Accepts]: Start accepts. Automaton has 5375 states and 20673 transitions. Word has length 40 [2025-04-13 18:09:47,796 INFO L85 Accepts]: Finished accepts. word is rejected. [2025-04-13 18:09:47,796 INFO L485 AbstractCegarLoop]: Abstraction has 5375 states and 20673 transitions. [2025-04-13 18:09:47,796 INFO L486 AbstractCegarLoop]: INTERPOLANT automaton has has 9 states, 8 states have (on average 4.875) internal successors, (39), 9 states have internal predecessors, (39), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-04-13 18:09:47,796 INFO L278 IsEmpty]: Start isEmpty. Operand 5375 states and 20673 transitions. [2025-04-13 18:09:47,804 INFO L284 IsEmpty]: Finished isEmpty. Found accepting run of length 41 [2025-04-13 18:09:47,804 INFO L210 NwaCegarLoop]: Found error trace [2025-04-13 18:09:47,804 INFO L218 NwaCegarLoop]: trace histogram [2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-04-13 18:09:47,804 WARN L466 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable50 [2025-04-13 18:09:47,804 INFO L403 AbstractCegarLoop]: === Iteration 52 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [thread1Err0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES, thread1Err3INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION (and 4 more)] === [2025-04-13 18:09:47,805 INFO L155 PredicateUnifier]: Initialized classic predicate unifier [2025-04-13 18:09:47,805 INFO L85 PathProgramCache]: Analyzing trace with hash 1342026872, now seen corresponding path program 22 times [2025-04-13 18:09:47,805 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-04-13 18:09:47,805 INFO L324 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [799755049] [2025-04-13 18:09:47,805 INFO L95 rtionOrderModulation]: Changing assertion order to TERMS_WITH_SMALL_CONSTANTS_FIRST [2025-04-13 18:09:47,805 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-04-13 18:09:47,810 INFO L108 AnnotateAndAsserter]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST partitioned 40 statements into 2 equivalence classes. [2025-04-13 18:09:47,815 INFO L111 AnnotateAndAsserter]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST issued 2 check-sat command(s) and asserted 40 of 40 statements. [2025-04-13 18:09:47,816 INFO L114 AnnotateAndAsserter]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST issued 2 check-sat command(s) [2025-04-13 18:09:47,816 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-04-13 18:09:47,951 INFO L134 CoverageAnalysis]: Checked inductivity of 4 backedges. 0 proven. 1 refuted. 0 times theorem prover too weak. 3 trivial. 0 not checked. [2025-04-13 18:09:47,951 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-04-13 18:09:47,951 INFO L324 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [799755049] [2025-04-13 18:09:47,951 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [799755049] provided 0 perfect and 1 imperfect interpolant sequences [2025-04-13 18:09:47,951 INFO L324 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [332690345] [2025-04-13 18:09:47,951 INFO L95 rtionOrderModulation]: Changing assertion order to TERMS_WITH_SMALL_CONSTANTS_FIRST [2025-04-13 18:09:47,951 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-04-13 18:09:47,951 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2025-04-13 18:09:47,954 INFO L229 MonitoredProcess]: Starting monitored process 31 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2025-04-13 18:09:47,955 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (31)] Waiting until timeout for monitored process [2025-04-13 18:09:48,032 INFO L108 AnnotateAndAsserter]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST partitioned 40 statements into 2 equivalence classes. [2025-04-13 18:09:48,053 INFO L111 AnnotateAndAsserter]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST issued 2 check-sat command(s) and asserted 40 of 40 statements. [2025-04-13 18:09:48,053 INFO L114 AnnotateAndAsserter]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST issued 2 check-sat command(s) [2025-04-13 18:09:48,053 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-04-13 18:09:48,055 INFO L256 TraceCheckSpWp]: Trace formula consists of 266 conjuncts, 25 conjuncts are in the unsatisfiable core [2025-04-13 18:09:48,056 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-04-13 18:09:48,113 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 19 treesize of output 7 [2025-04-13 18:09:48,140 INFO L134 CoverageAnalysis]: Checked inductivity of 4 backedges. 0 proven. 1 refuted. 0 times theorem prover too weak. 3 trivial. 0 not checked. [2025-04-13 18:09:48,140 INFO L312 TraceCheckSpWp]: Computing backward predicates... [2025-04-13 18:09:48,194 INFO L325 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2025-04-13 18:09:48,194 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 20 treesize of output 14 [2025-04-13 18:09:48,213 INFO L134 CoverageAnalysis]: Checked inductivity of 4 backedges. 0 proven. 1 refuted. 0 times theorem prover too weak. 3 trivial. 0 not checked. [2025-04-13 18:09:48,213 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [332690345] provided 0 perfect and 2 imperfect interpolant sequences [2025-04-13 18:09:48,213 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2025-04-13 18:09:48,213 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [7, 7, 7] total 14 [2025-04-13 18:09:48,213 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1693670924] [2025-04-13 18:09:48,213 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2025-04-13 18:09:48,214 INFO L562 AbstractCegarLoop]: INTERPOLANT automaton has 15 states [2025-04-13 18:09:48,214 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-04-13 18:09:48,214 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 15 interpolants. [2025-04-13 18:09:48,214 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=42, Invalid=168, Unknown=0, NotChecked=0, Total=210 [2025-04-13 18:09:48,214 INFO L87 Difference]: Start difference. First operand 5375 states and 20673 transitions. Second operand has 15 states, 14 states have (on average 3.5714285714285716) internal successors, (50), 15 states have internal predecessors, (50), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-04-13 18:09:50,446 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-04-13 18:09:50,446 INFO L93 Difference]: Finished difference Result 7375 states and 28463 transitions. [2025-04-13 18:09:50,446 INFO L140 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 15 states. [2025-04-13 18:09:50,446 INFO L79 Accepts]: Start accepts. Automaton has has 15 states, 14 states have (on average 3.5714285714285716) internal successors, (50), 15 states have internal predecessors, (50), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 40 [2025-04-13 18:09:50,446 INFO L85 Accepts]: Finished accepts. some prefix is accepted. [2025-04-13 18:09:50,470 INFO L225 Difference]: With dead ends: 7375 [2025-04-13 18:09:50,470 INFO L226 Difference]: Without dead ends: 7124 [2025-04-13 18:09:50,472 INFO L436 NwaCegarLoop]: 0 DeclaredPredicates, 102 GetRequests, 81 SyntacticMatches, 0 SemanticMatches, 21 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 72 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=105, Invalid=401, Unknown=0, NotChecked=0, Total=506 [2025-04-13 18:09:50,473 INFO L437 NwaCegarLoop]: 12 mSDtfsCounter, 180 mSDsluCounter, 73 mSDsCounter, 0 mSdLazyCounter, 1156 mSolverCounterSat, 1 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.4s Time, 0 mProtectedPredicate, 0 mProtectedAction, 180 SdHoareTripleChecker+Valid, 85 SdHoareTripleChecker+Invalid, 1157 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 1 IncrementalHoareTripleChecker+Valid, 1156 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.4s IncrementalHoareTripleChecker+Time [2025-04-13 18:09:50,473 INFO L438 NwaCegarLoop]: SdHoareTripleChecker [180 Valid, 85 Invalid, 1157 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [1 Valid, 1156 Invalid, 0 Unknown, 0 Unchecked, 0.4s Time] [2025-04-13 18:09:50,478 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 7124 states. [2025-04-13 18:09:51,332 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 7124 to 5309. [2025-04-13 18:09:51,339 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 5309 states, 5308 states have (on average 3.8443858327053504) internal successors, (20406), 5308 states have internal predecessors, (20406), 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 18:09:51,350 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5309 states to 5309 states and 20406 transitions. [2025-04-13 18:09:51,358 INFO L79 Accepts]: Start accepts. Automaton has 5309 states and 20406 transitions. Word has length 40 [2025-04-13 18:09:51,358 INFO L85 Accepts]: Finished accepts. word is rejected. [2025-04-13 18:09:51,358 INFO L485 AbstractCegarLoop]: Abstraction has 5309 states and 20406 transitions. [2025-04-13 18:09:51,359 INFO L486 AbstractCegarLoop]: INTERPOLANT automaton has has 15 states, 14 states have (on average 3.5714285714285716) internal successors, (50), 15 states have internal predecessors, (50), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-04-13 18:09:51,359 INFO L278 IsEmpty]: Start isEmpty. Operand 5309 states and 20406 transitions. [2025-04-13 18:09:51,366 INFO L284 IsEmpty]: Finished isEmpty. Found accepting run of length 44 [2025-04-13 18:09:51,366 INFO L210 NwaCegarLoop]: Found error trace [2025-04-13 18:09:51,366 INFO L218 NwaCegarLoop]: trace histogram [2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-04-13 18:09:51,373 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (31)] Forceful destruction successful, exit code 0 [2025-04-13 18:09:51,566 WARN L466 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 31 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable51 [2025-04-13 18:09:51,567 INFO L403 AbstractCegarLoop]: === Iteration 53 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [thread1Err0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES, thread1Err3INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION (and 4 more)] === [2025-04-13 18:09:51,567 INFO L155 PredicateUnifier]: Initialized classic predicate unifier [2025-04-13 18:09:51,567 INFO L85 PathProgramCache]: Analyzing trace with hash -103391554, now seen corresponding path program 22 times [2025-04-13 18:09:51,567 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-04-13 18:09:51,567 INFO L324 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [778061249] [2025-04-13 18:09:51,567 INFO L95 rtionOrderModulation]: Changing assertion order to TERMS_WITH_SMALL_CONSTANTS_FIRST [2025-04-13 18:09:51,567 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-04-13 18:09:51,573 INFO L108 AnnotateAndAsserter]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST partitioned 43 statements into 2 equivalence classes. [2025-04-13 18:09:51,574 INFO L111 AnnotateAndAsserter]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST issued 1 check-sat command(s) and asserted 31 of 43 statements. [2025-04-13 18:09:51,574 INFO L114 AnnotateAndAsserter]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST issued 1 check-sat command(s) [2025-04-13 18:09:51,574 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-04-13 18:09:51,604 INFO L134 CoverageAnalysis]: Checked inductivity of 9 backedges. 2 proven. 4 refuted. 0 times theorem prover too weak. 3 trivial. 0 not checked. [2025-04-13 18:09:51,605 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-04-13 18:09:51,605 INFO L324 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [778061249] [2025-04-13 18:09:51,605 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [778061249] provided 0 perfect and 1 imperfect interpolant sequences [2025-04-13 18:09:51,605 INFO L324 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1427834937] [2025-04-13 18:09:51,605 INFO L95 rtionOrderModulation]: Changing assertion order to TERMS_WITH_SMALL_CONSTANTS_FIRST [2025-04-13 18:09:51,605 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-04-13 18:09:51,605 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2025-04-13 18:09:51,606 INFO L229 MonitoredProcess]: Starting monitored process 32 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2025-04-13 18:09:51,607 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (32)] Waiting until timeout for monitored process [2025-04-13 18:09:51,676 INFO L108 AnnotateAndAsserter]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST partitioned 43 statements into 2 equivalence classes. [2025-04-13 18:09:51,686 INFO L111 AnnotateAndAsserter]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST issued 1 check-sat command(s) and asserted 31 of 43 statements. [2025-04-13 18:09:51,687 INFO L114 AnnotateAndAsserter]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST issued 1 check-sat command(s) [2025-04-13 18:09:51,687 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-04-13 18:09:51,687 INFO L256 TraceCheckSpWp]: Trace formula consists of 168 conjuncts, 6 conjuncts are in the unsatisfiable core [2025-04-13 18:09:51,688 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-04-13 18:09:51,724 INFO L134 CoverageAnalysis]: Checked inductivity of 9 backedges. 2 proven. 4 refuted. 0 times theorem prover too weak. 3 trivial. 0 not checked. [2025-04-13 18:09:51,724 INFO L312 TraceCheckSpWp]: Computing backward predicates... [2025-04-13 18:09:51,754 INFO L134 CoverageAnalysis]: Checked inductivity of 9 backedges. 2 proven. 4 refuted. 0 times theorem prover too weak. 3 trivial. 0 not checked. [2025-04-13 18:09:51,755 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1427834937] provided 0 perfect and 2 imperfect interpolant sequences [2025-04-13 18:09:51,755 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2025-04-13 18:09:51,755 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [7, 7, 7] total 9 [2025-04-13 18:09:51,755 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2038528312] [2025-04-13 18:09:51,755 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2025-04-13 18:09:51,755 INFO L562 AbstractCegarLoop]: INTERPOLANT automaton has 9 states [2025-04-13 18:09:51,755 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-04-13 18:09:51,755 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2025-04-13 18:09:51,755 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=23, Invalid=49, Unknown=0, NotChecked=0, Total=72 [2025-04-13 18:09:51,755 INFO L87 Difference]: Start difference. First operand 5309 states and 20406 transitions. Second operand has 9 states, 9 states have (on average 6.0) internal successors, (54), 9 states have internal predecessors, (54), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-04-13 18:09:54,272 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-04-13 18:09:54,272 INFO L93 Difference]: Finished difference Result 9642 states and 37000 transitions. [2025-04-13 18:09:54,273 INFO L140 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2025-04-13 18:09:54,273 INFO L79 Accepts]: Start accepts. Automaton has has 9 states, 9 states have (on average 6.0) internal successors, (54), 9 states have internal predecessors, (54), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 43 [2025-04-13 18:09:54,273 INFO L85 Accepts]: Finished accepts. some prefix is accepted. [2025-04-13 18:09:54,303 INFO L225 Difference]: With dead ends: 9642 [2025-04-13 18:09:54,303 INFO L226 Difference]: Without dead ends: 8903 [2025-04-13 18:09:54,308 INFO L436 NwaCegarLoop]: 0 DeclaredPredicates, 94 GetRequests, 79 SyntacticMatches, 5 SemanticMatches, 10 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 27 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=47, Invalid=85, Unknown=0, NotChecked=0, Total=132 [2025-04-13 18:09:54,308 INFO L437 NwaCegarLoop]: 9 mSDtfsCounter, 172 mSDsluCounter, 23 mSDsCounter, 0 mSdLazyCounter, 434 mSolverCounterSat, 3 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 172 SdHoareTripleChecker+Valid, 32 SdHoareTripleChecker+Invalid, 437 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 3 IncrementalHoareTripleChecker+Valid, 434 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.2s IncrementalHoareTripleChecker+Time [2025-04-13 18:09:54,308 INFO L438 NwaCegarLoop]: SdHoareTripleChecker [172 Valid, 32 Invalid, 437 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [3 Valid, 434 Invalid, 0 Unknown, 0 Unchecked, 0.2s Time] [2025-04-13 18:09:54,318 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 8903 states. [2025-04-13 18:09:55,385 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 8903 to 5605. [2025-04-13 18:09:55,391 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 5605 states, 5604 states have (on average 3.8675945753033547) internal successors, (21674), 5604 states have internal predecessors, (21674), 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 18:09:55,403 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5605 states to 5605 states and 21674 transitions. [2025-04-13 18:09:55,411 INFO L79 Accepts]: Start accepts. Automaton has 5605 states and 21674 transitions. Word has length 43 [2025-04-13 18:09:55,412 INFO L85 Accepts]: Finished accepts. word is rejected. [2025-04-13 18:09:55,412 INFO L485 AbstractCegarLoop]: Abstraction has 5605 states and 21674 transitions. [2025-04-13 18:09:55,412 INFO L486 AbstractCegarLoop]: INTERPOLANT automaton has has 9 states, 9 states have (on average 6.0) internal successors, (54), 9 states have internal predecessors, (54), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-04-13 18:09:55,412 INFO L278 IsEmpty]: Start isEmpty. Operand 5605 states and 21674 transitions. [2025-04-13 18:09:55,419 INFO L284 IsEmpty]: Finished isEmpty. Found accepting run of length 44 [2025-04-13 18:09:55,419 INFO L210 NwaCegarLoop]: Found error trace [2025-04-13 18:09:55,419 INFO L218 NwaCegarLoop]: trace histogram [2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-04-13 18:09:55,426 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (32)] Ended with exit code 0 [2025-04-13 18:09:55,620 WARN L466 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable52,32 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-04-13 18:09:55,620 INFO L403 AbstractCegarLoop]: === Iteration 54 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [thread1Err0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES, thread1Err3INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION (and 4 more)] === [2025-04-13 18:09:55,620 INFO L155 PredicateUnifier]: Initialized classic predicate unifier [2025-04-13 18:09:55,620 INFO L85 PathProgramCache]: Analyzing trace with hash -356190308, now seen corresponding path program 23 times [2025-04-13 18:09:55,621 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-04-13 18:09:55,621 INFO L324 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [585434063] [2025-04-13 18:09:55,621 INFO L95 rtionOrderModulation]: Changing assertion order to INSIDE_LOOP_FIRST1 [2025-04-13 18:09:55,622 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-04-13 18:09:55,627 INFO L108 AnnotateAndAsserter]: Assert order INSIDE_LOOP_FIRST1 partitioned 43 statements into 2 equivalence classes. [2025-04-13 18:09:55,635 INFO L111 AnnotateAndAsserter]: Assert order INSIDE_LOOP_FIRST1 issued 2 check-sat command(s) and asserted 43 of 43 statements. [2025-04-13 18:09:55,635 INFO L114 AnnotateAndAsserter]: Assert order INSIDE_LOOP_FIRST1 issued 2 check-sat command(s) [2025-04-13 18:09:55,635 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-04-13 18:09:55,687 INFO L134 CoverageAnalysis]: Checked inductivity of 5 backedges. 2 proven. 3 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-04-13 18:09:55,687 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-04-13 18:09:55,687 INFO L324 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [585434063] [2025-04-13 18:09:55,687 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [585434063] provided 0 perfect and 1 imperfect interpolant sequences [2025-04-13 18:09:55,687 INFO L324 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1486914189] [2025-04-13 18:09:55,687 INFO L95 rtionOrderModulation]: Changing assertion order to INSIDE_LOOP_FIRST1 [2025-04-13 18:09:55,688 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-04-13 18:09:55,688 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2025-04-13 18:09:55,689 INFO L229 MonitoredProcess]: Starting monitored process 33 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2025-04-13 18:09:55,690 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (33)] Waiting until timeout for monitored process [2025-04-13 18:09:55,761 INFO L108 AnnotateAndAsserter]: Assert order INSIDE_LOOP_FIRST1 partitioned 43 statements into 2 equivalence classes. [2025-04-13 18:09:55,779 INFO L111 AnnotateAndAsserter]: Assert order INSIDE_LOOP_FIRST1 issued 2 check-sat command(s) and asserted 43 of 43 statements. [2025-04-13 18:09:55,779 INFO L114 AnnotateAndAsserter]: Assert order INSIDE_LOOP_FIRST1 issued 2 check-sat command(s) [2025-04-13 18:09:55,779 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-04-13 18:09:55,780 INFO L256 TraceCheckSpWp]: Trace formula consists of 281 conjuncts, 9 conjuncts are in the unsatisfiable core [2025-04-13 18:09:55,780 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-04-13 18:09:55,838 INFO L134 CoverageAnalysis]: Checked inductivity of 5 backedges. 2 proven. 3 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-04-13 18:09:55,838 INFO L312 TraceCheckSpWp]: Computing backward predicates... [2025-04-13 18:09:55,888 INFO L134 CoverageAnalysis]: Checked inductivity of 5 backedges. 2 proven. 3 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-04-13 18:09:55,888 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1486914189] provided 0 perfect and 2 imperfect interpolant sequences [2025-04-13 18:09:55,888 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2025-04-13 18:09:55,888 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [7, 7, 7] total 15 [2025-04-13 18:09:55,888 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1582740380] [2025-04-13 18:09:55,888 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2025-04-13 18:09:55,888 INFO L562 AbstractCegarLoop]: INTERPOLANT automaton has 16 states [2025-04-13 18:09:55,888 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-04-13 18:09:55,889 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 16 interpolants. [2025-04-13 18:09:55,889 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=72, Invalid=168, Unknown=0, NotChecked=0, Total=240 [2025-04-13 18:09:55,889 INFO L87 Difference]: Start difference. First operand 5605 states and 21674 transitions. Second operand has 16 states, 16 states have (on average 3.75) internal successors, (60), 15 states have internal predecessors, (60), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-04-13 18:09:58,986 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-04-13 18:09:58,986 INFO L93 Difference]: Finished difference Result 13525 states and 52092 transitions. [2025-04-13 18:09:58,986 INFO L140 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2025-04-13 18:09:58,987 INFO L79 Accepts]: Start accepts. Automaton has has 16 states, 16 states have (on average 3.75) internal successors, (60), 15 states have internal predecessors, (60), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 43 [2025-04-13 18:09:58,987 INFO L85 Accepts]: Finished accepts. some prefix is accepted. [2025-04-13 18:09:59,019 INFO L225 Difference]: With dead ends: 13525 [2025-04-13 18:09:59,019 INFO L226 Difference]: Without dead ends: 9562 [2025-04-13 18:09:59,025 INFO L436 NwaCegarLoop]: 0 DeclaredPredicates, 91 GetRequests, 75 SyntacticMatches, 2 SemanticMatches, 14 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 87 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=72, Invalid=168, Unknown=0, NotChecked=0, Total=240 [2025-04-13 18:09:59,025 INFO L437 NwaCegarLoop]: 7 mSDtfsCounter, 124 mSDsluCounter, 56 mSDsCounter, 0 mSdLazyCounter, 822 mSolverCounterSat, 1 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.3s Time, 0 mProtectedPredicate, 0 mProtectedAction, 124 SdHoareTripleChecker+Valid, 63 SdHoareTripleChecker+Invalid, 823 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 1 IncrementalHoareTripleChecker+Valid, 822 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.3s IncrementalHoareTripleChecker+Time [2025-04-13 18:09:59,025 INFO L438 NwaCegarLoop]: SdHoareTripleChecker [124 Valid, 63 Invalid, 823 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [1 Valid, 822 Invalid, 0 Unknown, 0 Unchecked, 0.3s Time] [2025-04-13 18:09:59,032 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 9562 states. [2025-04-13 18:10:00,509 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 9562 to 8133. [2025-04-13 18:10:00,520 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 8133 states, 8132 states have (on average 3.838047220855878) internal successors, (31211), 8132 states have internal predecessors, (31211), 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 18:10:00,537 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 8133 states to 8133 states and 31211 transitions. [2025-04-13 18:10:00,547 INFO L79 Accepts]: Start accepts. Automaton has 8133 states and 31211 transitions. Word has length 43 [2025-04-13 18:10:00,547 INFO L85 Accepts]: Finished accepts. word is rejected. [2025-04-13 18:10:00,547 INFO L485 AbstractCegarLoop]: Abstraction has 8133 states and 31211 transitions. [2025-04-13 18:10:00,547 INFO L486 AbstractCegarLoop]: INTERPOLANT automaton has has 16 states, 16 states have (on average 3.75) internal successors, (60), 15 states have internal predecessors, (60), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-04-13 18:10:00,547 INFO L278 IsEmpty]: Start isEmpty. Operand 8133 states and 31211 transitions. [2025-04-13 18:10:00,559 INFO L284 IsEmpty]: Finished isEmpty. Found accepting run of length 44 [2025-04-13 18:10:00,559 INFO L210 NwaCegarLoop]: Found error trace [2025-04-13 18:10:00,559 INFO L218 NwaCegarLoop]: trace histogram [2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-04-13 18:10:00,565 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (33)] Forceful destruction successful, exit code 0 [2025-04-13 18:10:00,759 WARN L466 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable53,33 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-04-13 18:10:00,760 INFO L403 AbstractCegarLoop]: === Iteration 55 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [thread1Err0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES, thread1Err3INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION (and 4 more)] === [2025-04-13 18:10:00,760 INFO L155 PredicateUnifier]: Initialized classic predicate unifier [2025-04-13 18:10:00,760 INFO L85 PathProgramCache]: Analyzing trace with hash 1298205463, now seen corresponding path program 24 times [2025-04-13 18:10:00,760 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-04-13 18:10:00,760 INFO L324 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1770947563] [2025-04-13 18:10:00,760 INFO L95 rtionOrderModulation]: Changing assertion order to MIX_INSIDE_OUTSIDE [2025-04-13 18:10:00,760 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-04-13 18:10:00,765 INFO L108 AnnotateAndAsserter]: Assert order MIX_INSIDE_OUTSIDE partitioned 43 statements into 3 equivalence classes. [2025-04-13 18:10:00,769 INFO L111 AnnotateAndAsserter]: Assert order MIX_INSIDE_OUTSIDE issued 3 check-sat command(s) and asserted 43 of 43 statements. [2025-04-13 18:10:00,769 INFO L114 AnnotateAndAsserter]: Assert order MIX_INSIDE_OUTSIDE issued 3 check-sat command(s) [2025-04-13 18:10:00,769 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-04-13 18:10:00,827 INFO L134 CoverageAnalysis]: Checked inductivity of 9 backedges. 3 proven. 5 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2025-04-13 18:10:00,828 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-04-13 18:10:00,828 INFO L324 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1770947563] [2025-04-13 18:10:00,828 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1770947563] provided 0 perfect and 1 imperfect interpolant sequences [2025-04-13 18:10:00,828 INFO L324 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1634769236] [2025-04-13 18:10:00,828 INFO L95 rtionOrderModulation]: Changing assertion order to MIX_INSIDE_OUTSIDE [2025-04-13 18:10:00,828 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-04-13 18:10:00,828 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2025-04-13 18:10:00,829 INFO L229 MonitoredProcess]: Starting monitored process 34 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2025-04-13 18:10:00,830 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (34)] Waiting until timeout for monitored process [2025-04-13 18:10:00,902 INFO L108 AnnotateAndAsserter]: Assert order MIX_INSIDE_OUTSIDE partitioned 43 statements into 3 equivalence classes. [2025-04-13 18:10:00,921 INFO L111 AnnotateAndAsserter]: Assert order MIX_INSIDE_OUTSIDE issued 3 check-sat command(s) and asserted 43 of 43 statements. [2025-04-13 18:10:00,921 INFO L114 AnnotateAndAsserter]: Assert order MIX_INSIDE_OUTSIDE issued 3 check-sat command(s) [2025-04-13 18:10:00,921 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-04-13 18:10:00,922 INFO L256 TraceCheckSpWp]: Trace formula consists of 281 conjuncts, 9 conjuncts are in the unsatisfiable core [2025-04-13 18:10:00,922 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-04-13 18:10:00,984 INFO L134 CoverageAnalysis]: Checked inductivity of 9 backedges. 5 proven. 3 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2025-04-13 18:10:00,984 INFO L312 TraceCheckSpWp]: Computing backward predicates... [2025-04-13 18:10:01,035 INFO L134 CoverageAnalysis]: Checked inductivity of 9 backedges. 5 proven. 3 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2025-04-13 18:10:01,035 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1634769236] provided 0 perfect and 2 imperfect interpolant sequences [2025-04-13 18:10:01,035 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2025-04-13 18:10:01,036 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [7, 7, 7] total 16 [2025-04-13 18:10:01,036 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [203825939] [2025-04-13 18:10:01,036 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2025-04-13 18:10:01,036 INFO L562 AbstractCegarLoop]: INTERPOLANT automaton has 17 states [2025-04-13 18:10:01,036 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-04-13 18:10:01,036 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 17 interpolants. [2025-04-13 18:10:01,036 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=82, Invalid=190, Unknown=0, NotChecked=0, Total=272 [2025-04-13 18:10:01,036 INFO L87 Difference]: Start difference. First operand 8133 states and 31211 transitions. Second operand has 17 states, 17 states have (on average 4.235294117647059) internal successors, (72), 16 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 18:10:03,321 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-04-13 18:10:03,321 INFO L93 Difference]: Finished difference Result 9658 states and 36690 transitions. [2025-04-13 18:10:03,322 INFO L140 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2025-04-13 18:10:03,322 INFO L79 Accepts]: Start accepts. Automaton has has 17 states, 17 states have (on average 4.235294117647059) internal successors, (72), 16 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 43 [2025-04-13 18:10:03,322 INFO L85 Accepts]: Finished accepts. some prefix is accepted. [2025-04-13 18:10:03,347 INFO L225 Difference]: With dead ends: 9658 [2025-04-13 18:10:03,347 INFO L226 Difference]: Without dead ends: 5606 [2025-04-13 18:10:03,353 INFO L436 NwaCegarLoop]: 0 DeclaredPredicates, 91 GetRequests, 75 SyntacticMatches, 1 SemanticMatches, 15 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 97 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=82, Invalid=190, Unknown=0, NotChecked=0, Total=272 [2025-04-13 18:10:03,353 INFO L437 NwaCegarLoop]: 7 mSDtfsCounter, 104 mSDsluCounter, 62 mSDsCounter, 0 mSdLazyCounter, 668 mSolverCounterSat, 6 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 104 SdHoareTripleChecker+Valid, 69 SdHoareTripleChecker+Invalid, 674 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 6 IncrementalHoareTripleChecker+Valid, 668 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.3s IncrementalHoareTripleChecker+Time [2025-04-13 18:10:03,353 INFO L438 NwaCegarLoop]: SdHoareTripleChecker [104 Valid, 69 Invalid, 674 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [6 Valid, 668 Invalid, 0 Unknown, 0 Unchecked, 0.3s Time] [2025-04-13 18:10:03,357 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 5606 states. [2025-04-13 18:10:04,377 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 5606 to 5606. [2025-04-13 18:10:04,384 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 5606 states, 5605 states have (on average 3.8670829616413918) internal successors, (21675), 5605 states have internal predecessors, (21675), 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 18:10:04,396 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5606 states to 5606 states and 21675 transitions. [2025-04-13 18:10:04,404 INFO L79 Accepts]: Start accepts. Automaton has 5606 states and 21675 transitions. Word has length 43 [2025-04-13 18:10:04,404 INFO L85 Accepts]: Finished accepts. word is rejected. [2025-04-13 18:10:04,404 INFO L485 AbstractCegarLoop]: Abstraction has 5606 states and 21675 transitions. [2025-04-13 18:10:04,405 INFO L486 AbstractCegarLoop]: INTERPOLANT automaton has has 17 states, 17 states have (on average 4.235294117647059) internal successors, (72), 16 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 18:10:04,405 INFO L278 IsEmpty]: Start isEmpty. Operand 5606 states and 21675 transitions. [2025-04-13 18:10:04,412 INFO L284 IsEmpty]: Finished isEmpty. Found accepting run of length 45 [2025-04-13 18:10:04,412 INFO L210 NwaCegarLoop]: Found error trace [2025-04-13 18:10:04,412 INFO L218 NwaCegarLoop]: trace histogram [3, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-04-13 18:10:04,419 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (34)] Ended with exit code 0 [2025-04-13 18:10:04,613 WARN L466 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 34 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable54 [2025-04-13 18:10:04,613 INFO L403 AbstractCegarLoop]: === Iteration 56 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [thread1Err0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES, thread1Err3INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION (and 4 more)] === [2025-04-13 18:10:04,613 INFO L155 PredicateUnifier]: Initialized classic predicate unifier [2025-04-13 18:10:04,613 INFO L85 PathProgramCache]: Analyzing trace with hash 1368939697, now seen corresponding path program 25 times [2025-04-13 18:10:04,613 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-04-13 18:10:04,613 INFO L324 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1986253409] [2025-04-13 18:10:04,613 INFO L95 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2025-04-13 18:10:04,613 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-04-13 18:10:04,619 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 44 statements into 1 equivalence classes. [2025-04-13 18:10:04,621 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 44 of 44 statements. [2025-04-13 18:10:04,621 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-04-13 18:10:04,621 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-04-13 18:10:04,677 INFO L134 CoverageAnalysis]: Checked inductivity of 8 backedges. 1 proven. 5 refuted. 0 times theorem prover too weak. 2 trivial. 0 not checked. [2025-04-13 18:10:04,677 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-04-13 18:10:04,677 INFO L324 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1986253409] [2025-04-13 18:10:04,677 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1986253409] provided 0 perfect and 1 imperfect interpolant sequences [2025-04-13 18:10:04,677 INFO L324 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [2113869988] [2025-04-13 18:10:04,677 INFO L95 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2025-04-13 18:10:04,677 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-04-13 18:10:04,678 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2025-04-13 18:10:04,679 INFO L229 MonitoredProcess]: Starting monitored process 35 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2025-04-13 18:10:04,680 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (35)] Waiting until timeout for monitored process [2025-04-13 18:10:04,753 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 44 statements into 1 equivalence classes. [2025-04-13 18:10:04,770 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 44 of 44 statements. [2025-04-13 18:10:04,770 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-04-13 18:10:04,770 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-04-13 18:10:04,771 INFO L256 TraceCheckSpWp]: Trace formula consists of 290 conjuncts, 9 conjuncts are in the unsatisfiable core [2025-04-13 18:10:04,772 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-04-13 18:10:04,844 INFO L134 CoverageAnalysis]: Checked inductivity of 8 backedges. 3 proven. 3 refuted. 0 times theorem prover too weak. 2 trivial. 0 not checked. [2025-04-13 18:10:04,844 INFO L312 TraceCheckSpWp]: Computing backward predicates... [2025-04-13 18:10:04,907 INFO L134 CoverageAnalysis]: Checked inductivity of 8 backedges. 6 proven. 0 refuted. 0 times theorem prover too weak. 2 trivial. 0 not checked. [2025-04-13 18:10:04,907 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [2113869988] provided 1 perfect and 1 imperfect interpolant sequences [2025-04-13 18:10:04,907 INFO L185 FreeRefinementEngine]: Found 1 perfect and 2 imperfect interpolant sequences. [2025-04-13 18:10:04,907 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [7] imperfect sequences [7, 7] total 16 [2025-04-13 18:10:04,908 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [507701116] [2025-04-13 18:10:04,908 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-04-13 18:10:04,908 INFO L562 AbstractCegarLoop]: INTERPOLANT automaton has 8 states [2025-04-13 18:10:04,908 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-04-13 18:10:04,908 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2025-04-13 18:10:04,908 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=78, Invalid=194, Unknown=0, NotChecked=0, Total=272 [2025-04-13 18:10:04,908 INFO L87 Difference]: Start difference. First operand 5606 states and 21675 transitions. Second operand has 8 states, 8 states have (on average 5.375) internal successors, (43), 7 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 18:10:06,728 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-04-13 18:10:06,728 INFO L93 Difference]: Finished difference Result 7579 states and 29257 transitions. [2025-04-13 18:10:06,728 INFO L140 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2025-04-13 18:10:06,728 INFO L79 Accepts]: Start accepts. Automaton has has 8 states, 8 states have (on average 5.375) internal successors, (43), 7 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 44 [2025-04-13 18:10:06,728 INFO L85 Accepts]: Finished accepts. some prefix is accepted. [2025-04-13 18:10:06,750 INFO L225 Difference]: With dead ends: 7579 [2025-04-13 18:10:06,750 INFO L226 Difference]: Without dead ends: 5997 [2025-04-13 18:10:06,753 INFO L436 NwaCegarLoop]: 0 DeclaredPredicates, 95 GetRequests, 76 SyntacticMatches, 2 SemanticMatches, 17 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 90 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=99, Invalid=243, Unknown=0, NotChecked=0, Total=342 [2025-04-13 18:10:06,753 INFO L437 NwaCegarLoop]: 4 mSDtfsCounter, 149 mSDsluCounter, 6 mSDsCounter, 0 mSdLazyCounter, 120 mSolverCounterSat, 2 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 149 SdHoareTripleChecker+Valid, 10 SdHoareTripleChecker+Invalid, 122 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 2 IncrementalHoareTripleChecker+Valid, 120 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2025-04-13 18:10:06,753 INFO L438 NwaCegarLoop]: SdHoareTripleChecker [149 Valid, 10 Invalid, 122 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [2 Valid, 120 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2025-04-13 18:10:06,757 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 5997 states. [2025-04-13 18:10:07,429 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 5997 to 3617. [2025-04-13 18:10:07,432 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 3617 states, 3616 states have (on average 3.7906526548672566) internal successors, (13707), 3616 states have internal predecessors, (13707), 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 18:10:07,439 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3617 states to 3617 states and 13707 transitions. [2025-04-13 18:10:07,449 INFO L79 Accepts]: Start accepts. Automaton has 3617 states and 13707 transitions. Word has length 44 [2025-04-13 18:10:07,450 INFO L85 Accepts]: Finished accepts. word is rejected. [2025-04-13 18:10:07,450 INFO L485 AbstractCegarLoop]: Abstraction has 3617 states and 13707 transitions. [2025-04-13 18:10:07,450 INFO L486 AbstractCegarLoop]: INTERPOLANT automaton has has 8 states, 8 states have (on average 5.375) internal successors, (43), 7 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 18:10:07,450 INFO L278 IsEmpty]: Start isEmpty. Operand 3617 states and 13707 transitions. [2025-04-13 18:10:07,455 INFO L284 IsEmpty]: Finished isEmpty. Found accepting run of length 45 [2025-04-13 18:10:07,455 INFO L210 NwaCegarLoop]: Found error trace [2025-04-13 18:10:07,455 INFO L218 NwaCegarLoop]: trace histogram [3, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-04-13 18:10:07,461 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (35)] Ended with exit code 0 [2025-04-13 18:10:07,655 WARN L466 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable55,35 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-04-13 18:10:07,655 INFO L403 AbstractCegarLoop]: === Iteration 57 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [thread1Err0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES, thread1Err3INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION (and 4 more)] === [2025-04-13 18:10:07,656 INFO L155 PredicateUnifier]: Initialized classic predicate unifier [2025-04-13 18:10:07,656 INFO L85 PathProgramCache]: Analyzing trace with hash -1271631828, now seen corresponding path program 26 times [2025-04-13 18:10:07,656 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-04-13 18:10:07,656 INFO L324 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [70601649] [2025-04-13 18:10:07,656 INFO L95 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST1 [2025-04-13 18:10:07,656 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-04-13 18:10:07,661 INFO L108 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 partitioned 44 statements into 2 equivalence classes. [2025-04-13 18:10:07,664 INFO L111 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) and asserted 44 of 44 statements. [2025-04-13 18:10:07,664 INFO L114 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) [2025-04-13 18:10:07,664 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-04-13 18:10:07,719 INFO L134 CoverageAnalysis]: Checked inductivity of 12 backedges. 1 proven. 6 refuted. 0 times theorem prover too weak. 5 trivial. 0 not checked. [2025-04-13 18:10:07,719 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-04-13 18:10:07,719 INFO L324 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [70601649] [2025-04-13 18:10:07,719 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [70601649] provided 0 perfect and 1 imperfect interpolant sequences [2025-04-13 18:10:07,719 INFO L324 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [280524839] [2025-04-13 18:10:07,719 INFO L95 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST1 [2025-04-13 18:10:07,719 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-04-13 18:10:07,719 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2025-04-13 18:10:07,721 INFO L229 MonitoredProcess]: Starting monitored process 36 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2025-04-13 18:10:07,722 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (36)] Waiting until timeout for monitored process [2025-04-13 18:10:07,797 INFO L108 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 partitioned 44 statements into 2 equivalence classes. [2025-04-13 18:10:07,816 INFO L111 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) and asserted 44 of 44 statements. [2025-04-13 18:10:07,816 INFO L114 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) [2025-04-13 18:10:07,816 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-04-13 18:10:07,817 INFO L256 TraceCheckSpWp]: Trace formula consists of 290 conjuncts, 9 conjuncts are in the unsatisfiable core [2025-04-13 18:10:07,817 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-04-13 18:10:07,875 INFO L134 CoverageAnalysis]: Checked inductivity of 12 backedges. 3 proven. 4 refuted. 0 times theorem prover too weak. 5 trivial. 0 not checked. [2025-04-13 18:10:07,876 INFO L312 TraceCheckSpWp]: Computing backward predicates... [2025-04-13 18:10:07,925 INFO L134 CoverageAnalysis]: Checked inductivity of 12 backedges. 6 proven. 1 refuted. 0 times theorem prover too weak. 5 trivial. 0 not checked. [2025-04-13 18:10:07,926 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [280524839] provided 0 perfect and 2 imperfect interpolant sequences [2025-04-13 18:10:07,926 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2025-04-13 18:10:07,926 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [7, 7, 7] total 16 [2025-04-13 18:10:07,926 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1467710047] [2025-04-13 18:10:07,926 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2025-04-13 18:10:07,926 INFO L562 AbstractCegarLoop]: INTERPOLANT automaton has 17 states [2025-04-13 18:10:07,926 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-04-13 18:10:07,926 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 17 interpolants. [2025-04-13 18:10:07,926 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=78, Invalid=194, Unknown=0, NotChecked=0, Total=272 [2025-04-13 18:10:07,926 INFO L87 Difference]: Start difference. First operand 3617 states and 13707 transitions. Second operand has 17 states, 17 states have (on average 3.411764705882353) internal successors, (58), 16 states have internal predecessors, (58), 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 18:10:09,781 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-04-13 18:10:09,781 INFO L93 Difference]: Finished difference Result 6146 states and 23425 transitions. [2025-04-13 18:10:09,782 INFO L140 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2025-04-13 18:10:09,782 INFO L79 Accepts]: Start accepts. Automaton has has 17 states, 17 states have (on average 3.411764705882353) internal successors, (58), 16 states have internal predecessors, (58), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 44 [2025-04-13 18:10:09,782 INFO L85 Accepts]: Finished accepts. some prefix is accepted. [2025-04-13 18:10:09,801 INFO L225 Difference]: With dead ends: 6146 [2025-04-13 18:10:09,801 INFO L226 Difference]: Without dead ends: 5061 [2025-04-13 18:10:09,803 INFO L436 NwaCegarLoop]: 0 DeclaredPredicates, 94 GetRequests, 76 SyntacticMatches, 2 SemanticMatches, 16 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 86 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=89, Invalid=217, Unknown=0, NotChecked=0, Total=306 [2025-04-13 18:10:09,804 INFO L437 NwaCegarLoop]: 5 mSDtfsCounter, 245 mSDsluCounter, 15 mSDsCounter, 0 mSdLazyCounter, 282 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 245 SdHoareTripleChecker+Valid, 20 SdHoareTripleChecker+Invalid, 282 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 282 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2025-04-13 18:10:09,804 INFO L438 NwaCegarLoop]: SdHoareTripleChecker [245 Valid, 20 Invalid, 282 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 282 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2025-04-13 18:10:09,807 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 5061 states. [2025-04-13 18:10:10,847 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 5061 to 4700. [2025-04-13 18:10:10,852 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 4700 states, 4699 states have (on average 3.8031496062992125) internal successors, (17871), 4699 states have internal predecessors, (17871), 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 18:10:10,860 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4700 states to 4700 states and 17871 transitions. [2025-04-13 18:10:10,868 INFO L79 Accepts]: Start accepts. Automaton has 4700 states and 17871 transitions. Word has length 44 [2025-04-13 18:10:10,868 INFO L85 Accepts]: Finished accepts. word is rejected. [2025-04-13 18:10:10,868 INFO L485 AbstractCegarLoop]: Abstraction has 4700 states and 17871 transitions. [2025-04-13 18:10:10,868 INFO L486 AbstractCegarLoop]: INTERPOLANT automaton has has 17 states, 17 states have (on average 3.411764705882353) internal successors, (58), 16 states have internal predecessors, (58), 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 18:10:10,868 INFO L278 IsEmpty]: Start isEmpty. Operand 4700 states and 17871 transitions. [2025-04-13 18:10:10,874 INFO L284 IsEmpty]: Finished isEmpty. Found accepting run of length 48 [2025-04-13 18:10:10,875 INFO L210 NwaCegarLoop]: Found error trace [2025-04-13 18:10:10,875 INFO L218 NwaCegarLoop]: trace histogram [3, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-04-13 18:10:10,881 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (36)] Ended with exit code 0 [2025-04-13 18:10:11,075 WARN L466 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 36 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable56 [2025-04-13 18:10:11,075 INFO L403 AbstractCegarLoop]: === Iteration 58 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [thread1Err0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES, thread1Err3INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION (and 4 more)] === [2025-04-13 18:10:11,075 INFO L155 PredicateUnifier]: Initialized classic predicate unifier [2025-04-13 18:10:11,075 INFO L85 PathProgramCache]: Analyzing trace with hash -250795501, now seen corresponding path program 27 times [2025-04-13 18:10:11,076 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-04-13 18:10:11,076 INFO L324 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [379997436] [2025-04-13 18:10:11,076 INFO L95 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST2 [2025-04-13 18:10:11,076 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-04-13 18:10:11,082 INFO L108 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST2 partitioned 47 statements into 3 equivalence classes. [2025-04-13 18:10:11,094 INFO L111 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST2 issued 3 check-sat command(s) and asserted 47 of 47 statements. [2025-04-13 18:10:11,094 INFO L114 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST2 issued 3 check-sat command(s) [2025-04-13 18:10:11,094 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-04-13 18:10:11,363 INFO L134 CoverageAnalysis]: Checked inductivity of 14 backedges. 0 proven. 8 refuted. 0 times theorem prover too weak. 6 trivial. 0 not checked. [2025-04-13 18:10:11,364 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-04-13 18:10:11,364 INFO L324 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [379997436] [2025-04-13 18:10:11,364 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [379997436] provided 0 perfect and 1 imperfect interpolant sequences [2025-04-13 18:10:11,364 INFO L324 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1703969254] [2025-04-13 18:10:11,364 INFO L95 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST2 [2025-04-13 18:10:11,364 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-04-13 18:10:11,364 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2025-04-13 18:10:11,366 INFO L229 MonitoredProcess]: Starting monitored process 37 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2025-04-13 18:10:11,366 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (37)] Waiting until timeout for monitored process [2025-04-13 18:10:11,442 INFO L108 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST2 partitioned 47 statements into 3 equivalence classes. [2025-04-13 18:10:11,465 INFO L111 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST2 issued 3 check-sat command(s) and asserted 47 of 47 statements. [2025-04-13 18:10:11,465 INFO L114 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST2 issued 3 check-sat command(s) [2025-04-13 18:10:11,465 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-04-13 18:10:11,466 INFO L256 TraceCheckSpWp]: Trace formula consists of 305 conjuncts, 64 conjuncts are in the unsatisfiable core [2025-04-13 18:10:11,468 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-04-13 18:10:11,523 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 19 treesize of output 1 [2025-04-13 18:10:11,912 INFO L325 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2025-04-13 18:10:11,912 INFO L354 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 3 select indices, 3 select index equivalence classes, 1 disjoint index pairs (out of 3 index pairs), introduced 3 new quantified variables, introduced 3 case distinctions, treesize of input 30 treesize of output 28 [2025-04-13 18:10:11,999 INFO L134 CoverageAnalysis]: Checked inductivity of 14 backedges. 0 proven. 14 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-04-13 18:10:11,999 INFO L312 TraceCheckSpWp]: Computing backward predicates... [2025-04-13 18:10:12,321 INFO L134 CoverageAnalysis]: Checked inductivity of 14 backedges. 0 proven. 8 refuted. 0 times theorem prover too weak. 6 trivial. 0 not checked. [2025-04-13 18:10:12,321 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1703969254] provided 0 perfect and 2 imperfect interpolant sequences [2025-04-13 18:10:12,321 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2025-04-13 18:10:12,321 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [13, 17, 13] total 37 [2025-04-13 18:10:12,321 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [575108515] [2025-04-13 18:10:12,321 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2025-04-13 18:10:12,322 INFO L562 AbstractCegarLoop]: INTERPOLANT automaton has 38 states [2025-04-13 18:10:12,322 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-04-13 18:10:12,322 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 38 interpolants. [2025-04-13 18:10:12,322 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=138, Invalid=1268, Unknown=0, NotChecked=0, Total=1406 [2025-04-13 18:10:12,322 INFO L87 Difference]: Start difference. First operand 4700 states and 17871 transitions. Second operand has 38 states, 37 states have (on average 2.7837837837837838) internal successors, (103), 38 states have internal predecessors, (103), 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 18:10:25,887 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-04-13 18:10:25,887 INFO L93 Difference]: Finished difference Result 21566 states and 79825 transitions. [2025-04-13 18:10:25,888 INFO L140 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 82 states. [2025-04-13 18:10:25,888 INFO L79 Accepts]: Start accepts. Automaton has has 38 states, 37 states have (on average 2.7837837837837838) internal successors, (103), 38 states have internal predecessors, (103), 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 47 [2025-04-13 18:10:25,888 INFO L85 Accepts]: Finished accepts. some prefix is accepted. [2025-04-13 18:10:25,949 INFO L225 Difference]: With dead ends: 21566 [2025-04-13 18:10:25,950 INFO L226 Difference]: Without dead ends: 20920 [2025-04-13 18:10:25,955 INFO L436 NwaCegarLoop]: 0 DeclaredPredicates, 183 GetRequests, 72 SyntacticMatches, 1 SemanticMatches, 110 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 3761 ImplicationChecksByTransitivity, 3.1s TimeCoverageRelationStatistics Valid=1359, Invalid=11073, Unknown=0, NotChecked=0, Total=12432 [2025-04-13 18:10:25,956 INFO L437 NwaCegarLoop]: 33 mSDtfsCounter, 2582 mSDsluCounter, 721 mSDsCounter, 0 mSdLazyCounter, 7838 mSolverCounterSat, 49 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 3.3s Time, 0 mProtectedPredicate, 0 mProtectedAction, 2582 SdHoareTripleChecker+Valid, 754 SdHoareTripleChecker+Invalid, 7887 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 49 IncrementalHoareTripleChecker+Valid, 7838 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 3.8s IncrementalHoareTripleChecker+Time [2025-04-13 18:10:25,956 INFO L438 NwaCegarLoop]: SdHoareTripleChecker [2582 Valid, 754 Invalid, 7887 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [49 Valid, 7838 Invalid, 0 Unknown, 0 Unchecked, 3.8s Time] [2025-04-13 18:10:25,970 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 20920 states. [2025-04-13 18:10:27,513 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 20920 to 5098. [2025-04-13 18:10:27,519 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 5098 states, 5097 states have (on average 3.7728075338434373) internal successors, (19230), 5097 states have internal predecessors, (19230), 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 18:10:27,528 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5098 states to 5098 states and 19230 transitions. [2025-04-13 18:10:27,544 INFO L79 Accepts]: Start accepts. Automaton has 5098 states and 19230 transitions. Word has length 47 [2025-04-13 18:10:27,544 INFO L85 Accepts]: Finished accepts. word is rejected. [2025-04-13 18:10:27,544 INFO L485 AbstractCegarLoop]: Abstraction has 5098 states and 19230 transitions. [2025-04-13 18:10:27,545 INFO L486 AbstractCegarLoop]: INTERPOLANT automaton has has 38 states, 37 states have (on average 2.7837837837837838) internal successors, (103), 38 states have internal predecessors, (103), 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 18:10:27,545 INFO L278 IsEmpty]: Start isEmpty. Operand 5098 states and 19230 transitions. [2025-04-13 18:10:27,552 INFO L284 IsEmpty]: Finished isEmpty. Found accepting run of length 48 [2025-04-13 18:10:27,552 INFO L210 NwaCegarLoop]: Found error trace [2025-04-13 18:10:27,552 INFO L218 NwaCegarLoop]: trace histogram [3, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-04-13 18:10:27,559 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (37)] Forceful destruction successful, exit code 0 [2025-04-13 18:10:27,752 WARN L466 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable57,37 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-04-13 18:10:27,752 INFO L403 AbstractCegarLoop]: === Iteration 59 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [thread1Err0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES, thread1Err3INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION (and 4 more)] === [2025-04-13 18:10:27,752 INFO L155 PredicateUnifier]: Initialized classic predicate unifier [2025-04-13 18:10:27,752 INFO L85 PathProgramCache]: Analyzing trace with hash -303384184, now seen corresponding path program 1 times [2025-04-13 18:10:27,753 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-04-13 18:10:27,753 INFO L324 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1021420108] [2025-04-13 18:10:27,753 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-04-13 18:10:27,753 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-04-13 18:10:27,761 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 47 statements into 1 equivalence classes. [2025-04-13 18:10:27,769 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 47 of 47 statements. [2025-04-13 18:10:27,769 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-04-13 18:10:27,769 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-04-13 18:10:28,352 INFO L134 CoverageAnalysis]: Checked inductivity of 13 backedges. 0 proven. 13 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-04-13 18:10:28,353 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-04-13 18:10:28,353 INFO L324 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1021420108] [2025-04-13 18:10:28,353 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1021420108] provided 0 perfect and 1 imperfect interpolant sequences [2025-04-13 18:10:28,353 INFO L324 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1074802922] [2025-04-13 18:10:28,353 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-04-13 18:10:28,353 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-04-13 18:10:28,353 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2025-04-13 18:10:28,355 INFO L229 MonitoredProcess]: Starting monitored process 38 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2025-04-13 18:10:28,356 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (38)] Waiting until timeout for monitored process [2025-04-13 18:10:28,439 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 47 statements into 1 equivalence classes. [2025-04-13 18:10:28,458 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 47 of 47 statements. [2025-04-13 18:10:28,458 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-04-13 18:10:28,458 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-04-13 18:10:28,459 INFO L256 TraceCheckSpWp]: Trace formula consists of 305 conjuncts, 41 conjuncts are in the unsatisfiable core [2025-04-13 18:10:28,460 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-04-13 18:10:28,683 INFO L325 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2025-04-13 18:10:28,683 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 36 treesize of output 12 [2025-04-13 18:10:28,692 INFO L134 CoverageAnalysis]: Checked inductivity of 13 backedges. 0 proven. 7 refuted. 0 times theorem prover too weak. 6 trivial. 0 not checked. [2025-04-13 18:10:28,692 INFO L312 TraceCheckSpWp]: Computing backward predicates... [2025-04-13 18:10:28,862 INFO L325 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2025-04-13 18:10:28,862 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 38 treesize of output 43 [2025-04-13 18:10:28,887 INFO L134 CoverageAnalysis]: Checked inductivity of 13 backedges. 0 proven. 7 refuted. 0 times theorem prover too weak. 6 trivial. 0 not checked. [2025-04-13 18:10:28,887 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1074802922] provided 0 perfect and 2 imperfect interpolant sequences [2025-04-13 18:10:28,887 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2025-04-13 18:10:28,887 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [16, 11, 11] total 31 [2025-04-13 18:10:28,887 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [243890705] [2025-04-13 18:10:28,887 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2025-04-13 18:10:28,887 INFO L562 AbstractCegarLoop]: INTERPOLANT automaton has 32 states [2025-04-13 18:10:28,887 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-04-13 18:10:28,888 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 32 interpolants. [2025-04-13 18:10:28,888 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=88, Invalid=904, Unknown=0, NotChecked=0, Total=992 [2025-04-13 18:10:28,888 INFO L87 Difference]: Start difference. First operand 5098 states and 19230 transitions. Second operand has 32 states, 31 states have (on average 3.193548387096774) internal successors, (99), 32 states have internal predecessors, (99), 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 18:10:36,564 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-04-13 18:10:36,565 INFO L93 Difference]: Finished difference Result 10994 states and 41995 transitions. [2025-04-13 18:10:36,565 INFO L140 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 25 states. [2025-04-13 18:10:36,565 INFO L79 Accepts]: Start accepts. Automaton has has 32 states, 31 states have (on average 3.193548387096774) internal successors, (99), 32 states have internal predecessors, (99), 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 47 [2025-04-13 18:10:36,565 INFO L85 Accepts]: Finished accepts. some prefix is accepted. [2025-04-13 18:10:36,600 INFO L225 Difference]: With dead ends: 10994 [2025-04-13 18:10:36,600 INFO L226 Difference]: Without dead ends: 10767 [2025-04-13 18:10:36,602 INFO L436 NwaCegarLoop]: 0 DeclaredPredicates, 127 GetRequests, 78 SyntacticMatches, 0 SemanticMatches, 49 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 406 ImplicationChecksByTransitivity, 0.8s TimeCoverageRelationStatistics Valid=252, Invalid=2298, Unknown=0, NotChecked=0, Total=2550 [2025-04-13 18:10:36,603 INFO L437 NwaCegarLoop]: 19 mSDtfsCounter, 857 mSDsluCounter, 337 mSDsCounter, 0 mSdLazyCounter, 6065 mSolverCounterSat, 6 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 1.9s Time, 0 mProtectedPredicate, 0 mProtectedAction, 857 SdHoareTripleChecker+Valid, 356 SdHoareTripleChecker+Invalid, 6071 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 6 IncrementalHoareTripleChecker+Valid, 6065 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 2.2s IncrementalHoareTripleChecker+Time [2025-04-13 18:10:36,603 INFO L438 NwaCegarLoop]: SdHoareTripleChecker [857 Valid, 356 Invalid, 6071 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [6 Valid, 6065 Invalid, 0 Unknown, 0 Unchecked, 2.2s Time] [2025-04-13 18:10:36,610 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 10767 states. [2025-04-13 18:10:38,331 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 10767 to 5506. [2025-04-13 18:10:38,336 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 5506 states, 5505 states have (on average 3.818346957311535) internal successors, (21020), 5505 states have internal predecessors, (21020), 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 18:10:38,345 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5506 states to 5506 states and 21020 transitions. [2025-04-13 18:10:38,357 INFO L79 Accepts]: Start accepts. Automaton has 5506 states and 21020 transitions. Word has length 47 [2025-04-13 18:10:38,357 INFO L85 Accepts]: Finished accepts. word is rejected. [2025-04-13 18:10:38,357 INFO L485 AbstractCegarLoop]: Abstraction has 5506 states and 21020 transitions. [2025-04-13 18:10:38,357 INFO L486 AbstractCegarLoop]: INTERPOLANT automaton has has 32 states, 31 states have (on average 3.193548387096774) internal successors, (99), 32 states have internal predecessors, (99), 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 18:10:38,357 INFO L278 IsEmpty]: Start isEmpty. Operand 5506 states and 21020 transitions. [2025-04-13 18:10:38,364 INFO L284 IsEmpty]: Finished isEmpty. Found accepting run of length 48 [2025-04-13 18:10:38,365 INFO L210 NwaCegarLoop]: Found error trace [2025-04-13 18:10:38,365 INFO L218 NwaCegarLoop]: trace histogram [3, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-04-13 18:10:38,371 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (38)] Ended with exit code 0 [2025-04-13 18:10:38,565 WARN L466 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 38 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable58 [2025-04-13 18:10:38,565 INFO L403 AbstractCegarLoop]: === Iteration 60 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [thread1Err0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES, thread1Err3INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION (and 4 more)] === [2025-04-13 18:10:38,565 INFO L155 PredicateUnifier]: Initialized classic predicate unifier [2025-04-13 18:10:38,565 INFO L85 PathProgramCache]: Analyzing trace with hash 223907352, now seen corresponding path program 2 times [2025-04-13 18:10:38,566 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-04-13 18:10:38,566 INFO L324 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [131631785] [2025-04-13 18:10:38,566 INFO L95 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST1 [2025-04-13 18:10:38,566 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-04-13 18:10:38,571 INFO L108 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 partitioned 47 statements into 2 equivalence classes. [2025-04-13 18:10:38,579 INFO L111 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) and asserted 47 of 47 statements. [2025-04-13 18:10:38,579 INFO L114 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) [2025-04-13 18:10:38,579 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-04-13 18:10:38,826 INFO L134 CoverageAnalysis]: Checked inductivity of 12 backedges. 0 proven. 6 refuted. 0 times theorem prover too weak. 6 trivial. 0 not checked. [2025-04-13 18:10:38,826 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-04-13 18:10:38,826 INFO L324 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [131631785] [2025-04-13 18:10:38,826 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [131631785] provided 0 perfect and 1 imperfect interpolant sequences [2025-04-13 18:10:38,826 INFO L324 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1450988394] [2025-04-13 18:10:38,826 INFO L95 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST1 [2025-04-13 18:10:38,826 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-04-13 18:10:38,826 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2025-04-13 18:10:38,828 INFO L229 MonitoredProcess]: Starting monitored process 39 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2025-04-13 18:10:38,828 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (39)] Waiting until timeout for monitored process [2025-04-13 18:10:38,906 INFO L108 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 partitioned 47 statements into 2 equivalence classes. [2025-04-13 18:10:38,927 INFO L111 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) and asserted 47 of 47 statements. [2025-04-13 18:10:38,927 INFO L114 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) [2025-04-13 18:10:38,928 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-04-13 18:10:38,929 INFO L256 TraceCheckSpWp]: Trace formula consists of 305 conjuncts, 51 conjuncts are in the unsatisfiable core [2025-04-13 18:10:38,930 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-04-13 18:10:39,175 INFO L325 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2025-04-13 18:10:39,175 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 28 treesize of output 12 [2025-04-13 18:10:39,187 INFO L134 CoverageAnalysis]: Checked inductivity of 12 backedges. 0 proven. 9 refuted. 0 times theorem prover too weak. 3 trivial. 0 not checked. [2025-04-13 18:10:39,187 INFO L312 TraceCheckSpWp]: Computing backward predicates... [2025-04-13 18:10:39,362 INFO L325 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2025-04-13 18:10:39,362 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 38 treesize of output 43 [2025-04-13 18:10:39,383 INFO L134 CoverageAnalysis]: Checked inductivity of 12 backedges. 0 proven. 6 refuted. 0 times theorem prover too weak. 6 trivial. 0 not checked. [2025-04-13 18:10:39,383 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1450988394] provided 0 perfect and 2 imperfect interpolant sequences [2025-04-13 18:10:39,383 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2025-04-13 18:10:39,383 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [12, 13, 11] total 29 [2025-04-13 18:10:39,383 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1521790099] [2025-04-13 18:10:39,383 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2025-04-13 18:10:39,383 INFO L562 AbstractCegarLoop]: INTERPOLANT automaton has 30 states [2025-04-13 18:10:39,383 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-04-13 18:10:39,384 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 30 interpolants. [2025-04-13 18:10:39,384 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=82, Invalid=788, Unknown=0, NotChecked=0, Total=870 [2025-04-13 18:10:39,384 INFO L87 Difference]: Start difference. First operand 5506 states and 21020 transitions. Second operand has 30 states, 29 states have (on average 3.4482758620689653) internal successors, (100), 30 states have internal predecessors, (100), 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 18:10:48,872 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-04-13 18:10:48,872 INFO L93 Difference]: Finished difference Result 12313 states and 46245 transitions. [2025-04-13 18:10:48,872 INFO L140 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 44 states. [2025-04-13 18:10:48,872 INFO L79 Accepts]: Start accepts. Automaton has has 30 states, 29 states have (on average 3.4482758620689653) internal successors, (100), 30 states have internal predecessors, (100), 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 47 [2025-04-13 18:10:48,872 INFO L85 Accepts]: Finished accepts. some prefix is accepted. [2025-04-13 18:10:48,909 INFO L225 Difference]: With dead ends: 12313 [2025-04-13 18:10:48,909 INFO L226 Difference]: Without dead ends: 12044 [2025-04-13 18:10:48,912 INFO L436 NwaCegarLoop]: 0 DeclaredPredicates, 141 GetRequests, 77 SyntacticMatches, 0 SemanticMatches, 64 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 834 ImplicationChecksByTransitivity, 1.1s TimeCoverageRelationStatistics Valid=441, Invalid=3849, Unknown=0, NotChecked=0, Total=4290 [2025-04-13 18:10:48,912 INFO L437 NwaCegarLoop]: 30 mSDtfsCounter, 727 mSDsluCounter, 548 mSDsCounter, 0 mSdLazyCounter, 7995 mSolverCounterSat, 9 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 2.7s Time, 0 mProtectedPredicate, 0 mProtectedAction, 727 SdHoareTripleChecker+Valid, 578 SdHoareTripleChecker+Invalid, 8004 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 9 IncrementalHoareTripleChecker+Valid, 7995 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 3.1s IncrementalHoareTripleChecker+Time [2025-04-13 18:10:48,912 INFO L438 NwaCegarLoop]: SdHoareTripleChecker [727 Valid, 578 Invalid, 8004 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [9 Valid, 7995 Invalid, 0 Unknown, 0 Unchecked, 3.1s Time] [2025-04-13 18:10:48,920 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 12044 states. [2025-04-13 18:10:50,754 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 12044 to 5530. [2025-04-13 18:10:50,759 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 5530 states, 5529 states have (on average 3.821305841924399) internal successors, (21128), 5529 states have internal predecessors, (21128), 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 18:10:50,769 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5530 states to 5530 states and 21128 transitions. [2025-04-13 18:10:50,781 INFO L79 Accepts]: Start accepts. Automaton has 5530 states and 21128 transitions. Word has length 47 [2025-04-13 18:10:50,781 INFO L85 Accepts]: Finished accepts. word is rejected. [2025-04-13 18:10:50,781 INFO L485 AbstractCegarLoop]: Abstraction has 5530 states and 21128 transitions. [2025-04-13 18:10:50,781 INFO L486 AbstractCegarLoop]: INTERPOLANT automaton has has 30 states, 29 states have (on average 3.4482758620689653) internal successors, (100), 30 states have internal predecessors, (100), 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 18:10:50,782 INFO L278 IsEmpty]: Start isEmpty. Operand 5530 states and 21128 transitions. [2025-04-13 18:10:50,789 INFO L284 IsEmpty]: Finished isEmpty. Found accepting run of length 48 [2025-04-13 18:10:50,789 INFO L210 NwaCegarLoop]: Found error trace [2025-04-13 18:10:50,789 INFO L218 NwaCegarLoop]: trace histogram [3, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-04-13 18:10:50,796 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (39)] Forceful destruction successful, exit code 0 [2025-04-13 18:10:50,989 WARN L466 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 39 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable59 [2025-04-13 18:10:50,989 INFO L403 AbstractCegarLoop]: === Iteration 61 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [thread1Err0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES, thread1Err3INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION (and 4 more)] === [2025-04-13 18:10:50,990 INFO L155 PredicateUnifier]: Initialized classic predicate unifier [2025-04-13 18:10:50,990 INFO L85 PathProgramCache]: Analyzing trace with hash -1174459836, now seen corresponding path program 3 times [2025-04-13 18:10:50,990 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-04-13 18:10:50,990 INFO L324 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [373919396] [2025-04-13 18:10:50,990 INFO L95 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST2 [2025-04-13 18:10:50,990 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-04-13 18:10:50,995 INFO L108 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST2 partitioned 47 statements into 3 equivalence classes. [2025-04-13 18:10:51,004 INFO L111 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST2 issued 3 check-sat command(s) and asserted 47 of 47 statements. [2025-04-13 18:10:51,004 INFO L114 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST2 issued 3 check-sat command(s) [2025-04-13 18:10:51,004 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-04-13 18:10:51,253 INFO L134 CoverageAnalysis]: Checked inductivity of 11 backedges. 0 proven. 5 refuted. 0 times theorem prover too weak. 6 trivial. 0 not checked. [2025-04-13 18:10:51,253 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-04-13 18:10:51,253 INFO L324 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [373919396] [2025-04-13 18:10:51,253 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [373919396] provided 0 perfect and 1 imperfect interpolant sequences [2025-04-13 18:10:51,253 INFO L324 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [295332210] [2025-04-13 18:10:51,253 INFO L95 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST2 [2025-04-13 18:10:51,253 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-04-13 18:10:51,253 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2025-04-13 18:10:51,255 INFO L229 MonitoredProcess]: Starting monitored process 40 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2025-04-13 18:10:51,256 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (40)] Waiting until timeout for monitored process [2025-04-13 18:10:51,334 INFO L108 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST2 partitioned 47 statements into 3 equivalence classes. [2025-04-13 18:10:51,356 INFO L111 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST2 issued 3 check-sat command(s) and asserted 47 of 47 statements. [2025-04-13 18:10:51,356 INFO L114 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST2 issued 3 check-sat command(s) [2025-04-13 18:10:51,356 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-04-13 18:10:51,357 INFO L256 TraceCheckSpWp]: Trace formula consists of 305 conjuncts, 66 conjuncts are in the unsatisfiable core [2025-04-13 18:10:51,358 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-04-13 18:10:51,405 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 19 treesize of output 1 [2025-04-13 18:10:51,807 INFO L189 IndexEqualityManager]: detected not equals via solver [2025-04-13 18:10:51,813 INFO L325 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2025-04-13 18:10:51,813 INFO L354 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 3 select indices, 3 select index equivalence classes, 1 disjoint index pairs (out of 3 index pairs), introduced 3 new quantified variables, introduced 3 case distinctions, treesize of input 32 treesize of output 28 [2025-04-13 18:10:51,940 INFO L134 CoverageAnalysis]: Checked inductivity of 11 backedges. 2 proven. 8 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2025-04-13 18:10:51,941 INFO L312 TraceCheckSpWp]: Computing backward predicates... [2025-04-13 18:10:52,496 INFO L134 CoverageAnalysis]: Checked inductivity of 11 backedges. 0 proven. 5 refuted. 0 times theorem prover too weak. 6 trivial. 0 not checked. [2025-04-13 18:10:52,497 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [295332210] provided 0 perfect and 2 imperfect interpolant sequences [2025-04-13 18:10:52,497 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2025-04-13 18:10:52,497 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [13, 16, 13] total 37 [2025-04-13 18:10:52,497 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1428187950] [2025-04-13 18:10:52,497 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2025-04-13 18:10:52,497 INFO L562 AbstractCegarLoop]: INTERPOLANT automaton has 38 states [2025-04-13 18:10:52,497 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-04-13 18:10:52,497 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 38 interpolants. [2025-04-13 18:10:52,497 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=157, Invalid=1249, Unknown=0, NotChecked=0, Total=1406 [2025-04-13 18:10:52,498 INFO L87 Difference]: Start difference. First operand 5530 states and 21128 transitions. Second operand has 38 states, 37 states have (on average 2.891891891891892) internal successors, (107), 38 states have internal predecessors, (107), 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 18:11:09,356 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-04-13 18:11:09,357 INFO L93 Difference]: Finished difference Result 15105 states and 56072 transitions. [2025-04-13 18:11:09,357 INFO L140 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 60 states. [2025-04-13 18:11:09,357 INFO L79 Accepts]: Start accepts. Automaton has has 38 states, 37 states have (on average 2.891891891891892) internal successors, (107), 38 states have internal predecessors, (107), 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 47 [2025-04-13 18:11:09,357 INFO L85 Accepts]: Finished accepts. some prefix is accepted. [2025-04-13 18:11:09,405 INFO L225 Difference]: With dead ends: 15105 [2025-04-13 18:11:09,405 INFO L226 Difference]: Without dead ends: 14531 [2025-04-13 18:11:09,409 INFO L436 NwaCegarLoop]: 0 DeclaredPredicates, 160 GetRequests, 70 SyntacticMatches, 0 SemanticMatches, 90 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 2287 ImplicationChecksByTransitivity, 5.3s TimeCoverageRelationStatistics Valid=1225, Invalid=7147, Unknown=0, NotChecked=0, Total=8372 [2025-04-13 18:11:09,409 INFO L437 NwaCegarLoop]: 27 mSDtfsCounter, 2299 mSDsluCounter, 555 mSDsCounter, 0 mSdLazyCounter, 6324 mSolverCounterSat, 50 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 3.9s Time, 0 mProtectedPredicate, 0 mProtectedAction, 2299 SdHoareTripleChecker+Valid, 582 SdHoareTripleChecker+Invalid, 6374 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 50 IncrementalHoareTripleChecker+Valid, 6324 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 4.3s IncrementalHoareTripleChecker+Time [2025-04-13 18:11:09,409 INFO L438 NwaCegarLoop]: SdHoareTripleChecker [2299 Valid, 582 Invalid, 6374 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [50 Valid, 6324 Invalid, 0 Unknown, 0 Unchecked, 4.3s Time] [2025-04-13 18:11:09,419 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 14531 states. [2025-04-13 18:11:11,665 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 14531 to 5738. [2025-04-13 18:11:11,672 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 5738 states, 5737 states have (on average 3.8131427575387833) internal successors, (21876), 5737 states have internal predecessors, (21876), 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 18:11:11,683 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5738 states to 5738 states and 21876 transitions. [2025-04-13 18:11:11,698 INFO L79 Accepts]: Start accepts. Automaton has 5738 states and 21876 transitions. Word has length 47 [2025-04-13 18:11:11,698 INFO L85 Accepts]: Finished accepts. word is rejected. [2025-04-13 18:11:11,698 INFO L485 AbstractCegarLoop]: Abstraction has 5738 states and 21876 transitions. [2025-04-13 18:11:11,699 INFO L486 AbstractCegarLoop]: INTERPOLANT automaton has has 38 states, 37 states have (on average 2.891891891891892) internal successors, (107), 38 states have internal predecessors, (107), 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 18:11:11,699 INFO L278 IsEmpty]: Start isEmpty. Operand 5738 states and 21876 transitions. [2025-04-13 18:11:11,707 INFO L284 IsEmpty]: Finished isEmpty. Found accepting run of length 48 [2025-04-13 18:11:11,707 INFO L210 NwaCegarLoop]: Found error trace [2025-04-13 18:11:11,708 INFO L218 NwaCegarLoop]: trace histogram [3, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-04-13 18:11:11,715 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (40)] Ended with exit code 0 [2025-04-13 18:11:11,908 WARN L466 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable60,40 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-04-13 18:11:11,908 INFO L403 AbstractCegarLoop]: === Iteration 62 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [thread1Err0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES, thread1Err3INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION (and 4 more)] === [2025-04-13 18:11:11,908 INFO L155 PredicateUnifier]: Initialized classic predicate unifier [2025-04-13 18:11:11,908 INFO L85 PathProgramCache]: Analyzing trace with hash -1434910478, now seen corresponding path program 4 times [2025-04-13 18:11:11,908 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-04-13 18:11:11,908 INFO L324 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [128254633] [2025-04-13 18:11:11,909 INFO L95 rtionOrderModulation]: Changing assertion order to TERMS_WITH_SMALL_CONSTANTS_FIRST [2025-04-13 18:11:11,909 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-04-13 18:11:11,914 INFO L108 AnnotateAndAsserter]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST partitioned 47 statements into 2 equivalence classes. [2025-04-13 18:11:11,923 INFO L111 AnnotateAndAsserter]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST issued 2 check-sat command(s) and asserted 47 of 47 statements. [2025-04-13 18:11:11,923 INFO L114 AnnotateAndAsserter]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST issued 2 check-sat command(s) [2025-04-13 18:11:11,923 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-04-13 18:11:12,244 INFO L134 CoverageAnalysis]: Checked inductivity of 12 backedges. 0 proven. 6 refuted. 0 times theorem prover too weak. 6 trivial. 0 not checked. [2025-04-13 18:11:12,244 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-04-13 18:11:12,244 INFO L324 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [128254633] [2025-04-13 18:11:12,244 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [128254633] provided 0 perfect and 1 imperfect interpolant sequences [2025-04-13 18:11:12,244 INFO L324 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1059058171] [2025-04-13 18:11:12,244 INFO L95 rtionOrderModulation]: Changing assertion order to TERMS_WITH_SMALL_CONSTANTS_FIRST [2025-04-13 18:11:12,244 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-04-13 18:11:12,244 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2025-04-13 18:11:12,246 INFO L229 MonitoredProcess]: Starting monitored process 41 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2025-04-13 18:11:12,247 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (41)] Waiting until timeout for monitored process [2025-04-13 18:11:12,331 INFO L108 AnnotateAndAsserter]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST partitioned 47 statements into 2 equivalence classes. [2025-04-13 18:11:12,352 INFO L111 AnnotateAndAsserter]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST issued 2 check-sat command(s) and asserted 47 of 47 statements. [2025-04-13 18:11:12,352 INFO L114 AnnotateAndAsserter]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST issued 2 check-sat command(s) [2025-04-13 18:11:12,352 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-04-13 18:11:12,353 INFO L256 TraceCheckSpWp]: Trace formula consists of 305 conjuncts, 41 conjuncts are in the unsatisfiable core [2025-04-13 18:11:12,354 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-04-13 18:11:12,533 INFO L325 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2025-04-13 18:11:12,533 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 36 treesize of output 12 [2025-04-13 18:11:12,542 INFO L134 CoverageAnalysis]: Checked inductivity of 12 backedges. 0 proven. 6 refuted. 0 times theorem prover too weak. 6 trivial. 0 not checked. [2025-04-13 18:11:12,543 INFO L312 TraceCheckSpWp]: Computing backward predicates... [2025-04-13 18:11:12,698 INFO L325 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2025-04-13 18:11:12,699 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 38 treesize of output 43 [2025-04-13 18:11:12,717 INFO L134 CoverageAnalysis]: Checked inductivity of 12 backedges. 0 proven. 6 refuted. 0 times theorem prover too weak. 6 trivial. 0 not checked. [2025-04-13 18:11:12,717 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1059058171] provided 0 perfect and 2 imperfect interpolant sequences [2025-04-13 18:11:12,717 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2025-04-13 18:11:12,717 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [13, 11, 11] total 27 [2025-04-13 18:11:12,717 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [917936655] [2025-04-13 18:11:12,717 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2025-04-13 18:11:12,717 INFO L562 AbstractCegarLoop]: INTERPOLANT automaton has 28 states [2025-04-13 18:11:12,717 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-04-13 18:11:12,718 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 28 interpolants. [2025-04-13 18:11:12,718 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=74, Invalid=682, Unknown=0, NotChecked=0, Total=756 [2025-04-13 18:11:12,718 INFO L87 Difference]: Start difference. First operand 5738 states and 21876 transitions. Second operand has 28 states, 27 states have (on average 3.3703703703703702) internal successors, (91), 28 states have internal predecessors, (91), 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 18:11:26,698 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-04-13 18:11:26,698 INFO L93 Difference]: Finished difference Result 15084 states and 57818 transitions. [2025-04-13 18:11:26,699 INFO L140 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 39 states. [2025-04-13 18:11:26,699 INFO L79 Accepts]: Start accepts. Automaton has has 28 states, 27 states have (on average 3.3703703703703702) internal successors, (91), 28 states have internal predecessors, (91), 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 47 [2025-04-13 18:11:26,699 INFO L85 Accepts]: Finished accepts. some prefix is accepted. [2025-04-13 18:11:26,747 INFO L225 Difference]: With dead ends: 15084 [2025-04-13 18:11:26,747 INFO L226 Difference]: Without dead ends: 14715 [2025-04-13 18:11:26,751 INFO L436 NwaCegarLoop]: 0 DeclaredPredicates, 139 GetRequests, 79 SyntacticMatches, 0 SemanticMatches, 60 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 870 ImplicationChecksByTransitivity, 1.1s TimeCoverageRelationStatistics Valid=429, Invalid=3353, Unknown=0, NotChecked=0, Total=3782 [2025-04-13 18:11:26,751 INFO L437 NwaCegarLoop]: 25 mSDtfsCounter, 1079 mSDsluCounter, 382 mSDsCounter, 0 mSdLazyCounter, 6699 mSolverCounterSat, 29 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 2.4s Time, 0 mProtectedPredicate, 0 mProtectedAction, 1079 SdHoareTripleChecker+Valid, 407 SdHoareTripleChecker+Invalid, 6728 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 29 IncrementalHoareTripleChecker+Valid, 6699 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 2.9s IncrementalHoareTripleChecker+Time [2025-04-13 18:11:26,751 INFO L438 NwaCegarLoop]: SdHoareTripleChecker [1079 Valid, 407 Invalid, 6728 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [29 Valid, 6699 Invalid, 0 Unknown, 0 Unchecked, 2.9s Time] [2025-04-13 18:11:26,761 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 14715 states. [2025-04-13 18:11:29,616 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 14715 to 6450. [2025-04-13 18:11:29,623 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 6450 states, 6449 states have (on average 3.8672662428283453) internal successors, (24940), 6449 states have internal predecessors, (24940), 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 18:11:29,637 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 6450 states to 6450 states and 24940 transitions. [2025-04-13 18:11:29,651 INFO L79 Accepts]: Start accepts. Automaton has 6450 states and 24940 transitions. Word has length 47 [2025-04-13 18:11:29,651 INFO L85 Accepts]: Finished accepts. word is rejected. [2025-04-13 18:11:29,651 INFO L485 AbstractCegarLoop]: Abstraction has 6450 states and 24940 transitions. [2025-04-13 18:11:29,651 INFO L486 AbstractCegarLoop]: INTERPOLANT automaton has has 28 states, 27 states have (on average 3.3703703703703702) internal successors, (91), 28 states have internal predecessors, (91), 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 18:11:29,651 INFO L278 IsEmpty]: Start isEmpty. Operand 6450 states and 24940 transitions. [2025-04-13 18:11:29,661 INFO L284 IsEmpty]: Finished isEmpty. Found accepting run of length 48 [2025-04-13 18:11:29,661 INFO L210 NwaCegarLoop]: Found error trace [2025-04-13 18:11:29,661 INFO L218 NwaCegarLoop]: trace histogram [3, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-04-13 18:11:29,668 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (41)] Ended with exit code 0 [2025-04-13 18:11:29,862 WARN L466 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 41 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable61 [2025-04-13 18:11:29,862 INFO L403 AbstractCegarLoop]: === Iteration 63 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [thread1Err0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES, thread1Err3INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION (and 4 more)] === [2025-04-13 18:11:29,862 INFO L155 PredicateUnifier]: Initialized classic predicate unifier [2025-04-13 18:11:29,862 INFO L85 PathProgramCache]: Analyzing trace with hash 1669135318, now seen corresponding path program 5 times [2025-04-13 18:11:29,862 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-04-13 18:11:29,862 INFO L324 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1913220221] [2025-04-13 18:11:29,862 INFO L95 rtionOrderModulation]: Changing assertion order to INSIDE_LOOP_FIRST1 [2025-04-13 18:11:29,862 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-04-13 18:11:29,868 INFO L108 AnnotateAndAsserter]: Assert order INSIDE_LOOP_FIRST1 partitioned 47 statements into 3 equivalence classes. [2025-04-13 18:11:29,874 INFO L111 AnnotateAndAsserter]: Assert order INSIDE_LOOP_FIRST1 issued 3 check-sat command(s) and asserted 47 of 47 statements. [2025-04-13 18:11:29,874 INFO L114 AnnotateAndAsserter]: Assert order INSIDE_LOOP_FIRST1 issued 3 check-sat command(s) [2025-04-13 18:11:29,874 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-04-13 18:11:30,214 INFO L134 CoverageAnalysis]: Checked inductivity of 11 backedges. 0 proven. 11 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-04-13 18:11:30,214 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-04-13 18:11:30,214 INFO L324 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1913220221] [2025-04-13 18:11:30,214 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1913220221] provided 0 perfect and 1 imperfect interpolant sequences [2025-04-13 18:11:30,214 INFO L324 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1152327306] [2025-04-13 18:11:30,214 INFO L95 rtionOrderModulation]: Changing assertion order to INSIDE_LOOP_FIRST1 [2025-04-13 18:11:30,214 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-04-13 18:11:30,214 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2025-04-13 18:11:30,216 INFO L229 MonitoredProcess]: Starting monitored process 42 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2025-04-13 18:11:30,216 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (42)] Waiting until timeout for monitored process [2025-04-13 18:11:30,299 INFO L108 AnnotateAndAsserter]: Assert order INSIDE_LOOP_FIRST1 partitioned 47 statements into 3 equivalence classes. [2025-04-13 18:11:30,319 INFO L111 AnnotateAndAsserter]: Assert order INSIDE_LOOP_FIRST1 issued 3 check-sat command(s) and asserted 47 of 47 statements. [2025-04-13 18:11:30,319 INFO L114 AnnotateAndAsserter]: Assert order INSIDE_LOOP_FIRST1 issued 3 check-sat command(s) [2025-04-13 18:11:30,319 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-04-13 18:11:30,320 INFO L256 TraceCheckSpWp]: Trace formula consists of 305 conjuncts, 41 conjuncts are in the unsatisfiable core [2025-04-13 18:11:30,321 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-04-13 18:11:30,446 INFO L325 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2025-04-13 18:11:30,446 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 36 treesize of output 12 [2025-04-13 18:11:30,458 INFO L134 CoverageAnalysis]: Checked inductivity of 11 backedges. 0 proven. 5 refuted. 0 times theorem prover too weak. 6 trivial. 0 not checked. [2025-04-13 18:11:30,458 INFO L312 TraceCheckSpWp]: Computing backward predicates... [2025-04-13 18:11:30,580 INFO L325 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2025-04-13 18:11:30,580 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 38 treesize of output 43 [2025-04-13 18:11:30,602 INFO L134 CoverageAnalysis]: Checked inductivity of 11 backedges. 0 proven. 5 refuted. 0 times theorem prover too weak. 6 trivial. 0 not checked. [2025-04-13 18:11:30,602 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1152327306] provided 0 perfect and 2 imperfect interpolant sequences [2025-04-13 18:11:30,602 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2025-04-13 18:11:30,602 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [14, 11, 11] total 21 [2025-04-13 18:11:30,603 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1502627520] [2025-04-13 18:11:30,603 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2025-04-13 18:11:30,603 INFO L562 AbstractCegarLoop]: INTERPOLANT automaton has 22 states [2025-04-13 18:11:30,603 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-04-13 18:11:30,603 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 22 interpolants. [2025-04-13 18:11:30,603 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=51, Invalid=411, Unknown=0, NotChecked=0, Total=462 [2025-04-13 18:11:30,603 INFO L87 Difference]: Start difference. First operand 6450 states and 24940 transitions. Second operand has 22 states, 21 states have (on average 3.3333333333333335) internal successors, (70), 22 states have internal predecessors, (70), 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 18:11:39,413 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-04-13 18:11:39,413 INFO L93 Difference]: Finished difference Result 11076 states and 42549 transitions. [2025-04-13 18:11:39,414 INFO L140 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 17 states. [2025-04-13 18:11:39,414 INFO L79 Accepts]: Start accepts. Automaton has has 22 states, 21 states have (on average 3.3333333333333335) internal successors, (70), 22 states have internal predecessors, (70), 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 47 [2025-04-13 18:11:39,414 INFO L85 Accepts]: Finished accepts. some prefix is accepted. [2025-04-13 18:11:39,450 INFO L225 Difference]: With dead ends: 11076 [2025-04-13 18:11:39,450 INFO L226 Difference]: Without dead ends: 10855 [2025-04-13 18:11:39,453 INFO L436 NwaCegarLoop]: 0 DeclaredPredicates, 112 GetRequests, 87 SyntacticMatches, 0 SemanticMatches, 25 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 54 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=73, Invalid=629, Unknown=0, NotChecked=0, Total=702 [2025-04-13 18:11:39,453 INFO L437 NwaCegarLoop]: 14 mSDtfsCounter, 315 mSDsluCounter, 222 mSDsCounter, 0 mSdLazyCounter, 4205 mSolverCounterSat, 2 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 1.3s Time, 0 mProtectedPredicate, 0 mProtectedAction, 315 SdHoareTripleChecker+Valid, 236 SdHoareTripleChecker+Invalid, 4207 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 2 IncrementalHoareTripleChecker+Valid, 4205 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 1.5s IncrementalHoareTripleChecker+Time [2025-04-13 18:11:39,453 INFO L438 NwaCegarLoop]: SdHoareTripleChecker [315 Valid, 236 Invalid, 4207 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [2 Valid, 4205 Invalid, 0 Unknown, 0 Unchecked, 1.5s Time] [2025-04-13 18:11:39,460 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 10855 states. [2025-04-13 18:11:42,340 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 10855 to 6450. [2025-04-13 18:11:42,346 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 6450 states, 6449 states have (on average 3.8672662428283453) internal successors, (24940), 6449 states have internal predecessors, (24940), 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 18:11:42,359 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 6450 states to 6450 states and 24940 transitions. [2025-04-13 18:11:42,372 INFO L79 Accepts]: Start accepts. Automaton has 6450 states and 24940 transitions. Word has length 47 [2025-04-13 18:11:42,372 INFO L85 Accepts]: Finished accepts. word is rejected. [2025-04-13 18:11:42,372 INFO L485 AbstractCegarLoop]: Abstraction has 6450 states and 24940 transitions. [2025-04-13 18:11:42,373 INFO L486 AbstractCegarLoop]: INTERPOLANT automaton has has 22 states, 21 states have (on average 3.3333333333333335) internal successors, (70), 22 states have internal predecessors, (70), 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 18:11:42,373 INFO L278 IsEmpty]: Start isEmpty. Operand 6450 states and 24940 transitions. [2025-04-13 18:11:42,382 INFO L284 IsEmpty]: Finished isEmpty. Found accepting run of length 48 [2025-04-13 18:11:42,382 INFO L210 NwaCegarLoop]: Found error trace [2025-04-13 18:11:42,382 INFO L218 NwaCegarLoop]: trace histogram [3, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-04-13 18:11:42,389 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (42)] Ended with exit code 0 [2025-04-13 18:11:42,582 WARN L466 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable62,42 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-04-13 18:11:42,583 INFO L403 AbstractCegarLoop]: === Iteration 64 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [thread1Err0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES, thread1Err3INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION (and 4 more)] === [2025-04-13 18:11:42,583 INFO L155 PredicateUnifier]: Initialized classic predicate unifier [2025-04-13 18:11:42,583 INFO L85 PathProgramCache]: Analyzing trace with hash -972738194, now seen corresponding path program 6 times [2025-04-13 18:11:42,583 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-04-13 18:11:42,583 INFO L324 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1728076277] [2025-04-13 18:11:42,583 INFO L95 rtionOrderModulation]: Changing assertion order to MIX_INSIDE_OUTSIDE [2025-04-13 18:11:42,583 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-04-13 18:11:42,589 INFO L108 AnnotateAndAsserter]: Assert order MIX_INSIDE_OUTSIDE partitioned 47 statements into 3 equivalence classes. [2025-04-13 18:11:42,596 INFO L111 AnnotateAndAsserter]: Assert order MIX_INSIDE_OUTSIDE issued 3 check-sat command(s) and asserted 47 of 47 statements. [2025-04-13 18:11:42,596 INFO L114 AnnotateAndAsserter]: Assert order MIX_INSIDE_OUTSIDE issued 3 check-sat command(s) [2025-04-13 18:11:42,596 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-04-13 18:11:42,993 INFO L134 CoverageAnalysis]: Checked inductivity of 11 backedges. 0 proven. 11 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-04-13 18:11:42,993 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-04-13 18:11:42,993 INFO L324 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1728076277] [2025-04-13 18:11:42,994 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1728076277] provided 0 perfect and 1 imperfect interpolant sequences [2025-04-13 18:11:42,994 INFO L324 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1402856585] [2025-04-13 18:11:42,994 INFO L95 rtionOrderModulation]: Changing assertion order to MIX_INSIDE_OUTSIDE [2025-04-13 18:11:42,994 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-04-13 18:11:42,994 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2025-04-13 18:11:42,995 INFO L229 MonitoredProcess]: Starting monitored process 43 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2025-04-13 18:11:42,996 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (43)] Waiting until timeout for monitored process [2025-04-13 18:11:43,079 INFO L108 AnnotateAndAsserter]: Assert order MIX_INSIDE_OUTSIDE partitioned 47 statements into 3 equivalence classes. [2025-04-13 18:11:43,100 INFO L111 AnnotateAndAsserter]: Assert order MIX_INSIDE_OUTSIDE issued 3 check-sat command(s) and asserted 47 of 47 statements. [2025-04-13 18:11:43,101 INFO L114 AnnotateAndAsserter]: Assert order MIX_INSIDE_OUTSIDE issued 3 check-sat command(s) [2025-04-13 18:11:43,101 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-04-13 18:11:43,102 INFO L256 TraceCheckSpWp]: Trace formula consists of 305 conjuncts, 60 conjuncts are in the unsatisfiable core [2025-04-13 18:11:43,103 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-04-13 18:11:43,110 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 18:11:43,372 INFO L325 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2025-04-13 18:11:43,372 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 28 treesize of output 12 [2025-04-13 18:11:43,383 INFO L134 CoverageAnalysis]: Checked inductivity of 11 backedges. 0 proven. 11 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-04-13 18:11:43,383 INFO L312 TraceCheckSpWp]: Computing backward predicates... [2025-04-13 18:11:44,357 INFO L134 CoverageAnalysis]: Checked inductivity of 11 backedges. 0 proven. 5 refuted. 0 times theorem prover too weak. 6 trivial. 0 not checked. [2025-04-13 18:11:44,357 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1402856585] provided 0 perfect and 2 imperfect interpolant sequences [2025-04-13 18:11:44,357 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2025-04-13 18:11:44,358 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [16, 16, 12] total 31 [2025-04-13 18:11:44,358 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1108645343] [2025-04-13 18:11:44,358 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2025-04-13 18:11:44,358 INFO L562 AbstractCegarLoop]: INTERPOLANT automaton has 32 states [2025-04-13 18:11:44,358 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-04-13 18:11:44,358 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 32 interpolants. [2025-04-13 18:11:44,358 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=111, Invalid=879, Unknown=2, NotChecked=0, Total=992 [2025-04-13 18:11:44,358 INFO L87 Difference]: Start difference. First operand 6450 states and 24940 transitions. Second operand has 32 states, 31 states have (on average 3.161290322580645) internal successors, (98), 32 states have internal predecessors, (98), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-04-13 18:11:57,340 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-04-13 18:11:57,340 INFO L93 Difference]: Finished difference Result 13470 states and 50849 transitions. [2025-04-13 18:11:57,340 INFO L140 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 50 states. [2025-04-13 18:11:57,340 INFO L79 Accepts]: Start accepts. Automaton has has 32 states, 31 states have (on average 3.161290322580645) internal successors, (98), 32 states have internal predecessors, (98), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 47 [2025-04-13 18:11:57,340 INFO L85 Accepts]: Finished accepts. some prefix is accepted. [2025-04-13 18:11:57,382 INFO L225 Difference]: With dead ends: 13470 [2025-04-13 18:11:57,382 INFO L226 Difference]: Without dead ends: 13183 [2025-04-13 18:11:57,385 INFO L436 NwaCegarLoop]: 0 DeclaredPredicates, 151 GetRequests, 79 SyntacticMatches, 0 SemanticMatches, 72 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1103 ImplicationChecksByTransitivity, 2.1s TimeCoverageRelationStatistics Valid=601, Invalid=4799, Unknown=2, NotChecked=0, Total=5402 [2025-04-13 18:11:57,386 INFO L437 NwaCegarLoop]: 30 mSDtfsCounter, 987 mSDsluCounter, 527 mSDsCounter, 0 mSdLazyCounter, 8019 mSolverCounterSat, 13 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 2.9s Time, 0 mProtectedPredicate, 0 mProtectedAction, 987 SdHoareTripleChecker+Valid, 557 SdHoareTripleChecker+Invalid, 8032 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 13 IncrementalHoareTripleChecker+Valid, 8019 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 3.4s IncrementalHoareTripleChecker+Time [2025-04-13 18:11:57,386 INFO L438 NwaCegarLoop]: SdHoareTripleChecker [987 Valid, 557 Invalid, 8032 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [13 Valid, 8019 Invalid, 0 Unknown, 0 Unchecked, 3.4s Time] [2025-04-13 18:11:57,395 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 13183 states. [2025-04-13 18:12:00,431 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 13183 to 6554. [2025-04-13 18:12:00,438 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 6554 states, 6553 states have (on average 3.87120402868915) internal successors, (25368), 6553 states have internal predecessors, (25368), 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 18:12:00,451 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 6554 states to 6554 states and 25368 transitions. [2025-04-13 18:12:00,465 INFO L79 Accepts]: Start accepts. Automaton has 6554 states and 25368 transitions. Word has length 47 [2025-04-13 18:12:00,465 INFO L85 Accepts]: Finished accepts. word is rejected. [2025-04-13 18:12:00,465 INFO L485 AbstractCegarLoop]: Abstraction has 6554 states and 25368 transitions. [2025-04-13 18:12:00,465 INFO L486 AbstractCegarLoop]: INTERPOLANT automaton has has 32 states, 31 states have (on average 3.161290322580645) internal successors, (98), 32 states have internal predecessors, (98), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-04-13 18:12:00,465 INFO L278 IsEmpty]: Start isEmpty. Operand 6554 states and 25368 transitions. [2025-04-13 18:12:00,475 INFO L284 IsEmpty]: Finished isEmpty. Found accepting run of length 48 [2025-04-13 18:12:00,475 INFO L210 NwaCegarLoop]: Found error trace [2025-04-13 18:12:00,475 INFO L218 NwaCegarLoop]: trace histogram [3, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-04-13 18:12:00,482 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (43)] Ended with exit code 0 [2025-04-13 18:12:00,676 WARN L466 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable63,43 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-04-13 18:12:00,676 INFO L403 AbstractCegarLoop]: === Iteration 65 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [thread1Err0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES, thread1Err3INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION (and 4 more)] === [2025-04-13 18:12:00,676 INFO L155 PredicateUnifier]: Initialized classic predicate unifier [2025-04-13 18:12:00,676 INFO L85 PathProgramCache]: Analyzing trace with hash -1917698043, now seen corresponding path program 23 times [2025-04-13 18:12:00,676 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-04-13 18:12:00,676 INFO L324 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1863682366] [2025-04-13 18:12:00,676 INFO L95 rtionOrderModulation]: Changing assertion order to INSIDE_LOOP_FIRST1 [2025-04-13 18:12:00,676 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-04-13 18:12:00,682 INFO L108 AnnotateAndAsserter]: Assert order INSIDE_LOOP_FIRST1 partitioned 47 statements into 3 equivalence classes. [2025-04-13 18:12:00,687 INFO L111 AnnotateAndAsserter]: Assert order INSIDE_LOOP_FIRST1 issued 3 check-sat command(s) and asserted 47 of 47 statements. [2025-04-13 18:12:00,687 INFO L114 AnnotateAndAsserter]: Assert order INSIDE_LOOP_FIRST1 issued 3 check-sat command(s) [2025-04-13 18:12:00,687 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-04-13 18:12:00,970 INFO L134 CoverageAnalysis]: Checked inductivity of 16 backedges. 0 proven. 15 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2025-04-13 18:12:00,971 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-04-13 18:12:00,971 INFO L324 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1863682366] [2025-04-13 18:12:00,971 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1863682366] provided 0 perfect and 1 imperfect interpolant sequences [2025-04-13 18:12:00,971 INFO L324 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [93352092] [2025-04-13 18:12:00,971 INFO L95 rtionOrderModulation]: Changing assertion order to INSIDE_LOOP_FIRST1 [2025-04-13 18:12:00,971 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-04-13 18:12:00,971 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2025-04-13 18:12:00,973 INFO L229 MonitoredProcess]: Starting monitored process 44 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2025-04-13 18:12:00,973 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (44)] Waiting until timeout for monitored process [2025-04-13 18:12:01,057 INFO L108 AnnotateAndAsserter]: Assert order INSIDE_LOOP_FIRST1 partitioned 47 statements into 3 equivalence classes. [2025-04-13 18:12:01,082 INFO L111 AnnotateAndAsserter]: Assert order INSIDE_LOOP_FIRST1 issued 3 check-sat command(s) and asserted 47 of 47 statements. [2025-04-13 18:12:01,082 INFO L114 AnnotateAndAsserter]: Assert order INSIDE_LOOP_FIRST1 issued 3 check-sat command(s) [2025-04-13 18:12:01,082 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-04-13 18:12:01,083 INFO L256 TraceCheckSpWp]: Trace formula consists of 305 conjuncts, 47 conjuncts are in the unsatisfiable core [2025-04-13 18:12:01,084 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-04-13 18:12:01,217 INFO L325 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2025-04-13 18:12:01,218 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 36 treesize of output 12 [2025-04-13 18:12:01,226 INFO L134 CoverageAnalysis]: Checked inductivity of 16 backedges. 0 proven. 10 refuted. 0 times theorem prover too weak. 6 trivial. 0 not checked. [2025-04-13 18:12:01,227 INFO L312 TraceCheckSpWp]: Computing backward predicates... [2025-04-13 18:12:01,328 INFO L325 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2025-04-13 18:12:01,328 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 38 treesize of output 43 [2025-04-13 18:12:01,349 INFO L134 CoverageAnalysis]: Checked inductivity of 16 backedges. 0 proven. 10 refuted. 0 times theorem prover too weak. 6 trivial. 0 not checked. [2025-04-13 18:12:01,349 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [93352092] provided 0 perfect and 2 imperfect interpolant sequences [2025-04-13 18:12:01,349 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2025-04-13 18:12:01,349 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [14, 11, 11] total 21 [2025-04-13 18:12:01,349 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [886621758] [2025-04-13 18:12:01,349 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2025-04-13 18:12:01,350 INFO L562 AbstractCegarLoop]: INTERPOLANT automaton has 22 states [2025-04-13 18:12:01,350 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-04-13 18:12:01,350 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 22 interpolants. [2025-04-13 18:12:01,350 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=53, Invalid=409, Unknown=0, NotChecked=0, Total=462 [2025-04-13 18:12:01,350 INFO L87 Difference]: Start difference. First operand 6554 states and 25368 transitions. Second operand has 22 states, 21 states have (on average 3.380952380952381) internal successors, (71), 22 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 18:12:11,716 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-04-13 18:12:11,716 INFO L93 Difference]: Finished difference Result 12102 states and 46576 transitions. [2025-04-13 18:12:11,717 INFO L140 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 28 states. [2025-04-13 18:12:11,717 INFO L79 Accepts]: Start accepts. Automaton has has 22 states, 21 states have (on average 3.380952380952381) internal successors, (71), 22 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 47 [2025-04-13 18:12:11,717 INFO L85 Accepts]: Finished accepts. some prefix is accepted. [2025-04-13 18:12:11,756 INFO L225 Difference]: With dead ends: 12102 [2025-04-13 18:12:11,756 INFO L226 Difference]: Without dead ends: 11851 [2025-04-13 18:12:11,759 INFO L436 NwaCegarLoop]: 0 DeclaredPredicates, 122 GetRequests, 87 SyntacticMatches, 0 SemanticMatches, 35 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 179 ImplicationChecksByTransitivity, 0.4s TimeCoverageRelationStatistics Valid=133, Invalid=1199, Unknown=0, NotChecked=0, Total=1332 [2025-04-13 18:12:11,760 INFO L437 NwaCegarLoop]: 21 mSDtfsCounter, 526 mSDsluCounter, 326 mSDsCounter, 0 mSdLazyCounter, 5118 mSolverCounterSat, 4 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 1.6s Time, 0 mProtectedPredicate, 0 mProtectedAction, 526 SdHoareTripleChecker+Valid, 347 SdHoareTripleChecker+Invalid, 5122 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 4 IncrementalHoareTripleChecker+Valid, 5118 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 1.9s IncrementalHoareTripleChecker+Time [2025-04-13 18:12:11,760 INFO L438 NwaCegarLoop]: SdHoareTripleChecker [526 Valid, 347 Invalid, 5122 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [4 Valid, 5118 Invalid, 0 Unknown, 0 Unchecked, 1.9s Time] [2025-04-13 18:12:11,768 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 11851 states. [2025-04-13 18:12:14,854 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 11851 to 6634. [2025-04-13 18:12:14,862 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 6634 states, 6633 states have (on average 3.8600934720337707) internal successors, (25604), 6633 states have internal predecessors, (25604), 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 18:12:14,877 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 6634 states to 6634 states and 25604 transitions. [2025-04-13 18:12:14,891 INFO L79 Accepts]: Start accepts. Automaton has 6634 states and 25604 transitions. Word has length 47 [2025-04-13 18:12:14,892 INFO L85 Accepts]: Finished accepts. word is rejected. [2025-04-13 18:12:14,892 INFO L485 AbstractCegarLoop]: Abstraction has 6634 states and 25604 transitions. [2025-04-13 18:12:14,892 INFO L486 AbstractCegarLoop]: INTERPOLANT automaton has has 22 states, 21 states have (on average 3.380952380952381) internal successors, (71), 22 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 18:12:14,892 INFO L278 IsEmpty]: Start isEmpty. Operand 6634 states and 25604 transitions. [2025-04-13 18:12:14,902 INFO L284 IsEmpty]: Finished isEmpty. Found accepting run of length 48 [2025-04-13 18:12:14,903 INFO L210 NwaCegarLoop]: Found error trace [2025-04-13 18:12:14,903 INFO L218 NwaCegarLoop]: trace histogram [3, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-04-13 18:12:14,910 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (44)] Forceful destruction successful, exit code 0 [2025-04-13 18:12:15,103 WARN L466 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 44 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable64 [2025-04-13 18:12:15,103 INFO L403 AbstractCegarLoop]: === Iteration 66 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [thread1Err0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES, thread1Err3INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION (and 4 more)] === [2025-04-13 18:12:15,103 INFO L155 PredicateUnifier]: Initialized classic predicate unifier [2025-04-13 18:12:15,104 INFO L85 PathProgramCache]: Analyzing trace with hash -2091156401, now seen corresponding path program 28 times [2025-04-13 18:12:15,104 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-04-13 18:12:15,104 INFO L324 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1340803811] [2025-04-13 18:12:15,104 INFO L95 rtionOrderModulation]: Changing assertion order to TERMS_WITH_SMALL_CONSTANTS_FIRST [2025-04-13 18:12:15,104 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-04-13 18:12:15,110 INFO L108 AnnotateAndAsserter]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST partitioned 47 statements into 2 equivalence classes. [2025-04-13 18:12:15,119 INFO L111 AnnotateAndAsserter]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST issued 2 check-sat command(s) and asserted 47 of 47 statements. [2025-04-13 18:12:15,119 INFO L114 AnnotateAndAsserter]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST issued 2 check-sat command(s) [2025-04-13 18:12:15,119 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-04-13 18:12:15,401 INFO L134 CoverageAnalysis]: Checked inductivity of 14 backedges. 0 proven. 8 refuted. 0 times theorem prover too weak. 6 trivial. 0 not checked. [2025-04-13 18:12:15,401 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-04-13 18:12:15,401 INFO L324 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1340803811] [2025-04-13 18:12:15,401 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1340803811] provided 0 perfect and 1 imperfect interpolant sequences [2025-04-13 18:12:15,401 INFO L324 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [359271407] [2025-04-13 18:12:15,401 INFO L95 rtionOrderModulation]: Changing assertion order to TERMS_WITH_SMALL_CONSTANTS_FIRST [2025-04-13 18:12:15,401 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-04-13 18:12:15,401 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2025-04-13 18:12:15,403 INFO L229 MonitoredProcess]: Starting monitored process 45 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2025-04-13 18:12:15,403 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (45)] Waiting until timeout for monitored process [2025-04-13 18:12:15,486 INFO L108 AnnotateAndAsserter]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST partitioned 47 statements into 2 equivalence classes. [2025-04-13 18:12:15,506 INFO L111 AnnotateAndAsserter]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST issued 2 check-sat command(s) and asserted 47 of 47 statements. [2025-04-13 18:12:15,506 INFO L114 AnnotateAndAsserter]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST issued 2 check-sat command(s) [2025-04-13 18:12:15,506 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-04-13 18:12:15,507 INFO L256 TraceCheckSpWp]: Trace formula consists of 305 conjuncts, 41 conjuncts are in the unsatisfiable core [2025-04-13 18:12:15,508 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-04-13 18:12:15,683 INFO L325 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2025-04-13 18:12:15,683 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 36 treesize of output 12 [2025-04-13 18:12:15,705 INFO L134 CoverageAnalysis]: Checked inductivity of 14 backedges. 0 proven. 8 refuted. 0 times theorem prover too weak. 6 trivial. 0 not checked. [2025-04-13 18:12:15,705 INFO L312 TraceCheckSpWp]: Computing backward predicates... [2025-04-13 18:12:15,879 INFO L325 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2025-04-13 18:12:15,879 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 38 treesize of output 43 [2025-04-13 18:12:15,902 INFO L134 CoverageAnalysis]: Checked inductivity of 14 backedges. 0 proven. 8 refuted. 0 times theorem prover too weak. 6 trivial. 0 not checked. [2025-04-13 18:12:15,903 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [359271407] provided 0 perfect and 2 imperfect interpolant sequences [2025-04-13 18:12:15,903 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2025-04-13 18:12:15,903 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [13, 11, 11] total 28 [2025-04-13 18:12:15,903 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [693474317] [2025-04-13 18:12:15,903 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2025-04-13 18:12:15,903 INFO L562 AbstractCegarLoop]: INTERPOLANT automaton has 29 states [2025-04-13 18:12:15,903 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-04-13 18:12:15,903 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 29 interpolants. [2025-04-13 18:12:15,903 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=84, Invalid=728, Unknown=0, NotChecked=0, Total=812 [2025-04-13 18:12:15,903 INFO L87 Difference]: Start difference. First operand 6634 states and 25604 transitions. Second operand has 29 states, 28 states have (on average 3.25) internal successors, (91), 29 states have internal predecessors, (91), 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 18:12:33,204 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-04-13 18:12:33,204 INFO L93 Difference]: Finished difference Result 17434 states and 66772 transitions. [2025-04-13 18:12:33,204 INFO L140 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 46 states. [2025-04-13 18:12:33,204 INFO L79 Accepts]: Start accepts. Automaton has has 29 states, 28 states have (on average 3.25) internal successors, (91), 29 states have internal predecessors, (91), 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 47 [2025-04-13 18:12:33,204 INFO L85 Accepts]: Finished accepts. some prefix is accepted. [2025-04-13 18:12:33,261 INFO L225 Difference]: With dead ends: 17434 [2025-04-13 18:12:33,261 INFO L226 Difference]: Without dead ends: 16885 [2025-04-13 18:12:33,265 INFO L436 NwaCegarLoop]: 0 DeclaredPredicates, 146 GetRequests, 78 SyntacticMatches, 0 SemanticMatches, 68 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1211 ImplicationChecksByTransitivity, 1.4s TimeCoverageRelationStatistics Valid=577, Invalid=4253, Unknown=0, NotChecked=0, Total=4830 [2025-04-13 18:12:33,266 INFO L437 NwaCegarLoop]: 30 mSDtfsCounter, 1322 mSDsluCounter, 466 mSDsCounter, 0 mSdLazyCounter, 7043 mSolverCounterSat, 58 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 2.6s Time, 0 mProtectedPredicate, 0 mProtectedAction, 1322 SdHoareTripleChecker+Valid, 496 SdHoareTripleChecker+Invalid, 7101 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 58 IncrementalHoareTripleChecker+Valid, 7043 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 3.0s IncrementalHoareTripleChecker+Time [2025-04-13 18:12:33,266 INFO L438 NwaCegarLoop]: SdHoareTripleChecker [1322 Valid, 496 Invalid, 7101 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [58 Valid, 7043 Invalid, 0 Unknown, 0 Unchecked, 3.0s Time] [2025-04-13 18:12:33,277 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 16885 states. [2025-04-13 18:12:36,659 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 16885 to 6902. [2025-04-13 18:12:36,669 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 6902 states, 6901 states have (on average 3.8719026228082885) internal successors, (26720), 6901 states have internal predecessors, (26720), 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 18:12:36,684 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 6902 states to 6902 states and 26720 transitions. [2025-04-13 18:12:36,701 INFO L79 Accepts]: Start accepts. Automaton has 6902 states and 26720 transitions. Word has length 47 [2025-04-13 18:12:36,701 INFO L85 Accepts]: Finished accepts. word is rejected. [2025-04-13 18:12:36,701 INFO L485 AbstractCegarLoop]: Abstraction has 6902 states and 26720 transitions. [2025-04-13 18:12:36,702 INFO L486 AbstractCegarLoop]: INTERPOLANT automaton has has 29 states, 28 states have (on average 3.25) internal successors, (91), 29 states have internal predecessors, (91), 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 18:12:36,702 INFO L278 IsEmpty]: Start isEmpty. Operand 6902 states and 26720 transitions. [2025-04-13 18:12:36,712 INFO L284 IsEmpty]: Finished isEmpty. Found accepting run of length 48 [2025-04-13 18:12:36,712 INFO L210 NwaCegarLoop]: Found error trace [2025-04-13 18:12:36,712 INFO L218 NwaCegarLoop]: trace histogram [3, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-04-13 18:12:36,719 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (45)] Ended with exit code 0 [2025-04-13 18:12:36,913 WARN L466 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable65,45 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-04-13 18:12:36,913 INFO L403 AbstractCegarLoop]: === Iteration 67 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [thread1Err0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES, thread1Err3INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION (and 4 more)] === [2025-04-13 18:12:36,913 INFO L155 PredicateUnifier]: Initialized classic predicate unifier [2025-04-13 18:12:36,913 INFO L85 PathProgramCache]: Analyzing trace with hash 1317041280, now seen corresponding path program 7 times [2025-04-13 18:12:36,913 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-04-13 18:12:36,913 INFO L324 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2020796848] [2025-04-13 18:12:36,913 INFO L95 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2025-04-13 18:12:36,913 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-04-13 18:12:36,919 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 47 statements into 1 equivalence classes. [2025-04-13 18:12:36,926 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 47 of 47 statements. [2025-04-13 18:12:36,927 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-04-13 18:12:36,927 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-04-13 18:12:37,453 INFO L134 CoverageAnalysis]: Checked inductivity of 11 backedges. 0 proven. 11 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-04-13 18:12:37,453 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-04-13 18:12:37,453 INFO L324 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2020796848] [2025-04-13 18:12:37,453 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [2020796848] provided 0 perfect and 1 imperfect interpolant sequences [2025-04-13 18:12:37,453 INFO L324 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1353804645] [2025-04-13 18:12:37,453 INFO L95 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2025-04-13 18:12:37,453 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-04-13 18:12:37,453 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2025-04-13 18:12:37,455 INFO L229 MonitoredProcess]: Starting monitored process 46 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2025-04-13 18:12:37,455 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (46)] Waiting until timeout for monitored process [2025-04-13 18:12:37,543 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 47 statements into 1 equivalence classes. [2025-04-13 18:12:37,562 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 47 of 47 statements. [2025-04-13 18:12:37,562 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-04-13 18:12:37,563 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-04-13 18:12:37,564 INFO L256 TraceCheckSpWp]: Trace formula consists of 305 conjuncts, 41 conjuncts are in the unsatisfiable core [2025-04-13 18:12:37,565 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-04-13 18:12:37,746 INFO L325 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2025-04-13 18:12:37,747 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 36 treesize of output 12 [2025-04-13 18:12:37,759 INFO L134 CoverageAnalysis]: Checked inductivity of 11 backedges. 0 proven. 5 refuted. 0 times theorem prover too weak. 6 trivial. 0 not checked. [2025-04-13 18:12:37,759 INFO L312 TraceCheckSpWp]: Computing backward predicates... [2025-04-13 18:12:37,919 INFO L325 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2025-04-13 18:12:37,919 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 38 treesize of output 43 [2025-04-13 18:12:37,942 INFO L134 CoverageAnalysis]: Checked inductivity of 11 backedges. 0 proven. 5 refuted. 0 times theorem prover too weak. 6 trivial. 0 not checked. [2025-04-13 18:12:37,943 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1353804645] provided 0 perfect and 2 imperfect interpolant sequences [2025-04-13 18:12:37,943 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2025-04-13 18:12:37,943 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [16, 11, 11] total 30 [2025-04-13 18:12:37,943 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1032059469] [2025-04-13 18:12:37,943 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2025-04-13 18:12:37,943 INFO L562 AbstractCegarLoop]: INTERPOLANT automaton has 31 states [2025-04-13 18:12:37,943 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-04-13 18:12:37,943 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 31 interpolants. [2025-04-13 18:12:37,943 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=86, Invalid=844, Unknown=0, NotChecked=0, Total=930 [2025-04-13 18:12:37,944 INFO L87 Difference]: Start difference. First operand 6902 states and 26720 transitions. Second operand has 31 states, 30 states have (on average 3.2666666666666666) internal successors, (98), 31 states have internal predecessors, (98), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-04-13 18:12:48,302 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-04-13 18:12:48,302 INFO L93 Difference]: Finished difference Result 11612 states and 44789 transitions. [2025-04-13 18:12:48,302 INFO L140 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 19 states. [2025-04-13 18:12:48,303 INFO L79 Accepts]: Start accepts. Automaton has has 31 states, 30 states have (on average 3.2666666666666666) internal successors, (98), 31 states have internal predecessors, (98), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 47 [2025-04-13 18:12:48,303 INFO L85 Accepts]: Finished accepts. some prefix is accepted. [2025-04-13 18:12:48,344 INFO L225 Difference]: With dead ends: 11612 [2025-04-13 18:12:48,344 INFO L226 Difference]: Without dead ends: 11385 [2025-04-13 18:12:48,346 INFO L436 NwaCegarLoop]: 0 DeclaredPredicates, 121 GetRequests, 79 SyntacticMatches, 0 SemanticMatches, 42 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 281 ImplicationChecksByTransitivity, 0.6s TimeCoverageRelationStatistics Valid=193, Invalid=1699, Unknown=0, NotChecked=0, Total=1892 [2025-04-13 18:12:48,347 INFO L437 NwaCegarLoop]: 14 mSDtfsCounter, 686 mSDsluCounter, 238 mSDsCounter, 0 mSdLazyCounter, 4694 mSolverCounterSat, 4 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 1.5s Time, 0 mProtectedPredicate, 0 mProtectedAction, 686 SdHoareTripleChecker+Valid, 252 SdHoareTripleChecker+Invalid, 4698 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 4 IncrementalHoareTripleChecker+Valid, 4694 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 1.7s IncrementalHoareTripleChecker+Time [2025-04-13 18:12:48,347 INFO L438 NwaCegarLoop]: SdHoareTripleChecker [686 Valid, 252 Invalid, 4698 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [4 Valid, 4694 Invalid, 0 Unknown, 0 Unchecked, 1.7s Time] [2025-04-13 18:12:48,356 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 11385 states. [2025-04-13 18:12:51,735 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 11385 to 6886. [2025-04-13 18:12:51,743 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 6886 states, 6885 states have (on average 3.871604938271605) internal successors, (26656), 6885 states have internal predecessors, (26656), 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 18:12:51,757 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 6886 states to 6886 states and 26656 transitions. [2025-04-13 18:12:51,774 INFO L79 Accepts]: Start accepts. Automaton has 6886 states and 26656 transitions. Word has length 47 [2025-04-13 18:12:51,774 INFO L85 Accepts]: Finished accepts. word is rejected. [2025-04-13 18:12:51,774 INFO L485 AbstractCegarLoop]: Abstraction has 6886 states and 26656 transitions. [2025-04-13 18:12:51,774 INFO L486 AbstractCegarLoop]: INTERPOLANT automaton has has 31 states, 30 states have (on average 3.2666666666666666) internal successors, (98), 31 states have internal predecessors, (98), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-04-13 18:12:51,774 INFO L278 IsEmpty]: Start isEmpty. Operand 6886 states and 26656 transitions. [2025-04-13 18:12:51,785 INFO L284 IsEmpty]: Finished isEmpty. Found accepting run of length 48 [2025-04-13 18:12:51,785 INFO L210 NwaCegarLoop]: Found error trace [2025-04-13 18:12:51,785 INFO L218 NwaCegarLoop]: trace histogram [3, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-04-13 18:12:51,792 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (46)] Ended with exit code 0 [2025-04-13 18:12:51,986 WARN L466 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 46 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable66 [2025-04-13 18:12:51,986 INFO L403 AbstractCegarLoop]: === Iteration 68 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [thread1Err0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES, thread1Err3INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION (and 4 more)] === [2025-04-13 18:12:51,986 INFO L155 PredicateUnifier]: Initialized classic predicate unifier [2025-04-13 18:12:51,986 INFO L85 PathProgramCache]: Analyzing trace with hash -321071179, now seen corresponding path program 29 times [2025-04-13 18:12:51,986 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-04-13 18:12:51,986 INFO L324 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [775758390] [2025-04-13 18:12:51,986 INFO L95 rtionOrderModulation]: Changing assertion order to INSIDE_LOOP_FIRST1 [2025-04-13 18:12:51,986 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-04-13 18:12:51,992 INFO L108 AnnotateAndAsserter]: Assert order INSIDE_LOOP_FIRST1 partitioned 47 statements into 3 equivalence classes. [2025-04-13 18:12:51,998 INFO L111 AnnotateAndAsserter]: Assert order INSIDE_LOOP_FIRST1 issued 3 check-sat command(s) and asserted 47 of 47 statements. [2025-04-13 18:12:51,998 INFO L114 AnnotateAndAsserter]: Assert order INSIDE_LOOP_FIRST1 issued 3 check-sat command(s) [2025-04-13 18:12:51,998 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-04-13 18:12:52,335 INFO L134 CoverageAnalysis]: Checked inductivity of 12 backedges. 0 proven. 12 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-04-13 18:12:52,335 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-04-13 18:12:52,335 INFO L324 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [775758390] [2025-04-13 18:12:52,335 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [775758390] provided 0 perfect and 1 imperfect interpolant sequences [2025-04-13 18:12:52,335 INFO L324 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1187469588] [2025-04-13 18:12:52,335 INFO L95 rtionOrderModulation]: Changing assertion order to INSIDE_LOOP_FIRST1 [2025-04-13 18:12:52,335 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-04-13 18:12:52,336 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2025-04-13 18:12:52,338 INFO L229 MonitoredProcess]: Starting monitored process 47 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2025-04-13 18:12:52,339 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (47)] Waiting until timeout for monitored process [2025-04-13 18:12:52,425 INFO L108 AnnotateAndAsserter]: Assert order INSIDE_LOOP_FIRST1 partitioned 47 statements into 3 equivalence classes. [2025-04-13 18:12:52,447 INFO L111 AnnotateAndAsserter]: Assert order INSIDE_LOOP_FIRST1 issued 3 check-sat command(s) and asserted 47 of 47 statements. [2025-04-13 18:12:52,447 INFO L114 AnnotateAndAsserter]: Assert order INSIDE_LOOP_FIRST1 issued 3 check-sat command(s) [2025-04-13 18:12:52,447 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-04-13 18:12:52,448 INFO L256 TraceCheckSpWp]: Trace formula consists of 305 conjuncts, 43 conjuncts are in the unsatisfiable core [2025-04-13 18:12:52,449 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-04-13 18:12:52,612 INFO L325 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2025-04-13 18:12:52,612 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 36 treesize of output 12 [2025-04-13 18:12:52,628 INFO L134 CoverageAnalysis]: Checked inductivity of 12 backedges. 0 proven. 6 refuted. 0 times theorem prover too weak. 6 trivial. 0 not checked. [2025-04-13 18:12:52,628 INFO L312 TraceCheckSpWp]: Computing backward predicates... [2025-04-13 18:12:52,775 INFO L325 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2025-04-13 18:12:52,776 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 38 treesize of output 43 [2025-04-13 18:12:52,797 INFO L134 CoverageAnalysis]: Checked inductivity of 12 backedges. 0 proven. 6 refuted. 0 times theorem prover too weak. 6 trivial. 0 not checked. [2025-04-13 18:12:52,797 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1187469588] provided 0 perfect and 2 imperfect interpolant sequences [2025-04-13 18:12:52,797 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2025-04-13 18:12:52,798 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [15, 11, 11] total 24 [2025-04-13 18:12:52,798 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1860567165] [2025-04-13 18:12:52,798 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2025-04-13 18:12:52,798 INFO L562 AbstractCegarLoop]: INTERPOLANT automaton has 25 states [2025-04-13 18:12:52,798 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-04-13 18:12:52,798 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 25 interpolants. [2025-04-13 18:12:52,798 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=62, Invalid=538, Unknown=0, NotChecked=0, Total=600 [2025-04-13 18:12:52,798 INFO L87 Difference]: Start difference. First operand 6886 states and 26656 transitions. Second operand has 25 states, 24 states have (on average 3.25) internal successors, (78), 25 states have internal predecessors, (78), 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 18:13:02,529 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-04-13 18:13:02,529 INFO L93 Difference]: Finished difference Result 11079 states and 42809 transitions. [2025-04-13 18:13:02,529 INFO L140 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 24 states. [2025-04-13 18:13:02,530 INFO L79 Accepts]: Start accepts. Automaton has has 25 states, 24 states have (on average 3.25) internal successors, (78), 25 states have internal predecessors, (78), 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 47 [2025-04-13 18:13:02,530 INFO L85 Accepts]: Finished accepts. some prefix is accepted. [2025-04-13 18:13:02,573 INFO L225 Difference]: With dead ends: 11079 [2025-04-13 18:13:02,574 INFO L226 Difference]: Without dead ends: 10804 [2025-04-13 18:13:02,576 INFO L436 NwaCegarLoop]: 0 DeclaredPredicates, 118 GetRequests, 85 SyntacticMatches, 0 SemanticMatches, 33 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 138 ImplicationChecksByTransitivity, 0.4s TimeCoverageRelationStatistics Valid=119, Invalid=1071, Unknown=0, NotChecked=0, Total=1190 [2025-04-13 18:13:02,576 INFO L437 NwaCegarLoop]: 19 mSDtfsCounter, 578 mSDsluCounter, 248 mSDsCounter, 0 mSdLazyCounter, 3808 mSolverCounterSat, 3 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 1.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 578 SdHoareTripleChecker+Valid, 267 SdHoareTripleChecker+Invalid, 3811 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 3 IncrementalHoareTripleChecker+Valid, 3808 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 1.5s IncrementalHoareTripleChecker+Time [2025-04-13 18:13:02,576 INFO L438 NwaCegarLoop]: SdHoareTripleChecker [578 Valid, 267 Invalid, 3811 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [3 Valid, 3808 Invalid, 0 Unknown, 0 Unchecked, 1.5s Time] [2025-04-13 18:13:02,584 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 10804 states. [2025-04-13 18:13:06,226 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 10804 to 7098. [2025-04-13 18:13:06,233 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 7098 states, 7097 states have (on average 3.8822037480625617) internal successors, (27552), 7097 states have internal predecessors, (27552), 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 18:13:06,248 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 7098 states to 7098 states and 27552 transitions. [2025-04-13 18:13:06,260 INFO L79 Accepts]: Start accepts. Automaton has 7098 states and 27552 transitions. Word has length 47 [2025-04-13 18:13:06,261 INFO L85 Accepts]: Finished accepts. word is rejected. [2025-04-13 18:13:06,261 INFO L485 AbstractCegarLoop]: Abstraction has 7098 states and 27552 transitions. [2025-04-13 18:13:06,261 INFO L486 AbstractCegarLoop]: INTERPOLANT automaton has has 25 states, 24 states have (on average 3.25) internal successors, (78), 25 states have internal predecessors, (78), 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 18:13:06,261 INFO L278 IsEmpty]: Start isEmpty. Operand 7098 states and 27552 transitions. [2025-04-13 18:13:06,271 INFO L284 IsEmpty]: Finished isEmpty. Found accepting run of length 48 [2025-04-13 18:13:06,271 INFO L210 NwaCegarLoop]: Found error trace [2025-04-13 18:13:06,271 INFO L218 NwaCegarLoop]: trace histogram [3, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-04-13 18:13:06,278 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (47)] Ended with exit code 0 [2025-04-13 18:13:06,471 WARN L466 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable67,47 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-04-13 18:13:06,472 INFO L403 AbstractCegarLoop]: === Iteration 69 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [thread1Err0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES, thread1Err3INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION (and 4 more)] === [2025-04-13 18:13:06,472 INFO L155 PredicateUnifier]: Initialized classic predicate unifier [2025-04-13 18:13:06,472 INFO L85 PathProgramCache]: Analyzing trace with hash 759322410, now seen corresponding path program 8 times [2025-04-13 18:13:06,472 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-04-13 18:13:06,472 INFO L324 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1593862150] [2025-04-13 18:13:06,472 INFO L95 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST1 [2025-04-13 18:13:06,472 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-04-13 18:13:06,478 INFO L108 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 partitioned 47 statements into 2 equivalence classes. [2025-04-13 18:13:06,484 INFO L111 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) and asserted 47 of 47 statements. [2025-04-13 18:13:06,484 INFO L114 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) [2025-04-13 18:13:06,484 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-04-13 18:13:06,936 INFO L134 CoverageAnalysis]: Checked inductivity of 11 backedges. 0 proven. 11 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-04-13 18:13:06,937 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-04-13 18:13:06,937 INFO L324 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1593862150] [2025-04-13 18:13:06,937 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1593862150] provided 0 perfect and 1 imperfect interpolant sequences [2025-04-13 18:13:06,937 INFO L324 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1478567080] [2025-04-13 18:13:06,937 INFO L95 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST1 [2025-04-13 18:13:06,937 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-04-13 18:13:06,937 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2025-04-13 18:13:06,938 INFO L229 MonitoredProcess]: Starting monitored process 48 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2025-04-13 18:13:06,939 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (48)] Waiting until timeout for monitored process [2025-04-13 18:13:07,026 INFO L108 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 partitioned 47 statements into 2 equivalence classes. [2025-04-13 18:13:07,048 INFO L111 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) and asserted 47 of 47 statements. [2025-04-13 18:13:07,048 INFO L114 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) [2025-04-13 18:13:07,048 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-04-13 18:13:07,049 INFO L256 TraceCheckSpWp]: Trace formula consists of 305 conjuncts, 51 conjuncts are in the unsatisfiable core [2025-04-13 18:13:07,050 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-04-13 18:13:07,350 INFO L325 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2025-04-13 18:13:07,350 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 28 treesize of output 12 [2025-04-13 18:13:07,374 INFO L134 CoverageAnalysis]: Checked inductivity of 11 backedges. 0 proven. 8 refuted. 0 times theorem prover too weak. 3 trivial. 0 not checked. [2025-04-13 18:13:07,374 INFO L312 TraceCheckSpWp]: Computing backward predicates... [2025-04-13 18:13:07,567 INFO L325 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2025-04-13 18:13:07,567 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 38 treesize of output 43 [2025-04-13 18:13:07,609 INFO L134 CoverageAnalysis]: Checked inductivity of 11 backedges. 0 proven. 5 refuted. 0 times theorem prover too weak. 6 trivial. 0 not checked. [2025-04-13 18:13:07,609 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1478567080] provided 0 perfect and 2 imperfect interpolant sequences [2025-04-13 18:13:07,609 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2025-04-13 18:13:07,609 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [17, 13, 11] total 38 [2025-04-13 18:13:07,609 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [741109472] [2025-04-13 18:13:07,609 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2025-04-13 18:13:07,610 INFO L562 AbstractCegarLoop]: INTERPOLANT automaton has 39 states [2025-04-13 18:13:07,610 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-04-13 18:13:07,610 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 39 interpolants. [2025-04-13 18:13:07,610 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=126, Invalid=1356, Unknown=0, NotChecked=0, Total=1482 [2025-04-13 18:13:07,610 INFO L87 Difference]: Start difference. First operand 7098 states and 27552 transitions. Second operand has 39 states, 38 states have (on average 3.0789473684210527) internal successors, (117), 39 states have internal predecessors, (117), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-04-13 18:13:33,574 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-04-13 18:13:33,574 INFO L93 Difference]: Finished difference Result 25525 states and 98372 transitions. [2025-04-13 18:13:33,575 INFO L140 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 81 states. [2025-04-13 18:13:33,575 INFO L79 Accepts]: Start accepts. Automaton has has 39 states, 38 states have (on average 3.0789473684210527) internal successors, (117), 39 states have internal predecessors, (117), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 47 [2025-04-13 18:13:33,575 INFO L85 Accepts]: Finished accepts. some prefix is accepted. [2025-04-13 18:13:33,659 INFO L225 Difference]: With dead ends: 25525 [2025-04-13 18:13:33,659 INFO L226 Difference]: Without dead ends: 24940 [2025-04-13 18:13:33,667 INFO L436 NwaCegarLoop]: 0 DeclaredPredicates, 179 GetRequests, 74 SyntacticMatches, 0 SemanticMatches, 105 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 3053 ImplicationChecksByTransitivity, 2.3s TimeCoverageRelationStatistics Valid=875, Invalid=10467, Unknown=0, NotChecked=0, Total=11342 [2025-04-13 18:13:33,668 INFO L437 NwaCegarLoop]: 36 mSDtfsCounter, 1615 mSDsluCounter, 837 mSDsCounter, 0 mSdLazyCounter, 10623 mSolverCounterSat, 38 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 3.9s Time, 0 mProtectedPredicate, 0 mProtectedAction, 1615 SdHoareTripleChecker+Valid, 873 SdHoareTripleChecker+Invalid, 10661 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 38 IncrementalHoareTripleChecker+Valid, 10623 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 4.6s IncrementalHoareTripleChecker+Time [2025-04-13 18:13:33,668 INFO L438 NwaCegarLoop]: SdHoareTripleChecker [1615 Valid, 873 Invalid, 10661 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [38 Valid, 10623 Invalid, 0 Unknown, 0 Unchecked, 4.6s Time] [2025-04-13 18:13:33,687 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 24940 states. [2025-04-13 18:13:38,533 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 24940 to 8358. [2025-04-13 18:13:38,542 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 8358 states, 8357 states have (on average 3.9631446691396435) internal successors, (33120), 8357 states have internal predecessors, (33120), 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 18:13:38,561 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 8358 states to 8358 states and 33120 transitions. [2025-04-13 18:13:38,585 INFO L79 Accepts]: Start accepts. Automaton has 8358 states and 33120 transitions. Word has length 47 [2025-04-13 18:13:38,585 INFO L85 Accepts]: Finished accepts. word is rejected. [2025-04-13 18:13:38,585 INFO L485 AbstractCegarLoop]: Abstraction has 8358 states and 33120 transitions. [2025-04-13 18:13:38,585 INFO L486 AbstractCegarLoop]: INTERPOLANT automaton has has 39 states, 38 states have (on average 3.0789473684210527) internal successors, (117), 39 states have internal predecessors, (117), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-04-13 18:13:38,585 INFO L278 IsEmpty]: Start isEmpty. Operand 8358 states and 33120 transitions. [2025-04-13 18:13:38,598 INFO L284 IsEmpty]: Finished isEmpty. Found accepting run of length 48 [2025-04-13 18:13:38,598 INFO L210 NwaCegarLoop]: Found error trace [2025-04-13 18:13:38,598 INFO L218 NwaCegarLoop]: trace histogram [3, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-04-13 18:13:38,605 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (48)] Forceful destruction successful, exit code 0 [2025-04-13 18:13:38,798 WARN L466 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable68,48 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-04-13 18:13:38,799 INFO L403 AbstractCegarLoop]: === Iteration 70 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [thread1Err0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES, thread1Err3INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION (and 4 more)] === [2025-04-13 18:13:38,799 INFO L155 PredicateUnifier]: Initialized classic predicate unifier [2025-04-13 18:13:38,799 INFO L85 PathProgramCache]: Analyzing trace with hash 153631674, now seen corresponding path program 9 times [2025-04-13 18:13:38,799 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-04-13 18:13:38,799 INFO L324 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [177829779] [2025-04-13 18:13:38,799 INFO L95 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST2 [2025-04-13 18:13:38,799 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-04-13 18:13:38,805 INFO L108 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST2 partitioned 47 statements into 3 equivalence classes. [2025-04-13 18:13:38,819 INFO L111 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST2 issued 2 check-sat command(s) and asserted 46 of 47 statements. [2025-04-13 18:13:38,820 INFO L114 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST2 issued 2 check-sat command(s) [2025-04-13 18:13:38,820 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-04-13 18:13:39,081 INFO L134 CoverageAnalysis]: Checked inductivity of 10 backedges. 0 proven. 4 refuted. 0 times theorem prover too weak. 6 trivial. 0 not checked. [2025-04-13 18:13:39,082 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-04-13 18:13:39,082 INFO L324 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [177829779] [2025-04-13 18:13:39,082 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [177829779] provided 0 perfect and 1 imperfect interpolant sequences [2025-04-13 18:13:39,082 INFO L324 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [747654975] [2025-04-13 18:13:39,082 INFO L95 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST2 [2025-04-13 18:13:39,082 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-04-13 18:13:39,082 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2025-04-13 18:13:39,084 INFO L229 MonitoredProcess]: Starting monitored process 49 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2025-04-13 18:13:39,085 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (49)] Waiting until timeout for monitored process [2025-04-13 18:13:39,173 INFO L108 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST2 partitioned 47 statements into 3 equivalence classes. [2025-04-13 18:13:39,194 INFO L111 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST2 issued 2 check-sat command(s) and asserted 46 of 47 statements. [2025-04-13 18:13:39,194 INFO L114 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST2 issued 2 check-sat command(s) [2025-04-13 18:13:39,194 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-04-13 18:13:39,195 INFO L256 TraceCheckSpWp]: Trace formula consists of 296 conjuncts, 60 conjuncts are in the unsatisfiable core [2025-04-13 18:13:39,197 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-04-13 18:13:39,218 INFO L354 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 23 treesize of output 1 [2025-04-13 18:13:39,461 INFO L325 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2025-04-13 18:13:39,461 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 38 treesize of output 28 [2025-04-13 18:13:39,541 INFO L134 CoverageAnalysis]: Checked inductivity of 10 backedges. 3 proven. 4 refuted. 0 times theorem prover too weak. 3 trivial. 0 not checked. [2025-04-13 18:13:39,541 INFO L312 TraceCheckSpWp]: Computing backward predicates... [2025-04-13 18:13:39,961 INFO L134 CoverageAnalysis]: Checked inductivity of 10 backedges. 0 proven. 4 refuted. 0 times theorem prover too weak. 6 trivial. 0 not checked. [2025-04-13 18:13:39,961 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [747654975] provided 0 perfect and 2 imperfect interpolant sequences [2025-04-13 18:13:39,961 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2025-04-13 18:13:39,961 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [13, 14, 12] total 32 [2025-04-13 18:13:39,961 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [63585237] [2025-04-13 18:13:39,961 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2025-04-13 18:13:39,962 INFO L562 AbstractCegarLoop]: INTERPOLANT automaton has 33 states [2025-04-13 18:13:39,962 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-04-13 18:13:39,962 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 33 interpolants. [2025-04-13 18:13:39,962 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=106, Invalid=950, Unknown=0, NotChecked=0, Total=1056 [2025-04-13 18:13:39,962 INFO L87 Difference]: Start difference. First operand 8358 states and 33120 transitions. Second operand has 33 states, 32 states have (on average 3.15625) internal successors, (101), 33 states have internal predecessors, (101), 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 18:14:17,041 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-04-13 18:14:17,041 INFO L93 Difference]: Finished difference Result 26007 states and 100623 transitions. [2025-04-13 18:14:17,041 INFO L140 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 135 states. [2025-04-13 18:14:17,041 INFO L79 Accepts]: Start accepts. Automaton has has 33 states, 32 states have (on average 3.15625) internal successors, (101), 33 states have internal predecessors, (101), 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 47 [2025-04-13 18:14:17,041 INFO L85 Accepts]: Finished accepts. some prefix is accepted. [2025-04-13 18:14:17,126 INFO L225 Difference]: With dead ends: 26007 [2025-04-13 18:14:17,126 INFO L226 Difference]: Without dead ends: 25596 [2025-04-13 18:14:17,134 INFO L436 NwaCegarLoop]: 0 DeclaredPredicates, 228 GetRequests, 75 SyntacticMatches, 0 SemanticMatches, 153 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 8718 ImplicationChecksByTransitivity, 7.1s TimeCoverageRelationStatistics Valid=2363, Invalid=21507, Unknown=0, NotChecked=0, Total=23870 [2025-04-13 18:14:17,134 INFO L437 NwaCegarLoop]: 35 mSDtfsCounter, 2271 mSDsluCounter, 764 mSDsCounter, 0 mSdLazyCounter, 9463 mSolverCounterSat, 62 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 6.5s Time, 0 mProtectedPredicate, 0 mProtectedAction, 2271 SdHoareTripleChecker+Valid, 799 SdHoareTripleChecker+Invalid, 9525 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 62 IncrementalHoareTripleChecker+Valid, 9463 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 7.2s IncrementalHoareTripleChecker+Time [2025-04-13 18:14:17,135 INFO L438 NwaCegarLoop]: SdHoareTripleChecker [2271 Valid, 799 Invalid, 9525 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [62 Valid, 9463 Invalid, 0 Unknown, 0 Unchecked, 7.2s Time] [2025-04-13 18:14:17,154 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 25596 states. [2025-04-13 18:14:23,472 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 25596 to 9270. [2025-04-13 18:14:23,482 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 9270 states, 9269 states have (on average 3.991369079728126) internal successors, (36996), 9269 states have internal predecessors, (36996), 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 18:14:23,503 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 9270 states to 9270 states and 36996 transitions. [2025-04-13 18:14:23,530 INFO L79 Accepts]: Start accepts. Automaton has 9270 states and 36996 transitions. Word has length 47 [2025-04-13 18:14:23,530 INFO L85 Accepts]: Finished accepts. word is rejected. [2025-04-13 18:14:23,530 INFO L485 AbstractCegarLoop]: Abstraction has 9270 states and 36996 transitions. [2025-04-13 18:14:23,530 INFO L486 AbstractCegarLoop]: INTERPOLANT automaton has has 33 states, 32 states have (on average 3.15625) internal successors, (101), 33 states have internal predecessors, (101), 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 18:14:23,530 INFO L278 IsEmpty]: Start isEmpty. Operand 9270 states and 36996 transitions. [2025-04-13 18:14:23,545 INFO L284 IsEmpty]: Finished isEmpty. Found accepting run of length 48 [2025-04-13 18:14:23,545 INFO L210 NwaCegarLoop]: Found error trace [2025-04-13 18:14:23,545 INFO L218 NwaCegarLoop]: trace histogram [3, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-04-13 18:14:23,552 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (49)] Ended with exit code 0 [2025-04-13 18:14:23,745 WARN L466 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 49 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable69 [2025-04-13 18:14:23,745 INFO L403 AbstractCegarLoop]: === Iteration 71 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [thread1Err0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES, thread1Err3INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION (and 4 more)] === [2025-04-13 18:14:23,746 INFO L155 PredicateUnifier]: Initialized classic predicate unifier [2025-04-13 18:14:23,746 INFO L85 PathProgramCache]: Analyzing trace with hash 1008181824, now seen corresponding path program 10 times [2025-04-13 18:14:23,746 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-04-13 18:14:23,746 INFO L324 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [44915940] [2025-04-13 18:14:23,746 INFO L95 rtionOrderModulation]: Changing assertion order to TERMS_WITH_SMALL_CONSTANTS_FIRST [2025-04-13 18:14:23,746 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-04-13 18:14:23,752 INFO L108 AnnotateAndAsserter]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST partitioned 47 statements into 2 equivalence classes. [2025-04-13 18:14:23,758 INFO L111 AnnotateAndAsserter]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST issued 2 check-sat command(s) and asserted 47 of 47 statements. [2025-04-13 18:14:23,758 INFO L114 AnnotateAndAsserter]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST issued 2 check-sat command(s) [2025-04-13 18:14:23,758 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-04-13 18:14:24,057 INFO L134 CoverageAnalysis]: Checked inductivity of 10 backedges. 0 proven. 4 refuted. 0 times theorem prover too weak. 6 trivial. 0 not checked. [2025-04-13 18:14:24,057 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-04-13 18:14:24,057 INFO L324 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [44915940] [2025-04-13 18:14:24,057 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [44915940] provided 0 perfect and 1 imperfect interpolant sequences [2025-04-13 18:14:24,057 INFO L324 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [507531328] [2025-04-13 18:14:24,057 INFO L95 rtionOrderModulation]: Changing assertion order to TERMS_WITH_SMALL_CONSTANTS_FIRST [2025-04-13 18:14:24,057 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-04-13 18:14:24,057 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2025-04-13 18:14:24,060 INFO L229 MonitoredProcess]: Starting monitored process 50 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2025-04-13 18:14:24,060 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (50)] Waiting until timeout for monitored process [2025-04-13 18:14:24,151 INFO L108 AnnotateAndAsserter]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST partitioned 47 statements into 2 equivalence classes. [2025-04-13 18:14:24,172 INFO L111 AnnotateAndAsserter]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST issued 2 check-sat command(s) and asserted 47 of 47 statements. [2025-04-13 18:14:24,172 INFO L114 AnnotateAndAsserter]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST issued 2 check-sat command(s) [2025-04-13 18:14:24,172 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-04-13 18:14:24,173 INFO L256 TraceCheckSpWp]: Trace formula consists of 305 conjuncts, 41 conjuncts are in the unsatisfiable core [2025-04-13 18:14:24,174 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-04-13 18:14:24,361 INFO L325 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2025-04-13 18:14:24,361 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 36 treesize of output 12 [2025-04-13 18:14:24,400 INFO L134 CoverageAnalysis]: Checked inductivity of 10 backedges. 0 proven. 4 refuted. 0 times theorem prover too weak. 6 trivial. 0 not checked. [2025-04-13 18:14:24,400 INFO L312 TraceCheckSpWp]: Computing backward predicates... [2025-04-13 18:14:24,571 INFO L325 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2025-04-13 18:14:24,571 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 38 treesize of output 43 [2025-04-13 18:14:24,598 INFO L134 CoverageAnalysis]: Checked inductivity of 10 backedges. 0 proven. 4 refuted. 0 times theorem prover too weak. 6 trivial. 0 not checked. [2025-04-13 18:14:24,598 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [507531328] provided 0 perfect and 2 imperfect interpolant sequences [2025-04-13 18:14:24,598 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2025-04-13 18:14:24,598 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [13, 11, 11] total 29 [2025-04-13 18:14:24,598 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1774164604] [2025-04-13 18:14:24,598 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2025-04-13 18:14:24,599 INFO L562 AbstractCegarLoop]: INTERPOLANT automaton has 30 states [2025-04-13 18:14:24,599 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-04-13 18:14:24,599 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 30 interpolants. [2025-04-13 18:14:24,599 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=91, Invalid=779, Unknown=0, NotChecked=0, Total=870 [2025-04-13 18:14:24,599 INFO L87 Difference]: Start difference. First operand 9270 states and 36996 transitions. Second operand has 30 states, 29 states have (on average 3.310344827586207) internal successors, (96), 30 states have internal predecessors, (96), 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 18:14:44,509 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-04-13 18:14:44,509 INFO L93 Difference]: Finished difference Result 17054 states and 67028 transitions. [2025-04-13 18:14:44,509 INFO L140 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 39 states. [2025-04-13 18:14:44,510 INFO L79 Accepts]: Start accepts. Automaton has has 30 states, 29 states have (on average 3.310344827586207) internal successors, (96), 30 states have internal predecessors, (96), 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 47 [2025-04-13 18:14:44,510 INFO L85 Accepts]: Finished accepts. some prefix is accepted. [2025-04-13 18:14:44,573 INFO L225 Difference]: With dead ends: 17054 [2025-04-13 18:14:44,573 INFO L226 Difference]: Without dead ends: 16625 [2025-04-13 18:14:44,577 INFO L436 NwaCegarLoop]: 0 DeclaredPredicates, 131 GetRequests, 77 SyntacticMatches, 0 SemanticMatches, 54 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 684 ImplicationChecksByTransitivity, 0.9s TimeCoverageRelationStatistics Valid=369, Invalid=2711, Unknown=0, NotChecked=0, Total=3080 [2025-04-13 18:14:44,577 INFO L437 NwaCegarLoop]: 19 mSDtfsCounter, 859 mSDsluCounter, 325 mSDsCounter, 0 mSdLazyCounter, 5334 mSolverCounterSat, 61 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 1.9s Time, 0 mProtectedPredicate, 0 mProtectedAction, 859 SdHoareTripleChecker+Valid, 344 SdHoareTripleChecker+Invalid, 5395 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 61 IncrementalHoareTripleChecker+Valid, 5334 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 2.2s IncrementalHoareTripleChecker+Time [2025-04-13 18:14:44,577 INFO L438 NwaCegarLoop]: SdHoareTripleChecker [859 Valid, 344 Invalid, 5395 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [61 Valid, 5334 Invalid, 0 Unknown, 0 Unchecked, 2.2s Time] [2025-04-13 18:14:44,589 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 16625 states. [2025-04-13 18:14:51,267 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 16625 to 9678. [2025-04-13 18:14:51,279 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 9678 states, 9677 states have (on average 4.002686783093934) internal successors, (38734), 9677 states have internal predecessors, (38734), 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 18:14:51,302 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 9678 states to 9678 states and 38734 transitions. [2025-04-13 18:14:51,323 INFO L79 Accepts]: Start accepts. Automaton has 9678 states and 38734 transitions. Word has length 47 [2025-04-13 18:14:51,323 INFO L85 Accepts]: Finished accepts. word is rejected. [2025-04-13 18:14:51,323 INFO L485 AbstractCegarLoop]: Abstraction has 9678 states and 38734 transitions. [2025-04-13 18:14:51,323 INFO L486 AbstractCegarLoop]: INTERPOLANT automaton has has 30 states, 29 states have (on average 3.310344827586207) internal successors, (96), 30 states have internal predecessors, (96), 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 18:14:51,323 INFO L278 IsEmpty]: Start isEmpty. Operand 9678 states and 38734 transitions. [2025-04-13 18:14:51,338 INFO L284 IsEmpty]: Finished isEmpty. Found accepting run of length 48 [2025-04-13 18:14:51,339 INFO L210 NwaCegarLoop]: Found error trace [2025-04-13 18:14:51,339 INFO L218 NwaCegarLoop]: trace histogram [3, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-04-13 18:14:51,345 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (50)] Ended with exit code 0 [2025-04-13 18:14:51,539 WARN L466 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable70,50 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-04-13 18:14:51,539 INFO L403 AbstractCegarLoop]: === Iteration 72 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [thread1Err0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES, thread1Err3INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION (and 4 more)] === [2025-04-13 18:14:51,539 INFO L155 PredicateUnifier]: Initialized classic predicate unifier [2025-04-13 18:14:51,539 INFO L85 PathProgramCache]: Analyzing trace with hash 280994972, now seen corresponding path program 11 times [2025-04-13 18:14:51,540 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-04-13 18:14:51,540 INFO L324 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [580308418] [2025-04-13 18:14:51,540 INFO L95 rtionOrderModulation]: Changing assertion order to INSIDE_LOOP_FIRST1 [2025-04-13 18:14:51,540 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-04-13 18:14:51,598 INFO L108 AnnotateAndAsserter]: Assert order INSIDE_LOOP_FIRST1 partitioned 47 statements into 3 equivalence classes. [2025-04-13 18:14:51,604 INFO L111 AnnotateAndAsserter]: Assert order INSIDE_LOOP_FIRST1 issued 3 check-sat command(s) and asserted 47 of 47 statements. [2025-04-13 18:14:51,604 INFO L114 AnnotateAndAsserter]: Assert order INSIDE_LOOP_FIRST1 issued 3 check-sat command(s) [2025-04-13 18:14:51,604 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-04-13 18:14:51,938 INFO L134 CoverageAnalysis]: Checked inductivity of 9 backedges. 0 proven. 9 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-04-13 18:14:51,939 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-04-13 18:14:51,939 INFO L324 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [580308418] [2025-04-13 18:14:51,939 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [580308418] provided 0 perfect and 1 imperfect interpolant sequences [2025-04-13 18:14:51,939 INFO L324 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [910280861] [2025-04-13 18:14:51,939 INFO L95 rtionOrderModulation]: Changing assertion order to INSIDE_LOOP_FIRST1 [2025-04-13 18:14:51,939 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-04-13 18:14:51,939 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2025-04-13 18:14:51,941 INFO L229 MonitoredProcess]: Starting monitored process 51 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2025-04-13 18:14:51,941 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (51)] Waiting until timeout for monitored process [2025-04-13 18:14:52,043 INFO L108 AnnotateAndAsserter]: Assert order INSIDE_LOOP_FIRST1 partitioned 47 statements into 3 equivalence classes. [2025-04-13 18:14:52,064 INFO L111 AnnotateAndAsserter]: Assert order INSIDE_LOOP_FIRST1 issued 3 check-sat command(s) and asserted 47 of 47 statements. [2025-04-13 18:14:52,064 INFO L114 AnnotateAndAsserter]: Assert order INSIDE_LOOP_FIRST1 issued 3 check-sat command(s) [2025-04-13 18:14:52,065 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-04-13 18:14:52,066 INFO L256 TraceCheckSpWp]: Trace formula consists of 305 conjuncts, 41 conjuncts are in the unsatisfiable core [2025-04-13 18:14:52,067 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-04-13 18:14:52,194 INFO L325 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2025-04-13 18:14:52,194 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 36 treesize of output 12 [2025-04-13 18:14:52,207 INFO L134 CoverageAnalysis]: Checked inductivity of 9 backedges. 0 proven. 3 refuted. 0 times theorem prover too weak. 6 trivial. 0 not checked. [2025-04-13 18:14:52,207 INFO L312 TraceCheckSpWp]: Computing backward predicates... [2025-04-13 18:14:52,356 INFO L325 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2025-04-13 18:14:52,356 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 38 treesize of output 43 [2025-04-13 18:14:52,381 INFO L134 CoverageAnalysis]: Checked inductivity of 9 backedges. 0 proven. 3 refuted. 0 times theorem prover too weak. 6 trivial. 0 not checked. [2025-04-13 18:14:52,381 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [910280861] provided 0 perfect and 2 imperfect interpolant sequences [2025-04-13 18:14:52,381 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2025-04-13 18:14:52,382 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [14, 11, 11] total 23 [2025-04-13 18:14:52,382 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [44283641] [2025-04-13 18:14:52,382 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2025-04-13 18:14:52,382 INFO L562 AbstractCegarLoop]: INTERPOLANT automaton has 24 states [2025-04-13 18:14:52,382 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-04-13 18:14:52,382 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 24 interpolants. [2025-04-13 18:14:52,382 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=59, Invalid=493, Unknown=0, NotChecked=0, Total=552 [2025-04-13 18:14:52,382 INFO L87 Difference]: Start difference. First operand 9678 states and 38734 transitions. Second operand has 24 states, 23 states have (on average 3.4347826086956523) internal successors, (79), 24 states have internal predecessors, (79), 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 18:15:05,720 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-04-13 18:15:05,721 INFO L93 Difference]: Finished difference Result 12223 states and 48373 transitions. [2025-04-13 18:15:05,721 INFO L140 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 19 states. [2025-04-13 18:15:05,721 INFO L79 Accepts]: Start accepts. Automaton has has 24 states, 23 states have (on average 3.4347826086956523) internal successors, (79), 24 states have internal predecessors, (79), 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 47 [2025-04-13 18:15:05,721 INFO L85 Accepts]: Finished accepts. some prefix is accepted. [2025-04-13 18:15:05,766 INFO L225 Difference]: With dead ends: 12223 [2025-04-13 18:15:05,766 INFO L226 Difference]: Without dead ends: 11996 [2025-04-13 18:15:05,769 INFO L436 NwaCegarLoop]: 0 DeclaredPredicates, 111 GetRequests, 85 SyntacticMatches, 0 SemanticMatches, 26 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 67 ImplicationChecksByTransitivity, 0.3s TimeCoverageRelationStatistics Valid=78, Invalid=678, Unknown=0, NotChecked=0, Total=756 [2025-04-13 18:15:05,769 INFO L437 NwaCegarLoop]: 16 mSDtfsCounter, 363 mSDsluCounter, 238 mSDsCounter, 0 mSdLazyCounter, 3814 mSolverCounterSat, 3 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 1.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 363 SdHoareTripleChecker+Valid, 254 SdHoareTripleChecker+Invalid, 3817 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 3 IncrementalHoareTripleChecker+Valid, 3814 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 1.4s IncrementalHoareTripleChecker+Time [2025-04-13 18:15:05,769 INFO L438 NwaCegarLoop]: SdHoareTripleChecker [363 Valid, 254 Invalid, 3817 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [3 Valid, 3814 Invalid, 0 Unknown, 0 Unchecked, 1.4s Time] [2025-04-13 18:15:05,777 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 11996 states. [2025-04-13 18:15:12,358 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 11996 to 9630. [2025-04-13 18:15:12,370 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 9630 states, 9629 states have (on average 4.003738705992315) internal successors, (38552), 9629 states have internal predecessors, (38552), 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 18:15:12,392 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 9630 states to 9630 states and 38552 transitions. [2025-04-13 18:15:12,408 INFO L79 Accepts]: Start accepts. Automaton has 9630 states and 38552 transitions. Word has length 47 [2025-04-13 18:15:12,408 INFO L85 Accepts]: Finished accepts. word is rejected. [2025-04-13 18:15:12,408 INFO L485 AbstractCegarLoop]: Abstraction has 9630 states and 38552 transitions. [2025-04-13 18:15:12,408 INFO L486 AbstractCegarLoop]: INTERPOLANT automaton has has 24 states, 23 states have (on average 3.4347826086956523) internal successors, (79), 24 states have internal predecessors, (79), 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 18:15:12,408 INFO L278 IsEmpty]: Start isEmpty. Operand 9630 states and 38552 transitions. [2025-04-13 18:15:12,423 INFO L284 IsEmpty]: Finished isEmpty. Found accepting run of length 48 [2025-04-13 18:15:12,423 INFO L210 NwaCegarLoop]: Found error trace [2025-04-13 18:15:12,423 INFO L218 NwaCegarLoop]: trace histogram [3, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-04-13 18:15:12,431 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (51)] Ended with exit code 0 [2025-04-13 18:15:12,624 WARN L466 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 51 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable71 [2025-04-13 18:15:12,624 INFO L403 AbstractCegarLoop]: === Iteration 73 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [thread1Err0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES, thread1Err3INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION (and 4 more)] === [2025-04-13 18:15:12,624 INFO L155 PredicateUnifier]: Initialized classic predicate unifier [2025-04-13 18:15:12,624 INFO L85 PathProgramCache]: Analyzing trace with hash -1897934370, now seen corresponding path program 12 times [2025-04-13 18:15:12,624 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-04-13 18:15:12,624 INFO L324 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2105965556] [2025-04-13 18:15:12,624 INFO L95 rtionOrderModulation]: Changing assertion order to MIX_INSIDE_OUTSIDE [2025-04-13 18:15:12,624 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-04-13 18:15:12,630 INFO L108 AnnotateAndAsserter]: Assert order MIX_INSIDE_OUTSIDE partitioned 47 statements into 3 equivalence classes. [2025-04-13 18:15:12,641 INFO L111 AnnotateAndAsserter]: Assert order MIX_INSIDE_OUTSIDE issued 3 check-sat command(s) and asserted 47 of 47 statements. [2025-04-13 18:15:12,641 INFO L114 AnnotateAndAsserter]: Assert order MIX_INSIDE_OUTSIDE issued 3 check-sat command(s) [2025-04-13 18:15:12,641 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-04-13 18:15:13,075 INFO L134 CoverageAnalysis]: Checked inductivity of 10 backedges. 0 proven. 9 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2025-04-13 18:15:13,075 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-04-13 18:15:13,075 INFO L324 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2105965556] [2025-04-13 18:15:13,075 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [2105965556] provided 0 perfect and 1 imperfect interpolant sequences [2025-04-13 18:15:13,075 INFO L324 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [511395736] [2025-04-13 18:15:13,075 INFO L95 rtionOrderModulation]: Changing assertion order to MIX_INSIDE_OUTSIDE [2025-04-13 18:15:13,075 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-04-13 18:15:13,076 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2025-04-13 18:15:13,077 INFO L229 MonitoredProcess]: Starting monitored process 52 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2025-04-13 18:15:13,078 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (52)] Waiting until timeout for monitored process [2025-04-13 18:15:13,183 INFO L108 AnnotateAndAsserter]: Assert order MIX_INSIDE_OUTSIDE partitioned 47 statements into 3 equivalence classes. [2025-04-13 18:15:13,206 INFO L111 AnnotateAndAsserter]: Assert order MIX_INSIDE_OUTSIDE issued 3 check-sat command(s) and asserted 47 of 47 statements. [2025-04-13 18:15:13,206 INFO L114 AnnotateAndAsserter]: Assert order MIX_INSIDE_OUTSIDE issued 3 check-sat command(s) [2025-04-13 18:15:13,206 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-04-13 18:15:13,207 INFO L256 TraceCheckSpWp]: Trace formula consists of 305 conjuncts, 60 conjuncts are in the unsatisfiable core [2025-04-13 18:15:13,208 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-04-13 18:15:13,249 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 19 treesize of output 1 [2025-04-13 18:15:13,548 INFO L325 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2025-04-13 18:15:13,548 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 36 treesize of output 12 [2025-04-13 18:15:13,558 INFO L134 CoverageAnalysis]: Checked inductivity of 10 backedges. 0 proven. 10 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-04-13 18:15:13,558 INFO L312 TraceCheckSpWp]: Computing backward predicates... [2025-04-13 18:15:14,408 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 31 treesize of output 27 [2025-04-13 18:15:14,416 INFO L325 Elim1Store]: treesize reduction 5, result has 37.5 percent of original size [2025-04-13 18:15:14,416 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 58 treesize of output 41 [2025-04-13 18:15:14,511 INFO L134 CoverageAnalysis]: Checked inductivity of 10 backedges. 3 proven. 7 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-04-13 18:15:14,511 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [511395736] provided 0 perfect and 2 imperfect interpolant sequences [2025-04-13 18:15:14,511 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2025-04-13 18:15:14,512 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [16, 15, 16] total 43 [2025-04-13 18:15:14,512 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1756755891] [2025-04-13 18:15:14,512 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2025-04-13 18:15:14,512 INFO L562 AbstractCegarLoop]: INTERPOLANT automaton has 45 states [2025-04-13 18:15:14,512 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-04-13 18:15:14,512 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 45 interpolants. [2025-04-13 18:15:14,512 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=182, Invalid=1797, Unknown=1, NotChecked=0, Total=1980 [2025-04-13 18:15:14,512 INFO L87 Difference]: Start difference. First operand 9630 states and 38552 transitions. Second operand has 45 states, 44 states have (on average 2.6818181818181817) internal successors, (118), 44 states have internal predecessors, (118), 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 18:15:33,702 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-04-13 18:15:33,703 INFO L93 Difference]: Finished difference Result 14785 states and 57568 transitions. [2025-04-13 18:15:33,703 INFO L140 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 46 states. [2025-04-13 18:15:33,703 INFO L79 Accepts]: Start accepts. Automaton has has 45 states, 44 states have (on average 2.6818181818181817) internal successors, (118), 44 states have internal predecessors, (118), 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 47 [2025-04-13 18:15:33,703 INFO L85 Accepts]: Finished accepts. some prefix is accepted. [2025-04-13 18:15:33,756 INFO L225 Difference]: With dead ends: 14785 [2025-04-13 18:15:33,756 INFO L226 Difference]: Without dead ends: 14605 [2025-04-13 18:15:33,759 INFO L436 NwaCegarLoop]: 0 DeclaredPredicates, 152 GetRequests, 65 SyntacticMatches, 0 SemanticMatches, 87 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1611 ImplicationChecksByTransitivity, 2.3s TimeCoverageRelationStatistics Valid=1009, Invalid=6822, Unknown=1, NotChecked=0, Total=7832 [2025-04-13 18:15:33,760 INFO L437 NwaCegarLoop]: 27 mSDtfsCounter, 1086 mSDsluCounter, 693 mSDsCounter, 0 mSdLazyCounter, 7796 mSolverCounterSat, 38 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 2.8s Time, 0 mProtectedPredicate, 0 mProtectedAction, 1086 SdHoareTripleChecker+Valid, 720 SdHoareTripleChecker+Invalid, 7834 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 38 IncrementalHoareTripleChecker+Valid, 7796 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 3.3s IncrementalHoareTripleChecker+Time [2025-04-13 18:15:33,760 INFO L438 NwaCegarLoop]: SdHoareTripleChecker [1086 Valid, 720 Invalid, 7834 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [38 Valid, 7796 Invalid, 0 Unknown, 0 Unchecked, 3.3s Time] [2025-04-13 18:15:33,769 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 14605 states. [2025-04-13 18:15:40,848 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 14605 to 10182. [2025-04-13 18:15:40,860 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 10182 states, 10181 states have (on average 4.019251546999312) internal successors, (40920), 10181 states have internal predecessors, (40920), 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 18:15:40,884 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 10182 states to 10182 states and 40920 transitions. [2025-04-13 18:15:40,904 INFO L79 Accepts]: Start accepts. Automaton has 10182 states and 40920 transitions. Word has length 47 [2025-04-13 18:15:40,905 INFO L85 Accepts]: Finished accepts. word is rejected. [2025-04-13 18:15:40,905 INFO L485 AbstractCegarLoop]: Abstraction has 10182 states and 40920 transitions. [2025-04-13 18:15:40,905 INFO L486 AbstractCegarLoop]: INTERPOLANT automaton has has 45 states, 44 states have (on average 2.6818181818181817) internal successors, (118), 44 states have internal predecessors, (118), 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 18:15:40,905 INFO L278 IsEmpty]: Start isEmpty. Operand 10182 states and 40920 transitions. [2025-04-13 18:15:40,920 INFO L284 IsEmpty]: Finished isEmpty. Found accepting run of length 48 [2025-04-13 18:15:40,921 INFO L210 NwaCegarLoop]: Found error trace [2025-04-13 18:15:40,921 INFO L218 NwaCegarLoop]: trace histogram [3, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-04-13 18:15:40,928 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (52)] Ended with exit code 0 [2025-04-13 18:15:41,121 WARN L466 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable72,52 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-04-13 18:15:41,121 INFO L403 AbstractCegarLoop]: === Iteration 74 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [thread1Err0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES, thread1Err3INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION (and 4 more)] === [2025-04-13 18:15:41,122 INFO L155 PredicateUnifier]: Initialized classic predicate unifier [2025-04-13 18:15:41,122 INFO L85 PathProgramCache]: Analyzing trace with hash -1170377170, now seen corresponding path program 13 times [2025-04-13 18:15:41,122 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-04-13 18:15:41,122 INFO L324 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1001936648] [2025-04-13 18:15:41,122 INFO L95 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2025-04-13 18:15:41,122 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-04-13 18:15:41,128 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 47 statements into 1 equivalence classes. [2025-04-13 18:15:41,135 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 47 of 47 statements. [2025-04-13 18:15:41,135 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-04-13 18:15:41,135 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-04-13 18:15:41,728 INFO L134 CoverageAnalysis]: Checked inductivity of 9 backedges. 0 proven. 9 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-04-13 18:15:41,728 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-04-13 18:15:41,728 INFO L324 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1001936648] [2025-04-13 18:15:41,728 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1001936648] provided 0 perfect and 1 imperfect interpolant sequences [2025-04-13 18:15:41,728 INFO L324 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [417963477] [2025-04-13 18:15:41,728 INFO L95 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2025-04-13 18:15:41,728 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-04-13 18:15:41,728 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2025-04-13 18:15:41,731 INFO L229 MonitoredProcess]: Starting monitored process 53 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2025-04-13 18:15:41,731 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (53)] Waiting until timeout for monitored process [2025-04-13 18:15:41,826 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 47 statements into 1 equivalence classes. [2025-04-13 18:15:41,846 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 47 of 47 statements. [2025-04-13 18:15:41,846 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-04-13 18:15:41,846 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-04-13 18:15:41,847 INFO L256 TraceCheckSpWp]: Trace formula consists of 305 conjuncts, 41 conjuncts are in the unsatisfiable core [2025-04-13 18:15:41,848 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-04-13 18:15:42,058 INFO L325 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2025-04-13 18:15:42,058 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 36 treesize of output 12 [2025-04-13 18:15:42,071 INFO L134 CoverageAnalysis]: Checked inductivity of 9 backedges. 0 proven. 3 refuted. 0 times theorem prover too weak. 6 trivial. 0 not checked. [2025-04-13 18:15:42,071 INFO L312 TraceCheckSpWp]: Computing backward predicates... [2025-04-13 18:15:42,285 INFO L325 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2025-04-13 18:15:42,285 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 38 treesize of output 43 [2025-04-13 18:15:42,311 INFO L134 CoverageAnalysis]: Checked inductivity of 9 backedges. 0 proven. 3 refuted. 0 times theorem prover too weak. 6 trivial. 0 not checked. [2025-04-13 18:15:42,311 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [417963477] provided 0 perfect and 2 imperfect interpolant sequences [2025-04-13 18:15:42,311 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2025-04-13 18:15:42,311 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [16, 11, 11] total 31 [2025-04-13 18:15:42,311 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2138353745] [2025-04-13 18:15:42,311 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2025-04-13 18:15:42,311 INFO L562 AbstractCegarLoop]: INTERPOLANT automaton has 32 states [2025-04-13 18:15:42,311 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-04-13 18:15:42,312 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 32 interpolants. [2025-04-13 18:15:42,312 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=80, Invalid=912, Unknown=0, NotChecked=0, Total=992 [2025-04-13 18:15:42,312 INFO L87 Difference]: Start difference. First operand 10182 states and 40920 transitions. Second operand has 32 states, 31 states have (on average 3.2580645161290325) internal successors, (101), 32 states have internal predecessors, (101), 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 18:15:57,400 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-04-13 18:15:57,400 INFO L93 Difference]: Finished difference Result 12731 states and 50471 transitions. [2025-04-13 18:15:57,400 INFO L140 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 25 states. [2025-04-13 18:15:57,400 INFO L79 Accepts]: Start accepts. Automaton has has 32 states, 31 states have (on average 3.2580645161290325) internal successors, (101), 32 states have internal predecessors, (101), 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 47 [2025-04-13 18:15:57,400 INFO L85 Accepts]: Finished accepts. some prefix is accepted. [2025-04-13 18:15:57,460 INFO L225 Difference]: With dead ends: 12731 [2025-04-13 18:15:57,460 INFO L226 Difference]: Without dead ends: 12510 [2025-04-13 18:15:57,464 INFO L436 NwaCegarLoop]: 0 DeclaredPredicates, 127 GetRequests, 78 SyntacticMatches, 0 SemanticMatches, 49 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 330 ImplicationChecksByTransitivity, 0.8s TimeCoverageRelationStatistics Valid=231, Invalid=2319, Unknown=0, NotChecked=0, Total=2550 [2025-04-13 18:15:57,464 INFO L437 NwaCegarLoop]: 16 mSDtfsCounter, 800 mSDsluCounter, 315 mSDsCounter, 0 mSdLazyCounter, 4973 mSolverCounterSat, 11 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 1.6s Time, 0 mProtectedPredicate, 0 mProtectedAction, 800 SdHoareTripleChecker+Valid, 331 SdHoareTripleChecker+Invalid, 4984 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 11 IncrementalHoareTripleChecker+Valid, 4973 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 1.9s IncrementalHoareTripleChecker+Time [2025-04-13 18:15:57,464 INFO L438 NwaCegarLoop]: SdHoareTripleChecker [800 Valid, 331 Invalid, 4984 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [11 Valid, 4973 Invalid, 0 Unknown, 0 Unchecked, 1.9s Time] [2025-04-13 18:15:57,474 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 12510 states. [2025-04-13 18:16:04,694 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 12510 to 10254. [2025-04-13 18:16:04,708 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 10254 states, 10253 states have (on average 4.020286745342826) internal successors, (41220), 10253 states have internal predecessors, (41220), 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 18:16:04,736 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 10254 states to 10254 states and 41220 transitions. [2025-04-13 18:16:04,760 INFO L79 Accepts]: Start accepts. Automaton has 10254 states and 41220 transitions. Word has length 47 [2025-04-13 18:16:04,761 INFO L85 Accepts]: Finished accepts. word is rejected. [2025-04-13 18:16:04,761 INFO L485 AbstractCegarLoop]: Abstraction has 10254 states and 41220 transitions. [2025-04-13 18:16:04,761 INFO L486 AbstractCegarLoop]: INTERPOLANT automaton has has 32 states, 31 states have (on average 3.2580645161290325) internal successors, (101), 32 states have internal predecessors, (101), 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 18:16:04,761 INFO L278 IsEmpty]: Start isEmpty. Operand 10254 states and 41220 transitions. [2025-04-13 18:16:04,778 INFO L284 IsEmpty]: Finished isEmpty. Found accepting run of length 48 [2025-04-13 18:16:04,778 INFO L210 NwaCegarLoop]: Found error trace [2025-04-13 18:16:04,779 INFO L218 NwaCegarLoop]: trace histogram [3, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-04-13 18:16:04,785 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (53)] Forceful destruction successful, exit code 0 [2025-04-13 18:16:04,979 WARN L466 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 53 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable73 [2025-04-13 18:16:04,979 INFO L403 AbstractCegarLoop]: === Iteration 75 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [thread1Err0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES, thread1Err3INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION (and 4 more)] === [2025-04-13 18:16:04,979 INFO L155 PredicateUnifier]: Initialized classic predicate unifier [2025-04-13 18:16:04,979 INFO L85 PathProgramCache]: Analyzing trace with hash -1435762086, now seen corresponding path program 14 times [2025-04-13 18:16:04,980 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-04-13 18:16:04,980 INFO L324 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [418536502] [2025-04-13 18:16:04,980 INFO L95 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST1 [2025-04-13 18:16:04,980 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-04-13 18:16:04,993 INFO L108 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 partitioned 47 statements into 2 equivalence classes. [2025-04-13 18:16:05,002 INFO L111 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) and asserted 47 of 47 statements. [2025-04-13 18:16:05,002 INFO L114 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) [2025-04-13 18:16:05,002 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-04-13 18:16:05,312 INFO L134 CoverageAnalysis]: Checked inductivity of 9 backedges. 0 proven. 3 refuted. 0 times theorem prover too weak. 6 trivial. 0 not checked. [2025-04-13 18:16:05,312 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-04-13 18:16:05,313 INFO L324 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [418536502] [2025-04-13 18:16:05,313 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [418536502] provided 0 perfect and 1 imperfect interpolant sequences [2025-04-13 18:16:05,313 INFO L324 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [97871115] [2025-04-13 18:16:05,313 INFO L95 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST1 [2025-04-13 18:16:05,313 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-04-13 18:16:05,313 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2025-04-13 18:16:05,315 INFO L229 MonitoredProcess]: Starting monitored process 54 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2025-04-13 18:16:05,316 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (54)] Waiting until timeout for monitored process [2025-04-13 18:16:05,429 INFO L108 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 partitioned 47 statements into 2 equivalence classes. [2025-04-13 18:16:05,455 INFO L111 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) and asserted 47 of 47 statements. [2025-04-13 18:16:05,455 INFO L114 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) [2025-04-13 18:16:05,455 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-04-13 18:16:05,457 INFO L256 TraceCheckSpWp]: Trace formula consists of 305 conjuncts, 59 conjuncts are in the unsatisfiable core [2025-04-13 18:16:05,459 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-04-13 18:16:05,506 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 18:16:05,912 INFO L189 IndexEqualityManager]: detected not equals via solver [2025-04-13 18:16:05,925 INFO L325 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2025-04-13 18:16:05,925 INFO L354 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 4 select indices, 4 select index equivalence classes, 3 disjoint index pairs (out of 6 index pairs), introduced 4 new quantified variables, introduced 6 case distinctions, treesize of input 34 treesize of output 36 [2025-04-13 18:16:06,040 INFO L134 CoverageAnalysis]: Checked inductivity of 9 backedges. 0 proven. 9 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-04-13 18:16:06,040 INFO L312 TraceCheckSpWp]: Computing backward predicates... [2025-04-13 18:16:06,330 INFO L134 CoverageAnalysis]: Checked inductivity of 9 backedges. 0 proven. 3 refuted. 0 times theorem prover too weak. 6 trivial. 0 not checked. [2025-04-13 18:16:06,331 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [97871115] provided 0 perfect and 2 imperfect interpolant sequences [2025-04-13 18:16:06,331 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2025-04-13 18:16:06,331 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [13, 17, 13] total 37 [2025-04-13 18:16:06,331 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [620709947] [2025-04-13 18:16:06,331 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2025-04-13 18:16:06,331 INFO L562 AbstractCegarLoop]: INTERPOLANT automaton has 38 states [2025-04-13 18:16:06,331 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-04-13 18:16:06,331 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 38 interpolants. [2025-04-13 18:16:06,331 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=126, Invalid=1280, Unknown=0, NotChecked=0, Total=1406 [2025-04-13 18:16:06,332 INFO L87 Difference]: Start difference. First operand 10254 states and 41220 transitions. Second operand has 38 states, 37 states have (on average 2.8378378378378377) internal successors, (105), 38 states have internal predecessors, (105), 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 18:16:24,827 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-04-13 18:16:24,827 INFO L93 Difference]: Finished difference Result 15143 states and 58442 transitions. [2025-04-13 18:16:24,827 INFO L140 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 42 states. [2025-04-13 18:16:24,827 INFO L79 Accepts]: Start accepts. Automaton has has 38 states, 37 states have (on average 2.8378378378378377) internal successors, (105), 38 states have internal predecessors, (105), 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 47 [2025-04-13 18:16:24,828 INFO L85 Accepts]: Finished accepts. some prefix is accepted. [2025-04-13 18:16:24,884 INFO L225 Difference]: With dead ends: 15143 [2025-04-13 18:16:24,884 INFO L226 Difference]: Without dead ends: 14951 [2025-04-13 18:16:24,888 INFO L436 NwaCegarLoop]: 0 DeclaredPredicates, 141 GetRequests, 70 SyntacticMatches, 0 SemanticMatches, 71 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1305 ImplicationChecksByTransitivity, 1.4s TimeCoverageRelationStatistics Valid=497, Invalid=4759, Unknown=0, NotChecked=0, Total=5256 [2025-04-13 18:16:24,889 INFO L437 NwaCegarLoop]: 29 mSDtfsCounter, 1388 mSDsluCounter, 603 mSDsCounter, 0 mSdLazyCounter, 7050 mSolverCounterSat, 26 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 2.6s Time, 0 mProtectedPredicate, 0 mProtectedAction, 1388 SdHoareTripleChecker+Valid, 632 SdHoareTripleChecker+Invalid, 7076 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 26 IncrementalHoareTripleChecker+Valid, 7050 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 3.1s IncrementalHoareTripleChecker+Time [2025-04-13 18:16:24,889 INFO L438 NwaCegarLoop]: SdHoareTripleChecker [1388 Valid, 632 Invalid, 7076 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [26 Valid, 7050 Invalid, 0 Unknown, 0 Unchecked, 3.1s Time] [2025-04-13 18:16:24,899 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 14951 states. [2025-04-13 18:16:32,097 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 14951 to 10246. [2025-04-13 18:16:32,109 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 10246 states, 10245 states have (on average 4.0206930209858465) internal successors, (41192), 10245 states have internal predecessors, (41192), 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 18:16:32,134 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 10246 states to 10246 states and 41192 transitions. [2025-04-13 18:16:32,156 INFO L79 Accepts]: Start accepts. Automaton has 10246 states and 41192 transitions. Word has length 47 [2025-04-13 18:16:32,156 INFO L85 Accepts]: Finished accepts. word is rejected. [2025-04-13 18:16:32,156 INFO L485 AbstractCegarLoop]: Abstraction has 10246 states and 41192 transitions. [2025-04-13 18:16:32,156 INFO L486 AbstractCegarLoop]: INTERPOLANT automaton has has 38 states, 37 states have (on average 2.8378378378378377) internal successors, (105), 38 states have internal predecessors, (105), 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 18:16:32,156 INFO L278 IsEmpty]: Start isEmpty. Operand 10246 states and 41192 transitions. [2025-04-13 18:16:32,172 INFO L284 IsEmpty]: Finished isEmpty. Found accepting run of length 48 [2025-04-13 18:16:32,173 INFO L210 NwaCegarLoop]: Found error trace [2025-04-13 18:16:32,173 INFO L218 NwaCegarLoop]: trace histogram [3, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-04-13 18:16:32,180 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (54)] Ended with exit code 0 [2025-04-13 18:16:32,373 WARN L466 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable74,54 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-04-13 18:16:32,373 INFO L403 AbstractCegarLoop]: === Iteration 76 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [thread1Err0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES, thread1Err3INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION (and 4 more)] === [2025-04-13 18:16:32,373 INFO L155 PredicateUnifier]: Initialized classic predicate unifier [2025-04-13 18:16:32,374 INFO L85 PathProgramCache]: Analyzing trace with hash 25253767, now seen corresponding path program 24 times [2025-04-13 18:16:32,374 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-04-13 18:16:32,374 INFO L324 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [550170519] [2025-04-13 18:16:32,374 INFO L95 rtionOrderModulation]: Changing assertion order to MIX_INSIDE_OUTSIDE [2025-04-13 18:16:32,374 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-04-13 18:16:32,380 INFO L108 AnnotateAndAsserter]: Assert order MIX_INSIDE_OUTSIDE partitioned 47 statements into 3 equivalence classes. [2025-04-13 18:16:32,388 INFO L111 AnnotateAndAsserter]: Assert order MIX_INSIDE_OUTSIDE issued 3 check-sat command(s) and asserted 47 of 47 statements. [2025-04-13 18:16:32,388 INFO L114 AnnotateAndAsserter]: Assert order MIX_INSIDE_OUTSIDE issued 3 check-sat command(s) [2025-04-13 18:16:32,388 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-04-13 18:16:32,877 INFO L134 CoverageAnalysis]: Checked inductivity of 14 backedges. 0 proven. 14 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-04-13 18:16:32,877 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-04-13 18:16:32,877 INFO L324 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [550170519] [2025-04-13 18:16:32,877 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [550170519] provided 0 perfect and 1 imperfect interpolant sequences [2025-04-13 18:16:32,877 INFO L324 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [435312175] [2025-04-13 18:16:32,877 INFO L95 rtionOrderModulation]: Changing assertion order to MIX_INSIDE_OUTSIDE [2025-04-13 18:16:32,877 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-04-13 18:16:32,877 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2025-04-13 18:16:32,880 INFO L229 MonitoredProcess]: Starting monitored process 55 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2025-04-13 18:16:32,880 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (55)] Waiting until timeout for monitored process [2025-04-13 18:16:32,982 INFO L108 AnnotateAndAsserter]: Assert order MIX_INSIDE_OUTSIDE partitioned 47 statements into 3 equivalence classes. [2025-04-13 18:16:33,005 INFO L111 AnnotateAndAsserter]: Assert order MIX_INSIDE_OUTSIDE issued 3 check-sat command(s) and asserted 47 of 47 statements. [2025-04-13 18:16:33,005 INFO L114 AnnotateAndAsserter]: Assert order MIX_INSIDE_OUTSIDE issued 3 check-sat command(s) [2025-04-13 18:16:33,005 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-04-13 18:16:33,006 INFO L256 TraceCheckSpWp]: Trace formula consists of 305 conjuncts, 60 conjuncts are in the unsatisfiable core [2025-04-13 18:16:33,008 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-04-13 18:16:33,027 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 18:16:33,633 INFO L189 IndexEqualityManager]: detected not equals via solver [2025-04-13 18:16:33,634 INFO L189 IndexEqualityManager]: detected not equals via solver [2025-04-13 18:16:33,644 INFO L325 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2025-04-13 18:16:33,644 INFO L354 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 4 select indices, 4 select index equivalence classes, 3 disjoint index pairs (out of 6 index pairs), introduced 4 new quantified variables, introduced 6 case distinctions, treesize of input 32 treesize of output 36 [2025-04-13 18:16:33,733 INFO L134 CoverageAnalysis]: Checked inductivity of 14 backedges. 0 proven. 14 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-04-13 18:16:33,733 INFO L312 TraceCheckSpWp]: Computing backward predicates... [2025-04-13 18:16:34,181 INFO L134 CoverageAnalysis]: Checked inductivity of 14 backedges. 0 proven. 8 refuted. 0 times theorem prover too weak. 6 trivial. 0 not checked. [2025-04-13 18:16:34,181 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [435312175] provided 0 perfect and 2 imperfect interpolant sequences [2025-04-13 18:16:34,181 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2025-04-13 18:16:34,181 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [17, 17, 13] total 39 [2025-04-13 18:16:34,181 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1086335953] [2025-04-13 18:16:34,182 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2025-04-13 18:16:34,182 INFO L562 AbstractCegarLoop]: INTERPOLANT automaton has 40 states [2025-04-13 18:16:34,182 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-04-13 18:16:34,182 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 40 interpolants. [2025-04-13 18:16:34,182 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=169, Invalid=1391, Unknown=0, NotChecked=0, Total=1560 [2025-04-13 18:16:34,182 INFO L87 Difference]: Start difference. First operand 10246 states and 41192 transitions. Second operand has 40 states, 39 states have (on average 2.8461538461538463) internal successors, (111), 40 states have internal predecessors, (111), 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 18:17:06,946 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-04-13 18:17:06,947 INFO L93 Difference]: Finished difference Result 22125 states and 84067 transitions. [2025-04-13 18:17:06,947 INFO L140 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 96 states. [2025-04-13 18:17:06,947 INFO L79 Accepts]: Start accepts. Automaton has has 40 states, 39 states have (on average 2.8461538461538463) internal successors, (111), 40 states have internal predecessors, (111), 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 47 [2025-04-13 18:17:06,947 INFO L85 Accepts]: Finished accepts. some prefix is accepted. [2025-04-13 18:17:07,024 INFO L225 Difference]: With dead ends: 22125 [2025-04-13 18:17:07,024 INFO L226 Difference]: Without dead ends: 21710 [2025-04-13 18:17:07,031 INFO L436 NwaCegarLoop]: 0 DeclaredPredicates, 198 GetRequests, 73 SyntacticMatches, 0 SemanticMatches, 125 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 5188 ImplicationChecksByTransitivity, 4.8s TimeCoverageRelationStatistics Valid=1782, Invalid=14220, Unknown=0, NotChecked=0, Total=16002 [2025-04-13 18:17:07,031 INFO L437 NwaCegarLoop]: 33 mSDtfsCounter, 2459 mSDsluCounter, 832 mSDsCounter, 0 mSdLazyCounter, 8639 mSolverCounterSat, 68 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 5.3s Time, 0 mProtectedPredicate, 0 mProtectedAction, 2459 SdHoareTripleChecker+Valid, 865 SdHoareTripleChecker+Invalid, 8707 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 68 IncrementalHoareTripleChecker+Valid, 8639 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 6.0s IncrementalHoareTripleChecker+Time [2025-04-13 18:17:07,032 INFO L438 NwaCegarLoop]: SdHoareTripleChecker [2459 Valid, 865 Invalid, 8707 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [68 Valid, 8639 Invalid, 0 Unknown, 0 Unchecked, 6.0s Time] [2025-04-13 18:17:07,049 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 21710 states. [2025-04-13 18:17:14,860 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 21710 to 10526. [2025-04-13 18:17:14,873 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 10526 states, 10525 states have (on average 4.020142517814727) internal successors, (42312), 10525 states have internal predecessors, (42312), 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 18:17:14,901 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 10526 states to 10526 states and 42312 transitions. [2025-04-13 18:17:14,936 INFO L79 Accepts]: Start accepts. Automaton has 10526 states and 42312 transitions. Word has length 47 [2025-04-13 18:17:14,936 INFO L85 Accepts]: Finished accepts. word is rejected. [2025-04-13 18:17:14,936 INFO L485 AbstractCegarLoop]: Abstraction has 10526 states and 42312 transitions. [2025-04-13 18:17:14,936 INFO L486 AbstractCegarLoop]: INTERPOLANT automaton has has 40 states, 39 states have (on average 2.8461538461538463) internal successors, (111), 40 states have internal predecessors, (111), 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 18:17:14,937 INFO L278 IsEmpty]: Start isEmpty. Operand 10526 states and 42312 transitions. [2025-04-13 18:17:14,955 INFO L284 IsEmpty]: Finished isEmpty. Found accepting run of length 48 [2025-04-13 18:17:14,955 INFO L210 NwaCegarLoop]: Found error trace [2025-04-13 18:17:14,955 INFO L218 NwaCegarLoop]: trace histogram [3, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-04-13 18:17:14,962 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (55)] Ended with exit code 0 [2025-04-13 18:17:15,155 WARN L466 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable75,55 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-04-13 18:17:15,156 INFO L403 AbstractCegarLoop]: === Iteration 77 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [thread1Err0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES, thread1Err3INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION (and 4 more)] === [2025-04-13 18:17:15,156 INFO L155 PredicateUnifier]: Initialized classic predicate unifier [2025-04-13 18:17:15,156 INFO L85 PathProgramCache]: Analyzing trace with hash -1326666426, now seen corresponding path program 15 times [2025-04-13 18:17:15,156 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-04-13 18:17:15,156 INFO L324 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [642695693] [2025-04-13 18:17:15,156 INFO L95 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST2 [2025-04-13 18:17:15,156 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-04-13 18:17:15,163 INFO L108 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST2 partitioned 47 statements into 3 equivalence classes. [2025-04-13 18:17:15,174 INFO L111 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST2 issued 2 check-sat command(s) and asserted 46 of 47 statements. [2025-04-13 18:17:15,174 INFO L114 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST2 issued 2 check-sat command(s) [2025-04-13 18:17:15,174 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-04-13 18:17:15,460 INFO L134 CoverageAnalysis]: Checked inductivity of 10 backedges. 0 proven. 4 refuted. 0 times theorem prover too weak. 6 trivial. 0 not checked. [2025-04-13 18:17:15,460 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-04-13 18:17:15,460 INFO L324 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [642695693] [2025-04-13 18:17:15,460 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [642695693] provided 0 perfect and 1 imperfect interpolant sequences [2025-04-13 18:17:15,460 INFO L324 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [752614891] [2025-04-13 18:17:15,460 INFO L95 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST2 [2025-04-13 18:17:15,460 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-04-13 18:17:15,461 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2025-04-13 18:17:15,462 INFO L229 MonitoredProcess]: Starting monitored process 56 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2025-04-13 18:17:15,463 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (56)] Waiting until timeout for monitored process [2025-04-13 18:17:15,562 INFO L108 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST2 partitioned 47 statements into 3 equivalence classes. [2025-04-13 18:17:15,589 INFO L111 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST2 issued 2 check-sat command(s) and asserted 46 of 47 statements. [2025-04-13 18:17:15,589 INFO L114 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST2 issued 2 check-sat command(s) [2025-04-13 18:17:15,589 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-04-13 18:17:15,591 INFO L256 TraceCheckSpWp]: Trace formula consists of 296 conjuncts, 60 conjuncts are in the unsatisfiable core [2025-04-13 18:17:15,592 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-04-13 18:17:15,616 INFO L354 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 23 treesize of output 1 [2025-04-13 18:17:15,905 INFO L325 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2025-04-13 18:17:15,905 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 38 treesize of output 28 [2025-04-13 18:17:15,951 INFO L134 CoverageAnalysis]: Checked inductivity of 10 backedges. 3 proven. 4 refuted. 0 times theorem prover too weak. 3 trivial. 0 not checked. [2025-04-13 18:17:15,951 INFO L312 TraceCheckSpWp]: Computing backward predicates... [2025-04-13 18:17:16,413 INFO L134 CoverageAnalysis]: Checked inductivity of 10 backedges. 0 proven. 4 refuted. 0 times theorem prover too weak. 6 trivial. 0 not checked. [2025-04-13 18:17:16,413 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [752614891] provided 0 perfect and 2 imperfect interpolant sequences [2025-04-13 18:17:16,413 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2025-04-13 18:17:16,413 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [13, 14, 12] total 33 [2025-04-13 18:17:16,414 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1351579669] [2025-04-13 18:17:16,414 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2025-04-13 18:17:16,414 INFO L562 AbstractCegarLoop]: INTERPOLANT automaton has 34 states [2025-04-13 18:17:16,414 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-04-13 18:17:16,414 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 34 interpolants. [2025-04-13 18:17:16,414 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=109, Invalid=1013, Unknown=0, NotChecked=0, Total=1122 [2025-04-13 18:17:16,414 INFO L87 Difference]: Start difference. First operand 10526 states and 42312 transitions. Second operand has 34 states, 33 states have (on average 3.0606060606060606) internal successors, (101), 34 states have internal predecessors, (101), 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 18:18:13,934 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-04-13 18:18:13,934 INFO L93 Difference]: Finished difference Result 31598 states and 122572 transitions. [2025-04-13 18:18:13,934 INFO L140 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 177 states. [2025-04-13 18:18:13,934 INFO L79 Accepts]: Start accepts. Automaton has has 34 states, 33 states have (on average 3.0606060606060606) internal successors, (101), 34 states have internal predecessors, (101), 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 47 [2025-04-13 18:18:13,935 INFO L85 Accepts]: Finished accepts. some prefix is accepted. [2025-04-13 18:18:14,053 INFO L225 Difference]: With dead ends: 31598 [2025-04-13 18:18:14,053 INFO L226 Difference]: Without dead ends: 31116 [2025-04-13 18:18:14,066 INFO L436 NwaCegarLoop]: 0 DeclaredPredicates, 271 GetRequests, 75 SyntacticMatches, 0 SemanticMatches, 196 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 15216 ImplicationChecksByTransitivity, 10.7s TimeCoverageRelationStatistics Valid=3529, Invalid=35477, Unknown=0, NotChecked=0, Total=39006 [2025-04-13 18:18:14,066 INFO L437 NwaCegarLoop]: 41 mSDtfsCounter, 2965 mSDsluCounter, 859 mSDsCounter, 0 mSdLazyCounter, 11900 mSolverCounterSat, 124 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 9.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 2965 SdHoareTripleChecker+Valid, 900 SdHoareTripleChecker+Invalid, 12024 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.1s SdHoareTripleChecker+Time, 124 IncrementalHoareTripleChecker+Valid, 11900 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 10.1s IncrementalHoareTripleChecker+Time [2025-04-13 18:18:14,066 INFO L438 NwaCegarLoop]: SdHoareTripleChecker [2965 Valid, 900 Invalid, 12024 Unknown, 0 Unchecked, 0.1s Time], IncrementalHoareTripleChecker [124 Valid, 11900 Invalid, 0 Unknown, 0 Unchecked, 10.1s Time] [2025-04-13 18:18:14,095 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 31116 states. [2025-04-13 18:18:22,953 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 31116 to 10770. [2025-04-13 18:18:22,968 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 10770 states, 10769 states have (on average 4.026557711950971) internal successors, (43362), 10769 states have internal predecessors, (43362), 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 18:18:22,995 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 10770 states to 10770 states and 43362 transitions. [2025-04-13 18:18:23,029 INFO L79 Accepts]: Start accepts. Automaton has 10770 states and 43362 transitions. Word has length 47 [2025-04-13 18:18:23,029 INFO L85 Accepts]: Finished accepts. word is rejected. [2025-04-13 18:18:23,029 INFO L485 AbstractCegarLoop]: Abstraction has 10770 states and 43362 transitions. [2025-04-13 18:18:23,030 INFO L486 AbstractCegarLoop]: INTERPOLANT automaton has has 34 states, 33 states have (on average 3.0606060606060606) internal successors, (101), 34 states have internal predecessors, (101), 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 18:18:23,030 INFO L278 IsEmpty]: Start isEmpty. Operand 10770 states and 43362 transitions. [2025-04-13 18:18:23,047 INFO L284 IsEmpty]: Finished isEmpty. Found accepting run of length 48 [2025-04-13 18:18:23,047 INFO L210 NwaCegarLoop]: Found error trace [2025-04-13 18:18:23,047 INFO L218 NwaCegarLoop]: trace histogram [3, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-04-13 18:18:23,054 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (56)] Ended with exit code 0 [2025-04-13 18:18:23,247 WARN L466 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable76,56 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-04-13 18:18:23,248 INFO L403 AbstractCegarLoop]: === Iteration 78 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [thread1Err0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES, thread1Err3INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION (and 4 more)] === [2025-04-13 18:18:23,248 INFO L155 PredicateUnifier]: Initialized classic predicate unifier [2025-04-13 18:18:23,248 INFO L85 PathProgramCache]: Analyzing trace with hash 1972404724, now seen corresponding path program 16 times [2025-04-13 18:18:23,248 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-04-13 18:18:23,248 INFO L324 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1947599033] [2025-04-13 18:18:23,248 INFO L95 rtionOrderModulation]: Changing assertion order to TERMS_WITH_SMALL_CONSTANTS_FIRST [2025-04-13 18:18:23,248 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-04-13 18:18:23,254 INFO L108 AnnotateAndAsserter]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST partitioned 47 statements into 2 equivalence classes. [2025-04-13 18:18:23,260 INFO L111 AnnotateAndAsserter]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST issued 2 check-sat command(s) and asserted 47 of 47 statements. [2025-04-13 18:18:23,260 INFO L114 AnnotateAndAsserter]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST issued 2 check-sat command(s) [2025-04-13 18:18:23,260 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-04-13 18:18:23,543 INFO L134 CoverageAnalysis]: Checked inductivity of 9 backedges. 0 proven. 3 refuted. 0 times theorem prover too weak. 6 trivial. 0 not checked. [2025-04-13 18:18:23,543 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-04-13 18:18:23,543 INFO L324 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1947599033] [2025-04-13 18:18:23,543 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1947599033] provided 0 perfect and 1 imperfect interpolant sequences [2025-04-13 18:18:23,543 INFO L324 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1754598518] [2025-04-13 18:18:23,543 INFO L95 rtionOrderModulation]: Changing assertion order to TERMS_WITH_SMALL_CONSTANTS_FIRST [2025-04-13 18:18:23,543 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-04-13 18:18:23,544 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2025-04-13 18:18:23,545 INFO L229 MonitoredProcess]: Starting monitored process 57 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2025-04-13 18:18:23,546 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (57)] Waiting until timeout for monitored process [2025-04-13 18:18:23,645 INFO L108 AnnotateAndAsserter]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST partitioned 47 statements into 2 equivalence classes. [2025-04-13 18:18:23,665 INFO L111 AnnotateAndAsserter]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST issued 2 check-sat command(s) and asserted 47 of 47 statements. [2025-04-13 18:18:23,666 INFO L114 AnnotateAndAsserter]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST issued 2 check-sat command(s) [2025-04-13 18:18:23,666 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-04-13 18:18:23,667 INFO L256 TraceCheckSpWp]: Trace formula consists of 305 conjuncts, 41 conjuncts are in the unsatisfiable core [2025-04-13 18:18:23,668 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-04-13 18:18:23,840 INFO L325 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2025-04-13 18:18:23,840 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 36 treesize of output 12 [2025-04-13 18:18:23,882 INFO L134 CoverageAnalysis]: Checked inductivity of 9 backedges. 0 proven. 3 refuted. 0 times theorem prover too weak. 6 trivial. 0 not checked. [2025-04-13 18:18:23,883 INFO L312 TraceCheckSpWp]: Computing backward predicates... [2025-04-13 18:18:24,129 INFO L325 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2025-04-13 18:18:24,130 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 38 treesize of output 43 [2025-04-13 18:18:24,155 INFO L134 CoverageAnalysis]: Checked inductivity of 9 backedges. 0 proven. 3 refuted. 0 times theorem prover too weak. 6 trivial. 0 not checked. [2025-04-13 18:18:24,155 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1754598518] provided 0 perfect and 2 imperfect interpolant sequences [2025-04-13 18:18:24,155 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2025-04-13 18:18:24,155 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [13, 11, 11] total 29 [2025-04-13 18:18:24,155 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [298721118] [2025-04-13 18:18:24,156 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2025-04-13 18:18:24,156 INFO L562 AbstractCegarLoop]: INTERPOLANT automaton has 30 states [2025-04-13 18:18:24,156 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-04-13 18:18:24,156 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 30 interpolants. [2025-04-13 18:18:24,156 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=92, Invalid=778, Unknown=0, NotChecked=0, Total=870 [2025-04-13 18:18:24,156 INFO L87 Difference]: Start difference. First operand 10770 states and 43362 transitions. Second operand has 30 states, 29 states have (on average 3.310344827586207) internal successors, (96), 30 states have internal predecessors, (96), 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 18:18:49,418 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-04-13 18:18:49,418 INFO L93 Difference]: Finished difference Result 18311 states and 72273 transitions. [2025-04-13 18:18:49,418 INFO L140 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 39 states. [2025-04-13 18:18:49,418 INFO L79 Accepts]: Start accepts. Automaton has has 30 states, 29 states have (on average 3.310344827586207) internal successors, (96), 30 states have internal predecessors, (96), 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 47 [2025-04-13 18:18:49,418 INFO L85 Accepts]: Finished accepts. some prefix is accepted. [2025-04-13 18:18:49,493 INFO L225 Difference]: With dead ends: 18311 [2025-04-13 18:18:49,493 INFO L226 Difference]: Without dead ends: 17846 [2025-04-13 18:18:49,499 INFO L436 NwaCegarLoop]: 0 DeclaredPredicates, 131 GetRequests, 77 SyntacticMatches, 0 SemanticMatches, 54 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 689 ImplicationChecksByTransitivity, 0.9s TimeCoverageRelationStatistics Valid=374, Invalid=2706, Unknown=0, NotChecked=0, Total=3080 [2025-04-13 18:18:49,499 INFO L437 NwaCegarLoop]: 19 mSDtfsCounter, 782 mSDsluCounter, 326 mSDsCounter, 0 mSdLazyCounter, 5432 mSolverCounterSat, 65 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 1.9s Time, 0 mProtectedPredicate, 0 mProtectedAction, 782 SdHoareTripleChecker+Valid, 345 SdHoareTripleChecker+Invalid, 5497 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 65 IncrementalHoareTripleChecker+Valid, 5432 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 2.3s IncrementalHoareTripleChecker+Time [2025-04-13 18:18:49,499 INFO L438 NwaCegarLoop]: SdHoareTripleChecker [782 Valid, 345 Invalid, 5497 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [65 Valid, 5432 Invalid, 0 Unknown, 0 Unchecked, 2.3s Time] [2025-04-13 18:18:49,514 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 17846 states. [2025-04-13 18:18:58,363 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 17846 to 10878. [2025-04-13 18:18:58,378 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 10878 states, 10877 states have (on average 4.0310747448745055) internal successors, (43846), 10877 states have internal predecessors, (43846), 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 18:18:58,408 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 10878 states to 10878 states and 43846 transitions. [2025-04-13 18:18:58,436 INFO L79 Accepts]: Start accepts. Automaton has 10878 states and 43846 transitions. Word has length 47 [2025-04-13 18:18:58,436 INFO L85 Accepts]: Finished accepts. word is rejected. [2025-04-13 18:18:58,436 INFO L485 AbstractCegarLoop]: Abstraction has 10878 states and 43846 transitions. [2025-04-13 18:18:58,436 INFO L486 AbstractCegarLoop]: INTERPOLANT automaton has has 30 states, 29 states have (on average 3.310344827586207) internal successors, (96), 30 states have internal predecessors, (96), 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 18:18:58,436 INFO L278 IsEmpty]: Start isEmpty. Operand 10878 states and 43846 transitions. [2025-04-13 18:18:58,454 INFO L284 IsEmpty]: Finished isEmpty. Found accepting run of length 48 [2025-04-13 18:18:58,454 INFO L210 NwaCegarLoop]: Found error trace [2025-04-13 18:18:58,454 INFO L218 NwaCegarLoop]: trace histogram [3, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-04-13 18:18:58,461 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (57)] Ended with exit code 0 [2025-04-13 18:18:58,654 WARN L466 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable77,57 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-04-13 18:18:58,655 INFO L403 AbstractCegarLoop]: === Iteration 79 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [thread1Err0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES, thread1Err3INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION (and 4 more)] === [2025-04-13 18:18:58,655 INFO L155 PredicateUnifier]: Initialized classic predicate unifier [2025-04-13 18:18:58,655 INFO L85 PathProgramCache]: Analyzing trace with hash 1917026667, now seen corresponding path program 25 times [2025-04-13 18:18:58,655 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-04-13 18:18:58,655 INFO L324 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1440121369] [2025-04-13 18:18:58,655 INFO L95 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2025-04-13 18:18:58,655 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-04-13 18:18:58,661 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 47 statements into 1 equivalence classes. [2025-04-13 18:18:58,667 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 47 of 47 statements. [2025-04-13 18:18:58,667 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-04-13 18:18:58,667 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-04-13 18:18:59,166 INFO L134 CoverageAnalysis]: Checked inductivity of 11 backedges. 0 proven. 11 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-04-13 18:18:59,166 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-04-13 18:18:59,166 INFO L324 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1440121369] [2025-04-13 18:18:59,166 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1440121369] provided 0 perfect and 1 imperfect interpolant sequences [2025-04-13 18:18:59,166 INFO L324 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1859042341] [2025-04-13 18:18:59,166 INFO L95 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2025-04-13 18:18:59,166 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-04-13 18:18:59,166 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2025-04-13 18:18:59,168 INFO L229 MonitoredProcess]: Starting monitored process 58 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2025-04-13 18:18:59,169 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (58)] Waiting until timeout for monitored process [2025-04-13 18:18:59,266 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 47 statements into 1 equivalence classes. [2025-04-13 18:18:59,285 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 47 of 47 statements. [2025-04-13 18:18:59,285 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-04-13 18:18:59,285 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-04-13 18:18:59,286 INFO L256 TraceCheckSpWp]: Trace formula consists of 305 conjuncts, 41 conjuncts are in the unsatisfiable core [2025-04-13 18:18:59,287 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-04-13 18:18:59,505 INFO L325 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2025-04-13 18:18:59,505 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 36 treesize of output 12 [2025-04-13 18:18:59,514 INFO L134 CoverageAnalysis]: Checked inductivity of 11 backedges. 0 proven. 5 refuted. 0 times theorem prover too weak. 6 trivial. 0 not checked. [2025-04-13 18:18:59,514 INFO L312 TraceCheckSpWp]: Computing backward predicates... [2025-04-13 18:18:59,715 INFO L325 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2025-04-13 18:18:59,716 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 38 treesize of output 43 [2025-04-13 18:18:59,736 INFO L134 CoverageAnalysis]: Checked inductivity of 11 backedges. 0 proven. 5 refuted. 0 times theorem prover too weak. 6 trivial. 0 not checked. [2025-04-13 18:18:59,737 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1859042341] provided 0 perfect and 2 imperfect interpolant sequences [2025-04-13 18:18:59,737 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2025-04-13 18:18:59,737 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [16, 11, 11] total 32 [2025-04-13 18:18:59,737 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1993789197] [2025-04-13 18:18:59,737 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2025-04-13 18:18:59,737 INFO L562 AbstractCegarLoop]: INTERPOLANT automaton has 33 states [2025-04-13 18:18:59,737 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-04-13 18:18:59,737 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 33 interpolants. [2025-04-13 18:18:59,737 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=89, Invalid=967, Unknown=0, NotChecked=0, Total=1056 [2025-04-13 18:18:59,738 INFO L87 Difference]: Start difference. First operand 10878 states and 43846 transitions. Second operand has 33 states, 32 states have (on average 3.25) internal successors, (104), 33 states have internal predecessors, (104), 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 18:19:19,893 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-04-13 18:19:19,893 INFO L93 Difference]: Finished difference Result 14531 states and 57659 transitions. [2025-04-13 18:19:19,893 INFO L140 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 26 states. [2025-04-13 18:19:19,894 INFO L79 Accepts]: Start accepts. Automaton has has 33 states, 32 states have (on average 3.25) internal successors, (104), 33 states have internal predecessors, (104), 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 47 [2025-04-13 18:19:19,894 INFO L85 Accepts]: Finished accepts. some prefix is accepted. [2025-04-13 18:19:19,956 INFO L225 Difference]: With dead ends: 14531 [2025-04-13 18:19:19,956 INFO L226 Difference]: Without dead ends: 14280 [2025-04-13 18:19:19,960 INFO L436 NwaCegarLoop]: 0 DeclaredPredicates, 126 GetRequests, 77 SyntacticMatches, 0 SemanticMatches, 49 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 373 ImplicationChecksByTransitivity, 0.8s TimeCoverageRelationStatistics Valid=263, Invalid=2287, Unknown=0, NotChecked=0, Total=2550 [2025-04-13 18:19:19,961 INFO L437 NwaCegarLoop]: 19 mSDtfsCounter, 889 mSDsluCounter, 376 mSDsCounter, 0 mSdLazyCounter, 5495 mSolverCounterSat, 25 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 1.7s Time, 0 mProtectedPredicate, 0 mProtectedAction, 889 SdHoareTripleChecker+Valid, 395 SdHoareTripleChecker+Invalid, 5520 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 25 IncrementalHoareTripleChecker+Valid, 5495 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 2.0s IncrementalHoareTripleChecker+Time [2025-04-13 18:19:19,961 INFO L438 NwaCegarLoop]: SdHoareTripleChecker [889 Valid, 395 Invalid, 5520 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [25 Valid, 5495 Invalid, 0 Unknown, 0 Unchecked, 2.0s Time] [2025-04-13 18:19:19,971 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 14280 states. [2025-04-13 18:19:28,906 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 14280 to 10982. [2025-04-13 18:19:28,918 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 10982 states, 10981 states have (on average 4.022038065749932) internal successors, (44166), 10981 states have internal predecessors, (44166), 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 18:19:28,945 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 10982 states to 10982 states and 44166 transitions. [2025-04-13 18:19:28,966 INFO L79 Accepts]: Start accepts. Automaton has 10982 states and 44166 transitions. Word has length 47 [2025-04-13 18:19:28,967 INFO L85 Accepts]: Finished accepts. word is rejected. [2025-04-13 18:19:28,967 INFO L485 AbstractCegarLoop]: Abstraction has 10982 states and 44166 transitions. [2025-04-13 18:19:28,967 INFO L486 AbstractCegarLoop]: INTERPOLANT automaton has has 33 states, 32 states have (on average 3.25) internal successors, (104), 33 states have internal predecessors, (104), 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 18:19:28,967 INFO L278 IsEmpty]: Start isEmpty. Operand 10982 states and 44166 transitions. [2025-04-13 18:19:28,984 INFO L284 IsEmpty]: Finished isEmpty. Found accepting run of length 48 [2025-04-13 18:19:28,985 INFO L210 NwaCegarLoop]: Found error trace [2025-04-13 18:19:28,985 INFO L218 NwaCegarLoop]: trace histogram [3, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-04-13 18:19:28,991 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (58)] Ended with exit code 0 [2025-04-13 18:19:29,185 WARN L466 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 58 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable78 [2025-04-13 18:19:29,185 INFO L403 AbstractCegarLoop]: === Iteration 80 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [thread1Err0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES, thread1Err3INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION (and 4 more)] === [2025-04-13 18:19:29,186 INFO L155 PredicateUnifier]: Initialized classic predicate unifier [2025-04-13 18:19:29,186 INFO L85 PathProgramCache]: Analyzing trace with hash 1531413173, now seen corresponding path program 30 times [2025-04-13 18:19:29,186 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-04-13 18:19:29,186 INFO L324 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [290618632] [2025-04-13 18:19:29,186 INFO L95 rtionOrderModulation]: Changing assertion order to MIX_INSIDE_OUTSIDE [2025-04-13 18:19:29,186 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-04-13 18:19:29,192 INFO L108 AnnotateAndAsserter]: Assert order MIX_INSIDE_OUTSIDE partitioned 47 statements into 3 equivalence classes. [2025-04-13 18:19:29,201 INFO L111 AnnotateAndAsserter]: Assert order MIX_INSIDE_OUTSIDE issued 3 check-sat command(s) and asserted 47 of 47 statements. [2025-04-13 18:19:29,201 INFO L114 AnnotateAndAsserter]: Assert order MIX_INSIDE_OUTSIDE issued 3 check-sat command(s) [2025-04-13 18:19:29,201 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-04-13 18:19:29,466 INFO L134 CoverageAnalysis]: Checked inductivity of 11 backedges. 0 proven. 5 refuted. 0 times theorem prover too weak. 6 trivial. 0 not checked. [2025-04-13 18:19:29,467 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-04-13 18:19:29,467 INFO L324 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [290618632] [2025-04-13 18:19:29,467 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [290618632] provided 0 perfect and 1 imperfect interpolant sequences [2025-04-13 18:19:29,467 INFO L324 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [298576229] [2025-04-13 18:19:29,467 INFO L95 rtionOrderModulation]: Changing assertion order to MIX_INSIDE_OUTSIDE [2025-04-13 18:19:29,467 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-04-13 18:19:29,467 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2025-04-13 18:19:29,469 INFO L229 MonitoredProcess]: Starting monitored process 59 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2025-04-13 18:19:29,470 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (59)] Waiting until timeout for monitored process [2025-04-13 18:19:29,569 INFO L108 AnnotateAndAsserter]: Assert order MIX_INSIDE_OUTSIDE partitioned 47 statements into 3 equivalence classes. [2025-04-13 18:19:29,592 INFO L111 AnnotateAndAsserter]: Assert order MIX_INSIDE_OUTSIDE issued 3 check-sat command(s) and asserted 47 of 47 statements. [2025-04-13 18:19:29,592 INFO L114 AnnotateAndAsserter]: Assert order MIX_INSIDE_OUTSIDE issued 3 check-sat command(s) [2025-04-13 18:19:29,592 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-04-13 18:19:29,593 INFO L256 TraceCheckSpWp]: Trace formula consists of 305 conjuncts, 60 conjuncts are in the unsatisfiable core [2025-04-13 18:19:29,595 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-04-13 18:19:29,634 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 18:19:30,050 INFO L189 IndexEqualityManager]: detected not equals via solver [2025-04-13 18:19:30,059 INFO L325 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2025-04-13 18:19:30,059 INFO L354 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 3 select indices, 3 select index equivalence classes, 1 disjoint index pairs (out of 3 index pairs), introduced 3 new quantified variables, introduced 3 case distinctions, treesize of input 32 treesize of output 28 [2025-04-13 18:19:30,192 INFO L134 CoverageAnalysis]: Checked inductivity of 11 backedges. 0 proven. 11 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-04-13 18:19:30,192 INFO L312 TraceCheckSpWp]: Computing backward predicates... [2025-04-13 18:19:30,557 INFO L134 CoverageAnalysis]: Checked inductivity of 11 backedges. 0 proven. 5 refuted. 0 times theorem prover too weak. 6 trivial. 0 not checked. [2025-04-13 18:19:30,558 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [298576229] provided 0 perfect and 2 imperfect interpolant sequences [2025-04-13 18:19:30,558 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2025-04-13 18:19:30,558 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [13, 17, 13] total 37 [2025-04-13 18:19:30,558 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1945771453] [2025-04-13 18:19:30,558 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2025-04-13 18:19:30,558 INFO L562 AbstractCegarLoop]: INTERPOLANT automaton has 38 states [2025-04-13 18:19:30,558 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-04-13 18:19:30,558 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 38 interpolants. [2025-04-13 18:19:30,558 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=118, Invalid=1288, Unknown=0, NotChecked=0, Total=1406 [2025-04-13 18:19:30,559 INFO L87 Difference]: Start difference. First operand 10982 states and 44166 transitions. Second operand has 38 states, 37 states have (on average 2.7837837837837838) internal successors, (103), 38 states have internal predecessors, (103), 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 18:20:01,043 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-04-13 18:20:01,043 INFO L93 Difference]: Finished difference Result 19209 states and 74156 transitions. [2025-04-13 18:20:01,044 INFO L140 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 86 states. [2025-04-13 18:20:01,044 INFO L79 Accepts]: Start accepts. Automaton has has 38 states, 37 states have (on average 2.7837837837837838) internal successors, (103), 38 states have internal predecessors, (103), 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 47 [2025-04-13 18:20:01,044 INFO L85 Accepts]: Finished accepts. some prefix is accepted. [2025-04-13 18:20:01,113 INFO L225 Difference]: With dead ends: 19209 [2025-04-13 18:20:01,113 INFO L226 Difference]: Without dead ends: 18778 [2025-04-13 18:20:01,119 INFO L436 NwaCegarLoop]: 0 DeclaredPredicates, 187 GetRequests, 69 SyntacticMatches, 1 SemanticMatches, 117 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 4145 ImplicationChecksByTransitivity, 3.5s TimeCoverageRelationStatistics Valid=1452, Invalid=12590, Unknown=0, NotChecked=0, Total=14042 [2025-04-13 18:20:01,120 INFO L437 NwaCegarLoop]: 39 mSDtfsCounter, 2040 mSDsluCounter, 766 mSDsCounter, 0 mSdLazyCounter, 9551 mSolverCounterSat, 159 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 4.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 2040 SdHoareTripleChecker+Valid, 805 SdHoareTripleChecker+Invalid, 9710 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 159 IncrementalHoareTripleChecker+Valid, 9551 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 4.7s IncrementalHoareTripleChecker+Time [2025-04-13 18:20:01,120 INFO L438 NwaCegarLoop]: SdHoareTripleChecker [2040 Valid, 805 Invalid, 9710 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [159 Valid, 9551 Invalid, 0 Unknown, 0 Unchecked, 4.7s Time] [2025-04-13 18:20:01,135 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 18778 states. [2025-04-13 18:20:10,774 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 18778 to 11434. [2025-04-13 18:20:10,787 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 11434 states, 11433 states have (on average 4.025015306568704) internal successors, (46018), 11433 states have internal predecessors, (46018), 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 18:20:10,817 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 11434 states to 11434 states and 46018 transitions. [2025-04-13 18:20:10,842 INFO L79 Accepts]: Start accepts. Automaton has 11434 states and 46018 transitions. Word has length 47 [2025-04-13 18:20:10,842 INFO L85 Accepts]: Finished accepts. word is rejected. [2025-04-13 18:20:10,842 INFO L485 AbstractCegarLoop]: Abstraction has 11434 states and 46018 transitions. [2025-04-13 18:20:10,842 INFO L486 AbstractCegarLoop]: INTERPOLANT automaton has has 38 states, 37 states have (on average 2.7837837837837838) internal successors, (103), 38 states have internal predecessors, (103), 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 18:20:10,842 INFO L278 IsEmpty]: Start isEmpty. Operand 11434 states and 46018 transitions. [2025-04-13 18:20:10,860 INFO L284 IsEmpty]: Finished isEmpty. Found accepting run of length 48 [2025-04-13 18:20:10,860 INFO L210 NwaCegarLoop]: Found error trace [2025-04-13 18:20:10,860 INFO L218 NwaCegarLoop]: trace histogram [3, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-04-13 18:20:10,866 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (59)] Ended with exit code 0 [2025-04-13 18:20:11,060 WARN L466 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 59 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable79 [2025-04-13 18:20:11,061 INFO L403 AbstractCegarLoop]: === Iteration 81 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [thread1Err0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES, thread1Err3INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION (and 4 more)] === [2025-04-13 18:20:11,061 INFO L155 PredicateUnifier]: Initialized classic predicate unifier [2025-04-13 18:20:11,061 INFO L85 PathProgramCache]: Analyzing trace with hash -1910630204, now seen corresponding path program 17 times [2025-04-13 18:20:11,061 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-04-13 18:20:11,061 INFO L324 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [22312752] [2025-04-13 18:20:11,061 INFO L95 rtionOrderModulation]: Changing assertion order to INSIDE_LOOP_FIRST1 [2025-04-13 18:20:11,061 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-04-13 18:20:11,067 INFO L108 AnnotateAndAsserter]: Assert order INSIDE_LOOP_FIRST1 partitioned 47 statements into 3 equivalence classes. [2025-04-13 18:20:11,073 INFO L111 AnnotateAndAsserter]: Assert order INSIDE_LOOP_FIRST1 issued 3 check-sat command(s) and asserted 47 of 47 statements. [2025-04-13 18:20:11,073 INFO L114 AnnotateAndAsserter]: Assert order INSIDE_LOOP_FIRST1 issued 3 check-sat command(s) [2025-04-13 18:20:11,073 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-04-13 18:20:11,459 INFO L134 CoverageAnalysis]: Checked inductivity of 10 backedges. 0 proven. 10 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-04-13 18:20:11,459 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-04-13 18:20:11,459 INFO L324 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [22312752] [2025-04-13 18:20:11,459 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [22312752] provided 0 perfect and 1 imperfect interpolant sequences [2025-04-13 18:20:11,459 INFO L324 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [82838140] [2025-04-13 18:20:11,459 INFO L95 rtionOrderModulation]: Changing assertion order to INSIDE_LOOP_FIRST1 [2025-04-13 18:20:11,459 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-04-13 18:20:11,460 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2025-04-13 18:20:11,461 INFO L229 MonitoredProcess]: Starting monitored process 60 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2025-04-13 18:20:11,463 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (60)] Waiting until timeout for monitored process [2025-04-13 18:20:11,563 INFO L108 AnnotateAndAsserter]: Assert order INSIDE_LOOP_FIRST1 partitioned 47 statements into 3 equivalence classes. [2025-04-13 18:20:11,584 INFO L111 AnnotateAndAsserter]: Assert order INSIDE_LOOP_FIRST1 issued 3 check-sat command(s) and asserted 47 of 47 statements. [2025-04-13 18:20:11,584 INFO L114 AnnotateAndAsserter]: Assert order INSIDE_LOOP_FIRST1 issued 3 check-sat command(s) [2025-04-13 18:20:11,584 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-04-13 18:20:11,585 INFO L256 TraceCheckSpWp]: Trace formula consists of 305 conjuncts, 43 conjuncts are in the unsatisfiable core [2025-04-13 18:20:11,586 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-04-13 18:20:11,766 INFO L325 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2025-04-13 18:20:11,766 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 36 treesize of output 12 [2025-04-13 18:20:11,775 INFO L134 CoverageAnalysis]: Checked inductivity of 10 backedges. 0 proven. 4 refuted. 0 times theorem prover too weak. 6 trivial. 0 not checked. [2025-04-13 18:20:11,775 INFO L312 TraceCheckSpWp]: Computing backward predicates... [2025-04-13 18:20:11,909 INFO L325 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2025-04-13 18:20:11,909 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 38 treesize of output 43 [2025-04-13 18:20:11,932 INFO L134 CoverageAnalysis]: Checked inductivity of 10 backedges. 0 proven. 4 refuted. 0 times theorem prover too weak. 6 trivial. 0 not checked. [2025-04-13 18:20:11,932 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [82838140] provided 0 perfect and 2 imperfect interpolant sequences [2025-04-13 18:20:11,932 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2025-04-13 18:20:11,932 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [14, 11, 11] total 24 [2025-04-13 18:20:11,932 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [506192428] [2025-04-13 18:20:11,932 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2025-04-13 18:20:11,933 INFO L562 AbstractCegarLoop]: INTERPOLANT automaton has 25 states [2025-04-13 18:20:11,933 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-04-13 18:20:11,933 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 25 interpolants. [2025-04-13 18:20:11,933 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=66, Invalid=534, Unknown=0, NotChecked=0, Total=600 [2025-04-13 18:20:11,933 INFO L87 Difference]: Start difference. First operand 11434 states and 46018 transitions. Second operand has 25 states, 24 states have (on average 3.625) internal successors, (87), 25 states have internal predecessors, (87), 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 18:20:31,542 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-04-13 18:20:31,542 INFO L93 Difference]: Finished difference Result 14403 states and 57469 transitions. [2025-04-13 18:20:31,542 INFO L140 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 23 states. [2025-04-13 18:20:31,542 INFO L79 Accepts]: Start accepts. Automaton has has 25 states, 24 states have (on average 3.625) internal successors, (87), 25 states have internal predecessors, (87), 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 47 [2025-04-13 18:20:31,542 INFO L85 Accepts]: Finished accepts. some prefix is accepted. [2025-04-13 18:20:31,598 INFO L225 Difference]: With dead ends: 14403 [2025-04-13 18:20:31,598 INFO L226 Difference]: Without dead ends: 14176 [2025-04-13 18:20:31,602 INFO L436 NwaCegarLoop]: 0 DeclaredPredicates, 116 GetRequests, 85 SyntacticMatches, 0 SemanticMatches, 31 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 126 ImplicationChecksByTransitivity, 0.4s TimeCoverageRelationStatistics Valid=106, Invalid=950, Unknown=0, NotChecked=0, Total=1056 [2025-04-13 18:20:31,602 INFO L437 NwaCegarLoop]: 19 mSDtfsCounter, 378 mSDsluCounter, 314 mSDsCounter, 0 mSdLazyCounter, 4624 mSolverCounterSat, 4 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 1.4s Time, 0 mProtectedPredicate, 0 mProtectedAction, 378 SdHoareTripleChecker+Valid, 333 SdHoareTripleChecker+Invalid, 4628 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 4 IncrementalHoareTripleChecker+Valid, 4624 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 1.7s IncrementalHoareTripleChecker+Time [2025-04-13 18:20:31,602 INFO L438 NwaCegarLoop]: SdHoareTripleChecker [378 Valid, 333 Invalid, 4628 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [4 Valid, 4624 Invalid, 0 Unknown, 0 Unchecked, 1.7s Time] [2025-04-13 18:20:31,613 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 14176 states. [2025-04-13 18:20:41,212 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 14176 to 11518. [2025-04-13 18:20:41,225 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 11518 states, 11517 states have (on average 4.028132326126595) internal successors, (46392), 11517 states have internal predecessors, (46392), 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 18:20:41,252 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 11518 states to 11518 states and 46392 transitions. [2025-04-13 18:20:41,274 INFO L79 Accepts]: Start accepts. Automaton has 11518 states and 46392 transitions. Word has length 47 [2025-04-13 18:20:41,274 INFO L85 Accepts]: Finished accepts. word is rejected. [2025-04-13 18:20:41,274 INFO L485 AbstractCegarLoop]: Abstraction has 11518 states and 46392 transitions. [2025-04-13 18:20:41,274 INFO L486 AbstractCegarLoop]: INTERPOLANT automaton has has 25 states, 24 states have (on average 3.625) internal successors, (87), 25 states have internal predecessors, (87), 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 18:20:41,274 INFO L278 IsEmpty]: Start isEmpty. Operand 11518 states and 46392 transitions. [2025-04-13 18:20:41,292 INFO L284 IsEmpty]: Finished isEmpty. Found accepting run of length 48 [2025-04-13 18:20:41,293 INFO L210 NwaCegarLoop]: Found error trace [2025-04-13 18:20:41,293 INFO L218 NwaCegarLoop]: trace histogram [3, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-04-13 18:20:41,299 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (60)] Forceful destruction successful, exit code 0 [2025-04-13 18:20:41,493 WARN L466 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable80,60 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-04-13 18:20:41,493 INFO L403 AbstractCegarLoop]: === Iteration 82 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [thread1Err0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES, thread1Err3INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION (and 4 more)] === [2025-04-13 18:20:41,493 INFO L155 PredicateUnifier]: Initialized classic predicate unifier [2025-04-13 18:20:41,494 INFO L85 PathProgramCache]: Analyzing trace with hash 2006116026, now seen corresponding path program 18 times [2025-04-13 18:20:41,494 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-04-13 18:20:41,494 INFO L324 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [682072496] [2025-04-13 18:20:41,494 INFO L95 rtionOrderModulation]: Changing assertion order to MIX_INSIDE_OUTSIDE [2025-04-13 18:20:41,494 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-04-13 18:20:41,499 INFO L108 AnnotateAndAsserter]: Assert order MIX_INSIDE_OUTSIDE partitioned 47 statements into 3 equivalence classes. [2025-04-13 18:20:41,506 INFO L111 AnnotateAndAsserter]: Assert order MIX_INSIDE_OUTSIDE issued 3 check-sat command(s) and asserted 47 of 47 statements. [2025-04-13 18:20:41,507 INFO L114 AnnotateAndAsserter]: Assert order MIX_INSIDE_OUTSIDE issued 3 check-sat command(s) [2025-04-13 18:20:41,507 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-04-13 18:20:41,767 INFO L134 CoverageAnalysis]: Checked inductivity of 10 backedges. 0 proven. 4 refuted. 0 times theorem prover too weak. 6 trivial. 0 not checked. [2025-04-13 18:20:41,767 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-04-13 18:20:41,767 INFO L324 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [682072496] [2025-04-13 18:20:41,767 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [682072496] provided 0 perfect and 1 imperfect interpolant sequences [2025-04-13 18:20:41,767 INFO L324 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [725656849] [2025-04-13 18:20:41,767 INFO L95 rtionOrderModulation]: Changing assertion order to MIX_INSIDE_OUTSIDE [2025-04-13 18:20:41,767 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-04-13 18:20:41,767 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2025-04-13 18:20:41,769 INFO L229 MonitoredProcess]: Starting monitored process 61 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2025-04-13 18:20:41,770 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (61)] Waiting until timeout for monitored process [2025-04-13 18:20:41,870 INFO L108 AnnotateAndAsserter]: Assert order MIX_INSIDE_OUTSIDE partitioned 47 statements into 3 equivalence classes. [2025-04-13 18:20:41,892 INFO L111 AnnotateAndAsserter]: Assert order MIX_INSIDE_OUTSIDE issued 3 check-sat command(s) and asserted 47 of 47 statements. [2025-04-13 18:20:41,893 INFO L114 AnnotateAndAsserter]: Assert order MIX_INSIDE_OUTSIDE issued 3 check-sat command(s) [2025-04-13 18:20:41,893 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-04-13 18:20:41,894 INFO L256 TraceCheckSpWp]: Trace formula consists of 305 conjuncts, 59 conjuncts are in the unsatisfiable core [2025-04-13 18:20:41,895 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-04-13 18:20:41,935 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 18:20:42,344 INFO L189 IndexEqualityManager]: detected not equals via solver [2025-04-13 18:20:42,354 INFO L325 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2025-04-13 18:20:42,354 INFO L354 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 4 select indices, 4 select index equivalence classes, 3 disjoint index pairs (out of 6 index pairs), introduced 4 new quantified variables, introduced 6 case distinctions, treesize of input 34 treesize of output 36 [2025-04-13 18:20:42,441 INFO L134 CoverageAnalysis]: Checked inductivity of 10 backedges. 0 proven. 10 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-04-13 18:20:42,441 INFO L312 TraceCheckSpWp]: Computing backward predicates... [2025-04-13 18:20:42,750 INFO L134 CoverageAnalysis]: Checked inductivity of 10 backedges. 0 proven. 4 refuted. 0 times theorem prover too weak. 6 trivial. 0 not checked. [2025-04-13 18:20:42,750 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [725656849] provided 0 perfect and 2 imperfect interpolant sequences [2025-04-13 18:20:42,750 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2025-04-13 18:20:42,750 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [13, 16, 12] total 35 [2025-04-13 18:20:42,750 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [561840041] [2025-04-13 18:20:42,750 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2025-04-13 18:20:42,750 INFO L562 AbstractCegarLoop]: INTERPOLANT automaton has 36 states [2025-04-13 18:20:42,750 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-04-13 18:20:42,751 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 36 interpolants. [2025-04-13 18:20:42,751 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=117, Invalid=1143, Unknown=0, NotChecked=0, Total=1260 [2025-04-13 18:20:42,751 INFO L87 Difference]: Start difference. First operand 11518 states and 46392 transitions. Second operand has 36 states, 35 states have (on average 3.0285714285714285) internal successors, (106), 36 states have internal predecessors, (106), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Received shutdown request... [2025-04-13 18:21:03,376 INFO L140 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 55 states. [2025-04-13 18:21:03,377 INFO L436 NwaCegarLoop]: 0 DeclaredPredicates, 155 GetRequests, 72 SyntacticMatches, 0 SemanticMatches, 83 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1832 ImplicationChecksByTransitivity, 2.7s TimeCoverageRelationStatistics Valid=775, Invalid=6365, Unknown=0, NotChecked=0, Total=7140 [2025-04-13 18:21:03,377 INFO L437 NwaCegarLoop]: 23 mSDtfsCounter, 1100 mSDsluCounter, 621 mSDsCounter, 0 mSdLazyCounter, 6259 mSolverCounterSat, 42 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 5.4s Time, 0 mProtectedPredicate, 0 mProtectedAction, 1100 SdHoareTripleChecker+Valid, 644 SdHoareTripleChecker+Invalid, 6301 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 42 IncrementalHoareTripleChecker+Valid, 6259 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 5.8s IncrementalHoareTripleChecker+Time [2025-04-13 18:21:03,377 INFO L438 NwaCegarLoop]: SdHoareTripleChecker [1100 Valid, 644 Invalid, 6301 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [42 Valid, 6259 Invalid, 0 Unknown, 0 Unchecked, 5.8s Time] [2025-04-13 18:21:03,378 INFO L790 garLoopResultBuilder]: Registering result TIMEOUT for location ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION (6 of 7 remaining) [2025-04-13 18:21:03,381 WARN L340 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (61)] Timeout while monitored process is still running, waiting 1000 ms for graceful end [2025-04-13 18:21:03,381 WARN L340 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 (1)] Timeout while monitored process is still running, waiting 1000 ms for graceful end [2025-04-13 18:21:03,385 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (61)] Ended with exit code 0 [2025-04-13 18:21:03,578 WARN L466 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable81,61 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-04-13 18:21:03,579 WARN L610 AbstractCegarLoop]: Verification canceled: while NwaCegarLoop was constructing difference of abstraction (11518states) and FLOYD_HOARE automaton (currently 55 states, 36 states before enhancement),while ReachableStatesComputation was computing reachable states (10337 states constructed, input type IntersectNwa). [2025-04-13 18:21:03,580 INFO L790 garLoopResultBuilder]: Registering result TIMEOUT for location thread1Err0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (5 of 7 remaining) [2025-04-13 18:21:03,580 INFO L790 garLoopResultBuilder]: Registering result TIMEOUT for location thread1Err3INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (4 of 7 remaining) [2025-04-13 18:21:03,580 INFO L790 garLoopResultBuilder]: Registering result TIMEOUT for location ULTIMATE.startErr4INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (3 of 7 remaining) [2025-04-13 18:21:03,580 INFO L790 garLoopResultBuilder]: Registering result TIMEOUT for location ULTIMATE.startErr5INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (2 of 7 remaining) [2025-04-13 18:21:03,580 INFO L790 garLoopResultBuilder]: Registering result TIMEOUT for location thread1Thread1of1ForFork0Err1INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (1 of 7 remaining) [2025-04-13 18:21:03,581 INFO L790 garLoopResultBuilder]: Registering result TIMEOUT for location thread1Thread1of1ForFork0Err2INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (0 of 7 remaining) [2025-04-13 18:21:03,582 INFO L422 BasicCegarLoop]: Path program histogram: [30, 25, 18, 3, 2, 2, 1, 1] [2025-04-13 18:21:03,587 INFO L242 ceAbstractionStarter]: Analysis of concurrent program completed with 1 thread instances [2025-04-13 18:21:03,587 INFO L171 ceAbstractionStarter]: Computing trace abstraction results [2025-04-13 18:21:03,589 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction CFG 13.04 06:21:03 BasicIcfg [2025-04-13 18:21:03,589 INFO L131 PluginConnector]: ------------------------ END TraceAbstraction---------------------------- [2025-04-13 18:21:03,590 INFO L158 Benchmark]: Toolchain (without parser) took 855243.07ms. Allocated memory was 155.2MB in the beginning and 2.3GB in the end (delta: 2.1GB). Free memory was 107.7MB in the beginning and 924.6MB in the end (delta: -816.9MB). Peak memory consumption was 2.1GB. Max. memory is 8.0GB. [2025-04-13 18:21:03,590 INFO L158 Benchmark]: CDTParser took 0.15ms. Allocated memory is still 159.4MB. Free memory is still 87.5MB. There was no memory consumed. Max. memory is 8.0GB. [2025-04-13 18:21:03,590 INFO L158 Benchmark]: CACSL2BoogieTranslator took 284.54ms. Allocated memory is still 155.2MB. Free memory was 107.7MB in the beginning and 92.2MB in the end (delta: 15.6MB). Peak memory consumption was 12.6MB. Max. memory is 8.0GB. [2025-04-13 18:21:03,590 INFO L158 Benchmark]: Boogie Procedure Inliner took 49.46ms. Allocated memory is still 155.2MB. Free memory was 92.2MB in the beginning and 89.6MB in the end (delta: 2.6MB). Peak memory consumption was 4.2MB. Max. memory is 8.0GB. [2025-04-13 18:21:03,590 INFO L158 Benchmark]: Boogie Preprocessor took 59.79ms. Allocated memory is still 155.2MB. Free memory was 89.6MB in the beginning and 86.9MB in the end (delta: 2.6MB). Peak memory consumption was 4.2MB. Max. memory is 8.0GB. [2025-04-13 18:21:03,590 INFO L158 Benchmark]: RCFGBuilder took 785.80ms. Allocated memory is still 155.2MB. Free memory was 86.9MB in the beginning and 76.9MB in the end (delta: 10.0MB). Peak memory consumption was 70.2MB. Max. memory is 8.0GB. [2025-04-13 18:21:03,590 INFO L158 Benchmark]: TraceAbstraction took 854058.25ms. Allocated memory was 155.2MB in the beginning and 2.3GB in the end (delta: 2.1GB). Free memory was 76.9MB in the beginning and 924.6MB in the end (delta: -847.8MB). Peak memory consumption was 2.0GB. Max. memory is 8.0GB. [2025-04-13 18:21:03,591 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.15ms. Allocated memory is still 159.4MB. Free memory is still 87.5MB. There was no memory consumed. Max. memory is 8.0GB. * CACSL2BoogieTranslator took 284.54ms. Allocated memory is still 155.2MB. Free memory was 107.7MB in the beginning and 92.2MB in the end (delta: 15.6MB). Peak memory consumption was 12.6MB. Max. memory is 8.0GB. * Boogie Procedure Inliner took 49.46ms. Allocated memory is still 155.2MB. Free memory was 92.2MB in the beginning and 89.6MB in the end (delta: 2.6MB). Peak memory consumption was 4.2MB. Max. memory is 8.0GB. * Boogie Preprocessor took 59.79ms. Allocated memory is still 155.2MB. Free memory was 89.6MB in the beginning and 86.9MB in the end (delta: 2.6MB). Peak memory consumption was 4.2MB. Max. memory is 8.0GB. * RCFGBuilder took 785.80ms. Allocated memory is still 155.2MB. Free memory was 86.9MB in the beginning and 76.9MB in the end (delta: 10.0MB). Peak memory consumption was 70.2MB. Max. memory is 8.0GB. * TraceAbstraction took 854058.25ms. Allocated memory was 155.2MB in the beginning and 2.3GB in the end (delta: 2.1GB). Free memory was 76.9MB in the beginning and 924.6MB in the end (delta: -847.8MB). Peak memory consumption was 2.0GB. Max. memory is 8.0GB. * Results from de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction: - StatisticsResult: ErrorAutomatonStatistics NumberErrorTraces: 0, NumberStatementsAllTraces: 0, NumberRelevantStatements: 0, 0.0s ErrorAutomatonConstructionTimeTotal, 0.0s FaulLocalizationTime, NumberStatementsFirstTrace: -1, TraceLengthAvg: 0, 0.0s ErrorAutomatonConstructionTimeAvg, 0.0s ErrorAutomatonDifferenceTimeAvg, 0.0s ErrorAutomatonDifferenceTimeTotal, NumberOfNoEnhancement: 0, NumberOfFiniteEnhancement: 0, NumberOfInfiniteEnhancement: 0 - TimeoutResultAtElement [Line: 144]: Timeout (TraceAbstraction) Unable to prove that a call to reach_error is unreachable Cancelled while NwaCegarLoop was constructing difference of abstraction (11518states) and FLOYD_HOARE automaton (currently 55 states, 36 states before enhancement),while ReachableStatesComputation was computing reachable states (10337 states constructed, input type IntersectNwa). - TimeoutResultAtElement [Line: 91]: Timeout (TraceAbstraction) Unable to prove that petrification did provide enough thread instances (tool internal message) Cancelled while NwaCegarLoop was constructing difference of abstraction (11518states) and FLOYD_HOARE automaton (currently 55 states, 36 states before enhancement),while ReachableStatesComputation was computing reachable states (10337 states constructed, input type IntersectNwa). - TimeoutResultAtElement [Line: 92]: Timeout (TraceAbstraction) Unable to prove that petrification did provide enough thread instances (tool internal message) Cancelled while NwaCegarLoop was constructing difference of abstraction (11518states) and FLOYD_HOARE automaton (currently 55 states, 36 states before enhancement),while ReachableStatesComputation was computing reachable states (10337 states constructed, input type IntersectNwa). - TimeoutResultAtElement [Line: 138]: Timeout (TraceAbstraction) Unable to prove that petrification did provide enough thread instances (tool internal message) Cancelled while NwaCegarLoop was constructing difference of abstraction (11518states) and FLOYD_HOARE automaton (currently 55 states, 36 states before enhancement),while ReachableStatesComputation was computing reachable states (10337 states constructed, input type IntersectNwa). - TimeoutResultAtElement [Line: 139]: Timeout (TraceAbstraction) Unable to prove that petrification did provide enough thread instances (tool internal message) Cancelled while NwaCegarLoop was constructing difference of abstraction (11518states) and FLOYD_HOARE automaton (currently 55 states, 36 states before enhancement),while ReachableStatesComputation was computing reachable states (10337 states constructed, input type IntersectNwa). - TimeoutResultAtElement [Line: 91]: Timeout (TraceAbstraction) Unable to prove that petrification did provide enough thread instances (tool internal message) Cancelled while NwaCegarLoop was constructing difference of abstraction (11518states) and FLOYD_HOARE automaton (currently 55 states, 36 states before enhancement),while ReachableStatesComputation was computing reachable states (10337 states constructed, input type IntersectNwa). - TimeoutResultAtElement [Line: 92]: Timeout (TraceAbstraction) Unable to prove that petrification did provide enough thread instances (tool internal message) Cancelled while NwaCegarLoop was constructing difference of abstraction (11518states) and FLOYD_HOARE automaton (currently 55 states, 36 states before enhancement),while ReachableStatesComputation was computing reachable states (10337 states constructed, input type IntersectNwa). - StatisticsResult: Ultimate Automizer benchmark data with 1 thread instances CFG has 9 procedures, 83 locations, 97 edges, 7 error locations. Started 1 CEGAR loops. OverallTime: 853.9s, OverallIterations: 82, TraceHistogramMax: 3, PathProgramHistogramMax: 30, EmptinessCheckTime: 0.9s, AutomataDifference: 618.7s, DeadEndRemovalTime: 0.0s, HoareAnnotationTime: 0.0s, InitialAbstractionConstructionTime: 0.1s, HoareTripleCheckerStatistics: 7 mSolverCounterUnknown, 42035 SdHoareTripleChecker+Valid, 141.8s IncrementalHoareTripleChecker+Time, 0 mSdLazyCounter, 42035 mSDsluCounter, 17015 SdHoareTripleChecker+Invalid, 125.6s Time, 0 mProtectedAction, 0 SdHoareTripleChecker+Unchecked, 0 IncrementalHoareTripleChecker+Unchecked, 15867 mSDsCounter, 1115 IncrementalHoareTripleChecker+Valid, 0 mProtectedPredicate, 223695 IncrementalHoareTripleChecker+Invalid, 224817 SdHoareTripleChecker+Unknown, 0 mSolverCounterNotChecked, 1115 mSolverCounterUnsat, 1148 mSDtfsCounter, 223695 mSolverCounterSat, 0.8s SdHoareTripleChecker+Time, 7 IncrementalHoareTripleChecker+Unknown, PredicateUnifierStatistics: 0 DeclaredPredicates, 7267 GetRequests, 4451 SyntacticMatches, 18 SemanticMatches, 2798 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 59834 ImplicationChecksByTransitivity, 66.1s Time, 0.0s BasicInterpolantAutomatonTime, BiggestAbstraction: size=11518occurred in iteration=81, InterpolantAutomatonStates: 1934, traceCheckStatistics: No data available, InterpolantConsolidationStatistics: No data available, PathInvariantsStatistics: No data available, 0/0 InterpolantCoveringCapability, TotalInterpolationStatistics: No data available, 0.0s DumpTime, AutomataMinimizationStatistics: 165.4s AutomataMinimizationTime, 81 MinimizatonAttempts, 297118 StatesRemovedByMinimization, 78 NontrivialMinimizations, HoareAnnotationStatistics: No data available, RefinementEngineStatistics: TRACE_CHECK: 0.9s SsaConstructionTime, 2.2s SatisfiabilityAnalysisTime, 47.3s InterpolantComputationTime, 6007 NumberOfCodeBlocks, 5949 NumberOfCodeBlocksAsserted, 259 NumberOfCheckSat, 8305 ConstructedInterpolants, 226 QuantifiedInterpolants, 80897 SizeOfPredicates, 733 NumberOfNonLiveVariables, 16819 ConjunctsInSsa, 2145 ConjunctsInUnsatCore, 200 InterpolantComputations, 30 PerfectInterpolantSequences, 602/1354 InterpolantCoveringCapability, INVARIANT_SYNTHESIS: No data available, INTERPOLANT_CONSOLIDATION: No data available, ABSTRACT_INTERPRETATION: No data available, PDR: No data available, ACCELERATED_INTERPOLATION: No data available, SIFA: No data available, ReuseStatistics: No data available, ConComCheckerStatistics: No data available RESULT: Ultimate could not prove your program: Timeout Completed graceful shutdown