/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/popl20-min-max-inc.wvr.c -------------------------------------------------------------------------------- This is Ultimate 0.3.0-wip.dk.cfg-lbe-improvements-94356ea-m [2025-04-13 18:20:26,784 INFO L188 SettingsManager]: Resetting all preferences to default values... [2025-04-13 18:20:26,827 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:20:26,833 WARN L101 SettingsManager]: Preference file contains the following unknown settings: [2025-04-13 18:20:26,833 WARN L103 SettingsManager]: * de.uni_freiburg.informatik.ultimate.core.Log level for class [2025-04-13 18:20:26,850 INFO L130 SettingsManager]: Preferences different from defaults after loading the file: [2025-04-13 18:20:26,850 INFO L151 SettingsManager]: Preferences of UltimateCore differ from their defaults: [2025-04-13 18:20:26,850 INFO L153 SettingsManager]: * Log level for class=de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher=ERROR; [2025-04-13 18:20:26,850 INFO L151 SettingsManager]: Preferences of Boogie Preprocessor differ from their defaults: [2025-04-13 18:20:26,850 INFO L153 SettingsManager]: * Use memory slicer=true [2025-04-13 18:20:26,851 INFO L151 SettingsManager]: Preferences of Boogie Procedure Inliner differ from their defaults: [2025-04-13 18:20:26,851 INFO L153 SettingsManager]: * Ignore calls to procedures called more than once=ONLY_FOR_SEQUENTIAL_PROGRAMS [2025-04-13 18:20:26,851 INFO L151 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2025-04-13 18:20:26,851 INFO L153 SettingsManager]: * Create parallel compositions if possible=false [2025-04-13 18:20:26,851 INFO L153 SettingsManager]: * Use SBE=true [2025-04-13 18:20:26,851 INFO L151 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2025-04-13 18:20:26,851 INFO L153 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2025-04-13 18:20:26,851 INFO L153 SettingsManager]: * sizeof long=4 [2025-04-13 18:20:26,851 INFO L153 SettingsManager]: * Overapproximate operations on floating types=true [2025-04-13 18:20:26,851 INFO L153 SettingsManager]: * sizeof POINTER=4 [2025-04-13 18:20:26,851 INFO L153 SettingsManager]: * Check division by zero=IGNORE [2025-04-13 18:20:26,851 INFO L153 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2025-04-13 18:20:26,851 INFO L153 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2025-04-13 18:20:26,851 INFO L153 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2025-04-13 18:20:26,852 INFO L153 SettingsManager]: * sizeof long double=12 [2025-04-13 18:20:26,852 INFO L153 SettingsManager]: * Check if freed pointer was valid=false [2025-04-13 18:20:26,852 INFO L153 SettingsManager]: * Behaviour of calls to undefined functions=OVERAPPROXIMATE_BEHAVIOUR [2025-04-13 18:20:26,852 INFO L153 SettingsManager]: * Use constant arrays=true [2025-04-13 18:20:26,852 INFO L151 SettingsManager]: Preferences of IcfgBuilder differ from their defaults: [2025-04-13 18:20:26,852 INFO L153 SettingsManager]: * Size of a code block=SequenceOfStatements [2025-04-13 18:20:26,852 INFO L153 SettingsManager]: * Only consider context switches at boundaries of atomic blocks=true [2025-04-13 18:20:26,852 INFO L153 SettingsManager]: * SMT solver=External_DefaultMode [2025-04-13 18:20:26,852 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2025-04-13 18:20:26,852 INFO L151 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2025-04-13 18:20:26,852 INFO L153 SettingsManager]: * Size of a code block=SequenceOfStatements [2025-04-13 18:20:26,852 INFO L153 SettingsManager]: * Only consider context switches at boundaries of atomic blocks=true [2025-04-13 18:20:26,852 INFO L153 SettingsManager]: * SMT solver=External_DefaultMode [2025-04-13 18:20:26,852 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2025-04-13 18:20:26,852 INFO L151 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2025-04-13 18:20:26,852 INFO L153 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2025-04-13 18:20:26,853 INFO L153 SettingsManager]: * Compute procedure contracts=false [2025-04-13 18:20:26,853 INFO L153 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopHeads [2025-04-13 18:20:26,853 INFO L153 SettingsManager]: * Trace refinement strategy=CAMEL [2025-04-13 18:20:26,853 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2025-04-13 18:20:26,853 INFO L153 SettingsManager]: * Automaton type used in concurrency analysis=PETRI_NET [2025-04-13 18:20:26,853 INFO L153 SettingsManager]: * Order on configurations for Petri net unfoldings=DBO [2025-04-13 18:20:26,853 INFO L153 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode [2025-04-13 18:20:26,853 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:20:27,059 INFO L75 nceAwareModelManager]: Repository-Root is: /tmp [2025-04-13 18:20:27,064 INFO L261 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2025-04-13 18:20:27,067 INFO L217 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2025-04-13 18:20:27,067 INFO L270 PluginConnector]: Initializing CDTParser... [2025-04-13 18:20:27,067 INFO L274 PluginConnector]: CDTParser initialized [2025-04-13 18:20:27,068 INFO L431 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/../../../trunk/examples/svcomp/weaver/popl20-min-max-inc.wvr.c [2025-04-13 18:20:28,348 INFO L538 CDTParser]: Created temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/74760b0d4/05465252f35a40f88a12b0e366577956/FLAG059787ae6 [2025-04-13 18:20:28,542 INFO L389 CDTParser]: Found 1 translation units. [2025-04-13 18:20:28,543 INFO L178 CDTParser]: Scanning /storage/repos/ultimate/trunk/examples/svcomp/weaver/popl20-min-max-inc.wvr.c [2025-04-13 18:20:28,549 INFO L432 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/74760b0d4/05465252f35a40f88a12b0e366577956/FLAG059787ae6 [2025-04-13 18:20:29,398 INFO L440 CDTParser]: Successfully deleted /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/74760b0d4/05465252f35a40f88a12b0e366577956 [2025-04-13 18:20:29,400 INFO L299 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2025-04-13 18:20:29,401 INFO L133 ToolchainWalker]: Walking toolchain with 5 elements. [2025-04-13 18:20:29,402 INFO L112 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2025-04-13 18:20:29,402 INFO L270 PluginConnector]: Initializing CACSL2BoogieTranslator... [2025-04-13 18:20:29,405 INFO L274 PluginConnector]: CACSL2BoogieTranslator initialized [2025-04-13 18:20:29,405 INFO L184 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 13.04 06:20:29" (1/1) ... [2025-04-13 18:20:29,406 INFO L204 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@9b9a682 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 13.04 06:20:29, skipping insertion in model container [2025-04-13 18:20:29,406 INFO L184 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 13.04 06:20:29" (1/1) ... [2025-04-13 18:20:29,417 INFO L175 MainTranslator]: Built tables and reachable declarations [2025-04-13 18:20:29,559 WARN L250 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate/trunk/examples/svcomp/weaver/popl20-min-max-inc.wvr.c[2682,2695] [2025-04-13 18:20:29,566 INFO L210 PostProcessor]: Analyzing one entry point: main [2025-04-13 18:20:29,573 INFO L200 MainTranslator]: Completed pre-run [2025-04-13 18:20:29,601 WARN L250 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate/trunk/examples/svcomp/weaver/popl20-min-max-inc.wvr.c[2682,2695] [2025-04-13 18:20:29,604 INFO L210 PostProcessor]: Analyzing one entry point: main [2025-04-13 18:20:29,616 INFO L204 MainTranslator]: Completed translation [2025-04-13 18:20:29,616 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 13.04 06:20:29 WrapperNode [2025-04-13 18:20:29,616 INFO L131 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2025-04-13 18:20:29,617 INFO L112 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2025-04-13 18:20:29,617 INFO L270 PluginConnector]: Initializing Boogie Procedure Inliner... [2025-04-13 18:20:29,617 INFO L274 PluginConnector]: Boogie Procedure Inliner initialized [2025-04-13 18:20:29,621 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:20:29" (1/1) ... [2025-04-13 18:20:29,626 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:20:29" (1/1) ... [2025-04-13 18:20:29,638 INFO L138 Inliner]: procedures = 23, calls = 25, calls flagged for inlining = 8, calls inlined = 8, statements flattened = 112 [2025-04-13 18:20:29,639 INFO L131 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2025-04-13 18:20:29,639 INFO L112 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2025-04-13 18:20:29,639 INFO L270 PluginConnector]: Initializing Boogie Preprocessor... [2025-04-13 18:20:29,639 INFO L274 PluginConnector]: Boogie Preprocessor initialized [2025-04-13 18:20:29,645 INFO L184 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 13.04 06:20:29" (1/1) ... [2025-04-13 18:20:29,646 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 13.04 06:20:29" (1/1) ... [2025-04-13 18:20:29,647 INFO L184 PluginConnector]: Executing the observer MemorySlicer from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 13.04 06:20:29" (1/1) ... [2025-04-13 18:20:29,661 INFO L175 MemorySlicer]: Split 10 memory accesses to 2 slices as follows [2, 8]. 80 percent of accesses are in the largest equivalence class. The 2 initializations are split as follows [2, 0]. The 2 writes are split as follows [0, 2]. [2025-04-13 18:20:29,661 INFO L184 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 13.04 06:20:29" (1/1) ... [2025-04-13 18:20:29,661 INFO L184 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 13.04 06:20:29" (1/1) ... [2025-04-13 18:20:29,666 INFO L184 PluginConnector]: Executing the observer ReplaceArrayAssignments from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 13.04 06:20:29" (1/1) ... [2025-04-13 18:20:29,666 INFO L184 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 13.04 06:20:29" (1/1) ... [2025-04-13 18:20:29,670 INFO L184 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 13.04 06:20:29" (1/1) ... [2025-04-13 18:20:29,671 INFO L184 PluginConnector]: Executing the observer LTLStepAnnotator from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 13.04 06:20:29" (1/1) ... [2025-04-13 18:20:29,671 INFO L184 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 13.04 06:20:29" (1/1) ... [2025-04-13 18:20:29,680 INFO L131 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2025-04-13 18:20:29,680 INFO L112 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2025-04-13 18:20:29,680 INFO L270 PluginConnector]: Initializing RCFGBuilder... [2025-04-13 18:20:29,680 INFO L274 PluginConnector]: RCFGBuilder initialized [2025-04-13 18:20:29,681 INFO L184 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 13.04 06:20:29" (1/1) ... [2025-04-13 18:20:29,687 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2025-04-13 18:20:29,695 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2025-04-13 18:20:29,704 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:20:29,708 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:20:29,720 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocInit [2025-04-13 18:20:29,720 INFO L130 BoogieDeclarations]: Found specification of procedure thread1 [2025-04-13 18:20:29,720 INFO L138 BoogieDeclarations]: Found implementation of procedure thread1 [2025-04-13 18:20:29,720 INFO L130 BoogieDeclarations]: Found specification of procedure thread2 [2025-04-13 18:20:29,720 INFO L138 BoogieDeclarations]: Found implementation of procedure thread2 [2025-04-13 18:20:29,720 INFO L130 BoogieDeclarations]: Found specification of procedure thread3 [2025-04-13 18:20:29,720 INFO L138 BoogieDeclarations]: Found implementation of procedure thread3 [2025-04-13 18:20:29,720 INFO L130 BoogieDeclarations]: Found specification of procedure thread4 [2025-04-13 18:20:29,720 INFO L138 BoogieDeclarations]: Found implementation of procedure thread4 [2025-04-13 18:20:29,720 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int#0 [2025-04-13 18:20:29,720 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int#1 [2025-04-13 18:20:29,720 INFO L130 BoogieDeclarations]: Found specification of procedure write~int#0 [2025-04-13 18:20:29,720 INFO L130 BoogieDeclarations]: Found specification of procedure write~int#1 [2025-04-13 18:20:29,720 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocOnHeap [2025-04-13 18:20:29,720 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2025-04-13 18:20:29,720 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2025-04-13 18:20:29,720 INFO L130 BoogieDeclarations]: Found specification of procedure read~int#0 [2025-04-13 18:20:29,720 INFO L130 BoogieDeclarations]: Found specification of procedure read~int#1 [2025-04-13 18:20:29,721 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:20:29,815 INFO L234 CfgBuilder]: Building ICFG [2025-04-13 18:20:29,817 INFO L260 CfgBuilder]: Building CFG for each procedure with an implementation [2025-04-13 18:20:30,055 INFO L279 CfgBuilder]: Omitted future-live optimization because the input is a concurrent program. [2025-04-13 18:20:30,056 INFO L289 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2025-04-13 18:20:30,056 INFO L294 CfgBuilder]: Performing block encoding [2025-04-13 18:20:30,211 WARN L179 LargeBlockEncoding]: Complex 2:2 sequential composition. Such compositions can cause exponential blowup and should not occur in structured programs. [2025-04-13 18:20:30,213 WARN L179 LargeBlockEncoding]: Complex 2:2 sequential composition. Such compositions can cause exponential blowup and should not occur in structured programs. [2025-04-13 18:20:30,214 WARN L179 LargeBlockEncoding]: Complex 2:2 sequential composition. Such compositions can cause exponential blowup and should not occur in structured programs. [2025-04-13 18:20:30,219 INFO L313 CfgBuilder]: Removed 0 assume(true) statements. [2025-04-13 18:20:30,219 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 13.04 06:20:30 BoogieIcfgContainer [2025-04-13 18:20:30,219 INFO L131 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2025-04-13 18:20:30,221 INFO L112 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2025-04-13 18:20:30,221 INFO L270 PluginConnector]: Initializing TraceAbstraction... [2025-04-13 18:20:30,224 INFO L274 PluginConnector]: TraceAbstraction initialized [2025-04-13 18:20:30,224 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 13.04 06:20:29" (1/3) ... [2025-04-13 18:20:30,224 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@3ec6e1c2 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 13.04 06:20:30, skipping insertion in model container [2025-04-13 18:20:30,224 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 13.04 06:20:29" (2/3) ... [2025-04-13 18:20:30,225 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@3ec6e1c2 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 13.04 06:20:30, skipping insertion in model container [2025-04-13 18:20:30,225 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 13.04 06:20:30" (3/3) ... [2025-04-13 18:20:30,225 INFO L128 eAbstractionObserver]: Analyzing ICFG popl20-min-max-inc.wvr.c [2025-04-13 18:20:30,234 INFO L217 ceAbstractionStarter]: Automizer settings: Hoare:LoopHeads NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2025-04-13 18:20:30,235 INFO L151 ceAbstractionStarter]: Applying trace abstraction to ICFG popl20-min-max-inc.wvr.c that has 5 procedures, 51 locations, 55 edges, 1 initial locations, 4 loop locations, and 1 error locations. [2025-04-13 18:20:30,235 INFO L490 ceAbstractionStarter]: Constructing petrified ICFG for 1 thread instances. [2025-04-13 18:20:30,285 INFO L143 ThreadInstanceAdder]: Constructed 4 joinOtherThreadTransitions. [2025-04-13 18:20:30,307 INFO L113 iNet2FiniteAutomaton]: Start petriNet2FiniteAutomaton. Operand has 63 places, 59 transitions, 146 flow [2025-04-13 18:20:30,614 INFO L135 iNet2FiniteAutomaton]: Finished petriNet2FiniteAutomaton. Result has 7823 states, 7822 states have (on average 4.6498338020966505) internal successors, (36371), 7822 states have internal predecessors, (36371), 0 states have call successors, (0), 0 states have 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:30,635 INFO L339 AbstractCegarLoop]: ======== Iteration 0 == of CEGAR loop == AllErrorsAtOnce ======== [2025-04-13 18:20:30,644 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;@23d66bf3, mLbeIndependenceSettings=[IndependenceType=SEMANTIC, AbstractionType=NONE, UseConditional=false, UseSemiCommutativity=true, Solver=Z3, SolverTimeout=1000ms] [2025-04-13 18:20:30,644 INFO L341 AbstractCegarLoop]: Starting to check reachability of 5 error locations. [2025-04-13 18:20:30,677 INFO L278 IsEmpty]: Start isEmpty. Operand has 7823 states, 7822 states have (on average 4.6498338020966505) internal successors, (36371), 7822 states have internal predecessors, (36371), 0 states have call successors, (0), 0 states have 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:30,742 INFO L284 IsEmpty]: Finished isEmpty. Found accepting run of length 34 [2025-04-13 18:20:30,742 INFO L210 NwaCegarLoop]: Found error trace [2025-04-13 18:20:30,742 INFO L218 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-04-13 18:20:30,743 INFO L403 AbstractCegarLoop]: === Iteration 1 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES, ULTIMATE.startErr1INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 2 more)] === [2025-04-13 18:20:30,746 INFO L155 PredicateUnifier]: Initialized classic predicate unifier [2025-04-13 18:20:30,747 INFO L85 PathProgramCache]: Analyzing trace with hash 1559566285, now seen corresponding path program 1 times [2025-04-13 18:20:30,753 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-04-13 18:20:30,754 INFO L324 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1915834302] [2025-04-13 18:20:30,754 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-04-13 18:20:30,754 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-04-13 18:20:30,813 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 33 statements into 1 equivalence classes. [2025-04-13 18:20:30,841 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 33 of 33 statements. [2025-04-13 18:20:30,842 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-04-13 18:20:30,842 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-04-13 18:20:30,984 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:20:30,984 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-04-13 18:20:30,984 INFO L324 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1915834302] [2025-04-13 18:20:30,988 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1915834302] provided 1 perfect and 0 imperfect interpolant sequences [2025-04-13 18:20:30,988 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-04-13 18:20:30,988 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2025-04-13 18:20:30,989 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2117118971] [2025-04-13 18:20:30,989 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-04-13 18:20:30,992 INFO L562 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2025-04-13 18:20:30,992 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-04-13 18:20:31,006 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2025-04-13 18:20:31,007 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-04-13 18:20:31,027 INFO L87 Difference]: Start difference. First operand has 7823 states, 7822 states have (on average 4.6498338020966505) internal successors, (36371), 7822 states have internal predecessors, (36371), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Second operand has 3 states, 3 states have (on average 11.0) internal successors, (33), 3 states have internal predecessors, (33), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-04-13 18:20:31,248 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-04-13 18:20:31,248 INFO L93 Difference]: Finished difference Result 10421 states and 45970 transitions. [2025-04-13 18:20:31,249 INFO L140 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2025-04-13 18:20:31,250 INFO L79 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 11.0) internal successors, (33), 3 states have internal predecessors, (33), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 33 [2025-04-13 18:20:31,250 INFO L85 Accepts]: Finished accepts. some prefix is accepted. [2025-04-13 18:20:31,339 INFO L225 Difference]: With dead ends: 10421 [2025-04-13 18:20:31,340 INFO L226 Difference]: Without dead ends: 7823 [2025-04-13 18:20:31,354 INFO L436 NwaCegarLoop]: 0 DeclaredPredicates, 3 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-04-13 18:20:31,358 INFO L437 NwaCegarLoop]: 12 mSDtfsCounter, 42 mSDsluCounter, 0 mSDsCounter, 0 mSdLazyCounter, 41 mSolverCounterSat, 2 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 42 SdHoareTripleChecker+Valid, 12 SdHoareTripleChecker+Invalid, 43 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 2 IncrementalHoareTripleChecker+Valid, 41 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2025-04-13 18:20:31,358 INFO L438 NwaCegarLoop]: SdHoareTripleChecker [42 Valid, 12 Invalid, 43 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [2 Valid, 41 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2025-04-13 18:20:31,417 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 7823 states. [2025-04-13 18:20:31,777 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 7823 to 7823. [2025-04-13 18:20:31,799 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 7823 states, 7822 states have (on average 4.311301457427768) internal successors, (33723), 7822 states have internal predecessors, (33723), 0 states have call successors, (0), 0 states have 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,851 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 7823 states to 7823 states and 33723 transitions. [2025-04-13 18:20:31,863 INFO L79 Accepts]: Start accepts. Automaton has 7823 states and 33723 transitions. Word has length 33 [2025-04-13 18:20:31,864 INFO L85 Accepts]: Finished accepts. word is rejected. [2025-04-13 18:20:31,864 INFO L485 AbstractCegarLoop]: Abstraction has 7823 states and 33723 transitions. [2025-04-13 18:20:31,865 INFO L486 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 11.0) internal successors, (33), 3 states have internal predecessors, (33), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-04-13 18:20:31,865 INFO L278 IsEmpty]: Start isEmpty. Operand 7823 states and 33723 transitions. [2025-04-13 18:20:31,891 INFO L284 IsEmpty]: Finished isEmpty. Found accepting run of length 44 [2025-04-13 18:20:31,891 INFO L210 NwaCegarLoop]: Found error trace [2025-04-13 18:20:31,891 INFO L218 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-04-13 18:20:31,891 WARN L466 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable0 [2025-04-13 18:20:31,892 INFO L403 AbstractCegarLoop]: === Iteration 2 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES, ULTIMATE.startErr1INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 2 more)] === [2025-04-13 18:20:31,893 INFO L155 PredicateUnifier]: Initialized classic predicate unifier [2025-04-13 18:20:31,893 INFO L85 PathProgramCache]: Analyzing trace with hash -16755912, now seen corresponding path program 1 times [2025-04-13 18:20:31,893 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-04-13 18:20:31,893 INFO L324 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1548469436] [2025-04-13 18:20:31,893 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-04-13 18:20:31,893 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-04-13 18:20:31,916 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 43 statements into 1 equivalence classes. [2025-04-13 18:20:31,951 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 43 of 43 statements. [2025-04-13 18:20:31,951 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-04-13 18:20:31,955 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-04-13 18:20:32,129 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:20:32,130 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-04-13 18:20:32,130 INFO L324 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1548469436] [2025-04-13 18:20:32,130 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1548469436] provided 1 perfect and 0 imperfect interpolant sequences [2025-04-13 18:20:32,130 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-04-13 18:20:32,130 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2025-04-13 18:20:32,130 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [784002403] [2025-04-13 18:20:32,130 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-04-13 18:20:32,131 INFO L562 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2025-04-13 18:20:32,132 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-04-13 18:20:32,132 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2025-04-13 18:20:32,132 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-04-13 18:20:32,132 INFO L87 Difference]: Start difference. First operand 7823 states and 33723 transitions. Second operand has 3 states, 3 states have (on average 14.333333333333334) internal successors, (43), 3 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:20:32,341 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-04-13 18:20:32,342 INFO L93 Difference]: Finished difference Result 15643 states and 67443 transitions. [2025-04-13 18:20:32,342 INFO L140 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2025-04-13 18:20:32,342 INFO L79 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 14.333333333333334) internal successors, (43), 3 states have internal predecessors, (43), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 43 [2025-04-13 18:20:32,342 INFO L85 Accepts]: Finished accepts. some prefix is accepted. [2025-04-13 18:20:32,407 INFO L225 Difference]: With dead ends: 15643 [2025-04-13 18:20:32,407 INFO L226 Difference]: Without dead ends: 7824 [2025-04-13 18:20:32,422 INFO L436 NwaCegarLoop]: 0 DeclaredPredicates, 3 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-04-13 18:20:32,422 INFO L437 NwaCegarLoop]: 12 mSDtfsCounter, 0 mSDsluCounter, 12 mSDsCounter, 0 mSdLazyCounter, 77 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 0 SdHoareTripleChecker+Valid, 24 SdHoareTripleChecker+Invalid, 77 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 77 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2025-04-13 18:20:32,422 INFO L438 NwaCegarLoop]: SdHoareTripleChecker [0 Valid, 24 Invalid, 77 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 77 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2025-04-13 18:20:32,436 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 7824 states. [2025-04-13 18:20:32,719 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 7824 to 7824. [2025-04-13 18:20:32,750 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 7824 states, 7823 states have (on average 4.310878179726448) internal successors, (33724), 7823 states have internal predecessors, (33724), 0 states have call successors, (0), 0 states have 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:32,800 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 7824 states to 7824 states and 33724 transitions. [2025-04-13 18:20:32,812 INFO L79 Accepts]: Start accepts. Automaton has 7824 states and 33724 transitions. Word has length 43 [2025-04-13 18:20:32,812 INFO L85 Accepts]: Finished accepts. word is rejected. [2025-04-13 18:20:32,813 INFO L485 AbstractCegarLoop]: Abstraction has 7824 states and 33724 transitions. [2025-04-13 18:20:32,813 INFO L486 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 14.333333333333334) internal successors, (43), 3 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:20:32,813 INFO L278 IsEmpty]: Start isEmpty. Operand 7824 states and 33724 transitions. [2025-04-13 18:20:32,883 INFO L284 IsEmpty]: Finished isEmpty. Found accepting run of length 45 [2025-04-13 18:20:32,883 INFO L210 NwaCegarLoop]: Found error trace [2025-04-13 18:20:32,883 INFO L218 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-04-13 18:20:32,884 WARN L466 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable1 [2025-04-13 18:20:32,884 INFO L403 AbstractCegarLoop]: === Iteration 3 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES, ULTIMATE.startErr1INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 2 more)] === [2025-04-13 18:20:32,887 INFO L155 PredicateUnifier]: Initialized classic predicate unifier [2025-04-13 18:20:32,887 INFO L85 PathProgramCache]: Analyzing trace with hash -1357589348, now seen corresponding path program 1 times [2025-04-13 18:20:32,887 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-04-13 18:20:32,887 INFO L324 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1654548737] [2025-04-13 18:20:32,887 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-04-13 18:20:32,887 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-04-13 18:20:32,901 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 44 statements into 1 equivalence classes. [2025-04-13 18:20:32,924 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 44 of 44 statements. [2025-04-13 18:20:32,924 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-04-13 18:20:32,924 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-04-13 18:20:33,332 INFO L134 CoverageAnalysis]: Checked inductivity of 1 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2025-04-13 18:20:33,333 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-04-13 18:20:33,333 INFO L324 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1654548737] [2025-04-13 18:20:33,333 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1654548737] provided 1 perfect and 0 imperfect interpolant sequences [2025-04-13 18:20:33,333 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-04-13 18:20:33,333 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2025-04-13 18:20:33,333 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1925290563] [2025-04-13 18:20:33,333 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-04-13 18:20:33,334 INFO L562 AbstractCegarLoop]: INTERPOLANT automaton has 8 states [2025-04-13 18:20:33,334 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-04-13 18:20:33,335 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2025-04-13 18:20:33,335 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=13, Invalid=43, Unknown=0, NotChecked=0, Total=56 [2025-04-13 18:20:33,335 INFO L87 Difference]: Start difference. First operand 7824 states and 33724 transitions. Second operand has 8 states, 7 states have (on average 6.285714285714286) internal successors, (44), 8 states have internal predecessors, (44), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-04-13 18:20:35,506 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-04-13 18:20:35,506 INFO L93 Difference]: Finished difference Result 37414 states and 161658 transitions. [2025-04-13 18:20:35,506 INFO L140 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 51 states. [2025-04-13 18:20:35,506 INFO L79 Accepts]: Start accepts. Automaton has has 8 states, 7 states have (on average 6.285714285714286) internal successors, (44), 8 states have internal predecessors, (44), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 44 [2025-04-13 18:20:35,506 INFO L85 Accepts]: Finished accepts. some prefix is accepted. [2025-04-13 18:20:35,650 INFO L225 Difference]: With dead ends: 37414 [2025-04-13 18:20:35,650 INFO L226 Difference]: Without dead ends: 24176 [2025-04-13 18:20:35,682 INFO L436 NwaCegarLoop]: 0 DeclaredPredicates, 93 GetRequests, 44 SyntacticMatches, 0 SemanticMatches, 49 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 813 ImplicationChecksByTransitivity, 0.7s TimeCoverageRelationStatistics Valid=510, Invalid=2040, Unknown=0, NotChecked=0, Total=2550 [2025-04-13 18:20:35,683 INFO L437 NwaCegarLoop]: 71 mSDtfsCounter, 473 mSDsluCounter, 258 mSDsCounter, 0 mSdLazyCounter, 1643 mSolverCounterSat, 1 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.9s Time, 0 mProtectedPredicate, 0 mProtectedAction, 473 SdHoareTripleChecker+Valid, 329 SdHoareTripleChecker+Invalid, 1644 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 1 IncrementalHoareTripleChecker+Valid, 1643 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 1.1s IncrementalHoareTripleChecker+Time [2025-04-13 18:20:35,683 INFO L438 NwaCegarLoop]: SdHoareTripleChecker [473 Valid, 329 Invalid, 1644 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [1 Valid, 1643 Invalid, 0 Unknown, 0 Unchecked, 1.1s Time] [2025-04-13 18:20:35,720 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 24176 states. [2025-04-13 18:20:36,111 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 24176 to 10876. [2025-04-13 18:20:36,134 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 10876 states, 10875 states have (on average 4.257287356321839) internal successors, (46298), 10875 states have internal predecessors, (46298), 0 states have call successors, (0), 0 states have 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:36,166 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 10876 states to 10876 states and 46298 transitions. [2025-04-13 18:20:36,188 INFO L79 Accepts]: Start accepts. Automaton has 10876 states and 46298 transitions. Word has length 44 [2025-04-13 18:20:36,188 INFO L85 Accepts]: Finished accepts. word is rejected. [2025-04-13 18:20:36,188 INFO L485 AbstractCegarLoop]: Abstraction has 10876 states and 46298 transitions. [2025-04-13 18:20:36,188 INFO L486 AbstractCegarLoop]: INTERPOLANT automaton has has 8 states, 7 states have (on average 6.285714285714286) internal successors, (44), 8 states have internal predecessors, (44), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-04-13 18:20:36,189 INFO L278 IsEmpty]: Start isEmpty. Operand 10876 states and 46298 transitions. [2025-04-13 18:20:36,212 INFO L284 IsEmpty]: Finished isEmpty. Found accepting run of length 45 [2025-04-13 18:20:36,212 INFO L210 NwaCegarLoop]: Found error trace [2025-04-13 18:20:36,212 INFO L218 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-04-13 18:20:36,212 WARN L466 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable2 [2025-04-13 18:20:36,212 INFO L403 AbstractCegarLoop]: === Iteration 4 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES, ULTIMATE.startErr1INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 2 more)] === [2025-04-13 18:20:36,213 INFO L155 PredicateUnifier]: Initialized classic predicate unifier [2025-04-13 18:20:36,213 INFO L85 PathProgramCache]: Analyzing trace with hash -554151928, now seen corresponding path program 2 times [2025-04-13 18:20:36,213 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-04-13 18:20:36,213 INFO L324 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1796148610] [2025-04-13 18:20:36,213 INFO L95 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST1 [2025-04-13 18:20:36,213 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-04-13 18:20:36,221 INFO L108 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 partitioned 44 statements into 2 equivalence classes. [2025-04-13 18:20:36,235 INFO L111 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 issued 1 check-sat command(s) and asserted 43 of 44 statements. [2025-04-13 18:20:36,235 INFO L114 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 issued 1 check-sat command(s) [2025-04-13 18:20:36,235 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-04-13 18:20:36,520 INFO L134 CoverageAnalysis]: Checked inductivity of 1 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2025-04-13 18:20:36,520 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-04-13 18:20:36,520 INFO L324 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1796148610] [2025-04-13 18:20:36,520 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1796148610] provided 1 perfect and 0 imperfect interpolant sequences [2025-04-13 18:20:36,520 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-04-13 18:20:36,520 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2025-04-13 18:20:36,520 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [536346971] [2025-04-13 18:20:36,520 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-04-13 18:20:36,520 INFO L562 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2025-04-13 18:20:36,521 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-04-13 18:20:36,521 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2025-04-13 18:20:36,521 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2025-04-13 18:20:36,521 INFO L87 Difference]: Start difference. First operand 10876 states and 46298 transitions. Second operand has 5 states, 4 states have (on average 11.0) internal successors, (44), 4 states have internal predecessors, (44), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-04-13 18:20:36,876 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-04-13 18:20:36,876 INFO L93 Difference]: Finished difference Result 16788 states and 71366 transitions. [2025-04-13 18:20:36,876 INFO L140 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2025-04-13 18:20:36,876 INFO L79 Accepts]: Start accepts. Automaton has has 5 states, 4 states have (on average 11.0) internal successors, (44), 4 states have internal predecessors, (44), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 44 [2025-04-13 18:20:36,876 INFO L85 Accepts]: Finished accepts. some prefix is accepted. [2025-04-13 18:20:36,930 INFO L225 Difference]: With dead ends: 16788 [2025-04-13 18:20:36,930 INFO L226 Difference]: Without dead ends: 11704 [2025-04-13 18:20:36,941 INFO L436 NwaCegarLoop]: 0 DeclaredPredicates, 7 GetRequests, 0 SyntacticMatches, 0 SemanticMatches, 7 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 5 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=27, Invalid=45, Unknown=0, NotChecked=0, Total=72 [2025-04-13 18:20:36,941 INFO L437 NwaCegarLoop]: 31 mSDtfsCounter, 139 mSDsluCounter, 58 mSDsCounter, 0 mSdLazyCounter, 314 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 139 SdHoareTripleChecker+Valid, 89 SdHoareTripleChecker+Invalid, 314 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 314 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.2s IncrementalHoareTripleChecker+Time [2025-04-13 18:20:36,942 INFO L438 NwaCegarLoop]: SdHoareTripleChecker [139 Valid, 89 Invalid, 314 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 314 Invalid, 0 Unknown, 0 Unchecked, 0.2s Time] [2025-04-13 18:20:36,954 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 11704 states. [2025-04-13 18:20:37,245 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 11704 to 10264. [2025-04-13 18:20:37,274 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 10264 states, 10263 states have (on average 4.239306245737114) internal successors, (43508), 10263 states have internal predecessors, (43508), 0 states have call successors, (0), 0 states have 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:37,315 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 10264 states to 10264 states and 43508 transitions. [2025-04-13 18:20:37,330 INFO L79 Accepts]: Start accepts. Automaton has 10264 states and 43508 transitions. Word has length 44 [2025-04-13 18:20:37,331 INFO L85 Accepts]: Finished accepts. word is rejected. [2025-04-13 18:20:37,331 INFO L485 AbstractCegarLoop]: Abstraction has 10264 states and 43508 transitions. [2025-04-13 18:20:37,331 INFO L486 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 4 states have (on average 11.0) internal successors, (44), 4 states have internal predecessors, (44), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-04-13 18:20:37,331 INFO L278 IsEmpty]: Start isEmpty. Operand 10264 states and 43508 transitions. [2025-04-13 18:20:37,352 INFO L284 IsEmpty]: Finished isEmpty. Found accepting run of length 45 [2025-04-13 18:20:37,352 INFO L210 NwaCegarLoop]: Found error trace [2025-04-13 18:20:37,352 INFO L218 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-04-13 18:20:37,353 WARN L466 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable3 [2025-04-13 18:20:37,353 INFO L403 AbstractCegarLoop]: === Iteration 5 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES, ULTIMATE.startErr1INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 2 more)] === [2025-04-13 18:20:37,353 INFO L155 PredicateUnifier]: Initialized classic predicate unifier [2025-04-13 18:20:37,353 INFO L85 PathProgramCache]: Analyzing trace with hash -1993913634, now seen corresponding path program 3 times [2025-04-13 18:20:37,353 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-04-13 18:20:37,353 INFO L324 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [212139975] [2025-04-13 18:20:37,353 INFO L95 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST2 [2025-04-13 18:20:37,354 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-04-13 18:20:37,364 INFO L108 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST2 partitioned 44 statements into 2 equivalence classes. [2025-04-13 18:20:37,373 INFO L111 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST2 issued 1 check-sat command(s) and asserted 43 of 44 statements. [2025-04-13 18:20:37,373 INFO L114 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST2 issued 1 check-sat command(s) [2025-04-13 18:20:37,374 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-04-13 18:20:37,586 INFO L134 CoverageAnalysis]: Checked inductivity of 1 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2025-04-13 18:20:37,586 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-04-13 18:20:37,586 INFO L324 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [212139975] [2025-04-13 18:20:37,586 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [212139975] provided 1 perfect and 0 imperfect interpolant sequences [2025-04-13 18:20:37,586 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-04-13 18:20:37,586 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2025-04-13 18:20:37,586 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1932484907] [2025-04-13 18:20:37,587 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-04-13 18:20:37,587 INFO L562 AbstractCegarLoop]: INTERPOLANT automaton has 8 states [2025-04-13 18:20:37,587 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-04-13 18:20:37,587 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2025-04-13 18:20:37,587 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=13, Invalid=43, Unknown=0, NotChecked=0, Total=56 [2025-04-13 18:20:37,587 INFO L87 Difference]: Start difference. First operand 10264 states and 43508 transitions. Second operand has 8 states, 7 states have (on average 6.285714285714286) internal successors, (44), 8 states have internal predecessors, (44), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-04-13 18:20:38,652 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-04-13 18:20:38,652 INFO L93 Difference]: Finished difference Result 25429 states and 108423 transitions. [2025-04-13 18:20:38,652 INFO L140 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 29 states. [2025-04-13 18:20:38,652 INFO L79 Accepts]: Start accepts. Automaton has has 8 states, 7 states have (on average 6.285714285714286) internal successors, (44), 8 states have internal predecessors, (44), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 44 [2025-04-13 18:20:38,653 INFO L85 Accepts]: Finished accepts. some prefix is accepted. [2025-04-13 18:20:38,728 INFO L225 Difference]: With dead ends: 25429 [2025-04-13 18:20:38,728 INFO L226 Difference]: Without dead ends: 19767 [2025-04-13 18:20:38,745 INFO L436 NwaCegarLoop]: 0 DeclaredPredicates, 49 GetRequests, 22 SyntacticMatches, 0 SemanticMatches, 27 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 196 ImplicationChecksByTransitivity, 0.3s TimeCoverageRelationStatistics Valid=203, Invalid=609, Unknown=0, NotChecked=0, Total=812 [2025-04-13 18:20:38,746 INFO L437 NwaCegarLoop]: 40 mSDtfsCounter, 459 mSDsluCounter, 168 mSDsCounter, 0 mSdLazyCounter, 1086 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.5s Time, 0 mProtectedPredicate, 0 mProtectedAction, 459 SdHoareTripleChecker+Valid, 208 SdHoareTripleChecker+Invalid, 1086 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 1086 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.6s IncrementalHoareTripleChecker+Time [2025-04-13 18:20:38,746 INFO L438 NwaCegarLoop]: SdHoareTripleChecker [459 Valid, 208 Invalid, 1086 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 1086 Invalid, 0 Unknown, 0 Unchecked, 0.6s Time] [2025-04-13 18:20:38,767 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 19767 states. [2025-04-13 18:20:38,963 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 19767 to 10360. [2025-04-13 18:20:38,976 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 10360 states, 10359 states have (on average 4.233613283135438) internal successors, (43856), 10359 states have internal predecessors, (43856), 0 states have call successors, (0), 0 states have 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:39,003 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 10360 states to 10360 states and 43856 transitions. [2025-04-13 18:20:39,143 INFO L79 Accepts]: Start accepts. Automaton has 10360 states and 43856 transitions. Word has length 44 [2025-04-13 18:20:39,144 INFO L85 Accepts]: Finished accepts. word is rejected. [2025-04-13 18:20:39,144 INFO L485 AbstractCegarLoop]: Abstraction has 10360 states and 43856 transitions. [2025-04-13 18:20:39,144 INFO L486 AbstractCegarLoop]: INTERPOLANT automaton has has 8 states, 7 states have (on average 6.285714285714286) internal successors, (44), 8 states have internal predecessors, (44), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-04-13 18:20:39,144 INFO L278 IsEmpty]: Start isEmpty. Operand 10360 states and 43856 transitions. [2025-04-13 18:20:39,165 INFO L284 IsEmpty]: Finished isEmpty. Found accepting run of length 45 [2025-04-13 18:20:39,166 INFO L210 NwaCegarLoop]: Found error trace [2025-04-13 18:20:39,166 INFO L218 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-04-13 18:20:39,166 WARN L466 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable4 [2025-04-13 18:20:39,166 INFO L403 AbstractCegarLoop]: === Iteration 6 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES, ULTIMATE.startErr1INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 2 more)] === [2025-04-13 18:20:39,166 INFO L155 PredicateUnifier]: Initialized classic predicate unifier [2025-04-13 18:20:39,166 INFO L85 PathProgramCache]: Analyzing trace with hash 1627389790, now seen corresponding path program 4 times [2025-04-13 18:20:39,166 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-04-13 18:20:39,166 INFO L324 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2124069052] [2025-04-13 18:20:39,167 INFO L95 rtionOrderModulation]: Changing assertion order to TERMS_WITH_SMALL_CONSTANTS_FIRST [2025-04-13 18:20:39,167 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-04-13 18:20:39,174 INFO L108 AnnotateAndAsserter]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST partitioned 44 statements into 2 equivalence classes. [2025-04-13 18:20:39,179 INFO L111 AnnotateAndAsserter]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST issued 1 check-sat command(s) and asserted 37 of 44 statements. [2025-04-13 18:20:39,179 INFO L114 AnnotateAndAsserter]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST issued 1 check-sat command(s) [2025-04-13 18:20:39,179 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-04-13 18:20:39,321 INFO L134 CoverageAnalysis]: Checked inductivity of 1 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2025-04-13 18:20:39,321 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-04-13 18:20:39,321 INFO L324 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2124069052] [2025-04-13 18:20:39,321 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [2124069052] provided 1 perfect and 0 imperfect interpolant sequences [2025-04-13 18:20:39,321 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-04-13 18:20:39,321 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [9] imperfect sequences [] total 9 [2025-04-13 18:20:39,321 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1107672848] [2025-04-13 18:20:39,321 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-04-13 18:20:39,321 INFO L562 AbstractCegarLoop]: INTERPOLANT automaton has 9 states [2025-04-13 18:20:39,321 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-04-13 18:20:39,322 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2025-04-13 18:20:39,322 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=20, Invalid=52, Unknown=0, NotChecked=0, Total=72 [2025-04-13 18:20:39,322 INFO L87 Difference]: Start difference. First operand 10360 states and 43856 transitions. Second operand has 9 states, 9 states have (on average 4.888888888888889) internal successors, (44), 9 states have internal predecessors, (44), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-04-13 18:20:39,837 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-04-13 18:20:39,838 INFO L93 Difference]: Finished difference Result 25341 states and 111214 transitions. [2025-04-13 18:20:39,838 INFO L140 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 12 states. [2025-04-13 18:20:39,838 INFO L79 Accepts]: Start accepts. Automaton has has 9 states, 9 states have (on average 4.888888888888889) internal successors, (44), 9 states have internal predecessors, (44), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 44 [2025-04-13 18:20:39,838 INFO L85 Accepts]: Finished accepts. some prefix is accepted. [2025-04-13 18:20:40,022 INFO L225 Difference]: With dead ends: 25341 [2025-04-13 18:20:40,023 INFO L226 Difference]: Without dead ends: 22415 [2025-04-13 18:20:40,034 INFO L436 NwaCegarLoop]: 0 DeclaredPredicates, 13 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 11 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 20 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=46, Invalid=110, Unknown=0, NotChecked=0, Total=156 [2025-04-13 18:20:40,035 INFO L437 NwaCegarLoop]: 55 mSDtfsCounter, 249 mSDsluCounter, 219 mSDsCounter, 0 mSdLazyCounter, 772 mSolverCounterSat, 2 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.3s Time, 0 mProtectedPredicate, 0 mProtectedAction, 249 SdHoareTripleChecker+Valid, 274 SdHoareTripleChecker+Invalid, 774 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 2 IncrementalHoareTripleChecker+Valid, 772 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.3s IncrementalHoareTripleChecker+Time [2025-04-13 18:20:40,035 INFO L438 NwaCegarLoop]: SdHoareTripleChecker [249 Valid, 274 Invalid, 774 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [2 Valid, 772 Invalid, 0 Unknown, 0 Unchecked, 0.3s Time] [2025-04-13 18:20:40,088 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 22415 states. [2025-04-13 18:20:40,482 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 22415 to 14420. [2025-04-13 18:20:40,504 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 14420 states, 14419 states have (on average 4.224426104445524) internal successors, (60912), 14419 states have internal predecessors, (60912), 0 states have call successors, (0), 0 states have 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:40,592 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 14420 states to 14420 states and 60912 transitions. [2025-04-13 18:20:40,615 INFO L79 Accepts]: Start accepts. Automaton has 14420 states and 60912 transitions. Word has length 44 [2025-04-13 18:20:40,615 INFO L85 Accepts]: Finished accepts. word is rejected. [2025-04-13 18:20:40,615 INFO L485 AbstractCegarLoop]: Abstraction has 14420 states and 60912 transitions. [2025-04-13 18:20:40,616 INFO L486 AbstractCegarLoop]: INTERPOLANT automaton has has 9 states, 9 states have (on average 4.888888888888889) internal successors, (44), 9 states have internal predecessors, (44), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-04-13 18:20:40,616 INFO L278 IsEmpty]: Start isEmpty. Operand 14420 states and 60912 transitions. [2025-04-13 18:20:40,645 INFO L284 IsEmpty]: Finished isEmpty. Found accepting run of length 45 [2025-04-13 18:20:40,645 INFO L210 NwaCegarLoop]: Found error trace [2025-04-13 18:20:40,646 INFO L218 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-04-13 18:20:40,646 WARN L466 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable5 [2025-04-13 18:20:40,646 INFO L403 AbstractCegarLoop]: === Iteration 7 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES, ULTIMATE.startErr1INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 2 more)] === [2025-04-13 18:20:40,646 INFO L155 PredicateUnifier]: Initialized classic predicate unifier [2025-04-13 18:20:40,646 INFO L85 PathProgramCache]: Analyzing trace with hash -730574688, now seen corresponding path program 5 times [2025-04-13 18:20:40,646 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-04-13 18:20:40,646 INFO L324 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2003183939] [2025-04-13 18:20:40,646 INFO L95 rtionOrderModulation]: Changing assertion order to INSIDE_LOOP_FIRST1 [2025-04-13 18:20:40,647 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-04-13 18:20:40,657 INFO L108 AnnotateAndAsserter]: Assert order INSIDE_LOOP_FIRST1 partitioned 44 statements into 2 equivalence classes. [2025-04-13 18:20:40,666 INFO L111 AnnotateAndAsserter]: Assert order INSIDE_LOOP_FIRST1 issued 2 check-sat command(s) and asserted 44 of 44 statements. [2025-04-13 18:20:40,666 INFO L114 AnnotateAndAsserter]: Assert order INSIDE_LOOP_FIRST1 issued 2 check-sat command(s) [2025-04-13 18:20:40,666 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-04-13 18:20:40,804 INFO L134 CoverageAnalysis]: Checked inductivity of 1 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2025-04-13 18:20:40,805 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-04-13 18:20:40,805 INFO L324 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2003183939] [2025-04-13 18:20:40,805 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [2003183939] provided 1 perfect and 0 imperfect interpolant sequences [2025-04-13 18:20:40,805 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-04-13 18:20:40,805 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2025-04-13 18:20:40,805 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1319350586] [2025-04-13 18:20:40,805 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-04-13 18:20:40,805 INFO L562 AbstractCegarLoop]: INTERPOLANT automaton has 8 states [2025-04-13 18:20:40,805 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-04-13 18:20:40,805 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2025-04-13 18:20:40,805 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=13, Invalid=43, Unknown=0, NotChecked=0, Total=56 [2025-04-13 18:20:40,806 INFO L87 Difference]: Start difference. First operand 14420 states and 60912 transitions. Second operand has 8 states, 7 states have (on average 6.285714285714286) internal successors, (44), 8 states have internal predecessors, (44), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-04-13 18:20:41,883 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-04-13 18:20:41,883 INFO L93 Difference]: Finished difference Result 36076 states and 153566 transitions. [2025-04-13 18:20:41,883 INFO L140 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 32 states. [2025-04-13 18:20:41,883 INFO L79 Accepts]: Start accepts. Automaton has has 8 states, 7 states have (on average 6.285714285714286) internal successors, (44), 8 states have internal predecessors, (44), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 44 [2025-04-13 18:20:41,883 INFO L85 Accepts]: Finished accepts. some prefix is accepted. [2025-04-13 18:20:42,146 INFO L225 Difference]: With dead ends: 36076 [2025-04-13 18:20:42,146 INFO L226 Difference]: Without dead ends: 29007 [2025-04-13 18:20:42,157 INFO L436 NwaCegarLoop]: 0 DeclaredPredicates, 55 GetRequests, 25 SyntacticMatches, 0 SemanticMatches, 30 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 256 ImplicationChecksByTransitivity, 0.3s TimeCoverageRelationStatistics Valid=256, Invalid=736, Unknown=0, NotChecked=0, Total=992 [2025-04-13 18:20:42,157 INFO L437 NwaCegarLoop]: 45 mSDtfsCounter, 497 mSDsluCounter, 201 mSDsCounter, 0 mSdLazyCounter, 1097 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.5s Time, 0 mProtectedPredicate, 0 mProtectedAction, 497 SdHoareTripleChecker+Valid, 246 SdHoareTripleChecker+Invalid, 1097 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 1097 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.6s IncrementalHoareTripleChecker+Time [2025-04-13 18:20:42,158 INFO L438 NwaCegarLoop]: SdHoareTripleChecker [497 Valid, 246 Invalid, 1097 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 1097 Invalid, 0 Unknown, 0 Unchecked, 0.6s Time] [2025-04-13 18:20:42,179 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 29007 states. [2025-04-13 18:20:42,450 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 29007 to 14612. [2025-04-13 18:20:42,471 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 14612 states, 14611 states have (on average 4.2165491752788995) internal successors, (61608), 14611 states have internal predecessors, (61608), 0 states have call successors, (0), 0 states have 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:42,510 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 14612 states to 14612 states and 61608 transitions. [2025-04-13 18:20:42,540 INFO L79 Accepts]: Start accepts. Automaton has 14612 states and 61608 transitions. Word has length 44 [2025-04-13 18:20:42,540 INFO L85 Accepts]: Finished accepts. word is rejected. [2025-04-13 18:20:42,540 INFO L485 AbstractCegarLoop]: Abstraction has 14612 states and 61608 transitions. [2025-04-13 18:20:42,540 INFO L486 AbstractCegarLoop]: INTERPOLANT automaton has has 8 states, 7 states have (on average 6.285714285714286) internal successors, (44), 8 states have internal predecessors, (44), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-04-13 18:20:42,540 INFO L278 IsEmpty]: Start isEmpty. Operand 14612 states and 61608 transitions. [2025-04-13 18:20:42,567 INFO L284 IsEmpty]: Finished isEmpty. Found accepting run of length 45 [2025-04-13 18:20:42,567 INFO L210 NwaCegarLoop]: Found error trace [2025-04-13 18:20:42,567 INFO L218 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-04-13 18:20:42,567 WARN L466 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable6 [2025-04-13 18:20:42,567 INFO L403 AbstractCegarLoop]: === Iteration 8 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES, ULTIMATE.startErr1INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 2 more)] === [2025-04-13 18:20:42,568 INFO L155 PredicateUnifier]: Initialized classic predicate unifier [2025-04-13 18:20:42,568 INFO L85 PathProgramCache]: Analyzing trace with hash -1870700580, now seen corresponding path program 6 times [2025-04-13 18:20:42,568 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-04-13 18:20:42,568 INFO L324 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1107852226] [2025-04-13 18:20:42,568 INFO L95 rtionOrderModulation]: Changing assertion order to MIX_INSIDE_OUTSIDE [2025-04-13 18:20:42,568 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-04-13 18:20:42,574 INFO L108 AnnotateAndAsserter]: Assert order MIX_INSIDE_OUTSIDE partitioned 44 statements into 2 equivalence classes. [2025-04-13 18:20:42,580 INFO L111 AnnotateAndAsserter]: Assert order MIX_INSIDE_OUTSIDE issued 1 check-sat command(s) and asserted 43 of 44 statements. [2025-04-13 18:20:42,580 INFO L114 AnnotateAndAsserter]: Assert order MIX_INSIDE_OUTSIDE issued 1 check-sat command(s) [2025-04-13 18:20:42,580 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-04-13 18:20:42,983 INFO L134 CoverageAnalysis]: Checked inductivity of 1 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2025-04-13 18:20:42,984 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-04-13 18:20:42,984 INFO L324 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1107852226] [2025-04-13 18:20:42,984 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1107852226] provided 1 perfect and 0 imperfect interpolant sequences [2025-04-13 18:20:42,984 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-04-13 18:20:42,984 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [11] imperfect sequences [] total 11 [2025-04-13 18:20:42,984 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [284684413] [2025-04-13 18:20:42,984 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-04-13 18:20:42,984 INFO L562 AbstractCegarLoop]: INTERPOLANT automaton has 12 states [2025-04-13 18:20:42,984 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-04-13 18:20:42,984 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 12 interpolants. [2025-04-13 18:20:42,985 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=27, Invalid=105, Unknown=0, NotChecked=0, Total=132 [2025-04-13 18:20:42,985 INFO L87 Difference]: Start difference. First operand 14612 states and 61608 transitions. Second operand has 12 states, 11 states have (on average 4.0) internal successors, (44), 12 states have internal predecessors, (44), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-04-13 18:20:46,157 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-04-13 18:20:46,158 INFO L93 Difference]: Finished difference Result 65137 states and 278900 transitions. [2025-04-13 18:20:46,158 INFO L140 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 123 states. [2025-04-13 18:20:46,158 INFO L79 Accepts]: Start accepts. Automaton has has 12 states, 11 states have (on average 4.0) internal successors, (44), 12 states have internal predecessors, (44), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 44 [2025-04-13 18:20:46,158 INFO L85 Accepts]: Finished accepts. some prefix is accepted. [2025-04-13 18:20:46,386 INFO L225 Difference]: With dead ends: 65137 [2025-04-13 18:20:46,386 INFO L226 Difference]: Without dead ends: 57744 [2025-04-13 18:20:46,422 INFO L436 NwaCegarLoop]: 0 DeclaredPredicates, 131 GetRequests, 10 SyntacticMatches, 0 SemanticMatches, 121 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 5836 ImplicationChecksByTransitivity, 1.3s TimeCoverageRelationStatistics Valid=2144, Invalid=12862, Unknown=0, NotChecked=0, Total=15006 [2025-04-13 18:20:46,423 INFO L437 NwaCegarLoop]: 143 mSDtfsCounter, 948 mSDsluCounter, 766 mSDsCounter, 0 mSdLazyCounter, 3588 mSolverCounterSat, 6 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 1.3s Time, 0 mProtectedPredicate, 0 mProtectedAction, 948 SdHoareTripleChecker+Valid, 909 SdHoareTripleChecker+Invalid, 3594 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 6 IncrementalHoareTripleChecker+Valid, 3588 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 1.6s IncrementalHoareTripleChecker+Time [2025-04-13 18:20:46,423 INFO L438 NwaCegarLoop]: SdHoareTripleChecker [948 Valid, 909 Invalid, 3594 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [6 Valid, 3588 Invalid, 0 Unknown, 0 Unchecked, 1.6s Time] [2025-04-13 18:20:46,606 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 57744 states. [2025-04-13 18:20:47,023 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 57744 to 16193. [2025-04-13 18:20:47,046 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 16193 states, 16192 states have (on average 4.220232213438735) internal successors, (68334), 16192 states have internal predecessors, (68334), 0 states have call successors, (0), 0 states have 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:47,089 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 16193 states to 16193 states and 68334 transitions. [2025-04-13 18:20:47,259 INFO L79 Accepts]: Start accepts. Automaton has 16193 states and 68334 transitions. Word has length 44 [2025-04-13 18:20:47,259 INFO L85 Accepts]: Finished accepts. word is rejected. [2025-04-13 18:20:47,259 INFO L485 AbstractCegarLoop]: Abstraction has 16193 states and 68334 transitions. [2025-04-13 18:20:47,259 INFO L486 AbstractCegarLoop]: INTERPOLANT automaton has has 12 states, 11 states have (on average 4.0) internal successors, (44), 12 states have internal predecessors, (44), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-04-13 18:20:47,259 INFO L278 IsEmpty]: Start isEmpty. Operand 16193 states and 68334 transitions. [2025-04-13 18:20:47,292 INFO L284 IsEmpty]: Finished isEmpty. Found accepting run of length 45 [2025-04-13 18:20:47,292 INFO L210 NwaCegarLoop]: Found error trace [2025-04-13 18:20:47,292 INFO L218 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-04-13 18:20:47,292 WARN L466 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable7 [2025-04-13 18:20:47,292 INFO L403 AbstractCegarLoop]: === Iteration 9 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES, ULTIMATE.startErr1INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 2 more)] === [2025-04-13 18:20:47,292 INFO L155 PredicateUnifier]: Initialized classic predicate unifier [2025-04-13 18:20:47,293 INFO L85 PathProgramCache]: Analyzing trace with hash -2128705670, now seen corresponding path program 7 times [2025-04-13 18:20:47,293 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-04-13 18:20:47,293 INFO L324 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1680918567] [2025-04-13 18:20:47,293 INFO L95 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2025-04-13 18:20:47,293 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-04-13 18:20:47,299 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 44 statements into 1 equivalence classes. [2025-04-13 18:20:47,313 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 44 of 44 statements. [2025-04-13 18:20:47,313 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-04-13 18:20:47,313 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-04-13 18:20:47,437 INFO L134 CoverageAnalysis]: Checked inductivity of 1 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2025-04-13 18:20:47,438 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-04-13 18:20:47,438 INFO L324 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1680918567] [2025-04-13 18:20:47,438 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1680918567] provided 1 perfect and 0 imperfect interpolant sequences [2025-04-13 18:20:47,438 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-04-13 18:20:47,438 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2025-04-13 18:20:47,438 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1371954342] [2025-04-13 18:20:47,438 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-04-13 18:20:47,438 INFO L562 AbstractCegarLoop]: INTERPOLANT automaton has 8 states [2025-04-13 18:20:47,438 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-04-13 18:20:47,438 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2025-04-13 18:20:47,438 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=13, Invalid=43, Unknown=0, NotChecked=0, Total=56 [2025-04-13 18:20:47,439 INFO L87 Difference]: Start difference. First operand 16193 states and 68334 transitions. Second operand has 8 states, 7 states have (on average 6.285714285714286) internal successors, (44), 8 states have internal predecessors, (44), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-04-13 18:20:48,457 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-04-13 18:20:48,457 INFO L93 Difference]: Finished difference Result 34110 states and 144028 transitions. [2025-04-13 18:20:48,457 INFO L140 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 34 states. [2025-04-13 18:20:48,457 INFO L79 Accepts]: Start accepts. Automaton has has 8 states, 7 states have (on average 6.285714285714286) internal successors, (44), 8 states have internal predecessors, (44), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 44 [2025-04-13 18:20:48,457 INFO L85 Accepts]: Finished accepts. some prefix is accepted. [2025-04-13 18:20:48,732 INFO L225 Difference]: With dead ends: 34110 [2025-04-13 18:20:48,732 INFO L226 Difference]: Without dead ends: 29163 [2025-04-13 18:20:48,745 INFO L436 NwaCegarLoop]: 0 DeclaredPredicates, 59 GetRequests, 27 SyntacticMatches, 0 SemanticMatches, 32 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 287 ImplicationChecksByTransitivity, 0.3s TimeCoverageRelationStatistics Valid=228, Invalid=894, Unknown=0, NotChecked=0, Total=1122 [2025-04-13 18:20:48,746 INFO L437 NwaCegarLoop]: 46 mSDtfsCounter, 359 mSDsluCounter, 182 mSDsCounter, 0 mSdLazyCounter, 1322 mSolverCounterSat, 1 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.5s Time, 0 mProtectedPredicate, 0 mProtectedAction, 359 SdHoareTripleChecker+Valid, 228 SdHoareTripleChecker+Invalid, 1323 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 1 IncrementalHoareTripleChecker+Valid, 1322 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.6s IncrementalHoareTripleChecker+Time [2025-04-13 18:20:48,747 INFO L438 NwaCegarLoop]: SdHoareTripleChecker [359 Valid, 228 Invalid, 1323 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [1 Valid, 1322 Invalid, 0 Unknown, 0 Unchecked, 0.6s Time] [2025-04-13 18:20:48,780 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 29163 states. [2025-04-13 18:20:49,254 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 29163 to 16283. [2025-04-13 18:20:49,279 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 16283 states, 16282 states have (on average 4.219629038201695) internal successors, (68704), 16282 states have internal predecessors, (68704), 0 states have call successors, (0), 0 states have 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:49,346 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 16283 states to 16283 states and 68704 transitions. [2025-04-13 18:20:49,398 INFO L79 Accepts]: Start accepts. Automaton has 16283 states and 68704 transitions. Word has length 44 [2025-04-13 18:20:49,399 INFO L85 Accepts]: Finished accepts. word is rejected. [2025-04-13 18:20:49,399 INFO L485 AbstractCegarLoop]: Abstraction has 16283 states and 68704 transitions. [2025-04-13 18:20:49,399 INFO L486 AbstractCegarLoop]: INTERPOLANT automaton has has 8 states, 7 states have (on average 6.285714285714286) internal successors, (44), 8 states have internal predecessors, (44), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-04-13 18:20:49,399 INFO L278 IsEmpty]: Start isEmpty. Operand 16283 states and 68704 transitions. [2025-04-13 18:20:49,445 INFO L284 IsEmpty]: Finished isEmpty. Found accepting run of length 45 [2025-04-13 18:20:49,445 INFO L210 NwaCegarLoop]: Found error trace [2025-04-13 18:20:49,445 INFO L218 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-04-13 18:20:49,445 WARN L466 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable8 [2025-04-13 18:20:49,445 INFO L403 AbstractCegarLoop]: === Iteration 10 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES, ULTIMATE.startErr1INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 2 more)] === [2025-04-13 18:20:49,446 INFO L155 PredicateUnifier]: Initialized classic predicate unifier [2025-04-13 18:20:49,446 INFO L85 PathProgramCache]: Analyzing trace with hash -1647707772, now seen corresponding path program 8 times [2025-04-13 18:20:49,446 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-04-13 18:20:49,446 INFO L324 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [775396334] [2025-04-13 18:20:49,446 INFO L95 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST1 [2025-04-13 18:20:49,446 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-04-13 18:20:49,454 INFO L108 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 partitioned 44 statements into 2 equivalence classes. [2025-04-13 18:20:49,462 INFO L111 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 issued 1 check-sat command(s) and asserted 43 of 44 statements. [2025-04-13 18:20:49,462 INFO L114 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 issued 1 check-sat command(s) [2025-04-13 18:20:49,462 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-04-13 18:20:49,853 INFO L134 CoverageAnalysis]: Checked inductivity of 1 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2025-04-13 18:20:49,853 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-04-13 18:20:49,854 INFO L324 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [775396334] [2025-04-13 18:20:49,854 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [775396334] provided 1 perfect and 0 imperfect interpolant sequences [2025-04-13 18:20:49,854 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-04-13 18:20:49,854 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [13] imperfect sequences [] total 13 [2025-04-13 18:20:49,854 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [161530335] [2025-04-13 18:20:49,854 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-04-13 18:20:49,854 INFO L562 AbstractCegarLoop]: INTERPOLANT automaton has 14 states [2025-04-13 18:20:49,854 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-04-13 18:20:49,854 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 14 interpolants. [2025-04-13 18:20:49,854 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=35, Invalid=147, Unknown=0, NotChecked=0, Total=182 [2025-04-13 18:20:49,854 INFO L87 Difference]: Start difference. First operand 16283 states and 68704 transitions. Second operand has 14 states, 13 states have (on average 3.3846153846153846) internal successors, (44), 14 states have internal predecessors, (44), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-04-13 18:20:52,451 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-04-13 18:20:52,451 INFO L93 Difference]: Finished difference Result 53759 states and 229860 transitions. [2025-04-13 18:20:52,451 INFO L140 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 93 states. [2025-04-13 18:20:52,451 INFO L79 Accepts]: Start accepts. Automaton has has 14 states, 13 states have (on average 3.3846153846153846) internal successors, (44), 14 states have internal predecessors, (44), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 44 [2025-04-13 18:20:52,451 INFO L85 Accepts]: Finished accepts. some prefix is accepted. [2025-04-13 18:20:52,693 INFO L225 Difference]: With dead ends: 53759 [2025-04-13 18:20:52,693 INFO L226 Difference]: Without dead ends: 46042 [2025-04-13 18:20:52,721 INFO L436 NwaCegarLoop]: 0 DeclaredPredicates, 100 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 98 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 3682 ImplicationChecksByTransitivity, 1.0s TimeCoverageRelationStatistics Valid=1641, Invalid=8259, Unknown=0, NotChecked=0, Total=9900 [2025-04-13 18:20:52,721 INFO L437 NwaCegarLoop]: 112 mSDtfsCounter, 835 mSDsluCounter, 718 mSDsCounter, 0 mSdLazyCounter, 3164 mSolverCounterSat, 3 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 1.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 835 SdHoareTripleChecker+Valid, 830 SdHoareTripleChecker+Invalid, 3167 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 3 IncrementalHoareTripleChecker+Valid, 3164 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 1.2s IncrementalHoareTripleChecker+Time [2025-04-13 18:20:52,721 INFO L438 NwaCegarLoop]: SdHoareTripleChecker [835 Valid, 830 Invalid, 3167 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [3 Valid, 3164 Invalid, 0 Unknown, 0 Unchecked, 1.2s Time] [2025-04-13 18:20:52,770 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 46042 states. [2025-04-13 18:20:53,306 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 46042 to 16433. [2025-04-13 18:20:53,328 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 16433 states, 16432 states have (on average 4.217624148003895) internal successors, (69304), 16432 states have internal predecessors, (69304), 0 states have call successors, (0), 0 states have 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:53,372 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 16433 states to 16433 states and 69304 transitions. [2025-04-13 18:20:53,405 INFO L79 Accepts]: Start accepts. Automaton has 16433 states and 69304 transitions. Word has length 44 [2025-04-13 18:20:53,406 INFO L85 Accepts]: Finished accepts. word is rejected. [2025-04-13 18:20:53,406 INFO L485 AbstractCegarLoop]: Abstraction has 16433 states and 69304 transitions. [2025-04-13 18:20:53,406 INFO L486 AbstractCegarLoop]: INTERPOLANT automaton has has 14 states, 13 states have (on average 3.3846153846153846) internal successors, (44), 14 states have internal predecessors, (44), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-04-13 18:20:53,406 INFO L278 IsEmpty]: Start isEmpty. Operand 16433 states and 69304 transitions. [2025-04-13 18:20:53,434 INFO L284 IsEmpty]: Finished isEmpty. Found accepting run of length 45 [2025-04-13 18:20:53,434 INFO L210 NwaCegarLoop]: Found error trace [2025-04-13 18:20:53,434 INFO L218 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-04-13 18:20:53,434 WARN L466 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable9 [2025-04-13 18:20:53,435 INFO L403 AbstractCegarLoop]: === Iteration 11 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES, ULTIMATE.startErr1INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 2 more)] === [2025-04-13 18:20:53,435 INFO L155 PredicateUnifier]: Initialized classic predicate unifier [2025-04-13 18:20:53,435 INFO L85 PathProgramCache]: Analyzing trace with hash 1529937340, now seen corresponding path program 9 times [2025-04-13 18:20:53,435 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-04-13 18:20:53,435 INFO L324 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [441337934] [2025-04-13 18:20:53,435 INFO L95 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST2 [2025-04-13 18:20:53,435 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-04-13 18:20:53,440 INFO L108 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST2 partitioned 44 statements into 2 equivalence classes. [2025-04-13 18:20:53,447 INFO L111 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST2 issued 1 check-sat command(s) and asserted 43 of 44 statements. [2025-04-13 18:20:53,447 INFO L114 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST2 issued 1 check-sat command(s) [2025-04-13 18:20:53,447 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-04-13 18:20:53,561 INFO L134 CoverageAnalysis]: Checked inductivity of 1 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2025-04-13 18:20:53,561 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-04-13 18:20:53,562 INFO L324 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [441337934] [2025-04-13 18:20:53,562 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [441337934] provided 1 perfect and 0 imperfect interpolant sequences [2025-04-13 18:20:53,562 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-04-13 18:20:53,562 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2025-04-13 18:20:53,562 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1618942057] [2025-04-13 18:20:53,562 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-04-13 18:20:53,562 INFO L562 AbstractCegarLoop]: INTERPOLANT automaton has 8 states [2025-04-13 18:20:53,562 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-04-13 18:20:53,562 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2025-04-13 18:20:53,562 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=13, Invalid=43, Unknown=0, NotChecked=0, Total=56 [2025-04-13 18:20:53,562 INFO L87 Difference]: Start difference. First operand 16433 states and 69304 transitions. Second operand has 8 states, 7 states have (on average 6.285714285714286) internal successors, (44), 8 states have internal predecessors, (44), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-04-13 18:20:54,345 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-04-13 18:20:54,345 INFO L93 Difference]: Finished difference Result 25900 states and 109093 transitions. [2025-04-13 18:20:54,345 INFO L140 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 26 states. [2025-04-13 18:20:54,345 INFO L79 Accepts]: Start accepts. Automaton has has 8 states, 7 states have (on average 6.285714285714286) internal successors, (44), 8 states have internal predecessors, (44), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 44 [2025-04-13 18:20:54,346 INFO L85 Accepts]: Finished accepts. some prefix is accepted. [2025-04-13 18:20:54,429 INFO L225 Difference]: With dead ends: 25900 [2025-04-13 18:20:54,429 INFO L226 Difference]: Without dead ends: 21140 [2025-04-13 18:20:54,443 INFO L436 NwaCegarLoop]: 0 DeclaredPredicates, 43 GetRequests, 19 SyntacticMatches, 0 SemanticMatches, 24 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 135 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=168, Invalid=482, Unknown=0, NotChecked=0, Total=650 [2025-04-13 18:20:54,444 INFO L437 NwaCegarLoop]: 37 mSDtfsCounter, 308 mSDsluCounter, 154 mSDsCounter, 0 mSdLazyCounter, 1069 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.4s Time, 0 mProtectedPredicate, 0 mProtectedAction, 308 SdHoareTripleChecker+Valid, 191 SdHoareTripleChecker+Invalid, 1069 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 1069 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.5s IncrementalHoareTripleChecker+Time [2025-04-13 18:20:54,444 INFO L438 NwaCegarLoop]: SdHoareTripleChecker [308 Valid, 191 Invalid, 1069 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 1069 Invalid, 0 Unknown, 0 Unchecked, 0.5s Time] [2025-04-13 18:20:54,462 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 21140 states. [2025-04-13 18:20:54,684 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 21140 to 16125. [2025-04-13 18:20:54,706 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 16125 states, 16124 states have (on average 4.21663358967998) internal successors, (67989), 16124 states have internal predecessors, (67989), 0 states have call successors, (0), 0 states have 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:54,748 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 16125 states to 16125 states and 67989 transitions. [2025-04-13 18:20:54,783 INFO L79 Accepts]: Start accepts. Automaton has 16125 states and 67989 transitions. Word has length 44 [2025-04-13 18:20:54,783 INFO L85 Accepts]: Finished accepts. word is rejected. [2025-04-13 18:20:54,783 INFO L485 AbstractCegarLoop]: Abstraction has 16125 states and 67989 transitions. [2025-04-13 18:20:54,784 INFO L486 AbstractCegarLoop]: INTERPOLANT automaton has has 8 states, 7 states have (on average 6.285714285714286) internal successors, (44), 8 states have internal predecessors, (44), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-04-13 18:20:54,784 INFO L278 IsEmpty]: Start isEmpty. Operand 16125 states and 67989 transitions. [2025-04-13 18:20:54,811 INFO L284 IsEmpty]: Finished isEmpty. Found accepting run of length 45 [2025-04-13 18:20:54,811 INFO L210 NwaCegarLoop]: Found error trace [2025-04-13 18:20:54,811 INFO L218 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-04-13 18:20:54,811 WARN L466 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable10 [2025-04-13 18:20:54,811 INFO L403 AbstractCegarLoop]: === Iteration 12 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES, ULTIMATE.startErr1INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 2 more)] === [2025-04-13 18:20:54,811 INFO L155 PredicateUnifier]: Initialized classic predicate unifier [2025-04-13 18:20:54,811 INFO L85 PathProgramCache]: Analyzing trace with hash 102127910, now seen corresponding path program 10 times [2025-04-13 18:20:54,812 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-04-13 18:20:54,812 INFO L324 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1468759236] [2025-04-13 18:20:54,812 INFO L95 rtionOrderModulation]: Changing assertion order to TERMS_WITH_SMALL_CONSTANTS_FIRST [2025-04-13 18:20:54,812 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-04-13 18:20:54,817 INFO L108 AnnotateAndAsserter]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST partitioned 44 statements into 2 equivalence classes. [2025-04-13 18:20:54,823 INFO L111 AnnotateAndAsserter]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST issued 1 check-sat command(s) and asserted 37 of 44 statements. [2025-04-13 18:20:54,823 INFO L114 AnnotateAndAsserter]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST issued 1 check-sat command(s) [2025-04-13 18:20:54,823 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-04-13 18:20:54,867 INFO L134 CoverageAnalysis]: Checked inductivity of 1 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2025-04-13 18:20:54,867 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-04-13 18:20:54,867 INFO L324 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1468759236] [2025-04-13 18:20:54,867 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1468759236] provided 1 perfect and 0 imperfect interpolant sequences [2025-04-13 18:20:54,867 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-04-13 18:20:54,867 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2025-04-13 18:20:54,867 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1343533924] [2025-04-13 18:20:54,867 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-04-13 18:20:54,867 INFO L562 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2025-04-13 18:20:54,867 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-04-13 18:20:54,868 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2025-04-13 18:20:54,868 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=10, Invalid=20, Unknown=0, NotChecked=0, Total=30 [2025-04-13 18:20:54,868 INFO L87 Difference]: Start difference. First operand 16125 states and 67989 transitions. Second operand has 6 states, 6 states have (on average 7.333333333333333) internal successors, (44), 6 states have internal predecessors, (44), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-04-13 18:20:55,282 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-04-13 18:20:55,283 INFO L93 Difference]: Finished difference Result 34173 states and 147259 transitions. [2025-04-13 18:20:55,283 INFO L140 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2025-04-13 18:20:55,283 INFO L79 Accepts]: Start accepts. Automaton has has 6 states, 6 states have (on average 7.333333333333333) internal successors, (44), 6 states have internal predecessors, (44), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 44 [2025-04-13 18:20:55,283 INFO L85 Accepts]: Finished accepts. some prefix is accepted. [2025-04-13 18:20:55,394 INFO L225 Difference]: With dead ends: 34173 [2025-04-13 18:20:55,394 INFO L226 Difference]: Without dead ends: 26180 [2025-04-13 18:20:55,411 INFO L436 NwaCegarLoop]: 0 DeclaredPredicates, 10 GetRequests, 4 SyntacticMatches, 0 SemanticMatches, 6 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 2 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=19, Invalid=37, Unknown=0, NotChecked=0, Total=56 [2025-04-13 18:20:55,412 INFO L437 NwaCegarLoop]: 30 mSDtfsCounter, 160 mSDsluCounter, 74 mSDsCounter, 0 mSdLazyCounter, 452 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 160 SdHoareTripleChecker+Valid, 104 SdHoareTripleChecker+Invalid, 452 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 452 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.2s IncrementalHoareTripleChecker+Time [2025-04-13 18:20:55,412 INFO L438 NwaCegarLoop]: SdHoareTripleChecker [160 Valid, 104 Invalid, 452 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 452 Invalid, 0 Unknown, 0 Unchecked, 0.2s Time] [2025-04-13 18:20:55,435 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 26180 states. [2025-04-13 18:20:55,932 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 26180 to 23492. [2025-04-13 18:20:55,967 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 23492 states, 23491 states have (on average 4.202588225277766) internal successors, (98723), 23491 states have internal predecessors, (98723), 0 states have call successors, (0), 0 states have 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:56,033 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 23492 states to 23492 states and 98723 transitions. [2025-04-13 18:20:56,064 INFO L79 Accepts]: Start accepts. Automaton has 23492 states and 98723 transitions. Word has length 44 [2025-04-13 18:20:56,064 INFO L85 Accepts]: Finished accepts. word is rejected. [2025-04-13 18:20:56,064 INFO L485 AbstractCegarLoop]: Abstraction has 23492 states and 98723 transitions. [2025-04-13 18:20:56,064 INFO L486 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 6 states have (on average 7.333333333333333) internal successors, (44), 6 states have internal predecessors, (44), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-04-13 18:20:56,064 INFO L278 IsEmpty]: Start isEmpty. Operand 23492 states and 98723 transitions. [2025-04-13 18:20:56,105 INFO L284 IsEmpty]: Finished isEmpty. Found accepting run of length 45 [2025-04-13 18:20:56,105 INFO L210 NwaCegarLoop]: Found error trace [2025-04-13 18:20:56,106 INFO L218 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-04-13 18:20:56,106 WARN L466 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable11 [2025-04-13 18:20:56,106 INFO L403 AbstractCegarLoop]: === Iteration 13 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES, ULTIMATE.startErr1INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 2 more)] === [2025-04-13 18:20:56,106 INFO L155 PredicateUnifier]: Initialized classic predicate unifier [2025-04-13 18:20:56,106 INFO L85 PathProgramCache]: Analyzing trace with hash -1074852588, now seen corresponding path program 11 times [2025-04-13 18:20:56,106 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-04-13 18:20:56,106 INFO L324 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [853871476] [2025-04-13 18:20:56,106 INFO L95 rtionOrderModulation]: Changing assertion order to INSIDE_LOOP_FIRST1 [2025-04-13 18:20:56,106 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-04-13 18:20:56,223 INFO L108 AnnotateAndAsserter]: Assert order INSIDE_LOOP_FIRST1 partitioned 44 statements into 2 equivalence classes. [2025-04-13 18:20:56,229 INFO L111 AnnotateAndAsserter]: Assert order INSIDE_LOOP_FIRST1 issued 2 check-sat command(s) and asserted 44 of 44 statements. [2025-04-13 18:20:56,230 INFO L114 AnnotateAndAsserter]: Assert order INSIDE_LOOP_FIRST1 issued 2 check-sat command(s) [2025-04-13 18:20:56,230 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-04-13 18:20:56,327 INFO L134 CoverageAnalysis]: Checked inductivity of 1 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2025-04-13 18:20:56,328 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-04-13 18:20:56,328 INFO L324 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [853871476] [2025-04-13 18:20:56,328 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [853871476] provided 1 perfect and 0 imperfect interpolant sequences [2025-04-13 18:20:56,328 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-04-13 18:20:56,328 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2025-04-13 18:20:56,328 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [87522848] [2025-04-13 18:20:56,328 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-04-13 18:20:56,328 INFO L562 AbstractCegarLoop]: INTERPOLANT automaton has 8 states [2025-04-13 18:20:56,328 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-04-13 18:20:56,329 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2025-04-13 18:20:56,329 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=13, Invalid=43, Unknown=0, NotChecked=0, Total=56 [2025-04-13 18:20:56,329 INFO L87 Difference]: Start difference. First operand 23492 states and 98723 transitions. Second operand has 8 states, 7 states have (on average 6.285714285714286) internal successors, (44), 8 states have internal predecessors, (44), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-04-13 18:20:57,350 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-04-13 18:20:57,350 INFO L93 Difference]: Finished difference Result 47652 states and 199670 transitions. [2025-04-13 18:20:57,351 INFO L140 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 35 states. [2025-04-13 18:20:57,351 INFO L79 Accepts]: Start accepts. Automaton has has 8 states, 7 states have (on average 6.285714285714286) internal successors, (44), 8 states have internal predecessors, (44), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 44 [2025-04-13 18:20:57,351 INFO L85 Accepts]: Finished accepts. some prefix is accepted. [2025-04-13 18:20:57,519 INFO L225 Difference]: With dead ends: 47652 [2025-04-13 18:20:57,520 INFO L226 Difference]: Without dead ends: 42113 [2025-04-13 18:20:57,540 INFO L436 NwaCegarLoop]: 0 DeclaredPredicates, 61 GetRequests, 28 SyntacticMatches, 0 SemanticMatches, 33 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 313 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=246, Invalid=944, Unknown=0, NotChecked=0, Total=1190 [2025-04-13 18:20:57,541 INFO L437 NwaCegarLoop]: 41 mSDtfsCounter, 361 mSDsluCounter, 166 mSDsCounter, 0 mSdLazyCounter, 1281 mSolverCounterSat, 1 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.4s Time, 0 mProtectedPredicate, 0 mProtectedAction, 361 SdHoareTripleChecker+Valid, 207 SdHoareTripleChecker+Invalid, 1282 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 1 IncrementalHoareTripleChecker+Valid, 1281 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.5s IncrementalHoareTripleChecker+Time [2025-04-13 18:20:57,541 INFO L438 NwaCegarLoop]: SdHoareTripleChecker [361 Valid, 207 Invalid, 1282 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [1 Valid, 1281 Invalid, 0 Unknown, 0 Unchecked, 0.5s Time] [2025-04-13 18:20:57,581 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 42113 states. [2025-04-13 18:20:58,244 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 42113 to 23902. [2025-04-13 18:20:58,280 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 23902 states, 23901 states have (on average 4.205263378101335) internal successors, (100510), 23901 states have internal predecessors, (100510), 0 states have call successors, (0), 0 states have 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:58,350 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 23902 states to 23902 states and 100510 transitions. [2025-04-13 18:20:58,393 INFO L79 Accepts]: Start accepts. Automaton has 23902 states and 100510 transitions. Word has length 44 [2025-04-13 18:20:58,393 INFO L85 Accepts]: Finished accepts. word is rejected. [2025-04-13 18:20:58,393 INFO L485 AbstractCegarLoop]: Abstraction has 23902 states and 100510 transitions. [2025-04-13 18:20:58,393 INFO L486 AbstractCegarLoop]: INTERPOLANT automaton has has 8 states, 7 states have (on average 6.285714285714286) internal successors, (44), 8 states have internal predecessors, (44), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-04-13 18:20:58,393 INFO L278 IsEmpty]: Start isEmpty. Operand 23902 states and 100510 transitions. [2025-04-13 18:20:58,437 INFO L284 IsEmpty]: Finished isEmpty. Found accepting run of length 45 [2025-04-13 18:20:58,437 INFO L210 NwaCegarLoop]: Found error trace [2025-04-13 18:20:58,437 INFO L218 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-04-13 18:20:58,437 WARN L466 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable12 [2025-04-13 18:20:58,437 INFO L403 AbstractCegarLoop]: === Iteration 14 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES, ULTIMATE.startErr1INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 2 more)] === [2025-04-13 18:20:58,438 INFO L155 PredicateUnifier]: Initialized classic predicate unifier [2025-04-13 18:20:58,438 INFO L85 PathProgramCache]: Analyzing trace with hash -1670709496, now seen corresponding path program 12 times [2025-04-13 18:20:58,438 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-04-13 18:20:58,438 INFO L324 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [525732799] [2025-04-13 18:20:58,438 INFO L95 rtionOrderModulation]: Changing assertion order to MIX_INSIDE_OUTSIDE [2025-04-13 18:20:58,438 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-04-13 18:20:58,444 INFO L108 AnnotateAndAsserter]: Assert order MIX_INSIDE_OUTSIDE partitioned 44 statements into 2 equivalence classes. [2025-04-13 18:20:58,449 INFO L111 AnnotateAndAsserter]: Assert order MIX_INSIDE_OUTSIDE issued 1 check-sat command(s) and asserted 43 of 44 statements. [2025-04-13 18:20:58,449 INFO L114 AnnotateAndAsserter]: Assert order MIX_INSIDE_OUTSIDE issued 1 check-sat command(s) [2025-04-13 18:20:58,449 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-04-13 18:20:58,604 INFO L134 CoverageAnalysis]: Checked inductivity of 1 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2025-04-13 18:20:58,604 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-04-13 18:20:58,604 INFO L324 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [525732799] [2025-04-13 18:20:58,604 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [525732799] provided 1 perfect and 0 imperfect interpolant sequences [2025-04-13 18:20:58,604 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-04-13 18:20:58,604 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2025-04-13 18:20:58,604 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [981876909] [2025-04-13 18:20:58,604 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-04-13 18:20:58,604 INFO L562 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2025-04-13 18:20:58,604 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-04-13 18:20:58,605 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2025-04-13 18:20:58,605 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2025-04-13 18:20:58,605 INFO L87 Difference]: Start difference. First operand 23902 states and 100510 transitions. Second operand has 5 states, 4 states have (on average 11.0) internal successors, (44), 4 states have internal predecessors, (44), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-04-13 18:20:59,093 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-04-13 18:20:59,094 INFO L93 Difference]: Finished difference Result 34183 states and 142978 transitions. [2025-04-13 18:20:59,094 INFO L140 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2025-04-13 18:20:59,094 INFO L79 Accepts]: Start accepts. Automaton has has 5 states, 4 states have (on average 11.0) internal successors, (44), 4 states have internal predecessors, (44), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 44 [2025-04-13 18:20:59,094 INFO L85 Accepts]: Finished accepts. some prefix is accepted. [2025-04-13 18:20:59,217 INFO L225 Difference]: With dead ends: 34183 [2025-04-13 18:20:59,217 INFO L226 Difference]: Without dead ends: 27862 [2025-04-13 18:20:59,236 INFO L436 NwaCegarLoop]: 0 DeclaredPredicates, 7 GetRequests, 0 SyntacticMatches, 0 SemanticMatches, 7 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 5 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=27, Invalid=45, Unknown=0, NotChecked=0, Total=72 [2025-04-13 18:20:59,236 INFO L437 NwaCegarLoop]: 28 mSDtfsCounter, 141 mSDsluCounter, 50 mSDsCounter, 0 mSdLazyCounter, 302 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.3s Time, 0 mProtectedPredicate, 0 mProtectedAction, 141 SdHoareTripleChecker+Valid, 78 SdHoareTripleChecker+Invalid, 302 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 302 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.3s IncrementalHoareTripleChecker+Time [2025-04-13 18:20:59,236 INFO L438 NwaCegarLoop]: SdHoareTripleChecker [141 Valid, 78 Invalid, 302 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 302 Invalid, 0 Unknown, 0 Unchecked, 0.3s Time] [2025-04-13 18:20:59,262 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 27862 states. [2025-04-13 18:20:59,578 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 27862 to 24022. [2025-04-13 18:20:59,611 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 24022 states, 24021 states have (on average 4.19666125473544) internal successors, (100808), 24021 states have internal predecessors, (100808), 0 states have call successors, (0), 0 states have 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:59,871 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 24022 states to 24022 states and 100808 transitions. [2025-04-13 18:20:59,903 INFO L79 Accepts]: Start accepts. Automaton has 24022 states and 100808 transitions. Word has length 44 [2025-04-13 18:20:59,903 INFO L85 Accepts]: Finished accepts. word is rejected. [2025-04-13 18:20:59,903 INFO L485 AbstractCegarLoop]: Abstraction has 24022 states and 100808 transitions. [2025-04-13 18:20:59,904 INFO L486 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 4 states have (on average 11.0) internal successors, (44), 4 states have internal predecessors, (44), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-04-13 18:20:59,904 INFO L278 IsEmpty]: Start isEmpty. Operand 24022 states and 100808 transitions. [2025-04-13 18:20:59,950 INFO L284 IsEmpty]: Finished isEmpty. Found accepting run of length 45 [2025-04-13 18:20:59,950 INFO L210 NwaCegarLoop]: Found error trace [2025-04-13 18:20:59,950 INFO L218 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-04-13 18:20:59,950 WARN L466 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable13 [2025-04-13 18:20:59,950 INFO L403 AbstractCegarLoop]: === Iteration 15 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES, ULTIMATE.startErr1INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 2 more)] === [2025-04-13 18:20:59,951 INFO L155 PredicateUnifier]: Initialized classic predicate unifier [2025-04-13 18:20:59,951 INFO L85 PathProgramCache]: Analyzing trace with hash -631532536, now seen corresponding path program 13 times [2025-04-13 18:20:59,951 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-04-13 18:20:59,951 INFO L324 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [427914653] [2025-04-13 18:20:59,951 INFO L95 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2025-04-13 18:20:59,951 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-04-13 18:20:59,955 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 44 statements into 1 equivalence classes. [2025-04-13 18:20:59,965 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 44 of 44 statements. [2025-04-13 18:20:59,965 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-04-13 18:20:59,965 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-04-13 18:21:00,063 INFO L134 CoverageAnalysis]: Checked inductivity of 1 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2025-04-13 18:21:00,063 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-04-13 18:21:00,063 INFO L324 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [427914653] [2025-04-13 18:21:00,063 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [427914653] provided 1 perfect and 0 imperfect interpolant sequences [2025-04-13 18:21:00,063 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-04-13 18:21:00,063 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2025-04-13 18:21:00,063 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1322015475] [2025-04-13 18:21:00,063 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-04-13 18:21:00,063 INFO L562 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2025-04-13 18:21:00,063 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-04-13 18:21:00,067 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2025-04-13 18:21:00,068 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2025-04-13 18:21:00,068 INFO L87 Difference]: Start difference. First operand 24022 states and 100808 transitions. Second operand has 5 states, 4 states have (on average 11.0) internal successors, (44), 4 states have internal predecessors, (44), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-04-13 18:21:00,364 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-04-13 18:21:00,365 INFO L93 Difference]: Finished difference Result 30022 states and 125886 transitions. [2025-04-13 18:21:00,365 INFO L140 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2025-04-13 18:21:00,365 INFO L79 Accepts]: Start accepts. Automaton has has 5 states, 4 states have (on average 11.0) internal successors, (44), 4 states have internal predecessors, (44), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 44 [2025-04-13 18:21:00,365 INFO L85 Accepts]: Finished accepts. some prefix is accepted. [2025-04-13 18:21:00,615 INFO L225 Difference]: With dead ends: 30022 [2025-04-13 18:21:00,615 INFO L226 Difference]: Without dead ends: 18758 [2025-04-13 18:21:00,626 INFO L436 NwaCegarLoop]: 0 DeclaredPredicates, 6 GetRequests, 0 SyntacticMatches, 0 SemanticMatches, 6 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 2 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=22, Invalid=34, Unknown=0, NotChecked=0, Total=56 [2025-04-13 18:21:00,627 INFO L437 NwaCegarLoop]: 29 mSDtfsCounter, 100 mSDsluCounter, 50 mSDsCounter, 0 mSdLazyCounter, 274 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 100 SdHoareTripleChecker+Valid, 79 SdHoareTripleChecker+Invalid, 274 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 274 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2025-04-13 18:21:00,627 INFO L438 NwaCegarLoop]: SdHoareTripleChecker [100 Valid, 79 Invalid, 274 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 274 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2025-04-13 18:21:00,641 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 18758 states. [2025-04-13 18:21:00,851 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 18758 to 18494. [2025-04-13 18:21:00,876 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 18494 states, 18493 states have (on average 4.110960904125886) internal successors, (76024), 18493 states have internal predecessors, (76024), 0 states have call successors, (0), 0 states have 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:21:00,924 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 18494 states to 18494 states and 76024 transitions. [2025-04-13 18:21:00,955 INFO L79 Accepts]: Start accepts. Automaton has 18494 states and 76024 transitions. Word has length 44 [2025-04-13 18:21:00,956 INFO L85 Accepts]: Finished accepts. word is rejected. [2025-04-13 18:21:00,956 INFO L485 AbstractCegarLoop]: Abstraction has 18494 states and 76024 transitions. [2025-04-13 18:21:00,956 INFO L486 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 4 states have (on average 11.0) internal successors, (44), 4 states have internal predecessors, (44), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-04-13 18:21:00,956 INFO L278 IsEmpty]: Start isEmpty. Operand 18494 states and 76024 transitions. [2025-04-13 18:21:00,986 INFO L284 IsEmpty]: Finished isEmpty. Found accepting run of length 45 [2025-04-13 18:21:00,987 INFO L210 NwaCegarLoop]: Found error trace [2025-04-13 18:21:00,987 INFO L218 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-04-13 18:21:00,987 WARN L466 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable14 [2025-04-13 18:21:00,987 INFO L403 AbstractCegarLoop]: === Iteration 16 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES, ULTIMATE.startErr1INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 2 more)] === [2025-04-13 18:21:00,987 INFO L155 PredicateUnifier]: Initialized classic predicate unifier [2025-04-13 18:21:00,987 INFO L85 PathProgramCache]: Analyzing trace with hash -426793666, now seen corresponding path program 14 times [2025-04-13 18:21:00,987 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-04-13 18:21:00,987 INFO L324 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1641625189] [2025-04-13 18:21:00,987 INFO L95 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST1 [2025-04-13 18:21:00,987 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-04-13 18:21:00,992 INFO L108 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 partitioned 44 statements into 2 equivalence classes. [2025-04-13 18:21:00,995 INFO L111 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 issued 1 check-sat command(s) and asserted 43 of 44 statements. [2025-04-13 18:21:00,995 INFO L114 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 issued 1 check-sat command(s) [2025-04-13 18:21:00,995 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-04-13 18:21:01,080 INFO L134 CoverageAnalysis]: Checked inductivity of 1 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2025-04-13 18:21:01,080 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-04-13 18:21:01,080 INFO L324 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1641625189] [2025-04-13 18:21:01,080 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1641625189] provided 1 perfect and 0 imperfect interpolant sequences [2025-04-13 18:21:01,080 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-04-13 18:21:01,080 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2025-04-13 18:21:01,080 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [544993948] [2025-04-13 18:21:01,080 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-04-13 18:21:01,080 INFO L562 AbstractCegarLoop]: INTERPOLANT automaton has 8 states [2025-04-13 18:21:01,080 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-04-13 18:21:01,081 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2025-04-13 18:21:01,081 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=13, Invalid=43, Unknown=0, NotChecked=0, Total=56 [2025-04-13 18:21:01,081 INFO L87 Difference]: Start difference. First operand 18494 states and 76024 transitions. Second operand has 8 states, 7 states have (on average 6.285714285714286) internal successors, (44), 8 states have internal predecessors, (44), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-04-13 18:21:01,903 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-04-13 18:21:01,903 INFO L93 Difference]: Finished difference Result 29267 states and 121116 transitions. [2025-04-13 18:21:01,903 INFO L140 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 22 states. [2025-04-13 18:21:01,903 INFO L79 Accepts]: Start accepts. Automaton has has 8 states, 7 states have (on average 6.285714285714286) internal successors, (44), 8 states have internal predecessors, (44), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 44 [2025-04-13 18:21:01,903 INFO L85 Accepts]: Finished accepts. some prefix is accepted. [2025-04-13 18:21:02,031 INFO L225 Difference]: With dead ends: 29267 [2025-04-13 18:21:02,031 INFO L226 Difference]: Without dead ends: 25194 [2025-04-13 18:21:02,046 INFO L436 NwaCegarLoop]: 0 DeclaredPredicates, 35 GetRequests, 15 SyntacticMatches, 0 SemanticMatches, 20 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 84 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=100, Invalid=362, Unknown=0, NotChecked=0, Total=462 [2025-04-13 18:21:02,046 INFO L437 NwaCegarLoop]: 32 mSDtfsCounter, 293 mSDsluCounter, 133 mSDsCounter, 0 mSdLazyCounter, 1046 mSolverCounterSat, 1 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.4s Time, 0 mProtectedPredicate, 0 mProtectedAction, 293 SdHoareTripleChecker+Valid, 165 SdHoareTripleChecker+Invalid, 1047 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 1 IncrementalHoareTripleChecker+Valid, 1046 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.5s IncrementalHoareTripleChecker+Time [2025-04-13 18:21:02,046 INFO L438 NwaCegarLoop]: SdHoareTripleChecker [293 Valid, 165 Invalid, 1047 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [1 Valid, 1046 Invalid, 0 Unknown, 0 Unchecked, 0.5s Time] [2025-04-13 18:21:02,071 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 25194 states. [2025-04-13 18:21:02,434 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 25194 to 18516. [2025-04-13 18:21:02,461 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 18516 states, 18515 states have (on average 4.110775047258979) internal successors, (76111), 18515 states have internal predecessors, (76111), 0 states have call successors, (0), 0 states have 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:21:02,699 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 18516 states to 18516 states and 76111 transitions. [2025-04-13 18:21:02,736 INFO L79 Accepts]: Start accepts. Automaton has 18516 states and 76111 transitions. Word has length 44 [2025-04-13 18:21:02,737 INFO L85 Accepts]: Finished accepts. word is rejected. [2025-04-13 18:21:02,737 INFO L485 AbstractCegarLoop]: Abstraction has 18516 states and 76111 transitions. [2025-04-13 18:21:02,737 INFO L486 AbstractCegarLoop]: INTERPOLANT automaton has has 8 states, 7 states have (on average 6.285714285714286) internal successors, (44), 8 states have internal predecessors, (44), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-04-13 18:21:02,737 INFO L278 IsEmpty]: Start isEmpty. Operand 18516 states and 76111 transitions. [2025-04-13 18:21:02,769 INFO L284 IsEmpty]: Finished isEmpty. Found accepting run of length 45 [2025-04-13 18:21:02,769 INFO L210 NwaCegarLoop]: Found error trace [2025-04-13 18:21:02,769 INFO L218 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-04-13 18:21:02,769 WARN L466 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable15 [2025-04-13 18:21:02,769 INFO L403 AbstractCegarLoop]: === Iteration 17 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES, ULTIMATE.startErr1INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 2 more)] === [2025-04-13 18:21:02,769 INFO L155 PredicateUnifier]: Initialized classic predicate unifier [2025-04-13 18:21:02,770 INFO L85 PathProgramCache]: Analyzing trace with hash -489994626, now seen corresponding path program 15 times [2025-04-13 18:21:02,770 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-04-13 18:21:02,770 INFO L324 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [317469935] [2025-04-13 18:21:02,770 INFO L95 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST2 [2025-04-13 18:21:02,770 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-04-13 18:21:02,774 INFO L108 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST2 partitioned 44 statements into 2 equivalence classes. [2025-04-13 18:21:02,778 INFO L111 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST2 issued 1 check-sat command(s) and asserted 43 of 44 statements. [2025-04-13 18:21:02,778 INFO L114 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST2 issued 1 check-sat command(s) [2025-04-13 18:21:02,778 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-04-13 18:21:02,928 INFO L134 CoverageAnalysis]: Checked inductivity of 1 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2025-04-13 18:21:02,928 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-04-13 18:21:02,928 INFO L324 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [317469935] [2025-04-13 18:21:02,928 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [317469935] provided 1 perfect and 0 imperfect interpolant sequences [2025-04-13 18:21:02,928 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-04-13 18:21:02,928 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [11] imperfect sequences [] total 11 [2025-04-13 18:21:02,928 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [836765366] [2025-04-13 18:21:02,928 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-04-13 18:21:02,929 INFO L562 AbstractCegarLoop]: INTERPOLANT automaton has 12 states [2025-04-13 18:21:02,929 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-04-13 18:21:02,929 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 12 interpolants. [2025-04-13 18:21:02,929 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=28, Invalid=104, Unknown=0, NotChecked=0, Total=132 [2025-04-13 18:21:02,929 INFO L87 Difference]: Start difference. First operand 18516 states and 76111 transitions. Second operand has 12 states, 11 states have (on average 4.0) internal successors, (44), 12 states have internal predecessors, (44), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-04-13 18:21:03,881 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-04-13 18:21:03,881 INFO L93 Difference]: Finished difference Result 32110 states and 137449 transitions. [2025-04-13 18:21:03,882 INFO L140 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 26 states. [2025-04-13 18:21:03,882 INFO L79 Accepts]: Start accepts. Automaton has has 12 states, 11 states have (on average 4.0) internal successors, (44), 12 states have internal predecessors, (44), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 44 [2025-04-13 18:21:03,882 INFO L85 Accepts]: Finished accepts. some prefix is accepted. [2025-04-13 18:21:04,011 INFO L225 Difference]: With dead ends: 32110 [2025-04-13 18:21:04,011 INFO L226 Difference]: Without dead ends: 29307 [2025-04-13 18:21:04,023 INFO L436 NwaCegarLoop]: 0 DeclaredPredicates, 28 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 26 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 162 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=143, Invalid=613, Unknown=0, NotChecked=0, Total=756 [2025-04-13 18:21:04,023 INFO L437 NwaCegarLoop]: 64 mSDtfsCounter, 398 mSDsluCounter, 386 mSDsCounter, 0 mSdLazyCounter, 1931 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.5s Time, 0 mProtectedPredicate, 0 mProtectedAction, 398 SdHoareTripleChecker+Valid, 450 SdHoareTripleChecker+Invalid, 1931 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 1931 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.6s IncrementalHoareTripleChecker+Time [2025-04-13 18:21:04,023 INFO L438 NwaCegarLoop]: SdHoareTripleChecker [398 Valid, 450 Invalid, 1931 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 1931 Invalid, 0 Unknown, 0 Unchecked, 0.6s Time] [2025-04-13 18:21:04,049 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 29307 states. [2025-04-13 18:21:04,313 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 29307 to 18552. [2025-04-13 18:21:04,338 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 18552 states, 18551 states have (on average 4.1107217939733705) internal successors, (76258), 18551 states have internal predecessors, (76258), 0 states have call successors, (0), 0 states have 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:21:04,385 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 18552 states to 18552 states and 76258 transitions. [2025-04-13 18:21:04,436 INFO L79 Accepts]: Start accepts. Automaton has 18552 states and 76258 transitions. Word has length 44 [2025-04-13 18:21:04,437 INFO L85 Accepts]: Finished accepts. word is rejected. [2025-04-13 18:21:04,437 INFO L485 AbstractCegarLoop]: Abstraction has 18552 states and 76258 transitions. [2025-04-13 18:21:04,437 INFO L486 AbstractCegarLoop]: INTERPOLANT automaton has has 12 states, 11 states have (on average 4.0) internal successors, (44), 12 states have internal predecessors, (44), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-04-13 18:21:04,437 INFO L278 IsEmpty]: Start isEmpty. Operand 18552 states and 76258 transitions. [2025-04-13 18:21:04,468 INFO L284 IsEmpty]: Finished isEmpty. Found accepting run of length 45 [2025-04-13 18:21:04,468 INFO L210 NwaCegarLoop]: Found error trace [2025-04-13 18:21:04,468 INFO L218 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-04-13 18:21:04,468 WARN L466 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable16 [2025-04-13 18:21:04,468 INFO L403 AbstractCegarLoop]: === Iteration 18 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES, ULTIMATE.startErr1INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 2 more)] === [2025-04-13 18:21:04,468 INFO L155 PredicateUnifier]: Initialized classic predicate unifier [2025-04-13 18:21:04,468 INFO L85 PathProgramCache]: Analyzing trace with hash -876706974, now seen corresponding path program 16 times [2025-04-13 18:21:04,468 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-04-13 18:21:04,468 INFO L324 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [876227666] [2025-04-13 18:21:04,468 INFO L95 rtionOrderModulation]: Changing assertion order to TERMS_WITH_SMALL_CONSTANTS_FIRST [2025-04-13 18:21:04,468 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-04-13 18:21:04,473 INFO L108 AnnotateAndAsserter]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST partitioned 44 statements into 2 equivalence classes. [2025-04-13 18:21:04,475 INFO L111 AnnotateAndAsserter]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST issued 1 check-sat command(s) and asserted 37 of 44 statements. [2025-04-13 18:21:04,475 INFO L114 AnnotateAndAsserter]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST issued 1 check-sat command(s) [2025-04-13 18:21:04,475 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-04-13 18:21:04,699 INFO L134 CoverageAnalysis]: Checked inductivity of 1 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2025-04-13 18:21:04,699 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-04-13 18:21:04,699 INFO L324 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [876227666] [2025-04-13 18:21:04,699 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [876227666] provided 1 perfect and 0 imperfect interpolant sequences [2025-04-13 18:21:04,699 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-04-13 18:21:04,699 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [11] imperfect sequences [] total 11 [2025-04-13 18:21:04,699 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1182316170] [2025-04-13 18:21:04,699 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-04-13 18:21:04,699 INFO L562 AbstractCegarLoop]: INTERPOLANT automaton has 11 states [2025-04-13 18:21:04,700 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-04-13 18:21:04,700 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 11 interpolants. [2025-04-13 18:21:04,700 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=25, Invalid=85, Unknown=0, NotChecked=0, Total=110 [2025-04-13 18:21:04,700 INFO L87 Difference]: Start difference. First operand 18552 states and 76258 transitions. Second operand has 11 states, 11 states have (on average 4.0) internal successors, (44), 11 states have internal predecessors, (44), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-04-13 18:21:05,346 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-04-13 18:21:05,346 INFO L93 Difference]: Finished difference Result 32927 states and 140224 transitions. [2025-04-13 18:21:05,346 INFO L140 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 21 states. [2025-04-13 18:21:05,346 INFO L79 Accepts]: Start accepts. Automaton has has 11 states, 11 states have (on average 4.0) internal successors, (44), 11 states have internal predecessors, (44), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 44 [2025-04-13 18:21:05,346 INFO L85 Accepts]: Finished accepts. some prefix is accepted. [2025-04-13 18:21:05,484 INFO L225 Difference]: With dead ends: 32927 [2025-04-13 18:21:05,484 INFO L226 Difference]: Without dead ends: 30851 [2025-04-13 18:21:05,498 INFO L436 NwaCegarLoop]: 0 DeclaredPredicates, 22 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 20 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 92 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=98, Invalid=364, Unknown=0, NotChecked=0, Total=462 [2025-04-13 18:21:05,499 INFO L437 NwaCegarLoop]: 46 mSDtfsCounter, 273 mSDsluCounter, 162 mSDsCounter, 0 mSdLazyCounter, 1074 mSolverCounterSat, 6 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.3s Time, 0 mProtectedPredicate, 0 mProtectedAction, 273 SdHoareTripleChecker+Valid, 208 SdHoareTripleChecker+Invalid, 1080 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 6 IncrementalHoareTripleChecker+Valid, 1074 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.4s IncrementalHoareTripleChecker+Time [2025-04-13 18:21:05,499 INFO L438 NwaCegarLoop]: SdHoareTripleChecker [273 Valid, 208 Invalid, 1080 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [6 Valid, 1074 Invalid, 0 Unknown, 0 Unchecked, 0.4s Time] [2025-04-13 18:21:05,528 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 30851 states. [2025-04-13 18:21:05,988 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 30851 to 20241. [2025-04-13 18:21:06,018 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 20241 states, 20240 states have (on average 4.126482213438735) internal successors, (83520), 20240 states have internal predecessors, (83520), 0 states have call successors, (0), 0 states have 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:21:06,100 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 20241 states to 20241 states and 83520 transitions. [2025-04-13 18:21:06,148 INFO L79 Accepts]: Start accepts. Automaton has 20241 states and 83520 transitions. Word has length 44 [2025-04-13 18:21:06,149 INFO L85 Accepts]: Finished accepts. word is rejected. [2025-04-13 18:21:06,149 INFO L485 AbstractCegarLoop]: Abstraction has 20241 states and 83520 transitions. [2025-04-13 18:21:06,149 INFO L486 AbstractCegarLoop]: INTERPOLANT automaton has has 11 states, 11 states have (on average 4.0) internal successors, (44), 11 states have internal predecessors, (44), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-04-13 18:21:06,149 INFO L278 IsEmpty]: Start isEmpty. Operand 20241 states and 83520 transitions. [2025-04-13 18:21:06,190 INFO L284 IsEmpty]: Finished isEmpty. Found accepting run of length 45 [2025-04-13 18:21:06,191 INFO L210 NwaCegarLoop]: Found error trace [2025-04-13 18:21:06,191 INFO L218 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-04-13 18:21:06,191 WARN L466 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable17 [2025-04-13 18:21:06,191 INFO L403 AbstractCegarLoop]: === Iteration 19 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES, ULTIMATE.startErr1INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 2 more)] === [2025-04-13 18:21:06,191 INFO L155 PredicateUnifier]: Initialized classic predicate unifier [2025-04-13 18:21:06,191 INFO L85 PathProgramCache]: Analyzing trace with hash -1108307812, now seen corresponding path program 17 times [2025-04-13 18:21:06,191 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-04-13 18:21:06,191 INFO L324 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [349412492] [2025-04-13 18:21:06,191 INFO L95 rtionOrderModulation]: Changing assertion order to INSIDE_LOOP_FIRST1 [2025-04-13 18:21:06,191 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-04-13 18:21:06,197 INFO L108 AnnotateAndAsserter]: Assert order INSIDE_LOOP_FIRST1 partitioned 44 statements into 2 equivalence classes. [2025-04-13 18:21:06,202 INFO L111 AnnotateAndAsserter]: Assert order INSIDE_LOOP_FIRST1 issued 2 check-sat command(s) and asserted 44 of 44 statements. [2025-04-13 18:21:06,202 INFO L114 AnnotateAndAsserter]: Assert order INSIDE_LOOP_FIRST1 issued 2 check-sat command(s) [2025-04-13 18:21:06,202 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-04-13 18:21:06,415 INFO L134 CoverageAnalysis]: Checked inductivity of 1 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2025-04-13 18:21:06,415 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-04-13 18:21:06,415 INFO L324 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [349412492] [2025-04-13 18:21:06,415 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [349412492] provided 1 perfect and 0 imperfect interpolant sequences [2025-04-13 18:21:06,415 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-04-13 18:21:06,415 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [11] imperfect sequences [] total 11 [2025-04-13 18:21:06,415 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [238538979] [2025-04-13 18:21:06,415 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-04-13 18:21:06,416 INFO L562 AbstractCegarLoop]: INTERPOLANT automaton has 12 states [2025-04-13 18:21:06,416 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-04-13 18:21:06,416 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 12 interpolants. [2025-04-13 18:21:06,416 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=27, Invalid=105, Unknown=0, NotChecked=0, Total=132 [2025-04-13 18:21:06,416 INFO L87 Difference]: Start difference. First operand 20241 states and 83520 transitions. Second operand has 12 states, 11 states have (on average 4.0) internal successors, (44), 12 states have internal predecessors, (44), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-04-13 18:21:07,637 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-04-13 18:21:07,637 INFO L93 Difference]: Finished difference Result 34708 states and 147873 transitions. [2025-04-13 18:21:07,637 INFO L140 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 26 states. [2025-04-13 18:21:07,637 INFO L79 Accepts]: Start accepts. Automaton has has 12 states, 11 states have (on average 4.0) internal successors, (44), 12 states have internal predecessors, (44), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 44 [2025-04-13 18:21:07,638 INFO L85 Accepts]: Finished accepts. some prefix is accepted. [2025-04-13 18:21:07,779 INFO L225 Difference]: With dead ends: 34708 [2025-04-13 18:21:07,780 INFO L226 Difference]: Without dead ends: 32370 [2025-04-13 18:21:07,793 INFO L436 NwaCegarLoop]: 0 DeclaredPredicates, 27 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 25 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 150 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=129, Invalid=573, Unknown=0, NotChecked=0, Total=702 [2025-04-13 18:21:07,793 INFO L437 NwaCegarLoop]: 64 mSDtfsCounter, 356 mSDsluCounter, 398 mSDsCounter, 0 mSdLazyCounter, 2042 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.6s Time, 0 mProtectedPredicate, 0 mProtectedAction, 356 SdHoareTripleChecker+Valid, 462 SdHoareTripleChecker+Invalid, 2042 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 2042 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.7s IncrementalHoareTripleChecker+Time [2025-04-13 18:21:07,793 INFO L438 NwaCegarLoop]: SdHoareTripleChecker [356 Valid, 462 Invalid, 2042 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 2042 Invalid, 0 Unknown, 0 Unchecked, 0.7s Time] [2025-04-13 18:21:07,821 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 32370 states. [2025-04-13 18:21:08,124 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 32370 to 20237. [2025-04-13 18:21:08,152 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 20237 states, 20236 states have (on average 4.126358964222178) internal successors, (83501), 20236 states have internal predecessors, (83501), 0 states have call successors, (0), 0 states have 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:21:08,400 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 20237 states to 20237 states and 83501 transitions. [2025-04-13 18:21:08,446 INFO L79 Accepts]: Start accepts. Automaton has 20237 states and 83501 transitions. Word has length 44 [2025-04-13 18:21:08,446 INFO L85 Accepts]: Finished accepts. word is rejected. [2025-04-13 18:21:08,446 INFO L485 AbstractCegarLoop]: Abstraction has 20237 states and 83501 transitions. [2025-04-13 18:21:08,446 INFO L486 AbstractCegarLoop]: INTERPOLANT automaton has has 12 states, 11 states have (on average 4.0) internal successors, (44), 12 states have internal predecessors, (44), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-04-13 18:21:08,446 INFO L278 IsEmpty]: Start isEmpty. Operand 20237 states and 83501 transitions. [2025-04-13 18:21:08,481 INFO L284 IsEmpty]: Finished isEmpty. Found accepting run of length 45 [2025-04-13 18:21:08,481 INFO L210 NwaCegarLoop]: Found error trace [2025-04-13 18:21:08,481 INFO L218 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-04-13 18:21:08,482 WARN L466 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable18 [2025-04-13 18:21:08,482 INFO L403 AbstractCegarLoop]: === Iteration 20 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES, ULTIMATE.startErr1INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 2 more)] === [2025-04-13 18:21:08,482 INFO L155 PredicateUnifier]: Initialized classic predicate unifier [2025-04-13 18:21:08,482 INFO L85 PathProgramCache]: Analyzing trace with hash 14093862, now seen corresponding path program 18 times [2025-04-13 18:21:08,482 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-04-13 18:21:08,482 INFO L324 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [589189846] [2025-04-13 18:21:08,482 INFO L95 rtionOrderModulation]: Changing assertion order to MIX_INSIDE_OUTSIDE [2025-04-13 18:21:08,482 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-04-13 18:21:08,486 INFO L108 AnnotateAndAsserter]: Assert order MIX_INSIDE_OUTSIDE partitioned 44 statements into 2 equivalence classes. [2025-04-13 18:21:08,489 INFO L111 AnnotateAndAsserter]: Assert order MIX_INSIDE_OUTSIDE issued 1 check-sat command(s) and asserted 43 of 44 statements. [2025-04-13 18:21:08,489 INFO L114 AnnotateAndAsserter]: Assert order MIX_INSIDE_OUTSIDE issued 1 check-sat command(s) [2025-04-13 18:21:08,489 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-04-13 18:21:08,567 INFO L134 CoverageAnalysis]: Checked inductivity of 1 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2025-04-13 18:21:08,568 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-04-13 18:21:08,568 INFO L324 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [589189846] [2025-04-13 18:21:08,568 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [589189846] provided 1 perfect and 0 imperfect interpolant sequences [2025-04-13 18:21:08,568 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-04-13 18:21:08,568 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2025-04-13 18:21:08,568 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [395579503] [2025-04-13 18:21:08,568 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-04-13 18:21:08,568 INFO L562 AbstractCegarLoop]: INTERPOLANT automaton has 8 states [2025-04-13 18:21:08,568 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-04-13 18:21:08,568 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2025-04-13 18:21:08,568 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=13, Invalid=43, Unknown=0, NotChecked=0, Total=56 [2025-04-13 18:21:08,568 INFO L87 Difference]: Start difference. First operand 20237 states and 83501 transitions. Second operand has 8 states, 7 states have (on average 6.285714285714286) internal successors, (44), 8 states have internal predecessors, (44), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-04-13 18:21:09,245 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-04-13 18:21:09,246 INFO L93 Difference]: Finished difference Result 32848 states and 135748 transitions. [2025-04-13 18:21:09,246 INFO L140 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 21 states. [2025-04-13 18:21:09,246 INFO L79 Accepts]: Start accepts. Automaton has has 8 states, 7 states have (on average 6.285714285714286) internal successors, (44), 8 states have internal predecessors, (44), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 44 [2025-04-13 18:21:09,246 INFO L85 Accepts]: Finished accepts. some prefix is accepted. [2025-04-13 18:21:09,373 INFO L225 Difference]: With dead ends: 32848 [2025-04-13 18:21:09,373 INFO L226 Difference]: Without dead ends: 28415 [2025-04-13 18:21:09,388 INFO L436 NwaCegarLoop]: 0 DeclaredPredicates, 33 GetRequests, 14 SyntacticMatches, 0 SemanticMatches, 19 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 70 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=92, Invalid=328, Unknown=0, NotChecked=0, Total=420 [2025-04-13 18:21:09,388 INFO L437 NwaCegarLoop]: 33 mSDtfsCounter, 277 mSDsluCounter, 133 mSDsCounter, 0 mSdLazyCounter, 1085 mSolverCounterSat, 1 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.4s Time, 0 mProtectedPredicate, 0 mProtectedAction, 277 SdHoareTripleChecker+Valid, 166 SdHoareTripleChecker+Invalid, 1086 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 1 IncrementalHoareTripleChecker+Valid, 1085 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.4s IncrementalHoareTripleChecker+Time [2025-04-13 18:21:09,388 INFO L438 NwaCegarLoop]: SdHoareTripleChecker [277 Valid, 166 Invalid, 1086 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [1 Valid, 1085 Invalid, 0 Unknown, 0 Unchecked, 0.4s Time] [2025-04-13 18:21:09,414 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 28415 states. [2025-04-13 18:21:09,819 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 28415 to 19745. [2025-04-13 18:21:09,846 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 19745 states, 19744 states have (on average 4.116997568881685) internal successors, (81286), 19744 states have internal predecessors, (81286), 0 states have call successors, (0), 0 states have 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:21:09,896 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 19745 states to 19745 states and 81286 transitions. [2025-04-13 18:21:09,937 INFO L79 Accepts]: Start accepts. Automaton has 19745 states and 81286 transitions. Word has length 44 [2025-04-13 18:21:09,937 INFO L85 Accepts]: Finished accepts. word is rejected. [2025-04-13 18:21:09,938 INFO L485 AbstractCegarLoop]: Abstraction has 19745 states and 81286 transitions. [2025-04-13 18:21:09,938 INFO L486 AbstractCegarLoop]: INTERPOLANT automaton has has 8 states, 7 states have (on average 6.285714285714286) internal successors, (44), 8 states have internal predecessors, (44), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-04-13 18:21:09,938 INFO L278 IsEmpty]: Start isEmpty. Operand 19745 states and 81286 transitions. [2025-04-13 18:21:09,970 INFO L284 IsEmpty]: Finished isEmpty. Found accepting run of length 45 [2025-04-13 18:21:09,970 INFO L210 NwaCegarLoop]: Found error trace [2025-04-13 18:21:09,970 INFO L218 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-04-13 18:21:09,970 WARN L466 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable19 [2025-04-13 18:21:09,970 INFO L403 AbstractCegarLoop]: === Iteration 21 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES, ULTIMATE.startErr1INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 2 more)] === [2025-04-13 18:21:09,971 INFO L155 PredicateUnifier]: Initialized classic predicate unifier [2025-04-13 18:21:09,971 INFO L85 PathProgramCache]: Analyzing trace with hash -1838524266, now seen corresponding path program 19 times [2025-04-13 18:21:09,971 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-04-13 18:21:09,971 INFO L324 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [296042678] [2025-04-13 18:21:09,971 INFO L95 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2025-04-13 18:21:09,971 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-04-13 18:21:09,976 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 44 statements into 1 equivalence classes. [2025-04-13 18:21:09,979 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 44 of 44 statements. [2025-04-13 18:21:09,979 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-04-13 18:21:09,979 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-04-13 18:21:10,254 INFO L134 CoverageAnalysis]: Checked inductivity of 1 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2025-04-13 18:21:10,255 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-04-13 18:21:10,255 INFO L324 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [296042678] [2025-04-13 18:21:10,255 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [296042678] provided 1 perfect and 0 imperfect interpolant sequences [2025-04-13 18:21:10,255 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-04-13 18:21:10,255 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [11] imperfect sequences [] total 11 [2025-04-13 18:21:10,255 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [660313215] [2025-04-13 18:21:10,255 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-04-13 18:21:10,255 INFO L562 AbstractCegarLoop]: INTERPOLANT automaton has 12 states [2025-04-13 18:21:10,255 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-04-13 18:21:10,255 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 12 interpolants. [2025-04-13 18:21:10,256 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=27, Invalid=105, Unknown=0, NotChecked=0, Total=132 [2025-04-13 18:21:10,256 INFO L87 Difference]: Start difference. First operand 19745 states and 81286 transitions. Second operand has 12 states, 11 states have (on average 4.0) internal successors, (44), 12 states have internal predecessors, (44), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-04-13 18:21:11,342 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-04-13 18:21:11,342 INFO L93 Difference]: Finished difference Result 33988 states and 145297 transitions. [2025-04-13 18:21:11,342 INFO L140 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 32 states. [2025-04-13 18:21:11,342 INFO L79 Accepts]: Start accepts. Automaton has has 12 states, 11 states have (on average 4.0) internal successors, (44), 12 states have internal predecessors, (44), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 44 [2025-04-13 18:21:11,342 INFO L85 Accepts]: Finished accepts. some prefix is accepted. [2025-04-13 18:21:11,500 INFO L225 Difference]: With dead ends: 33988 [2025-04-13 18:21:11,500 INFO L226 Difference]: Without dead ends: 31185 [2025-04-13 18:21:11,516 INFO L436 NwaCegarLoop]: 0 DeclaredPredicates, 33 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 31 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 261 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=180, Invalid=876, Unknown=0, NotChecked=0, Total=1056 [2025-04-13 18:21:11,516 INFO L437 NwaCegarLoop]: 65 mSDtfsCounter, 435 mSDsluCounter, 332 mSDsCounter, 0 mSdLazyCounter, 1682 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.5s Time, 0 mProtectedPredicate, 0 mProtectedAction, 435 SdHoareTripleChecker+Valid, 397 SdHoareTripleChecker+Invalid, 1682 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 1682 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.6s IncrementalHoareTripleChecker+Time [2025-04-13 18:21:11,516 INFO L438 NwaCegarLoop]: SdHoareTripleChecker [435 Valid, 397 Invalid, 1682 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 1682 Invalid, 0 Unknown, 0 Unchecked, 0.6s Time] [2025-04-13 18:21:11,547 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 31185 states. [2025-04-13 18:21:12,026 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 31185 to 19725. [2025-04-13 18:21:12,053 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 19725 states, 19724 states have (on average 4.117369701886028) internal successors, (81211), 19724 states have internal predecessors, (81211), 0 states have call successors, (0), 0 states have 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:21:12,115 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 19725 states to 19725 states and 81211 transitions. [2025-04-13 18:21:12,162 INFO L79 Accepts]: Start accepts. Automaton has 19725 states and 81211 transitions. Word has length 44 [2025-04-13 18:21:12,162 INFO L85 Accepts]: Finished accepts. word is rejected. [2025-04-13 18:21:12,162 INFO L485 AbstractCegarLoop]: Abstraction has 19725 states and 81211 transitions. [2025-04-13 18:21:12,162 INFO L486 AbstractCegarLoop]: INTERPOLANT automaton has has 12 states, 11 states have (on average 4.0) internal successors, (44), 12 states have internal predecessors, (44), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-04-13 18:21:12,163 INFO L278 IsEmpty]: Start isEmpty. Operand 19725 states and 81211 transitions. [2025-04-13 18:21:12,195 INFO L284 IsEmpty]: Finished isEmpty. Found accepting run of length 45 [2025-04-13 18:21:12,195 INFO L210 NwaCegarLoop]: Found error trace [2025-04-13 18:21:12,196 INFO L218 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-04-13 18:21:12,196 WARN L466 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable20 [2025-04-13 18:21:12,196 INFO L403 AbstractCegarLoop]: === Iteration 22 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES, ULTIMATE.startErr1INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 2 more)] === [2025-04-13 18:21:12,196 INFO L155 PredicateUnifier]: Initialized classic predicate unifier [2025-04-13 18:21:12,196 INFO L85 PathProgramCache]: Analyzing trace with hash 1157260418, now seen corresponding path program 20 times [2025-04-13 18:21:12,196 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-04-13 18:21:12,196 INFO L324 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1481371175] [2025-04-13 18:21:12,196 INFO L95 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST1 [2025-04-13 18:21:12,196 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-04-13 18:21:12,200 INFO L108 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 partitioned 44 statements into 2 equivalence classes. [2025-04-13 18:21:12,204 INFO L111 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 issued 1 check-sat command(s) and asserted 43 of 44 statements. [2025-04-13 18:21:12,204 INFO L114 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 issued 1 check-sat command(s) [2025-04-13 18:21:12,204 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-04-13 18:21:12,340 INFO L134 CoverageAnalysis]: Checked inductivity of 1 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2025-04-13 18:21:12,340 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-04-13 18:21:12,340 INFO L324 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1481371175] [2025-04-13 18:21:12,340 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1481371175] provided 1 perfect and 0 imperfect interpolant sequences [2025-04-13 18:21:12,340 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-04-13 18:21:12,341 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [11] imperfect sequences [] total 11 [2025-04-13 18:21:12,341 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1711749089] [2025-04-13 18:21:12,341 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-04-13 18:21:12,341 INFO L562 AbstractCegarLoop]: INTERPOLANT automaton has 12 states [2025-04-13 18:21:12,341 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-04-13 18:21:12,341 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 12 interpolants. [2025-04-13 18:21:12,341 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=26, Invalid=106, Unknown=0, NotChecked=0, Total=132 [2025-04-13 18:21:12,342 INFO L87 Difference]: Start difference. First operand 19725 states and 81211 transitions. Second operand has 12 states, 11 states have (on average 4.0) internal successors, (44), 12 states have internal predecessors, (44), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-04-13 18:21:13,429 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-04-13 18:21:13,429 INFO L93 Difference]: Finished difference Result 35464 states and 150478 transitions. [2025-04-13 18:21:13,429 INFO L140 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 27 states. [2025-04-13 18:21:13,429 INFO L79 Accepts]: Start accepts. Automaton has has 12 states, 11 states have (on average 4.0) internal successors, (44), 12 states have internal predecessors, (44), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 44 [2025-04-13 18:21:13,429 INFO L85 Accepts]: Finished accepts. some prefix is accepted. [2025-04-13 18:21:13,571 INFO L225 Difference]: With dead ends: 35464 [2025-04-13 18:21:13,571 INFO L226 Difference]: Without dead ends: 33126 [2025-04-13 18:21:13,587 INFO L436 NwaCegarLoop]: 0 DeclaredPredicates, 29 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 27 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 177 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=153, Invalid=659, Unknown=0, NotChecked=0, Total=812 [2025-04-13 18:21:13,588 INFO L437 NwaCegarLoop]: 64 mSDtfsCounter, 370 mSDsluCounter, 466 mSDsCounter, 0 mSdLazyCounter, 2236 mSolverCounterSat, 1 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.6s Time, 0 mProtectedPredicate, 0 mProtectedAction, 370 SdHoareTripleChecker+Valid, 530 SdHoareTripleChecker+Invalid, 2237 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 1 IncrementalHoareTripleChecker+Valid, 2236 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.7s IncrementalHoareTripleChecker+Time [2025-04-13 18:21:13,589 INFO L438 NwaCegarLoop]: SdHoareTripleChecker [370 Valid, 530 Invalid, 2237 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [1 Valid, 2236 Invalid, 0 Unknown, 0 Unchecked, 0.7s Time] [2025-04-13 18:21:13,618 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 33126 states. [2025-04-13 18:21:14,066 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 33126 to 19785. [2025-04-13 18:21:14,093 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 19785 states, 19784 states have (on average 4.116255560048524) internal successors, (81436), 19784 states have internal predecessors, (81436), 0 states have call successors, (0), 0 states have 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:21:14,145 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 19785 states to 19785 states and 81436 transitions. [2025-04-13 18:21:14,191 INFO L79 Accepts]: Start accepts. Automaton has 19785 states and 81436 transitions. Word has length 44 [2025-04-13 18:21:14,191 INFO L85 Accepts]: Finished accepts. word is rejected. [2025-04-13 18:21:14,192 INFO L485 AbstractCegarLoop]: Abstraction has 19785 states and 81436 transitions. [2025-04-13 18:21:14,192 INFO L486 AbstractCegarLoop]: INTERPOLANT automaton has has 12 states, 11 states have (on average 4.0) internal successors, (44), 12 states have internal predecessors, (44), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-04-13 18:21:14,192 INFO L278 IsEmpty]: Start isEmpty. Operand 19785 states and 81436 transitions. [2025-04-13 18:21:14,224 INFO L284 IsEmpty]: Finished isEmpty. Found accepting run of length 45 [2025-04-13 18:21:14,225 INFO L210 NwaCegarLoop]: Found error trace [2025-04-13 18:21:14,225 INFO L218 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-04-13 18:21:14,225 WARN L466 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable21 [2025-04-13 18:21:14,225 INFO L403 AbstractCegarLoop]: === Iteration 23 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES, ULTIMATE.startErr1INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 2 more)] === [2025-04-13 18:21:14,225 INFO L155 PredicateUnifier]: Initialized classic predicate unifier [2025-04-13 18:21:14,225 INFO L85 PathProgramCache]: Analyzing trace with hash 2027269626, now seen corresponding path program 21 times [2025-04-13 18:21:14,225 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-04-13 18:21:14,225 INFO L324 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2022197279] [2025-04-13 18:21:14,225 INFO L95 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST2 [2025-04-13 18:21:14,225 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-04-13 18:21:14,229 INFO L108 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST2 partitioned 44 statements into 2 equivalence classes. [2025-04-13 18:21:14,233 INFO L111 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST2 issued 1 check-sat command(s) and asserted 43 of 44 statements. [2025-04-13 18:21:14,233 INFO L114 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST2 issued 1 check-sat command(s) [2025-04-13 18:21:14,233 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-04-13 18:21:14,362 INFO L134 CoverageAnalysis]: Checked inductivity of 1 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2025-04-13 18:21:14,362 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-04-13 18:21:14,362 INFO L324 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2022197279] [2025-04-13 18:21:14,363 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [2022197279] provided 1 perfect and 0 imperfect interpolant sequences [2025-04-13 18:21:14,363 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-04-13 18:21:14,363 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [11] imperfect sequences [] total 11 [2025-04-13 18:21:14,363 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1580338484] [2025-04-13 18:21:14,363 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-04-13 18:21:14,363 INFO L562 AbstractCegarLoop]: INTERPOLANT automaton has 12 states [2025-04-13 18:21:14,363 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-04-13 18:21:14,363 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 12 interpolants. [2025-04-13 18:21:14,363 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=26, Invalid=106, Unknown=0, NotChecked=0, Total=132 [2025-04-13 18:21:14,363 INFO L87 Difference]: Start difference. First operand 19785 states and 81436 transitions. Second operand has 12 states, 11 states have (on average 4.0) internal successors, (44), 12 states have internal predecessors, (44), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-04-13 18:21:15,468 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-04-13 18:21:15,468 INFO L93 Difference]: Finished difference Result 35913 states and 152399 transitions. [2025-04-13 18:21:15,468 INFO L140 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 31 states. [2025-04-13 18:21:15,468 INFO L79 Accepts]: Start accepts. Automaton has has 12 states, 11 states have (on average 4.0) internal successors, (44), 12 states have internal predecessors, (44), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 44 [2025-04-13 18:21:15,468 INFO L85 Accepts]: Finished accepts. some prefix is accepted. [2025-04-13 18:21:15,636 INFO L225 Difference]: With dead ends: 35913 [2025-04-13 18:21:15,637 INFO L226 Difference]: Without dead ends: 33575 [2025-04-13 18:21:15,653 INFO L436 NwaCegarLoop]: 0 DeclaredPredicates, 32 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 30 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 235 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=172, Invalid=820, Unknown=0, NotChecked=0, Total=992 [2025-04-13 18:21:15,653 INFO L437 NwaCegarLoop]: 65 mSDtfsCounter, 418 mSDsluCounter, 408 mSDsCounter, 0 mSdLazyCounter, 2014 mSolverCounterSat, 1 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.5s Time, 0 mProtectedPredicate, 0 mProtectedAction, 418 SdHoareTripleChecker+Valid, 473 SdHoareTripleChecker+Invalid, 2015 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 1 IncrementalHoareTripleChecker+Valid, 2014 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.6s IncrementalHoareTripleChecker+Time [2025-04-13 18:21:15,653 INFO L438 NwaCegarLoop]: SdHoareTripleChecker [418 Valid, 473 Invalid, 2015 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [1 Valid, 2014 Invalid, 0 Unknown, 0 Unchecked, 0.6s Time] [2025-04-13 18:21:15,685 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 33575 states. [2025-04-13 18:21:16,289 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 33575 to 19757. [2025-04-13 18:21:16,313 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 19757 states, 19756 states have (on average 4.116369710467706) internal successors, (81323), 19756 states have internal predecessors, (81323), 0 states have call successors, (0), 0 states have 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:21:16,363 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 19757 states to 19757 states and 81323 transitions. [2025-04-13 18:21:16,414 INFO L79 Accepts]: Start accepts. Automaton has 19757 states and 81323 transitions. Word has length 44 [2025-04-13 18:21:16,415 INFO L85 Accepts]: Finished accepts. word is rejected. [2025-04-13 18:21:16,415 INFO L485 AbstractCegarLoop]: Abstraction has 19757 states and 81323 transitions. [2025-04-13 18:21:16,415 INFO L486 AbstractCegarLoop]: INTERPOLANT automaton has has 12 states, 11 states have (on average 4.0) internal successors, (44), 12 states have internal predecessors, (44), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-04-13 18:21:16,415 INFO L278 IsEmpty]: Start isEmpty. Operand 19757 states and 81323 transitions. [2025-04-13 18:21:16,447 INFO L284 IsEmpty]: Finished isEmpty. Found accepting run of length 45 [2025-04-13 18:21:16,447 INFO L210 NwaCegarLoop]: Found error trace [2025-04-13 18:21:16,447 INFO L218 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-04-13 18:21:16,448 WARN L466 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable22 [2025-04-13 18:21:16,448 INFO L403 AbstractCegarLoop]: === Iteration 24 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES, ULTIMATE.startErr1INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 2 more)] === [2025-04-13 18:21:16,448 INFO L155 PredicateUnifier]: Initialized classic predicate unifier [2025-04-13 18:21:16,448 INFO L85 PathProgramCache]: Analyzing trace with hash 1178401086, now seen corresponding path program 22 times [2025-04-13 18:21:16,448 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-04-13 18:21:16,448 INFO L324 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1521986415] [2025-04-13 18:21:16,448 INFO L95 rtionOrderModulation]: Changing assertion order to TERMS_WITH_SMALL_CONSTANTS_FIRST [2025-04-13 18:21:16,448 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-04-13 18:21:16,453 INFO L108 AnnotateAndAsserter]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST partitioned 44 statements into 2 equivalence classes. [2025-04-13 18:21:16,455 INFO L111 AnnotateAndAsserter]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST issued 1 check-sat command(s) and asserted 37 of 44 statements. [2025-04-13 18:21:16,455 INFO L114 AnnotateAndAsserter]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST issued 1 check-sat command(s) [2025-04-13 18:21:16,455 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-04-13 18:21:16,485 INFO L134 CoverageAnalysis]: Checked inductivity of 1 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2025-04-13 18:21:16,486 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-04-13 18:21:16,486 INFO L324 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1521986415] [2025-04-13 18:21:16,486 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1521986415] provided 1 perfect and 0 imperfect interpolant sequences [2025-04-13 18:21:16,486 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-04-13 18:21:16,486 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2025-04-13 18:21:16,486 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1542506104] [2025-04-13 18:21:16,486 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-04-13 18:21:16,486 INFO L562 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2025-04-13 18:21:16,486 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-04-13 18:21:16,486 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2025-04-13 18:21:16,486 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=10, Invalid=20, Unknown=0, NotChecked=0, Total=30 [2025-04-13 18:21:16,487 INFO L87 Difference]: Start difference. First operand 19757 states and 81323 transitions. Second operand has 6 states, 6 states have (on average 7.333333333333333) internal successors, (44), 6 states have internal predecessors, (44), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-04-13 18:21:16,815 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-04-13 18:21:16,815 INFO L93 Difference]: Finished difference Result 33461 states and 140083 transitions. [2025-04-13 18:21:16,815 INFO L140 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2025-04-13 18:21:16,815 INFO L79 Accepts]: Start accepts. Automaton has has 6 states, 6 states have (on average 7.333333333333333) internal successors, (44), 6 states have internal predecessors, (44), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 44 [2025-04-13 18:21:16,815 INFO L85 Accepts]: Finished accepts. some prefix is accepted. [2025-04-13 18:21:16,946 INFO L225 Difference]: With dead ends: 33461 [2025-04-13 18:21:16,946 INFO L226 Difference]: Without dead ends: 27191 [2025-04-13 18:21:16,962 INFO L436 NwaCegarLoop]: 0 DeclaredPredicates, 11 GetRequests, 5 SyntacticMatches, 0 SemanticMatches, 6 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 2 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=19, Invalid=37, Unknown=0, NotChecked=0, Total=56 [2025-04-13 18:21:16,962 INFO L437 NwaCegarLoop]: 36 mSDtfsCounter, 156 mSDsluCounter, 88 mSDsCounter, 0 mSdLazyCounter, 443 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 156 SdHoareTripleChecker+Valid, 124 SdHoareTripleChecker+Invalid, 443 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 443 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.2s IncrementalHoareTripleChecker+Time [2025-04-13 18:21:16,962 INFO L438 NwaCegarLoop]: SdHoareTripleChecker [156 Valid, 124 Invalid, 443 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 443 Invalid, 0 Unknown, 0 Unchecked, 0.2s Time] [2025-04-13 18:21:16,986 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 27191 states. [2025-04-13 18:21:17,449 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 27191 to 23427. [2025-04-13 18:21:17,481 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 23427 states, 23426 states have (on average 4.134081789464697) internal successors, (96845), 23426 states have internal predecessors, (96845), 0 states have call successors, (0), 0 states have 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:21:17,546 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 23427 states to 23427 states and 96845 transitions. [2025-04-13 18:21:17,596 INFO L79 Accepts]: Start accepts. Automaton has 23427 states and 96845 transitions. Word has length 44 [2025-04-13 18:21:17,596 INFO L85 Accepts]: Finished accepts. word is rejected. [2025-04-13 18:21:17,596 INFO L485 AbstractCegarLoop]: Abstraction has 23427 states and 96845 transitions. [2025-04-13 18:21:17,596 INFO L486 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 6 states have (on average 7.333333333333333) internal successors, (44), 6 states have internal predecessors, (44), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-04-13 18:21:17,596 INFO L278 IsEmpty]: Start isEmpty. Operand 23427 states and 96845 transitions. [2025-04-13 18:21:17,636 INFO L284 IsEmpty]: Finished isEmpty. Found accepting run of length 45 [2025-04-13 18:21:17,636 INFO L210 NwaCegarLoop]: Found error trace [2025-04-13 18:21:17,636 INFO L218 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-04-13 18:21:17,637 WARN L466 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable23 [2025-04-13 18:21:17,637 INFO L403 AbstractCegarLoop]: === Iteration 25 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES, ULTIMATE.startErr1INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 2 more)] === [2025-04-13 18:21:17,637 INFO L155 PredicateUnifier]: Initialized classic predicate unifier [2025-04-13 18:21:17,637 INFO L85 PathProgramCache]: Analyzing trace with hash -1249646062, now seen corresponding path program 23 times [2025-04-13 18:21:17,637 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-04-13 18:21:17,637 INFO L324 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1215544183] [2025-04-13 18:21:17,637 INFO L95 rtionOrderModulation]: Changing assertion order to INSIDE_LOOP_FIRST1 [2025-04-13 18:21:17,637 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-04-13 18:21:17,641 INFO L108 AnnotateAndAsserter]: Assert order INSIDE_LOOP_FIRST1 partitioned 44 statements into 2 equivalence classes. [2025-04-13 18:21:17,645 INFO L111 AnnotateAndAsserter]: Assert order INSIDE_LOOP_FIRST1 issued 2 check-sat command(s) and asserted 44 of 44 statements. [2025-04-13 18:21:17,645 INFO L114 AnnotateAndAsserter]: Assert order INSIDE_LOOP_FIRST1 issued 2 check-sat command(s) [2025-04-13 18:21:17,645 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-04-13 18:21:17,867 INFO L134 CoverageAnalysis]: Checked inductivity of 1 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2025-04-13 18:21:17,867 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-04-13 18:21:17,867 INFO L324 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1215544183] [2025-04-13 18:21:17,867 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1215544183] provided 1 perfect and 0 imperfect interpolant sequences [2025-04-13 18:21:17,867 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-04-13 18:21:17,867 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2025-04-13 18:21:17,867 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1528955673] [2025-04-13 18:21:17,867 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-04-13 18:21:17,867 INFO L562 AbstractCegarLoop]: INTERPOLANT automaton has 8 states [2025-04-13 18:21:17,867 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-04-13 18:21:17,868 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2025-04-13 18:21:17,868 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=13, Invalid=43, Unknown=0, NotChecked=0, Total=56 [2025-04-13 18:21:17,868 INFO L87 Difference]: Start difference. First operand 23427 states and 96845 transitions. Second operand has 8 states, 7 states have (on average 6.285714285714286) internal successors, (44), 8 states have internal predecessors, (44), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-04-13 18:21:18,625 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-04-13 18:21:18,625 INFO L93 Difference]: Finished difference Result 37430 states and 154952 transitions. [2025-04-13 18:21:18,625 INFO L140 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 26 states. [2025-04-13 18:21:18,625 INFO L79 Accepts]: Start accepts. Automaton has has 8 states, 7 states have (on average 6.285714285714286) internal successors, (44), 8 states have internal predecessors, (44), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 44 [2025-04-13 18:21:18,626 INFO L85 Accepts]: Finished accepts. some prefix is accepted. [2025-04-13 18:21:18,780 INFO L225 Difference]: With dead ends: 37430 [2025-04-13 18:21:18,780 INFO L226 Difference]: Without dead ends: 32829 [2025-04-13 18:21:18,797 INFO L436 NwaCegarLoop]: 0 DeclaredPredicates, 43 GetRequests, 19 SyntacticMatches, 0 SemanticMatches, 24 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 141 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=138, Invalid=512, Unknown=0, NotChecked=0, Total=650 [2025-04-13 18:21:18,797 INFO L437 NwaCegarLoop]: 36 mSDtfsCounter, 375 mSDsluCounter, 145 mSDsCounter, 0 mSdLazyCounter, 1137 mSolverCounterSat, 1 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.4s Time, 0 mProtectedPredicate, 0 mProtectedAction, 375 SdHoareTripleChecker+Valid, 181 SdHoareTripleChecker+Invalid, 1138 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 1 IncrementalHoareTripleChecker+Valid, 1137 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.4s IncrementalHoareTripleChecker+Time [2025-04-13 18:21:18,798 INFO L438 NwaCegarLoop]: SdHoareTripleChecker [375 Valid, 181 Invalid, 1138 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [1 Valid, 1137 Invalid, 0 Unknown, 0 Unchecked, 0.4s Time] [2025-04-13 18:21:18,827 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 32829 states. [2025-04-13 18:21:19,367 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 32829 to 22807. [2025-04-13 18:21:19,399 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 22807 states, 22806 states have (on average 4.135402964132246) internal successors, (94312), 22806 states have internal predecessors, (94312), 0 states have call successors, (0), 0 states have 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:21:19,486 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 22807 states to 22807 states and 94312 transitions. [2025-04-13 18:21:19,543 INFO L79 Accepts]: Start accepts. Automaton has 22807 states and 94312 transitions. Word has length 44 [2025-04-13 18:21:19,543 INFO L85 Accepts]: Finished accepts. word is rejected. [2025-04-13 18:21:19,543 INFO L485 AbstractCegarLoop]: Abstraction has 22807 states and 94312 transitions. [2025-04-13 18:21:19,543 INFO L486 AbstractCegarLoop]: INTERPOLANT automaton has has 8 states, 7 states have (on average 6.285714285714286) internal successors, (44), 8 states have internal predecessors, (44), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-04-13 18:21:19,543 INFO L278 IsEmpty]: Start isEmpty. Operand 22807 states and 94312 transitions. [2025-04-13 18:21:19,595 INFO L284 IsEmpty]: Finished isEmpty. Found accepting run of length 46 [2025-04-13 18:21:19,595 INFO L210 NwaCegarLoop]: Found error trace [2025-04-13 18:21:19,595 INFO L218 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-04-13 18:21:19,595 WARN L466 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable24 [2025-04-13 18:21:19,595 INFO L403 AbstractCegarLoop]: === Iteration 26 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES, ULTIMATE.startErr1INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 2 more)] === [2025-04-13 18:21:19,596 INFO L155 PredicateUnifier]: Initialized classic predicate unifier [2025-04-13 18:21:19,596 INFO L85 PathProgramCache]: Analyzing trace with hash -222293605, now seen corresponding path program 1 times [2025-04-13 18:21:19,596 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-04-13 18:21:19,596 INFO L324 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1470537085] [2025-04-13 18:21:19,596 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-04-13 18:21:19,596 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-04-13 18:21:19,602 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 45 statements into 1 equivalence classes. [2025-04-13 18:21:19,606 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 45 of 45 statements. [2025-04-13 18:21:19,606 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-04-13 18:21:19,606 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-04-13 18:21:19,903 INFO L134 CoverageAnalysis]: Checked inductivity of 1 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2025-04-13 18:21:19,904 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-04-13 18:21:19,904 INFO L324 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1470537085] [2025-04-13 18:21:19,904 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1470537085] provided 1 perfect and 0 imperfect interpolant sequences [2025-04-13 18:21:19,904 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-04-13 18:21:19,904 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [12] imperfect sequences [] total 12 [2025-04-13 18:21:19,904 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1577659612] [2025-04-13 18:21:19,904 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-04-13 18:21:19,904 INFO L562 AbstractCegarLoop]: INTERPOLANT automaton has 13 states [2025-04-13 18:21:19,904 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-04-13 18:21:19,904 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 13 interpolants. [2025-04-13 18:21:19,904 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=29, Invalid=127, Unknown=0, NotChecked=0, Total=156 [2025-04-13 18:21:19,905 INFO L87 Difference]: Start difference. First operand 22807 states and 94312 transitions. Second operand has 13 states, 12 states have (on average 3.75) internal successors, (45), 13 states have internal predecessors, (45), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-04-13 18:21:23,188 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-04-13 18:21:23,188 INFO L93 Difference]: Finished difference Result 72988 states and 312592 transitions. [2025-04-13 18:21:23,189 INFO L140 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 122 states. [2025-04-13 18:21:23,189 INFO L79 Accepts]: Start accepts. Automaton has has 13 states, 12 states have (on average 3.75) internal successors, (45), 13 states have internal predecessors, (45), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 45 [2025-04-13 18:21:23,189 INFO L85 Accepts]: Finished accepts. some prefix is accepted. [2025-04-13 18:21:23,492 INFO L225 Difference]: With dead ends: 72988 [2025-04-13 18:21:23,492 INFO L226 Difference]: Without dead ends: 63854 [2025-04-13 18:21:23,532 INFO L436 NwaCegarLoop]: 0 DeclaredPredicates, 134 GetRequests, 13 SyntacticMatches, 0 SemanticMatches, 121 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 5808 ImplicationChecksByTransitivity, 1.2s TimeCoverageRelationStatistics Valid=1940, Invalid=13066, Unknown=0, NotChecked=0, Total=15006 [2025-04-13 18:21:23,532 INFO L437 NwaCegarLoop]: 106 mSDtfsCounter, 992 mSDsluCounter, 630 mSDsCounter, 0 mSdLazyCounter, 4156 mSolverCounterSat, 6 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 1.3s Time, 0 mProtectedPredicate, 0 mProtectedAction, 992 SdHoareTripleChecker+Valid, 736 SdHoareTripleChecker+Invalid, 4162 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 6 IncrementalHoareTripleChecker+Valid, 4156 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 1.5s IncrementalHoareTripleChecker+Time [2025-04-13 18:21:23,532 INFO L438 NwaCegarLoop]: SdHoareTripleChecker [992 Valid, 736 Invalid, 4162 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [6 Valid, 4156 Invalid, 0 Unknown, 0 Unchecked, 1.5s Time] [2025-04-13 18:21:23,592 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 63854 states. [2025-04-13 18:21:24,381 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 63854 to 26469. [2025-04-13 18:21:24,420 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 26469 states, 26468 states have (on average 4.156301949523954) internal successors, (110009), 26468 states have internal predecessors, (110009), 0 states have call successors, (0), 0 states have 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:21:24,496 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 26469 states to 26469 states and 110009 transitions. [2025-04-13 18:21:24,585 INFO L79 Accepts]: Start accepts. Automaton has 26469 states and 110009 transitions. Word has length 45 [2025-04-13 18:21:24,585 INFO L85 Accepts]: Finished accepts. word is rejected. [2025-04-13 18:21:24,585 INFO L485 AbstractCegarLoop]: Abstraction has 26469 states and 110009 transitions. [2025-04-13 18:21:24,585 INFO L486 AbstractCegarLoop]: INTERPOLANT automaton has has 13 states, 12 states have (on average 3.75) internal successors, (45), 13 states have internal predecessors, (45), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-04-13 18:21:24,585 INFO L278 IsEmpty]: Start isEmpty. Operand 26469 states and 110009 transitions. [2025-04-13 18:21:24,634 INFO L284 IsEmpty]: Finished isEmpty. Found accepting run of length 46 [2025-04-13 18:21:24,634 INFO L210 NwaCegarLoop]: Found error trace [2025-04-13 18:21:24,634 INFO L218 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-04-13 18:21:24,634 WARN L466 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable25 [2025-04-13 18:21:24,634 INFO L403 AbstractCegarLoop]: === Iteration 27 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES, ULTIMATE.startErr1INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 2 more)] === [2025-04-13 18:21:24,635 INFO L155 PredicateUnifier]: Initialized classic predicate unifier [2025-04-13 18:21:24,635 INFO L85 PathProgramCache]: Analyzing trace with hash 487696455, now seen corresponding path program 2 times [2025-04-13 18:21:24,635 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-04-13 18:21:24,635 INFO L324 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1089856846] [2025-04-13 18:21:24,635 INFO L95 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST1 [2025-04-13 18:21:24,635 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-04-13 18:21:24,639 INFO L108 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 partitioned 45 statements into 2 equivalence classes. [2025-04-13 18:21:24,642 INFO L111 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 issued 1 check-sat command(s) and asserted 44 of 45 statements. [2025-04-13 18:21:24,642 INFO L114 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 issued 1 check-sat command(s) [2025-04-13 18:21:24,642 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-04-13 18:21:24,916 INFO L134 CoverageAnalysis]: Checked inductivity of 1 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2025-04-13 18:21:24,916 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-04-13 18:21:24,916 INFO L324 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1089856846] [2025-04-13 18:21:24,916 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1089856846] provided 1 perfect and 0 imperfect interpolant sequences [2025-04-13 18:21:24,916 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-04-13 18:21:24,916 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [13] imperfect sequences [] total 13 [2025-04-13 18:21:24,916 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [106562246] [2025-04-13 18:21:24,916 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-04-13 18:21:24,916 INFO L562 AbstractCegarLoop]: INTERPOLANT automaton has 14 states [2025-04-13 18:21:24,916 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-04-13 18:21:24,916 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 14 interpolants. [2025-04-13 18:21:24,917 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=31, Invalid=151, Unknown=0, NotChecked=0, Total=182 [2025-04-13 18:21:24,917 INFO L87 Difference]: Start difference. First operand 26469 states and 110009 transitions. Second operand has 14 states, 13 states have (on average 3.4615384615384617) internal successors, (45), 14 states have internal predecessors, (45), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-04-13 18:21:29,804 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-04-13 18:21:29,805 INFO L93 Difference]: Finished difference Result 76019 states and 325533 transitions. [2025-04-13 18:21:29,805 INFO L140 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 180 states. [2025-04-13 18:21:29,805 INFO L79 Accepts]: Start accepts. Automaton has has 14 states, 13 states have (on average 3.4615384615384617) internal successors, (45), 14 states have internal predecessors, (45), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 45 [2025-04-13 18:21:29,805 INFO L85 Accepts]: Finished accepts. some prefix is accepted. [2025-04-13 18:21:30,095 INFO L225 Difference]: With dead ends: 76019 [2025-04-13 18:21:30,095 INFO L226 Difference]: Without dead ends: 63117 [2025-04-13 18:21:30,139 INFO L436 NwaCegarLoop]: 0 DeclaredPredicates, 192 GetRequests, 12 SyntacticMatches, 0 SemanticMatches, 180 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 13909 ImplicationChecksByTransitivity, 2.5s TimeCoverageRelationStatistics Valid=4574, Invalid=28368, Unknown=0, NotChecked=0, Total=32942 [2025-04-13 18:21:30,140 INFO L437 NwaCegarLoop]: 112 mSDtfsCounter, 1362 mSDsluCounter, 806 mSDsCounter, 0 mSdLazyCounter, 4840 mSolverCounterSat, 18 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 1.6s Time, 0 mProtectedPredicate, 0 mProtectedAction, 1362 SdHoareTripleChecker+Valid, 918 SdHoareTripleChecker+Invalid, 4858 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 18 IncrementalHoareTripleChecker+Valid, 4840 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 1.8s IncrementalHoareTripleChecker+Time [2025-04-13 18:21:30,140 INFO L438 NwaCegarLoop]: SdHoareTripleChecker [1362 Valid, 918 Invalid, 4858 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [18 Valid, 4840 Invalid, 0 Unknown, 0 Unchecked, 1.8s Time] [2025-04-13 18:21:30,200 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 63117 states. [2025-04-13 18:21:30,985 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 63117 to 26651. [2025-04-13 18:21:31,023 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 26651 states, 26650 states have (on average 4.152570356472795) internal successors, (110666), 26650 states have internal predecessors, (110666), 0 states have call successors, (0), 0 states have 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:21:31,101 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 26651 states to 26651 states and 110666 transitions. [2025-04-13 18:21:31,211 INFO L79 Accepts]: Start accepts. Automaton has 26651 states and 110666 transitions. Word has length 45 [2025-04-13 18:21:31,212 INFO L85 Accepts]: Finished accepts. word is rejected. [2025-04-13 18:21:31,212 INFO L485 AbstractCegarLoop]: Abstraction has 26651 states and 110666 transitions. [2025-04-13 18:21:31,212 INFO L486 AbstractCegarLoop]: INTERPOLANT automaton has has 14 states, 13 states have (on average 3.4615384615384617) internal successors, (45), 14 states have internal predecessors, (45), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-04-13 18:21:31,212 INFO L278 IsEmpty]: Start isEmpty. Operand 26651 states and 110666 transitions. [2025-04-13 18:21:31,270 INFO L284 IsEmpty]: Finished isEmpty. Found accepting run of length 46 [2025-04-13 18:21:31,270 INFO L210 NwaCegarLoop]: Found error trace [2025-04-13 18:21:31,270 INFO L218 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-04-13 18:21:31,270 WARN L466 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable26 [2025-04-13 18:21:31,270 INFO L403 AbstractCegarLoop]: === Iteration 28 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES, ULTIMATE.startErr1INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 2 more)] === [2025-04-13 18:21:31,270 INFO L155 PredicateUnifier]: Initialized classic predicate unifier [2025-04-13 18:21:31,270 INFO L85 PathProgramCache]: Analyzing trace with hash 972048385, now seen corresponding path program 3 times [2025-04-13 18:21:31,270 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-04-13 18:21:31,270 INFO L324 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [244006652] [2025-04-13 18:21:31,271 INFO L95 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST2 [2025-04-13 18:21:31,271 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-04-13 18:21:31,275 INFO L108 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST2 partitioned 45 statements into 2 equivalence classes. [2025-04-13 18:21:31,278 INFO L111 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST2 issued 1 check-sat command(s) and asserted 44 of 45 statements. [2025-04-13 18:21:31,278 INFO L114 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST2 issued 1 check-sat command(s) [2025-04-13 18:21:31,278 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-04-13 18:21:31,566 INFO L134 CoverageAnalysis]: Checked inductivity of 1 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2025-04-13 18:21:31,566 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-04-13 18:21:31,566 INFO L324 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [244006652] [2025-04-13 18:21:31,566 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [244006652] provided 1 perfect and 0 imperfect interpolant sequences [2025-04-13 18:21:31,566 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-04-13 18:21:31,566 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [12] imperfect sequences [] total 12 [2025-04-13 18:21:31,566 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [88653011] [2025-04-13 18:21:31,566 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-04-13 18:21:31,567 INFO L562 AbstractCegarLoop]: INTERPOLANT automaton has 13 states [2025-04-13 18:21:31,567 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-04-13 18:21:31,567 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 13 interpolants. [2025-04-13 18:21:31,567 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=29, Invalid=127, Unknown=0, NotChecked=0, Total=156 [2025-04-13 18:21:31,567 INFO L87 Difference]: Start difference. First operand 26651 states and 110666 transitions. Second operand has 13 states, 12 states have (on average 3.75) internal successors, (45), 13 states have internal predecessors, (45), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-04-13 18:21:34,459 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-04-13 18:21:34,459 INFO L93 Difference]: Finished difference Result 61294 states and 260289 transitions. [2025-04-13 18:21:34,460 INFO L140 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 133 states. [2025-04-13 18:21:34,460 INFO L79 Accepts]: Start accepts. Automaton has has 13 states, 12 states have (on average 3.75) internal successors, (45), 13 states have internal predecessors, (45), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 45 [2025-04-13 18:21:34,460 INFO L85 Accepts]: Finished accepts. some prefix is accepted. [2025-04-13 18:21:34,708 INFO L225 Difference]: With dead ends: 61294 [2025-04-13 18:21:34,708 INFO L226 Difference]: Without dead ends: 50765 [2025-04-13 18:21:34,743 INFO L436 NwaCegarLoop]: 0 DeclaredPredicates, 144 GetRequests, 11 SyntacticMatches, 0 SemanticMatches, 133 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 7433 ImplicationChecksByTransitivity, 1.1s TimeCoverageRelationStatistics Valid=2337, Invalid=15753, Unknown=0, NotChecked=0, Total=18090 [2025-04-13 18:21:34,743 INFO L437 NwaCegarLoop]: 109 mSDtfsCounter, 1038 mSDsluCounter, 684 mSDsCounter, 0 mSdLazyCounter, 3892 mSolverCounterSat, 6 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 1.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 1038 SdHoareTripleChecker+Valid, 793 SdHoareTripleChecker+Invalid, 3898 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 6 IncrementalHoareTripleChecker+Valid, 3892 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 1.4s IncrementalHoareTripleChecker+Time [2025-04-13 18:21:34,743 INFO L438 NwaCegarLoop]: SdHoareTripleChecker [1038 Valid, 793 Invalid, 3898 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [6 Valid, 3892 Invalid, 0 Unknown, 0 Unchecked, 1.4s Time] [2025-04-13 18:21:34,799 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 50765 states. [2025-04-13 18:21:35,310 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 50765 to 27431. [2025-04-13 18:21:35,347 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 27431 states, 27430 states have (on average 4.138789646372585) internal successors, (113527), 27430 states have internal predecessors, (113527), 0 states have call successors, (0), 0 states have 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:21:35,422 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 27431 states to 27431 states and 113527 transitions. [2025-04-13 18:21:35,540 INFO L79 Accepts]: Start accepts. Automaton has 27431 states and 113527 transitions. Word has length 45 [2025-04-13 18:21:35,540 INFO L85 Accepts]: Finished accepts. word is rejected. [2025-04-13 18:21:35,540 INFO L485 AbstractCegarLoop]: Abstraction has 27431 states and 113527 transitions. [2025-04-13 18:21:35,540 INFO L486 AbstractCegarLoop]: INTERPOLANT automaton has has 13 states, 12 states have (on average 3.75) internal successors, (45), 13 states have internal predecessors, (45), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-04-13 18:21:35,540 INFO L278 IsEmpty]: Start isEmpty. Operand 27431 states and 113527 transitions. [2025-04-13 18:21:35,720 INFO L284 IsEmpty]: Finished isEmpty. Found accepting run of length 46 [2025-04-13 18:21:35,720 INFO L210 NwaCegarLoop]: Found error trace [2025-04-13 18:21:35,720 INFO L218 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-04-13 18:21:35,720 WARN L466 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable27 [2025-04-13 18:21:35,721 INFO L403 AbstractCegarLoop]: === Iteration 29 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES, ULTIMATE.startErr1INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 2 more)] === [2025-04-13 18:21:35,721 INFO L155 PredicateUnifier]: Initialized classic predicate unifier [2025-04-13 18:21:35,721 INFO L85 PathProgramCache]: Analyzing trace with hash 893391345, now seen corresponding path program 4 times [2025-04-13 18:21:35,721 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-04-13 18:21:35,721 INFO L324 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [447113177] [2025-04-13 18:21:35,721 INFO L95 rtionOrderModulation]: Changing assertion order to TERMS_WITH_SMALL_CONSTANTS_FIRST [2025-04-13 18:21:35,721 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-04-13 18:21:35,725 INFO L108 AnnotateAndAsserter]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST partitioned 45 statements into 2 equivalence classes. [2025-04-13 18:21:35,727 INFO L111 AnnotateAndAsserter]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST issued 1 check-sat command(s) and asserted 38 of 45 statements. [2025-04-13 18:21:35,727 INFO L114 AnnotateAndAsserter]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST issued 1 check-sat command(s) [2025-04-13 18:21:35,727 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-04-13 18:21:35,790 INFO L134 CoverageAnalysis]: Checked inductivity of 1 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2025-04-13 18:21:35,790 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-04-13 18:21:35,790 INFO L324 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [447113177] [2025-04-13 18:21:35,790 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [447113177] provided 1 perfect and 0 imperfect interpolant sequences [2025-04-13 18:21:35,790 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-04-13 18:21:35,791 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [9] imperfect sequences [] total 9 [2025-04-13 18:21:35,791 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [358562597] [2025-04-13 18:21:35,791 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-04-13 18:21:35,791 INFO L562 AbstractCegarLoop]: INTERPOLANT automaton has 9 states [2025-04-13 18:21:35,791 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-04-13 18:21:35,791 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2025-04-13 18:21:35,791 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=19, Invalid=53, Unknown=0, NotChecked=0, Total=72 [2025-04-13 18:21:35,791 INFO L87 Difference]: Start difference. First operand 27431 states and 113527 transitions. Second operand has 9 states, 9 states have (on average 5.0) internal successors, (45), 9 states have internal predecessors, (45), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-04-13 18:21:36,608 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-04-13 18:21:36,609 INFO L93 Difference]: Finished difference Result 54158 states and 229948 transitions. [2025-04-13 18:21:36,613 INFO L140 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 14 states. [2025-04-13 18:21:36,613 INFO L79 Accepts]: Start accepts. Automaton has has 9 states, 9 states have (on average 5.0) internal successors, (45), 9 states have internal predecessors, (45), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 45 [2025-04-13 18:21:36,613 INFO L85 Accepts]: Finished accepts. some prefix is accepted. [2025-04-13 18:21:36,858 INFO L225 Difference]: With dead ends: 54158 [2025-04-13 18:21:36,858 INFO L226 Difference]: Without dead ends: 47772 [2025-04-13 18:21:36,879 INFO L436 NwaCegarLoop]: 0 DeclaredPredicates, 15 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 13 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 28 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=55, Invalid=155, Unknown=0, NotChecked=0, Total=210 [2025-04-13 18:21:36,879 INFO L437 NwaCegarLoop]: 56 mSDtfsCounter, 274 mSDsluCounter, 306 mSDsCounter, 0 mSdLazyCounter, 1090 mSolverCounterSat, 4 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.3s Time, 0 mProtectedPredicate, 0 mProtectedAction, 274 SdHoareTripleChecker+Valid, 362 SdHoareTripleChecker+Invalid, 1094 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 4 IncrementalHoareTripleChecker+Valid, 1090 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.3s IncrementalHoareTripleChecker+Time [2025-04-13 18:21:36,879 INFO L438 NwaCegarLoop]: SdHoareTripleChecker [274 Valid, 362 Invalid, 1094 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [4 Valid, 1090 Invalid, 0 Unknown, 0 Unchecked, 0.3s Time] [2025-04-13 18:21:36,922 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 47772 states. [2025-04-13 18:21:37,371 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 47772 to 25942. [2025-04-13 18:21:37,407 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 25942 states, 25941 states have (on average 4.1482980609845415) internal successors, (107611), 25941 states have internal predecessors, (107611), 0 states have call successors, (0), 0 states have 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:21:37,688 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 25942 states to 25942 states and 107611 transitions. [2025-04-13 18:21:37,790 INFO L79 Accepts]: Start accepts. Automaton has 25942 states and 107611 transitions. Word has length 45 [2025-04-13 18:21:37,790 INFO L85 Accepts]: Finished accepts. word is rejected. [2025-04-13 18:21:37,790 INFO L485 AbstractCegarLoop]: Abstraction has 25942 states and 107611 transitions. [2025-04-13 18:21:37,791 INFO L486 AbstractCegarLoop]: INTERPOLANT automaton has has 9 states, 9 states have (on average 5.0) internal successors, (45), 9 states have internal predecessors, (45), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-04-13 18:21:37,791 INFO L278 IsEmpty]: Start isEmpty. Operand 25942 states and 107611 transitions. [2025-04-13 18:21:37,841 INFO L284 IsEmpty]: Finished isEmpty. Found accepting run of length 46 [2025-04-13 18:21:37,842 INFO L210 NwaCegarLoop]: Found error trace [2025-04-13 18:21:37,842 INFO L218 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-04-13 18:21:37,842 WARN L466 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable28 [2025-04-13 18:21:37,842 INFO L403 AbstractCegarLoop]: === Iteration 30 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES, ULTIMATE.startErr1INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 2 more)] === [2025-04-13 18:21:37,843 INFO L155 PredicateUnifier]: Initialized classic predicate unifier [2025-04-13 18:21:37,843 INFO L85 PathProgramCache]: Analyzing trace with hash -1813792873, now seen corresponding path program 5 times [2025-04-13 18:21:37,843 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-04-13 18:21:37,843 INFO L324 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2057634273] [2025-04-13 18:21:37,843 INFO L95 rtionOrderModulation]: Changing assertion order to INSIDE_LOOP_FIRST1 [2025-04-13 18:21:37,843 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-04-13 18:21:37,848 INFO L108 AnnotateAndAsserter]: Assert order INSIDE_LOOP_FIRST1 partitioned 45 statements into 2 equivalence classes. [2025-04-13 18:21:37,853 INFO L111 AnnotateAndAsserter]: Assert order INSIDE_LOOP_FIRST1 issued 2 check-sat command(s) and asserted 45 of 45 statements. [2025-04-13 18:21:37,853 INFO L114 AnnotateAndAsserter]: Assert order INSIDE_LOOP_FIRST1 issued 2 check-sat command(s) [2025-04-13 18:21:37,853 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-04-13 18:21:38,055 INFO L134 CoverageAnalysis]: Checked inductivity of 1 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2025-04-13 18:21:38,055 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-04-13 18:21:38,055 INFO L324 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2057634273] [2025-04-13 18:21:38,055 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [2057634273] provided 1 perfect and 0 imperfect interpolant sequences [2025-04-13 18:21:38,055 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-04-13 18:21:38,055 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [12] imperfect sequences [] total 12 [2025-04-13 18:21:38,055 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1861738316] [2025-04-13 18:21:38,055 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-04-13 18:21:38,055 INFO L562 AbstractCegarLoop]: INTERPOLANT automaton has 13 states [2025-04-13 18:21:38,055 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-04-13 18:21:38,056 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 13 interpolants. [2025-04-13 18:21:38,056 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=30, Invalid=126, Unknown=0, NotChecked=0, Total=156 [2025-04-13 18:21:38,056 INFO L87 Difference]: Start difference. First operand 25942 states and 107611 transitions. Second operand has 13 states, 12 states have (on average 3.75) internal successors, (45), 13 states have internal predecessors, (45), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-04-13 18:21:40,548 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-04-13 18:21:40,548 INFO L93 Difference]: Finished difference Result 73619 states and 313952 transitions. [2025-04-13 18:21:40,549 INFO L140 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 77 states. [2025-04-13 18:21:40,550 INFO L79 Accepts]: Start accepts. Automaton has has 13 states, 12 states have (on average 3.75) internal successors, (45), 13 states have internal predecessors, (45), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 45 [2025-04-13 18:21:40,550 INFO L85 Accepts]: Finished accepts. some prefix is accepted. [2025-04-13 18:21:40,934 INFO L225 Difference]: With dead ends: 73619 [2025-04-13 18:21:40,934 INFO L226 Difference]: Without dead ends: 67075 [2025-04-13 18:21:40,964 INFO L436 NwaCegarLoop]: 0 DeclaredPredicates, 79 GetRequests, 3 SyntacticMatches, 0 SemanticMatches, 76 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 2102 ImplicationChecksByTransitivity, 0.7s TimeCoverageRelationStatistics Valid=951, Invalid=5055, Unknown=0, NotChecked=0, Total=6006 [2025-04-13 18:21:40,965 INFO L437 NwaCegarLoop]: 81 mSDtfsCounter, 933 mSDsluCounter, 531 mSDsCounter, 0 mSdLazyCounter, 3215 mSolverCounterSat, 1 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 1.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 933 SdHoareTripleChecker+Valid, 612 SdHoareTripleChecker+Invalid, 3216 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 1 IncrementalHoareTripleChecker+Valid, 3215 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 1.3s IncrementalHoareTripleChecker+Time [2025-04-13 18:21:40,965 INFO L438 NwaCegarLoop]: SdHoareTripleChecker [933 Valid, 612 Invalid, 3216 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [1 Valid, 3215 Invalid, 0 Unknown, 0 Unchecked, 1.3s Time] [2025-04-13 18:21:41,032 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 67075 states. [2025-04-13 18:21:41,916 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 67075 to 28966. [2025-04-13 18:21:41,956 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 28966 states, 28965 states have (on average 4.154358708786466) internal successors, (120331), 28965 states have internal predecessors, (120331), 0 states have call successors, (0), 0 states have 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:21:42,196 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 28966 states to 28966 states and 120331 transitions. [2025-04-13 18:21:42,311 INFO L79 Accepts]: Start accepts. Automaton has 28966 states and 120331 transitions. Word has length 45 [2025-04-13 18:21:42,312 INFO L85 Accepts]: Finished accepts. word is rejected. [2025-04-13 18:21:42,312 INFO L485 AbstractCegarLoop]: Abstraction has 28966 states and 120331 transitions. [2025-04-13 18:21:42,312 INFO L486 AbstractCegarLoop]: INTERPOLANT automaton has has 13 states, 12 states have (on average 3.75) internal successors, (45), 13 states have internal predecessors, (45), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-04-13 18:21:42,312 INFO L278 IsEmpty]: Start isEmpty. Operand 28966 states and 120331 transitions. [2025-04-13 18:21:42,369 INFO L284 IsEmpty]: Finished isEmpty. Found accepting run of length 46 [2025-04-13 18:21:42,369 INFO L210 NwaCegarLoop]: Found error trace [2025-04-13 18:21:42,369 INFO L218 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-04-13 18:21:42,369 WARN L466 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable29 [2025-04-13 18:21:42,369 INFO L403 AbstractCegarLoop]: === Iteration 31 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES, ULTIMATE.startErr1INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 2 more)] === [2025-04-13 18:21:42,369 INFO L155 PredicateUnifier]: Initialized classic predicate unifier [2025-04-13 18:21:42,369 INFO L85 PathProgramCache]: Analyzing trace with hash 655734757, now seen corresponding path program 6 times [2025-04-13 18:21:42,369 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-04-13 18:21:42,370 INFO L324 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [237210733] [2025-04-13 18:21:42,370 INFO L95 rtionOrderModulation]: Changing assertion order to MIX_INSIDE_OUTSIDE [2025-04-13 18:21:42,370 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-04-13 18:21:42,374 INFO L108 AnnotateAndAsserter]: Assert order MIX_INSIDE_OUTSIDE partitioned 45 statements into 2 equivalence classes. [2025-04-13 18:21:42,376 INFO L111 AnnotateAndAsserter]: Assert order MIX_INSIDE_OUTSIDE issued 1 check-sat command(s) and asserted 44 of 45 statements. [2025-04-13 18:21:42,376 INFO L114 AnnotateAndAsserter]: Assert order MIX_INSIDE_OUTSIDE issued 1 check-sat command(s) [2025-04-13 18:21:42,377 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-04-13 18:21:42,523 INFO L134 CoverageAnalysis]: Checked inductivity of 1 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2025-04-13 18:21:42,523 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-04-13 18:21:42,523 INFO L324 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [237210733] [2025-04-13 18:21:42,523 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [237210733] provided 1 perfect and 0 imperfect interpolant sequences [2025-04-13 18:21:42,523 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-04-13 18:21:42,523 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [13] imperfect sequences [] total 13 [2025-04-13 18:21:42,523 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2075936347] [2025-04-13 18:21:42,523 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-04-13 18:21:42,523 INFO L562 AbstractCegarLoop]: INTERPOLANT automaton has 14 states [2025-04-13 18:21:42,523 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-04-13 18:21:42,524 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 14 interpolants. [2025-04-13 18:21:42,524 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=32, Invalid=150, Unknown=0, NotChecked=0, Total=182 [2025-04-13 18:21:42,524 INFO L87 Difference]: Start difference. First operand 28966 states and 120331 transitions. Second operand has 14 states, 13 states have (on average 3.4615384615384617) internal successors, (45), 14 states have internal predecessors, (45), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-04-13 18:21:45,351 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-04-13 18:21:45,351 INFO L93 Difference]: Finished difference Result 72037 states and 308158 transitions. [2025-04-13 18:21:45,351 INFO L140 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 92 states. [2025-04-13 18:21:45,352 INFO L79 Accepts]: Start accepts. Automaton has has 14 states, 13 states have (on average 3.4615384615384617) internal successors, (45), 14 states have internal predecessors, (45), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 45 [2025-04-13 18:21:45,352 INFO L85 Accepts]: Finished accepts. some prefix is accepted. [2025-04-13 18:21:45,693 INFO L225 Difference]: With dead ends: 72037 [2025-04-13 18:21:45,693 INFO L226 Difference]: Without dead ends: 65455 [2025-04-13 18:21:45,717 INFO L436 NwaCegarLoop]: 0 DeclaredPredicates, 94 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 92 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 3180 ImplicationChecksByTransitivity, 0.9s TimeCoverageRelationStatistics Valid=1312, Invalid=7430, Unknown=0, NotChecked=0, Total=8742 [2025-04-13 18:21:45,718 INFO L437 NwaCegarLoop]: 82 mSDtfsCounter, 1118 mSDsluCounter, 625 mSDsCounter, 0 mSdLazyCounter, 3390 mSolverCounterSat, 9 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 1.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 1118 SdHoareTripleChecker+Valid, 707 SdHoareTripleChecker+Invalid, 3399 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 9 IncrementalHoareTripleChecker+Valid, 3390 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 1.3s IncrementalHoareTripleChecker+Time [2025-04-13 18:21:45,718 INFO L438 NwaCegarLoop]: SdHoareTripleChecker [1118 Valid, 707 Invalid, 3399 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [9 Valid, 3390 Invalid, 0 Unknown, 0 Unchecked, 1.3s Time] [2025-04-13 18:21:45,778 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 65455 states. [2025-04-13 18:21:46,502 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 65455 to 28246. [2025-04-13 18:21:46,542 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 28246 states, 28245 states have (on average 4.137050805452293) internal successors, (116851), 28245 states have internal predecessors, (116851), 0 states have call successors, (0), 0 states have 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:21:46,623 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 28246 states to 28246 states and 116851 transitions. [2025-04-13 18:21:46,746 INFO L79 Accepts]: Start accepts. Automaton has 28246 states and 116851 transitions. Word has length 45 [2025-04-13 18:21:46,746 INFO L85 Accepts]: Finished accepts. word is rejected. [2025-04-13 18:21:46,746 INFO L485 AbstractCegarLoop]: Abstraction has 28246 states and 116851 transitions. [2025-04-13 18:21:46,746 INFO L486 AbstractCegarLoop]: INTERPOLANT automaton has has 14 states, 13 states have (on average 3.4615384615384617) internal successors, (45), 14 states have internal predecessors, (45), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-04-13 18:21:46,746 INFO L278 IsEmpty]: Start isEmpty. Operand 28246 states and 116851 transitions. [2025-04-13 18:21:46,800 INFO L284 IsEmpty]: Finished isEmpty. Found accepting run of length 46 [2025-04-13 18:21:46,800 INFO L210 NwaCegarLoop]: Found error trace [2025-04-13 18:21:46,800 INFO L218 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-04-13 18:21:46,801 WARN L466 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable30 [2025-04-13 18:21:46,801 INFO L403 AbstractCegarLoop]: === Iteration 32 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES, ULTIMATE.startErr1INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 2 more)] === [2025-04-13 18:21:46,801 INFO L155 PredicateUnifier]: Initialized classic predicate unifier [2025-04-13 18:21:46,801 INFO L85 PathProgramCache]: Analyzing trace with hash -619450883, now seen corresponding path program 7 times [2025-04-13 18:21:46,801 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-04-13 18:21:46,801 INFO L324 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [708310960] [2025-04-13 18:21:46,801 INFO L95 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2025-04-13 18:21:46,801 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-04-13 18:21:46,805 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 45 statements into 1 equivalence classes. [2025-04-13 18:21:46,808 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 45 of 45 statements. [2025-04-13 18:21:46,808 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-04-13 18:21:46,808 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-04-13 18:21:47,149 INFO L134 CoverageAnalysis]: Checked inductivity of 1 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2025-04-13 18:21:47,149 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-04-13 18:21:47,149 INFO L324 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [708310960] [2025-04-13 18:21:47,149 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [708310960] provided 1 perfect and 0 imperfect interpolant sequences [2025-04-13 18:21:47,149 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-04-13 18:21:47,149 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [12] imperfect sequences [] total 12 [2025-04-13 18:21:47,149 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [371200247] [2025-04-13 18:21:47,149 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-04-13 18:21:47,149 INFO L562 AbstractCegarLoop]: INTERPOLANT automaton has 13 states [2025-04-13 18:21:47,149 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-04-13 18:21:47,150 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 13 interpolants. [2025-04-13 18:21:47,150 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=30, Invalid=126, Unknown=0, NotChecked=0, Total=156 [2025-04-13 18:21:47,150 INFO L87 Difference]: Start difference. First operand 28246 states and 116851 transitions. Second operand has 13 states, 12 states have (on average 3.75) internal successors, (45), 13 states have internal predecessors, (45), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-04-13 18:21:49,068 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-04-13 18:21:49,068 INFO L93 Difference]: Finished difference Result 59642 states and 252331 transitions. [2025-04-13 18:21:49,069 INFO L140 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 64 states. [2025-04-13 18:21:49,069 INFO L79 Accepts]: Start accepts. Automaton has has 13 states, 12 states have (on average 3.75) internal successors, (45), 13 states have internal predecessors, (45), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 45 [2025-04-13 18:21:49,069 INFO L85 Accepts]: Finished accepts. some prefix is accepted. [2025-04-13 18:21:49,379 INFO L225 Difference]: With dead ends: 59642 [2025-04-13 18:21:49,379 INFO L226 Difference]: Without dead ends: 54575 [2025-04-13 18:21:49,407 INFO L436 NwaCegarLoop]: 0 DeclaredPredicates, 67 GetRequests, 3 SyntacticMatches, 0 SemanticMatches, 64 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1432 ImplicationChecksByTransitivity, 0.4s TimeCoverageRelationStatistics Valid=654, Invalid=3636, Unknown=0, NotChecked=0, Total=4290 [2025-04-13 18:21:49,407 INFO L437 NwaCegarLoop]: 83 mSDtfsCounter, 808 mSDsluCounter, 533 mSDsCounter, 0 mSdLazyCounter, 2722 mSolverCounterSat, 1 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.8s Time, 0 mProtectedPredicate, 0 mProtectedAction, 808 SdHoareTripleChecker+Valid, 616 SdHoareTripleChecker+Invalid, 2723 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 1 IncrementalHoareTripleChecker+Valid, 2722 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.9s IncrementalHoareTripleChecker+Time [2025-04-13 18:21:49,408 INFO L438 NwaCegarLoop]: SdHoareTripleChecker [808 Valid, 616 Invalid, 2723 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [1 Valid, 2722 Invalid, 0 Unknown, 0 Unchecked, 0.9s Time] [2025-04-13 18:21:49,456 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 54575 states. [2025-04-13 18:21:50,067 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 54575 to 27066. [2025-04-13 18:21:50,104 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 27066 states, 27065 states have (on average 4.136929613892481) internal successors, (111966), 27065 states have internal predecessors, (111966), 0 states have call successors, (0), 0 states have 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:21:50,184 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 27066 states to 27066 states and 111966 transitions. [2025-04-13 18:21:50,305 INFO L79 Accepts]: Start accepts. Automaton has 27066 states and 111966 transitions. Word has length 45 [2025-04-13 18:21:50,305 INFO L85 Accepts]: Finished accepts. word is rejected. [2025-04-13 18:21:50,305 INFO L485 AbstractCegarLoop]: Abstraction has 27066 states and 111966 transitions. [2025-04-13 18:21:50,305 INFO L486 AbstractCegarLoop]: INTERPOLANT automaton has has 13 states, 12 states have (on average 3.75) internal successors, (45), 13 states have internal predecessors, (45), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-04-13 18:21:50,305 INFO L278 IsEmpty]: Start isEmpty. Operand 27066 states and 111966 transitions. [2025-04-13 18:21:50,356 INFO L284 IsEmpty]: Finished isEmpty. Found accepting run of length 46 [2025-04-13 18:21:50,356 INFO L210 NwaCegarLoop]: Found error trace [2025-04-13 18:21:50,356 INFO L218 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-04-13 18:21:50,356 WARN L466 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable31 [2025-04-13 18:21:50,356 INFO L403 AbstractCegarLoop]: === Iteration 33 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES, ULTIMATE.startErr1INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 2 more)] === [2025-04-13 18:21:50,357 INFO L155 PredicateUnifier]: Initialized classic predicate unifier [2025-04-13 18:21:50,357 INFO L85 PathProgramCache]: Analyzing trace with hash -1148680540, now seen corresponding path program 1 times [2025-04-13 18:21:50,357 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-04-13 18:21:50,357 INFO L324 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [488429003] [2025-04-13 18:21:50,357 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-04-13 18:21:50,357 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-04-13 18:21:50,361 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 45 statements into 1 equivalence classes. [2025-04-13 18:21:50,364 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 45 of 45 statements. [2025-04-13 18:21:50,364 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-04-13 18:21:50,364 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-04-13 18:21:50,465 INFO L134 CoverageAnalysis]: Checked inductivity of 1 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2025-04-13 18:21:50,465 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-04-13 18:21:50,465 INFO L324 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [488429003] [2025-04-13 18:21:50,465 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [488429003] provided 1 perfect and 0 imperfect interpolant sequences [2025-04-13 18:21:50,465 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-04-13 18:21:50,465 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [9] imperfect sequences [] total 9 [2025-04-13 18:21:50,465 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [366462465] [2025-04-13 18:21:50,466 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-04-13 18:21:50,466 INFO L562 AbstractCegarLoop]: INTERPOLANT automaton has 10 states [2025-04-13 18:21:50,466 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-04-13 18:21:50,466 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 10 interpolants. [2025-04-13 18:21:50,466 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=18, Invalid=72, Unknown=0, NotChecked=0, Total=90 [2025-04-13 18:21:50,466 INFO L87 Difference]: Start difference. First operand 27066 states and 111966 transitions. Second operand has 10 states, 9 states have (on average 5.0) internal successors, (45), 10 states have internal predecessors, (45), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-04-13 18:21:51,520 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-04-13 18:21:51,520 INFO L93 Difference]: Finished difference Result 38158 states and 157694 transitions. [2025-04-13 18:21:51,520 INFO L140 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 30 states. [2025-04-13 18:21:51,520 INFO L79 Accepts]: Start accepts. Automaton has has 10 states, 9 states have (on average 5.0) internal successors, (45), 10 states have internal predecessors, (45), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 45 [2025-04-13 18:21:51,520 INFO L85 Accepts]: Finished accepts. some prefix is accepted. [2025-04-13 18:21:51,714 INFO L225 Difference]: With dead ends: 38158 [2025-04-13 18:21:51,714 INFO L226 Difference]: Without dead ends: 35203 [2025-04-13 18:21:51,732 INFO L436 NwaCegarLoop]: 0 DeclaredPredicates, 51 GetRequests, 22 SyntacticMatches, 0 SemanticMatches, 29 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 194 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=175, Invalid=755, Unknown=0, NotChecked=0, Total=930 [2025-04-13 18:21:51,732 INFO L437 NwaCegarLoop]: 33 mSDtfsCounter, 394 mSDsluCounter, 181 mSDsCounter, 0 mSdLazyCounter, 1658 mSolverCounterSat, 4 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.5s Time, 0 mProtectedPredicate, 0 mProtectedAction, 394 SdHoareTripleChecker+Valid, 214 SdHoareTripleChecker+Invalid, 1662 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 4 IncrementalHoareTripleChecker+Valid, 1658 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.6s IncrementalHoareTripleChecker+Time [2025-04-13 18:21:51,733 INFO L438 NwaCegarLoop]: SdHoareTripleChecker [394 Valid, 214 Invalid, 1662 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [4 Valid, 1658 Invalid, 0 Unknown, 0 Unchecked, 0.6s Time] [2025-04-13 18:21:51,763 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 35203 states. [2025-04-13 18:21:52,348 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 35203 to 28256. [2025-04-13 18:21:52,390 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 28256 states, 28255 states have (on average 4.129959299239073) internal successors, (116692), 28255 states have internal predecessors, (116692), 0 states have call successors, (0), 0 states have 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:21:52,503 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 28256 states to 28256 states and 116692 transitions. [2025-04-13 18:21:52,596 INFO L79 Accepts]: Start accepts. Automaton has 28256 states and 116692 transitions. Word has length 45 [2025-04-13 18:21:52,596 INFO L85 Accepts]: Finished accepts. word is rejected. [2025-04-13 18:21:52,596 INFO L485 AbstractCegarLoop]: Abstraction has 28256 states and 116692 transitions. [2025-04-13 18:21:52,596 INFO L486 AbstractCegarLoop]: INTERPOLANT automaton has has 10 states, 9 states have (on average 5.0) internal successors, (45), 10 states have internal predecessors, (45), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-04-13 18:21:52,596 INFO L278 IsEmpty]: Start isEmpty. Operand 28256 states and 116692 transitions. [2025-04-13 18:21:52,650 INFO L284 IsEmpty]: Finished isEmpty. Found accepting run of length 46 [2025-04-13 18:21:52,650 INFO L210 NwaCegarLoop]: Found error trace [2025-04-13 18:21:52,650 INFO L218 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-04-13 18:21:52,650 WARN L466 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable32 [2025-04-13 18:21:52,650 INFO L403 AbstractCegarLoop]: === Iteration 34 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES, ULTIMATE.startErr1INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 2 more)] === [2025-04-13 18:21:52,651 INFO L155 PredicateUnifier]: Initialized classic predicate unifier [2025-04-13 18:21:52,651 INFO L85 PathProgramCache]: Analyzing trace with hash -45626030, now seen corresponding path program 2 times [2025-04-13 18:21:52,651 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-04-13 18:21:52,651 INFO L324 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [283272246] [2025-04-13 18:21:52,651 INFO L95 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST1 [2025-04-13 18:21:52,651 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-04-13 18:21:52,655 INFO L108 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 partitioned 45 statements into 2 equivalence classes. [2025-04-13 18:21:52,657 INFO L111 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 issued 1 check-sat command(s) and asserted 44 of 45 statements. [2025-04-13 18:21:52,657 INFO L114 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 issued 1 check-sat command(s) [2025-04-13 18:21:52,657 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-04-13 18:21:52,732 INFO L134 CoverageAnalysis]: Checked inductivity of 1 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2025-04-13 18:21:52,732 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-04-13 18:21:52,732 INFO L324 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [283272246] [2025-04-13 18:21:52,732 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [283272246] provided 1 perfect and 0 imperfect interpolant sequences [2025-04-13 18:21:52,732 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-04-13 18:21:52,732 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [9] imperfect sequences [] total 9 [2025-04-13 18:21:52,732 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1783285334] [2025-04-13 18:21:52,732 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-04-13 18:21:52,732 INFO L562 AbstractCegarLoop]: INTERPOLANT automaton has 10 states [2025-04-13 18:21:52,732 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-04-13 18:21:52,733 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 10 interpolants. [2025-04-13 18:21:52,733 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=18, Invalid=72, Unknown=0, NotChecked=0, Total=90 [2025-04-13 18:21:52,733 INFO L87 Difference]: Start difference. First operand 28256 states and 116692 transitions. Second operand has 10 states, 9 states have (on average 5.0) internal successors, (45), 10 states have internal predecessors, (45), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-04-13 18:21:53,759 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-04-13 18:21:53,759 INFO L93 Difference]: Finished difference Result 40140 states and 166302 transitions. [2025-04-13 18:21:53,759 INFO L140 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 32 states. [2025-04-13 18:21:53,759 INFO L79 Accepts]: Start accepts. Automaton has has 10 states, 9 states have (on average 5.0) internal successors, (45), 10 states have internal predecessors, (45), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 45 [2025-04-13 18:21:53,759 INFO L85 Accepts]: Finished accepts. some prefix is accepted. [2025-04-13 18:21:53,958 INFO L225 Difference]: With dead ends: 40140 [2025-04-13 18:21:53,958 INFO L226 Difference]: Without dead ends: 37638 [2025-04-13 18:21:53,977 INFO L436 NwaCegarLoop]: 0 DeclaredPredicates, 55 GetRequests, 24 SyntacticMatches, 0 SemanticMatches, 31 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 225 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=207, Invalid=849, Unknown=0, NotChecked=0, Total=1056 [2025-04-13 18:21:53,977 INFO L437 NwaCegarLoop]: 35 mSDtfsCounter, 432 mSDsluCounter, 183 mSDsCounter, 0 mSdLazyCounter, 1735 mSolverCounterSat, 2 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.4s Time, 0 mProtectedPredicate, 0 mProtectedAction, 432 SdHoareTripleChecker+Valid, 218 SdHoareTripleChecker+Invalid, 1737 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 2 IncrementalHoareTripleChecker+Valid, 1735 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.5s IncrementalHoareTripleChecker+Time [2025-04-13 18:21:53,977 INFO L438 NwaCegarLoop]: SdHoareTripleChecker [432 Valid, 218 Invalid, 1737 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [2 Valid, 1735 Invalid, 0 Unknown, 0 Unchecked, 0.5s Time] [2025-04-13 18:21:54,010 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 37638 states. [2025-04-13 18:21:54,559 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 37638 to 30850. [2025-04-13 18:21:54,602 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 30850 states, 30849 states have (on average 4.144672436707835) internal successors, (127859), 30849 states have internal predecessors, (127859), 0 states have call successors, (0), 0 states have 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:21:54,691 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 30850 states to 30850 states and 127859 transitions. [2025-04-13 18:21:54,792 INFO L79 Accepts]: Start accepts. Automaton has 30850 states and 127859 transitions. Word has length 45 [2025-04-13 18:21:54,792 INFO L85 Accepts]: Finished accepts. word is rejected. [2025-04-13 18:21:54,792 INFO L485 AbstractCegarLoop]: Abstraction has 30850 states and 127859 transitions. [2025-04-13 18:21:54,792 INFO L486 AbstractCegarLoop]: INTERPOLANT automaton has has 10 states, 9 states have (on average 5.0) internal successors, (45), 10 states have internal predecessors, (45), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-04-13 18:21:54,792 INFO L278 IsEmpty]: Start isEmpty. Operand 30850 states and 127859 transitions. [2025-04-13 18:21:54,849 INFO L284 IsEmpty]: Finished isEmpty. Found accepting run of length 46 [2025-04-13 18:21:54,849 INFO L210 NwaCegarLoop]: Found error trace [2025-04-13 18:21:54,849 INFO L218 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-04-13 18:21:54,849 WARN L466 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable33 [2025-04-13 18:21:54,849 INFO L403 AbstractCegarLoop]: === Iteration 35 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES, ULTIMATE.startErr1INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 2 more)] === [2025-04-13 18:21:54,850 INFO L155 PredicateUnifier]: Initialized classic predicate unifier [2025-04-13 18:21:54,850 INFO L85 PathProgramCache]: Analyzing trace with hash -1942518848, now seen corresponding path program 3 times [2025-04-13 18:21:54,850 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-04-13 18:21:54,850 INFO L324 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2008262299] [2025-04-13 18:21:54,850 INFO L95 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST2 [2025-04-13 18:21:54,850 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-04-13 18:21:54,854 INFO L108 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST2 partitioned 45 statements into 2 equivalence classes. [2025-04-13 18:21:54,856 INFO L111 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST2 issued 1 check-sat command(s) and asserted 44 of 45 statements. [2025-04-13 18:21:54,856 INFO L114 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST2 issued 1 check-sat command(s) [2025-04-13 18:21:54,856 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-04-13 18:21:54,956 INFO L134 CoverageAnalysis]: Checked inductivity of 1 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2025-04-13 18:21:54,957 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-04-13 18:21:54,957 INFO L324 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2008262299] [2025-04-13 18:21:54,957 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [2008262299] provided 1 perfect and 0 imperfect interpolant sequences [2025-04-13 18:21:54,957 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-04-13 18:21:54,957 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [9] imperfect sequences [] total 9 [2025-04-13 18:21:54,957 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1473124789] [2025-04-13 18:21:54,957 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-04-13 18:21:54,957 INFO L562 AbstractCegarLoop]: INTERPOLANT automaton has 10 states [2025-04-13 18:21:54,957 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-04-13 18:21:54,957 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 10 interpolants. [2025-04-13 18:21:54,957 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=17, Invalid=73, Unknown=0, NotChecked=0, Total=90 [2025-04-13 18:21:54,957 INFO L87 Difference]: Start difference. First operand 30850 states and 127859 transitions. Second operand has 10 states, 9 states have (on average 5.0) internal successors, (45), 10 states have internal predecessors, (45), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-04-13 18:21:56,206 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-04-13 18:21:56,207 INFO L93 Difference]: Finished difference Result 42021 states and 175277 transitions. [2025-04-13 18:21:56,207 INFO L140 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 34 states. [2025-04-13 18:21:56,207 INFO L79 Accepts]: Start accepts. Automaton has has 10 states, 9 states have (on average 5.0) internal successors, (45), 10 states have internal predecessors, (45), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 45 [2025-04-13 18:21:56,207 INFO L85 Accepts]: Finished accepts. some prefix is accepted. [2025-04-13 18:21:56,426 INFO L225 Difference]: With dead ends: 42021 [2025-04-13 18:21:56,426 INFO L226 Difference]: Without dead ends: 39719 [2025-04-13 18:21:56,444 INFO L436 NwaCegarLoop]: 0 DeclaredPredicates, 57 GetRequests, 25 SyntacticMatches, 0 SemanticMatches, 32 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 249 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=194, Invalid=928, Unknown=0, NotChecked=0, Total=1122 [2025-04-13 18:21:56,445 INFO L437 NwaCegarLoop]: 34 mSDtfsCounter, 450 mSDsluCounter, 195 mSDsCounter, 0 mSdLazyCounter, 1878 mSolverCounterSat, 7 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.7s Time, 0 mProtectedPredicate, 0 mProtectedAction, 450 SdHoareTripleChecker+Valid, 229 SdHoareTripleChecker+Invalid, 1885 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 7 IncrementalHoareTripleChecker+Valid, 1878 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.8s IncrementalHoareTripleChecker+Time [2025-04-13 18:21:56,445 INFO L438 NwaCegarLoop]: SdHoareTripleChecker [450 Valid, 229 Invalid, 1885 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [7 Valid, 1878 Invalid, 0 Unknown, 0 Unchecked, 0.8s Time] [2025-04-13 18:21:56,481 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 39719 states. [2025-04-13 18:21:57,163 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 39719 to 30804. [2025-04-13 18:21:57,205 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 30804 states, 30803 states have (on average 4.145310521702432) internal successors, (127688), 30803 states have internal predecessors, (127688), 0 states have call successors, (0), 0 states have 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:21:57,293 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 30804 states to 30804 states and 127688 transitions. [2025-04-13 18:21:57,396 INFO L79 Accepts]: Start accepts. Automaton has 30804 states and 127688 transitions. Word has length 45 [2025-04-13 18:21:57,396 INFO L85 Accepts]: Finished accepts. word is rejected. [2025-04-13 18:21:57,396 INFO L485 AbstractCegarLoop]: Abstraction has 30804 states and 127688 transitions. [2025-04-13 18:21:57,396 INFO L486 AbstractCegarLoop]: INTERPOLANT automaton has has 10 states, 9 states have (on average 5.0) internal successors, (45), 10 states have internal predecessors, (45), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-04-13 18:21:57,396 INFO L278 IsEmpty]: Start isEmpty. Operand 30804 states and 127688 transitions. [2025-04-13 18:21:57,639 INFO L284 IsEmpty]: Finished isEmpty. Found accepting run of length 46 [2025-04-13 18:21:57,639 INFO L210 NwaCegarLoop]: Found error trace [2025-04-13 18:21:57,640 INFO L218 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-04-13 18:21:57,640 WARN L466 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable34 [2025-04-13 18:21:57,640 INFO L403 AbstractCegarLoop]: === Iteration 36 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES, ULTIMATE.startErr1INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 2 more)] === [2025-04-13 18:21:57,640 INFO L155 PredicateUnifier]: Initialized classic predicate unifier [2025-04-13 18:21:57,640 INFO L85 PathProgramCache]: Analyzing trace with hash 1224446796, now seen corresponding path program 4 times [2025-04-13 18:21:57,640 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-04-13 18:21:57,640 INFO L324 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [620945800] [2025-04-13 18:21:57,640 INFO L95 rtionOrderModulation]: Changing assertion order to TERMS_WITH_SMALL_CONSTANTS_FIRST [2025-04-13 18:21:57,640 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-04-13 18:21:57,644 INFO L108 AnnotateAndAsserter]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST partitioned 45 statements into 2 equivalence classes. [2025-04-13 18:21:57,648 INFO L111 AnnotateAndAsserter]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST issued 2 check-sat command(s) and asserted 45 of 45 statements. [2025-04-13 18:21:57,648 INFO L114 AnnotateAndAsserter]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST issued 2 check-sat command(s) [2025-04-13 18:21:57,648 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-04-13 18:21:57,766 INFO L134 CoverageAnalysis]: Checked inductivity of 1 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2025-04-13 18:21:57,766 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-04-13 18:21:57,767 INFO L324 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [620945800] [2025-04-13 18:21:57,767 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [620945800] provided 1 perfect and 0 imperfect interpolant sequences [2025-04-13 18:21:57,767 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-04-13 18:21:57,767 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [12] imperfect sequences [] total 12 [2025-04-13 18:21:57,767 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [721604973] [2025-04-13 18:21:57,767 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-04-13 18:21:57,767 INFO L562 AbstractCegarLoop]: INTERPOLANT automaton has 13 states [2025-04-13 18:21:57,767 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-04-13 18:21:57,767 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 13 interpolants. [2025-04-13 18:21:57,767 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=32, Invalid=124, Unknown=0, NotChecked=0, Total=156 [2025-04-13 18:21:57,767 INFO L87 Difference]: Start difference. First operand 30804 states and 127688 transitions. Second operand has 13 states, 12 states have (on average 3.75) internal successors, (45), 13 states have internal predecessors, (45), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-04-13 18:21:59,331 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-04-13 18:21:59,332 INFO L93 Difference]: Finished difference Result 51225 states and 214966 transitions. [2025-04-13 18:21:59,332 INFO L140 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 51 states. [2025-04-13 18:21:59,332 INFO L79 Accepts]: Start accepts. Automaton has has 13 states, 12 states have (on average 3.75) internal successors, (45), 13 states have internal predecessors, (45), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 45 [2025-04-13 18:21:59,332 INFO L85 Accepts]: Finished accepts. some prefix is accepted. [2025-04-13 18:21:59,598 INFO L225 Difference]: With dead ends: 51225 [2025-04-13 18:21:59,599 INFO L226 Difference]: Without dead ends: 47167 [2025-04-13 18:21:59,622 INFO L436 NwaCegarLoop]: 0 DeclaredPredicates, 92 GetRequests, 41 SyntacticMatches, 0 SemanticMatches, 51 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 804 ImplicationChecksByTransitivity, 0.3s TimeCoverageRelationStatistics Valid=451, Invalid=2305, Unknown=0, NotChecked=0, Total=2756 [2025-04-13 18:21:59,623 INFO L437 NwaCegarLoop]: 48 mSDtfsCounter, 772 mSDsluCounter, 284 mSDsCounter, 0 mSdLazyCounter, 2824 mSolverCounterSat, 4 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.7s Time, 0 mProtectedPredicate, 0 mProtectedAction, 772 SdHoareTripleChecker+Valid, 332 SdHoareTripleChecker+Invalid, 2828 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 4 IncrementalHoareTripleChecker+Valid, 2824 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 1.0s IncrementalHoareTripleChecker+Time [2025-04-13 18:21:59,623 INFO L438 NwaCegarLoop]: SdHoareTripleChecker [772 Valid, 332 Invalid, 2828 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [4 Valid, 2824 Invalid, 0 Unknown, 0 Unchecked, 1.0s Time] [2025-04-13 18:21:59,665 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 47167 states. [2025-04-13 18:22:00,274 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 47167 to 31328. [2025-04-13 18:22:00,319 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 31328 states, 31327 states have (on average 4.141730775369489) internal successors, (129748), 31327 states have internal predecessors, (129748), 0 states have call successors, (0), 0 states have 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:22:00,408 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 31328 states to 31328 states and 129748 transitions. [2025-04-13 18:22:00,523 INFO L79 Accepts]: Start accepts. Automaton has 31328 states and 129748 transitions. Word has length 45 [2025-04-13 18:22:00,523 INFO L85 Accepts]: Finished accepts. word is rejected. [2025-04-13 18:22:00,523 INFO L485 AbstractCegarLoop]: Abstraction has 31328 states and 129748 transitions. [2025-04-13 18:22:00,523 INFO L486 AbstractCegarLoop]: INTERPOLANT automaton has has 13 states, 12 states have (on average 3.75) internal successors, (45), 13 states have internal predecessors, (45), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-04-13 18:22:00,523 INFO L278 IsEmpty]: Start isEmpty. Operand 31328 states and 129748 transitions. [2025-04-13 18:22:00,580 INFO L284 IsEmpty]: Finished isEmpty. Found accepting run of length 46 [2025-04-13 18:22:00,580 INFO L210 NwaCegarLoop]: Found error trace [2025-04-13 18:22:00,580 INFO L218 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-04-13 18:22:00,580 WARN L466 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable35 [2025-04-13 18:22:00,580 INFO L403 AbstractCegarLoop]: === Iteration 37 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES, ULTIMATE.startErr1INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 2 more)] === [2025-04-13 18:22:00,580 INFO L155 PredicateUnifier]: Initialized classic predicate unifier [2025-04-13 18:22:00,581 INFO L85 PathProgramCache]: Analyzing trace with hash -1190181120, now seen corresponding path program 5 times [2025-04-13 18:22:00,581 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-04-13 18:22:00,581 INFO L324 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1327143898] [2025-04-13 18:22:00,581 INFO L95 rtionOrderModulation]: Changing assertion order to INSIDE_LOOP_FIRST1 [2025-04-13 18:22:00,581 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-04-13 18:22:00,585 INFO L108 AnnotateAndAsserter]: Assert order INSIDE_LOOP_FIRST1 partitioned 45 statements into 2 equivalence classes. [2025-04-13 18:22:00,588 INFO L111 AnnotateAndAsserter]: Assert order INSIDE_LOOP_FIRST1 issued 2 check-sat command(s) and asserted 45 of 45 statements. [2025-04-13 18:22:00,588 INFO L114 AnnotateAndAsserter]: Assert order INSIDE_LOOP_FIRST1 issued 2 check-sat command(s) [2025-04-13 18:22:00,588 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-04-13 18:22:00,861 INFO L134 CoverageAnalysis]: Checked inductivity of 1 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2025-04-13 18:22:00,862 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-04-13 18:22:00,862 INFO L324 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1327143898] [2025-04-13 18:22:00,862 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1327143898] provided 1 perfect and 0 imperfect interpolant sequences [2025-04-13 18:22:00,862 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-04-13 18:22:00,862 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [9] imperfect sequences [] total 9 [2025-04-13 18:22:00,862 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [205893227] [2025-04-13 18:22:00,862 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-04-13 18:22:00,862 INFO L562 AbstractCegarLoop]: INTERPOLANT automaton has 10 states [2025-04-13 18:22:00,862 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-04-13 18:22:00,863 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 10 interpolants. [2025-04-13 18:22:00,863 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=17, Invalid=73, Unknown=0, NotChecked=0, Total=90 [2025-04-13 18:22:00,863 INFO L87 Difference]: Start difference. First operand 31328 states and 129748 transitions. Second operand has 10 states, 9 states have (on average 5.0) internal successors, (45), 10 states have internal predecessors, (45), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-04-13 18:22:02,035 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-04-13 18:22:02,035 INFO L93 Difference]: Finished difference Result 45926 states and 192009 transitions. [2025-04-13 18:22:02,035 INFO L140 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 36 states. [2025-04-13 18:22:02,035 INFO L79 Accepts]: Start accepts. Automaton has has 10 states, 9 states have (on average 5.0) internal successors, (45), 10 states have internal predecessors, (45), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 45 [2025-04-13 18:22:02,035 INFO L85 Accepts]: Finished accepts. some prefix is accepted. [2025-04-13 18:22:02,432 INFO L225 Difference]: With dead ends: 45926 [2025-04-13 18:22:02,432 INFO L226 Difference]: Without dead ends: 42971 [2025-04-13 18:22:02,445 INFO L436 NwaCegarLoop]: 0 DeclaredPredicates, 61 GetRequests, 27 SyntacticMatches, 0 SemanticMatches, 34 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 299 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=209, Invalid=1051, Unknown=0, NotChecked=0, Total=1260 [2025-04-13 18:22:02,445 INFO L437 NwaCegarLoop]: 37 mSDtfsCounter, 488 mSDsluCounter, 216 mSDsCounter, 0 mSdLazyCounter, 1902 mSolverCounterSat, 7 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.6s Time, 0 mProtectedPredicate, 0 mProtectedAction, 488 SdHoareTripleChecker+Valid, 253 SdHoareTripleChecker+Invalid, 1909 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 7 IncrementalHoareTripleChecker+Valid, 1902 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.7s IncrementalHoareTripleChecker+Time [2025-04-13 18:22:02,445 INFO L438 NwaCegarLoop]: SdHoareTripleChecker [488 Valid, 253 Invalid, 1909 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [7 Valid, 1902 Invalid, 0 Unknown, 0 Unchecked, 0.7s Time] [2025-04-13 18:22:02,475 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 42971 states. [2025-04-13 18:22:02,921 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 42971 to 31348. [2025-04-13 18:22:02,965 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 31348 states, 31347 states have (on average 4.141480843461895) internal successors, (129823), 31347 states have internal predecessors, (129823), 0 states have call successors, (0), 0 states have 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:22:03,199 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 31348 states to 31348 states and 129823 transitions. [2025-04-13 18:22:03,314 INFO L79 Accepts]: Start accepts. Automaton has 31348 states and 129823 transitions. Word has length 45 [2025-04-13 18:22:03,314 INFO L85 Accepts]: Finished accepts. word is rejected. [2025-04-13 18:22:03,314 INFO L485 AbstractCegarLoop]: Abstraction has 31348 states and 129823 transitions. [2025-04-13 18:22:03,314 INFO L486 AbstractCegarLoop]: INTERPOLANT automaton has has 10 states, 9 states have (on average 5.0) internal successors, (45), 10 states have internal predecessors, (45), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-04-13 18:22:03,314 INFO L278 IsEmpty]: Start isEmpty. Operand 31348 states and 129823 transitions. [2025-04-13 18:22:03,390 INFO L284 IsEmpty]: Finished isEmpty. Found accepting run of length 46 [2025-04-13 18:22:03,390 INFO L210 NwaCegarLoop]: Found error trace [2025-04-13 18:22:03,390 INFO L218 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-04-13 18:22:03,390 WARN L466 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable36 [2025-04-13 18:22:03,390 INFO L403 AbstractCegarLoop]: === Iteration 38 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES, ULTIMATE.startErr1INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 2 more)] === [2025-04-13 18:22:03,390 INFO L155 PredicateUnifier]: Initialized classic predicate unifier [2025-04-13 18:22:03,390 INFO L85 PathProgramCache]: Analyzing trace with hash 675624460, now seen corresponding path program 6 times [2025-04-13 18:22:03,390 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-04-13 18:22:03,390 INFO L324 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1720134124] [2025-04-13 18:22:03,391 INFO L95 rtionOrderModulation]: Changing assertion order to MIX_INSIDE_OUTSIDE [2025-04-13 18:22:03,391 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-04-13 18:22:03,395 INFO L108 AnnotateAndAsserter]: Assert order MIX_INSIDE_OUTSIDE partitioned 45 statements into 2 equivalence classes. [2025-04-13 18:22:03,397 INFO L111 AnnotateAndAsserter]: Assert order MIX_INSIDE_OUTSIDE issued 1 check-sat command(s) and asserted 44 of 45 statements. [2025-04-13 18:22:03,397 INFO L114 AnnotateAndAsserter]: Assert order MIX_INSIDE_OUTSIDE issued 1 check-sat command(s) [2025-04-13 18:22:03,397 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-04-13 18:22:03,505 INFO L134 CoverageAnalysis]: Checked inductivity of 1 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2025-04-13 18:22:03,505 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-04-13 18:22:03,505 INFO L324 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1720134124] [2025-04-13 18:22:03,505 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1720134124] provided 1 perfect and 0 imperfect interpolant sequences [2025-04-13 18:22:03,505 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-04-13 18:22:03,505 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [9] imperfect sequences [] total 9 [2025-04-13 18:22:03,505 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1023744813] [2025-04-13 18:22:03,505 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-04-13 18:22:03,505 INFO L562 AbstractCegarLoop]: INTERPOLANT automaton has 10 states [2025-04-13 18:22:03,505 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-04-13 18:22:03,506 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 10 interpolants. [2025-04-13 18:22:03,506 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=17, Invalid=73, Unknown=0, NotChecked=0, Total=90 [2025-04-13 18:22:03,506 INFO L87 Difference]: Start difference. First operand 31348 states and 129823 transitions. Second operand has 10 states, 9 states have (on average 5.0) internal successors, (45), 10 states have internal predecessors, (45), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-04-13 18:22:04,661 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-04-13 18:22:04,661 INFO L93 Difference]: Finished difference Result 42825 states and 179875 transitions. [2025-04-13 18:22:04,661 INFO L140 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 28 states. [2025-04-13 18:22:04,661 INFO L79 Accepts]: Start accepts. Automaton has has 10 states, 9 states have (on average 5.0) internal successors, (45), 10 states have internal predecessors, (45), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 45 [2025-04-13 18:22:04,661 INFO L85 Accepts]: Finished accepts. some prefix is accepted. [2025-04-13 18:22:04,889 INFO L225 Difference]: With dead ends: 42825 [2025-04-13 18:22:04,890 INFO L226 Difference]: Without dead ends: 40498 [2025-04-13 18:22:04,908 INFO L436 NwaCegarLoop]: 0 DeclaredPredicates, 47 GetRequests, 20 SyntacticMatches, 0 SemanticMatches, 27 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 155 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=145, Invalid=667, Unknown=0, NotChecked=0, Total=812 [2025-04-13 18:22:04,909 INFO L437 NwaCegarLoop]: 37 mSDtfsCounter, 416 mSDsluCounter, 205 mSDsCounter, 0 mSdLazyCounter, 1816 mSolverCounterSat, 2 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.5s Time, 0 mProtectedPredicate, 0 mProtectedAction, 416 SdHoareTripleChecker+Valid, 242 SdHoareTripleChecker+Invalid, 1818 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 2 IncrementalHoareTripleChecker+Valid, 1816 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.6s IncrementalHoareTripleChecker+Time [2025-04-13 18:22:04,909 INFO L438 NwaCegarLoop]: SdHoareTripleChecker [416 Valid, 242 Invalid, 1818 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [2 Valid, 1816 Invalid, 0 Unknown, 0 Unchecked, 0.6s Time] [2025-04-13 18:22:04,945 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 40498 states. [2025-04-13 18:22:05,565 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 40498 to 31146. [2025-04-13 18:22:05,610 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 31146 states, 31145 states have (on average 4.143971745063413) internal successors, (129064), 31145 states have internal predecessors, (129064), 0 states have call successors, (0), 0 states have 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:22:05,720 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 31146 states to 31146 states and 129064 transitions. [2025-04-13 18:22:05,831 INFO L79 Accepts]: Start accepts. Automaton has 31146 states and 129064 transitions. Word has length 45 [2025-04-13 18:22:05,831 INFO L85 Accepts]: Finished accepts. word is rejected. [2025-04-13 18:22:05,831 INFO L485 AbstractCegarLoop]: Abstraction has 31146 states and 129064 transitions. [2025-04-13 18:22:05,831 INFO L486 AbstractCegarLoop]: INTERPOLANT automaton has has 10 states, 9 states have (on average 5.0) internal successors, (45), 10 states have internal predecessors, (45), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-04-13 18:22:05,831 INFO L278 IsEmpty]: Start isEmpty. Operand 31146 states and 129064 transitions. [2025-04-13 18:22:05,888 INFO L284 IsEmpty]: Finished isEmpty. Found accepting run of length 46 [2025-04-13 18:22:05,889 INFO L210 NwaCegarLoop]: Found error trace [2025-04-13 18:22:05,889 INFO L218 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-04-13 18:22:05,889 WARN L466 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable37 [2025-04-13 18:22:05,889 INFO L403 AbstractCegarLoop]: === Iteration 39 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES, ULTIMATE.startErr1INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 2 more)] === [2025-04-13 18:22:05,889 INFO L155 PredicateUnifier]: Initialized classic predicate unifier [2025-04-13 18:22:05,889 INFO L85 PathProgramCache]: Analyzing trace with hash -208946106, now seen corresponding path program 7 times [2025-04-13 18:22:05,889 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-04-13 18:22:05,889 INFO L324 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2136684254] [2025-04-13 18:22:05,889 INFO L95 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2025-04-13 18:22:05,889 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-04-13 18:22:05,894 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 45 statements into 1 equivalence classes. [2025-04-13 18:22:05,897 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 45 of 45 statements. [2025-04-13 18:22:05,897 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-04-13 18:22:05,897 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-04-13 18:22:05,997 INFO L134 CoverageAnalysis]: Checked inductivity of 1 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2025-04-13 18:22:05,997 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-04-13 18:22:05,997 INFO L324 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2136684254] [2025-04-13 18:22:05,998 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [2136684254] provided 1 perfect and 0 imperfect interpolant sequences [2025-04-13 18:22:05,998 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-04-13 18:22:05,998 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [9] imperfect sequences [] total 9 [2025-04-13 18:22:05,998 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1299465705] [2025-04-13 18:22:05,998 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-04-13 18:22:05,998 INFO L562 AbstractCegarLoop]: INTERPOLANT automaton has 10 states [2025-04-13 18:22:05,998 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-04-13 18:22:05,998 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 10 interpolants. [2025-04-13 18:22:05,998 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=18, Invalid=72, Unknown=0, NotChecked=0, Total=90 [2025-04-13 18:22:05,998 INFO L87 Difference]: Start difference. First operand 31146 states and 129064 transitions. Second operand has 10 states, 9 states have (on average 5.0) internal successors, (45), 10 states have internal predecessors, (45), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-04-13 18:22:06,984 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-04-13 18:22:06,984 INFO L93 Difference]: Finished difference Result 42893 states and 177783 transitions. [2025-04-13 18:22:06,984 INFO L140 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 27 states. [2025-04-13 18:22:06,984 INFO L79 Accepts]: Start accepts. Automaton has has 10 states, 9 states have (on average 5.0) internal successors, (45), 10 states have internal predecessors, (45), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 45 [2025-04-13 18:22:06,985 INFO L85 Accepts]: Finished accepts. some prefix is accepted. [2025-04-13 18:22:07,199 INFO L225 Difference]: With dead ends: 42893 [2025-04-13 18:22:07,200 INFO L226 Difference]: Without dead ends: 39938 [2025-04-13 18:22:07,219 INFO L436 NwaCegarLoop]: 0 DeclaredPredicates, 45 GetRequests, 19 SyntacticMatches, 0 SemanticMatches, 26 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 147 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=137, Invalid=619, Unknown=0, NotChecked=0, Total=756 [2025-04-13 18:22:07,220 INFO L437 NwaCegarLoop]: 31 mSDtfsCounter, 333 mSDsluCounter, 169 mSDsCounter, 0 mSdLazyCounter, 1592 mSolverCounterSat, 3 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.4s Time, 0 mProtectedPredicate, 0 mProtectedAction, 333 SdHoareTripleChecker+Valid, 200 SdHoareTripleChecker+Invalid, 1595 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 3 IncrementalHoareTripleChecker+Valid, 1592 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.5s IncrementalHoareTripleChecker+Time [2025-04-13 18:22:07,220 INFO L438 NwaCegarLoop]: SdHoareTripleChecker [333 Valid, 200 Invalid, 1595 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [3 Valid, 1592 Invalid, 0 Unknown, 0 Unchecked, 0.5s Time] [2025-04-13 18:22:07,263 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 39938 states. [2025-04-13 18:22:07,843 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 39938 to 32016. [2025-04-13 18:22:07,886 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 32016 states, 32015 states have (on average 4.135155395908168) internal successors, (132387), 32015 states have internal predecessors, (132387), 0 states have call successors, (0), 0 states have 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:22:07,975 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 32016 states to 32016 states and 132387 transitions. [2025-04-13 18:22:08,077 INFO L79 Accepts]: Start accepts. Automaton has 32016 states and 132387 transitions. Word has length 45 [2025-04-13 18:22:08,077 INFO L85 Accepts]: Finished accepts. word is rejected. [2025-04-13 18:22:08,077 INFO L485 AbstractCegarLoop]: Abstraction has 32016 states and 132387 transitions. [2025-04-13 18:22:08,077 INFO L486 AbstractCegarLoop]: INTERPOLANT automaton has has 10 states, 9 states have (on average 5.0) internal successors, (45), 10 states have internal predecessors, (45), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-04-13 18:22:08,077 INFO L278 IsEmpty]: Start isEmpty. Operand 32016 states and 132387 transitions. [2025-04-13 18:22:08,136 INFO L284 IsEmpty]: Finished isEmpty. Found accepting run of length 46 [2025-04-13 18:22:08,136 INFO L210 NwaCegarLoop]: Found error trace [2025-04-13 18:22:08,136 INFO L218 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-04-13 18:22:08,136 WARN L466 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable38 [2025-04-13 18:22:08,136 INFO L403 AbstractCegarLoop]: === Iteration 40 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES, ULTIMATE.startErr1INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 2 more)] === [2025-04-13 18:22:08,137 INFO L155 PredicateUnifier]: Initialized classic predicate unifier [2025-04-13 18:22:08,137 INFO L85 PathProgramCache]: Analyzing trace with hash -1558775472, now seen corresponding path program 8 times [2025-04-13 18:22:08,137 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-04-13 18:22:08,137 INFO L324 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [517690197] [2025-04-13 18:22:08,137 INFO L95 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST1 [2025-04-13 18:22:08,137 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-04-13 18:22:08,141 INFO L108 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 partitioned 45 statements into 2 equivalence classes. [2025-04-13 18:22:08,143 INFO L111 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 issued 1 check-sat command(s) and asserted 44 of 45 statements. [2025-04-13 18:22:08,143 INFO L114 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 issued 1 check-sat command(s) [2025-04-13 18:22:08,143 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-04-13 18:22:08,384 INFO L134 CoverageAnalysis]: Checked inductivity of 1 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2025-04-13 18:22:08,384 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-04-13 18:22:08,385 INFO L324 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [517690197] [2025-04-13 18:22:08,385 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [517690197] provided 1 perfect and 0 imperfect interpolant sequences [2025-04-13 18:22:08,385 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-04-13 18:22:08,385 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [9] imperfect sequences [] total 9 [2025-04-13 18:22:08,385 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1851021458] [2025-04-13 18:22:08,385 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-04-13 18:22:08,385 INFO L562 AbstractCegarLoop]: INTERPOLANT automaton has 10 states [2025-04-13 18:22:08,385 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-04-13 18:22:08,385 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 10 interpolants. [2025-04-13 18:22:08,385 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=18, Invalid=72, Unknown=0, NotChecked=0, Total=90 [2025-04-13 18:22:08,385 INFO L87 Difference]: Start difference. First operand 32016 states and 132387 transitions. Second operand has 10 states, 9 states have (on average 5.0) internal successors, (45), 10 states have internal predecessors, (45), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-04-13 18:22:09,235 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-04-13 18:22:09,235 INFO L93 Difference]: Finished difference Result 44039 states and 183040 transitions. [2025-04-13 18:22:09,235 INFO L140 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 28 states. [2025-04-13 18:22:09,235 INFO L79 Accepts]: Start accepts. Automaton has has 10 states, 9 states have (on average 5.0) internal successors, (45), 10 states have internal predecessors, (45), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 45 [2025-04-13 18:22:09,236 INFO L85 Accepts]: Finished accepts. some prefix is accepted. [2025-04-13 18:22:09,467 INFO L225 Difference]: With dead ends: 44039 [2025-04-13 18:22:09,467 INFO L226 Difference]: Without dead ends: 41437 [2025-04-13 18:22:09,486 INFO L436 NwaCegarLoop]: 0 DeclaredPredicates, 47 GetRequests, 20 SyntacticMatches, 0 SemanticMatches, 27 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 158 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=153, Invalid=659, Unknown=0, NotChecked=0, Total=812 [2025-04-13 18:22:09,487 INFO L437 NwaCegarLoop]: 33 mSDtfsCounter, 367 mSDsluCounter, 169 mSDsCounter, 0 mSdLazyCounter, 1680 mSolverCounterSat, 2 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.4s Time, 0 mProtectedPredicate, 0 mProtectedAction, 367 SdHoareTripleChecker+Valid, 202 SdHoareTripleChecker+Invalid, 1682 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 2 IncrementalHoareTripleChecker+Valid, 1680 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.5s IncrementalHoareTripleChecker+Time [2025-04-13 18:22:09,487 INFO L438 NwaCegarLoop]: SdHoareTripleChecker [367 Valid, 202 Invalid, 1682 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [2 Valid, 1680 Invalid, 0 Unknown, 0 Unchecked, 0.5s Time] [2025-04-13 18:22:09,684 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 41437 states. [2025-04-13 18:22:10,195 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 41437 to 33590. [2025-04-13 18:22:10,241 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 33590 states, 33589 states have (on average 4.1394504153145375) internal successors, (139040), 33589 states have internal predecessors, (139040), 0 states have call successors, (0), 0 states have 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:22:10,510 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 33590 states to 33590 states and 139040 transitions. [2025-04-13 18:22:10,625 INFO L79 Accepts]: Start accepts. Automaton has 33590 states and 139040 transitions. Word has length 45 [2025-04-13 18:22:10,625 INFO L85 Accepts]: Finished accepts. word is rejected. [2025-04-13 18:22:10,625 INFO L485 AbstractCegarLoop]: Abstraction has 33590 states and 139040 transitions. [2025-04-13 18:22:10,625 INFO L486 AbstractCegarLoop]: INTERPOLANT automaton has has 10 states, 9 states have (on average 5.0) internal successors, (45), 10 states have internal predecessors, (45), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-04-13 18:22:10,625 INFO L278 IsEmpty]: Start isEmpty. Operand 33590 states and 139040 transitions. [2025-04-13 18:22:10,705 INFO L284 IsEmpty]: Finished isEmpty. Found accepting run of length 46 [2025-04-13 18:22:10,705 INFO L210 NwaCegarLoop]: Found error trace [2025-04-13 18:22:10,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, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-04-13 18:22:10,705 WARN L466 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable39 [2025-04-13 18:22:10,705 INFO L403 AbstractCegarLoop]: === Iteration 41 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES, ULTIMATE.startErr1INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 2 more)] === [2025-04-13 18:22:10,705 INFO L155 PredicateUnifier]: Initialized classic predicate unifier [2025-04-13 18:22:10,705 INFO L85 PathProgramCache]: Analyzing trace with hash -1002784414, now seen corresponding path program 9 times [2025-04-13 18:22:10,705 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-04-13 18:22:10,705 INFO L324 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [323156953] [2025-04-13 18:22:10,706 INFO L95 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST2 [2025-04-13 18:22:10,706 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-04-13 18:22:10,710 INFO L108 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST2 partitioned 45 statements into 2 equivalence classes. [2025-04-13 18:22:10,713 INFO L111 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST2 issued 1 check-sat command(s) and asserted 44 of 45 statements. [2025-04-13 18:22:10,713 INFO L114 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST2 issued 1 check-sat command(s) [2025-04-13 18:22:10,713 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-04-13 18:22:10,800 INFO L134 CoverageAnalysis]: Checked inductivity of 1 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2025-04-13 18:22:10,801 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-04-13 18:22:10,801 INFO L324 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [323156953] [2025-04-13 18:22:10,801 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [323156953] provided 1 perfect and 0 imperfect interpolant sequences [2025-04-13 18:22:10,801 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-04-13 18:22:10,801 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [9] imperfect sequences [] total 9 [2025-04-13 18:22:10,801 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1500001559] [2025-04-13 18:22:10,801 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-04-13 18:22:10,801 INFO L562 AbstractCegarLoop]: INTERPOLANT automaton has 10 states [2025-04-13 18:22:10,801 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-04-13 18:22:10,801 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 10 interpolants. [2025-04-13 18:22:10,802 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=17, Invalid=73, Unknown=0, NotChecked=0, Total=90 [2025-04-13 18:22:10,802 INFO L87 Difference]: Start difference. First operand 33590 states and 139040 transitions. Second operand has 10 states, 9 states have (on average 5.0) internal successors, (45), 10 states have internal predecessors, (45), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-04-13 18:22:11,887 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-04-13 18:22:11,887 INFO L93 Difference]: Finished difference Result 43745 states and 183160 transitions. [2025-04-13 18:22:11,887 INFO L140 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 28 states. [2025-04-13 18:22:11,887 INFO L79 Accepts]: Start accepts. Automaton has has 10 states, 9 states have (on average 5.0) internal successors, (45), 10 states have internal predecessors, (45), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 45 [2025-04-13 18:22:11,887 INFO L85 Accepts]: Finished accepts. some prefix is accepted. [2025-04-13 18:22:12,123 INFO L225 Difference]: With dead ends: 43745 [2025-04-13 18:22:12,123 INFO L226 Difference]: Without dead ends: 41443 [2025-04-13 18:22:12,141 INFO L436 NwaCegarLoop]: 0 DeclaredPredicates, 47 GetRequests, 20 SyntacticMatches, 0 SemanticMatches, 27 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 155 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=138, Invalid=674, Unknown=0, NotChecked=0, Total=812 [2025-04-13 18:22:12,141 INFO L437 NwaCegarLoop]: 32 mSDtfsCounter, 354 mSDsluCounter, 181 mSDsCounter, 0 mSdLazyCounter, 1778 mSolverCounterSat, 5 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.5s Time, 0 mProtectedPredicate, 0 mProtectedAction, 354 SdHoareTripleChecker+Valid, 213 SdHoareTripleChecker+Invalid, 1783 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 5 IncrementalHoareTripleChecker+Valid, 1778 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.6s IncrementalHoareTripleChecker+Time [2025-04-13 18:22:12,141 INFO L438 NwaCegarLoop]: SdHoareTripleChecker [354 Valid, 213 Invalid, 1783 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [5 Valid, 1778 Invalid, 0 Unknown, 0 Unchecked, 0.6s Time] [2025-04-13 18:22:12,178 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 41443 states. [2025-04-13 18:22:12,732 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 41443 to 33544. [2025-04-13 18:22:12,779 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 33544 states, 33543 states have (on average 4.140029216229914) internal successors, (138869), 33543 states have internal predecessors, (138869), 0 states have call successors, (0), 0 states have 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:22:12,874 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 33544 states to 33544 states and 138869 transitions. [2025-04-13 18:22:13,169 INFO L79 Accepts]: Start accepts. Automaton has 33544 states and 138869 transitions. Word has length 45 [2025-04-13 18:22:13,169 INFO L85 Accepts]: Finished accepts. word is rejected. [2025-04-13 18:22:13,169 INFO L485 AbstractCegarLoop]: Abstraction has 33544 states and 138869 transitions. [2025-04-13 18:22:13,170 INFO L486 AbstractCegarLoop]: INTERPOLANT automaton has has 10 states, 9 states have (on average 5.0) internal successors, (45), 10 states have internal predecessors, (45), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-04-13 18:22:13,170 INFO L278 IsEmpty]: Start isEmpty. Operand 33544 states and 138869 transitions. [2025-04-13 18:22:13,273 INFO L284 IsEmpty]: Finished isEmpty. Found accepting run of length 46 [2025-04-13 18:22:13,273 INFO L210 NwaCegarLoop]: Found error trace [2025-04-13 18:22:13,274 INFO L218 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-04-13 18:22:13,274 WARN L466 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable40 [2025-04-13 18:22:13,274 INFO L403 AbstractCegarLoop]: === Iteration 42 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES, ULTIMATE.startErr1INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 2 more)] === [2025-04-13 18:22:13,274 INFO L155 PredicateUnifier]: Initialized classic predicate unifier [2025-04-13 18:22:13,274 INFO L85 PathProgramCache]: Analyzing trace with hash -1764402454, now seen corresponding path program 10 times [2025-04-13 18:22:13,274 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-04-13 18:22:13,274 INFO L324 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [395618211] [2025-04-13 18:22:13,275 INFO L95 rtionOrderModulation]: Changing assertion order to TERMS_WITH_SMALL_CONSTANTS_FIRST [2025-04-13 18:22:13,275 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-04-13 18:22:13,283 INFO L108 AnnotateAndAsserter]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST partitioned 45 statements into 2 equivalence classes. [2025-04-13 18:22:13,291 INFO L111 AnnotateAndAsserter]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST issued 2 check-sat command(s) and asserted 45 of 45 statements. [2025-04-13 18:22:13,292 INFO L114 AnnotateAndAsserter]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST issued 2 check-sat command(s) [2025-04-13 18:22:13,292 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-04-13 18:22:13,516 INFO L134 CoverageAnalysis]: Checked inductivity of 1 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2025-04-13 18:22:13,516 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-04-13 18:22:13,516 INFO L324 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [395618211] [2025-04-13 18:22:13,516 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [395618211] provided 1 perfect and 0 imperfect interpolant sequences [2025-04-13 18:22:13,516 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-04-13 18:22:13,516 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [11] imperfect sequences [] total 11 [2025-04-13 18:22:13,516 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1481041308] [2025-04-13 18:22:13,516 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-04-13 18:22:13,517 INFO L562 AbstractCegarLoop]: INTERPOLANT automaton has 12 states [2025-04-13 18:22:13,517 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-04-13 18:22:13,517 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 12 interpolants. [2025-04-13 18:22:13,517 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=26, Invalid=106, Unknown=0, NotChecked=0, Total=132 [2025-04-13 18:22:13,518 INFO L87 Difference]: Start difference. First operand 33544 states and 138869 transitions. Second operand has 12 states, 11 states have (on average 4.090909090909091) internal successors, (45), 12 states have internal predecessors, (45), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-04-13 18:22:15,076 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-04-13 18:22:15,076 INFO L93 Difference]: Finished difference Result 76219 states and 333493 transitions. [2025-04-13 18:22:15,076 INFO L140 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 37 states. [2025-04-13 18:22:15,076 INFO L79 Accepts]: Start accepts. Automaton has has 12 states, 11 states have (on average 4.090909090909091) internal successors, (45), 12 states have internal predecessors, (45), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 45 [2025-04-13 18:22:15,076 INFO L85 Accepts]: Finished accepts. some prefix is accepted. [2025-04-13 18:22:15,649 INFO L225 Difference]: With dead ends: 76219 [2025-04-13 18:22:15,649 INFO L226 Difference]: Without dead ends: 72508 [2025-04-13 18:22:15,672 INFO L436 NwaCegarLoop]: 0 DeclaredPredicates, 63 GetRequests, 27 SyntacticMatches, 0 SemanticMatches, 36 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 371 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=288, Invalid=1118, Unknown=0, NotChecked=0, Total=1406 [2025-04-13 18:22:15,672 INFO L437 NwaCegarLoop]: 44 mSDtfsCounter, 687 mSDsluCounter, 223 mSDsCounter, 0 mSdLazyCounter, 1793 mSolverCounterSat, 3 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.8s Time, 0 mProtectedPredicate, 0 mProtectedAction, 687 SdHoareTripleChecker+Valid, 267 SdHoareTripleChecker+Invalid, 1796 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 3 IncrementalHoareTripleChecker+Valid, 1793 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.9s IncrementalHoareTripleChecker+Time [2025-04-13 18:22:15,673 INFO L438 NwaCegarLoop]: SdHoareTripleChecker [687 Valid, 267 Invalid, 1796 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [3 Valid, 1793 Invalid, 0 Unknown, 0 Unchecked, 0.9s Time] [2025-04-13 18:22:15,728 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 72508 states. [2025-04-13 18:22:16,599 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 72508 to 35296. [2025-04-13 18:22:16,647 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 35296 states, 35295 states have (on average 4.141804788213628) internal successors, (146185), 35295 states have internal predecessors, (146185), 0 states have call successors, (0), 0 states have 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:22:16,914 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 35296 states to 35296 states and 146185 transitions. [2025-04-13 18:22:17,048 INFO L79 Accepts]: Start accepts. Automaton has 35296 states and 146185 transitions. Word has length 45 [2025-04-13 18:22:17,049 INFO L85 Accepts]: Finished accepts. word is rejected. [2025-04-13 18:22:17,049 INFO L485 AbstractCegarLoop]: Abstraction has 35296 states and 146185 transitions. [2025-04-13 18:22:17,049 INFO L486 AbstractCegarLoop]: INTERPOLANT automaton has has 12 states, 11 states have (on average 4.090909090909091) internal successors, (45), 12 states have internal predecessors, (45), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-04-13 18:22:17,049 INFO L278 IsEmpty]: Start isEmpty. Operand 35296 states and 146185 transitions. [2025-04-13 18:22:17,120 INFO L284 IsEmpty]: Finished isEmpty. Found accepting run of length 46 [2025-04-13 18:22:17,121 INFO L210 NwaCegarLoop]: Found error trace [2025-04-13 18:22:17,121 INFO L218 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-04-13 18:22:17,121 WARN L466 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable41 [2025-04-13 18:22:17,121 INFO L403 AbstractCegarLoop]: === Iteration 43 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES, ULTIMATE.startErr1INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 2 more)] === [2025-04-13 18:22:17,121 INFO L155 PredicateUnifier]: Initialized classic predicate unifier [2025-04-13 18:22:17,121 INFO L85 PathProgramCache]: Analyzing trace with hash 422711062, now seen corresponding path program 11 times [2025-04-13 18:22:17,121 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-04-13 18:22:17,121 INFO L324 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1240228130] [2025-04-13 18:22:17,121 INFO L95 rtionOrderModulation]: Changing assertion order to INSIDE_LOOP_FIRST1 [2025-04-13 18:22:17,122 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-04-13 18:22:17,126 INFO L108 AnnotateAndAsserter]: Assert order INSIDE_LOOP_FIRST1 partitioned 45 statements into 2 equivalence classes. [2025-04-13 18:22:17,130 INFO L111 AnnotateAndAsserter]: Assert order INSIDE_LOOP_FIRST1 issued 2 check-sat command(s) and asserted 45 of 45 statements. [2025-04-13 18:22:17,130 INFO L114 AnnotateAndAsserter]: Assert order INSIDE_LOOP_FIRST1 issued 2 check-sat command(s) [2025-04-13 18:22:17,130 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-04-13 18:22:17,218 INFO L134 CoverageAnalysis]: Checked inductivity of 1 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2025-04-13 18:22:17,218 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-04-13 18:22:17,218 INFO L324 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1240228130] [2025-04-13 18:22:17,218 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1240228130] provided 1 perfect and 0 imperfect interpolant sequences [2025-04-13 18:22:17,218 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-04-13 18:22:17,218 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [9] imperfect sequences [] total 9 [2025-04-13 18:22:17,219 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2067386989] [2025-04-13 18:22:17,219 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-04-13 18:22:17,219 INFO L562 AbstractCegarLoop]: INTERPOLANT automaton has 10 states [2025-04-13 18:22:17,219 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-04-13 18:22:17,219 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 10 interpolants. [2025-04-13 18:22:17,219 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=18, Invalid=72, Unknown=0, NotChecked=0, Total=90 [2025-04-13 18:22:17,219 INFO L87 Difference]: Start difference. First operand 35296 states and 146185 transitions. Second operand has 10 states, 9 states have (on average 5.0) internal successors, (45), 10 states have internal predecessors, (45), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-04-13 18:22:18,173 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-04-13 18:22:18,173 INFO L93 Difference]: Finished difference Result 48656 states and 202012 transitions. [2025-04-13 18:22:18,173 INFO L140 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 29 states. [2025-04-13 18:22:18,173 INFO L79 Accepts]: Start accepts. Automaton has has 10 states, 9 states have (on average 5.0) internal successors, (45), 10 states have internal predecessors, (45), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 45 [2025-04-13 18:22:18,173 INFO L85 Accepts]: Finished accepts. some prefix is accepted. [2025-04-13 18:22:18,426 INFO L225 Difference]: With dead ends: 48656 [2025-04-13 18:22:18,426 INFO L226 Difference]: Without dead ends: 46004 [2025-04-13 18:22:18,448 INFO L436 NwaCegarLoop]: 0 DeclaredPredicates, 51 GetRequests, 22 SyntacticMatches, 0 SemanticMatches, 29 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 197 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=174, Invalid=756, Unknown=0, NotChecked=0, Total=930 [2025-04-13 18:22:18,448 INFO L437 NwaCegarLoop]: 31 mSDtfsCounter, 432 mSDsluCounter, 143 mSDsCounter, 0 mSdLazyCounter, 1498 mSolverCounterSat, 3 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.4s Time, 0 mProtectedPredicate, 0 mProtectedAction, 432 SdHoareTripleChecker+Valid, 174 SdHoareTripleChecker+Invalid, 1501 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 3 IncrementalHoareTripleChecker+Valid, 1498 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.6s IncrementalHoareTripleChecker+Time [2025-04-13 18:22:18,448 INFO L438 NwaCegarLoop]: SdHoareTripleChecker [432 Valid, 174 Invalid, 1501 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [3 Valid, 1498 Invalid, 0 Unknown, 0 Unchecked, 0.6s Time] [2025-04-13 18:22:18,490 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 46004 states. [2025-04-13 18:22:19,192 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 46004 to 35900. [2025-04-13 18:22:19,242 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 35900 states, 35899 states have (on average 4.142873060530934) internal successors, (148725), 35899 states have internal predecessors, (148725), 0 states have call successors, (0), 0 states have 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:22:19,346 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 35900 states to 35900 states and 148725 transitions. [2025-04-13 18:22:19,463 INFO L79 Accepts]: Start accepts. Automaton has 35900 states and 148725 transitions. Word has length 45 [2025-04-13 18:22:19,463 INFO L85 Accepts]: Finished accepts. word is rejected. [2025-04-13 18:22:19,463 INFO L485 AbstractCegarLoop]: Abstraction has 35900 states and 148725 transitions. [2025-04-13 18:22:19,463 INFO L486 AbstractCegarLoop]: INTERPOLANT automaton has has 10 states, 9 states have (on average 5.0) internal successors, (45), 10 states have internal predecessors, (45), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-04-13 18:22:19,463 INFO L278 IsEmpty]: Start isEmpty. Operand 35900 states and 148725 transitions. [2025-04-13 18:22:19,725 INFO L284 IsEmpty]: Finished isEmpty. Found accepting run of length 46 [2025-04-13 18:22:19,725 INFO L210 NwaCegarLoop]: Found error trace [2025-04-13 18:22:19,725 INFO L218 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-04-13 18:22:19,725 WARN L466 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable42 [2025-04-13 18:22:19,725 INFO L403 AbstractCegarLoop]: === Iteration 44 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES, ULTIMATE.startErr1INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 2 more)] === [2025-04-13 18:22:19,726 INFO L155 PredicateUnifier]: Initialized classic predicate unifier [2025-04-13 18:22:19,726 INFO L85 PathProgramCache]: Analyzing trace with hash -96134441, now seen corresponding path program 8 times [2025-04-13 18:22:19,726 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-04-13 18:22:19,726 INFO L324 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1173455415] [2025-04-13 18:22:19,726 INFO L95 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST1 [2025-04-13 18:22:19,726 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-04-13 18:22:19,730 INFO L108 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 partitioned 45 statements into 2 equivalence classes. [2025-04-13 18:22:19,732 INFO L111 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 issued 1 check-sat command(s) and asserted 44 of 45 statements. [2025-04-13 18:22:19,733 INFO L114 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 issued 1 check-sat command(s) [2025-04-13 18:22:19,733 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-04-13 18:22:19,805 INFO L134 CoverageAnalysis]: Checked inductivity of 1 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2025-04-13 18:22:19,805 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-04-13 18:22:19,805 INFO L324 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1173455415] [2025-04-13 18:22:19,805 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1173455415] provided 1 perfect and 0 imperfect interpolant sequences [2025-04-13 18:22:19,805 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-04-13 18:22:19,805 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [9] imperfect sequences [] total 9 [2025-04-13 18:22:19,805 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1868838919] [2025-04-13 18:22:19,805 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-04-13 18:22:19,805 INFO L562 AbstractCegarLoop]: INTERPOLANT automaton has 10 states [2025-04-13 18:22:19,805 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-04-13 18:22:19,805 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 10 interpolants. [2025-04-13 18:22:19,805 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=18, Invalid=72, Unknown=0, NotChecked=0, Total=90 [2025-04-13 18:22:19,806 INFO L87 Difference]: Start difference. First operand 35900 states and 148725 transitions. Second operand has 10 states, 9 states have (on average 5.0) internal successors, (45), 10 states have internal predecessors, (45), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-04-13 18:22:20,935 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-04-13 18:22:20,936 INFO L93 Difference]: Finished difference Result 54688 states and 229973 transitions. [2025-04-13 18:22:20,938 INFO L140 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 40 states. [2025-04-13 18:22:20,939 INFO L79 Accepts]: Start accepts. Automaton has has 10 states, 9 states have (on average 5.0) internal successors, (45), 10 states have internal predecessors, (45), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 45 [2025-04-13 18:22:20,939 INFO L85 Accepts]: Finished accepts. some prefix is accepted. [2025-04-13 18:22:21,229 INFO L225 Difference]: With dead ends: 54688 [2025-04-13 18:22:21,229 INFO L226 Difference]: Without dead ends: 48337 [2025-04-13 18:22:21,254 INFO L436 NwaCegarLoop]: 0 DeclaredPredicates, 71 GetRequests, 32 SyntacticMatches, 0 SemanticMatches, 39 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 449 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=284, Invalid=1356, Unknown=0, NotChecked=0, Total=1640 [2025-04-13 18:22:21,254 INFO L437 NwaCegarLoop]: 37 mSDtfsCounter, 611 mSDsluCounter, 175 mSDsCounter, 0 mSdLazyCounter, 1634 mSolverCounterSat, 6 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.4s Time, 0 mProtectedPredicate, 0 mProtectedAction, 611 SdHoareTripleChecker+Valid, 212 SdHoareTripleChecker+Invalid, 1640 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 6 IncrementalHoareTripleChecker+Valid, 1634 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.5s IncrementalHoareTripleChecker+Time [2025-04-13 18:22:21,254 INFO L438 NwaCegarLoop]: SdHoareTripleChecker [611 Valid, 212 Invalid, 1640 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [6 Valid, 1634 Invalid, 0 Unknown, 0 Unchecked, 0.5s Time] [2025-04-13 18:22:21,298 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 48337 states. [2025-04-13 18:22:21,992 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 48337 to 41170. [2025-04-13 18:22:22,048 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 41170 states, 41169 states have (on average 4.160873472758629) internal successors, (171299), 41169 states have internal predecessors, (171299), 0 states have call successors, (0), 0 states have 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:22:22,203 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 41170 states to 41170 states and 171299 transitions. [2025-04-13 18:22:22,333 INFO L79 Accepts]: Start accepts. Automaton has 41170 states and 171299 transitions. Word has length 45 [2025-04-13 18:22:22,333 INFO L85 Accepts]: Finished accepts. word is rejected. [2025-04-13 18:22:22,333 INFO L485 AbstractCegarLoop]: Abstraction has 41170 states and 171299 transitions. [2025-04-13 18:22:22,333 INFO L486 AbstractCegarLoop]: INTERPOLANT automaton has has 10 states, 9 states have (on average 5.0) internal successors, (45), 10 states have internal predecessors, (45), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-04-13 18:22:22,333 INFO L278 IsEmpty]: Start isEmpty. Operand 41170 states and 171299 transitions. [2025-04-13 18:22:22,640 INFO L284 IsEmpty]: Finished isEmpty. Found accepting run of length 46 [2025-04-13 18:22:22,640 INFO L210 NwaCegarLoop]: Found error trace [2025-04-13 18:22:22,640 INFO L218 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-04-13 18:22:22,640 WARN L466 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable43 [2025-04-13 18:22:22,640 INFO L403 AbstractCegarLoop]: === Iteration 45 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES, ULTIMATE.startErr1INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 2 more)] === [2025-04-13 18:22:22,640 INFO L155 PredicateUnifier]: Initialized classic predicate unifier [2025-04-13 18:22:22,640 INFO L85 PathProgramCache]: Analyzing trace with hash 1729196247, now seen corresponding path program 9 times [2025-04-13 18:22:22,640 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-04-13 18:22:22,640 INFO L324 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [656476290] [2025-04-13 18:22:22,640 INFO L95 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST2 [2025-04-13 18:22:22,641 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-04-13 18:22:22,644 INFO L108 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST2 partitioned 45 statements into 2 equivalence classes. [2025-04-13 18:22:22,647 INFO L111 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST2 issued 1 check-sat command(s) and asserted 44 of 45 statements. [2025-04-13 18:22:22,647 INFO L114 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST2 issued 1 check-sat command(s) [2025-04-13 18:22:22,647 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-04-13 18:22:22,739 INFO L134 CoverageAnalysis]: Checked inductivity of 1 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2025-04-13 18:22:22,739 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-04-13 18:22:22,739 INFO L324 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [656476290] [2025-04-13 18:22:22,739 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [656476290] provided 1 perfect and 0 imperfect interpolant sequences [2025-04-13 18:22:22,739 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-04-13 18:22:22,739 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [9] imperfect sequences [] total 9 [2025-04-13 18:22:22,739 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [847090792] [2025-04-13 18:22:22,739 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-04-13 18:22:22,740 INFO L562 AbstractCegarLoop]: INTERPOLANT automaton has 10 states [2025-04-13 18:22:22,740 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-04-13 18:22:22,740 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 10 interpolants. [2025-04-13 18:22:22,740 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=18, Invalid=72, Unknown=0, NotChecked=0, Total=90 [2025-04-13 18:22:22,740 INFO L87 Difference]: Start difference. First operand 41170 states and 171299 transitions. Second operand has 10 states, 9 states have (on average 5.0) internal successors, (45), 10 states have internal predecessors, (45), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-04-13 18:22:24,041 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-04-13 18:22:24,041 INFO L93 Difference]: Finished difference Result 59886 states and 251548 transitions. [2025-04-13 18:22:24,041 INFO L140 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 45 states. [2025-04-13 18:22:24,041 INFO L79 Accepts]: Start accepts. Automaton has has 10 states, 9 states have (on average 5.0) internal successors, (45), 10 states have internal predecessors, (45), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 45 [2025-04-13 18:22:24,041 INFO L85 Accepts]: Finished accepts. some prefix is accepted. [2025-04-13 18:22:24,343 INFO L225 Difference]: With dead ends: 59886 [2025-04-13 18:22:24,343 INFO L226 Difference]: Without dead ends: 53535 [2025-04-13 18:22:24,375 INFO L436 NwaCegarLoop]: 0 DeclaredPredicates, 81 GetRequests, 37 SyntacticMatches, 0 SemanticMatches, 44 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 603 ImplicationChecksByTransitivity, 0.3s TimeCoverageRelationStatistics Valid=352, Invalid=1718, Unknown=0, NotChecked=0, Total=2070 [2025-04-13 18:22:24,375 INFO L437 NwaCegarLoop]: 35 mSDtfsCounter, 629 mSDsluCounter, 175 mSDsCounter, 0 mSdLazyCounter, 1654 mSolverCounterSat, 5 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.5s Time, 0 mProtectedPredicate, 0 mProtectedAction, 629 SdHoareTripleChecker+Valid, 210 SdHoareTripleChecker+Invalid, 1659 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 5 IncrementalHoareTripleChecker+Valid, 1654 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.6s IncrementalHoareTripleChecker+Time [2025-04-13 18:22:24,375 INFO L438 NwaCegarLoop]: SdHoareTripleChecker [629 Valid, 210 Invalid, 1659 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [5 Valid, 1654 Invalid, 0 Unknown, 0 Unchecked, 0.6s Time] [2025-04-13 18:22:24,425 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 53535 states. [2025-04-13 18:22:25,259 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 53535 to 39532. [2025-04-13 18:22:25,316 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 39532 states, 39531 states have (on average 4.161392325010751) internal successors, (164504), 39531 states have internal predecessors, (164504), 0 states have call successors, (0), 0 states have 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:22:25,431 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 39532 states to 39532 states and 164504 transitions. [2025-04-13 18:22:25,779 INFO L79 Accepts]: Start accepts. Automaton has 39532 states and 164504 transitions. Word has length 45 [2025-04-13 18:22:25,779 INFO L85 Accepts]: Finished accepts. word is rejected. [2025-04-13 18:22:25,779 INFO L485 AbstractCegarLoop]: Abstraction has 39532 states and 164504 transitions. [2025-04-13 18:22:25,779 INFO L486 AbstractCegarLoop]: INTERPOLANT automaton has has 10 states, 9 states have (on average 5.0) internal successors, (45), 10 states have internal predecessors, (45), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-04-13 18:22:25,779 INFO L278 IsEmpty]: Start isEmpty. Operand 39532 states and 164504 transitions. [2025-04-13 18:22:25,860 INFO L284 IsEmpty]: Finished isEmpty. Found accepting run of length 46 [2025-04-13 18:22:25,860 INFO L210 NwaCegarLoop]: Found error trace [2025-04-13 18:22:25,860 INFO L218 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-04-13 18:22:25,860 WARN L466 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable44 [2025-04-13 18:22:25,860 INFO L403 AbstractCegarLoop]: === Iteration 46 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES, ULTIMATE.startErr1INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 2 more)] === [2025-04-13 18:22:25,861 INFO L155 PredicateUnifier]: Initialized classic predicate unifier [2025-04-13 18:22:25,861 INFO L85 PathProgramCache]: Analyzing trace with hash 1780643789, now seen corresponding path program 10 times [2025-04-13 18:22:25,861 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-04-13 18:22:25,861 INFO L324 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [34708437] [2025-04-13 18:22:25,861 INFO L95 rtionOrderModulation]: Changing assertion order to TERMS_WITH_SMALL_CONSTANTS_FIRST [2025-04-13 18:22:25,861 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-04-13 18:22:25,865 INFO L108 AnnotateAndAsserter]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST partitioned 45 statements into 2 equivalence classes. [2025-04-13 18:22:25,866 INFO L111 AnnotateAndAsserter]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST issued 1 check-sat command(s) and asserted 38 of 45 statements. [2025-04-13 18:22:25,866 INFO L114 AnnotateAndAsserter]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST issued 1 check-sat command(s) [2025-04-13 18:22:25,866 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-04-13 18:22:25,950 INFO L134 CoverageAnalysis]: Checked inductivity of 1 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2025-04-13 18:22:25,950 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-04-13 18:22:25,950 INFO L324 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [34708437] [2025-04-13 18:22:25,950 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [34708437] provided 1 perfect and 0 imperfect interpolant sequences [2025-04-13 18:22:25,950 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-04-13 18:22:25,950 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [12] imperfect sequences [] total 12 [2025-04-13 18:22:25,950 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2066152870] [2025-04-13 18:22:25,950 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-04-13 18:22:25,950 INFO L562 AbstractCegarLoop]: INTERPOLANT automaton has 12 states [2025-04-13 18:22:25,950 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-04-13 18:22:25,951 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 12 interpolants. [2025-04-13 18:22:25,951 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=35, Invalid=97, Unknown=0, NotChecked=0, Total=132 [2025-04-13 18:22:25,951 INFO L87 Difference]: Start difference. First operand 39532 states and 164504 transitions. Second operand has 12 states, 12 states have (on average 3.75) internal successors, (45), 12 states have internal predecessors, (45), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-04-13 18:22:27,143 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-04-13 18:22:27,143 INFO L93 Difference]: Finished difference Result 90583 states and 391686 transitions. [2025-04-13 18:22:27,143 INFO L140 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 21 states. [2025-04-13 18:22:27,143 INFO L79 Accepts]: Start accepts. Automaton has has 12 states, 12 states have (on average 3.75) internal successors, (45), 12 states have internal predecessors, (45), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 45 [2025-04-13 18:22:27,143 INFO L85 Accepts]: Finished accepts. some prefix is accepted. [2025-04-13 18:22:27,797 INFO L225 Difference]: With dead ends: 90583 [2025-04-13 18:22:27,797 INFO L226 Difference]: Without dead ends: 80427 [2025-04-13 18:22:27,826 INFO L436 NwaCegarLoop]: 0 DeclaredPredicates, 22 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 20 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 94 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=115, Invalid=347, Unknown=0, NotChecked=0, Total=462 [2025-04-13 18:22:27,827 INFO L437 NwaCegarLoop]: 57 mSDtfsCounter, 364 mSDsluCounter, 271 mSDsCounter, 0 mSdLazyCounter, 1317 mSolverCounterSat, 3 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.4s Time, 0 mProtectedPredicate, 0 mProtectedAction, 364 SdHoareTripleChecker+Valid, 328 SdHoareTripleChecker+Invalid, 1320 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 3 IncrementalHoareTripleChecker+Valid, 1317 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.5s IncrementalHoareTripleChecker+Time [2025-04-13 18:22:27,827 INFO L438 NwaCegarLoop]: SdHoareTripleChecker [364 Valid, 328 Invalid, 1320 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [3 Valid, 1317 Invalid, 0 Unknown, 0 Unchecked, 0.5s Time] [2025-04-13 18:22:27,890 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 80427 states. [2025-04-13 18:22:28,785 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 80427 to 41147. [2025-04-13 18:22:28,842 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 41147 states, 41146 states have (on average 4.161959850289214) internal successors, (171248), 41146 states have internal predecessors, (171248), 0 states have call successors, (0), 0 states have 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:22:29,160 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 41147 states to 41147 states and 171248 transitions. [2025-04-13 18:22:29,312 INFO L79 Accepts]: Start accepts. Automaton has 41147 states and 171248 transitions. Word has length 45 [2025-04-13 18:22:29,313 INFO L85 Accepts]: Finished accepts. word is rejected. [2025-04-13 18:22:29,313 INFO L485 AbstractCegarLoop]: Abstraction has 41147 states and 171248 transitions. [2025-04-13 18:22:29,313 INFO L486 AbstractCegarLoop]: INTERPOLANT automaton has has 12 states, 12 states have (on average 3.75) internal successors, (45), 12 states have internal predecessors, (45), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-04-13 18:22:29,313 INFO L278 IsEmpty]: Start isEmpty. Operand 41147 states and 171248 transitions. [2025-04-13 18:22:29,394 INFO L284 IsEmpty]: Finished isEmpty. Found accepting run of length 46 [2025-04-13 18:22:29,394 INFO L210 NwaCegarLoop]: Found error trace [2025-04-13 18:22:29,394 INFO L218 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-04-13 18:22:29,395 WARN L466 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable45 [2025-04-13 18:22:29,395 INFO L403 AbstractCegarLoop]: === Iteration 47 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES, ULTIMATE.startErr1INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 2 more)] === [2025-04-13 18:22:29,395 INFO L155 PredicateUnifier]: Initialized classic predicate unifier [2025-04-13 18:22:29,395 INFO L85 PathProgramCache]: Analyzing trace with hash 640723113, now seen corresponding path program 11 times [2025-04-13 18:22:29,395 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-04-13 18:22:29,395 INFO L324 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [623006784] [2025-04-13 18:22:29,395 INFO L95 rtionOrderModulation]: Changing assertion order to INSIDE_LOOP_FIRST1 [2025-04-13 18:22:29,395 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-04-13 18:22:29,399 INFO L108 AnnotateAndAsserter]: Assert order INSIDE_LOOP_FIRST1 partitioned 45 statements into 2 equivalence classes. [2025-04-13 18:22:29,401 INFO L111 AnnotateAndAsserter]: Assert order INSIDE_LOOP_FIRST1 issued 2 check-sat command(s) and asserted 45 of 45 statements. [2025-04-13 18:22:29,402 INFO L114 AnnotateAndAsserter]: Assert order INSIDE_LOOP_FIRST1 issued 2 check-sat command(s) [2025-04-13 18:22:29,402 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-04-13 18:22:29,500 INFO L134 CoverageAnalysis]: Checked inductivity of 1 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2025-04-13 18:22:29,500 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-04-13 18:22:29,500 INFO L324 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [623006784] [2025-04-13 18:22:29,500 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [623006784] provided 1 perfect and 0 imperfect interpolant sequences [2025-04-13 18:22:29,500 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-04-13 18:22:29,500 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [9] imperfect sequences [] total 9 [2025-04-13 18:22:29,500 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1891957375] [2025-04-13 18:22:29,500 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-04-13 18:22:29,501 INFO L562 AbstractCegarLoop]: INTERPOLANT automaton has 10 states [2025-04-13 18:22:29,501 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-04-13 18:22:29,501 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 10 interpolants. [2025-04-13 18:22:29,501 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=18, Invalid=72, Unknown=0, NotChecked=0, Total=90 [2025-04-13 18:22:29,501 INFO L87 Difference]: Start difference. First operand 41147 states and 171248 transitions. Second operand has 10 states, 9 states have (on average 5.0) internal successors, (45), 10 states have internal predecessors, (45), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-04-13 18:22:31,030 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-04-13 18:22:31,031 INFO L93 Difference]: Finished difference Result 66248 states and 277579 transitions. [2025-04-13 18:22:31,031 INFO L140 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 50 states. [2025-04-13 18:22:31,031 INFO L79 Accepts]: Start accepts. Automaton has has 10 states, 9 states have (on average 5.0) internal successors, (45), 10 states have internal predecessors, (45), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 45 [2025-04-13 18:22:31,031 INFO L85 Accepts]: Finished accepts. some prefix is accepted. [2025-04-13 18:22:31,390 INFO L225 Difference]: With dead ends: 66248 [2025-04-13 18:22:31,390 INFO L226 Difference]: Without dead ends: 60611 [2025-04-13 18:22:31,427 INFO L436 NwaCegarLoop]: 0 DeclaredPredicates, 91 GetRequests, 42 SyntacticMatches, 0 SemanticMatches, 49 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 787 ImplicationChecksByTransitivity, 0.4s TimeCoverageRelationStatistics Valid=452, Invalid=2098, Unknown=0, NotChecked=0, Total=2550 [2025-04-13 18:22:31,427 INFO L437 NwaCegarLoop]: 30 mSDtfsCounter, 494 mSDsluCounter, 161 mSDsCounter, 0 mSdLazyCounter, 1683 mSolverCounterSat, 7 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.5s Time, 0 mProtectedPredicate, 0 mProtectedAction, 494 SdHoareTripleChecker+Valid, 191 SdHoareTripleChecker+Invalid, 1690 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 7 IncrementalHoareTripleChecker+Valid, 1683 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.6s IncrementalHoareTripleChecker+Time [2025-04-13 18:22:31,427 INFO L438 NwaCegarLoop]: SdHoareTripleChecker [494 Valid, 191 Invalid, 1690 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [7 Valid, 1683 Invalid, 0 Unknown, 0 Unchecked, 0.6s Time] [2025-04-13 18:22:31,661 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 60611 states. [2025-04-13 18:22:32,376 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 60611 to 41717. [2025-04-13 18:22:32,437 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 41717 states, 41716 states have (on average 4.167825294850896) internal successors, (173865), 41716 states have internal predecessors, (173865), 0 states have call successors, (0), 0 states have 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:22:32,562 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 41717 states to 41717 states and 173865 transitions. [2025-04-13 18:22:32,714 INFO L79 Accepts]: Start accepts. Automaton has 41717 states and 173865 transitions. Word has length 45 [2025-04-13 18:22:32,714 INFO L85 Accepts]: Finished accepts. word is rejected. [2025-04-13 18:22:32,714 INFO L485 AbstractCegarLoop]: Abstraction has 41717 states and 173865 transitions. [2025-04-13 18:22:32,714 INFO L486 AbstractCegarLoop]: INTERPOLANT automaton has has 10 states, 9 states have (on average 5.0) internal successors, (45), 10 states have internal predecessors, (45), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-04-13 18:22:32,714 INFO L278 IsEmpty]: Start isEmpty. Operand 41717 states and 173865 transitions. [2025-04-13 18:22:32,796 INFO L284 IsEmpty]: Finished isEmpty. Found accepting run of length 46 [2025-04-13 18:22:32,796 INFO L210 NwaCegarLoop]: Found error trace [2025-04-13 18:22:32,796 INFO L218 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-04-13 18:22:32,796 WARN L466 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable46 [2025-04-13 18:22:32,796 INFO L403 AbstractCegarLoop]: === Iteration 48 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES, ULTIMATE.startErr1INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 2 more)] === [2025-04-13 18:22:32,796 INFO L155 PredicateUnifier]: Initialized classic predicate unifier [2025-04-13 18:22:32,796 INFO L85 PathProgramCache]: Analyzing trace with hash 468741591, now seen corresponding path program 12 times [2025-04-13 18:22:32,796 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-04-13 18:22:32,797 INFO L324 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [636830837] [2025-04-13 18:22:32,797 INFO L95 rtionOrderModulation]: Changing assertion order to MIX_INSIDE_OUTSIDE [2025-04-13 18:22:32,797 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-04-13 18:22:32,800 INFO L108 AnnotateAndAsserter]: Assert order MIX_INSIDE_OUTSIDE partitioned 45 statements into 2 equivalence classes. [2025-04-13 18:22:32,803 INFO L111 AnnotateAndAsserter]: Assert order MIX_INSIDE_OUTSIDE issued 1 check-sat command(s) and asserted 44 of 45 statements. [2025-04-13 18:22:32,803 INFO L114 AnnotateAndAsserter]: Assert order MIX_INSIDE_OUTSIDE issued 1 check-sat command(s) [2025-04-13 18:22:32,803 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-04-13 18:22:32,892 INFO L134 CoverageAnalysis]: Checked inductivity of 1 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2025-04-13 18:22:32,892 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-04-13 18:22:32,892 INFO L324 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [636830837] [2025-04-13 18:22:32,892 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [636830837] provided 1 perfect and 0 imperfect interpolant sequences [2025-04-13 18:22:32,892 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-04-13 18:22:32,893 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [9] imperfect sequences [] total 9 [2025-04-13 18:22:32,893 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1661989897] [2025-04-13 18:22:32,893 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-04-13 18:22:32,893 INFO L562 AbstractCegarLoop]: INTERPOLANT automaton has 10 states [2025-04-13 18:22:32,893 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-04-13 18:22:32,893 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 10 interpolants. [2025-04-13 18:22:32,893 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=17, Invalid=73, Unknown=0, NotChecked=0, Total=90 [2025-04-13 18:22:32,893 INFO L87 Difference]: Start difference. First operand 41717 states and 173865 transitions. Second operand has 10 states, 9 states have (on average 5.0) internal successors, (45), 10 states have internal predecessors, (45), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-04-13 18:22:34,631 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-04-13 18:22:34,631 INFO L93 Difference]: Finished difference Result 67645 states and 287421 transitions. [2025-04-13 18:22:34,631 INFO L140 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 47 states. [2025-04-13 18:22:34,631 INFO L79 Accepts]: Start accepts. Automaton has has 10 states, 9 states have (on average 5.0) internal successors, (45), 10 states have internal predecessors, (45), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 45 [2025-04-13 18:22:34,632 INFO L85 Accepts]: Finished accepts. some prefix is accepted. [2025-04-13 18:22:35,003 INFO L225 Difference]: With dead ends: 67645 [2025-04-13 18:22:35,003 INFO L226 Difference]: Without dead ends: 62834 [2025-04-13 18:22:35,023 INFO L436 NwaCegarLoop]: 0 DeclaredPredicates, 83 GetRequests, 38 SyntacticMatches, 0 SemanticMatches, 45 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 612 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=345, Invalid=1817, Unknown=0, NotChecked=0, Total=2162 [2025-04-13 18:22:35,023 INFO L437 NwaCegarLoop]: 34 mSDtfsCounter, 462 mSDsluCounter, 182 mSDsCounter, 0 mSdLazyCounter, 1957 mSolverCounterSat, 9 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 1.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 462 SdHoareTripleChecker+Valid, 216 SdHoareTripleChecker+Invalid, 1966 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 9 IncrementalHoareTripleChecker+Valid, 1957 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 1.1s IncrementalHoareTripleChecker+Time [2025-04-13 18:22:35,024 INFO L438 NwaCegarLoop]: SdHoareTripleChecker [462 Valid, 216 Invalid, 1966 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [9 Valid, 1957 Invalid, 0 Unknown, 0 Unchecked, 1.1s Time] [2025-04-13 18:22:35,077 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 62834 states. [2025-04-13 18:22:36,106 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 62834 to 41803. [2025-04-13 18:22:36,156 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 41803 states, 41802 states have (on average 4.1688914406009285) internal successors, (174268), 41802 states have internal predecessors, (174268), 0 states have call successors, (0), 0 states have 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:22:36,278 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 41803 states to 41803 states and 174268 transitions. [2025-04-13 18:22:36,435 INFO L79 Accepts]: Start accepts. Automaton has 41803 states and 174268 transitions. Word has length 45 [2025-04-13 18:22:36,435 INFO L85 Accepts]: Finished accepts. word is rejected. [2025-04-13 18:22:36,435 INFO L485 AbstractCegarLoop]: Abstraction has 41803 states and 174268 transitions. [2025-04-13 18:22:36,435 INFO L486 AbstractCegarLoop]: INTERPOLANT automaton has has 10 states, 9 states have (on average 5.0) internal successors, (45), 10 states have internal predecessors, (45), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-04-13 18:22:36,435 INFO L278 IsEmpty]: Start isEmpty. Operand 41803 states and 174268 transitions. [2025-04-13 18:22:36,514 INFO L284 IsEmpty]: Finished isEmpty. Found accepting run of length 46 [2025-04-13 18:22:36,514 INFO L210 NwaCegarLoop]: Found error trace [2025-04-13 18:22:36,514 INFO L218 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-04-13 18:22:36,514 WARN L466 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable47 [2025-04-13 18:22:36,514 INFO L403 AbstractCegarLoop]: === Iteration 49 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES, ULTIMATE.startErr1INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 2 more)] === [2025-04-13 18:22:36,514 INFO L155 PredicateUnifier]: Initialized classic predicate unifier [2025-04-13 18:22:36,514 INFO L85 PathProgramCache]: Analyzing trace with hash -204636995, now seen corresponding path program 13 times [2025-04-13 18:22:36,514 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-04-13 18:22:36,514 INFO L324 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1106787367] [2025-04-13 18:22:36,514 INFO L95 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2025-04-13 18:22:36,514 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-04-13 18:22:36,518 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 45 statements into 1 equivalence classes. [2025-04-13 18:22:36,521 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 45 of 45 statements. [2025-04-13 18:22:36,521 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-04-13 18:22:36,521 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-04-13 18:22:36,636 INFO L134 CoverageAnalysis]: Checked inductivity of 1 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2025-04-13 18:22:36,637 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-04-13 18:22:36,637 INFO L324 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1106787367] [2025-04-13 18:22:36,637 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1106787367] provided 1 perfect and 0 imperfect interpolant sequences [2025-04-13 18:22:36,637 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-04-13 18:22:36,637 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [9] imperfect sequences [] total 9 [2025-04-13 18:22:36,637 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [440169569] [2025-04-13 18:22:36,637 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-04-13 18:22:36,637 INFO L562 AbstractCegarLoop]: INTERPOLANT automaton has 10 states [2025-04-13 18:22:36,637 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-04-13 18:22:36,637 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 10 interpolants. [2025-04-13 18:22:36,637 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=17, Invalid=73, Unknown=0, NotChecked=0, Total=90 [2025-04-13 18:22:36,637 INFO L87 Difference]: Start difference. First operand 41803 states and 174268 transitions. Second operand has 10 states, 9 states have (on average 5.0) internal successors, (45), 10 states have internal predecessors, (45), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-04-13 18:22:37,820 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-04-13 18:22:37,820 INFO L93 Difference]: Finished difference Result 51627 states and 217100 transitions. [2025-04-13 18:22:37,820 INFO L140 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 34 states. [2025-04-13 18:22:37,820 INFO L79 Accepts]: Start accepts. Automaton has has 10 states, 9 states have (on average 5.0) internal successors, (45), 10 states have internal predecessors, (45), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 45 [2025-04-13 18:22:37,820 INFO L85 Accepts]: Finished accepts. some prefix is accepted. [2025-04-13 18:22:38,136 INFO L225 Difference]: With dead ends: 51627 [2025-04-13 18:22:38,136 INFO L226 Difference]: Without dead ends: 47303 [2025-04-13 18:22:38,164 INFO L436 NwaCegarLoop]: 0 DeclaredPredicates, 57 GetRequests, 25 SyntacticMatches, 0 SemanticMatches, 32 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 256 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=201, Invalid=921, Unknown=0, NotChecked=0, Total=1122 [2025-04-13 18:22:38,164 INFO L437 NwaCegarLoop]: 32 mSDtfsCounter, 378 mSDsluCounter, 175 mSDsCounter, 0 mSdLazyCounter, 1647 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.6s Time, 0 mProtectedPredicate, 0 mProtectedAction, 378 SdHoareTripleChecker+Valid, 207 SdHoareTripleChecker+Invalid, 1647 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 1647 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.7s IncrementalHoareTripleChecker+Time [2025-04-13 18:22:38,164 INFO L438 NwaCegarLoop]: SdHoareTripleChecker [378 Valid, 207 Invalid, 1647 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 1647 Invalid, 0 Unknown, 0 Unchecked, 0.7s Time] [2025-04-13 18:22:38,212 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 47303 states. [2025-04-13 18:22:39,048 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 47303 to 41767. [2025-04-13 18:22:39,104 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 41767 states, 41766 states have (on average 4.169420102475698) internal successors, (174140), 41766 states have internal predecessors, (174140), 0 states have call successors, (0), 0 states have 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:22:39,239 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 41767 states to 41767 states and 174140 transitions. [2025-04-13 18:22:39,387 INFO L79 Accepts]: Start accepts. Automaton has 41767 states and 174140 transitions. Word has length 45 [2025-04-13 18:22:39,387 INFO L85 Accepts]: Finished accepts. word is rejected. [2025-04-13 18:22:39,387 INFO L485 AbstractCegarLoop]: Abstraction has 41767 states and 174140 transitions. [2025-04-13 18:22:39,387 INFO L486 AbstractCegarLoop]: INTERPOLANT automaton has has 10 states, 9 states have (on average 5.0) internal successors, (45), 10 states have internal predecessors, (45), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-04-13 18:22:39,387 INFO L278 IsEmpty]: Start isEmpty. Operand 41767 states and 174140 transitions. [2025-04-13 18:22:39,465 INFO L284 IsEmpty]: Finished isEmpty. Found accepting run of length 46 [2025-04-13 18:22:39,465 INFO L210 NwaCegarLoop]: Found error trace [2025-04-13 18:22:39,465 INFO L218 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-04-13 18:22:39,465 WARN L466 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable48 [2025-04-13 18:22:39,465 INFO L403 AbstractCegarLoop]: === Iteration 50 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES, ULTIMATE.startErr1INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 2 more)] === [2025-04-13 18:22:39,465 INFO L155 PredicateUnifier]: Initialized classic predicate unifier [2025-04-13 18:22:39,466 INFO L85 PathProgramCache]: Analyzing trace with hash -769245819, now seen corresponding path program 14 times [2025-04-13 18:22:39,466 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-04-13 18:22:39,466 INFO L324 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1094992901] [2025-04-13 18:22:39,466 INFO L95 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST1 [2025-04-13 18:22:39,466 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-04-13 18:22:39,470 INFO L108 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 partitioned 45 statements into 2 equivalence classes. [2025-04-13 18:22:39,472 INFO L111 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 issued 1 check-sat command(s) and asserted 44 of 45 statements. [2025-04-13 18:22:39,472 INFO L114 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 issued 1 check-sat command(s) [2025-04-13 18:22:39,472 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-04-13 18:22:39,565 INFO L134 CoverageAnalysis]: Checked inductivity of 1 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2025-04-13 18:22:39,566 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-04-13 18:22:39,566 INFO L324 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1094992901] [2025-04-13 18:22:39,566 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1094992901] provided 1 perfect and 0 imperfect interpolant sequences [2025-04-13 18:22:39,566 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-04-13 18:22:39,566 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2025-04-13 18:22:39,566 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2147144595] [2025-04-13 18:22:39,566 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-04-13 18:22:39,566 INFO L562 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2025-04-13 18:22:39,566 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-04-13 18:22:39,566 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2025-04-13 18:22:39,566 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=10, Invalid=20, Unknown=0, NotChecked=0, Total=30 [2025-04-13 18:22:39,566 INFO L87 Difference]: Start difference. First operand 41767 states and 174140 transitions. Second operand has 6 states, 5 states have (on average 9.0) internal successors, (45), 5 states have internal predecessors, (45), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-04-13 18:22:40,185 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-04-13 18:22:40,185 INFO L93 Difference]: Finished difference Result 45678 states and 190193 transitions. [2025-04-13 18:22:40,185 INFO L140 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2025-04-13 18:22:40,185 INFO L79 Accepts]: Start accepts. Automaton has has 6 states, 5 states have (on average 9.0) internal successors, (45), 5 states have internal predecessors, (45), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 45 [2025-04-13 18:22:40,185 INFO L85 Accepts]: Finished accepts. some prefix is accepted. [2025-04-13 18:22:40,433 INFO L225 Difference]: With dead ends: 45678 [2025-04-13 18:22:40,433 INFO L226 Difference]: Without dead ends: 37779 [2025-04-13 18:22:40,455 INFO L436 NwaCegarLoop]: 0 DeclaredPredicates, 7 GetRequests, 0 SyntacticMatches, 0 SemanticMatches, 7 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 3 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=28, Invalid=44, Unknown=0, NotChecked=0, Total=72 [2025-04-13 18:22:40,456 INFO L437 NwaCegarLoop]: 23 mSDtfsCounter, 94 mSDsluCounter, 48 mSDsCounter, 0 mSdLazyCounter, 309 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 94 SdHoareTripleChecker+Valid, 71 SdHoareTripleChecker+Invalid, 309 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 309 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2025-04-13 18:22:40,456 INFO L438 NwaCegarLoop]: SdHoareTripleChecker [94 Valid, 71 Invalid, 309 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 309 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2025-04-13 18:22:40,488 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 37779 states. [2025-04-13 18:22:41,094 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 37779 to 37779. [2025-04-13 18:22:41,146 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 37779 states, 37778 states have (on average 4.0960082587749485) internal successors, (154739), 37778 states have internal predecessors, (154739), 0 states have call successors, (0), 0 states have 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:22:41,309 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 37779 states to 37779 states and 154739 transitions. [2025-04-13 18:22:41,460 INFO L79 Accepts]: Start accepts. Automaton has 37779 states and 154739 transitions. Word has length 45 [2025-04-13 18:22:41,460 INFO L85 Accepts]: Finished accepts. word is rejected. [2025-04-13 18:22:41,460 INFO L485 AbstractCegarLoop]: Abstraction has 37779 states and 154739 transitions. [2025-04-13 18:22:41,460 INFO L486 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 5 states have (on average 9.0) internal successors, (45), 5 states have internal predecessors, (45), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-04-13 18:22:41,460 INFO L278 IsEmpty]: Start isEmpty. Operand 37779 states and 154739 transitions. [2025-04-13 18:22:41,546 INFO L284 IsEmpty]: Finished isEmpty. Found accepting run of length 46 [2025-04-13 18:22:41,546 INFO L210 NwaCegarLoop]: Found error trace [2025-04-13 18:22:41,546 INFO L218 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-04-13 18:22:41,546 WARN L466 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable49 [2025-04-13 18:22:41,546 INFO L403 AbstractCegarLoop]: === Iteration 51 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES, ULTIMATE.startErr1INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 2 more)] === [2025-04-13 18:22:41,546 INFO L155 PredicateUnifier]: Initialized classic predicate unifier [2025-04-13 18:22:41,546 INFO L85 PathProgramCache]: Analyzing trace with hash -903187940, now seen corresponding path program 12 times [2025-04-13 18:22:41,547 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-04-13 18:22:41,547 INFO L324 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1635031698] [2025-04-13 18:22:41,547 INFO L95 rtionOrderModulation]: Changing assertion order to MIX_INSIDE_OUTSIDE [2025-04-13 18:22:41,547 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-04-13 18:22:41,552 INFO L108 AnnotateAndAsserter]: Assert order MIX_INSIDE_OUTSIDE partitioned 45 statements into 2 equivalence classes. [2025-04-13 18:22:41,555 INFO L111 AnnotateAndAsserter]: Assert order MIX_INSIDE_OUTSIDE issued 1 check-sat command(s) and asserted 44 of 45 statements. [2025-04-13 18:22:41,555 INFO L114 AnnotateAndAsserter]: Assert order MIX_INSIDE_OUTSIDE issued 1 check-sat command(s) [2025-04-13 18:22:41,555 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-04-13 18:22:41,928 INFO L134 CoverageAnalysis]: Checked inductivity of 1 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2025-04-13 18:22:41,928 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-04-13 18:22:41,928 INFO L324 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1635031698] [2025-04-13 18:22:41,928 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1635031698] provided 1 perfect and 0 imperfect interpolant sequences [2025-04-13 18:22:41,928 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-04-13 18:22:41,928 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [12] imperfect sequences [] total 12 [2025-04-13 18:22:41,928 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [550815271] [2025-04-13 18:22:41,928 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-04-13 18:22:41,928 INFO L562 AbstractCegarLoop]: INTERPOLANT automaton has 13 states [2025-04-13 18:22:41,928 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-04-13 18:22:41,929 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 13 interpolants. [2025-04-13 18:22:41,929 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=30, Invalid=126, Unknown=0, NotChecked=0, Total=156 [2025-04-13 18:22:41,929 INFO L87 Difference]: Start difference. First operand 37779 states and 154739 transitions. Second operand has 13 states, 12 states have (on average 3.75) internal successors, (45), 13 states have internal predecessors, (45), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-04-13 18:22:43,210 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-04-13 18:22:43,210 INFO L93 Difference]: Finished difference Result 60581 states and 256941 transitions. [2025-04-13 18:22:43,210 INFO L140 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 30 states. [2025-04-13 18:22:43,210 INFO L79 Accepts]: Start accepts. Automaton has has 13 states, 12 states have (on average 3.75) internal successors, (45), 13 states have internal predecessors, (45), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 45 [2025-04-13 18:22:43,210 INFO L85 Accepts]: Finished accepts. some prefix is accepted. [2025-04-13 18:22:43,554 INFO L225 Difference]: With dead ends: 60581 [2025-04-13 18:22:43,555 INFO L226 Difference]: Without dead ends: 58084 [2025-04-13 18:22:43,577 INFO L436 NwaCegarLoop]: 0 DeclaredPredicates, 34 GetRequests, 3 SyntacticMatches, 0 SemanticMatches, 31 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 240 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=182, Invalid=874, Unknown=0, NotChecked=0, Total=1056 [2025-04-13 18:22:43,578 INFO L437 NwaCegarLoop]: 60 mSDtfsCounter, 398 mSDsluCounter, 375 mSDsCounter, 0 mSdLazyCounter, 2022 mSolverCounterSat, 1 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.5s Time, 0 mProtectedPredicate, 0 mProtectedAction, 398 SdHoareTripleChecker+Valid, 435 SdHoareTripleChecker+Invalid, 2023 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 1 IncrementalHoareTripleChecker+Valid, 2022 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.6s IncrementalHoareTripleChecker+Time [2025-04-13 18:22:43,578 INFO L438 NwaCegarLoop]: SdHoareTripleChecker [398 Valid, 435 Invalid, 2023 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [1 Valid, 2022 Invalid, 0 Unknown, 0 Unchecked, 0.6s Time] [2025-04-13 18:22:43,631 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 58084 states. [2025-04-13 18:22:44,322 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 58084 to 38031. [2025-04-13 18:22:44,374 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 38031 states, 38030 states have (on average 4.094556928740468) internal successors, (155716), 38030 states have internal predecessors, (155716), 0 states have call successors, (0), 0 states have 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:22:44,492 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 38031 states to 38031 states and 155716 transitions. [2025-04-13 18:22:44,660 INFO L79 Accepts]: Start accepts. Automaton has 38031 states and 155716 transitions. Word has length 45 [2025-04-13 18:22:44,660 INFO L85 Accepts]: Finished accepts. word is rejected. [2025-04-13 18:22:44,660 INFO L485 AbstractCegarLoop]: Abstraction has 38031 states and 155716 transitions. [2025-04-13 18:22:44,660 INFO L486 AbstractCegarLoop]: INTERPOLANT automaton has has 13 states, 12 states have (on average 3.75) internal successors, (45), 13 states have internal predecessors, (45), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-04-13 18:22:44,660 INFO L278 IsEmpty]: Start isEmpty. Operand 38031 states and 155716 transitions. [2025-04-13 18:22:44,731 INFO L284 IsEmpty]: Finished isEmpty. Found accepting run of length 46 [2025-04-13 18:22:44,731 INFO L210 NwaCegarLoop]: Found error trace [2025-04-13 18:22:44,731 INFO L218 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-04-13 18:22:44,731 WARN L466 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable50 [2025-04-13 18:22:44,732 INFO L403 AbstractCegarLoop]: === Iteration 52 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES, ULTIMATE.startErr1INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 2 more)] === [2025-04-13 18:22:44,732 INFO L155 PredicateUnifier]: Initialized classic predicate unifier [2025-04-13 18:22:44,732 INFO L85 PathProgramCache]: Analyzing trace with hash 339803932, now seen corresponding path program 13 times [2025-04-13 18:22:44,732 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-04-13 18:22:44,732 INFO L324 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1627010033] [2025-04-13 18:22:44,732 INFO L95 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2025-04-13 18:22:44,732 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-04-13 18:22:44,736 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 45 statements into 1 equivalence classes. [2025-04-13 18:22:44,739 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 45 of 45 statements. [2025-04-13 18:22:44,739 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-04-13 18:22:44,739 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-04-13 18:22:45,023 INFO L134 CoverageAnalysis]: Checked inductivity of 1 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2025-04-13 18:22:45,024 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-04-13 18:22:45,024 INFO L324 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1627010033] [2025-04-13 18:22:45,024 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1627010033] provided 1 perfect and 0 imperfect interpolant sequences [2025-04-13 18:22:45,024 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-04-13 18:22:45,024 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [9] imperfect sequences [] total 9 [2025-04-13 18:22:45,024 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [811679324] [2025-04-13 18:22:45,024 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-04-13 18:22:45,024 INFO L562 AbstractCegarLoop]: INTERPOLANT automaton has 10 states [2025-04-13 18:22:45,024 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-04-13 18:22:45,026 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 10 interpolants. [2025-04-13 18:22:45,026 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=18, Invalid=72, Unknown=0, NotChecked=0, Total=90 [2025-04-13 18:22:45,026 INFO L87 Difference]: Start difference. First operand 38031 states and 155716 transitions. Second operand has 10 states, 9 states have (on average 5.0) internal successors, (45), 10 states have internal predecessors, (45), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-04-13 18:22:46,040 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-04-13 18:22:46,040 INFO L93 Difference]: Finished difference Result 50034 states and 206304 transitions. [2025-04-13 18:22:46,041 INFO L140 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 32 states. [2025-04-13 18:22:46,041 INFO L79 Accepts]: Start accepts. Automaton has has 10 states, 9 states have (on average 5.0) internal successors, (45), 10 states have internal predecessors, (45), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 45 [2025-04-13 18:22:46,041 INFO L85 Accepts]: Finished accepts. some prefix is accepted. [2025-04-13 18:22:46,542 INFO L225 Difference]: With dead ends: 50034 [2025-04-13 18:22:46,542 INFO L226 Difference]: Without dead ends: 47432 [2025-04-13 18:22:46,557 INFO L436 NwaCegarLoop]: 0 DeclaredPredicates, 55 GetRequests, 24 SyntacticMatches, 0 SemanticMatches, 31 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 244 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=191, Invalid=865, Unknown=0, NotChecked=0, Total=1056 [2025-04-13 18:22:46,558 INFO L437 NwaCegarLoop]: 31 mSDtfsCounter, 436 mSDsluCounter, 164 mSDsCounter, 0 mSdLazyCounter, 1608 mSolverCounterSat, 3 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.5s Time, 0 mProtectedPredicate, 0 mProtectedAction, 436 SdHoareTripleChecker+Valid, 195 SdHoareTripleChecker+Invalid, 1611 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 3 IncrementalHoareTripleChecker+Valid, 1608 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.6s IncrementalHoareTripleChecker+Time [2025-04-13 18:22:46,558 INFO L438 NwaCegarLoop]: SdHoareTripleChecker [436 Valid, 195 Invalid, 1611 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [3 Valid, 1608 Invalid, 0 Unknown, 0 Unchecked, 0.6s Time] [2025-04-13 18:22:46,598 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 47432 states. [2025-04-13 18:22:47,194 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 47432 to 40475. [2025-04-13 18:22:47,249 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 40475 states, 40474 states have (on average 4.087760043484706) internal successors, (165448), 40474 states have internal predecessors, (165448), 0 states have call successors, (0), 0 states have 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:22:47,364 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 40475 states to 40475 states and 165448 transitions. [2025-04-13 18:22:47,522 INFO L79 Accepts]: Start accepts. Automaton has 40475 states and 165448 transitions. Word has length 45 [2025-04-13 18:22:47,522 INFO L85 Accepts]: Finished accepts. word is rejected. [2025-04-13 18:22:47,522 INFO L485 AbstractCegarLoop]: Abstraction has 40475 states and 165448 transitions. [2025-04-13 18:22:47,522 INFO L486 AbstractCegarLoop]: INTERPOLANT automaton has has 10 states, 9 states have (on average 5.0) internal successors, (45), 10 states have internal predecessors, (45), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-04-13 18:22:47,522 INFO L278 IsEmpty]: Start isEmpty. Operand 40475 states and 165448 transitions. [2025-04-13 18:22:47,597 INFO L284 IsEmpty]: Finished isEmpty. Found accepting run of length 46 [2025-04-13 18:22:47,597 INFO L210 NwaCegarLoop]: Found error trace [2025-04-13 18:22:47,598 INFO L218 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-04-13 18:22:47,598 WARN L466 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable51 [2025-04-13 18:22:47,598 INFO L403 AbstractCegarLoop]: === Iteration 53 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES, ULTIMATE.startErr1INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 2 more)] === [2025-04-13 18:22:47,598 INFO L155 PredicateUnifier]: Initialized classic predicate unifier [2025-04-13 18:22:47,598 INFO L85 PathProgramCache]: Analyzing trace with hash -676697704, now seen corresponding path program 14 times [2025-04-13 18:22:47,598 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-04-13 18:22:47,598 INFO L324 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [272125234] [2025-04-13 18:22:47,598 INFO L95 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST1 [2025-04-13 18:22:47,598 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-04-13 18:22:47,602 INFO L108 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 partitioned 45 statements into 2 equivalence classes. [2025-04-13 18:22:47,605 INFO L111 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 issued 1 check-sat command(s) and asserted 44 of 45 statements. [2025-04-13 18:22:47,605 INFO L114 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 issued 1 check-sat command(s) [2025-04-13 18:22:47,605 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-04-13 18:22:47,759 INFO L134 CoverageAnalysis]: Checked inductivity of 1 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2025-04-13 18:22:47,759 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-04-13 18:22:47,759 INFO L324 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [272125234] [2025-04-13 18:22:47,759 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [272125234] provided 1 perfect and 0 imperfect interpolant sequences [2025-04-13 18:22:47,759 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-04-13 18:22:47,759 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [13] imperfect sequences [] total 13 [2025-04-13 18:22:47,759 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1305053594] [2025-04-13 18:22:47,759 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-04-13 18:22:47,760 INFO L562 AbstractCegarLoop]: INTERPOLANT automaton has 14 states [2025-04-13 18:22:47,760 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-04-13 18:22:47,760 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 14 interpolants. [2025-04-13 18:22:47,760 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=32, Invalid=150, Unknown=0, NotChecked=0, Total=182 [2025-04-13 18:22:47,760 INFO L87 Difference]: Start difference. First operand 40475 states and 165448 transitions. Second operand has 14 states, 13 states have (on average 3.4615384615384617) internal successors, (45), 14 states have internal predecessors, (45), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-04-13 18:22:49,299 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-04-13 18:22:49,299 INFO L93 Difference]: Finished difference Result 62951 states and 267089 transitions. [2025-04-13 18:22:49,299 INFO L140 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 32 states. [2025-04-13 18:22:49,299 INFO L79 Accepts]: Start accepts. Automaton has has 14 states, 13 states have (on average 3.4615384615384617) internal successors, (45), 14 states have internal predecessors, (45), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 45 [2025-04-13 18:22:49,299 INFO L85 Accepts]: Finished accepts. some prefix is accepted. [2025-04-13 18:22:49,907 INFO L225 Difference]: With dead ends: 62951 [2025-04-13 18:22:49,907 INFO L226 Difference]: Without dead ends: 60667 [2025-04-13 18:22:49,926 INFO L436 NwaCegarLoop]: 0 DeclaredPredicates, 37 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 35 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 308 ImplicationChecksByTransitivity, 0.3s TimeCoverageRelationStatistics Valid=226, Invalid=1106, Unknown=0, NotChecked=0, Total=1332 [2025-04-13 18:22:49,926 INFO L437 NwaCegarLoop]: 61 mSDtfsCounter, 434 mSDsluCounter, 439 mSDsCounter, 0 mSdLazyCounter, 2458 mSolverCounterSat, 9 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.7s Time, 0 mProtectedPredicate, 0 mProtectedAction, 434 SdHoareTripleChecker+Valid, 500 SdHoareTripleChecker+Invalid, 2467 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 9 IncrementalHoareTripleChecker+Valid, 2458 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.8s IncrementalHoareTripleChecker+Time [2025-04-13 18:22:49,926 INFO L438 NwaCegarLoop]: SdHoareTripleChecker [434 Valid, 500 Invalid, 2467 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [9 Valid, 2458 Invalid, 0 Unknown, 0 Unchecked, 0.8s Time] [2025-04-13 18:22:49,987 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 60667 states. [2025-04-13 18:22:50,785 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 60667 to 40859. [2025-04-13 18:22:50,840 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 40859 states, 40858 states have (on average 4.090557540750893) internal successors, (167132), 40858 states have internal predecessors, (167132), 0 states have call successors, (0), 0 states have 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:22:50,965 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 40859 states to 40859 states and 167132 transitions. [2025-04-13 18:22:51,133 INFO L79 Accepts]: Start accepts. Automaton has 40859 states and 167132 transitions. Word has length 45 [2025-04-13 18:22:51,133 INFO L85 Accepts]: Finished accepts. word is rejected. [2025-04-13 18:22:51,133 INFO L485 AbstractCegarLoop]: Abstraction has 40859 states and 167132 transitions. [2025-04-13 18:22:51,133 INFO L486 AbstractCegarLoop]: INTERPOLANT automaton has has 14 states, 13 states have (on average 3.4615384615384617) internal successors, (45), 14 states have internal predecessors, (45), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-04-13 18:22:51,133 INFO L278 IsEmpty]: Start isEmpty. Operand 40859 states and 167132 transitions. [2025-04-13 18:22:51,206 INFO L284 IsEmpty]: Finished isEmpty. Found accepting run of length 46 [2025-04-13 18:22:51,207 INFO L210 NwaCegarLoop]: Found error trace [2025-04-13 18:22:51,207 INFO L218 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-04-13 18:22:51,207 WARN L466 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable52 [2025-04-13 18:22:51,207 INFO L403 AbstractCegarLoop]: === Iteration 54 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES, ULTIMATE.startErr1INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 2 more)] === [2025-04-13 18:22:51,207 INFO L155 PredicateUnifier]: Initialized classic predicate unifier [2025-04-13 18:22:51,207 INFO L85 PathProgramCache]: Analyzing trace with hash -1837359774, now seen corresponding path program 15 times [2025-04-13 18:22:51,207 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-04-13 18:22:51,207 INFO L324 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2032380205] [2025-04-13 18:22:51,207 INFO L95 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST2 [2025-04-13 18:22:51,207 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-04-13 18:22:51,212 INFO L108 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST2 partitioned 45 statements into 2 equivalence classes. [2025-04-13 18:22:51,215 INFO L111 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST2 issued 1 check-sat command(s) and asserted 44 of 45 statements. [2025-04-13 18:22:51,215 INFO L114 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST2 issued 1 check-sat command(s) [2025-04-13 18:22:51,215 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-04-13 18:22:51,526 INFO L134 CoverageAnalysis]: Checked inductivity of 1 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2025-04-13 18:22:51,526 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-04-13 18:22:51,526 INFO L324 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2032380205] [2025-04-13 18:22:51,527 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [2032380205] provided 1 perfect and 0 imperfect interpolant sequences [2025-04-13 18:22:51,527 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-04-13 18:22:51,527 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [9] imperfect sequences [] total 9 [2025-04-13 18:22:51,527 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [762029839] [2025-04-13 18:22:51,527 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-04-13 18:22:51,527 INFO L562 AbstractCegarLoop]: INTERPOLANT automaton has 10 states [2025-04-13 18:22:51,527 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-04-13 18:22:51,527 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 10 interpolants. [2025-04-13 18:22:51,527 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=18, Invalid=72, Unknown=0, NotChecked=0, Total=90 [2025-04-13 18:22:51,527 INFO L87 Difference]: Start difference. First operand 40859 states and 167132 transitions. Second operand has 10 states, 9 states have (on average 5.0) internal successors, (45), 10 states have internal predecessors, (45), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-04-13 18:22:52,405 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-04-13 18:22:52,405 INFO L93 Difference]: Finished difference Result 52444 states and 216045 transitions. [2025-04-13 18:22:52,405 INFO L140 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 34 states. [2025-04-13 18:22:52,405 INFO L79 Accepts]: Start accepts. Automaton has has 10 states, 9 states have (on average 5.0) internal successors, (45), 10 states have internal predecessors, (45), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 45 [2025-04-13 18:22:52,405 INFO L85 Accepts]: Finished accepts. some prefix is accepted. [2025-04-13 18:22:52,949 INFO L225 Difference]: With dead ends: 52444 [2025-04-13 18:22:52,949 INFO L226 Difference]: Without dead ends: 49489 [2025-04-13 18:22:52,963 INFO L436 NwaCegarLoop]: 0 DeclaredPredicates, 59 GetRequests, 26 SyntacticMatches, 0 SemanticMatches, 33 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 298 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=218, Invalid=972, Unknown=0, NotChecked=0, Total=1190 [2025-04-13 18:22:52,963 INFO L437 NwaCegarLoop]: 29 mSDtfsCounter, 427 mSDsluCounter, 142 mSDsCounter, 0 mSdLazyCounter, 1425 mSolverCounterSat, 5 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.4s Time, 0 mProtectedPredicate, 0 mProtectedAction, 427 SdHoareTripleChecker+Valid, 171 SdHoareTripleChecker+Invalid, 1430 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 5 IncrementalHoareTripleChecker+Valid, 1425 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.5s IncrementalHoareTripleChecker+Time [2025-04-13 18:22:52,963 INFO L438 NwaCegarLoop]: SdHoareTripleChecker [427 Valid, 171 Invalid, 1430 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [5 Valid, 1425 Invalid, 0 Unknown, 0 Unchecked, 0.5s Time] [2025-04-13 18:22:53,001 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 49489 states. [2025-04-13 18:22:53,720 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 49489 to 40991. [2025-04-13 18:22:53,780 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 40991 states, 40990 states have (on average 4.089387655525738) internal successors, (167624), 40990 states have internal predecessors, (167624), 0 states have call successors, (0), 0 states have 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:22:53,913 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 40991 states to 40991 states and 167624 transitions. [2025-04-13 18:22:54,074 INFO L79 Accepts]: Start accepts. Automaton has 40991 states and 167624 transitions. Word has length 45 [2025-04-13 18:22:54,074 INFO L85 Accepts]: Finished accepts. word is rejected. [2025-04-13 18:22:54,074 INFO L485 AbstractCegarLoop]: Abstraction has 40991 states and 167624 transitions. [2025-04-13 18:22:54,074 INFO L486 AbstractCegarLoop]: INTERPOLANT automaton has has 10 states, 9 states have (on average 5.0) internal successors, (45), 10 states have internal predecessors, (45), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-04-13 18:22:54,074 INFO L278 IsEmpty]: Start isEmpty. Operand 40991 states and 167624 transitions. [2025-04-13 18:22:54,154 INFO L284 IsEmpty]: Finished isEmpty. Found accepting run of length 46 [2025-04-13 18:22:54,154 INFO L210 NwaCegarLoop]: Found error trace [2025-04-13 18:22:54,154 INFO L218 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-04-13 18:22:54,154 WARN L466 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable53 [2025-04-13 18:22:54,154 INFO L403 AbstractCegarLoop]: === Iteration 55 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES, ULTIMATE.startErr1INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 2 more)] === [2025-04-13 18:22:54,154 INFO L155 PredicateUnifier]: Initialized classic predicate unifier [2025-04-13 18:22:54,154 INFO L85 PathProgramCache]: Analyzing trace with hash 1403939774, now seen corresponding path program 16 times [2025-04-13 18:22:54,155 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-04-13 18:22:54,155 INFO L324 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1799326365] [2025-04-13 18:22:54,155 INFO L95 rtionOrderModulation]: Changing assertion order to TERMS_WITH_SMALL_CONSTANTS_FIRST [2025-04-13 18:22:54,155 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-04-13 18:22:54,159 INFO L108 AnnotateAndAsserter]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST partitioned 45 statements into 2 equivalence classes. [2025-04-13 18:22:54,162 INFO L111 AnnotateAndAsserter]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST issued 2 check-sat command(s) and asserted 45 of 45 statements. [2025-04-13 18:22:54,162 INFO L114 AnnotateAndAsserter]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST issued 2 check-sat command(s) [2025-04-13 18:22:54,162 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-04-13 18:22:54,503 INFO L134 CoverageAnalysis]: Checked inductivity of 1 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2025-04-13 18:22:54,503 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-04-13 18:22:54,503 INFO L324 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1799326365] [2025-04-13 18:22:54,503 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1799326365] provided 1 perfect and 0 imperfect interpolant sequences [2025-04-13 18:22:54,503 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-04-13 18:22:54,503 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [11] imperfect sequences [] total 11 [2025-04-13 18:22:54,503 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1445252050] [2025-04-13 18:22:54,503 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-04-13 18:22:54,504 INFO L562 AbstractCegarLoop]: INTERPOLANT automaton has 12 states [2025-04-13 18:22:54,504 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-04-13 18:22:54,504 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 12 interpolants. [2025-04-13 18:22:54,504 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=25, Invalid=107, Unknown=0, NotChecked=0, Total=132 [2025-04-13 18:22:54,504 INFO L87 Difference]: Start difference. First operand 40991 states and 167624 transitions. Second operand has 12 states, 11 states have (on average 4.090909090909091) internal successors, (45), 12 states have internal predecessors, (45), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-04-13 18:22:55,774 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-04-13 18:22:55,775 INFO L93 Difference]: Finished difference Result 65318 states and 275483 transitions. [2025-04-13 18:22:55,775 INFO L140 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 28 states. [2025-04-13 18:22:55,775 INFO L79 Accepts]: Start accepts. Automaton has has 12 states, 11 states have (on average 4.090909090909091) internal successors, (45), 12 states have internal predecessors, (45), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 45 [2025-04-13 18:22:55,775 INFO L85 Accepts]: Finished accepts. some prefix is accepted. [2025-04-13 18:22:56,167 INFO L225 Difference]: With dead ends: 65318 [2025-04-13 18:22:56,167 INFO L226 Difference]: Without dead ends: 63235 [2025-04-13 18:22:56,186 INFO L436 NwaCegarLoop]: 0 DeclaredPredicates, 30 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 28 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 187 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=150, Invalid=720, Unknown=0, NotChecked=0, Total=870 [2025-04-13 18:22:56,187 INFO L437 NwaCegarLoop]: 45 mSDtfsCounter, 325 mSDsluCounter, 277 mSDsCounter, 0 mSdLazyCounter, 1759 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.7s Time, 0 mProtectedPredicate, 0 mProtectedAction, 325 SdHoareTripleChecker+Valid, 322 SdHoareTripleChecker+Invalid, 1759 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 1759 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.8s IncrementalHoareTripleChecker+Time [2025-04-13 18:22:56,187 INFO L438 NwaCegarLoop]: SdHoareTripleChecker [325 Valid, 322 Invalid, 1759 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 1759 Invalid, 0 Unknown, 0 Unchecked, 0.8s Time] [2025-04-13 18:22:56,245 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 63235 states. [2025-04-13 18:22:56,980 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 63235 to 41247. [2025-04-13 18:22:57,036 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 41247 states, 41246 states have (on average 4.087184211802357) internal successors, (168580), 41246 states have internal predecessors, (168580), 0 states have call successors, (0), 0 states have 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:22:57,400 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 41247 states to 41247 states and 168580 transitions. [2025-04-13 18:22:57,575 INFO L79 Accepts]: Start accepts. Automaton has 41247 states and 168580 transitions. Word has length 45 [2025-04-13 18:22:57,576 INFO L85 Accepts]: Finished accepts. word is rejected. [2025-04-13 18:22:57,576 INFO L485 AbstractCegarLoop]: Abstraction has 41247 states and 168580 transitions. [2025-04-13 18:22:57,576 INFO L486 AbstractCegarLoop]: INTERPOLANT automaton has has 12 states, 11 states have (on average 4.090909090909091) internal successors, (45), 12 states have internal predecessors, (45), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-04-13 18:22:57,576 INFO L278 IsEmpty]: Start isEmpty. Operand 41247 states and 168580 transitions. [2025-04-13 18:22:57,676 INFO L284 IsEmpty]: Finished isEmpty. Found accepting run of length 46 [2025-04-13 18:22:57,676 INFO L210 NwaCegarLoop]: Found error trace [2025-04-13 18:22:57,676 INFO L218 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-04-13 18:22:57,676 WARN L466 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable54 [2025-04-13 18:22:57,676 INFO L403 AbstractCegarLoop]: === Iteration 56 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES, ULTIMATE.startErr1INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 2 more)] === [2025-04-13 18:22:57,677 INFO L155 PredicateUnifier]: Initialized classic predicate unifier [2025-04-13 18:22:57,677 INFO L85 PathProgramCache]: Analyzing trace with hash 600990128, now seen corresponding path program 17 times [2025-04-13 18:22:57,677 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-04-13 18:22:57,677 INFO L324 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1918843670] [2025-04-13 18:22:57,677 INFO L95 rtionOrderModulation]: Changing assertion order to INSIDE_LOOP_FIRST1 [2025-04-13 18:22:57,677 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-04-13 18:22:57,682 INFO L108 AnnotateAndAsserter]: Assert order INSIDE_LOOP_FIRST1 partitioned 45 statements into 2 equivalence classes. [2025-04-13 18:22:57,685 INFO L111 AnnotateAndAsserter]: Assert order INSIDE_LOOP_FIRST1 issued 2 check-sat command(s) and asserted 45 of 45 statements. [2025-04-13 18:22:57,685 INFO L114 AnnotateAndAsserter]: Assert order INSIDE_LOOP_FIRST1 issued 2 check-sat command(s) [2025-04-13 18:22:57,685 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-04-13 18:22:57,775 INFO L134 CoverageAnalysis]: Checked inductivity of 1 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2025-04-13 18:22:57,775 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-04-13 18:22:57,775 INFO L324 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1918843670] [2025-04-13 18:22:57,775 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1918843670] provided 1 perfect and 0 imperfect interpolant sequences [2025-04-13 18:22:57,775 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-04-13 18:22:57,775 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [9] imperfect sequences [] total 9 [2025-04-13 18:22:57,775 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1122180415] [2025-04-13 18:22:57,775 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-04-13 18:22:57,775 INFO L562 AbstractCegarLoop]: INTERPOLANT automaton has 10 states [2025-04-13 18:22:57,775 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-04-13 18:22:57,775 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 10 interpolants. [2025-04-13 18:22:57,775 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=17, Invalid=73, Unknown=0, NotChecked=0, Total=90 [2025-04-13 18:22:57,776 INFO L87 Difference]: Start difference. First operand 41247 states and 168580 transitions. Second operand has 10 states, 9 states have (on average 5.0) internal successors, (45), 10 states have internal predecessors, (45), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-04-13 18:22:58,959 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-04-13 18:22:58,959 INFO L93 Difference]: Finished difference Result 51952 states and 215601 transitions. [2025-04-13 18:22:58,959 INFO L140 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 35 states. [2025-04-13 18:22:58,960 INFO L79 Accepts]: Start accepts. Automaton has has 10 states, 9 states have (on average 5.0) internal successors, (45), 10 states have internal predecessors, (45), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 45 [2025-04-13 18:22:58,960 INFO L85 Accepts]: Finished accepts. some prefix is accepted. [2025-04-13 18:22:59,284 INFO L225 Difference]: With dead ends: 51952 [2025-04-13 18:22:59,284 INFO L226 Difference]: Without dead ends: 49650 [2025-04-13 18:22:59,302 INFO L436 NwaCegarLoop]: 0 DeclaredPredicates, 61 GetRequests, 27 SyntacticMatches, 0 SemanticMatches, 34 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 302 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=206, Invalid=1054, Unknown=0, NotChecked=0, Total=1260 [2025-04-13 18:22:59,303 INFO L437 NwaCegarLoop]: 30 mSDtfsCounter, 387 mSDsluCounter, 174 mSDsCounter, 0 mSdLazyCounter, 1747 mSolverCounterSat, 7 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.5s Time, 0 mProtectedPredicate, 0 mProtectedAction, 387 SdHoareTripleChecker+Valid, 204 SdHoareTripleChecker+Invalid, 1754 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 7 IncrementalHoareTripleChecker+Valid, 1747 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.6s IncrementalHoareTripleChecker+Time [2025-04-13 18:22:59,303 INFO L438 NwaCegarLoop]: SdHoareTripleChecker [387 Valid, 204 Invalid, 1754 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [7 Valid, 1747 Invalid, 0 Unknown, 0 Unchecked, 0.6s Time] [2025-04-13 18:22:59,343 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 49650 states. [2025-04-13 18:22:59,987 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 49650 to 41101. [2025-04-13 18:23:00,046 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 41101 states, 41100 states have (on average 4.087931873479318) internal successors, (168014), 41100 states have internal predecessors, (168014), 0 states have call successors, (0), 0 states have 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:23:00,164 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 41101 states to 41101 states and 168014 transitions. [2025-04-13 18:23:00,530 INFO L79 Accepts]: Start accepts. Automaton has 41101 states and 168014 transitions. Word has length 45 [2025-04-13 18:23:00,530 INFO L85 Accepts]: Finished accepts. word is rejected. [2025-04-13 18:23:00,530 INFO L485 AbstractCegarLoop]: Abstraction has 41101 states and 168014 transitions. [2025-04-13 18:23:00,530 INFO L486 AbstractCegarLoop]: INTERPOLANT automaton has has 10 states, 9 states have (on average 5.0) internal successors, (45), 10 states have internal predecessors, (45), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-04-13 18:23:00,530 INFO L278 IsEmpty]: Start isEmpty. Operand 41101 states and 168014 transitions. [2025-04-13 18:23:00,614 INFO L284 IsEmpty]: Finished isEmpty. Found accepting run of length 46 [2025-04-13 18:23:00,614 INFO L210 NwaCegarLoop]: Found error trace [2025-04-13 18:23:00,614 INFO L218 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-04-13 18:23:00,614 WARN L466 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable55 [2025-04-13 18:23:00,615 INFO L403 AbstractCegarLoop]: === Iteration 57 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES, ULTIMATE.startErr1INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 2 more)] === [2025-04-13 18:23:00,615 INFO L155 PredicateUnifier]: Initialized classic predicate unifier [2025-04-13 18:23:00,615 INFO L85 PathProgramCache]: Analyzing trace with hash 1630430010, now seen corresponding path program 18 times [2025-04-13 18:23:00,615 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-04-13 18:23:00,615 INFO L324 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [494647437] [2025-04-13 18:23:00,615 INFO L95 rtionOrderModulation]: Changing assertion order to MIX_INSIDE_OUTSIDE [2025-04-13 18:23:00,615 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-04-13 18:23:00,619 INFO L108 AnnotateAndAsserter]: Assert order MIX_INSIDE_OUTSIDE partitioned 45 statements into 2 equivalence classes. [2025-04-13 18:23:00,622 INFO L111 AnnotateAndAsserter]: Assert order MIX_INSIDE_OUTSIDE issued 1 check-sat command(s) and asserted 44 of 45 statements. [2025-04-13 18:23:00,622 INFO L114 AnnotateAndAsserter]: Assert order MIX_INSIDE_OUTSIDE issued 1 check-sat command(s) [2025-04-13 18:23:00,622 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-04-13 18:23:00,786 INFO L134 CoverageAnalysis]: Checked inductivity of 1 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2025-04-13 18:23:00,786 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-04-13 18:23:00,786 INFO L324 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [494647437] [2025-04-13 18:23:00,787 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [494647437] provided 1 perfect and 0 imperfect interpolant sequences [2025-04-13 18:23:00,787 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-04-13 18:23:00,787 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [13] imperfect sequences [] total 13 [2025-04-13 18:23:00,787 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1056688785] [2025-04-13 18:23:00,787 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-04-13 18:23:00,787 INFO L562 AbstractCegarLoop]: INTERPOLANT automaton has 14 states [2025-04-13 18:23:00,787 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-04-13 18:23:00,787 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 14 interpolants. [2025-04-13 18:23:00,787 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=31, Invalid=151, Unknown=0, NotChecked=0, Total=182 [2025-04-13 18:23:00,787 INFO L87 Difference]: Start difference. First operand 41101 states and 168014 transitions. Second operand has 14 states, 13 states have (on average 3.4615384615384617) internal successors, (45), 14 states have internal predecessors, (45), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-04-13 18:23:02,345 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-04-13 18:23:02,345 INFO L93 Difference]: Finished difference Result 64247 states and 271632 transitions. [2025-04-13 18:23:02,346 INFO L140 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 32 states. [2025-04-13 18:23:02,346 INFO L79 Accepts]: Start accepts. Automaton has has 14 states, 13 states have (on average 3.4615384615384617) internal successors, (45), 14 states have internal predecessors, (45), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 45 [2025-04-13 18:23:02,346 INFO L85 Accepts]: Finished accepts. some prefix is accepted. [2025-04-13 18:23:02,722 INFO L225 Difference]: With dead ends: 64247 [2025-04-13 18:23:02,722 INFO L226 Difference]: Without dead ends: 62333 [2025-04-13 18:23:02,750 INFO L436 NwaCegarLoop]: 0 DeclaredPredicates, 36 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 34 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 288 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=203, Invalid=1057, Unknown=0, NotChecked=0, Total=1260 [2025-04-13 18:23:02,750 INFO L437 NwaCegarLoop]: 61 mSDtfsCounter, 384 mSDsluCounter, 478 mSDsCounter, 0 mSdLazyCounter, 2711 mSolverCounterSat, 10 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.7s Time, 0 mProtectedPredicate, 0 mProtectedAction, 384 SdHoareTripleChecker+Valid, 539 SdHoareTripleChecker+Invalid, 2721 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 10 IncrementalHoareTripleChecker+Valid, 2711 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.9s IncrementalHoareTripleChecker+Time [2025-04-13 18:23:02,750 INFO L438 NwaCegarLoop]: SdHoareTripleChecker [384 Valid, 539 Invalid, 2721 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [10 Valid, 2711 Invalid, 0 Unknown, 0 Unchecked, 0.9s Time] [2025-04-13 18:23:02,810 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 62333 states.