./Ultimate.py --spec ../sv-benchmarks/c/properties/unreach-call.prp --file ../sv-benchmarks/c/bitvector/soft_float_1-2a.c.cil.c --full-output --architecture 32bit -------------------------------------------------------------------------------- Checking for ERROR reachability Using default analysis Version 551b0097 Calling Ultimate with: /root/.sdkman/candidates/java/21.0.5-tem/bin/java -Dosgi.configuration.area=/storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/data/config -Xmx15G -Xms4m -jar /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/plugins/org.eclipse.equinox.launcher_1.6.800.v20240513-1750.jar -data @noDefault -ultimatedata /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/data -tc /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/config/AutomizerReach.xml -i ../sv-benchmarks/c/bitvector/soft_float_1-2a.c.cil.c -s /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/config/svcomp-Reach-32bit-Automizer_Default.epf --cacsl2boogietranslator.entry.function main --witnessprinter.witness.directory /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux --witnessprinter.witness.filename witness --witnessprinter.write.witness.besides.input.file false --witnessprinter.graph.data.specification CHECK( init(main()), LTL(G ! call(reach_error())) ) --witnessprinter.graph.data.producer Automizer --witnessprinter.graph.data.architecture 32bit --witnessprinter.graph.data.programhash c9ff936057be59b0f479a8c37fd17409fe797633e9a8a05703f5728379735d91 --- Real Ultimate output --- This is Ultimate 0.3.0-?-551b009-m [2025-01-08 22:48:29,927 INFO L188 SettingsManager]: Resetting all preferences to default values... [2025-01-08 22:48:29,973 INFO L114 SettingsManager]: Loading settings from /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/config/svcomp-Reach-32bit-Automizer_Default.epf [2025-01-08 22:48:29,979 WARN L101 SettingsManager]: Preference file contains the following unknown settings: [2025-01-08 22:48:29,979 WARN L103 SettingsManager]: * de.uni_freiburg.informatik.ultimate.core.Log level for class [2025-01-08 22:48:29,991 INFO L130 SettingsManager]: Preferences different from defaults after loading the file: [2025-01-08 22:48:29,992 INFO L151 SettingsManager]: Preferences of UltimateCore differ from their defaults: [2025-01-08 22:48:29,992 INFO L153 SettingsManager]: * Log level for class=de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher=ERROR; [2025-01-08 22:48:29,992 INFO L151 SettingsManager]: Preferences of Boogie Preprocessor differ from their defaults: [2025-01-08 22:48:29,992 INFO L153 SettingsManager]: * Use memory slicer=true [2025-01-08 22:48:29,992 INFO L151 SettingsManager]: Preferences of Boogie Procedure Inliner differ from their defaults: [2025-01-08 22:48:29,992 INFO L153 SettingsManager]: * Ignore calls to procedures called more than once=ONLY_FOR_SEQUENTIAL_PROGRAMS [2025-01-08 22:48:29,992 INFO L151 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2025-01-08 22:48:29,993 INFO L153 SettingsManager]: * Create parallel compositions if possible=false [2025-01-08 22:48:29,993 INFO L153 SettingsManager]: * Use SBE=true [2025-01-08 22:48:29,993 INFO L151 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2025-01-08 22:48:29,993 INFO L153 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2025-01-08 22:48:29,993 INFO L153 SettingsManager]: * sizeof long=4 [2025-01-08 22:48:29,993 INFO L153 SettingsManager]: * Overapproximate operations on floating types=true [2025-01-08 22:48:29,993 INFO L153 SettingsManager]: * sizeof POINTER=4 [2025-01-08 22:48:29,993 INFO L153 SettingsManager]: * Check division by zero=IGNORE [2025-01-08 22:48:29,993 INFO L153 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2025-01-08 22:48:29,997 INFO L153 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2025-01-08 22:48:29,997 INFO L153 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2025-01-08 22:48:29,998 INFO L153 SettingsManager]: * sizeof long double=12 [2025-01-08 22:48:29,998 INFO L153 SettingsManager]: * Check if freed pointer was valid=false [2025-01-08 22:48:29,998 INFO L153 SettingsManager]: * Behaviour of calls to undefined functions=OVERAPPROXIMATE_BEHAVIOUR [2025-01-08 22:48:29,998 INFO L153 SettingsManager]: * Use constant arrays=true [2025-01-08 22:48:29,998 INFO L151 SettingsManager]: Preferences of IcfgBuilder differ from their defaults: [2025-01-08 22:48:29,998 INFO L153 SettingsManager]: * Size of a code block=SequenceOfStatements [2025-01-08 22:48:29,998 INFO L153 SettingsManager]: * Only consider context switches at boundaries of atomic blocks=true [2025-01-08 22:48:29,998 INFO L153 SettingsManager]: * SMT solver=External_DefaultMode [2025-01-08 22:48:29,998 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2025-01-08 22:48:29,998 INFO L151 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2025-01-08 22:48:29,998 INFO L153 SettingsManager]: * Size of a code block=SequenceOfStatements [2025-01-08 22:48:29,998 INFO L153 SettingsManager]: * Only consider context switches at boundaries of atomic blocks=true [2025-01-08 22:48:29,998 INFO L153 SettingsManager]: * SMT solver=External_DefaultMode [2025-01-08 22:48:29,998 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2025-01-08 22:48:29,998 INFO L151 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2025-01-08 22:48:29,998 INFO L153 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2025-01-08 22:48:29,998 INFO L153 SettingsManager]: * Compute procedure contracts=false [2025-01-08 22:48:29,998 INFO L153 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopHeads [2025-01-08 22:48:29,998 INFO L153 SettingsManager]: * Trace refinement strategy=CAMEL [2025-01-08 22:48:29,998 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2025-01-08 22:48:29,998 INFO L153 SettingsManager]: * Apply one-shot large block encoding in concurrent analysis=false [2025-01-08 22:48:29,999 INFO L153 SettingsManager]: * Automaton type used in concurrency analysis=PETRI_NET [2025-01-08 22:48:29,999 INFO L153 SettingsManager]: * Order on configurations for Petri net unfoldings=DBO [2025-01-08 22:48:29,999 INFO L153 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode [2025-01-08 22:48:29,999 INFO L153 SettingsManager]: * Looper check in Petri net analysis=SEMANTIC Applying setting for plugin de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator: Entry function -> main Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Witness directory -> /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Witness filename -> witness Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Write witness besides input file -> false Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Graph data specification -> CHECK( init(main()), LTL(G ! call(reach_error())) ) Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Graph data producer -> Automizer Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Graph data architecture -> 32bit Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Graph data programhash -> c9ff936057be59b0f479a8c37fd17409fe797633e9a8a05703f5728379735d91 [2025-01-08 22:48:30,256 INFO L75 nceAwareModelManager]: Repository-Root is: /tmp [2025-01-08 22:48:30,266 INFO L261 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2025-01-08 22:48:30,271 INFO L217 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2025-01-08 22:48:30,271 INFO L270 PluginConnector]: Initializing CDTParser... [2025-01-08 22:48:30,271 INFO L274 PluginConnector]: CDTParser initialized [2025-01-08 22:48:30,272 INFO L431 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/../sv-benchmarks/c/bitvector/soft_float_1-2a.c.cil.c [2025-01-08 22:48:31,644 INFO L533 CDTParser]: Created temporary CDT project at /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/data/db0e7f2a0/b97dbedf555648539c2828801d0401ce/FLAG780ae6f05 [2025-01-08 22:48:31,889 INFO L384 CDTParser]: Found 1 translation units. [2025-01-08 22:48:31,889 INFO L180 CDTParser]: Scanning /storage/repos/ultimate-jdk21/releaseScripts/default/sv-benchmarks/c/bitvector/soft_float_1-2a.c.cil.c [2025-01-08 22:48:31,899 INFO L427 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/data/db0e7f2a0/b97dbedf555648539c2828801d0401ce/FLAG780ae6f05 [2025-01-08 22:48:31,908 INFO L435 CDTParser]: Successfully deleted /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/data/db0e7f2a0/b97dbedf555648539c2828801d0401ce [2025-01-08 22:48:31,909 INFO L299 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2025-01-08 22:48:31,910 INFO L133 ToolchainWalker]: Walking toolchain with 6 elements. [2025-01-08 22:48:31,911 INFO L112 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2025-01-08 22:48:31,911 INFO L270 PluginConnector]: Initializing CACSL2BoogieTranslator... [2025-01-08 22:48:31,913 INFO L274 PluginConnector]: CACSL2BoogieTranslator initialized [2025-01-08 22:48:31,914 INFO L184 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 08.01 10:48:31" (1/1) ... [2025-01-08 22:48:31,914 INFO L204 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@597a80cc and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.01 10:48:31, skipping insertion in model container [2025-01-08 22:48:31,914 INFO L184 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 08.01 10:48:31" (1/1) ... [2025-01-08 22:48:31,926 INFO L175 MainTranslator]: Built tables and reachable declarations [2025-01-08 22:48:32,023 WARN L250 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate-jdk21/releaseScripts/default/sv-benchmarks/c/bitvector/soft_float_1-2a.c.cil.c[755,768] [2025-01-08 22:48:32,072 INFO L210 PostProcessor]: Analyzing one entry point: main [2025-01-08 22:48:32,079 INFO L200 MainTranslator]: Completed pre-run [2025-01-08 22:48:32,088 WARN L250 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate-jdk21/releaseScripts/default/sv-benchmarks/c/bitvector/soft_float_1-2a.c.cil.c[755,768] [2025-01-08 22:48:32,119 INFO L210 PostProcessor]: Analyzing one entry point: main [2025-01-08 22:48:32,131 INFO L204 MainTranslator]: Completed translation [2025-01-08 22:48:32,135 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.01 10:48:32 WrapperNode [2025-01-08 22:48:32,136 INFO L131 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2025-01-08 22:48:32,136 INFO L112 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2025-01-08 22:48:32,136 INFO L270 PluginConnector]: Initializing Boogie Procedure Inliner... [2025-01-08 22:48:32,137 INFO L274 PluginConnector]: Boogie Procedure Inliner initialized [2025-01-08 22:48:32,142 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.01 10:48:32" (1/1) ... [2025-01-08 22:48:32,146 INFO L184 PluginConnector]: Executing the observer Inliner from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.01 10:48:32" (1/1) ... [2025-01-08 22:48:32,167 INFO L138 Inliner]: procedures = 17, calls = 18, calls flagged for inlining = 3, calls inlined = 3, statements flattened = 190 [2025-01-08 22:48:32,169 INFO L131 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2025-01-08 22:48:32,170 INFO L112 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2025-01-08 22:48:32,170 INFO L270 PluginConnector]: Initializing Boogie Preprocessor... [2025-01-08 22:48:32,170 INFO L274 PluginConnector]: Boogie Preprocessor initialized [2025-01-08 22:48:32,176 INFO L184 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.01 10:48:32" (1/1) ... [2025-01-08 22:48:32,176 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.01 10:48:32" (1/1) ... [2025-01-08 22:48:32,178 INFO L184 PluginConnector]: Executing the observer MemorySlicer from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.01 10:48:32" (1/1) ... [2025-01-08 22:48:32,190 INFO L175 MemorySlicer]: Split 2 memory accesses to 1 slices as follows [2]. 100 percent of accesses are in the largest equivalence class. The 2 initializations are split as follows [2]. The 0 writes are split as follows [0]. [2025-01-08 22:48:32,193 INFO L184 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.01 10:48:32" (1/1) ... [2025-01-08 22:48:32,194 INFO L184 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.01 10:48:32" (1/1) ... [2025-01-08 22:48:32,196 INFO L184 PluginConnector]: Executing the observer ReplaceArrayAssignments from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.01 10:48:32" (1/1) ... [2025-01-08 22:48:32,200 INFO L184 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.01 10:48:32" (1/1) ... [2025-01-08 22:48:32,203 INFO L184 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.01 10:48:32" (1/1) ... [2025-01-08 22:48:32,204 INFO L184 PluginConnector]: Executing the observer LTLStepAnnotator from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.01 10:48:32" (1/1) ... [2025-01-08 22:48:32,205 INFO L184 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.01 10:48:32" (1/1) ... [2025-01-08 22:48:32,208 INFO L131 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2025-01-08 22:48:32,209 INFO L112 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2025-01-08 22:48:32,212 INFO L270 PluginConnector]: Initializing RCFGBuilder... [2025-01-08 22:48:32,212 INFO L274 PluginConnector]: RCFGBuilder initialized [2025-01-08 22:48:32,213 INFO L184 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.01 10:48:32" (1/1) ... [2025-01-08 22:48:32,217 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2025-01-08 22:48:32,227 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 [2025-01-08 22:48:32,240 INFO L229 MonitoredProcess]: Starting monitored process 1 with /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 (exit command is (exit), workingDir is null) [2025-01-08 22:48:32,248 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 (1)] Waiting until timeout for monitored process [2025-01-08 22:48:32,263 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocInit [2025-01-08 22:48:32,263 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int#0 [2025-01-08 22:48:32,263 INFO L130 BoogieDeclarations]: Found specification of procedure base2flt [2025-01-08 22:48:32,264 INFO L138 BoogieDeclarations]: Found implementation of procedure base2flt [2025-01-08 22:48:32,264 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2025-01-08 22:48:32,264 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2025-01-08 22:48:32,264 INFO L130 BoogieDeclarations]: Found specification of procedure __VERIFIER_assert [2025-01-08 22:48:32,264 INFO L138 BoogieDeclarations]: Found implementation of procedure __VERIFIER_assert [2025-01-08 22:48:32,307 INFO L234 CfgBuilder]: Building ICFG [2025-01-08 22:48:32,308 INFO L260 CfgBuilder]: Building CFG for each procedure with an implementation [2025-01-08 22:48:32,531 INFO L? ?]: Removed 73 outVars from TransFormulas that were not future-live. [2025-01-08 22:48:32,532 INFO L283 CfgBuilder]: Performing block encoding [2025-01-08 22:48:32,544 INFO L307 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2025-01-08 22:48:32,545 INFO L312 CfgBuilder]: Removed 2 assume(true) statements. [2025-01-08 22:48:32,545 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 08.01 10:48:32 BoogieIcfgContainer [2025-01-08 22:48:32,546 INFO L131 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2025-01-08 22:48:32,547 INFO L112 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2025-01-08 22:48:32,547 INFO L270 PluginConnector]: Initializing TraceAbstraction... [2025-01-08 22:48:32,554 INFO L274 PluginConnector]: TraceAbstraction initialized [2025-01-08 22:48:32,555 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 08.01 10:48:31" (1/3) ... [2025-01-08 22:48:32,555 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@6bb7a8eb and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 08.01 10:48:32, skipping insertion in model container [2025-01-08 22:48:32,555 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.01 10:48:32" (2/3) ... [2025-01-08 22:48:32,555 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@6bb7a8eb and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 08.01 10:48:32, skipping insertion in model container [2025-01-08 22:48:32,555 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 08.01 10:48:32" (3/3) ... [2025-01-08 22:48:32,556 INFO L128 eAbstractionObserver]: Analyzing ICFG soft_float_1-2a.c.cil.c [2025-01-08 22:48:32,565 INFO L216 ceAbstractionStarter]: Automizer settings: Hoare:LoopHeads NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2025-01-08 22:48:32,566 INFO L151 ceAbstractionStarter]: Applying trace abstraction to ICFG soft_float_1-2a.c.cil.c that has 3 procedures, 94 locations, 1 initial locations, 2 loop locations, and 1 error locations. [2025-01-08 22:48:32,612 INFO L332 AbstractCegarLoop]: ======== Iteration 0 == of CEGAR loop == AllErrorsAtOnce ======== [2025-01-08 22:48:32,623 INFO L333 AbstractCegarLoop]: Settings: SEPARATE_VIOLATION_CHECK=true, mInterprocedural=true, mMaxIterations=1000000, mWatchIteration=1000000, mArtifact=RCFG, mInterpolation=FPandBP, mInterpolantAutomaton=STRAIGHT_LINE, mDumpAutomata=false, mAutomataFormat=ATS_NUMERATE, mDumpPath=., mDeterminiation=PREDICATE_ABSTRACTION, mMinimize=MINIMIZE_SEVPA, mAutomataTypeConcurrency=PETRI_NET, mHoareTripleChecks=INCREMENTAL, mHoareAnnotationPositions=LoopHeads, mDumpOnlyReuseAutomata=false, mLimitTraceHistogram=0, mErrorLocTimeLimit=0, mLimitPathProgramCount=0, mCollectInterpolantStatistics=true, mHeuristicEmptinessCheck=false, mHeuristicEmptinessCheckAStarHeuristic=ZERO, mHeuristicEmptinessCheckAStarHeuristicRandomSeed=1337, mHeuristicEmptinessCheckSmtFeatureScoringMethod=DAGSIZE, mSMTFeatureExtraction=false, mSMTFeatureExtractionDumpPath=., mOverrideInterpolantAutomaton=false, mMcrInterpolantMethod=WP, mPorIndependenceSettings=[Lde.uni_freiburg.informatik.ultimate.lib.tracecheckerutils.partialorder.independence.IndependenceSettings;@44df4386, mLbeIndependenceSettings=[IndependenceType=SEMANTIC, AbstractionType=NONE, UseConditional=false, UseSemiCommutativity=true, Solver=Z3, SolverTimeout=1000ms] [2025-01-08 22:48:32,623 INFO L334 AbstractCegarLoop]: Starting to check reachability of 1 error locations. [2025-01-08 22:48:32,629 INFO L276 IsEmpty]: Start isEmpty. Operand has 94 states, 82 states have (on average 1.5731707317073171) internal successors, (129), 85 states have internal predecessors, (129), 8 states have call successors, (8), 2 states have call predecessors, (8), 2 states have return successors, (8), 8 states have call predecessors, (8), 8 states have call successors, (8) [2025-01-08 22:48:32,637 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 37 [2025-01-08 22:48:32,637 INFO L210 NwaCegarLoop]: Found error trace [2025-01-08 22:48:32,637 INFO L218 NwaCegarLoop]: trace histogram [3, 3, 3, 3, 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-01-08 22:48:32,638 INFO L396 AbstractCegarLoop]: === Iteration 1 === Targeting __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-01-08 22:48:32,641 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-01-08 22:48:32,642 INFO L85 PathProgramCache]: Analyzing trace with hash -1346516099, now seen corresponding path program 1 times [2025-01-08 22:48:32,646 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-01-08 22:48:32,648 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1709205402] [2025-01-08 22:48:32,649 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-01-08 22:48:32,649 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-01-08 22:48:32,708 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 36 statements into 1 equivalence classes. [2025-01-08 22:48:32,747 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 36 of 36 statements. [2025-01-08 22:48:32,747 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-01-08 22:48:32,747 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-01-08 22:48:33,104 INFO L134 CoverageAnalysis]: Checked inductivity of 15 backedges. 3 proven. 3 refuted. 0 times theorem prover too weak. 9 trivial. 0 not checked. [2025-01-08 22:48:33,105 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-01-08 22:48:33,105 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1709205402] [2025-01-08 22:48:33,105 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1709205402] provided 0 perfect and 1 imperfect interpolant sequences [2025-01-08 22:48:33,106 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [2111896129] [2025-01-08 22:48:33,106 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-01-08 22:48:33,106 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-01-08 22:48:33,107 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 [2025-01-08 22:48:33,114 INFO L229 MonitoredProcess]: Starting monitored process 2 with /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2025-01-08 22:48:33,118 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (2)] Waiting until timeout for monitored process [2025-01-08 22:48:33,162 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 36 statements into 1 equivalence classes. [2025-01-08 22:48:33,181 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 36 of 36 statements. [2025-01-08 22:48:33,182 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-01-08 22:48:33,182 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-01-08 22:48:33,184 INFO L256 TraceCheckSpWp]: Trace formula consists of 137 conjuncts, 13 conjuncts are in the unsatisfiable core [2025-01-08 22:48:33,187 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-01-08 22:48:33,236 INFO L134 CoverageAnalysis]: Checked inductivity of 15 backedges. 6 proven. 0 refuted. 0 times theorem prover too weak. 9 trivial. 0 not checked. [2025-01-08 22:48:33,236 INFO L308 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2025-01-08 22:48:33,236 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [2111896129] provided 1 perfect and 0 imperfect interpolant sequences [2025-01-08 22:48:33,236 INFO L185 FreeRefinementEngine]: Found 1 perfect and 1 imperfect interpolant sequences. [2025-01-08 22:48:33,236 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [7] imperfect sequences [8] total 10 [2025-01-08 22:48:33,239 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1142876284] [2025-01-08 22:48:33,239 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-01-08 22:48:33,242 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 7 states [2025-01-08 22:48:33,242 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-01-08 22:48:33,257 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2025-01-08 22:48:33,258 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=17, Invalid=73, Unknown=0, NotChecked=0, Total=90 [2025-01-08 22:48:33,260 INFO L87 Difference]: Start difference. First operand has 94 states, 82 states have (on average 1.5731707317073171) internal successors, (129), 85 states have internal predecessors, (129), 8 states have call successors, (8), 2 states have call predecessors, (8), 2 states have return successors, (8), 8 states have call predecessors, (8), 8 states have call successors, (8) Second operand has 7 states, 7 states have (on average 3.4285714285714284) internal successors, (24), 6 states have internal predecessors, (24), 2 states have call successors, (4), 2 states have call predecessors, (4), 2 states have return successors, (3), 2 states have call predecessors, (3), 1 states have call successors, (3) [2025-01-08 22:48:33,411 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-01-08 22:48:33,412 INFO L93 Difference]: Finished difference Result 221 states and 357 transitions. [2025-01-08 22:48:33,413 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2025-01-08 22:48:33,414 INFO L78 Accepts]: Start accepts. Automaton has has 7 states, 7 states have (on average 3.4285714285714284) internal successors, (24), 6 states have internal predecessors, (24), 2 states have call successors, (4), 2 states have call predecessors, (4), 2 states have return successors, (3), 2 states have call predecessors, (3), 1 states have call successors, (3) Word has length 36 [2025-01-08 22:48:33,415 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-01-08 22:48:33,423 INFO L225 Difference]: With dead ends: 221 [2025-01-08 22:48:33,423 INFO L226 Difference]: Without dead ends: 124 [2025-01-08 22:48:33,426 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 45 GetRequests, 36 SyntacticMatches, 0 SemanticMatches, 9 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=21, Invalid=89, Unknown=0, NotChecked=0, Total=110 [2025-01-08 22:48:33,430 INFO L435 NwaCegarLoop]: 126 mSDtfsCounter, 39 mSDsluCounter, 615 mSDsCounter, 0 mSdLazyCounter, 96 mSolverCounterSat, 5 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 42 SdHoareTripleChecker+Valid, 741 SdHoareTripleChecker+Invalid, 101 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 5 IncrementalHoareTripleChecker+Valid, 96 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2025-01-08 22:48:33,432 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [42 Valid, 741 Invalid, 101 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [5 Valid, 96 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2025-01-08 22:48:33,446 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 124 states. [2025-01-08 22:48:33,466 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 124 to 122. [2025-01-08 22:48:33,467 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 122 states, 108 states have (on average 1.4814814814814814) internal successors, (160), 111 states have internal predecessors, (160), 10 states have call successors, (10), 2 states have call predecessors, (10), 3 states have return successors, (12), 10 states have call predecessors, (12), 9 states have call successors, (12) [2025-01-08 22:48:33,470 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 122 states to 122 states and 182 transitions. [2025-01-08 22:48:33,471 INFO L78 Accepts]: Start accepts. Automaton has 122 states and 182 transitions. Word has length 36 [2025-01-08 22:48:33,471 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-01-08 22:48:33,471 INFO L471 AbstractCegarLoop]: Abstraction has 122 states and 182 transitions. [2025-01-08 22:48:33,471 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 7 states, 7 states have (on average 3.4285714285714284) internal successors, (24), 6 states have internal predecessors, (24), 2 states have call successors, (4), 2 states have call predecessors, (4), 2 states have return successors, (3), 2 states have call predecessors, (3), 1 states have call successors, (3) [2025-01-08 22:48:33,471 INFO L276 IsEmpty]: Start isEmpty. Operand 122 states and 182 transitions. [2025-01-08 22:48:33,472 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 38 [2025-01-08 22:48:33,472 INFO L210 NwaCegarLoop]: Found error trace [2025-01-08 22:48:33,473 INFO L218 NwaCegarLoop]: trace histogram [3, 3, 3, 3, 1, 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-01-08 22:48:33,479 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (2)] Ended with exit code 0 [2025-01-08 22:48:33,674 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 2 /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable0 [2025-01-08 22:48:33,674 INFO L396 AbstractCegarLoop]: === Iteration 2 === Targeting __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-01-08 22:48:33,675 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-01-08 22:48:33,675 INFO L85 PathProgramCache]: Analyzing trace with hash 720759984, now seen corresponding path program 1 times [2025-01-08 22:48:33,675 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-01-08 22:48:33,675 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1811188310] [2025-01-08 22:48:33,675 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-01-08 22:48:33,675 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-01-08 22:48:33,683 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 37 statements into 1 equivalence classes. [2025-01-08 22:48:33,689 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 37 of 37 statements. [2025-01-08 22:48:33,689 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-01-08 22:48:33,689 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-01-08 22:48:33,716 INFO L134 CoverageAnalysis]: Checked inductivity of 15 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 15 trivial. 0 not checked. [2025-01-08 22:48:33,716 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-01-08 22:48:33,716 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1811188310] [2025-01-08 22:48:33,716 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1811188310] provided 1 perfect and 0 imperfect interpolant sequences [2025-01-08 22:48:33,716 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-01-08 22:48:33,716 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2025-01-08 22:48:33,717 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2064806630] [2025-01-08 22:48:33,717 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-01-08 22:48:33,717 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2025-01-08 22:48:33,717 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-01-08 22:48:33,718 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2025-01-08 22:48:33,718 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-01-08 22:48:33,718 INFO L87 Difference]: Start difference. First operand 122 states and 182 transitions. Second operand has 3 states, 3 states have (on average 7.333333333333333) internal successors, (22), 3 states have internal predecessors, (22), 2 states have call successors, (4), 2 states have call predecessors, (4), 1 states have return successors, (3), 1 states have call predecessors, (3), 1 states have call successors, (3) [2025-01-08 22:48:33,740 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-01-08 22:48:33,744 INFO L93 Difference]: Finished difference Result 210 states and 314 transitions. [2025-01-08 22:48:33,745 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2025-01-08 22:48:33,745 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 7.333333333333333) internal successors, (22), 3 states have internal predecessors, (22), 2 states have call successors, (4), 2 states have call predecessors, (4), 1 states have return successors, (3), 1 states have call predecessors, (3), 1 states have call successors, (3) Word has length 37 [2025-01-08 22:48:33,745 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-01-08 22:48:33,747 INFO L225 Difference]: With dead ends: 210 [2025-01-08 22:48:33,747 INFO L226 Difference]: Without dead ends: 168 [2025-01-08 22:48:33,747 INFO L434 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-01-08 22:48:33,751 INFO L435 NwaCegarLoop]: 151 mSDtfsCounter, 41 mSDsluCounter, 128 mSDsCounter, 0 mSdLazyCounter, 8 mSolverCounterSat, 1 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 43 SdHoareTripleChecker+Valid, 279 SdHoareTripleChecker+Invalid, 9 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 1 IncrementalHoareTripleChecker+Valid, 8 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2025-01-08 22:48:33,751 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [43 Valid, 279 Invalid, 9 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [1 Valid, 8 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2025-01-08 22:48:33,752 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 168 states. [2025-01-08 22:48:33,762 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 168 to 168. [2025-01-08 22:48:33,766 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 168 states, 152 states have (on average 1.4407894736842106) internal successors, (219), 155 states have internal predecessors, (219), 12 states have call successors, (12), 2 states have call predecessors, (12), 3 states have return successors, (14), 12 states have call predecessors, (14), 11 states have call successors, (14) [2025-01-08 22:48:33,767 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 168 states to 168 states and 245 transitions. [2025-01-08 22:48:33,771 INFO L78 Accepts]: Start accepts. Automaton has 168 states and 245 transitions. Word has length 37 [2025-01-08 22:48:33,771 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-01-08 22:48:33,771 INFO L471 AbstractCegarLoop]: Abstraction has 168 states and 245 transitions. [2025-01-08 22:48:33,771 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 7.333333333333333) internal successors, (22), 3 states have internal predecessors, (22), 2 states have call successors, (4), 2 states have call predecessors, (4), 1 states have return successors, (3), 1 states have call predecessors, (3), 1 states have call successors, (3) [2025-01-08 22:48:33,771 INFO L276 IsEmpty]: Start isEmpty. Operand 168 states and 245 transitions. [2025-01-08 22:48:33,772 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 40 [2025-01-08 22:48:33,772 INFO L210 NwaCegarLoop]: Found error trace [2025-01-08 22:48:33,772 INFO L218 NwaCegarLoop]: trace histogram [3, 3, 3, 3, 1, 1, 1, 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-01-08 22:48:33,772 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable1 [2025-01-08 22:48:33,772 INFO L396 AbstractCegarLoop]: === Iteration 3 === Targeting __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-01-08 22:48:33,773 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-01-08 22:48:33,773 INFO L85 PathProgramCache]: Analyzing trace with hash -1839520547, now seen corresponding path program 1 times [2025-01-08 22:48:33,773 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-01-08 22:48:33,773 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1215325334] [2025-01-08 22:48:33,773 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-01-08 22:48:33,773 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-01-08 22:48:33,782 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 39 statements into 1 equivalence classes. [2025-01-08 22:48:33,795 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 39 of 39 statements. [2025-01-08 22:48:33,795 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-01-08 22:48:33,795 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-01-08 22:48:33,836 INFO L134 CoverageAnalysis]: Checked inductivity of 15 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 15 trivial. 0 not checked. [2025-01-08 22:48:33,836 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-01-08 22:48:33,836 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1215325334] [2025-01-08 22:48:33,836 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1215325334] provided 1 perfect and 0 imperfect interpolant sequences [2025-01-08 22:48:33,836 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-01-08 22:48:33,836 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2025-01-08 22:48:33,836 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [207434472] [2025-01-08 22:48:33,837 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-01-08 22:48:33,837 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2025-01-08 22:48:33,837 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-01-08 22:48:33,837 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2025-01-08 22:48:33,837 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-01-08 22:48:33,838 INFO L87 Difference]: Start difference. First operand 168 states and 245 transitions. Second operand has 3 states, 3 states have (on average 8.0) internal successors, (24), 3 states have internal predecessors, (24), 2 states have call successors, (4), 2 states have call predecessors, (4), 1 states have return successors, (3), 1 states have call predecessors, (3), 1 states have call successors, (3) [2025-01-08 22:48:33,850 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-01-08 22:48:33,850 INFO L93 Difference]: Finished difference Result 306 states and 447 transitions. [2025-01-08 22:48:33,851 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2025-01-08 22:48:33,851 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 8.0) internal successors, (24), 3 states have internal predecessors, (24), 2 states have call successors, (4), 2 states have call predecessors, (4), 1 states have return successors, (3), 1 states have call predecessors, (3), 1 states have call successors, (3) Word has length 39 [2025-01-08 22:48:33,851 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-01-08 22:48:33,852 INFO L225 Difference]: With dead ends: 306 [2025-01-08 22:48:33,852 INFO L226 Difference]: Without dead ends: 248 [2025-01-08 22:48:33,853 INFO L434 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-01-08 22:48:33,853 INFO L435 NwaCegarLoop]: 133 mSDtfsCounter, 53 mSDsluCounter, 128 mSDsCounter, 0 mSdLazyCounter, 6 mSolverCounterSat, 1 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 55 SdHoareTripleChecker+Valid, 261 SdHoareTripleChecker+Invalid, 7 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 1 IncrementalHoareTripleChecker+Valid, 6 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2025-01-08 22:48:33,853 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [55 Valid, 261 Invalid, 7 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [1 Valid, 6 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2025-01-08 22:48:33,854 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 248 states. [2025-01-08 22:48:33,861 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 248 to 234. [2025-01-08 22:48:33,862 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 234 states, 214 states have (on average 1.4065420560747663) internal successors, (301), 218 states have internal predecessors, (301), 16 states have call successors, (16), 2 states have call predecessors, (16), 3 states have return successors, (17), 15 states have call predecessors, (17), 14 states have call successors, (17) [2025-01-08 22:48:33,863 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 234 states to 234 states and 334 transitions. [2025-01-08 22:48:33,863 INFO L78 Accepts]: Start accepts. Automaton has 234 states and 334 transitions. Word has length 39 [2025-01-08 22:48:33,863 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-01-08 22:48:33,863 INFO L471 AbstractCegarLoop]: Abstraction has 234 states and 334 transitions. [2025-01-08 22:48:33,863 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 8.0) internal successors, (24), 3 states have internal predecessors, (24), 2 states have call successors, (4), 2 states have call predecessors, (4), 1 states have return successors, (3), 1 states have call predecessors, (3), 1 states have call successors, (3) [2025-01-08 22:48:33,864 INFO L276 IsEmpty]: Start isEmpty. Operand 234 states and 334 transitions. [2025-01-08 22:48:33,864 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 40 [2025-01-08 22:48:33,864 INFO L210 NwaCegarLoop]: Found error trace [2025-01-08 22:48:33,865 INFO L218 NwaCegarLoop]: trace histogram [3, 3, 3, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-01-08 22:48:33,865 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable2 [2025-01-08 22:48:33,865 INFO L396 AbstractCegarLoop]: === Iteration 4 === Targeting __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-01-08 22:48:33,865 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-01-08 22:48:33,865 INFO L85 PathProgramCache]: Analyzing trace with hash -1850435365, now seen corresponding path program 1 times [2025-01-08 22:48:33,865 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-01-08 22:48:33,865 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1576289154] [2025-01-08 22:48:33,865 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-01-08 22:48:33,866 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-01-08 22:48:33,870 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 39 statements into 1 equivalence classes. [2025-01-08 22:48:33,901 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 39 of 39 statements. [2025-01-08 22:48:33,901 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-01-08 22:48:33,901 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-01-08 22:48:34,035 INFO L134 CoverageAnalysis]: Checked inductivity of 15 backedges. 3 proven. 3 refuted. 0 times theorem prover too weak. 9 trivial. 0 not checked. [2025-01-08 22:48:34,036 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-01-08 22:48:34,036 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1576289154] [2025-01-08 22:48:34,036 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1576289154] provided 0 perfect and 1 imperfect interpolant sequences [2025-01-08 22:48:34,036 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [23393030] [2025-01-08 22:48:34,036 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-01-08 22:48:34,036 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-01-08 22:48:34,037 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 [2025-01-08 22:48:34,042 INFO L229 MonitoredProcess]: Starting monitored process 3 with /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2025-01-08 22:48:34,045 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (3)] Waiting until timeout for monitored process [2025-01-08 22:48:34,076 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 39 statements into 1 equivalence classes. [2025-01-08 22:48:34,094 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 39 of 39 statements. [2025-01-08 22:48:34,095 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-01-08 22:48:34,095 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-01-08 22:48:34,095 INFO L256 TraceCheckSpWp]: Trace formula consists of 139 conjuncts, 14 conjuncts are in the unsatisfiable core [2025-01-08 22:48:34,097 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-01-08 22:48:34,147 INFO L134 CoverageAnalysis]: Checked inductivity of 15 backedges. 6 proven. 0 refuted. 0 times theorem prover too weak. 9 trivial. 0 not checked. [2025-01-08 22:48:34,149 INFO L308 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2025-01-08 22:48:34,149 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [23393030] provided 1 perfect and 0 imperfect interpolant sequences [2025-01-08 22:48:34,149 INFO L185 FreeRefinementEngine]: Found 1 perfect and 1 imperfect interpolant sequences. [2025-01-08 22:48:34,149 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [8] total 12 [2025-01-08 22:48:34,149 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [722363372] [2025-01-08 22:48:34,149 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-01-08 22:48:34,149 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2025-01-08 22:48:34,149 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-01-08 22:48:34,150 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2025-01-08 22:48:34,150 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=21, Invalid=111, Unknown=0, NotChecked=0, Total=132 [2025-01-08 22:48:34,150 INFO L87 Difference]: Start difference. First operand 234 states and 334 transitions. Second operand has 6 states, 6 states have (on average 4.5) internal successors, (27), 5 states have internal predecessors, (27), 2 states have call successors, (4), 2 states have call predecessors, (4), 2 states have return successors, (3), 2 states have call predecessors, (3), 1 states have call successors, (3) [2025-01-08 22:48:34,213 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-01-08 22:48:34,213 INFO L93 Difference]: Finished difference Result 407 states and 587 transitions. [2025-01-08 22:48:34,213 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2025-01-08 22:48:34,213 INFO L78 Accepts]: Start accepts. Automaton has has 6 states, 6 states have (on average 4.5) internal successors, (27), 5 states have internal predecessors, (27), 2 states have call successors, (4), 2 states have call predecessors, (4), 2 states have return successors, (3), 2 states have call predecessors, (3), 1 states have call successors, (3) Word has length 39 [2025-01-08 22:48:34,213 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-01-08 22:48:34,215 INFO L225 Difference]: With dead ends: 407 [2025-01-08 22:48:34,215 INFO L226 Difference]: Without dead ends: 330 [2025-01-08 22:48:34,215 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 47 GetRequests, 37 SyntacticMatches, 0 SemanticMatches, 10 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=21, Invalid=111, Unknown=0, NotChecked=0, Total=132 [2025-01-08 22:48:34,216 INFO L435 NwaCegarLoop]: 170 mSDtfsCounter, 73 mSDsluCounter, 625 mSDsCounter, 0 mSdLazyCounter, 72 mSolverCounterSat, 2 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 77 SdHoareTripleChecker+Valid, 795 SdHoareTripleChecker+Invalid, 74 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 2 IncrementalHoareTripleChecker+Valid, 72 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2025-01-08 22:48:34,216 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [77 Valid, 795 Invalid, 74 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [2 Valid, 72 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2025-01-08 22:48:34,217 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 330 states. [2025-01-08 22:48:34,225 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 330 to 329. [2025-01-08 22:48:34,225 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 329 states, 302 states have (on average 1.413907284768212) internal successors, (427), 307 states have internal predecessors, (427), 22 states have call successors, (22), 2 states have call predecessors, (22), 4 states have return successors, (26), 22 states have call predecessors, (26), 20 states have call successors, (26) [2025-01-08 22:48:34,227 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 329 states to 329 states and 475 transitions. [2025-01-08 22:48:34,227 INFO L78 Accepts]: Start accepts. Automaton has 329 states and 475 transitions. Word has length 39 [2025-01-08 22:48:34,227 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-01-08 22:48:34,227 INFO L471 AbstractCegarLoop]: Abstraction has 329 states and 475 transitions. [2025-01-08 22:48:34,227 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 6 states have (on average 4.5) internal successors, (27), 5 states have internal predecessors, (27), 2 states have call successors, (4), 2 states have call predecessors, (4), 2 states have return successors, (3), 2 states have call predecessors, (3), 1 states have call successors, (3) [2025-01-08 22:48:34,227 INFO L276 IsEmpty]: Start isEmpty. Operand 329 states and 475 transitions. [2025-01-08 22:48:34,228 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 41 [2025-01-08 22:48:34,228 INFO L210 NwaCegarLoop]: Found error trace [2025-01-08 22:48:34,228 INFO L218 NwaCegarLoop]: trace histogram [3, 3, 3, 3, 1, 1, 1, 1, 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-01-08 22:48:34,237 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (3)] Ended with exit code 0 [2025-01-08 22:48:34,433 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable3,3 /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-01-08 22:48:34,433 INFO L396 AbstractCegarLoop]: === Iteration 5 === Targeting __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-01-08 22:48:34,434 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-01-08 22:48:34,434 INFO L85 PathProgramCache]: Analyzing trace with hash 78549846, now seen corresponding path program 1 times [2025-01-08 22:48:34,434 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-01-08 22:48:34,434 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [709887779] [2025-01-08 22:48:34,434 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-01-08 22:48:34,434 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-01-08 22:48:34,438 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 40 statements into 1 equivalence classes. [2025-01-08 22:48:34,442 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 40 of 40 statements. [2025-01-08 22:48:34,442 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-01-08 22:48:34,442 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-01-08 22:48:34,473 INFO L134 CoverageAnalysis]: Checked inductivity of 15 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 15 trivial. 0 not checked. [2025-01-08 22:48:34,473 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-01-08 22:48:34,473 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [709887779] [2025-01-08 22:48:34,473 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [709887779] provided 1 perfect and 0 imperfect interpolant sequences [2025-01-08 22:48:34,473 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-01-08 22:48:34,473 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2025-01-08 22:48:34,473 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [499213923] [2025-01-08 22:48:34,473 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-01-08 22:48:34,473 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2025-01-08 22:48:34,473 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-01-08 22:48:34,474 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2025-01-08 22:48:34,474 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2025-01-08 22:48:34,474 INFO L87 Difference]: Start difference. First operand 329 states and 475 transitions. Second operand has 4 states, 4 states have (on average 6.25) internal successors, (25), 4 states have internal predecessors, (25), 2 states have call successors, (4), 2 states have call predecessors, (4), 1 states have return successors, (3), 1 states have call predecessors, (3), 1 states have call successors, (3) [2025-01-08 22:48:34,511 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-01-08 22:48:34,512 INFO L93 Difference]: Finished difference Result 517 states and 751 transitions. [2025-01-08 22:48:34,512 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2025-01-08 22:48:34,512 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 4 states have (on average 6.25) internal successors, (25), 4 states have internal predecessors, (25), 2 states have call successors, (4), 2 states have call predecessors, (4), 1 states have return successors, (3), 1 states have call predecessors, (3), 1 states have call successors, (3) Word has length 40 [2025-01-08 22:48:34,513 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-01-08 22:48:34,515 INFO L225 Difference]: With dead ends: 517 [2025-01-08 22:48:34,515 INFO L226 Difference]: Without dead ends: 465 [2025-01-08 22:48:34,515 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 5 GetRequests, 3 SyntacticMatches, 0 SemanticMatches, 2 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2025-01-08 22:48:34,516 INFO L435 NwaCegarLoop]: 154 mSDtfsCounter, 53 mSDsluCounter, 279 mSDsCounter, 0 mSdLazyCounter, 16 mSolverCounterSat, 1 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 57 SdHoareTripleChecker+Valid, 433 SdHoareTripleChecker+Invalid, 17 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 1 IncrementalHoareTripleChecker+Valid, 16 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2025-01-08 22:48:34,516 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [57 Valid, 433 Invalid, 17 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [1 Valid, 16 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2025-01-08 22:48:34,516 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 465 states. [2025-01-08 22:48:34,535 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 465 to 438. [2025-01-08 22:48:34,536 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 438 states, 401 states have (on average 1.4114713216957606) internal successors, (566), 409 states have internal predecessors, (566), 32 states have call successors, (32), 2 states have call predecessors, (32), 4 states have return successors, (36), 32 states have call predecessors, (36), 30 states have call successors, (36) [2025-01-08 22:48:34,542 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 438 states to 438 states and 634 transitions. [2025-01-08 22:48:34,546 INFO L78 Accepts]: Start accepts. Automaton has 438 states and 634 transitions. Word has length 40 [2025-01-08 22:48:34,546 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-01-08 22:48:34,546 INFO L471 AbstractCegarLoop]: Abstraction has 438 states and 634 transitions. [2025-01-08 22:48:34,546 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 6.25) internal successors, (25), 4 states have internal predecessors, (25), 2 states have call successors, (4), 2 states have call predecessors, (4), 1 states have return successors, (3), 1 states have call predecessors, (3), 1 states have call successors, (3) [2025-01-08 22:48:34,546 INFO L276 IsEmpty]: Start isEmpty. Operand 438 states and 634 transitions. [2025-01-08 22:48:34,547 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 41 [2025-01-08 22:48:34,547 INFO L210 NwaCegarLoop]: Found error trace [2025-01-08 22:48:34,547 INFO L218 NwaCegarLoop]: trace histogram [3, 3, 3, 3, 1, 1, 1, 1, 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-01-08 22:48:34,547 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable4 [2025-01-08 22:48:34,547 INFO L396 AbstractCegarLoop]: === Iteration 6 === Targeting __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-01-08 22:48:34,548 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-01-08 22:48:34,548 INFO L85 PathProgramCache]: Analyzing trace with hash -942518508, now seen corresponding path program 1 times [2025-01-08 22:48:34,548 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-01-08 22:48:34,548 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [235296161] [2025-01-08 22:48:34,548 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-01-08 22:48:34,548 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-01-08 22:48:34,553 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 40 statements into 1 equivalence classes. [2025-01-08 22:48:34,559 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 40 of 40 statements. [2025-01-08 22:48:34,559 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-01-08 22:48:34,559 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-01-08 22:48:34,580 INFO L134 CoverageAnalysis]: Checked inductivity of 15 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 15 trivial. 0 not checked. [2025-01-08 22:48:34,581 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-01-08 22:48:34,581 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [235296161] [2025-01-08 22:48:34,581 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [235296161] provided 1 perfect and 0 imperfect interpolant sequences [2025-01-08 22:48:34,581 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-01-08 22:48:34,581 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2025-01-08 22:48:34,581 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [406337069] [2025-01-08 22:48:34,581 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-01-08 22:48:34,581 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2025-01-08 22:48:34,581 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-01-08 22:48:34,581 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2025-01-08 22:48:34,581 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-01-08 22:48:34,581 INFO L87 Difference]: Start difference. First operand 438 states and 634 transitions. Second operand has 3 states, 3 states have (on average 8.333333333333334) internal successors, (25), 3 states have internal predecessors, (25), 2 states have call successors, (4), 2 states have call predecessors, (4), 1 states have return successors, (3), 1 states have call predecessors, (3), 1 states have call successors, (3) [2025-01-08 22:48:34,594 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-01-08 22:48:34,594 INFO L93 Difference]: Finished difference Result 448 states and 646 transitions. [2025-01-08 22:48:34,595 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2025-01-08 22:48:34,596 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 8.333333333333334) internal successors, (25), 3 states have internal predecessors, (25), 2 states have call successors, (4), 2 states have call predecessors, (4), 1 states have return successors, (3), 1 states have call predecessors, (3), 1 states have call successors, (3) Word has length 40 [2025-01-08 22:48:34,596 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-01-08 22:48:34,597 INFO L225 Difference]: With dead ends: 448 [2025-01-08 22:48:34,597 INFO L226 Difference]: Without dead ends: 441 [2025-01-08 22:48:34,598 INFO L434 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-01-08 22:48:34,600 INFO L435 NwaCegarLoop]: 133 mSDtfsCounter, 0 mSDsluCounter, 129 mSDsCounter, 0 mSdLazyCounter, 5 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 0 SdHoareTripleChecker+Valid, 262 SdHoareTripleChecker+Invalid, 5 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 5 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2025-01-08 22:48:34,600 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [0 Valid, 262 Invalid, 5 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 5 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2025-01-08 22:48:34,600 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 441 states. [2025-01-08 22:48:34,614 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 441 to 441. [2025-01-08 22:48:34,615 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 441 states, 404 states have (on average 1.4084158415841583) internal successors, (569), 412 states have internal predecessors, (569), 32 states have call successors, (32), 2 states have call predecessors, (32), 4 states have return successors, (36), 32 states have call predecessors, (36), 30 states have call successors, (36) [2025-01-08 22:48:34,618 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 441 states to 441 states and 637 transitions. [2025-01-08 22:48:34,618 INFO L78 Accepts]: Start accepts. Automaton has 441 states and 637 transitions. Word has length 40 [2025-01-08 22:48:34,619 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-01-08 22:48:34,619 INFO L471 AbstractCegarLoop]: Abstraction has 441 states and 637 transitions. [2025-01-08 22:48:34,619 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 8.333333333333334) internal successors, (25), 3 states have internal predecessors, (25), 2 states have call successors, (4), 2 states have call predecessors, (4), 1 states have return successors, (3), 1 states have call predecessors, (3), 1 states have call successors, (3) [2025-01-08 22:48:34,619 INFO L276 IsEmpty]: Start isEmpty. Operand 441 states and 637 transitions. [2025-01-08 22:48:34,620 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 42 [2025-01-08 22:48:34,621 INFO L210 NwaCegarLoop]: Found error trace [2025-01-08 22:48:34,621 INFO L218 NwaCegarLoop]: trace histogram [3, 3, 3, 3, 1, 1, 1, 1, 1, 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-01-08 22:48:34,621 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable5 [2025-01-08 22:48:34,621 INFO L396 AbstractCegarLoop]: === Iteration 7 === Targeting __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-01-08 22:48:34,621 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-01-08 22:48:34,621 INFO L85 PathProgramCache]: Analyzing trace with hash 1220877646, now seen corresponding path program 1 times [2025-01-08 22:48:34,622 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-01-08 22:48:34,622 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1845305441] [2025-01-08 22:48:34,622 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-01-08 22:48:34,622 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-01-08 22:48:34,628 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 41 statements into 1 equivalence classes. [2025-01-08 22:48:34,632 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 41 of 41 statements. [2025-01-08 22:48:34,632 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-01-08 22:48:34,632 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-01-08 22:48:34,670 INFO L134 CoverageAnalysis]: Checked inductivity of 15 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 15 trivial. 0 not checked. [2025-01-08 22:48:34,670 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-01-08 22:48:34,670 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1845305441] [2025-01-08 22:48:34,670 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1845305441] provided 1 perfect and 0 imperfect interpolant sequences [2025-01-08 22:48:34,670 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-01-08 22:48:34,670 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2025-01-08 22:48:34,671 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [748257835] [2025-01-08 22:48:34,671 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-01-08 22:48:34,671 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2025-01-08 22:48:34,671 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-01-08 22:48:34,671 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2025-01-08 22:48:34,671 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2025-01-08 22:48:34,671 INFO L87 Difference]: Start difference. First operand 441 states and 637 transitions. Second operand has 4 states, 4 states have (on average 6.5) internal successors, (26), 4 states have internal predecessors, (26), 2 states have call successors, (4), 2 states have call predecessors, (4), 1 states have return successors, (3), 1 states have call predecessors, (3), 1 states have call successors, (3) [2025-01-08 22:48:34,690 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-01-08 22:48:34,690 INFO L93 Difference]: Finished difference Result 742 states and 1080 transitions. [2025-01-08 22:48:34,691 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2025-01-08 22:48:34,691 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 4 states have (on average 6.5) internal successors, (26), 4 states have internal predecessors, (26), 2 states have call successors, (4), 2 states have call predecessors, (4), 1 states have return successors, (3), 1 states have call predecessors, (3), 1 states have call successors, (3) Word has length 41 [2025-01-08 22:48:34,691 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-01-08 22:48:34,693 INFO L225 Difference]: With dead ends: 742 [2025-01-08 22:48:34,693 INFO L226 Difference]: Without dead ends: 656 [2025-01-08 22:48:34,693 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 4 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 2 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2025-01-08 22:48:34,694 INFO L435 NwaCegarLoop]: 189 mSDtfsCounter, 54 mSDsluCounter, 317 mSDsCounter, 0 mSdLazyCounter, 14 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 56 SdHoareTripleChecker+Valid, 506 SdHoareTripleChecker+Invalid, 14 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 14 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2025-01-08 22:48:34,694 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [56 Valid, 506 Invalid, 14 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 14 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2025-01-08 22:48:34,695 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 656 states. [2025-01-08 22:48:34,711 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 656 to 561. [2025-01-08 22:48:34,712 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 561 states, 520 states have (on average 1.398076923076923) internal successors, (727), 526 states have internal predecessors, (727), 36 states have call successors, (36), 2 states have call predecessors, (36), 4 states have return successors, (40), 36 states have call predecessors, (40), 34 states have call successors, (40) [2025-01-08 22:48:34,715 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 561 states to 561 states and 803 transitions. [2025-01-08 22:48:34,715 INFO L78 Accepts]: Start accepts. Automaton has 561 states and 803 transitions. Word has length 41 [2025-01-08 22:48:34,715 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-01-08 22:48:34,715 INFO L471 AbstractCegarLoop]: Abstraction has 561 states and 803 transitions. [2025-01-08 22:48:34,715 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 6.5) internal successors, (26), 4 states have internal predecessors, (26), 2 states have call successors, (4), 2 states have call predecessors, (4), 1 states have return successors, (3), 1 states have call predecessors, (3), 1 states have call successors, (3) [2025-01-08 22:48:34,716 INFO L276 IsEmpty]: Start isEmpty. Operand 561 states and 803 transitions. [2025-01-08 22:48:34,716 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 42 [2025-01-08 22:48:34,716 INFO L210 NwaCegarLoop]: Found error trace [2025-01-08 22:48:34,717 INFO L218 NwaCegarLoop]: trace histogram [3, 3, 3, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-01-08 22:48:34,717 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable6 [2025-01-08 22:48:34,717 INFO L396 AbstractCegarLoop]: === Iteration 8 === Targeting __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-01-08 22:48:34,717 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-01-08 22:48:34,719 INFO L85 PathProgramCache]: Analyzing trace with hash 1446046901, now seen corresponding path program 1 times [2025-01-08 22:48:34,720 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-01-08 22:48:34,720 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1424798775] [2025-01-08 22:48:34,720 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-01-08 22:48:34,720 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-01-08 22:48:34,725 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 41 statements into 1 equivalence classes. [2025-01-08 22:48:34,735 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 41 of 41 statements. [2025-01-08 22:48:34,736 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-01-08 22:48:34,736 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-01-08 22:48:34,859 INFO L134 CoverageAnalysis]: Checked inductivity of 15 backedges. 3 proven. 3 refuted. 0 times theorem prover too weak. 9 trivial. 0 not checked. [2025-01-08 22:48:34,859 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-01-08 22:48:34,859 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1424798775] [2025-01-08 22:48:34,859 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1424798775] provided 0 perfect and 1 imperfect interpolant sequences [2025-01-08 22:48:34,860 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [692688001] [2025-01-08 22:48:34,860 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-01-08 22:48:34,860 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-01-08 22:48:34,860 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 [2025-01-08 22:48:34,863 INFO L229 MonitoredProcess]: Starting monitored process 4 with /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2025-01-08 22:48:34,865 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (4)] Waiting until timeout for monitored process [2025-01-08 22:48:34,897 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 41 statements into 1 equivalence classes. [2025-01-08 22:48:34,912 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 41 of 41 statements. [2025-01-08 22:48:34,912 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-01-08 22:48:34,912 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-01-08 22:48:34,913 INFO L256 TraceCheckSpWp]: Trace formula consists of 142 conjuncts, 9 conjuncts are in the unsatisfiable core [2025-01-08 22:48:34,914 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-01-08 22:48:34,947 INFO L134 CoverageAnalysis]: Checked inductivity of 15 backedges. 0 proven. 6 refuted. 0 times theorem prover too weak. 9 trivial. 0 not checked. [2025-01-08 22:48:34,947 INFO L312 TraceCheckSpWp]: Computing backward predicates... [2025-01-08 22:48:35,116 INFO L134 CoverageAnalysis]: Checked inductivity of 15 backedges. 0 proven. 6 refuted. 0 times theorem prover too weak. 9 trivial. 0 not checked. [2025-01-08 22:48:35,116 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [692688001] provided 0 perfect and 2 imperfect interpolant sequences [2025-01-08 22:48:35,116 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2025-01-08 22:48:35,116 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [8, 6, 6] total 14 [2025-01-08 22:48:35,116 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1071877720] [2025-01-08 22:48:35,117 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2025-01-08 22:48:35,117 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 14 states [2025-01-08 22:48:35,117 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-01-08 22:48:35,117 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 14 interpolants. [2025-01-08 22:48:35,117 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=29, Invalid=153, Unknown=0, NotChecked=0, Total=182 [2025-01-08 22:48:35,117 INFO L87 Difference]: Start difference. First operand 561 states and 803 transitions. Second operand has 14 states, 14 states have (on average 3.357142857142857) internal successors, (47), 11 states have internal predecessors, (47), 5 states have call successors, (8), 2 states have call predecessors, (8), 3 states have return successors, (9), 7 states have call predecessors, (9), 4 states have call successors, (9) [2025-01-08 22:48:35,360 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-01-08 22:48:35,360 INFO L93 Difference]: Finished difference Result 1416 states and 2037 transitions. [2025-01-08 22:48:35,360 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 13 states. [2025-01-08 22:48:35,360 INFO L78 Accepts]: Start accepts. Automaton has has 14 states, 14 states have (on average 3.357142857142857) internal successors, (47), 11 states have internal predecessors, (47), 5 states have call successors, (8), 2 states have call predecessors, (8), 3 states have return successors, (9), 7 states have call predecessors, (9), 4 states have call successors, (9) Word has length 41 [2025-01-08 22:48:35,360 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-01-08 22:48:35,363 INFO L225 Difference]: With dead ends: 1416 [2025-01-08 22:48:35,363 INFO L226 Difference]: Without dead ends: 928 [2025-01-08 22:48:35,364 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 94 GetRequests, 77 SyntacticMatches, 0 SemanticMatches, 17 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 16 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=52, Invalid=290, Unknown=0, NotChecked=0, Total=342 [2025-01-08 22:48:35,364 INFO L435 NwaCegarLoop]: 121 mSDtfsCounter, 112 mSDsluCounter, 1174 mSDsCounter, 0 mSdLazyCounter, 316 mSolverCounterSat, 12 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 114 SdHoareTripleChecker+Valid, 1295 SdHoareTripleChecker+Invalid, 328 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 12 IncrementalHoareTripleChecker+Valid, 316 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.2s IncrementalHoareTripleChecker+Time [2025-01-08 22:48:35,365 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [114 Valid, 1295 Invalid, 328 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [12 Valid, 316 Invalid, 0 Unknown, 0 Unchecked, 0.2s Time] [2025-01-08 22:48:35,365 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 928 states. [2025-01-08 22:48:35,379 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 928 to 866. [2025-01-08 22:48:35,380 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 866 states, 805 states have (on average 1.377639751552795) internal successors, (1109), 804 states have internal predecessors, (1109), 56 states have call successors, (56), 2 states have call predecessors, (56), 4 states have return successors, (68), 65 states have call predecessors, (68), 54 states have call successors, (68) [2025-01-08 22:48:35,383 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 866 states to 866 states and 1233 transitions. [2025-01-08 22:48:35,384 INFO L78 Accepts]: Start accepts. Automaton has 866 states and 1233 transitions. Word has length 41 [2025-01-08 22:48:35,384 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-01-08 22:48:35,384 INFO L471 AbstractCegarLoop]: Abstraction has 866 states and 1233 transitions. [2025-01-08 22:48:35,384 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 14 states, 14 states have (on average 3.357142857142857) internal successors, (47), 11 states have internal predecessors, (47), 5 states have call successors, (8), 2 states have call predecessors, (8), 3 states have return successors, (9), 7 states have call predecessors, (9), 4 states have call successors, (9) [2025-01-08 22:48:35,384 INFO L276 IsEmpty]: Start isEmpty. Operand 866 states and 1233 transitions. [2025-01-08 22:48:35,385 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 44 [2025-01-08 22:48:35,385 INFO L210 NwaCegarLoop]: Found error trace [2025-01-08 22:48:35,385 INFO L218 NwaCegarLoop]: trace histogram [3, 3, 3, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-01-08 22:48:35,391 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (4)] Forceful destruction successful, exit code 0 [2025-01-08 22:48:35,585 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable7,4 /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-01-08 22:48:35,585 INFO L396 AbstractCegarLoop]: === Iteration 9 === Targeting __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-01-08 22:48:35,586 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-01-08 22:48:35,586 INFO L85 PathProgramCache]: Analyzing trace with hash 1354534519, now seen corresponding path program 1 times [2025-01-08 22:48:35,586 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-01-08 22:48:35,586 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1018332744] [2025-01-08 22:48:35,586 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-01-08 22:48:35,586 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-01-08 22:48:35,594 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 43 statements into 1 equivalence classes. [2025-01-08 22:48:35,614 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 43 of 43 statements. [2025-01-08 22:48:35,615 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-01-08 22:48:35,616 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-01-08 22:48:35,735 INFO L134 CoverageAnalysis]: Checked inductivity of 15 backedges. 3 proven. 3 refuted. 0 times theorem prover too weak. 9 trivial. 0 not checked. [2025-01-08 22:48:35,736 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-01-08 22:48:35,736 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1018332744] [2025-01-08 22:48:35,736 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1018332744] provided 0 perfect and 1 imperfect interpolant sequences [2025-01-08 22:48:35,736 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [2042003741] [2025-01-08 22:48:35,736 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-01-08 22:48:35,736 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-01-08 22:48:35,736 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 [2025-01-08 22:48:35,741 INFO L229 MonitoredProcess]: Starting monitored process 5 with /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2025-01-08 22:48:35,742 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (5)] Waiting until timeout for monitored process [2025-01-08 22:48:35,769 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 43 statements into 1 equivalence classes. [2025-01-08 22:48:35,785 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 43 of 43 statements. [2025-01-08 22:48:35,785 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-01-08 22:48:35,785 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-01-08 22:48:35,786 INFO L256 TraceCheckSpWp]: Trace formula consists of 139 conjuncts, 15 conjuncts are in the unsatisfiable core [2025-01-08 22:48:35,788 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-01-08 22:48:35,941 INFO L134 CoverageAnalysis]: Checked inductivity of 15 backedges. 6 proven. 0 refuted. 0 times theorem prover too weak. 9 trivial. 0 not checked. [2025-01-08 22:48:35,941 INFO L308 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2025-01-08 22:48:35,941 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [2042003741] provided 1 perfect and 0 imperfect interpolant sequences [2025-01-08 22:48:35,941 INFO L185 FreeRefinementEngine]: Found 1 perfect and 1 imperfect interpolant sequences. [2025-01-08 22:48:35,942 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [8] imperfect sequences [8] total 14 [2025-01-08 22:48:35,942 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [132793911] [2025-01-08 22:48:35,942 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-01-08 22:48:35,942 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 8 states [2025-01-08 22:48:35,942 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-01-08 22:48:35,942 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2025-01-08 22:48:35,942 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=26, Invalid=156, Unknown=0, NotChecked=0, Total=182 [2025-01-08 22:48:35,942 INFO L87 Difference]: Start difference. First operand 866 states and 1233 transitions. Second operand has 8 states, 8 states have (on average 3.875) internal successors, (31), 7 states have internal predecessors, (31), 2 states have call successors, (4), 2 states have call predecessors, (4), 2 states have return successors, (3), 2 states have call predecessors, (3), 1 states have call successors, (3) [2025-01-08 22:48:36,155 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-01-08 22:48:36,155 INFO L93 Difference]: Finished difference Result 1136 states and 1625 transitions. [2025-01-08 22:48:36,158 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2025-01-08 22:48:36,158 INFO L78 Accepts]: Start accepts. Automaton has has 8 states, 8 states have (on average 3.875) internal successors, (31), 7 states have internal predecessors, (31), 2 states have call successors, (4), 2 states have call predecessors, (4), 2 states have return successors, (3), 2 states have call predecessors, (3), 1 states have call successors, (3) Word has length 43 [2025-01-08 22:48:36,159 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-01-08 22:48:36,166 INFO L225 Difference]: With dead ends: 1136 [2025-01-08 22:48:36,166 INFO L226 Difference]: Without dead ends: 907 [2025-01-08 22:48:36,167 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 53 GetRequests, 39 SyntacticMatches, 0 SemanticMatches, 14 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 9 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=34, Invalid=206, Unknown=0, NotChecked=0, Total=240 [2025-01-08 22:48:36,167 INFO L435 NwaCegarLoop]: 152 mSDtfsCounter, 82 mSDsluCounter, 861 mSDsCounter, 0 mSdLazyCounter, 150 mSolverCounterSat, 1 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 86 SdHoareTripleChecker+Valid, 1013 SdHoareTripleChecker+Invalid, 151 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 1 IncrementalHoareTripleChecker+Valid, 150 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.2s IncrementalHoareTripleChecker+Time [2025-01-08 22:48:36,167 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [86 Valid, 1013 Invalid, 151 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [1 Valid, 150 Invalid, 0 Unknown, 0 Unchecked, 0.2s Time] [2025-01-08 22:48:36,168 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 907 states. [2025-01-08 22:48:36,212 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 907 to 896. [2025-01-08 22:48:36,217 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 896 states, 835 states have (on average 1.362874251497006) internal successors, (1138), 834 states have internal predecessors, (1138), 56 states have call successors, (56), 2 states have call predecessors, (56), 4 states have return successors, (68), 65 states have call predecessors, (68), 54 states have call successors, (68) [2025-01-08 22:48:36,225 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 896 states to 896 states and 1262 transitions. [2025-01-08 22:48:36,226 INFO L78 Accepts]: Start accepts. Automaton has 896 states and 1262 transitions. Word has length 43 [2025-01-08 22:48:36,226 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-01-08 22:48:36,226 INFO L471 AbstractCegarLoop]: Abstraction has 896 states and 1262 transitions. [2025-01-08 22:48:36,226 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 8 states, 8 states have (on average 3.875) internal successors, (31), 7 states have internal predecessors, (31), 2 states have call successors, (4), 2 states have call predecessors, (4), 2 states have return successors, (3), 2 states have call predecessors, (3), 1 states have call successors, (3) [2025-01-08 22:48:36,226 INFO L276 IsEmpty]: Start isEmpty. Operand 896 states and 1262 transitions. [2025-01-08 22:48:36,232 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 45 [2025-01-08 22:48:36,233 INFO L210 NwaCegarLoop]: Found error trace [2025-01-08 22:48:36,233 INFO L218 NwaCegarLoop]: trace histogram [3, 3, 3, 3, 1, 1, 1, 1, 1, 1, 1, 1, 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-01-08 22:48:36,240 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (5)] Ended with exit code 0 [2025-01-08 22:48:36,433 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 5 /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable8 [2025-01-08 22:48:36,433 INFO L396 AbstractCegarLoop]: === Iteration 10 === Targeting __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-01-08 22:48:36,434 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-01-08 22:48:36,434 INFO L85 PathProgramCache]: Analyzing trace with hash -1079639702, now seen corresponding path program 1 times [2025-01-08 22:48:36,434 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-01-08 22:48:36,434 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1381706521] [2025-01-08 22:48:36,434 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-01-08 22:48:36,434 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-01-08 22:48:36,448 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 44 statements into 1 equivalence classes. [2025-01-08 22:48:36,456 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 44 of 44 statements. [2025-01-08 22:48:36,456 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-01-08 22:48:36,456 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-01-08 22:48:36,502 INFO L134 CoverageAnalysis]: Checked inductivity of 15 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 15 trivial. 0 not checked. [2025-01-08 22:48:36,502 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-01-08 22:48:36,502 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1381706521] [2025-01-08 22:48:36,502 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1381706521] provided 1 perfect and 0 imperfect interpolant sequences [2025-01-08 22:48:36,502 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-01-08 22:48:36,502 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2025-01-08 22:48:36,502 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1694742144] [2025-01-08 22:48:36,502 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-01-08 22:48:36,502 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2025-01-08 22:48:36,503 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-01-08 22:48:36,503 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2025-01-08 22:48:36,503 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2025-01-08 22:48:36,503 INFO L87 Difference]: Start difference. First operand 896 states and 1262 transitions. Second operand has 4 states, 4 states have (on average 7.25) internal successors, (29), 4 states have internal predecessors, (29), 2 states have call successors, (4), 2 states have call predecessors, (4), 1 states have return successors, (3), 1 states have call predecessors, (3), 1 states have call successors, (3) [2025-01-08 22:48:36,531 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-01-08 22:48:36,531 INFO L93 Difference]: Finished difference Result 909 states and 1277 transitions. [2025-01-08 22:48:36,535 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2025-01-08 22:48:36,535 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 4 states have (on average 7.25) internal successors, (29), 4 states have internal predecessors, (29), 2 states have call successors, (4), 2 states have call predecessors, (4), 1 states have return successors, (3), 1 states have call predecessors, (3), 1 states have call successors, (3) Word has length 44 [2025-01-08 22:48:36,535 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-01-08 22:48:36,537 INFO L225 Difference]: With dead ends: 909 [2025-01-08 22:48:36,537 INFO L226 Difference]: Without dead ends: 902 [2025-01-08 22:48:36,538 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 4 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 2 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2025-01-08 22:48:36,538 INFO L435 NwaCegarLoop]: 132 mSDtfsCounter, 0 mSDsluCounter, 258 mSDsCounter, 0 mSdLazyCounter, 11 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 0 SdHoareTripleChecker+Valid, 390 SdHoareTripleChecker+Invalid, 11 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 11 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2025-01-08 22:48:36,538 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [0 Valid, 390 Invalid, 11 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 11 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2025-01-08 22:48:36,542 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 902 states. [2025-01-08 22:48:36,576 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 902 to 899. [2025-01-08 22:48:36,577 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 899 states, 838 states have (on average 1.3615751789976134) internal successors, (1141), 837 states have internal predecessors, (1141), 56 states have call successors, (56), 2 states have call predecessors, (56), 4 states have return successors, (68), 65 states have call predecessors, (68), 54 states have call successors, (68) [2025-01-08 22:48:36,584 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 899 states to 899 states and 1265 transitions. [2025-01-08 22:48:36,584 INFO L78 Accepts]: Start accepts. Automaton has 899 states and 1265 transitions. Word has length 44 [2025-01-08 22:48:36,584 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-01-08 22:48:36,584 INFO L471 AbstractCegarLoop]: Abstraction has 899 states and 1265 transitions. [2025-01-08 22:48:36,585 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 7.25) internal successors, (29), 4 states have internal predecessors, (29), 2 states have call successors, (4), 2 states have call predecessors, (4), 1 states have return successors, (3), 1 states have call predecessors, (3), 1 states have call successors, (3) [2025-01-08 22:48:36,585 INFO L276 IsEmpty]: Start isEmpty. Operand 899 states and 1265 transitions. [2025-01-08 22:48:36,586 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 45 [2025-01-08 22:48:36,586 INFO L210 NwaCegarLoop]: Found error trace [2025-01-08 22:48:36,586 INFO L218 NwaCegarLoop]: trace histogram [3, 3, 3, 3, 1, 1, 1, 1, 1, 1, 1, 1, 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-01-08 22:48:36,586 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable9 [2025-01-08 22:48:36,586 INFO L396 AbstractCegarLoop]: === Iteration 11 === Targeting __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-01-08 22:48:36,586 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-01-08 22:48:36,586 INFO L85 PathProgramCache]: Analyzing trace with hash 695367660, now seen corresponding path program 1 times [2025-01-08 22:48:36,586 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-01-08 22:48:36,586 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [875357445] [2025-01-08 22:48:36,586 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-01-08 22:48:36,586 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-01-08 22:48:36,595 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 44 statements into 1 equivalence classes. [2025-01-08 22:48:36,605 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 44 of 44 statements. [2025-01-08 22:48:36,605 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-01-08 22:48:36,605 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-01-08 22:48:36,669 INFO L134 CoverageAnalysis]: Checked inductivity of 15 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 15 trivial. 0 not checked. [2025-01-08 22:48:36,669 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-01-08 22:48:36,669 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [875357445] [2025-01-08 22:48:36,669 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [875357445] provided 1 perfect and 0 imperfect interpolant sequences [2025-01-08 22:48:36,669 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-01-08 22:48:36,669 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2025-01-08 22:48:36,669 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1928332178] [2025-01-08 22:48:36,669 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-01-08 22:48:36,670 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2025-01-08 22:48:36,670 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-01-08 22:48:36,670 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2025-01-08 22:48:36,670 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2025-01-08 22:48:36,670 INFO L87 Difference]: Start difference. First operand 899 states and 1265 transitions. Second operand has 5 states, 4 states have (on average 7.25) internal successors, (29), 4 states have internal predecessors, (29), 2 states have call successors, (4), 2 states have call predecessors, (4), 1 states have return successors, (3), 1 states have call predecessors, (3), 1 states have call successors, (3) [2025-01-08 22:48:36,697 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-01-08 22:48:36,697 INFO L93 Difference]: Finished difference Result 906 states and 1271 transitions. [2025-01-08 22:48:36,698 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2025-01-08 22:48:36,698 INFO L78 Accepts]: Start accepts. Automaton has has 5 states, 4 states have (on average 7.25) internal successors, (29), 4 states have internal predecessors, (29), 2 states have call successors, (4), 2 states have call predecessors, (4), 1 states have return successors, (3), 1 states have call predecessors, (3), 1 states have call successors, (3) Word has length 44 [2025-01-08 22:48:36,698 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-01-08 22:48:36,702 INFO L225 Difference]: With dead ends: 906 [2025-01-08 22:48:36,702 INFO L226 Difference]: Without dead ends: 899 [2025-01-08 22:48:36,703 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 6 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 4 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=11, Invalid=19, Unknown=0, NotChecked=0, Total=30 [2025-01-08 22:48:36,703 INFO L435 NwaCegarLoop]: 132 mSDtfsCounter, 3 mSDsluCounter, 387 mSDsCounter, 0 mSdLazyCounter, 15 mSolverCounterSat, 1 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 3 SdHoareTripleChecker+Valid, 519 SdHoareTripleChecker+Invalid, 16 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 1 IncrementalHoareTripleChecker+Valid, 15 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2025-01-08 22:48:36,703 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [3 Valid, 519 Invalid, 16 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [1 Valid, 15 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2025-01-08 22:48:36,704 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 899 states. [2025-01-08 22:48:36,732 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 899 to 893. [2025-01-08 22:48:36,733 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 893 states, 832 states have (on average 1.359375) internal successors, (1131), 831 states have internal predecessors, (1131), 56 states have call successors, (56), 2 states have call predecessors, (56), 4 states have return successors, (68), 65 states have call predecessors, (68), 54 states have call successors, (68) [2025-01-08 22:48:36,736 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 893 states to 893 states and 1255 transitions. [2025-01-08 22:48:36,736 INFO L78 Accepts]: Start accepts. Automaton has 893 states and 1255 transitions. Word has length 44 [2025-01-08 22:48:36,737 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-01-08 22:48:36,737 INFO L471 AbstractCegarLoop]: Abstraction has 893 states and 1255 transitions. [2025-01-08 22:48:36,737 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 4 states have (on average 7.25) internal successors, (29), 4 states have internal predecessors, (29), 2 states have call successors, (4), 2 states have call predecessors, (4), 1 states have return successors, (3), 1 states have call predecessors, (3), 1 states have call successors, (3) [2025-01-08 22:48:36,737 INFO L276 IsEmpty]: Start isEmpty. Operand 893 states and 1255 transitions. [2025-01-08 22:48:36,738 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 46 [2025-01-08 22:48:36,738 INFO L210 NwaCegarLoop]: Found error trace [2025-01-08 22:48:36,738 INFO L218 NwaCegarLoop]: trace histogram [3, 3, 3, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-01-08 22:48:36,738 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable10 [2025-01-08 22:48:36,738 INFO L396 AbstractCegarLoop]: === Iteration 12 === Targeting __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-01-08 22:48:36,739 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-01-08 22:48:36,739 INFO L85 PathProgramCache]: Analyzing trace with hash 237805108, now seen corresponding path program 1 times [2025-01-08 22:48:36,739 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-01-08 22:48:36,739 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1870774480] [2025-01-08 22:48:36,739 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-01-08 22:48:36,739 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-01-08 22:48:36,743 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 45 statements into 1 equivalence classes. [2025-01-08 22:48:36,753 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 45 of 45 statements. [2025-01-08 22:48:36,753 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-01-08 22:48:36,753 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-01-08 22:48:36,900 INFO L134 CoverageAnalysis]: Checked inductivity of 15 backedges. 3 proven. 3 refuted. 0 times theorem prover too weak. 9 trivial. 0 not checked. [2025-01-08 22:48:36,900 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-01-08 22:48:36,900 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1870774480] [2025-01-08 22:48:36,900 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1870774480] provided 0 perfect and 1 imperfect interpolant sequences [2025-01-08 22:48:36,900 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [228908360] [2025-01-08 22:48:36,900 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-01-08 22:48:36,900 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-01-08 22:48:36,900 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 [2025-01-08 22:48:36,902 INFO L229 MonitoredProcess]: Starting monitored process 6 with /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2025-01-08 22:48:36,904 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (6)] Waiting until timeout for monitored process [2025-01-08 22:48:36,932 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 45 statements into 1 equivalence classes. [2025-01-08 22:48:36,948 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 45 of 45 statements. [2025-01-08 22:48:36,949 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-01-08 22:48:36,949 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-01-08 22:48:36,949 INFO L256 TraceCheckSpWp]: Trace formula consists of 142 conjuncts, 26 conjuncts are in the unsatisfiable core [2025-01-08 22:48:36,952 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-01-08 22:48:37,033 INFO L134 CoverageAnalysis]: Checked inductivity of 15 backedges. 6 proven. 3 refuted. 0 times theorem prover too weak. 6 trivial. 0 not checked. [2025-01-08 22:48:37,033 INFO L312 TraceCheckSpWp]: Computing backward predicates... [2025-01-08 22:48:37,280 INFO L134 CoverageAnalysis]: Checked inductivity of 15 backedges. 6 proven. 3 refuted. 0 times theorem prover too weak. 6 trivial. 0 not checked. [2025-01-08 22:48:37,281 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [228908360] provided 0 perfect and 2 imperfect interpolant sequences [2025-01-08 22:48:37,281 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2025-01-08 22:48:37,281 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [8, 11, 12] total 23 [2025-01-08 22:48:37,281 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [54106312] [2025-01-08 22:48:37,281 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2025-01-08 22:48:37,281 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 23 states [2025-01-08 22:48:37,281 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-01-08 22:48:37,282 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 23 interpolants. [2025-01-08 22:48:37,282 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=67, Invalid=439, Unknown=0, NotChecked=0, Total=506 [2025-01-08 22:48:37,282 INFO L87 Difference]: Start difference. First operand 893 states and 1255 transitions. Second operand has 23 states, 22 states have (on average 2.8636363636363638) internal successors, (63), 19 states have internal predecessors, (63), 4 states have call successors, (5), 2 states have call predecessors, (5), 5 states have return successors, (6), 6 states have call predecessors, (6), 3 states have call successors, (6) [2025-01-08 22:48:37,710 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-01-08 22:48:37,710 INFO L93 Difference]: Finished difference Result 1058 states and 1485 transitions. [2025-01-08 22:48:37,710 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 19 states. [2025-01-08 22:48:37,711 INFO L78 Accepts]: Start accepts. Automaton has has 23 states, 22 states have (on average 2.8636363636363638) internal successors, (63), 19 states have internal predecessors, (63), 4 states have call successors, (5), 2 states have call predecessors, (5), 5 states have return successors, (6), 6 states have call predecessors, (6), 3 states have call successors, (6) Word has length 45 [2025-01-08 22:48:37,711 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-01-08 22:48:37,713 INFO L225 Difference]: With dead ends: 1058 [2025-01-08 22:48:37,713 INFO L226 Difference]: Without dead ends: 808 [2025-01-08 22:48:37,714 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 103 GetRequests, 76 SyntacticMatches, 0 SemanticMatches, 27 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 113 ImplicationChecksByTransitivity, 0.3s TimeCoverageRelationStatistics Valid=129, Invalid=683, Unknown=0, NotChecked=0, Total=812 [2025-01-08 22:48:37,714 INFO L435 NwaCegarLoop]: 144 mSDtfsCounter, 170 mSDsluCounter, 1951 mSDsCounter, 0 mSdLazyCounter, 591 mSolverCounterSat, 11 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.3s Time, 0 mProtectedPredicate, 0 mProtectedAction, 176 SdHoareTripleChecker+Valid, 2095 SdHoareTripleChecker+Invalid, 602 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 11 IncrementalHoareTripleChecker+Valid, 591 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.3s IncrementalHoareTripleChecker+Time [2025-01-08 22:48:37,714 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [176 Valid, 2095 Invalid, 602 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [11 Valid, 591 Invalid, 0 Unknown, 0 Unchecked, 0.3s Time] [2025-01-08 22:48:37,716 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 808 states. [2025-01-08 22:48:37,729 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 808 to 732. [2025-01-08 22:48:37,729 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 732 states, 683 states have (on average 1.342606149341142) internal successors, (917), 682 states have internal predecessors, (917), 44 states have call successors, (44), 2 states have call predecessors, (44), 4 states have return successors, (56), 53 states have call predecessors, (56), 42 states have call successors, (56) [2025-01-08 22:48:37,732 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 732 states to 732 states and 1017 transitions. [2025-01-08 22:48:37,732 INFO L78 Accepts]: Start accepts. Automaton has 732 states and 1017 transitions. Word has length 45 [2025-01-08 22:48:37,732 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-01-08 22:48:37,732 INFO L471 AbstractCegarLoop]: Abstraction has 732 states and 1017 transitions. [2025-01-08 22:48:37,732 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 23 states, 22 states have (on average 2.8636363636363638) internal successors, (63), 19 states have internal predecessors, (63), 4 states have call successors, (5), 2 states have call predecessors, (5), 5 states have return successors, (6), 6 states have call predecessors, (6), 3 states have call successors, (6) [2025-01-08 22:48:37,732 INFO L276 IsEmpty]: Start isEmpty. Operand 732 states and 1017 transitions. [2025-01-08 22:48:37,733 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 47 [2025-01-08 22:48:37,733 INFO L210 NwaCegarLoop]: Found error trace [2025-01-08 22:48:37,733 INFO L218 NwaCegarLoop]: trace histogram [3, 3, 3, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-01-08 22:48:37,740 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (6)] Forceful destruction successful, exit code 0 [2025-01-08 22:48:37,937 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 6 /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable11 [2025-01-08 22:48:37,937 INFO L396 AbstractCegarLoop]: === Iteration 13 === Targeting __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-01-08 22:48:37,937 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-01-08 22:48:37,938 INFO L85 PathProgramCache]: Analyzing trace with hash 1905156440, now seen corresponding path program 1 times [2025-01-08 22:48:37,938 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-01-08 22:48:37,938 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [41135288] [2025-01-08 22:48:37,938 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-01-08 22:48:37,938 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-01-08 22:48:37,942 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 46 statements into 1 equivalence classes. [2025-01-08 22:48:37,945 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 46 of 46 statements. [2025-01-08 22:48:37,945 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-01-08 22:48:37,945 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-01-08 22:48:37,972 INFO L134 CoverageAnalysis]: Checked inductivity of 15 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 15 trivial. 0 not checked. [2025-01-08 22:48:37,972 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-01-08 22:48:37,972 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [41135288] [2025-01-08 22:48:37,972 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [41135288] provided 1 perfect and 0 imperfect interpolant sequences [2025-01-08 22:48:37,972 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-01-08 22:48:37,972 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2025-01-08 22:48:37,972 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1730217849] [2025-01-08 22:48:37,972 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-01-08 22:48:37,973 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2025-01-08 22:48:37,973 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-01-08 22:48:37,973 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2025-01-08 22:48:37,973 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2025-01-08 22:48:37,973 INFO L87 Difference]: Start difference. First operand 732 states and 1017 transitions. Second operand has 4 states, 4 states have (on average 8.0) internal successors, (32), 4 states have internal predecessors, (32), 2 states have call successors, (4), 2 states have call predecessors, (4), 1 states have return successors, (3), 1 states have call predecessors, (3), 1 states have call successors, (3) [2025-01-08 22:48:37,992 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-01-08 22:48:37,992 INFO L93 Difference]: Finished difference Result 775 states and 1074 transitions. [2025-01-08 22:48:37,992 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2025-01-08 22:48:37,992 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 4 states have (on average 8.0) internal successors, (32), 4 states have internal predecessors, (32), 2 states have call successors, (4), 2 states have call predecessors, (4), 1 states have return successors, (3), 1 states have call predecessors, (3), 1 states have call successors, (3) Word has length 46 [2025-01-08 22:48:37,992 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-01-08 22:48:37,994 INFO L225 Difference]: With dead ends: 775 [2025-01-08 22:48:37,994 INFO L226 Difference]: Without dead ends: 688 [2025-01-08 22:48:37,995 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 4 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 2 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2025-01-08 22:48:37,996 INFO L435 NwaCegarLoop]: 179 mSDtfsCounter, 39 mSDsluCounter, 303 mSDsCounter, 0 mSdLazyCounter, 15 mSolverCounterSat, 1 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 41 SdHoareTripleChecker+Valid, 482 SdHoareTripleChecker+Invalid, 16 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 1 IncrementalHoareTripleChecker+Valid, 15 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2025-01-08 22:48:37,996 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [41 Valid, 482 Invalid, 16 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [1 Valid, 15 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2025-01-08 22:48:37,997 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 688 states. [2025-01-08 22:48:38,005 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 688 to 565. [2025-01-08 22:48:38,006 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 565 states, 530 states have (on average 1.3075471698113208) internal successors, (693), 525 states have internal predecessors, (693), 30 states have call successors, (30), 2 states have call predecessors, (30), 4 states have return successors, (42), 39 states have call predecessors, (42), 28 states have call successors, (42) [2025-01-08 22:48:38,008 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 565 states to 565 states and 765 transitions. [2025-01-08 22:48:38,009 INFO L78 Accepts]: Start accepts. Automaton has 565 states and 765 transitions. Word has length 46 [2025-01-08 22:48:38,009 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-01-08 22:48:38,009 INFO L471 AbstractCegarLoop]: Abstraction has 565 states and 765 transitions. [2025-01-08 22:48:38,009 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 8.0) internal successors, (32), 4 states have internal predecessors, (32), 2 states have call successors, (4), 2 states have call predecessors, (4), 1 states have return successors, (3), 1 states have call predecessors, (3), 1 states have call successors, (3) [2025-01-08 22:48:38,009 INFO L276 IsEmpty]: Start isEmpty. Operand 565 states and 765 transitions. [2025-01-08 22:48:38,010 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 47 [2025-01-08 22:48:38,010 INFO L210 NwaCegarLoop]: Found error trace [2025-01-08 22:48:38,010 INFO L218 NwaCegarLoop]: trace histogram [3, 3, 3, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-01-08 22:48:38,010 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable12 [2025-01-08 22:48:38,010 INFO L396 AbstractCegarLoop]: === Iteration 14 === Targeting __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-01-08 22:48:38,010 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-01-08 22:48:38,010 INFO L85 PathProgramCache]: Analyzing trace with hash 1930317983, now seen corresponding path program 1 times [2025-01-08 22:48:38,010 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-01-08 22:48:38,010 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [938197165] [2025-01-08 22:48:38,010 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-01-08 22:48:38,010 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-01-08 22:48:38,014 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 46 statements into 1 equivalence classes. [2025-01-08 22:48:38,041 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 46 of 46 statements. [2025-01-08 22:48:38,041 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-01-08 22:48:38,041 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-01-08 22:48:38,159 INFO L134 CoverageAnalysis]: Checked inductivity of 18 backedges. 6 proven. 0 refuted. 0 times theorem prover too weak. 12 trivial. 0 not checked. [2025-01-08 22:48:38,159 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-01-08 22:48:38,159 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [938197165] [2025-01-08 22:48:38,159 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [938197165] provided 1 perfect and 0 imperfect interpolant sequences [2025-01-08 22:48:38,159 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-01-08 22:48:38,159 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [9] imperfect sequences [] total 9 [2025-01-08 22:48:38,159 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1445610867] [2025-01-08 22:48:38,159 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-01-08 22:48:38,159 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 9 states [2025-01-08 22:48:38,159 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-01-08 22:48:38,160 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2025-01-08 22:48:38,160 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=15, Invalid=57, Unknown=0, NotChecked=0, Total=72 [2025-01-08 22:48:38,160 INFO L87 Difference]: Start difference. First operand 565 states and 765 transitions. Second operand has 9 states, 9 states have (on average 3.5555555555555554) internal successors, (32), 8 states have internal predecessors, (32), 2 states have call successors, (4), 2 states have call predecessors, (4), 2 states have return successors, (3), 2 states have call predecessors, (3), 1 states have call successors, (3) [2025-01-08 22:48:38,285 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-01-08 22:48:38,285 INFO L93 Difference]: Finished difference Result 789 states and 1081 transitions. [2025-01-08 22:48:38,285 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2025-01-08 22:48:38,286 INFO L78 Accepts]: Start accepts. Automaton has has 9 states, 9 states have (on average 3.5555555555555554) internal successors, (32), 8 states have internal predecessors, (32), 2 states have call successors, (4), 2 states have call predecessors, (4), 2 states have return successors, (3), 2 states have call predecessors, (3), 1 states have call successors, (3) Word has length 46 [2025-01-08 22:48:38,286 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-01-08 22:48:38,287 INFO L225 Difference]: With dead ends: 789 [2025-01-08 22:48:38,287 INFO L226 Difference]: Without dead ends: 657 [2025-01-08 22:48:38,288 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 12 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 10 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 2 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=29, Invalid=103, Unknown=0, NotChecked=0, Total=132 [2025-01-08 22:48:38,288 INFO L435 NwaCegarLoop]: 173 mSDtfsCounter, 122 mSDsluCounter, 1081 mSDsCounter, 0 mSdLazyCounter, 204 mSolverCounterSat, 3 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 126 SdHoareTripleChecker+Valid, 1254 SdHoareTripleChecker+Invalid, 207 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 3 IncrementalHoareTripleChecker+Valid, 204 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2025-01-08 22:48:38,288 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [126 Valid, 1254 Invalid, 207 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [3 Valid, 204 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2025-01-08 22:48:38,289 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 657 states. [2025-01-08 22:48:38,296 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 657 to 565. [2025-01-08 22:48:38,297 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 565 states, 530 states have (on average 1.3) internal successors, (689), 525 states have internal predecessors, (689), 30 states have call successors, (30), 2 states have call predecessors, (30), 4 states have return successors, (42), 39 states have call predecessors, (42), 28 states have call successors, (42) [2025-01-08 22:48:38,298 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 565 states to 565 states and 761 transitions. [2025-01-08 22:48:38,298 INFO L78 Accepts]: Start accepts. Automaton has 565 states and 761 transitions. Word has length 46 [2025-01-08 22:48:38,298 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-01-08 22:48:38,299 INFO L471 AbstractCegarLoop]: Abstraction has 565 states and 761 transitions. [2025-01-08 22:48:38,299 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 9 states, 9 states have (on average 3.5555555555555554) internal successors, (32), 8 states have internal predecessors, (32), 2 states have call successors, (4), 2 states have call predecessors, (4), 2 states have return successors, (3), 2 states have call predecessors, (3), 1 states have call successors, (3) [2025-01-08 22:48:38,299 INFO L276 IsEmpty]: Start isEmpty. Operand 565 states and 761 transitions. [2025-01-08 22:48:38,299 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 48 [2025-01-08 22:48:38,299 INFO L210 NwaCegarLoop]: Found error trace [2025-01-08 22:48:38,299 INFO L218 NwaCegarLoop]: trace histogram [3, 3, 3, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-01-08 22:48:38,300 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable13 [2025-01-08 22:48:38,300 INFO L396 AbstractCegarLoop]: === Iteration 15 === Targeting __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-01-08 22:48:38,300 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-01-08 22:48:38,300 INFO L85 PathProgramCache]: Analyzing trace with hash -1477663156, now seen corresponding path program 1 times [2025-01-08 22:48:38,300 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-01-08 22:48:38,300 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1426128321] [2025-01-08 22:48:38,300 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-01-08 22:48:38,300 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-01-08 22:48:38,303 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 47 statements into 1 equivalence classes. [2025-01-08 22:48:38,306 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 47 of 47 statements. [2025-01-08 22:48:38,307 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-01-08 22:48:38,307 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-01-08 22:48:38,376 INFO L134 CoverageAnalysis]: Checked inductivity of 18 backedges. 3 proven. 3 refuted. 0 times theorem prover too weak. 12 trivial. 0 not checked. [2025-01-08 22:48:38,376 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-01-08 22:48:38,376 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1426128321] [2025-01-08 22:48:38,377 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1426128321] provided 0 perfect and 1 imperfect interpolant sequences [2025-01-08 22:48:38,377 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [2068683199] [2025-01-08 22:48:38,377 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-01-08 22:48:38,377 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-01-08 22:48:38,377 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 [2025-01-08 22:48:38,379 INFO L229 MonitoredProcess]: Starting monitored process 7 with /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2025-01-08 22:48:38,381 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (7)] Waiting until timeout for monitored process [2025-01-08 22:48:38,408 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 47 statements into 1 equivalence classes. [2025-01-08 22:48:38,419 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 47 of 47 statements. [2025-01-08 22:48:38,419 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-01-08 22:48:38,420 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-01-08 22:48:38,420 INFO L256 TraceCheckSpWp]: Trace formula consists of 141 conjuncts, 29 conjuncts are in the unsatisfiable core [2025-01-08 22:48:38,421 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-01-08 22:48:38,566 INFO L134 CoverageAnalysis]: Checked inductivity of 18 backedges. 6 proven. 0 refuted. 0 times theorem prover too weak. 12 trivial. 0 not checked. [2025-01-08 22:48:38,567 INFO L308 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2025-01-08 22:48:38,567 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [2068683199] provided 1 perfect and 0 imperfect interpolant sequences [2025-01-08 22:48:38,567 INFO L185 FreeRefinementEngine]: Found 1 perfect and 1 imperfect interpolant sequences. [2025-01-08 22:48:38,567 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [13] imperfect sequences [8] total 14 [2025-01-08 22:48:38,567 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [751784782] [2025-01-08 22:48:38,567 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-01-08 22:48:38,567 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 13 states [2025-01-08 22:48:38,568 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-01-08 22:48:38,568 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 13 interpolants. [2025-01-08 22:48:38,568 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=33, Invalid=149, Unknown=0, NotChecked=0, Total=182 [2025-01-08 22:48:38,568 INFO L87 Difference]: Start difference. First operand 565 states and 761 transitions. Second operand has 13 states, 12 states have (on average 2.6666666666666665) internal successors, (32), 11 states have internal predecessors, (32), 3 states have call successors, (4), 2 states have call predecessors, (4), 2 states have return successors, (3), 3 states have call predecessors, (3), 2 states have call successors, (3) [2025-01-08 22:48:38,911 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-01-08 22:48:38,911 INFO L93 Difference]: Finished difference Result 1285 states and 1759 transitions. [2025-01-08 22:48:38,911 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 21 states. [2025-01-08 22:48:38,912 INFO L78 Accepts]: Start accepts. Automaton has has 13 states, 12 states have (on average 2.6666666666666665) internal successors, (32), 11 states have internal predecessors, (32), 3 states have call successors, (4), 2 states have call predecessors, (4), 2 states have return successors, (3), 3 states have call predecessors, (3), 2 states have call successors, (3) Word has length 47 [2025-01-08 22:48:38,912 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-01-08 22:48:38,915 INFO L225 Difference]: With dead ends: 1285 [2025-01-08 22:48:38,915 INFO L226 Difference]: Without dead ends: 942 [2025-01-08 22:48:38,917 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 63 GetRequests, 42 SyntacticMatches, 0 SemanticMatches, 21 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 44 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=89, Invalid=417, Unknown=0, NotChecked=0, Total=506 [2025-01-08 22:48:38,917 INFO L435 NwaCegarLoop]: 156 mSDtfsCounter, 294 mSDsluCounter, 930 mSDsCounter, 0 mSdLazyCounter, 479 mSolverCounterSat, 30 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 303 SdHoareTripleChecker+Valid, 1086 SdHoareTripleChecker+Invalid, 509 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 30 IncrementalHoareTripleChecker+Valid, 479 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.2s IncrementalHoareTripleChecker+Time [2025-01-08 22:48:38,917 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [303 Valid, 1086 Invalid, 509 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [30 Valid, 479 Invalid, 0 Unknown, 0 Unchecked, 0.2s Time] [2025-01-08 22:48:38,918 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 942 states. [2025-01-08 22:48:38,946 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 942 to 904. [2025-01-08 22:48:38,951 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 904 states, 847 states have (on average 1.2868949232585596) internal successors, (1090), 841 states have internal predecessors, (1090), 52 states have call successors, (52), 2 states have call predecessors, (52), 4 states have return successors, (68), 66 states have call predecessors, (68), 50 states have call successors, (68) [2025-01-08 22:48:38,953 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 904 states to 904 states and 1210 transitions. [2025-01-08 22:48:38,954 INFO L78 Accepts]: Start accepts. Automaton has 904 states and 1210 transitions. Word has length 47 [2025-01-08 22:48:38,954 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-01-08 22:48:38,954 INFO L471 AbstractCegarLoop]: Abstraction has 904 states and 1210 transitions. [2025-01-08 22:48:38,954 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 13 states, 12 states have (on average 2.6666666666666665) internal successors, (32), 11 states have internal predecessors, (32), 3 states have call successors, (4), 2 states have call predecessors, (4), 2 states have return successors, (3), 3 states have call predecessors, (3), 2 states have call successors, (3) [2025-01-08 22:48:38,954 INFO L276 IsEmpty]: Start isEmpty. Operand 904 states and 1210 transitions. [2025-01-08 22:48:38,959 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 49 [2025-01-08 22:48:38,959 INFO L210 NwaCegarLoop]: Found error trace [2025-01-08 22:48:38,959 INFO L218 NwaCegarLoop]: trace histogram [3, 3, 3, 3, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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-01-08 22:48:38,973 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (7)] Forceful destruction successful, exit code 0 [2025-01-08 22:48:39,160 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 7 /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable14 [2025-01-08 22:48:39,160 INFO L396 AbstractCegarLoop]: === Iteration 16 === Targeting __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-01-08 22:48:39,160 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-01-08 22:48:39,160 INFO L85 PathProgramCache]: Analyzing trace with hash 1712270295, now seen corresponding path program 1 times [2025-01-08 22:48:39,160 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-01-08 22:48:39,160 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [217655965] [2025-01-08 22:48:39,160 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-01-08 22:48:39,160 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-01-08 22:48:39,166 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 48 statements into 1 equivalence classes. [2025-01-08 22:48:39,168 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 48 of 48 statements. [2025-01-08 22:48:39,168 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-01-08 22:48:39,168 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-01-08 22:48:39,209 INFO L134 CoverageAnalysis]: Checked inductivity of 15 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 15 trivial. 0 not checked. [2025-01-08 22:48:39,209 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-01-08 22:48:39,209 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [217655965] [2025-01-08 22:48:39,209 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [217655965] provided 1 perfect and 0 imperfect interpolant sequences [2025-01-08 22:48:39,209 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-01-08 22:48:39,209 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2025-01-08 22:48:39,209 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [178600063] [2025-01-08 22:48:39,209 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-01-08 22:48:39,209 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2025-01-08 22:48:39,209 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-01-08 22:48:39,209 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2025-01-08 22:48:39,210 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2025-01-08 22:48:39,210 INFO L87 Difference]: Start difference. First operand 904 states and 1210 transitions. Second operand has 4 states, 4 states have (on average 8.25) internal successors, (33), 4 states have internal predecessors, (33), 2 states have call successors, (4), 2 states have call predecessors, (4), 1 states have return successors, (3), 1 states have call predecessors, (3), 1 states have call successors, (3) [2025-01-08 22:48:39,228 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-01-08 22:48:39,230 INFO L93 Difference]: Finished difference Result 913 states and 1218 transitions. [2025-01-08 22:48:39,230 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2025-01-08 22:48:39,230 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 4 states have (on average 8.25) internal successors, (33), 4 states have internal predecessors, (33), 2 states have call successors, (4), 2 states have call predecessors, (4), 1 states have return successors, (3), 1 states have call predecessors, (3), 1 states have call successors, (3) Word has length 48 [2025-01-08 22:48:39,231 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-01-08 22:48:39,233 INFO L225 Difference]: With dead ends: 913 [2025-01-08 22:48:39,233 INFO L226 Difference]: Without dead ends: 903 [2025-01-08 22:48:39,234 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 4 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 2 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2025-01-08 22:48:39,234 INFO L435 NwaCegarLoop]: 131 mSDtfsCounter, 0 mSDsluCounter, 256 mSDsCounter, 0 mSdLazyCounter, 8 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 0 SdHoareTripleChecker+Valid, 387 SdHoareTripleChecker+Invalid, 8 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 8 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2025-01-08 22:48:39,235 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [0 Valid, 387 Invalid, 8 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 8 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2025-01-08 22:48:39,236 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 903 states. [2025-01-08 22:48:39,249 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 903 to 903. [2025-01-08 22:48:39,250 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 903 states, 846 states have (on average 1.284869976359338) internal successors, (1087), 840 states have internal predecessors, (1087), 52 states have call successors, (52), 2 states have call predecessors, (52), 4 states have return successors, (68), 66 states have call predecessors, (68), 50 states have call successors, (68) [2025-01-08 22:48:39,252 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 903 states to 903 states and 1207 transitions. [2025-01-08 22:48:39,253 INFO L78 Accepts]: Start accepts. Automaton has 903 states and 1207 transitions. Word has length 48 [2025-01-08 22:48:39,253 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-01-08 22:48:39,253 INFO L471 AbstractCegarLoop]: Abstraction has 903 states and 1207 transitions. [2025-01-08 22:48:39,253 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 8.25) internal successors, (33), 4 states have internal predecessors, (33), 2 states have call successors, (4), 2 states have call predecessors, (4), 1 states have return successors, (3), 1 states have call predecessors, (3), 1 states have call successors, (3) [2025-01-08 22:48:39,253 INFO L276 IsEmpty]: Start isEmpty. Operand 903 states and 1207 transitions. [2025-01-08 22:48:39,254 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 49 [2025-01-08 22:48:39,254 INFO L210 NwaCegarLoop]: Found error trace [2025-01-08 22:48:39,255 INFO L218 NwaCegarLoop]: trace histogram [3, 3, 3, 3, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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-01-08 22:48:39,255 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable15 [2025-01-08 22:48:39,255 INFO L396 AbstractCegarLoop]: === Iteration 17 === Targeting __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-01-08 22:48:39,255 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-01-08 22:48:39,255 INFO L85 PathProgramCache]: Analyzing trace with hash -62737067, now seen corresponding path program 1 times [2025-01-08 22:48:39,255 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-01-08 22:48:39,255 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1279023134] [2025-01-08 22:48:39,256 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-01-08 22:48:39,256 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-01-08 22:48:39,259 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 48 statements into 1 equivalence classes. [2025-01-08 22:48:39,262 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 48 of 48 statements. [2025-01-08 22:48:39,263 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-01-08 22:48:39,263 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-01-08 22:48:39,401 INFO L134 CoverageAnalysis]: Checked inductivity of 15 backedges. 3 proven. 3 refuted. 0 times theorem prover too weak. 9 trivial. 0 not checked. [2025-01-08 22:48:39,401 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-01-08 22:48:39,401 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1279023134] [2025-01-08 22:48:39,401 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1279023134] provided 0 perfect and 1 imperfect interpolant sequences [2025-01-08 22:48:39,401 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1799783119] [2025-01-08 22:48:39,401 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-01-08 22:48:39,401 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-01-08 22:48:39,402 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 [2025-01-08 22:48:39,405 INFO L229 MonitoredProcess]: Starting monitored process 8 with /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2025-01-08 22:48:39,410 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (8)] Waiting until timeout for monitored process [2025-01-08 22:48:39,440 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 48 statements into 1 equivalence classes. [2025-01-08 22:48:39,454 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 48 of 48 statements. [2025-01-08 22:48:39,455 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-01-08 22:48:39,455 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-01-08 22:48:39,458 INFO L256 TraceCheckSpWp]: Trace formula consists of 145 conjuncts, 21 conjuncts are in the unsatisfiable core [2025-01-08 22:48:39,460 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-01-08 22:48:39,521 INFO L134 CoverageAnalysis]: Checked inductivity of 15 backedges. 3 proven. 3 refuted. 0 times theorem prover too weak. 9 trivial. 0 not checked. [2025-01-08 22:48:39,521 INFO L312 TraceCheckSpWp]: Computing backward predicates... [2025-01-08 22:48:39,596 INFO L134 CoverageAnalysis]: Checked inductivity of 15 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 15 trivial. 0 not checked. [2025-01-08 22:48:39,596 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1799783119] provided 1 perfect and 1 imperfect interpolant sequences [2025-01-08 22:48:39,596 INFO L185 FreeRefinementEngine]: Found 1 perfect and 2 imperfect interpolant sequences. [2025-01-08 22:48:39,596 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [10, 11] total 15 [2025-01-08 22:48:39,596 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [208292210] [2025-01-08 22:48:39,596 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-01-08 22:48:39,597 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2025-01-08 22:48:39,597 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-01-08 22:48:39,597 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2025-01-08 22:48:39,597 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=36, Invalid=174, Unknown=0, NotChecked=0, Total=210 [2025-01-08 22:48:39,597 INFO L87 Difference]: Start difference. First operand 903 states and 1207 transitions. Second operand has 6 states, 6 states have (on average 5.5) internal successors, (33), 6 states have internal predecessors, (33), 2 states have call successors, (4), 2 states have call predecessors, (4), 1 states have return successors, (3), 1 states have call predecessors, (3), 1 states have call successors, (3) [2025-01-08 22:48:39,702 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-01-08 22:48:39,702 INFO L93 Difference]: Finished difference Result 1280 states and 1715 transitions. [2025-01-08 22:48:39,702 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2025-01-08 22:48:39,703 INFO L78 Accepts]: Start accepts. Automaton has has 6 states, 6 states have (on average 5.5) internal successors, (33), 6 states have internal predecessors, (33), 2 states have call successors, (4), 2 states have call predecessors, (4), 1 states have return successors, (3), 1 states have call predecessors, (3), 1 states have call successors, (3) Word has length 48 [2025-01-08 22:48:39,703 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-01-08 22:48:39,706 INFO L225 Difference]: With dead ends: 1280 [2025-01-08 22:48:39,706 INFO L226 Difference]: Without dead ends: 1241 [2025-01-08 22:48:39,707 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 107 GetRequests, 94 SyntacticMatches, 0 SemanticMatches, 13 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 26 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=36, Invalid=174, Unknown=0, NotChecked=0, Total=210 [2025-01-08 22:48:39,707 INFO L435 NwaCegarLoop]: 117 mSDtfsCounter, 48 mSDsluCounter, 404 mSDsCounter, 0 mSdLazyCounter, 143 mSolverCounterSat, 4 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 52 SdHoareTripleChecker+Valid, 521 SdHoareTripleChecker+Invalid, 147 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 4 IncrementalHoareTripleChecker+Valid, 143 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2025-01-08 22:48:39,707 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [52 Valid, 521 Invalid, 147 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [4 Valid, 143 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2025-01-08 22:48:39,708 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1241 states. [2025-01-08 22:48:39,724 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1241 to 1003. [2025-01-08 22:48:39,725 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 1003 states, 938 states have (on average 1.2857142857142858) internal successors, (1206), 932 states have internal predecessors, (1206), 60 states have call successors, (60), 2 states have call predecessors, (60), 4 states have return successors, (76), 74 states have call predecessors, (76), 58 states have call successors, (76) [2025-01-08 22:48:39,728 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1003 states to 1003 states and 1342 transitions. [2025-01-08 22:48:39,728 INFO L78 Accepts]: Start accepts. Automaton has 1003 states and 1342 transitions. Word has length 48 [2025-01-08 22:48:39,729 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-01-08 22:48:39,729 INFO L471 AbstractCegarLoop]: Abstraction has 1003 states and 1342 transitions. [2025-01-08 22:48:39,729 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 6 states have (on average 5.5) internal successors, (33), 6 states have internal predecessors, (33), 2 states have call successors, (4), 2 states have call predecessors, (4), 1 states have return successors, (3), 1 states have call predecessors, (3), 1 states have call successors, (3) [2025-01-08 22:48:39,729 INFO L276 IsEmpty]: Start isEmpty. Operand 1003 states and 1342 transitions. [2025-01-08 22:48:39,730 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 49 [2025-01-08 22:48:39,730 INFO L210 NwaCegarLoop]: Found error trace [2025-01-08 22:48:39,730 INFO L218 NwaCegarLoop]: trace histogram [3, 3, 3, 3, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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-01-08 22:48:39,739 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (8)] Forceful destruction successful, exit code 0 [2025-01-08 22:48:39,930 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable16,8 /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-01-08 22:48:39,931 INFO L396 AbstractCegarLoop]: === Iteration 18 === Targeting __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-01-08 22:48:39,932 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-01-08 22:48:39,932 INFO L85 PathProgramCache]: Analyzing trace with hash 638327511, now seen corresponding path program 1 times [2025-01-08 22:48:39,932 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-01-08 22:48:39,932 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1279296107] [2025-01-08 22:48:39,932 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-01-08 22:48:39,933 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-01-08 22:48:39,937 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 48 statements into 1 equivalence classes. [2025-01-08 22:48:39,939 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 48 of 48 statements. [2025-01-08 22:48:39,939 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-01-08 22:48:39,939 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-01-08 22:48:39,957 INFO L134 CoverageAnalysis]: Checked inductivity of 15 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 15 trivial. 0 not checked. [2025-01-08 22:48:39,957 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-01-08 22:48:39,957 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1279296107] [2025-01-08 22:48:39,957 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1279296107] provided 1 perfect and 0 imperfect interpolant sequences [2025-01-08 22:48:39,957 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-01-08 22:48:39,958 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2025-01-08 22:48:39,958 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [374093260] [2025-01-08 22:48:39,958 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-01-08 22:48:39,958 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2025-01-08 22:48:39,958 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-01-08 22:48:39,958 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2025-01-08 22:48:39,958 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2025-01-08 22:48:39,958 INFO L87 Difference]: Start difference. First operand 1003 states and 1342 transitions. Second operand has 4 states, 4 states have (on average 8.25) internal successors, (33), 4 states have internal predecessors, (33), 2 states have call successors, (4), 2 states have call predecessors, (4), 1 states have return successors, (3), 1 states have call predecessors, (3), 1 states have call successors, (3) [2025-01-08 22:48:39,973 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-01-08 22:48:39,974 INFO L93 Difference]: Finished difference Result 1021 states and 1360 transitions. [2025-01-08 22:48:39,974 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2025-01-08 22:48:39,974 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 4 states have (on average 8.25) internal successors, (33), 4 states have internal predecessors, (33), 2 states have call successors, (4), 2 states have call predecessors, (4), 1 states have return successors, (3), 1 states have call predecessors, (3), 1 states have call successors, (3) Word has length 48 [2025-01-08 22:48:39,974 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-01-08 22:48:39,977 INFO L225 Difference]: With dead ends: 1021 [2025-01-08 22:48:39,977 INFO L226 Difference]: Without dead ends: 925 [2025-01-08 22:48:39,978 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 4 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 2 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2025-01-08 22:48:39,978 INFO L435 NwaCegarLoop]: 130 mSDtfsCounter, 0 mSDsluCounter, 254 mSDsCounter, 0 mSdLazyCounter, 8 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 0 SdHoareTripleChecker+Valid, 384 SdHoareTripleChecker+Invalid, 8 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 8 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2025-01-08 22:48:39,978 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [0 Valid, 384 Invalid, 8 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 8 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2025-01-08 22:48:39,979 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 925 states. [2025-01-08 22:48:39,993 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 925 to 917. [2025-01-08 22:48:39,994 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 917 states, 853 states have (on average 1.287221570926143) internal successors, (1098), 850 states have internal predecessors, (1098), 59 states have call successors, (59), 2 states have call predecessors, (59), 4 states have return successors, (70), 68 states have call predecessors, (70), 56 states have call successors, (70) [2025-01-08 22:48:39,997 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 917 states to 917 states and 1227 transitions. [2025-01-08 22:48:39,997 INFO L78 Accepts]: Start accepts. Automaton has 917 states and 1227 transitions. Word has length 48 [2025-01-08 22:48:39,997 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-01-08 22:48:39,998 INFO L471 AbstractCegarLoop]: Abstraction has 917 states and 1227 transitions. [2025-01-08 22:48:39,998 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 8.25) internal successors, (33), 4 states have internal predecessors, (33), 2 states have call successors, (4), 2 states have call predecessors, (4), 1 states have return successors, (3), 1 states have call predecessors, (3), 1 states have call successors, (3) [2025-01-08 22:48:39,998 INFO L276 IsEmpty]: Start isEmpty. Operand 917 states and 1227 transitions. [2025-01-08 22:48:40,001 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 49 [2025-01-08 22:48:40,001 INFO L210 NwaCegarLoop]: Found error trace [2025-01-08 22:48:40,001 INFO L218 NwaCegarLoop]: trace histogram [3, 3, 3, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-01-08 22:48:40,002 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable17 [2025-01-08 22:48:40,002 INFO L396 AbstractCegarLoop]: === Iteration 19 === Targeting __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-01-08 22:48:40,002 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-01-08 22:48:40,002 INFO L85 PathProgramCache]: Analyzing trace with hash -226901734, now seen corresponding path program 1 times [2025-01-08 22:48:40,002 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-01-08 22:48:40,002 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [982219695] [2025-01-08 22:48:40,003 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-01-08 22:48:40,003 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-01-08 22:48:40,007 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 48 statements into 1 equivalence classes. [2025-01-08 22:48:40,037 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 48 of 48 statements. [2025-01-08 22:48:40,037 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-01-08 22:48:40,037 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-01-08 22:48:40,138 INFO L134 CoverageAnalysis]: Checked inductivity of 18 backedges. 3 proven. 3 refuted. 0 times theorem prover too weak. 12 trivial. 0 not checked. [2025-01-08 22:48:40,139 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-01-08 22:48:40,139 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [982219695] [2025-01-08 22:48:40,139 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [982219695] provided 0 perfect and 1 imperfect interpolant sequences [2025-01-08 22:48:40,139 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1055194735] [2025-01-08 22:48:40,139 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-01-08 22:48:40,139 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-01-08 22:48:40,139 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 [2025-01-08 22:48:40,144 INFO L229 MonitoredProcess]: Starting monitored process 9 with /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2025-01-08 22:48:40,145 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (9)] Waiting until timeout for monitored process [2025-01-08 22:48:40,171 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 48 statements into 1 equivalence classes. [2025-01-08 22:48:40,185 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 48 of 48 statements. [2025-01-08 22:48:40,185 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-01-08 22:48:40,185 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-01-08 22:48:40,186 INFO L256 TraceCheckSpWp]: Trace formula consists of 144 conjuncts, 29 conjuncts are in the unsatisfiable core [2025-01-08 22:48:40,188 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-01-08 22:48:40,325 INFO L134 CoverageAnalysis]: Checked inductivity of 18 backedges. 6 proven. 0 refuted. 0 times theorem prover too weak. 12 trivial. 0 not checked. [2025-01-08 22:48:40,325 INFO L308 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2025-01-08 22:48:40,325 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1055194735] provided 1 perfect and 0 imperfect interpolant sequences [2025-01-08 22:48:40,325 INFO L185 FreeRefinementEngine]: Found 1 perfect and 1 imperfect interpolant sequences. [2025-01-08 22:48:40,325 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [13] imperfect sequences [8] total 15 [2025-01-08 22:48:40,325 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1819773433] [2025-01-08 22:48:40,325 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-01-08 22:48:40,326 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 13 states [2025-01-08 22:48:40,326 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-01-08 22:48:40,326 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 13 interpolants. [2025-01-08 22:48:40,326 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=30, Invalid=180, Unknown=0, NotChecked=0, Total=210 [2025-01-08 22:48:40,326 INFO L87 Difference]: Start difference. First operand 917 states and 1227 transitions. Second operand has 13 states, 12 states have (on average 2.75) internal successors, (33), 10 states have internal predecessors, (33), 3 states have call successors, (4), 2 states have call predecessors, (4), 2 states have return successors, (3), 3 states have call predecessors, (3), 2 states have call successors, (3) [2025-01-08 22:48:40,555 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-01-08 22:48:40,555 INFO L93 Difference]: Finished difference Result 993 states and 1320 transitions. [2025-01-08 22:48:40,556 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 13 states. [2025-01-08 22:48:40,556 INFO L78 Accepts]: Start accepts. Automaton has has 13 states, 12 states have (on average 2.75) internal successors, (33), 10 states have internal predecessors, (33), 3 states have call successors, (4), 2 states have call predecessors, (4), 2 states have return successors, (3), 3 states have call predecessors, (3), 2 states have call successors, (3) Word has length 48 [2025-01-08 22:48:40,556 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-01-08 22:48:40,559 INFO L225 Difference]: With dead ends: 993 [2025-01-08 22:48:40,559 INFO L226 Difference]: Without dead ends: 991 [2025-01-08 22:48:40,560 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 59 GetRequests, 42 SyntacticMatches, 0 SemanticMatches, 17 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 23 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=53, Invalid=289, Unknown=0, NotChecked=0, Total=342 [2025-01-08 22:48:40,560 INFO L435 NwaCegarLoop]: 137 mSDtfsCounter, 187 mSDsluCounter, 1265 mSDsCounter, 0 mSdLazyCounter, 323 mSolverCounterSat, 6 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 195 SdHoareTripleChecker+Valid, 1402 SdHoareTripleChecker+Invalid, 329 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 6 IncrementalHoareTripleChecker+Valid, 323 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.2s IncrementalHoareTripleChecker+Time [2025-01-08 22:48:40,560 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [195 Valid, 1402 Invalid, 329 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [6 Valid, 323 Invalid, 0 Unknown, 0 Unchecked, 0.2s Time] [2025-01-08 22:48:40,561 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 991 states. [2025-01-08 22:48:40,577 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 991 to 921. [2025-01-08 22:48:40,578 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 921 states, 856 states have (on average 1.286214953271028) internal successors, (1101), 853 states have internal predecessors, (1101), 59 states have call successors, (59), 3 states have call predecessors, (59), 5 states have return successors, (70), 68 states have call predecessors, (70), 56 states have call successors, (70) [2025-01-08 22:48:40,581 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 921 states to 921 states and 1230 transitions. [2025-01-08 22:48:40,582 INFO L78 Accepts]: Start accepts. Automaton has 921 states and 1230 transitions. Word has length 48 [2025-01-08 22:48:40,582 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-01-08 22:48:40,582 INFO L471 AbstractCegarLoop]: Abstraction has 921 states and 1230 transitions. [2025-01-08 22:48:40,582 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 13 states, 12 states have (on average 2.75) internal successors, (33), 10 states have internal predecessors, (33), 3 states have call successors, (4), 2 states have call predecessors, (4), 2 states have return successors, (3), 3 states have call predecessors, (3), 2 states have call successors, (3) [2025-01-08 22:48:40,582 INFO L276 IsEmpty]: Start isEmpty. Operand 921 states and 1230 transitions. [2025-01-08 22:48:40,585 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 50 [2025-01-08 22:48:40,586 INFO L210 NwaCegarLoop]: Found error trace [2025-01-08 22:48:40,586 INFO L218 NwaCegarLoop]: trace histogram [3, 3, 3, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-01-08 22:48:40,594 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (9)] Ended with exit code 0 [2025-01-08 22:48:40,786 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable18,9 /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-01-08 22:48:40,787 INFO L396 AbstractCegarLoop]: === Iteration 20 === Targeting __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-01-08 22:48:40,787 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-01-08 22:48:40,787 INFO L85 PathProgramCache]: Analyzing trace with hash 1497255929, now seen corresponding path program 1 times [2025-01-08 22:48:40,787 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-01-08 22:48:40,787 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [643368611] [2025-01-08 22:48:40,787 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-01-08 22:48:40,788 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-01-08 22:48:40,791 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 49 statements into 1 equivalence classes. [2025-01-08 22:48:40,796 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 49 of 49 statements. [2025-01-08 22:48:40,796 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-01-08 22:48:40,796 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-01-08 22:48:41,099 INFO L134 CoverageAnalysis]: Checked inductivity of 15 backedges. 6 proven. 3 refuted. 0 times theorem prover too weak. 6 trivial. 0 not checked. [2025-01-08 22:48:41,100 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-01-08 22:48:41,100 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [643368611] [2025-01-08 22:48:41,100 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [643368611] provided 0 perfect and 1 imperfect interpolant sequences [2025-01-08 22:48:41,100 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [948369329] [2025-01-08 22:48:41,100 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-01-08 22:48:41,100 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-01-08 22:48:41,100 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 [2025-01-08 22:48:41,103 INFO L229 MonitoredProcess]: Starting monitored process 10 with /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2025-01-08 22:48:41,104 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (10)] Waiting until timeout for monitored process [2025-01-08 22:48:41,136 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 49 statements into 1 equivalence classes. [2025-01-08 22:48:41,148 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 49 of 49 statements. [2025-01-08 22:48:41,148 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-01-08 22:48:41,148 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-01-08 22:48:41,149 INFO L256 TraceCheckSpWp]: Trace formula consists of 150 conjuncts, 21 conjuncts are in the unsatisfiable core [2025-01-08 22:48:41,150 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-01-08 22:48:41,287 INFO L134 CoverageAnalysis]: Checked inductivity of 15 backedges. 6 proven. 0 refuted. 0 times theorem prover too weak. 9 trivial. 0 not checked. [2025-01-08 22:48:41,287 INFO L308 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2025-01-08 22:48:41,287 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [948369329] provided 1 perfect and 0 imperfect interpolant sequences [2025-01-08 22:48:41,288 INFO L185 FreeRefinementEngine]: Found 1 perfect and 1 imperfect interpolant sequences. [2025-01-08 22:48:41,288 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [11] imperfect sequences [17] total 24 [2025-01-08 22:48:41,288 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1901241981] [2025-01-08 22:48:41,288 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-01-08 22:48:41,288 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 11 states [2025-01-08 22:48:41,288 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-01-08 22:48:41,288 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 11 interpolants. [2025-01-08 22:48:41,289 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=62, Invalid=490, Unknown=0, NotChecked=0, Total=552 [2025-01-08 22:48:41,289 INFO L87 Difference]: Start difference. First operand 921 states and 1230 transitions. Second operand has 11 states, 11 states have (on average 3.3636363636363638) internal successors, (37), 10 states have internal predecessors, (37), 2 states have call successors, (4), 2 states have call predecessors, (4), 2 states have return successors, (3), 2 states have call predecessors, (3), 1 states have call successors, (3) [2025-01-08 22:48:41,492 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-01-08 22:48:41,492 INFO L93 Difference]: Finished difference Result 1058 states and 1410 transitions. [2025-01-08 22:48:41,493 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 13 states. [2025-01-08 22:48:41,493 INFO L78 Accepts]: Start accepts. Automaton has has 11 states, 11 states have (on average 3.3636363636363638) internal successors, (37), 10 states have internal predecessors, (37), 2 states have call successors, (4), 2 states have call predecessors, (4), 2 states have return successors, (3), 2 states have call predecessors, (3), 1 states have call successors, (3) Word has length 49 [2025-01-08 22:48:41,493 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-01-08 22:48:41,496 INFO L225 Difference]: With dead ends: 1058 [2025-01-08 22:48:41,496 INFO L226 Difference]: Without dead ends: 979 [2025-01-08 22:48:41,496 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 68 GetRequests, 44 SyntacticMatches, 0 SemanticMatches, 24 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 87 ImplicationChecksByTransitivity, 0.3s TimeCoverageRelationStatistics Valid=76, Invalid=574, Unknown=0, NotChecked=0, Total=650 [2025-01-08 22:48:41,497 INFO L435 NwaCegarLoop]: 161 mSDtfsCounter, 120 mSDsluCounter, 1054 mSDsCounter, 0 mSdLazyCounter, 310 mSolverCounterSat, 5 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 128 SdHoareTripleChecker+Valid, 1215 SdHoareTripleChecker+Invalid, 315 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 5 IncrementalHoareTripleChecker+Valid, 310 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.2s IncrementalHoareTripleChecker+Time [2025-01-08 22:48:41,497 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [128 Valid, 1215 Invalid, 315 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [5 Valid, 310 Invalid, 0 Unknown, 0 Unchecked, 0.2s Time] [2025-01-08 22:48:41,498 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 979 states. [2025-01-08 22:48:41,513 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 979 to 899. [2025-01-08 22:48:41,514 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 899 states, 834 states have (on average 1.2805755395683454) internal successors, (1068), 833 states have internal predecessors, (1068), 59 states have call successors, (59), 3 states have call predecessors, (59), 5 states have return successors, (68), 66 states have call predecessors, (68), 56 states have call successors, (68) [2025-01-08 22:48:41,516 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 899 states to 899 states and 1195 transitions. [2025-01-08 22:48:41,516 INFO L78 Accepts]: Start accepts. Automaton has 899 states and 1195 transitions. Word has length 49 [2025-01-08 22:48:41,516 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-01-08 22:48:41,516 INFO L471 AbstractCegarLoop]: Abstraction has 899 states and 1195 transitions. [2025-01-08 22:48:41,517 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 11 states, 11 states have (on average 3.3636363636363638) internal successors, (37), 10 states have internal predecessors, (37), 2 states have call successors, (4), 2 states have call predecessors, (4), 2 states have return successors, (3), 2 states have call predecessors, (3), 1 states have call successors, (3) [2025-01-08 22:48:41,517 INFO L276 IsEmpty]: Start isEmpty. Operand 899 states and 1195 transitions. [2025-01-08 22:48:41,518 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 50 [2025-01-08 22:48:41,518 INFO L210 NwaCegarLoop]: Found error trace [2025-01-08 22:48:41,518 INFO L218 NwaCegarLoop]: trace histogram [3, 3, 3, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-01-08 22:48:41,527 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (10)] Ended with exit code 0 [2025-01-08 22:48:41,722 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable19,10 /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-01-08 22:48:41,722 INFO L396 AbstractCegarLoop]: === Iteration 21 === Targeting __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-01-08 22:48:41,722 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-01-08 22:48:41,723 INFO L85 PathProgramCache]: Analyzing trace with hash 530407768, now seen corresponding path program 1 times [2025-01-08 22:48:41,723 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-01-08 22:48:41,723 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2016401075] [2025-01-08 22:48:41,723 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-01-08 22:48:41,723 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-01-08 22:48:41,726 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 49 statements into 1 equivalence classes. [2025-01-08 22:48:41,728 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 49 of 49 statements. [2025-01-08 22:48:41,728 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-01-08 22:48:41,728 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-01-08 22:48:41,741 INFO L134 CoverageAnalysis]: Checked inductivity of 17 backedges. 8 proven. 0 refuted. 0 times theorem prover too weak. 9 trivial. 0 not checked. [2025-01-08 22:48:41,741 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-01-08 22:48:41,741 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2016401075] [2025-01-08 22:48:41,741 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [2016401075] provided 1 perfect and 0 imperfect interpolant sequences [2025-01-08 22:48:41,741 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-01-08 22:48:41,741 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2025-01-08 22:48:41,741 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [508380662] [2025-01-08 22:48:41,741 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-01-08 22:48:41,742 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2025-01-08 22:48:41,742 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-01-08 22:48:41,742 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2025-01-08 22:48:41,742 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-01-08 22:48:41,742 INFO L87 Difference]: Start difference. First operand 899 states and 1195 transitions. Second operand has 3 states, 3 states have (on average 12.666666666666666) internal successors, (38), 3 states have internal predecessors, (38), 2 states have call successors, (4), 2 states have call predecessors, (4), 2 states have return successors, (3), 2 states have call predecessors, (3), 1 states have call successors, (3) [2025-01-08 22:48:41,778 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-01-08 22:48:41,778 INFO L93 Difference]: Finished difference Result 1795 states and 2394 transitions. [2025-01-08 22:48:41,779 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2025-01-08 22:48:41,779 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 12.666666666666666) internal successors, (38), 3 states have internal predecessors, (38), 2 states have call successors, (4), 2 states have call predecessors, (4), 2 states have return successors, (3), 2 states have call predecessors, (3), 1 states have call successors, (3) Word has length 49 [2025-01-08 22:48:41,779 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-01-08 22:48:41,781 INFO L225 Difference]: With dead ends: 1795 [2025-01-08 22:48:41,781 INFO L226 Difference]: Without dead ends: 905 [2025-01-08 22:48:41,783 INFO L434 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-01-08 22:48:41,783 INFO L435 NwaCegarLoop]: 122 mSDtfsCounter, 9 mSDsluCounter, 109 mSDsCounter, 0 mSdLazyCounter, 25 mSolverCounterSat, 4 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 9 SdHoareTripleChecker+Valid, 231 SdHoareTripleChecker+Invalid, 29 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 4 IncrementalHoareTripleChecker+Valid, 25 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2025-01-08 22:48:41,784 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [9 Valid, 231 Invalid, 29 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [4 Valid, 25 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2025-01-08 22:48:41,784 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 905 states. [2025-01-08 22:48:41,800 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 905 to 901. [2025-01-08 22:48:41,801 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 901 states, 836 states have (on average 1.2811004784688995) internal successors, (1071), 835 states have internal predecessors, (1071), 59 states have call successors, (59), 3 states have call predecessors, (59), 5 states have return successors, (68), 66 states have call predecessors, (68), 56 states have call successors, (68) [2025-01-08 22:48:41,802 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 901 states to 901 states and 1198 transitions. [2025-01-08 22:48:41,803 INFO L78 Accepts]: Start accepts. Automaton has 901 states and 1198 transitions. Word has length 49 [2025-01-08 22:48:41,803 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-01-08 22:48:41,803 INFO L471 AbstractCegarLoop]: Abstraction has 901 states and 1198 transitions. [2025-01-08 22:48:41,803 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 12.666666666666666) internal successors, (38), 3 states have internal predecessors, (38), 2 states have call successors, (4), 2 states have call predecessors, (4), 2 states have return successors, (3), 2 states have call predecessors, (3), 1 states have call successors, (3) [2025-01-08 22:48:41,803 INFO L276 IsEmpty]: Start isEmpty. Operand 901 states and 1198 transitions. [2025-01-08 22:48:41,804 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 51 [2025-01-08 22:48:41,804 INFO L210 NwaCegarLoop]: Found error trace [2025-01-08 22:48:41,804 INFO L218 NwaCegarLoop]: trace histogram [3, 3, 3, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-01-08 22:48:41,804 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable20 [2025-01-08 22:48:41,805 INFO L396 AbstractCegarLoop]: === Iteration 22 === Targeting __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-01-08 22:48:41,805 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-01-08 22:48:41,805 INFO L85 PathProgramCache]: Analyzing trace with hash 101019686, now seen corresponding path program 1 times [2025-01-08 22:48:41,805 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-01-08 22:48:41,805 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [838414228] [2025-01-08 22:48:41,805 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-01-08 22:48:41,805 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-01-08 22:48:41,809 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 50 statements into 1 equivalence classes. [2025-01-08 22:48:41,812 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 50 of 50 statements. [2025-01-08 22:48:41,812 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-01-08 22:48:41,812 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-01-08 22:48:41,827 INFO L134 CoverageAnalysis]: Checked inductivity of 17 backedges. 6 proven. 0 refuted. 0 times theorem prover too weak. 11 trivial. 0 not checked. [2025-01-08 22:48:41,827 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-01-08 22:48:41,827 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [838414228] [2025-01-08 22:48:41,827 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [838414228] provided 1 perfect and 0 imperfect interpolant sequences [2025-01-08 22:48:41,827 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-01-08 22:48:41,828 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2025-01-08 22:48:41,828 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1521386271] [2025-01-08 22:48:41,828 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-01-08 22:48:41,828 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2025-01-08 22:48:41,828 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-01-08 22:48:41,828 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2025-01-08 22:48:41,829 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-01-08 22:48:41,829 INFO L87 Difference]: Start difference. First operand 901 states and 1198 transitions. Second operand has 3 states, 3 states have (on average 12.333333333333334) internal successors, (37), 3 states have internal predecessors, (37), 2 states have call successors, (4), 2 states have call predecessors, (4), 2 states have return successors, (3), 2 states have call predecessors, (3), 1 states have call successors, (3) [2025-01-08 22:48:41,864 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-01-08 22:48:41,864 INFO L93 Difference]: Finished difference Result 1799 states and 2398 transitions. [2025-01-08 22:48:41,868 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2025-01-08 22:48:41,868 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 12.333333333333334) internal successors, (37), 3 states have internal predecessors, (37), 2 states have call successors, (4), 2 states have call predecessors, (4), 2 states have return successors, (3), 2 states have call predecessors, (3), 1 states have call successors, (3) Word has length 50 [2025-01-08 22:48:41,868 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-01-08 22:48:41,871 INFO L225 Difference]: With dead ends: 1799 [2025-01-08 22:48:41,871 INFO L226 Difference]: Without dead ends: 907 [2025-01-08 22:48:41,873 INFO L434 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-01-08 22:48:41,874 INFO L435 NwaCegarLoop]: 130 mSDtfsCounter, 4 mSDsluCounter, 111 mSDsCounter, 0 mSdLazyCounter, 23 mSolverCounterSat, 2 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 4 SdHoareTripleChecker+Valid, 241 SdHoareTripleChecker+Invalid, 25 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 2 IncrementalHoareTripleChecker+Valid, 23 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2025-01-08 22:48:41,875 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [4 Valid, 241 Invalid, 25 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [2 Valid, 23 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2025-01-08 22:48:41,876 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 907 states. [2025-01-08 22:48:41,890 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 907 to 903. [2025-01-08 22:48:41,892 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 903 states, 838 states have (on average 1.2804295942720765) internal successors, (1073), 837 states have internal predecessors, (1073), 59 states have call successors, (59), 3 states have call predecessors, (59), 5 states have return successors, (68), 66 states have call predecessors, (68), 56 states have call successors, (68) [2025-01-08 22:48:41,894 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 903 states to 903 states and 1200 transitions. [2025-01-08 22:48:41,894 INFO L78 Accepts]: Start accepts. Automaton has 903 states and 1200 transitions. Word has length 50 [2025-01-08 22:48:41,894 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-01-08 22:48:41,894 INFO L471 AbstractCegarLoop]: Abstraction has 903 states and 1200 transitions. [2025-01-08 22:48:41,894 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 12.333333333333334) internal successors, (37), 3 states have internal predecessors, (37), 2 states have call successors, (4), 2 states have call predecessors, (4), 2 states have return successors, (3), 2 states have call predecessors, (3), 1 states have call successors, (3) [2025-01-08 22:48:41,894 INFO L276 IsEmpty]: Start isEmpty. Operand 903 states and 1200 transitions. [2025-01-08 22:48:41,895 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 52 [2025-01-08 22:48:41,895 INFO L210 NwaCegarLoop]: Found error trace [2025-01-08 22:48:41,896 INFO L218 NwaCegarLoop]: trace histogram [3, 3, 3, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-01-08 22:48:41,896 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable21 [2025-01-08 22:48:41,896 INFO L396 AbstractCegarLoop]: === Iteration 23 === Targeting __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-01-08 22:48:41,896 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-01-08 22:48:41,896 INFO L85 PathProgramCache]: Analyzing trace with hash 1520388128, now seen corresponding path program 1 times [2025-01-08 22:48:41,896 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-01-08 22:48:41,896 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1346963429] [2025-01-08 22:48:41,896 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-01-08 22:48:41,897 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-01-08 22:48:41,901 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 51 statements into 1 equivalence classes. [2025-01-08 22:48:41,908 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 51 of 51 statements. [2025-01-08 22:48:41,908 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-01-08 22:48:41,908 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-01-08 22:48:41,963 INFO L134 CoverageAnalysis]: Checked inductivity of 16 backedges. 6 proven. 0 refuted. 0 times theorem prover too weak. 10 trivial. 0 not checked. [2025-01-08 22:48:41,963 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-01-08 22:48:41,964 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1346963429] [2025-01-08 22:48:41,964 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1346963429] provided 1 perfect and 0 imperfect interpolant sequences [2025-01-08 22:48:41,964 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-01-08 22:48:41,964 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2025-01-08 22:48:41,964 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1692169654] [2025-01-08 22:48:41,964 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-01-08 22:48:41,964 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2025-01-08 22:48:41,964 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-01-08 22:48:41,964 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2025-01-08 22:48:41,964 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2025-01-08 22:48:41,964 INFO L87 Difference]: Start difference. First operand 903 states and 1200 transitions. Second operand has 4 states, 4 states have (on average 9.75) internal successors, (39), 4 states have internal predecessors, (39), 2 states have call successors, (4), 2 states have call predecessors, (4), 2 states have return successors, (3), 2 states have call predecessors, (3), 1 states have call successors, (3) [2025-01-08 22:48:42,015 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-01-08 22:48:42,015 INFO L93 Difference]: Finished difference Result 1805 states and 2408 transitions. [2025-01-08 22:48:42,015 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2025-01-08 22:48:42,016 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 4 states have (on average 9.75) internal successors, (39), 4 states have internal predecessors, (39), 2 states have call successors, (4), 2 states have call predecessors, (4), 2 states have return successors, (3), 2 states have call predecessors, (3), 1 states have call successors, (3) Word has length 51 [2025-01-08 22:48:42,016 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-01-08 22:48:42,019 INFO L225 Difference]: With dead ends: 1805 [2025-01-08 22:48:42,020 INFO L226 Difference]: Without dead ends: 911 [2025-01-08 22:48:42,021 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 7 GetRequests, 4 SyntacticMatches, 0 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=9, Invalid=11, Unknown=0, NotChecked=0, Total=20 [2025-01-08 22:48:42,022 INFO L435 NwaCegarLoop]: 137 mSDtfsCounter, 8 mSDsluCounter, 231 mSDsCounter, 0 mSdLazyCounter, 47 mSolverCounterSat, 1 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 8 SdHoareTripleChecker+Valid, 368 SdHoareTripleChecker+Invalid, 48 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 1 IncrementalHoareTripleChecker+Valid, 47 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2025-01-08 22:48:42,023 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [8 Valid, 368 Invalid, 48 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [1 Valid, 47 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2025-01-08 22:48:42,023 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 911 states. [2025-01-08 22:48:42,044 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 911 to 901. [2025-01-08 22:48:42,045 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 901 states, 836 states have (on average 1.2799043062200957) internal successors, (1070), 835 states have internal predecessors, (1070), 59 states have call successors, (59), 3 states have call predecessors, (59), 5 states have return successors, (68), 66 states have call predecessors, (68), 56 states have call successors, (68) [2025-01-08 22:48:42,046 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 901 states to 901 states and 1197 transitions. [2025-01-08 22:48:42,047 INFO L78 Accepts]: Start accepts. Automaton has 901 states and 1197 transitions. Word has length 51 [2025-01-08 22:48:42,047 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-01-08 22:48:42,047 INFO L471 AbstractCegarLoop]: Abstraction has 901 states and 1197 transitions. [2025-01-08 22:48:42,047 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 9.75) internal successors, (39), 4 states have internal predecessors, (39), 2 states have call successors, (4), 2 states have call predecessors, (4), 2 states have return successors, (3), 2 states have call predecessors, (3), 1 states have call successors, (3) [2025-01-08 22:48:42,047 INFO L276 IsEmpty]: Start isEmpty. Operand 901 states and 1197 transitions. [2025-01-08 22:48:42,049 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 52 [2025-01-08 22:48:42,049 INFO L210 NwaCegarLoop]: Found error trace [2025-01-08 22:48:42,049 INFO L218 NwaCegarLoop]: trace histogram [3, 3, 3, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-01-08 22:48:42,049 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable22 [2025-01-08 22:48:42,050 INFO L396 AbstractCegarLoop]: === Iteration 24 === Targeting __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-01-08 22:48:42,050 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-01-08 22:48:42,050 INFO L85 PathProgramCache]: Analyzing trace with hash -2006844928, now seen corresponding path program 1 times [2025-01-08 22:48:42,050 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-01-08 22:48:42,050 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1187738713] [2025-01-08 22:48:42,050 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-01-08 22:48:42,050 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-01-08 22:48:42,055 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 51 statements into 1 equivalence classes. [2025-01-08 22:48:42,061 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 51 of 51 statements. [2025-01-08 22:48:42,062 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-01-08 22:48:42,062 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-01-08 22:48:42,126 INFO L134 CoverageAnalysis]: Checked inductivity of 20 backedges. 9 proven. 0 refuted. 0 times theorem prover too weak. 11 trivial. 0 not checked. [2025-01-08 22:48:42,126 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-01-08 22:48:42,126 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1187738713] [2025-01-08 22:48:42,126 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1187738713] provided 1 perfect and 0 imperfect interpolant sequences [2025-01-08 22:48:42,126 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-01-08 22:48:42,126 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2025-01-08 22:48:42,127 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1453964279] [2025-01-08 22:48:42,127 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-01-08 22:48:42,128 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2025-01-08 22:48:42,128 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-01-08 22:48:42,128 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2025-01-08 22:48:42,128 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2025-01-08 22:48:42,128 INFO L87 Difference]: Start difference. First operand 901 states and 1197 transitions. Second operand has 4 states, 4 states have (on average 9.5) internal successors, (38), 4 states have internal predecessors, (38), 2 states have call successors, (4), 2 states have call predecessors, (4), 2 states have return successors, (3), 2 states have call predecessors, (3), 1 states have call successors, (3) [2025-01-08 22:48:42,181 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-01-08 22:48:42,181 INFO L93 Difference]: Finished difference Result 1799 states and 2398 transitions. [2025-01-08 22:48:42,181 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2025-01-08 22:48:42,181 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 4 states have (on average 9.5) internal successors, (38), 4 states have internal predecessors, (38), 2 states have call successors, (4), 2 states have call predecessors, (4), 2 states have return successors, (3), 2 states have call predecessors, (3), 1 states have call successors, (3) Word has length 51 [2025-01-08 22:48:42,181 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-01-08 22:48:42,184 INFO L225 Difference]: With dead ends: 1799 [2025-01-08 22:48:42,184 INFO L226 Difference]: Without dead ends: 907 [2025-01-08 22:48:42,185 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 7 GetRequests, 4 SyntacticMatches, 0 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=9, Invalid=11, Unknown=0, NotChecked=0, Total=20 [2025-01-08 22:48:42,186 INFO L435 NwaCegarLoop]: 137 mSDtfsCounter, 9 mSDsluCounter, 229 mSDsCounter, 0 mSdLazyCounter, 49 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 9 SdHoareTripleChecker+Valid, 366 SdHoareTripleChecker+Invalid, 49 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 49 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2025-01-08 22:48:42,186 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [9 Valid, 366 Invalid, 49 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 49 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2025-01-08 22:48:42,187 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 907 states. [2025-01-08 22:48:42,202 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 907 to 899. [2025-01-08 22:48:42,203 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 899 states, 834 states have (on average 1.2781774580335732) internal successors, (1066), 833 states have internal predecessors, (1066), 59 states have call successors, (59), 3 states have call predecessors, (59), 5 states have return successors, (68), 66 states have call predecessors, (68), 56 states have call successors, (68) [2025-01-08 22:48:42,204 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 899 states to 899 states and 1193 transitions. [2025-01-08 22:48:42,205 INFO L78 Accepts]: Start accepts. Automaton has 899 states and 1193 transitions. Word has length 51 [2025-01-08 22:48:42,205 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-01-08 22:48:42,205 INFO L471 AbstractCegarLoop]: Abstraction has 899 states and 1193 transitions. [2025-01-08 22:48:42,205 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 9.5) internal successors, (38), 4 states have internal predecessors, (38), 2 states have call successors, (4), 2 states have call predecessors, (4), 2 states have return successors, (3), 2 states have call predecessors, (3), 1 states have call successors, (3) [2025-01-08 22:48:42,205 INFO L276 IsEmpty]: Start isEmpty. Operand 899 states and 1193 transitions. [2025-01-08 22:48:42,206 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 52 [2025-01-08 22:48:42,206 INFO L210 NwaCegarLoop]: Found error trace [2025-01-08 22:48:42,206 INFO L218 NwaCegarLoop]: trace histogram [3, 3, 3, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-01-08 22:48:42,206 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable23 [2025-01-08 22:48:42,206 INFO L396 AbstractCegarLoop]: === Iteration 25 === Targeting __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-01-08 22:48:42,207 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-01-08 22:48:42,207 INFO L85 PathProgramCache]: Analyzing trace with hash 2033197595, now seen corresponding path program 1 times [2025-01-08 22:48:42,207 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-01-08 22:48:42,207 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [959184226] [2025-01-08 22:48:42,207 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-01-08 22:48:42,207 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-01-08 22:48:42,211 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 51 statements into 1 equivalence classes. [2025-01-08 22:48:42,226 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 51 of 51 statements. [2025-01-08 22:48:42,226 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-01-08 22:48:42,226 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-01-08 22:48:42,402 INFO L134 CoverageAnalysis]: Checked inductivity of 17 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 17 trivial. 0 not checked. [2025-01-08 22:48:42,402 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-01-08 22:48:42,402 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [959184226] [2025-01-08 22:48:42,402 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [959184226] provided 1 perfect and 0 imperfect interpolant sequences [2025-01-08 22:48:42,402 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-01-08 22:48:42,402 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2025-01-08 22:48:42,403 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1912884320] [2025-01-08 22:48:42,403 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-01-08 22:48:42,403 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 7 states [2025-01-08 22:48:42,403 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-01-08 22:48:42,403 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2025-01-08 22:48:42,403 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=11, Invalid=31, Unknown=0, NotChecked=0, Total=42 [2025-01-08 22:48:42,403 INFO L87 Difference]: Start difference. First operand 899 states and 1193 transitions. Second operand has 7 states, 7 states have (on average 5.142857142857143) internal successors, (36), 6 states have internal predecessors, (36), 2 states have call successors, (4), 2 states have call predecessors, (4), 1 states have return successors, (3), 1 states have call predecessors, (3), 1 states have call successors, (3) [2025-01-08 22:48:42,469 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-01-08 22:48:42,469 INFO L93 Difference]: Finished difference Result 905 states and 1198 transitions. [2025-01-08 22:48:42,469 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2025-01-08 22:48:42,470 INFO L78 Accepts]: Start accepts. Automaton has has 7 states, 7 states have (on average 5.142857142857143) internal successors, (36), 6 states have internal predecessors, (36), 2 states have call successors, (4), 2 states have call predecessors, (4), 1 states have return successors, (3), 1 states have call predecessors, (3), 1 states have call successors, (3) Word has length 51 [2025-01-08 22:48:42,470 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-01-08 22:48:42,472 INFO L225 Difference]: With dead ends: 905 [2025-01-08 22:48:42,472 INFO L226 Difference]: Without dead ends: 903 [2025-01-08 22:48:42,473 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 9 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 7 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=19, Invalid=53, Unknown=0, NotChecked=0, Total=72 [2025-01-08 22:48:42,473 INFO L435 NwaCegarLoop]: 121 mSDtfsCounter, 14 mSDsluCounter, 562 mSDsCounter, 0 mSdLazyCounter, 65 mSolverCounterSat, 1 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 15 SdHoareTripleChecker+Valid, 683 SdHoareTripleChecker+Invalid, 66 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 1 IncrementalHoareTripleChecker+Valid, 65 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2025-01-08 22:48:42,473 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [15 Valid, 683 Invalid, 66 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [1 Valid, 65 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2025-01-08 22:48:42,474 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 903 states. [2025-01-08 22:48:42,488 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 903 to 903. [2025-01-08 22:48:42,492 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 903 states, 837 states have (on average 1.2771804062126644) internal successors, (1069), 836 states have internal predecessors, (1069), 59 states have call successors, (59), 4 states have call predecessors, (59), 6 states have return successors, (68), 66 states have call predecessors, (68), 56 states have call successors, (68) [2025-01-08 22:48:42,494 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 903 states to 903 states and 1196 transitions. [2025-01-08 22:48:42,494 INFO L78 Accepts]: Start accepts. Automaton has 903 states and 1196 transitions. Word has length 51 [2025-01-08 22:48:42,495 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-01-08 22:48:42,495 INFO L471 AbstractCegarLoop]: Abstraction has 903 states and 1196 transitions. [2025-01-08 22:48:42,495 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 7 states, 7 states have (on average 5.142857142857143) internal successors, (36), 6 states have internal predecessors, (36), 2 states have call successors, (4), 2 states have call predecessors, (4), 1 states have return successors, (3), 1 states have call predecessors, (3), 1 states have call successors, (3) [2025-01-08 22:48:42,495 INFO L276 IsEmpty]: Start isEmpty. Operand 903 states and 1196 transitions. [2025-01-08 22:48:42,496 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 55 [2025-01-08 22:48:42,496 INFO L210 NwaCegarLoop]: Found error trace [2025-01-08 22:48:42,496 INFO L218 NwaCegarLoop]: trace histogram [3, 3, 3, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-01-08 22:48:42,497 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable24 [2025-01-08 22:48:42,497 INFO L396 AbstractCegarLoop]: === Iteration 26 === Targeting __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-01-08 22:48:42,497 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-01-08 22:48:42,497 INFO L85 PathProgramCache]: Analyzing trace with hash -200659841, now seen corresponding path program 1 times [2025-01-08 22:48:42,497 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-01-08 22:48:42,497 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2002838911] [2025-01-08 22:48:42,497 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-01-08 22:48:42,497 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-01-08 22:48:42,501 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 54 statements into 1 equivalence classes. [2025-01-08 22:48:42,514 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 54 of 54 statements. [2025-01-08 22:48:42,514 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-01-08 22:48:42,514 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-01-08 22:48:42,888 INFO L134 CoverageAnalysis]: Checked inductivity of 15 backedges. 8 proven. 3 refuted. 0 times theorem prover too weak. 4 trivial. 0 not checked. [2025-01-08 22:48:42,888 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-01-08 22:48:42,888 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2002838911] [2025-01-08 22:48:42,888 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [2002838911] provided 0 perfect and 1 imperfect interpolant sequences [2025-01-08 22:48:42,888 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [814775783] [2025-01-08 22:48:42,889 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-01-08 22:48:42,889 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-01-08 22:48:42,889 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 [2025-01-08 22:48:42,890 INFO L229 MonitoredProcess]: Starting monitored process 11 with /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2025-01-08 22:48:42,892 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (11)] Waiting until timeout for monitored process [2025-01-08 22:48:42,920 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 54 statements into 1 equivalence classes. [2025-01-08 22:48:42,935 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 54 of 54 statements. [2025-01-08 22:48:42,935 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-01-08 22:48:42,935 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-01-08 22:48:42,939 INFO L256 TraceCheckSpWp]: Trace formula consists of 160 conjuncts, 28 conjuncts are in the unsatisfiable core [2025-01-08 22:48:42,941 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-01-08 22:48:44,441 INFO L134 CoverageAnalysis]: Checked inductivity of 15 backedges. 6 proven. 0 refuted. 0 times theorem prover too weak. 9 trivial. 0 not checked. [2025-01-08 22:48:44,441 INFO L308 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2025-01-08 22:48:44,441 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [814775783] provided 1 perfect and 0 imperfect interpolant sequences [2025-01-08 22:48:44,441 INFO L185 FreeRefinementEngine]: Found 1 perfect and 1 imperfect interpolant sequences. [2025-01-08 22:48:44,441 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [14] imperfect sequences [19] total 31 [2025-01-08 22:48:44,441 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [825110036] [2025-01-08 22:48:44,441 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-01-08 22:48:44,442 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 14 states [2025-01-08 22:48:44,442 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-01-08 22:48:44,442 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 14 interpolants. [2025-01-08 22:48:44,442 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=75, Invalid=855, Unknown=0, NotChecked=0, Total=930 [2025-01-08 22:48:44,442 INFO L87 Difference]: Start difference. First operand 903 states and 1196 transitions. Second operand has 14 states, 14 states have (on average 3.0) internal successors, (42), 13 states have internal predecessors, (42), 2 states have call successors, (4), 2 states have call predecessors, (4), 2 states have return successors, (3), 2 states have call predecessors, (3), 1 states have call successors, (3) [2025-01-08 22:48:44,864 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-01-08 22:48:44,864 INFO L93 Difference]: Finished difference Result 1483 states and 1993 transitions. [2025-01-08 22:48:44,864 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 14 states. [2025-01-08 22:48:44,864 INFO L78 Accepts]: Start accepts. Automaton has has 14 states, 14 states have (on average 3.0) internal successors, (42), 13 states have internal predecessors, (42), 2 states have call successors, (4), 2 states have call predecessors, (4), 2 states have return successors, (3), 2 states have call predecessors, (3), 1 states have call successors, (3) Word has length 54 [2025-01-08 22:48:44,864 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-01-08 22:48:44,868 INFO L225 Difference]: With dead ends: 1483 [2025-01-08 22:48:44,868 INFO L226 Difference]: Without dead ends: 1402 [2025-01-08 22:48:44,869 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 74 GetRequests, 45 SyntacticMatches, 0 SemanticMatches, 29 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 96 ImplicationChecksByTransitivity, 1.1s TimeCoverageRelationStatistics Valid=75, Invalid=855, Unknown=0, NotChecked=0, Total=930 [2025-01-08 22:48:44,869 INFO L435 NwaCegarLoop]: 229 mSDtfsCounter, 150 mSDsluCounter, 1759 mSDsCounter, 0 mSdLazyCounter, 579 mSolverCounterSat, 10 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.3s Time, 0 mProtectedPredicate, 0 mProtectedAction, 160 SdHoareTripleChecker+Valid, 1988 SdHoareTripleChecker+Invalid, 589 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 10 IncrementalHoareTripleChecker+Valid, 579 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.4s IncrementalHoareTripleChecker+Time [2025-01-08 22:48:44,869 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [160 Valid, 1988 Invalid, 589 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [10 Valid, 579 Invalid, 0 Unknown, 0 Unchecked, 0.4s Time] [2025-01-08 22:48:44,870 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1402 states. [2025-01-08 22:48:44,888 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1402 to 1006. [2025-01-08 22:48:44,888 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 1006 states, 935 states have (on average 1.2780748663101604) internal successors, (1195), 933 states have internal predecessors, (1195), 63 states have call successors, (63), 4 states have call predecessors, (63), 7 states have return successors, (79), 72 states have call predecessors, (79), 60 states have call successors, (79) [2025-01-08 22:48:44,890 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1006 states to 1006 states and 1337 transitions. [2025-01-08 22:48:44,890 INFO L78 Accepts]: Start accepts. Automaton has 1006 states and 1337 transitions. Word has length 54 [2025-01-08 22:48:44,890 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-01-08 22:48:44,890 INFO L471 AbstractCegarLoop]: Abstraction has 1006 states and 1337 transitions. [2025-01-08 22:48:44,890 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 14 states, 14 states have (on average 3.0) internal successors, (42), 13 states have internal predecessors, (42), 2 states have call successors, (4), 2 states have call predecessors, (4), 2 states have return successors, (3), 2 states have call predecessors, (3), 1 states have call successors, (3) [2025-01-08 22:48:44,890 INFO L276 IsEmpty]: Start isEmpty. Operand 1006 states and 1337 transitions. [2025-01-08 22:48:44,891 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 55 [2025-01-08 22:48:44,892 INFO L210 NwaCegarLoop]: Found error trace [2025-01-08 22:48:44,892 INFO L218 NwaCegarLoop]: trace histogram [3, 3, 3, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-01-08 22:48:44,897 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (11)] Ended with exit code 0 [2025-01-08 22:48:45,092 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 11 /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable25 [2025-01-08 22:48:45,092 INFO L396 AbstractCegarLoop]: === Iteration 27 === Targeting __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-01-08 22:48:45,092 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-01-08 22:48:45,093 INFO L85 PathProgramCache]: Analyzing trace with hash -1278723724, now seen corresponding path program 1 times [2025-01-08 22:48:45,093 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-01-08 22:48:45,093 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [872526546] [2025-01-08 22:48:45,093 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-01-08 22:48:45,093 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-01-08 22:48:45,100 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 54 statements into 1 equivalence classes. [2025-01-08 22:48:45,111 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 54 of 54 statements. [2025-01-08 22:48:45,112 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-01-08 22:48:45,112 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-01-08 22:48:45,189 INFO L134 CoverageAnalysis]: Checked inductivity of 17 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 17 trivial. 0 not checked. [2025-01-08 22:48:45,189 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-01-08 22:48:45,189 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [872526546] [2025-01-08 22:48:45,189 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [872526546] provided 1 perfect and 0 imperfect interpolant sequences [2025-01-08 22:48:45,190 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-01-08 22:48:45,190 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2025-01-08 22:48:45,190 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [65741455] [2025-01-08 22:48:45,190 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-01-08 22:48:45,190 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2025-01-08 22:48:45,190 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-01-08 22:48:45,190 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2025-01-08 22:48:45,190 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=9, Invalid=21, Unknown=0, NotChecked=0, Total=30 [2025-01-08 22:48:45,190 INFO L87 Difference]: Start difference. First operand 1006 states and 1337 transitions. Second operand has 6 states, 5 states have (on average 7.8) internal successors, (39), 5 states have internal predecessors, (39), 2 states have call successors, (4), 2 states have call predecessors, (4), 1 states have return successors, (3), 1 states have call predecessors, (3), 1 states have call successors, (3) [2025-01-08 22:48:45,226 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-01-08 22:48:45,227 INFO L93 Difference]: Finished difference Result 1042 states and 1381 transitions. [2025-01-08 22:48:45,227 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2025-01-08 22:48:45,227 INFO L78 Accepts]: Start accepts. Automaton has has 6 states, 5 states have (on average 7.8) internal successors, (39), 5 states have internal predecessors, (39), 2 states have call successors, (4), 2 states have call predecessors, (4), 1 states have return successors, (3), 1 states have call predecessors, (3), 1 states have call successors, (3) Word has length 54 [2025-01-08 22:48:45,227 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-01-08 22:48:45,230 INFO L225 Difference]: With dead ends: 1042 [2025-01-08 22:48:45,230 INFO L226 Difference]: Without dead ends: 1040 [2025-01-08 22:48:45,230 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 7 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 5 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=13, Invalid=29, Unknown=0, NotChecked=0, Total=42 [2025-01-08 22:48:45,231 INFO L435 NwaCegarLoop]: 138 mSDtfsCounter, 17 mSDsluCounter, 527 mSDsCounter, 0 mSdLazyCounter, 30 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 19 SdHoareTripleChecker+Valid, 665 SdHoareTripleChecker+Invalid, 30 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 30 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2025-01-08 22:48:45,231 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [19 Valid, 665 Invalid, 30 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 30 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2025-01-08 22:48:45,232 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1040 states. [2025-01-08 22:48:45,251 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1040 to 1014. [2025-01-08 22:48:45,252 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 1014 states, 939 states have (on average 1.2768903088391905) internal successors, (1199), 940 states have internal predecessors, (1199), 66 states have call successors, (66), 5 states have call predecessors, (66), 8 states have return successors, (82), 72 states have call predecessors, (82), 63 states have call successors, (82) [2025-01-08 22:48:45,253 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1014 states to 1014 states and 1347 transitions. [2025-01-08 22:48:45,253 INFO L78 Accepts]: Start accepts. Automaton has 1014 states and 1347 transitions. Word has length 54 [2025-01-08 22:48:45,254 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-01-08 22:48:45,254 INFO L471 AbstractCegarLoop]: Abstraction has 1014 states and 1347 transitions. [2025-01-08 22:48:45,254 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 5 states have (on average 7.8) internal successors, (39), 5 states have internal predecessors, (39), 2 states have call successors, (4), 2 states have call predecessors, (4), 1 states have return successors, (3), 1 states have call predecessors, (3), 1 states have call successors, (3) [2025-01-08 22:48:45,254 INFO L276 IsEmpty]: Start isEmpty. Operand 1014 states and 1347 transitions. [2025-01-08 22:48:45,255 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 55 [2025-01-08 22:48:45,255 INFO L210 NwaCegarLoop]: Found error trace [2025-01-08 22:48:45,255 INFO L218 NwaCegarLoop]: trace histogram [3, 3, 3, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-01-08 22:48:45,256 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable26 [2025-01-08 22:48:45,256 INFO L396 AbstractCegarLoop]: === Iteration 28 === Targeting __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-01-08 22:48:45,256 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-01-08 22:48:45,256 INFO L85 PathProgramCache]: Analyzing trace with hash -1560629129, now seen corresponding path program 1 times [2025-01-08 22:48:45,256 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-01-08 22:48:45,256 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1855819083] [2025-01-08 22:48:45,256 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-01-08 22:48:45,256 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-01-08 22:48:45,259 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 54 statements into 1 equivalence classes. [2025-01-08 22:48:45,266 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 54 of 54 statements. [2025-01-08 22:48:45,266 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-01-08 22:48:45,266 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-01-08 22:48:45,300 INFO L134 CoverageAnalysis]: Checked inductivity of 15 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 15 trivial. 0 not checked. [2025-01-08 22:48:45,300 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-01-08 22:48:45,300 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1855819083] [2025-01-08 22:48:45,300 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1855819083] provided 1 perfect and 0 imperfect interpolant sequences [2025-01-08 22:48:45,300 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-01-08 22:48:45,300 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2025-01-08 22:48:45,300 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1604220892] [2025-01-08 22:48:45,300 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-01-08 22:48:45,301 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2025-01-08 22:48:45,301 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-01-08 22:48:45,301 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2025-01-08 22:48:45,301 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2025-01-08 22:48:45,301 INFO L87 Difference]: Start difference. First operand 1014 states and 1347 transitions. Second operand has 5 states, 5 states have (on average 8.0) internal successors, (40), 5 states have internal predecessors, (40), 2 states have call successors, (4), 2 states have call predecessors, (4), 1 states have return successors, (3), 1 states have call predecessors, (3), 1 states have call successors, (3) [2025-01-08 22:48:45,389 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-01-08 22:48:45,389 INFO L93 Difference]: Finished difference Result 1174 states and 1550 transitions. [2025-01-08 22:48:45,390 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2025-01-08 22:48:45,390 INFO L78 Accepts]: Start accepts. Automaton has has 5 states, 5 states have (on average 8.0) internal successors, (40), 5 states have internal predecessors, (40), 2 states have call successors, (4), 2 states have call predecessors, (4), 1 states have return successors, (3), 1 states have call predecessors, (3), 1 states have call successors, (3) Word has length 54 [2025-01-08 22:48:45,390 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-01-08 22:48:45,393 INFO L225 Difference]: With dead ends: 1174 [2025-01-08 22:48:45,393 INFO L226 Difference]: Without dead ends: 1139 [2025-01-08 22:48:45,393 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 7 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 5 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=15, Invalid=27, Unknown=0, NotChecked=0, Total=42 [2025-01-08 22:48:45,394 INFO L435 NwaCegarLoop]: 148 mSDtfsCounter, 47 mSDsluCounter, 362 mSDsCounter, 0 mSdLazyCounter, 95 mSolverCounterSat, 4 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 50 SdHoareTripleChecker+Valid, 510 SdHoareTripleChecker+Invalid, 99 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 4 IncrementalHoareTripleChecker+Valid, 95 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2025-01-08 22:48:45,394 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [50 Valid, 510 Invalid, 99 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [4 Valid, 95 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2025-01-08 22:48:45,394 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1139 states. [2025-01-08 22:48:45,416 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1139 to 1080. [2025-01-08 22:48:45,417 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 1080 states, 1000 states have (on average 1.281) internal successors, (1281), 1002 states have internal predecessors, (1281), 71 states have call successors, (71), 5 states have call predecessors, (71), 8 states have return successors, (87), 76 states have call predecessors, (87), 68 states have call successors, (87) [2025-01-08 22:48:45,419 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1080 states to 1080 states and 1439 transitions. [2025-01-08 22:48:45,419 INFO L78 Accepts]: Start accepts. Automaton has 1080 states and 1439 transitions. Word has length 54 [2025-01-08 22:48:45,419 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-01-08 22:48:45,419 INFO L471 AbstractCegarLoop]: Abstraction has 1080 states and 1439 transitions. [2025-01-08 22:48:45,419 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 8.0) internal successors, (40), 5 states have internal predecessors, (40), 2 states have call successors, (4), 2 states have call predecessors, (4), 1 states have return successors, (3), 1 states have call predecessors, (3), 1 states have call successors, (3) [2025-01-08 22:48:45,419 INFO L276 IsEmpty]: Start isEmpty. Operand 1080 states and 1439 transitions. [2025-01-08 22:48:45,420 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 55 [2025-01-08 22:48:45,420 INFO L210 NwaCegarLoop]: Found error trace [2025-01-08 22:48:45,420 INFO L218 NwaCegarLoop]: trace histogram [3, 3, 3, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-01-08 22:48:45,420 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable27 [2025-01-08 22:48:45,421 INFO L396 AbstractCegarLoop]: === Iteration 29 === Targeting __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-01-08 22:48:45,421 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-01-08 22:48:45,421 INFO L85 PathProgramCache]: Analyzing trace with hash -406989326, now seen corresponding path program 1 times [2025-01-08 22:48:45,421 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-01-08 22:48:45,421 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1176688034] [2025-01-08 22:48:45,421 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-01-08 22:48:45,421 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-01-08 22:48:45,424 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 54 statements into 1 equivalence classes. [2025-01-08 22:48:45,426 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 54 of 54 statements. [2025-01-08 22:48:45,426 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-01-08 22:48:45,426 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-01-08 22:48:45,470 INFO L134 CoverageAnalysis]: Checked inductivity of 17 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 17 trivial. 0 not checked. [2025-01-08 22:48:45,470 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-01-08 22:48:45,470 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1176688034] [2025-01-08 22:48:45,470 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1176688034] provided 1 perfect and 0 imperfect interpolant sequences [2025-01-08 22:48:45,470 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-01-08 22:48:45,470 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2025-01-08 22:48:45,470 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1847517707] [2025-01-08 22:48:45,470 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-01-08 22:48:45,471 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2025-01-08 22:48:45,471 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-01-08 22:48:45,471 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2025-01-08 22:48:45,471 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=9, Invalid=21, Unknown=0, NotChecked=0, Total=30 [2025-01-08 22:48:45,471 INFO L87 Difference]: Start difference. First operand 1080 states and 1439 transitions. Second operand has 6 states, 5 states have (on average 7.8) internal successors, (39), 5 states have internal predecessors, (39), 2 states have call successors, (4), 2 states have call predecessors, (4), 1 states have return successors, (3), 1 states have call predecessors, (3), 1 states have call successors, (3) [2025-01-08 22:48:45,521 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-01-08 22:48:45,522 INFO L93 Difference]: Finished difference Result 1109 states and 1471 transitions. [2025-01-08 22:48:45,522 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2025-01-08 22:48:45,522 INFO L78 Accepts]: Start accepts. Automaton has has 6 states, 5 states have (on average 7.8) internal successors, (39), 5 states have internal predecessors, (39), 2 states have call successors, (4), 2 states have call predecessors, (4), 1 states have return successors, (3), 1 states have call predecessors, (3), 1 states have call successors, (3) Word has length 54 [2025-01-08 22:48:45,522 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-01-08 22:48:45,525 INFO L225 Difference]: With dead ends: 1109 [2025-01-08 22:48:45,525 INFO L226 Difference]: Without dead ends: 1107 [2025-01-08 22:48:45,525 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 7 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 5 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=13, Invalid=29, Unknown=0, NotChecked=0, Total=42 [2025-01-08 22:48:45,528 INFO L435 NwaCegarLoop]: 150 mSDtfsCounter, 20 mSDsluCounter, 562 mSDsCounter, 0 mSdLazyCounter, 32 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 22 SdHoareTripleChecker+Valid, 712 SdHoareTripleChecker+Invalid, 32 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 32 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2025-01-08 22:48:45,528 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [22 Valid, 712 Invalid, 32 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 32 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2025-01-08 22:48:45,529 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1107 states. [2025-01-08 22:48:45,562 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1107 to 1085. [2025-01-08 22:48:45,562 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 1085 states, 1003 states have (on average 1.280159521435693) internal successors, (1284), 1006 states have internal predecessors, (1284), 72 states have call successors, (72), 6 states have call predecessors, (72), 9 states have return successors, (88), 76 states have call predecessors, (88), 69 states have call successors, (88) [2025-01-08 22:48:45,564 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1085 states to 1085 states and 1444 transitions. [2025-01-08 22:48:45,565 INFO L78 Accepts]: Start accepts. Automaton has 1085 states and 1444 transitions. Word has length 54 [2025-01-08 22:48:45,565 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-01-08 22:48:45,565 INFO L471 AbstractCegarLoop]: Abstraction has 1085 states and 1444 transitions. [2025-01-08 22:48:45,565 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 5 states have (on average 7.8) internal successors, (39), 5 states have internal predecessors, (39), 2 states have call successors, (4), 2 states have call predecessors, (4), 1 states have return successors, (3), 1 states have call predecessors, (3), 1 states have call successors, (3) [2025-01-08 22:48:45,565 INFO L276 IsEmpty]: Start isEmpty. Operand 1085 states and 1444 transitions. [2025-01-08 22:48:45,566 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 56 [2025-01-08 22:48:45,566 INFO L210 NwaCegarLoop]: Found error trace [2025-01-08 22:48:45,566 INFO L218 NwaCegarLoop]: trace histogram [3, 3, 3, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-01-08 22:48:45,566 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable28 [2025-01-08 22:48:45,566 INFO L396 AbstractCegarLoop]: === Iteration 30 === Targeting __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-01-08 22:48:45,567 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-01-08 22:48:45,567 INFO L85 PathProgramCache]: Analyzing trace with hash 613926278, now seen corresponding path program 1 times [2025-01-08 22:48:45,567 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-01-08 22:48:45,567 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [719018118] [2025-01-08 22:48:45,567 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-01-08 22:48:45,567 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-01-08 22:48:45,572 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 55 statements into 1 equivalence classes. [2025-01-08 22:48:45,581 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 55 of 55 statements. [2025-01-08 22:48:45,582 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-01-08 22:48:45,582 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-01-08 22:48:45,926 INFO L134 CoverageAnalysis]: Checked inductivity of 15 backedges. 6 proven. 3 refuted. 0 times theorem prover too weak. 6 trivial. 0 not checked. [2025-01-08 22:48:45,926 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-01-08 22:48:45,926 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [719018118] [2025-01-08 22:48:45,926 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [719018118] provided 0 perfect and 1 imperfect interpolant sequences [2025-01-08 22:48:45,926 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1612142490] [2025-01-08 22:48:45,926 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-01-08 22:48:45,926 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-01-08 22:48:45,926 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 [2025-01-08 22:48:45,928 INFO L229 MonitoredProcess]: Starting monitored process 12 with /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2025-01-08 22:48:45,929 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (12)] Waiting until timeout for monitored process [2025-01-08 22:48:45,960 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 55 statements into 1 equivalence classes. [2025-01-08 22:48:46,020 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 55 of 55 statements. [2025-01-08 22:48:46,020 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-01-08 22:48:46,020 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-01-08 22:48:46,022 INFO L256 TraceCheckSpWp]: Trace formula consists of 163 conjuncts, 15 conjuncts are in the unsatisfiable core [2025-01-08 22:48:46,023 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-01-08 22:48:46,159 INFO L134 CoverageAnalysis]: Checked inductivity of 15 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 15 trivial. 0 not checked. [2025-01-08 22:48:46,159 INFO L308 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2025-01-08 22:48:46,159 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1612142490] provided 1 perfect and 0 imperfect interpolant sequences [2025-01-08 22:48:46,159 INFO L185 FreeRefinementEngine]: Found 1 perfect and 1 imperfect interpolant sequences. [2025-01-08 22:48:46,159 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [8] imperfect sequences [19] total 25 [2025-01-08 22:48:46,159 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [562788579] [2025-01-08 22:48:46,159 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-01-08 22:48:46,159 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 8 states [2025-01-08 22:48:46,159 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-01-08 22:48:46,160 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2025-01-08 22:48:46,160 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=64, Invalid=536, Unknown=0, NotChecked=0, Total=600 [2025-01-08 22:48:46,160 INFO L87 Difference]: Start difference. First operand 1085 states and 1444 transitions. Second operand has 8 states, 8 states have (on average 5.125) internal successors, (41), 8 states have internal predecessors, (41), 2 states have call successors, (4), 2 states have call predecessors, (4), 1 states have return successors, (3), 1 states have call predecessors, (3), 1 states have call successors, (3) [2025-01-08 22:48:46,318 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-01-08 22:48:46,318 INFO L93 Difference]: Finished difference Result 1337 states and 1789 transitions. [2025-01-08 22:48:46,319 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2025-01-08 22:48:46,319 INFO L78 Accepts]: Start accepts. Automaton has has 8 states, 8 states have (on average 5.125) internal successors, (41), 8 states have internal predecessors, (41), 2 states have call successors, (4), 2 states have call predecessors, (4), 1 states have return successors, (3), 1 states have call predecessors, (3), 1 states have call successors, (3) Word has length 55 [2025-01-08 22:48:46,319 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-01-08 22:48:46,325 INFO L225 Difference]: With dead ends: 1337 [2025-01-08 22:48:46,326 INFO L226 Difference]: Without dead ends: 1231 [2025-01-08 22:48:46,326 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 77 GetRequests, 54 SyntacticMatches, 0 SemanticMatches, 23 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 88 ImplicationChecksByTransitivity, 0.3s TimeCoverageRelationStatistics Valid=64, Invalid=536, Unknown=0, NotChecked=0, Total=600 [2025-01-08 22:48:46,326 INFO L435 NwaCegarLoop]: 176 mSDtfsCounter, 71 mSDsluCounter, 720 mSDsCounter, 0 mSdLazyCounter, 245 mSolverCounterSat, 8 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 77 SdHoareTripleChecker+Valid, 896 SdHoareTripleChecker+Invalid, 253 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 8 IncrementalHoareTripleChecker+Valid, 245 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2025-01-08 22:48:46,327 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [77 Valid, 896 Invalid, 253 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [8 Valid, 245 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2025-01-08 22:48:46,327 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1231 states. [2025-01-08 22:48:46,352 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1231 to 937. [2025-01-08 22:48:46,353 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 937 states, 863 states have (on average 1.2769409038238702) internal successors, (1102), 869 states have internal predecessors, (1102), 65 states have call successors, (65), 6 states have call predecessors, (65), 8 states have return successors, (72), 65 states have call predecessors, (72), 62 states have call successors, (72) [2025-01-08 22:48:46,354 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 937 states to 937 states and 1239 transitions. [2025-01-08 22:48:46,355 INFO L78 Accepts]: Start accepts. Automaton has 937 states and 1239 transitions. Word has length 55 [2025-01-08 22:48:46,355 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-01-08 22:48:46,355 INFO L471 AbstractCegarLoop]: Abstraction has 937 states and 1239 transitions. [2025-01-08 22:48:46,355 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 8 states, 8 states have (on average 5.125) internal successors, (41), 8 states have internal predecessors, (41), 2 states have call successors, (4), 2 states have call predecessors, (4), 1 states have return successors, (3), 1 states have call predecessors, (3), 1 states have call successors, (3) [2025-01-08 22:48:46,355 INFO L276 IsEmpty]: Start isEmpty. Operand 937 states and 1239 transitions. [2025-01-08 22:48:46,356 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 56 [2025-01-08 22:48:46,356 INFO L210 NwaCegarLoop]: Found error trace [2025-01-08 22:48:46,356 INFO L218 NwaCegarLoop]: trace histogram [3, 3, 3, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-01-08 22:48:46,362 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (12)] Forceful destruction successful, exit code 0 [2025-01-08 22:48:46,557 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable29,12 /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-01-08 22:48:46,557 INFO L396 AbstractCegarLoop]: === Iteration 31 === Targeting __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-01-08 22:48:46,558 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-01-08 22:48:46,558 INFO L85 PathProgramCache]: Analyzing trace with hash -1501480203, now seen corresponding path program 1 times [2025-01-08 22:48:46,558 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-01-08 22:48:46,558 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [469985495] [2025-01-08 22:48:46,558 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-01-08 22:48:46,558 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-01-08 22:48:46,563 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 55 statements into 1 equivalence classes. [2025-01-08 22:48:46,564 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 55 of 55 statements. [2025-01-08 22:48:46,564 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-01-08 22:48:46,564 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-01-08 22:48:46,592 INFO L134 CoverageAnalysis]: Checked inductivity of 17 backedges. 0 proven. 10 refuted. 0 times theorem prover too weak. 7 trivial. 0 not checked. [2025-01-08 22:48:46,593 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-01-08 22:48:46,593 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [469985495] [2025-01-08 22:48:46,593 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [469985495] provided 0 perfect and 1 imperfect interpolant sequences [2025-01-08 22:48:46,593 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [220797553] [2025-01-08 22:48:46,593 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-01-08 22:48:46,593 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-01-08 22:48:46,593 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 [2025-01-08 22:48:46,595 INFO L229 MonitoredProcess]: Starting monitored process 13 with /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2025-01-08 22:48:46,603 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (13)] Waiting until timeout for monitored process [2025-01-08 22:48:46,627 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 55 statements into 1 equivalence classes. [2025-01-08 22:48:46,640 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 55 of 55 statements. [2025-01-08 22:48:46,640 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-01-08 22:48:46,640 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-01-08 22:48:46,641 INFO L256 TraceCheckSpWp]: Trace formula consists of 153 conjuncts, 3 conjuncts are in the unsatisfiable core [2025-01-08 22:48:46,642 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-01-08 22:48:46,655 INFO L134 CoverageAnalysis]: Checked inductivity of 17 backedges. 12 proven. 0 refuted. 0 times theorem prover too weak. 5 trivial. 0 not checked. [2025-01-08 22:48:46,655 INFO L308 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2025-01-08 22:48:46,655 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [220797553] provided 1 perfect and 0 imperfect interpolant sequences [2025-01-08 22:48:46,655 INFO L185 FreeRefinementEngine]: Found 1 perfect and 1 imperfect interpolant sequences. [2025-01-08 22:48:46,655 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [4] total 6 [2025-01-08 22:48:46,655 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1026766128] [2025-01-08 22:48:46,655 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-01-08 22:48:46,655 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2025-01-08 22:48:46,655 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-01-08 22:48:46,656 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2025-01-08 22:48:46,656 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=10, Invalid=20, Unknown=0, NotChecked=0, Total=30 [2025-01-08 22:48:46,656 INFO L87 Difference]: Start difference. First operand 937 states and 1239 transitions. Second operand has 4 states, 4 states have (on average 11.25) internal successors, (45), 4 states have internal predecessors, (45), 2 states have call successors, (4), 2 states have call predecessors, (4), 2 states have return successors, (3), 1 states have call predecessors, (3), 2 states have call successors, (3) [2025-01-08 22:48:46,701 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-01-08 22:48:46,701 INFO L93 Difference]: Finished difference Result 1861 states and 2465 transitions. [2025-01-08 22:48:46,701 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2025-01-08 22:48:46,701 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 4 states have (on average 11.25) internal successors, (45), 4 states have internal predecessors, (45), 2 states have call successors, (4), 2 states have call predecessors, (4), 2 states have return successors, (3), 1 states have call predecessors, (3), 2 states have call successors, (3) Word has length 55 [2025-01-08 22:48:46,702 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-01-08 22:48:46,704 INFO L225 Difference]: With dead ends: 1861 [2025-01-08 22:48:46,704 INFO L226 Difference]: Without dead ends: 952 [2025-01-08 22:48:46,706 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 58 GetRequests, 54 SyntacticMatches, 0 SemanticMatches, 4 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=10, Invalid=20, Unknown=0, NotChecked=0, Total=30 [2025-01-08 22:48:46,707 INFO L435 NwaCegarLoop]: 118 mSDtfsCounter, 13 mSDsluCounter, 221 mSDsCounter, 0 mSdLazyCounter, 44 mSolverCounterSat, 1 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 13 SdHoareTripleChecker+Valid, 339 SdHoareTripleChecker+Invalid, 45 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 1 IncrementalHoareTripleChecker+Valid, 44 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2025-01-08 22:48:46,707 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [13 Valid, 339 Invalid, 45 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [1 Valid, 44 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2025-01-08 22:48:46,707 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 952 states. [2025-01-08 22:48:46,727 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 952 to 942. [2025-01-08 22:48:46,728 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 942 states, 867 states have (on average 1.2779700115340253) internal successors, (1108), 874 states have internal predecessors, (1108), 65 states have call successors, (65), 6 states have call predecessors, (65), 9 states have return successors, (78), 65 states have call predecessors, (78), 62 states have call successors, (78) [2025-01-08 22:48:46,729 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 942 states to 942 states and 1251 transitions. [2025-01-08 22:48:46,730 INFO L78 Accepts]: Start accepts. Automaton has 942 states and 1251 transitions. Word has length 55 [2025-01-08 22:48:46,730 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-01-08 22:48:46,730 INFO L471 AbstractCegarLoop]: Abstraction has 942 states and 1251 transitions. [2025-01-08 22:48:46,730 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 11.25) internal successors, (45), 4 states have internal predecessors, (45), 2 states have call successors, (4), 2 states have call predecessors, (4), 2 states have return successors, (3), 1 states have call predecessors, (3), 2 states have call successors, (3) [2025-01-08 22:48:46,730 INFO L276 IsEmpty]: Start isEmpty. Operand 942 states and 1251 transitions. [2025-01-08 22:48:46,731 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 57 [2025-01-08 22:48:46,731 INFO L210 NwaCegarLoop]: Found error trace [2025-01-08 22:48:46,731 INFO L218 NwaCegarLoop]: trace histogram [3, 3, 3, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-01-08 22:48:46,737 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (13)] Forceful destruction successful, exit code 0 [2025-01-08 22:48:46,931 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable30,13 /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-01-08 22:48:46,932 INFO L396 AbstractCegarLoop]: === Iteration 32 === Targeting __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-01-08 22:48:46,932 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-01-08 22:48:46,932 INFO L85 PathProgramCache]: Analyzing trace with hash 1693621657, now seen corresponding path program 1 times [2025-01-08 22:48:46,932 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-01-08 22:48:46,932 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1364580457] [2025-01-08 22:48:46,932 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-01-08 22:48:46,932 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-01-08 22:48:46,936 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 56 statements into 1 equivalence classes. [2025-01-08 22:48:46,942 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 56 of 56 statements. [2025-01-08 22:48:46,942 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-01-08 22:48:46,942 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-01-08 22:48:47,060 INFO L134 CoverageAnalysis]: Checked inductivity of 15 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 15 trivial. 0 not checked. [2025-01-08 22:48:47,060 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-01-08 22:48:47,060 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1364580457] [2025-01-08 22:48:47,060 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1364580457] provided 1 perfect and 0 imperfect interpolant sequences [2025-01-08 22:48:47,060 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-01-08 22:48:47,060 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2025-01-08 22:48:47,061 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [424051317] [2025-01-08 22:48:47,061 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-01-08 22:48:47,061 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 7 states [2025-01-08 22:48:47,061 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-01-08 22:48:47,061 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2025-01-08 22:48:47,061 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=11, Invalid=31, Unknown=0, NotChecked=0, Total=42 [2025-01-08 22:48:47,061 INFO L87 Difference]: Start difference. First operand 942 states and 1251 transitions. Second operand has 7 states, 7 states have (on average 6.0) internal successors, (42), 7 states have internal predecessors, (42), 2 states have call successors, (4), 2 states have call predecessors, (4), 1 states have return successors, (3), 1 states have call predecessors, (3), 1 states have call successors, (3) [2025-01-08 22:48:47,247 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-01-08 22:48:47,247 INFO L93 Difference]: Finished difference Result 1199 states and 1601 transitions. [2025-01-08 22:48:47,247 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2025-01-08 22:48:47,248 INFO L78 Accepts]: Start accepts. Automaton has has 7 states, 7 states have (on average 6.0) internal successors, (42), 7 states have internal predecessors, (42), 2 states have call successors, (4), 2 states have call predecessors, (4), 1 states have return successors, (3), 1 states have call predecessors, (3), 1 states have call successors, (3) Word has length 56 [2025-01-08 22:48:47,248 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-01-08 22:48:47,251 INFO L225 Difference]: With dead ends: 1199 [2025-01-08 22:48:47,251 INFO L226 Difference]: Without dead ends: 1142 [2025-01-08 22:48:47,251 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 14 GetRequests, 8 SyntacticMatches, 0 SemanticMatches, 6 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=15, Invalid=41, Unknown=0, NotChecked=0, Total=56 [2025-01-08 22:48:47,253 INFO L435 NwaCegarLoop]: 135 mSDtfsCounter, 54 mSDsluCounter, 525 mSDsCounter, 0 mSdLazyCounter, 238 mSolverCounterSat, 7 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 59 SdHoareTripleChecker+Valid, 660 SdHoareTripleChecker+Invalid, 245 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 7 IncrementalHoareTripleChecker+Valid, 238 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.2s IncrementalHoareTripleChecker+Time [2025-01-08 22:48:47,254 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [59 Valid, 660 Invalid, 245 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [7 Valid, 238 Invalid, 0 Unknown, 0 Unchecked, 0.2s Time] [2025-01-08 22:48:47,255 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1142 states. [2025-01-08 22:48:47,282 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1142 to 928. [2025-01-08 22:48:47,283 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 928 states, 851 states have (on average 1.2890716803760283) internal successors, (1097), 860 states have internal predecessors, (1097), 67 states have call successors, (67), 6 states have call predecessors, (67), 9 states have return successors, (78), 65 states have call predecessors, (78), 64 states have call successors, (78) [2025-01-08 22:48:47,284 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 928 states to 928 states and 1242 transitions. [2025-01-08 22:48:47,284 INFO L78 Accepts]: Start accepts. Automaton has 928 states and 1242 transitions. Word has length 56 [2025-01-08 22:48:47,285 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-01-08 22:48:47,285 INFO L471 AbstractCegarLoop]: Abstraction has 928 states and 1242 transitions. [2025-01-08 22:48:47,285 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 7 states, 7 states have (on average 6.0) internal successors, (42), 7 states have internal predecessors, (42), 2 states have call successors, (4), 2 states have call predecessors, (4), 1 states have return successors, (3), 1 states have call predecessors, (3), 1 states have call successors, (3) [2025-01-08 22:48:47,285 INFO L276 IsEmpty]: Start isEmpty. Operand 928 states and 1242 transitions. [2025-01-08 22:48:47,286 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 58 [2025-01-08 22:48:47,286 INFO L210 NwaCegarLoop]: Found error trace [2025-01-08 22:48:47,286 INFO L218 NwaCegarLoop]: trace histogram [3, 3, 3, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-01-08 22:48:47,286 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable31 [2025-01-08 22:48:47,286 INFO L396 AbstractCegarLoop]: === Iteration 33 === Targeting __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-01-08 22:48:47,286 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-01-08 22:48:47,286 INFO L85 PathProgramCache]: Analyzing trace with hash -1223136242, now seen corresponding path program 1 times [2025-01-08 22:48:47,286 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-01-08 22:48:47,286 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1024454151] [2025-01-08 22:48:47,286 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-01-08 22:48:47,287 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-01-08 22:48:47,297 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 57 statements into 1 equivalence classes. [2025-01-08 22:48:47,310 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 57 of 57 statements. [2025-01-08 22:48:47,310 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-01-08 22:48:47,310 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-01-08 22:48:47,546 INFO L134 CoverageAnalysis]: Checked inductivity of 23 backedges. 0 proven. 10 refuted. 0 times theorem prover too weak. 13 trivial. 0 not checked. [2025-01-08 22:48:47,546 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-01-08 22:48:47,546 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1024454151] [2025-01-08 22:48:47,546 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1024454151] provided 0 perfect and 1 imperfect interpolant sequences [2025-01-08 22:48:47,546 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1970444815] [2025-01-08 22:48:47,547 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-01-08 22:48:47,547 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-01-08 22:48:47,547 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 [2025-01-08 22:48:47,548 INFO L229 MonitoredProcess]: Starting monitored process 14 with /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2025-01-08 22:48:47,550 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (14)] Waiting until timeout for monitored process [2025-01-08 22:48:47,578 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 57 statements into 1 equivalence classes. [2025-01-08 22:48:47,602 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 57 of 57 statements. [2025-01-08 22:48:47,602 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-01-08 22:48:47,602 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-01-08 22:48:47,604 INFO L256 TraceCheckSpWp]: Trace formula consists of 161 conjuncts, 10 conjuncts are in the unsatisfiable core [2025-01-08 22:48:47,605 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-01-08 22:48:47,655 INFO L134 CoverageAnalysis]: Checked inductivity of 23 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 23 trivial. 0 not checked. [2025-01-08 22:48:47,655 INFO L308 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2025-01-08 22:48:47,655 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1970444815] provided 1 perfect and 0 imperfect interpolant sequences [2025-01-08 22:48:47,655 INFO L185 FreeRefinementEngine]: Found 1 perfect and 1 imperfect interpolant sequences. [2025-01-08 22:48:47,655 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [15] total 18 [2025-01-08 22:48:47,656 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1240631558] [2025-01-08 22:48:47,656 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-01-08 22:48:47,656 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2025-01-08 22:48:47,656 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-01-08 22:48:47,656 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2025-01-08 22:48:47,656 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=44, Invalid=262, Unknown=0, NotChecked=0, Total=306 [2025-01-08 22:48:47,656 INFO L87 Difference]: Start difference. First operand 928 states and 1242 transitions. Second operand has 5 states, 5 states have (on average 7.0) internal successors, (35), 5 states have internal predecessors, (35), 2 states have call successors, (4), 2 states have call predecessors, (4), 1 states have return successors, (3), 1 states have call predecessors, (3), 1 states have call successors, (3) [2025-01-08 22:48:47,761 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-01-08 22:48:47,761 INFO L93 Difference]: Finished difference Result 1092 states and 1458 transitions. [2025-01-08 22:48:47,762 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2025-01-08 22:48:47,762 INFO L78 Accepts]: Start accepts. Automaton has has 5 states, 5 states have (on average 7.0) internal successors, (35), 5 states have internal predecessors, (35), 2 states have call successors, (4), 2 states have call predecessors, (4), 1 states have return successors, (3), 1 states have call predecessors, (3), 1 states have call successors, (3) Word has length 57 [2025-01-08 22:48:47,762 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-01-08 22:48:47,766 INFO L225 Difference]: With dead ends: 1092 [2025-01-08 22:48:47,766 INFO L226 Difference]: Without dead ends: 1058 [2025-01-08 22:48:47,767 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 75 GetRequests, 56 SyntacticMatches, 0 SemanticMatches, 19 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 55 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=59, Invalid=361, Unknown=0, NotChecked=0, Total=420 [2025-01-08 22:48:47,767 INFO L435 NwaCegarLoop]: 120 mSDtfsCounter, 138 mSDsluCounter, 366 mSDsCounter, 0 mSdLazyCounter, 59 mSolverCounterSat, 7 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 142 SdHoareTripleChecker+Valid, 486 SdHoareTripleChecker+Invalid, 66 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 7 IncrementalHoareTripleChecker+Valid, 59 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2025-01-08 22:48:47,767 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [142 Valid, 486 Invalid, 66 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [7 Valid, 59 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2025-01-08 22:48:47,770 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1058 states. [2025-01-08 22:48:47,795 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1058 to 928. [2025-01-08 22:48:47,796 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 928 states, 851 states have (on average 1.2867215041128084) internal successors, (1095), 860 states have internal predecessors, (1095), 67 states have call successors, (67), 6 states have call predecessors, (67), 9 states have return successors, (78), 65 states have call predecessors, (78), 64 states have call successors, (78) [2025-01-08 22:48:47,797 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 928 states to 928 states and 1240 transitions. [2025-01-08 22:48:47,798 INFO L78 Accepts]: Start accepts. Automaton has 928 states and 1240 transitions. Word has length 57 [2025-01-08 22:48:47,798 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-01-08 22:48:47,798 INFO L471 AbstractCegarLoop]: Abstraction has 928 states and 1240 transitions. [2025-01-08 22:48:47,798 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 7.0) internal successors, (35), 5 states have internal predecessors, (35), 2 states have call successors, (4), 2 states have call predecessors, (4), 1 states have return successors, (3), 1 states have call predecessors, (3), 1 states have call successors, (3) [2025-01-08 22:48:47,798 INFO L276 IsEmpty]: Start isEmpty. Operand 928 states and 1240 transitions. [2025-01-08 22:48:47,799 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 58 [2025-01-08 22:48:47,799 INFO L210 NwaCegarLoop]: Found error trace [2025-01-08 22:48:47,799 INFO L218 NwaCegarLoop]: trace histogram [3, 3, 3, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-01-08 22:48:47,805 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (14)] Forceful destruction successful, exit code 0 [2025-01-08 22:48:48,004 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable32,14 /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-01-08 22:48:48,004 INFO L396 AbstractCegarLoop]: === Iteration 34 === Targeting __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-01-08 22:48:48,004 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-01-08 22:48:48,004 INFO L85 PathProgramCache]: Analyzing trace with hash -522071664, now seen corresponding path program 1 times [2025-01-08 22:48:48,004 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-01-08 22:48:48,004 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [101531854] [2025-01-08 22:48:48,004 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-01-08 22:48:48,004 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-01-08 22:48:48,008 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 57 statements into 1 equivalence classes. [2025-01-08 22:48:48,014 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 57 of 57 statements. [2025-01-08 22:48:48,014 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-01-08 22:48:48,014 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-01-08 22:48:48,106 INFO L134 CoverageAnalysis]: Checked inductivity of 23 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 23 trivial. 0 not checked. [2025-01-08 22:48:48,106 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-01-08 22:48:48,106 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [101531854] [2025-01-08 22:48:48,106 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [101531854] provided 1 perfect and 0 imperfect interpolant sequences [2025-01-08 22:48:48,106 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-01-08 22:48:48,106 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2025-01-08 22:48:48,106 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1942279886] [2025-01-08 22:48:48,106 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-01-08 22:48:48,107 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2025-01-08 22:48:48,107 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-01-08 22:48:48,107 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2025-01-08 22:48:48,107 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=9, Invalid=21, Unknown=0, NotChecked=0, Total=30 [2025-01-08 22:48:48,107 INFO L87 Difference]: Start difference. First operand 928 states and 1240 transitions. Second operand has 6 states, 6 states have (on average 5.833333333333333) internal successors, (35), 6 states have internal predecessors, (35), 2 states have call successors, (4), 2 states have call predecessors, (4), 1 states have return successors, (3), 1 states have call predecessors, (3), 1 states have call successors, (3) [2025-01-08 22:48:48,209 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-01-08 22:48:48,209 INFO L93 Difference]: Finished difference Result 1123 states and 1508 transitions. [2025-01-08 22:48:48,209 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2025-01-08 22:48:48,209 INFO L78 Accepts]: Start accepts. Automaton has has 6 states, 6 states have (on average 5.833333333333333) internal successors, (35), 6 states have internal predecessors, (35), 2 states have call successors, (4), 2 states have call predecessors, (4), 1 states have return successors, (3), 1 states have call predecessors, (3), 1 states have call successors, (3) Word has length 57 [2025-01-08 22:48:48,209 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-01-08 22:48:48,211 INFO L225 Difference]: With dead ends: 1123 [2025-01-08 22:48:48,211 INFO L226 Difference]: Without dead ends: 1093 [2025-01-08 22:48:48,212 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 11 GetRequests, 7 SyntacticMatches, 0 SemanticMatches, 4 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=9, Invalid=21, Unknown=0, NotChecked=0, Total=30 [2025-01-08 22:48:48,212 INFO L435 NwaCegarLoop]: 124 mSDtfsCounter, 48 mSDsluCounter, 417 mSDsCounter, 0 mSdLazyCounter, 131 mSolverCounterSat, 2 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 52 SdHoareTripleChecker+Valid, 541 SdHoareTripleChecker+Invalid, 133 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 2 IncrementalHoareTripleChecker+Valid, 131 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2025-01-08 22:48:48,212 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [52 Valid, 541 Invalid, 133 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [2 Valid, 131 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2025-01-08 22:48:48,215 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1093 states. [2025-01-08 22:48:48,236 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1093 to 832. [2025-01-08 22:48:48,237 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 832 states, 762 states have (on average 1.2808398950131235) internal successors, (976), 771 states have internal predecessors, (976), 60 states have call successors, (60), 6 states have call predecessors, (60), 9 states have return successors, (71), 58 states have call predecessors, (71), 57 states have call successors, (71) [2025-01-08 22:48:48,238 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 832 states to 832 states and 1107 transitions. [2025-01-08 22:48:48,238 INFO L78 Accepts]: Start accepts. Automaton has 832 states and 1107 transitions. Word has length 57 [2025-01-08 22:48:48,238 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-01-08 22:48:48,238 INFO L471 AbstractCegarLoop]: Abstraction has 832 states and 1107 transitions. [2025-01-08 22:48:48,238 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 6 states have (on average 5.833333333333333) internal successors, (35), 6 states have internal predecessors, (35), 2 states have call successors, (4), 2 states have call predecessors, (4), 1 states have return successors, (3), 1 states have call predecessors, (3), 1 states have call successors, (3) [2025-01-08 22:48:48,238 INFO L276 IsEmpty]: Start isEmpty. Operand 832 states and 1107 transitions. [2025-01-08 22:48:48,239 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 61 [2025-01-08 22:48:48,239 INFO L210 NwaCegarLoop]: Found error trace [2025-01-08 22:48:48,239 INFO L218 NwaCegarLoop]: trace histogram [3, 3, 3, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-01-08 22:48:48,239 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable33 [2025-01-08 22:48:48,239 INFO L396 AbstractCegarLoop]: === Iteration 35 === Targeting __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-01-08 22:48:48,240 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-01-08 22:48:48,241 INFO L85 PathProgramCache]: Analyzing trace with hash -1162034121, now seen corresponding path program 1 times [2025-01-08 22:48:48,241 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-01-08 22:48:48,241 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1711740179] [2025-01-08 22:48:48,241 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-01-08 22:48:48,241 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-01-08 22:48:48,245 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 60 statements into 1 equivalence classes. [2025-01-08 22:48:48,247 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 60 of 60 statements. [2025-01-08 22:48:48,247 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-01-08 22:48:48,247 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-01-08 22:48:48,294 INFO L134 CoverageAnalysis]: Checked inductivity of 20 backedges. 2 proven. 0 refuted. 0 times theorem prover too weak. 18 trivial. 0 not checked. [2025-01-08 22:48:48,294 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-01-08 22:48:48,294 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1711740179] [2025-01-08 22:48:48,294 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1711740179] provided 1 perfect and 0 imperfect interpolant sequences [2025-01-08 22:48:48,294 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-01-08 22:48:48,294 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2025-01-08 22:48:48,294 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [486763092] [2025-01-08 22:48:48,294 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-01-08 22:48:48,294 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2025-01-08 22:48:48,294 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-01-08 22:48:48,295 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2025-01-08 22:48:48,295 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2025-01-08 22:48:48,295 INFO L87 Difference]: Start difference. First operand 832 states and 1107 transitions. Second operand has 5 states, 5 states have (on average 8.2) internal successors, (41), 4 states have internal predecessors, (41), 2 states have call successors, (5), 2 states have call predecessors, (5), 1 states have return successors, (4), 1 states have call predecessors, (4), 1 states have call successors, (4) [2025-01-08 22:48:48,360 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-01-08 22:48:48,360 INFO L93 Difference]: Finished difference Result 917 states and 1230 transitions. [2025-01-08 22:48:48,361 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2025-01-08 22:48:48,361 INFO L78 Accepts]: Start accepts. Automaton has has 5 states, 5 states have (on average 8.2) internal successors, (41), 4 states have internal predecessors, (41), 2 states have call successors, (5), 2 states have call predecessors, (5), 1 states have return successors, (4), 1 states have call predecessors, (4), 1 states have call successors, (4) Word has length 60 [2025-01-08 22:48:48,361 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-01-08 22:48:48,363 INFO L225 Difference]: With dead ends: 917 [2025-01-08 22:48:48,363 INFO L226 Difference]: Without dead ends: 912 [2025-01-08 22:48:48,363 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 7 GetRequests, 3 SyntacticMatches, 0 SemanticMatches, 4 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=11, Invalid=19, Unknown=0, NotChecked=0, Total=30 [2025-01-08 22:48:48,363 INFO L435 NwaCegarLoop]: 121 mSDtfsCounter, 10 mSDsluCounter, 340 mSDsCounter, 0 mSdLazyCounter, 59 mSolverCounterSat, 4 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 11 SdHoareTripleChecker+Valid, 461 SdHoareTripleChecker+Invalid, 63 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 4 IncrementalHoareTripleChecker+Valid, 59 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2025-01-08 22:48:48,364 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [11 Valid, 461 Invalid, 63 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [4 Valid, 59 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2025-01-08 22:48:48,364 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 912 states. [2025-01-08 22:48:48,390 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 912 to 881. [2025-01-08 22:48:48,391 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 881 states, 795 states have (on average 1.2968553459119496) internal successors, (1031), 819 states have internal predecessors, (1031), 75 states have call successors, (75), 7 states have call predecessors, (75), 10 states have return successors, (86), 58 states have call predecessors, (86), 72 states have call successors, (86) [2025-01-08 22:48:48,392 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 881 states to 881 states and 1192 transitions. [2025-01-08 22:48:48,392 INFO L78 Accepts]: Start accepts. Automaton has 881 states and 1192 transitions. Word has length 60 [2025-01-08 22:48:48,392 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-01-08 22:48:48,393 INFO L471 AbstractCegarLoop]: Abstraction has 881 states and 1192 transitions. [2025-01-08 22:48:48,393 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 8.2) internal successors, (41), 4 states have internal predecessors, (41), 2 states have call successors, (5), 2 states have call predecessors, (5), 1 states have return successors, (4), 1 states have call predecessors, (4), 1 states have call successors, (4) [2025-01-08 22:48:48,393 INFO L276 IsEmpty]: Start isEmpty. Operand 881 states and 1192 transitions. [2025-01-08 22:48:48,394 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 62 [2025-01-08 22:48:48,394 INFO L210 NwaCegarLoop]: Found error trace [2025-01-08 22:48:48,394 INFO L218 NwaCegarLoop]: trace histogram [3, 3, 3, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-01-08 22:48:48,394 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable34 [2025-01-08 22:48:48,395 INFO L396 AbstractCegarLoop]: === Iteration 36 === Targeting __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-01-08 22:48:48,395 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-01-08 22:48:48,395 INFO L85 PathProgramCache]: Analyzing trace with hash -412308554, now seen corresponding path program 1 times [2025-01-08 22:48:48,395 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-01-08 22:48:48,395 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1098215191] [2025-01-08 22:48:48,395 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-01-08 22:48:48,395 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-01-08 22:48:48,398 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 61 statements into 1 equivalence classes. [2025-01-08 22:48:48,415 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 61 of 61 statements. [2025-01-08 22:48:48,415 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-01-08 22:48:48,415 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-01-08 22:48:48,572 INFO L134 CoverageAnalysis]: Checked inductivity of 20 backedges. 5 proven. 3 refuted. 0 times theorem prover too weak. 12 trivial. 0 not checked. [2025-01-08 22:48:48,572 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-01-08 22:48:48,572 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1098215191] [2025-01-08 22:48:48,572 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1098215191] provided 0 perfect and 1 imperfect interpolant sequences [2025-01-08 22:48:48,572 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [505696955] [2025-01-08 22:48:48,572 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-01-08 22:48:48,573 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-01-08 22:48:48,573 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 [2025-01-08 22:48:48,574 INFO L229 MonitoredProcess]: Starting monitored process 15 with /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2025-01-08 22:48:48,576 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (15)] Waiting until timeout for monitored process [2025-01-08 22:48:48,607 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 61 statements into 1 equivalence classes. [2025-01-08 22:48:48,620 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 61 of 61 statements. [2025-01-08 22:48:48,620 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-01-08 22:48:48,620 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-01-08 22:48:48,621 INFO L256 TraceCheckSpWp]: Trace formula consists of 171 conjuncts, 10 conjuncts are in the unsatisfiable core [2025-01-08 22:48:48,622 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-01-08 22:48:48,678 INFO L134 CoverageAnalysis]: Checked inductivity of 20 backedges. 2 proven. 0 refuted. 0 times theorem prover too weak. 18 trivial. 0 not checked. [2025-01-08 22:48:48,678 INFO L308 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2025-01-08 22:48:48,678 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [505696955] provided 1 perfect and 0 imperfect interpolant sequences [2025-01-08 22:48:48,678 INFO L185 FreeRefinementEngine]: Found 1 perfect and 1 imperfect interpolant sequences. [2025-01-08 22:48:48,678 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [8] total 12 [2025-01-08 22:48:48,678 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1698180708] [2025-01-08 22:48:48,678 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-01-08 22:48:48,678 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2025-01-08 22:48:48,678 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-01-08 22:48:48,679 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2025-01-08 22:48:48,679 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=23, Invalid=109, Unknown=0, NotChecked=0, Total=132 [2025-01-08 22:48:48,679 INFO L87 Difference]: Start difference. First operand 881 states and 1192 transitions. Second operand has 6 states, 6 states have (on average 7.0) internal successors, (42), 6 states have internal predecessors, (42), 3 states have call successors, (5), 2 states have call predecessors, (5), 1 states have return successors, (4), 2 states have call predecessors, (4), 2 states have call successors, (4) [2025-01-08 22:48:48,764 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-01-08 22:48:48,764 INFO L93 Difference]: Finished difference Result 1388 states and 1853 transitions. [2025-01-08 22:48:48,765 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2025-01-08 22:48:48,766 INFO L78 Accepts]: Start accepts. Automaton has has 6 states, 6 states have (on average 7.0) internal successors, (42), 6 states have internal predecessors, (42), 3 states have call successors, (5), 2 states have call predecessors, (5), 1 states have return successors, (4), 2 states have call predecessors, (4), 2 states have call successors, (4) Word has length 61 [2025-01-08 22:48:48,768 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-01-08 22:48:48,770 INFO L225 Difference]: With dead ends: 1388 [2025-01-08 22:48:48,770 INFO L226 Difference]: Without dead ends: 1164 [2025-01-08 22:48:48,771 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 71 GetRequests, 59 SyntacticMatches, 1 SemanticMatches, 11 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=27, Invalid=129, Unknown=0, NotChecked=0, Total=156 [2025-01-08 22:48:48,771 INFO L435 NwaCegarLoop]: 124 mSDtfsCounter, 15 mSDsluCounter, 460 mSDsCounter, 0 mSdLazyCounter, 78 mSolverCounterSat, 2 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 16 SdHoareTripleChecker+Valid, 584 SdHoareTripleChecker+Invalid, 80 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 2 IncrementalHoareTripleChecker+Valid, 78 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2025-01-08 22:48:48,771 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [16 Valid, 584 Invalid, 80 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [2 Valid, 78 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2025-01-08 22:48:48,772 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1164 states. [2025-01-08 22:48:48,802 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1164 to 897. [2025-01-08 22:48:48,803 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 897 states, 811 states have (on average 1.2909987669543772) internal successors, (1047), 835 states have internal predecessors, (1047), 75 states have call successors, (75), 7 states have call predecessors, (75), 10 states have return successors, (86), 58 states have call predecessors, (86), 72 states have call successors, (86) [2025-01-08 22:48:48,805 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 897 states to 897 states and 1208 transitions. [2025-01-08 22:48:48,806 INFO L78 Accepts]: Start accepts. Automaton has 897 states and 1208 transitions. Word has length 61 [2025-01-08 22:48:48,806 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-01-08 22:48:48,806 INFO L471 AbstractCegarLoop]: Abstraction has 897 states and 1208 transitions. [2025-01-08 22:48:48,806 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 6 states have (on average 7.0) internal successors, (42), 6 states have internal predecessors, (42), 3 states have call successors, (5), 2 states have call predecessors, (5), 1 states have return successors, (4), 2 states have call predecessors, (4), 2 states have call successors, (4) [2025-01-08 22:48:48,806 INFO L276 IsEmpty]: Start isEmpty. Operand 897 states and 1208 transitions. [2025-01-08 22:48:48,807 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 63 [2025-01-08 22:48:48,807 INFO L210 NwaCegarLoop]: Found error trace [2025-01-08 22:48:48,807 INFO L218 NwaCegarLoop]: trace histogram [3, 3, 3, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-01-08 22:48:48,813 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (15)] Forceful destruction successful, exit code 0 [2025-01-08 22:48:49,008 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 15 /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable35 [2025-01-08 22:48:49,008 INFO L396 AbstractCegarLoop]: === Iteration 37 === Targeting __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-01-08 22:48:49,008 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-01-08 22:48:49,008 INFO L85 PathProgramCache]: Analyzing trace with hash -222102804, now seen corresponding path program 1 times [2025-01-08 22:48:49,008 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-01-08 22:48:49,008 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [169744618] [2025-01-08 22:48:49,008 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-01-08 22:48:49,008 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-01-08 22:48:49,015 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 62 statements into 1 equivalence classes. [2025-01-08 22:48:49,020 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 62 of 62 statements. [2025-01-08 22:48:49,020 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-01-08 22:48:49,020 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-01-08 22:48:49,084 INFO L134 CoverageAnalysis]: Checked inductivity of 20 backedges. 2 proven. 0 refuted. 0 times theorem prover too weak. 18 trivial. 0 not checked. [2025-01-08 22:48:49,084 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-01-08 22:48:49,084 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [169744618] [2025-01-08 22:48:49,084 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [169744618] provided 1 perfect and 0 imperfect interpolant sequences [2025-01-08 22:48:49,084 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-01-08 22:48:49,084 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2025-01-08 22:48:49,084 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [806379053] [2025-01-08 22:48:49,085 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-01-08 22:48:49,085 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2025-01-08 22:48:49,085 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-01-08 22:48:49,086 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2025-01-08 22:48:49,086 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=9, Invalid=21, Unknown=0, NotChecked=0, Total=30 [2025-01-08 22:48:49,086 INFO L87 Difference]: Start difference. First operand 897 states and 1208 transitions. Second operand has 6 states, 5 states have (on average 8.6) internal successors, (43), 5 states have internal predecessors, (43), 2 states have call successors, (5), 2 states have call predecessors, (5), 1 states have return successors, (4), 1 states have call predecessors, (4), 1 states have call successors, (4) [2025-01-08 22:48:49,163 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-01-08 22:48:49,163 INFO L93 Difference]: Finished difference Result 966 states and 1299 transitions. [2025-01-08 22:48:49,164 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2025-01-08 22:48:49,164 INFO L78 Accepts]: Start accepts. Automaton has has 6 states, 5 states have (on average 8.6) internal successors, (43), 5 states have internal predecessors, (43), 2 states have call successors, (5), 2 states have call predecessors, (5), 1 states have return successors, (4), 1 states have call predecessors, (4), 1 states have call successors, (4) Word has length 62 [2025-01-08 22:48:49,164 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-01-08 22:48:49,166 INFO L225 Difference]: With dead ends: 966 [2025-01-08 22:48:49,166 INFO L226 Difference]: Without dead ends: 961 [2025-01-08 22:48:49,166 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 7 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 5 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=13, Invalid=29, Unknown=0, NotChecked=0, Total=42 [2025-01-08 22:48:49,166 INFO L435 NwaCegarLoop]: 127 mSDtfsCounter, 9 mSDsluCounter, 466 mSDsCounter, 0 mSdLazyCounter, 84 mSolverCounterSat, 2 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 10 SdHoareTripleChecker+Valid, 593 SdHoareTripleChecker+Invalid, 86 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 2 IncrementalHoareTripleChecker+Valid, 84 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2025-01-08 22:48:49,167 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [10 Valid, 593 Invalid, 86 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [2 Valid, 84 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2025-01-08 22:48:49,167 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 961 states. [2025-01-08 22:48:49,201 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 961 to 896. [2025-01-08 22:48:49,202 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 896 states, 810 states have (on average 1.2901234567901234) internal successors, (1045), 834 states have internal predecessors, (1045), 75 states have call successors, (75), 7 states have call predecessors, (75), 10 states have return successors, (86), 58 states have call predecessors, (86), 72 states have call successors, (86) [2025-01-08 22:48:49,203 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 896 states to 896 states and 1206 transitions. [2025-01-08 22:48:49,204 INFO L78 Accepts]: Start accepts. Automaton has 896 states and 1206 transitions. Word has length 62 [2025-01-08 22:48:49,204 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-01-08 22:48:49,204 INFO L471 AbstractCegarLoop]: Abstraction has 896 states and 1206 transitions. [2025-01-08 22:48:49,204 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 5 states have (on average 8.6) internal successors, (43), 5 states have internal predecessors, (43), 2 states have call successors, (5), 2 states have call predecessors, (5), 1 states have return successors, (4), 1 states have call predecessors, (4), 1 states have call successors, (4) [2025-01-08 22:48:49,204 INFO L276 IsEmpty]: Start isEmpty. Operand 896 states and 1206 transitions. [2025-01-08 22:48:49,206 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 63 [2025-01-08 22:48:49,206 INFO L210 NwaCegarLoop]: Found error trace [2025-01-08 22:48:49,206 INFO L218 NwaCegarLoop]: trace histogram [3, 3, 3, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-01-08 22:48:49,206 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable36 [2025-01-08 22:48:49,207 INFO L396 AbstractCegarLoop]: === Iteration 38 === Targeting __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-01-08 22:48:49,207 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-01-08 22:48:49,207 INFO L85 PathProgramCache]: Analyzing trace with hash 1440234996, now seen corresponding path program 1 times [2025-01-08 22:48:49,207 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-01-08 22:48:49,207 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1398507051] [2025-01-08 22:48:49,207 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-01-08 22:48:49,207 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-01-08 22:48:49,213 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 62 statements into 1 equivalence classes. [2025-01-08 22:48:49,227 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 62 of 62 statements. [2025-01-08 22:48:49,227 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-01-08 22:48:49,227 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-01-08 22:48:49,342 INFO L134 CoverageAnalysis]: Checked inductivity of 20 backedges. 5 proven. 3 refuted. 0 times theorem prover too weak. 12 trivial. 0 not checked. [2025-01-08 22:48:49,342 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-01-08 22:48:49,342 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1398507051] [2025-01-08 22:48:49,342 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1398507051] provided 0 perfect and 1 imperfect interpolant sequences [2025-01-08 22:48:49,342 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [737942438] [2025-01-08 22:48:49,342 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-01-08 22:48:49,343 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-01-08 22:48:49,343 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 [2025-01-08 22:48:49,349 INFO L229 MonitoredProcess]: Starting monitored process 16 with /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2025-01-08 22:48:49,357 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (16)] Waiting until timeout for monitored process [2025-01-08 22:48:49,389 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 62 statements into 1 equivalence classes. [2025-01-08 22:48:49,405 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 62 of 62 statements. [2025-01-08 22:48:49,406 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-01-08 22:48:49,406 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-01-08 22:48:49,407 INFO L256 TraceCheckSpWp]: Trace formula consists of 170 conjuncts, 31 conjuncts are in the unsatisfiable core [2025-01-08 22:48:49,408 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-01-08 22:48:49,470 INFO L134 CoverageAnalysis]: Checked inductivity of 20 backedges. 6 proven. 0 refuted. 0 times theorem prover too weak. 14 trivial. 0 not checked. [2025-01-08 22:48:49,470 INFO L308 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2025-01-08 22:48:49,470 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [737942438] provided 1 perfect and 0 imperfect interpolant sequences [2025-01-08 22:48:49,470 INFO L185 FreeRefinementEngine]: Found 1 perfect and 1 imperfect interpolant sequences. [2025-01-08 22:48:49,470 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [10] imperfect sequences [8] total 12 [2025-01-08 22:48:49,471 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1066921040] [2025-01-08 22:48:49,471 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-01-08 22:48:49,471 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 10 states [2025-01-08 22:48:49,471 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-01-08 22:48:49,471 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 10 interpolants. [2025-01-08 22:48:49,471 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=25, Invalid=107, Unknown=0, NotChecked=0, Total=132 [2025-01-08 22:48:49,471 INFO L87 Difference]: Start difference. First operand 896 states and 1206 transitions. Second operand has 10 states, 9 states have (on average 4.888888888888889) internal successors, (44), 8 states have internal predecessors, (44), 3 states have call successors, (5), 2 states have call predecessors, (5), 3 states have return successors, (4), 4 states have call predecessors, (4), 3 states have call successors, (4) [2025-01-08 22:48:49,653 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-01-08 22:48:49,654 INFO L93 Difference]: Finished difference Result 1115 states and 1487 transitions. [2025-01-08 22:48:49,654 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 10 states. [2025-01-08 22:48:49,654 INFO L78 Accepts]: Start accepts. Automaton has has 10 states, 9 states have (on average 4.888888888888889) internal successors, (44), 8 states have internal predecessors, (44), 3 states have call successors, (5), 2 states have call predecessors, (5), 3 states have return successors, (4), 4 states have call predecessors, (4), 3 states have call successors, (4) Word has length 62 [2025-01-08 22:48:49,654 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-01-08 22:48:49,656 INFO L225 Difference]: With dead ends: 1115 [2025-01-08 22:48:49,657 INFO L226 Difference]: Without dead ends: 976 [2025-01-08 22:48:49,657 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 71 GetRequests, 59 SyntacticMatches, 0 SemanticMatches, 12 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 6 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=40, Invalid=142, Unknown=0, NotChecked=0, Total=182 [2025-01-08 22:48:49,658 INFO L435 NwaCegarLoop]: 109 mSDtfsCounter, 180 mSDsluCounter, 783 mSDsCounter, 0 mSdLazyCounter, 226 mSolverCounterSat, 4 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 189 SdHoareTripleChecker+Valid, 892 SdHoareTripleChecker+Invalid, 230 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 4 IncrementalHoareTripleChecker+Valid, 226 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2025-01-08 22:48:49,658 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [189 Valid, 892 Invalid, 230 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [4 Valid, 226 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2025-01-08 22:48:49,658 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 976 states. [2025-01-08 22:48:49,686 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 976 to 896. [2025-01-08 22:48:49,687 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 896 states, 810 states have (on average 1.2864197530864196) internal successors, (1042), 834 states have internal predecessors, (1042), 75 states have call successors, (75), 7 states have call predecessors, (75), 10 states have return successors, (86), 58 states have call predecessors, (86), 72 states have call successors, (86) [2025-01-08 22:48:49,688 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 896 states to 896 states and 1203 transitions. [2025-01-08 22:48:49,689 INFO L78 Accepts]: Start accepts. Automaton has 896 states and 1203 transitions. Word has length 62 [2025-01-08 22:48:49,689 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-01-08 22:48:49,689 INFO L471 AbstractCegarLoop]: Abstraction has 896 states and 1203 transitions. [2025-01-08 22:48:49,689 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 10 states, 9 states have (on average 4.888888888888889) internal successors, (44), 8 states have internal predecessors, (44), 3 states have call successors, (5), 2 states have call predecessors, (5), 3 states have return successors, (4), 4 states have call predecessors, (4), 3 states have call successors, (4) [2025-01-08 22:48:49,689 INFO L276 IsEmpty]: Start isEmpty. Operand 896 states and 1203 transitions. [2025-01-08 22:48:49,690 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 63 [2025-01-08 22:48:49,691 INFO L210 NwaCegarLoop]: Found error trace [2025-01-08 22:48:49,691 INFO L218 NwaCegarLoop]: trace histogram [3, 3, 3, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-01-08 22:48:49,698 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (16)] Ended with exit code 0 [2025-01-08 22:48:49,895 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 16 /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable37 [2025-01-08 22:48:49,895 INFO L396 AbstractCegarLoop]: === Iteration 39 === Targeting __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-01-08 22:48:49,895 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-01-08 22:48:49,895 INFO L85 PathProgramCache]: Analyzing trace with hash 138506821, now seen corresponding path program 1 times [2025-01-08 22:48:49,895 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-01-08 22:48:49,895 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1433095230] [2025-01-08 22:48:49,895 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-01-08 22:48:49,895 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-01-08 22:48:49,900 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 62 statements into 1 equivalence classes. [2025-01-08 22:48:49,902 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 62 of 62 statements. [2025-01-08 22:48:49,903 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-01-08 22:48:49,903 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-01-08 22:48:49,944 INFO L134 CoverageAnalysis]: Checked inductivity of 19 backedges. 2 proven. 0 refuted. 0 times theorem prover too weak. 17 trivial. 0 not checked. [2025-01-08 22:48:49,944 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-01-08 22:48:49,944 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1433095230] [2025-01-08 22:48:49,944 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1433095230] provided 1 perfect and 0 imperfect interpolant sequences [2025-01-08 22:48:49,945 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-01-08 22:48:49,945 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2025-01-08 22:48:49,945 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [497933081] [2025-01-08 22:48:49,945 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-01-08 22:48:49,948 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2025-01-08 22:48:49,949 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-01-08 22:48:49,949 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2025-01-08 22:48:49,949 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=9, Invalid=21, Unknown=0, NotChecked=0, Total=30 [2025-01-08 22:48:49,949 INFO L87 Difference]: Start difference. First operand 896 states and 1203 transitions. Second operand has 6 states, 5 states have (on average 9.0) internal successors, (45), 5 states have internal predecessors, (45), 2 states have call successors, (5), 2 states have call predecessors, (5), 1 states have return successors, (4), 1 states have call predecessors, (4), 1 states have call successors, (4) [2025-01-08 22:48:50,017 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-01-08 22:48:50,017 INFO L93 Difference]: Finished difference Result 934 states and 1247 transitions. [2025-01-08 22:48:50,017 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2025-01-08 22:48:50,018 INFO L78 Accepts]: Start accepts. Automaton has has 6 states, 5 states have (on average 9.0) internal successors, (45), 5 states have internal predecessors, (45), 2 states have call successors, (5), 2 states have call predecessors, (5), 1 states have return successors, (4), 1 states have call predecessors, (4), 1 states have call successors, (4) Word has length 62 [2025-01-08 22:48:50,018 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-01-08 22:48:50,019 INFO L225 Difference]: With dead ends: 934 [2025-01-08 22:48:50,020 INFO L226 Difference]: Without dead ends: 912 [2025-01-08 22:48:50,020 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 7 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 5 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=13, Invalid=29, Unknown=0, NotChecked=0, Total=42 [2025-01-08 22:48:50,020 INFO L435 NwaCegarLoop]: 141 mSDtfsCounter, 15 mSDsluCounter, 536 mSDsCounter, 0 mSdLazyCounter, 30 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 16 SdHoareTripleChecker+Valid, 677 SdHoareTripleChecker+Invalid, 30 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 30 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2025-01-08 22:48:50,020 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [16 Valid, 677 Invalid, 30 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 30 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2025-01-08 22:48:50,021 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 912 states. [2025-01-08 22:48:50,049 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 912 to 888. [2025-01-08 22:48:50,050 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 888 states, 799 states have (on average 1.2778473091364204) internal successors, (1021), 826 states have internal predecessors, (1021), 77 states have call successors, (77), 8 states have call predecessors, (77), 11 states have return successors, (87), 57 states have call predecessors, (87), 73 states have call successors, (87) [2025-01-08 22:48:50,051 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 888 states to 888 states and 1185 transitions. [2025-01-08 22:48:50,052 INFO L78 Accepts]: Start accepts. Automaton has 888 states and 1185 transitions. Word has length 62 [2025-01-08 22:48:50,052 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-01-08 22:48:50,052 INFO L471 AbstractCegarLoop]: Abstraction has 888 states and 1185 transitions. [2025-01-08 22:48:50,052 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 5 states have (on average 9.0) internal successors, (45), 5 states have internal predecessors, (45), 2 states have call successors, (5), 2 states have call predecessors, (5), 1 states have return successors, (4), 1 states have call predecessors, (4), 1 states have call successors, (4) [2025-01-08 22:48:50,052 INFO L276 IsEmpty]: Start isEmpty. Operand 888 states and 1185 transitions. [2025-01-08 22:48:50,053 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 63 [2025-01-08 22:48:50,053 INFO L210 NwaCegarLoop]: Found error trace [2025-01-08 22:48:50,053 INFO L218 NwaCegarLoop]: trace histogram [3, 3, 3, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-01-08 22:48:50,053 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable38 [2025-01-08 22:48:50,053 INFO L396 AbstractCegarLoop]: === Iteration 40 === Targeting __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-01-08 22:48:50,054 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-01-08 22:48:50,054 INFO L85 PathProgramCache]: Analyzing trace with hash 81248519, now seen corresponding path program 1 times [2025-01-08 22:48:50,054 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-01-08 22:48:50,054 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [180558104] [2025-01-08 22:48:50,054 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-01-08 22:48:50,054 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-01-08 22:48:50,057 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 62 statements into 1 equivalence classes. [2025-01-08 22:48:50,059 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 62 of 62 statements. [2025-01-08 22:48:50,059 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-01-08 22:48:50,059 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-01-08 22:48:50,098 INFO L134 CoverageAnalysis]: Checked inductivity of 19 backedges. 2 proven. 0 refuted. 0 times theorem prover too weak. 17 trivial. 0 not checked. [2025-01-08 22:48:50,098 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-01-08 22:48:50,098 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [180558104] [2025-01-08 22:48:50,098 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [180558104] provided 1 perfect and 0 imperfect interpolant sequences [2025-01-08 22:48:50,098 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-01-08 22:48:50,098 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2025-01-08 22:48:50,098 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1501964914] [2025-01-08 22:48:50,098 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-01-08 22:48:50,099 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2025-01-08 22:48:50,099 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-01-08 22:48:50,099 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2025-01-08 22:48:50,099 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=9, Invalid=21, Unknown=0, NotChecked=0, Total=30 [2025-01-08 22:48:50,099 INFO L87 Difference]: Start difference. First operand 888 states and 1185 transitions. Second operand has 6 states, 5 states have (on average 9.0) internal successors, (45), 5 states have internal predecessors, (45), 2 states have call successors, (5), 2 states have call predecessors, (5), 1 states have return successors, (4), 1 states have call predecessors, (4), 1 states have call successors, (4) [2025-01-08 22:48:50,146 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-01-08 22:48:50,146 INFO L93 Difference]: Finished difference Result 909 states and 1207 transitions. [2025-01-08 22:48:50,146 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2025-01-08 22:48:50,147 INFO L78 Accepts]: Start accepts. Automaton has has 6 states, 5 states have (on average 9.0) internal successors, (45), 5 states have internal predecessors, (45), 2 states have call successors, (5), 2 states have call predecessors, (5), 1 states have return successors, (4), 1 states have call predecessors, (4), 1 states have call successors, (4) Word has length 62 [2025-01-08 22:48:50,147 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-01-08 22:48:50,148 INFO L225 Difference]: With dead ends: 909 [2025-01-08 22:48:50,149 INFO L226 Difference]: Without dead ends: 895 [2025-01-08 22:48:50,149 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 7 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 5 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=13, Invalid=29, Unknown=0, NotChecked=0, Total=42 [2025-01-08 22:48:50,149 INFO L435 NwaCegarLoop]: 143 mSDtfsCounter, 15 mSDsluCounter, 541 mSDsCounter, 0 mSdLazyCounter, 31 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 16 SdHoareTripleChecker+Valid, 684 SdHoareTripleChecker+Invalid, 31 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 31 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2025-01-08 22:48:50,150 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [16 Valid, 684 Invalid, 31 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 31 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2025-01-08 22:48:50,150 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 895 states. [2025-01-08 22:48:50,175 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 895 to 872. [2025-01-08 22:48:50,176 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 872 states, 784 states have (on average 1.2767857142857142) internal successors, (1001), 811 states have internal predecessors, (1001), 75 states have call successors, (75), 9 states have call predecessors, (75), 12 states have return successors, (85), 55 states have call predecessors, (85), 71 states have call successors, (85) [2025-01-08 22:48:50,177 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 872 states to 872 states and 1161 transitions. [2025-01-08 22:48:50,177 INFO L78 Accepts]: Start accepts. Automaton has 872 states and 1161 transitions. Word has length 62 [2025-01-08 22:48:50,178 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-01-08 22:48:50,178 INFO L471 AbstractCegarLoop]: Abstraction has 872 states and 1161 transitions. [2025-01-08 22:48:50,178 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 5 states have (on average 9.0) internal successors, (45), 5 states have internal predecessors, (45), 2 states have call successors, (5), 2 states have call predecessors, (5), 1 states have return successors, (4), 1 states have call predecessors, (4), 1 states have call successors, (4) [2025-01-08 22:48:50,178 INFO L276 IsEmpty]: Start isEmpty. Operand 872 states and 1161 transitions. [2025-01-08 22:48:50,179 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 65 [2025-01-08 22:48:50,179 INFO L210 NwaCegarLoop]: Found error trace [2025-01-08 22:48:50,179 INFO L218 NwaCegarLoop]: trace histogram [3, 3, 3, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-01-08 22:48:50,179 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable39 [2025-01-08 22:48:50,179 INFO L396 AbstractCegarLoop]: === Iteration 41 === Targeting __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-01-08 22:48:50,179 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-01-08 22:48:50,180 INFO L85 PathProgramCache]: Analyzing trace with hash 659011537, now seen corresponding path program 1 times [2025-01-08 22:48:50,180 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-01-08 22:48:50,180 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1536641465] [2025-01-08 22:48:50,180 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-01-08 22:48:50,180 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-01-08 22:48:50,183 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 64 statements into 1 equivalence classes. [2025-01-08 22:48:50,194 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 64 of 64 statements. [2025-01-08 22:48:50,194 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-01-08 22:48:50,194 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is sat [2025-01-08 22:48:50,194 INFO L348 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2025-01-08 22:48:50,196 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 64 statements into 1 equivalence classes. [2025-01-08 22:48:50,206 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 64 of 64 statements. [2025-01-08 22:48:50,206 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-01-08 22:48:50,206 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is sat [2025-01-08 22:48:50,224 INFO L130 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2025-01-08 22:48:50,224 INFO L340 BasicCegarLoop]: Counterexample is feasible [2025-01-08 22:48:50,226 INFO L782 garLoopResultBuilder]: Registering result UNSAFE for location __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION (0 of 1 remaining) [2025-01-08 22:48:50,228 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable40 [2025-01-08 22:48:50,229 INFO L422 BasicCegarLoop]: Path program 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] [2025-01-08 22:48:50,261 INFO L170 ceAbstractionStarter]: Computing trace abstraction results [2025-01-08 22:48:50,265 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction CFG 08.01 10:48:50 BoogieIcfgContainer [2025-01-08 22:48:50,265 INFO L131 PluginConnector]: ------------------------ END TraceAbstraction---------------------------- [2025-01-08 22:48:50,267 INFO L112 PluginConnector]: ------------------------Witness Printer---------------------------- [2025-01-08 22:48:50,267 INFO L270 PluginConnector]: Initializing Witness Printer... [2025-01-08 22:48:50,267 INFO L274 PluginConnector]: Witness Printer initialized [2025-01-08 22:48:50,267 INFO L184 PluginConnector]: Executing the observer RCFGCatcher from plugin Witness Printer for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 08.01 10:48:32" (3/4) ... [2025-01-08 22:48:50,269 INFO L149 WitnessPrinter]: No result that supports witness generation found [2025-01-08 22:48:50,269 INFO L131 PluginConnector]: ------------------------ END Witness Printer---------------------------- [2025-01-08 22:48:50,270 INFO L158 Benchmark]: Toolchain (without parser) took 18359.84ms. Allocated memory was 142.6MB in the beginning and 394.3MB in the end (delta: 251.7MB). Free memory was 106.5MB in the beginning and 185.4MB in the end (delta: -78.8MB). Peak memory consumption was 172.5MB. Max. memory is 16.1GB. [2025-01-08 22:48:50,270 INFO L158 Benchmark]: CDTParser took 0.15ms. Allocated memory is still 201.3MB. Free memory is still 125.8MB. There was no memory consumed. Max. memory is 16.1GB. [2025-01-08 22:48:50,270 INFO L158 Benchmark]: CACSL2BoogieTranslator took 225.33ms. Allocated memory is still 142.6MB. Free memory was 106.1MB in the beginning and 92.1MB in the end (delta: 14.0MB). Peak memory consumption was 16.8MB. Max. memory is 16.1GB. [2025-01-08 22:48:50,270 INFO L158 Benchmark]: Boogie Procedure Inliner took 33.18ms. Allocated memory is still 142.6MB. Free memory was 92.1MB in the beginning and 90.5MB in the end (delta: 1.6MB). There was no memory consumed. Max. memory is 16.1GB. [2025-01-08 22:48:50,270 INFO L158 Benchmark]: Boogie Preprocessor took 38.41ms. Allocated memory is still 142.6MB. Free memory was 90.5MB in the beginning and 88.4MB in the end (delta: 2.1MB). There was no memory consumed. Max. memory is 16.1GB. [2025-01-08 22:48:50,270 INFO L158 Benchmark]: RCFGBuilder took 337.19ms. Allocated memory is still 142.6MB. Free memory was 88.4MB in the beginning and 65.8MB in the end (delta: 22.7MB). Peak memory consumption was 25.2MB. Max. memory is 16.1GB. [2025-01-08 22:48:50,270 INFO L158 Benchmark]: TraceAbstraction took 17717.88ms. Allocated memory was 142.6MB in the beginning and 394.3MB in the end (delta: 251.7MB). Free memory was 65.4MB in the beginning and 185.5MB in the end (delta: -120.1MB). Peak memory consumption was 130.5MB. Max. memory is 16.1GB. [2025-01-08 22:48:50,270 INFO L158 Benchmark]: Witness Printer took 2.67ms. Allocated memory is still 394.3MB. Free memory was 185.5MB in the beginning and 185.4MB in the end (delta: 124.7kB). There was no memory consumed. Max. memory is 16.1GB. [2025-01-08 22:48:50,271 INFO L338 ainManager$Toolchain]: ####################### End [Toolchain 1] ####################### --- Results --- * Results from de.uni_freiburg.informatik.ultimate.core: - StatisticsResult: Toolchain Benchmarks Benchmark results are: * CDTParser took 0.15ms. Allocated memory is still 201.3MB. Free memory is still 125.8MB. There was no memory consumed. Max. memory is 16.1GB. * CACSL2BoogieTranslator took 225.33ms. Allocated memory is still 142.6MB. Free memory was 106.1MB in the beginning and 92.1MB in the end (delta: 14.0MB). Peak memory consumption was 16.8MB. Max. memory is 16.1GB. * Boogie Procedure Inliner took 33.18ms. Allocated memory is still 142.6MB. Free memory was 92.1MB in the beginning and 90.5MB in the end (delta: 1.6MB). There was no memory consumed. Max. memory is 16.1GB. * Boogie Preprocessor took 38.41ms. Allocated memory is still 142.6MB. Free memory was 90.5MB in the beginning and 88.4MB in the end (delta: 2.1MB). There was no memory consumed. Max. memory is 16.1GB. * RCFGBuilder took 337.19ms. Allocated memory is still 142.6MB. Free memory was 88.4MB in the beginning and 65.8MB in the end (delta: 22.7MB). Peak memory consumption was 25.2MB. Max. memory is 16.1GB. * TraceAbstraction took 17717.88ms. Allocated memory was 142.6MB in the beginning and 394.3MB in the end (delta: 251.7MB). Free memory was 65.4MB in the beginning and 185.5MB in the end (delta: -120.1MB). Peak memory consumption was 130.5MB. Max. memory is 16.1GB. * Witness Printer took 2.67ms. Allocated memory is still 394.3MB. Free memory was 185.5MB in the beginning and 185.4MB in the end (delta: 124.7kB). There was no memory consumed. Max. memory is 16.1GB. * Results from de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction: - StatisticsResult: ErrorAutomatonStatistics NumberErrorTraces: 0, NumberStatementsAllTraces: 0, NumberRelevantStatements: 0, 0.0s ErrorAutomatonConstructionTimeTotal, 0.0s FaulLocalizationTime, NumberStatementsFirstTrace: -1, TraceLengthAvg: 0, 0.0s ErrorAutomatonConstructionTimeAvg, 0.0s ErrorAutomatonDifferenceTimeAvg, 0.0s ErrorAutomatonDifferenceTimeTotal, NumberOfNoEnhancement: 0, NumberOfFiniteEnhancement: 0, NumberOfInfiniteEnhancement: 0 - UnprovableResult [Line: 18]: Unable to prove that a call to reach_error is unreachable Unable to prove that a call to reach_error is unreachable Reason: overapproximation of bitwiseOr at line 111, overapproximation of bitwiseOr at line 114, overapproximation of bitwiseAnd at line 127. Possible FailurePath: [L227] unsigned int a ; [L228] unsigned int ma = __VERIFIER_nondet_uint(); [L229] signed char ea = __VERIFIER_nondet_char(); [L230] unsigned int b ; [L231] unsigned int mb = __VERIFIER_nondet_uint(); [L232] signed char eb = __VERIFIER_nondet_char(); [L233] unsigned int r_add ; [L234] unsigned int zero ; [L235] int sa ; [L236] int sb ; [L237] int tmp ; [L238] int tmp___0 ; [L239] int tmp___1 ; [L240] int tmp___2 ; [L241] int tmp___3 ; [L242] int tmp___4 ; [L243] int tmp___5 ; [L244] int tmp___6 ; [L245] int tmp___7 ; [L246] int tmp___8 ; [L247] int tmp___9 ; [L248] int __retres23 ; VAL [ea=127, eb=127] [L252] CALL, EXPR base2flt(0, 0) VAL [\old(e)=0, \old(m)=0] [L26] unsigned int res ; [L27] unsigned int __retres4 ; VAL [\old(e)=0, \old(m)=0, e=0, m=0] [L30] COND TRUE ! m [L31] __retres4 = 0U VAL [\old(e)=0, \old(m)=0, __retres4=0, e=0] [L81] return (__retres4); VAL [\old(e)=0, \old(m)=0, \result=0, e=0] [L252] RET, EXPR base2flt(0, 0) VAL [ea=127, eb=127] [L252] zero = base2flt(0, 0) [L253] CALL, EXPR base2flt(ma, ea) VAL [\old(e)=127, \old(m)=4328521728] [L26] unsigned int res ; [L27] unsigned int __retres4 ; VAL [\old(e)=127, \old(m)=4328521728, e=127, m=4328521728] [L30] COND FALSE !(! m) VAL [\old(e)=127, \old(m)=4328521728, e=127, m=4328521728] [L36] COND FALSE !(m < 1U << 24U) VAL [\old(e)=127, \old(m)=4328521728, e=127, m=4328521728] [L60] COND TRUE m >= 1U << 25U VAL [\old(e)=127, \old(m)=4328521728, e=127, m=4328521728] [L65] COND TRUE e >= 127 [L66] __retres4 = 4294967295U VAL [\old(e)=127, \old(m)=4328521728, __retres4=4294967295, m=4328521728] [L81] return (__retres4); VAL [\old(e)=127, \old(m)=4328521728, \result=4294967295, m=4328521728] [L253] RET, EXPR base2flt(ma, ea) VAL [ea=127, eb=127, ma=4328521728, zero=0] [L253] a = base2flt(ma, ea) [L254] CALL, EXPR base2flt(mb, eb) VAL [\old(e)=127, \old(m)=33554432] [L26] unsigned int res ; [L27] unsigned int __retres4 ; VAL [\old(e)=127, \old(m)=33554432, e=127, m=33554432] [L30] COND FALSE !(! m) VAL [\old(e)=127, \old(m)=33554432, e=127, m=33554432] [L36] COND FALSE !(m < 1U << 24U) VAL [\old(e)=127, \old(m)=33554432, e=127, m=33554432] [L60] COND TRUE m >= 1U << 25U VAL [\old(e)=127, \old(m)=33554432, e=127, m=33554432] [L65] COND TRUE e >= 127 [L66] __retres4 = 4294967295U VAL [\old(e)=127, \old(m)=33554432, __retres4=4294967295, m=33554432] [L81] return (__retres4); VAL [\old(e)=127, \old(m)=33554432, \result=4294967295, m=33554432] [L254] RET, EXPR base2flt(mb, eb) VAL [a=4294967295, ea=127, eb=127, ma=4328521728, mb=33554432, zero=0] [L254] b = base2flt(mb, eb) [L256] COND FALSE !(a < zero) VAL [a=4294967295, b=4294967295, ea=127, eb=127, ma=4328521728, mb=33554432, zero=0] [L259] COND TRUE a > zero [L260] tmp = 1 VAL [a=4294967295, b=4294967295, ea=127, eb=127, ma=4328521728, mb=33554432, tmp=1, zero=0] [L264] sa = tmp VAL [a=4294967295, b=4294967295, ea=127, eb=127, ma=4328521728, mb=33554432, sa=1, zero=0] [L266] COND FALSE !(b < zero) VAL [a=4294967295, b=4294967295, ea=127, eb=127, ma=4328521728, mb=33554432, sa=1, zero=0] [L269] COND TRUE b > zero [L270] tmp___0 = 1 VAL [a=4294967295, b=4294967295, ea=127, eb=127, ma=4328521728, mb=33554432, sa=1, tmp___0=1] [L274] sb = tmp___0 VAL [a=4294967295, b=4294967295, ea=127, eb=127, ma=4328521728, mb=33554432, sa=1, sb=1] [L277] CALL addflt(a, b) [L85] unsigned int res ; [L86] unsigned int ma ; [L87] unsigned int mb ; [L88] unsigned int delta ; [L89] int ea ; [L90] int eb ; [L91] unsigned int tmp ; [L92] unsigned int __retres10 ; VAL [a=4294967295, b=4294967295] [L95] COND FALSE !(a < b) VAL [a=4294967295, b=4294967295] [L102] COND FALSE !(! b) [L109] ma = a & ((1U << 24U) - 1U) [L110] ea = (int )(a >> 24U) - 128 VAL [a=4294967295, b=4294967295, ea=127, ma=16777215] [L111] EXPR ma | (1U << 24U) VAL [a=4294967295, b=4294967295, ea=127] [L111] ma = ma | (1U << 24U) [L112] mb = b & ((1U << 24U) - 1U) [L113] eb = (int )(b >> 24U) - 128 VAL [a=4294967295, ea=127, eb=127, ma=16777216, mb=16777215] [L114] EXPR mb | (1U << 24U) VAL [a=4294967295, ea=127, eb=127, ma=16777216] [L114] mb = mb | (1U << 24U) [L115] CALL __VERIFIER_assert(ea >= eb) VAL [\old(cond)=1] [L17] COND FALSE !(!(cond)) VAL [\old(cond)=1] [L115] RET __VERIFIER_assert(ea >= eb) VAL [a=4294967295, ea=127, eb=127, ma=16777216, mb=-4278190079] [L116] delta = ea - eb VAL [a=4294967295, delta=0, ea=127, ma=16777216, mb=-4278190079] [L117] COND FALSE !(!(delta < sizeof(mb) * 8)) VAL [a=4294967295, delta=0, ea=127, ma=16777216, mb=-4278190079] [L118] EXPR mb >> delta VAL [a=4294967295, ea=127, ma=16777216] [L118] mb = mb >> delta [L120] COND FALSE !(! mb) [L126] ma = ma + mb VAL [a=4294967295, ea=127, ma=-4261412863] [L127] ma & (1U << 25U) VAL [a=4294967295, ea=127, ma=-4261412863] [L127] COND FALSE !(ma & (1U << 25U)) [L140] CALL __VERIFIER_assert(ma < 1U << 25U) VAL [\old(cond)=0] [L17] COND TRUE !(cond) VAL [\old(cond)=0] [L18] reach_error() VAL [\old(cond)=0] - StatisticsResult: Ultimate Automizer benchmark data CFG has 3 procedures, 94 locations, 1 error locations. Started 1 CEGAR loops. OverallTime: 17.6s, OverallIterations: 41, TraceHistogramMax: 3, PathProgramHistogramMax: 1, EmptinessCheckTime: 0.1s, AutomataDifference: 4.6s, DeadEndRemovalTime: 0.0s, HoareAnnotationTime: 0.0s, InitialAbstractionConstructionTime: 0.0s, HoareTripleCheckerStatistics: 0 mSolverCounterUnknown, 2451 SdHoareTripleChecker+Valid, 3.0s IncrementalHoareTripleChecker+Time, 0 mSdLazyCounter, 2336 mSDsluCounter, 27897 SdHoareTripleChecker+Invalid, 2.4s Time, 0 mProtectedAction, 0 SdHoareTripleChecker+Unchecked, 0 IncrementalHoareTripleChecker+Unchecked, 22226 mSDsCounter, 143 IncrementalHoareTripleChecker+Valid, 0 mProtectedPredicate, 4960 IncrementalHoareTripleChecker+Invalid, 5103 SdHoareTripleChecker+Unknown, 0 mSolverCounterNotChecked, 143 mSolverCounterUnsat, 5671 mSDtfsCounter, 4960 mSolverCounterSat, 0.1s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Unknown, PredicateUnifierStatistics: 0 DeclaredPredicates, 1220 GetRequests, 881 SyntacticMatches, 1 SemanticMatches, 338 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 568 ImplicationChecksByTransitivity, 3.3s Time, 0.0s BasicInterpolantAutomatonTime, BiggestAbstraction: size=1085occurred in iteration=29, InterpolantAutomatonStates: 282, traceCheckStatistics: No data available, InterpolantConsolidationStatistics: No data available, PathInvariantsStatistics: No data available, 0/0 InterpolantCoveringCapability, TotalInterpolationStatistics: No data available, 0.0s DumpTime, AutomataMinimizationStatistics: 1.0s AutomataMinimizationTime, 40 MinimizatonAttempts, 2874 StatesRemovedByMinimization, 36 NontrivialMinimizations, HoareAnnotationStatistics: No data available, RefinementEngineStatistics: TRACE_CHECK: 0.1s SsaConstructionTime, 0.7s SatisfiabilityAnalysisTime, 7.3s InterpolantComputationTime, 2790 NumberOfCodeBlocks, 2790 NumberOfCodeBlocksAsserted, 56 NumberOfCheckSat, 2802 ConstructedInterpolants, 0 QuantifiedInterpolants, 6823 SizeOfPredicates, 20 NumberOfNonLiveVariables, 2257 ConjunctsInSsa, 274 ConjunctsInUnsatCore, 58 InterpolantComputations, 38 PerfectInterpolantSequences, 887/967 InterpolantCoveringCapability, INVARIANT_SYNTHESIS: No data available, INTERPOLANT_CONSOLIDATION: No data available, ABSTRACT_INTERPRETATION: No data available, PDR: No data available, ACCELERATED_INTERPOLATION: No data available, SIFA: No data available, ReuseStatistics: No data available, ConComCheckerStatistics: No data available RESULT: Ultimate could not prove your program: unable to determine feasibility of some traces [2025-01-08 22:48:50,291 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 (1)] Ended with exit code 0 Received shutdown request... --- End real Ultimate output --- Execution finished normally Using bit-precise analysis Retrying with bit-precise analysis ### Bit-precise run ### Calling Ultimate with: /root/.sdkman/candidates/java/21.0.5-tem/bin/java -Dosgi.configuration.area=/storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/data/config -Xmx15G -Xms4m -jar /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/plugins/org.eclipse.equinox.launcher_1.6.800.v20240513-1750.jar -data @noDefault -ultimatedata /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/data -tc /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/config/AutomizerReach.xml -i ../sv-benchmarks/c/bitvector/soft_float_1-2a.c.cil.c -s /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/config/svcomp-Reach-32bit-Automizer_Bitvector.epf --cacsl2boogietranslator.entry.function main --witnessprinter.witness.directory /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux --witnessprinter.witness.filename witness --witnessprinter.write.witness.besides.input.file false --witnessprinter.graph.data.specification CHECK( init(main()), LTL(G ! call(reach_error())) ) --witnessprinter.graph.data.producer Automizer --witnessprinter.graph.data.architecture 32bit --witnessprinter.graph.data.programhash c9ff936057be59b0f479a8c37fd17409fe797633e9a8a05703f5728379735d91 --- Real Ultimate output --- This is Ultimate 0.3.0-?-551b009-m [2025-01-08 22:48:52,252 INFO L188 SettingsManager]: Resetting all preferences to default values... [2025-01-08 22:48:52,320 INFO L114 SettingsManager]: Loading settings from /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/config/svcomp-Reach-32bit-Automizer_Bitvector.epf [2025-01-08 22:48:52,324 WARN L101 SettingsManager]: Preference file contains the following unknown settings: [2025-01-08 22:48:52,324 WARN L103 SettingsManager]: * de.uni_freiburg.informatik.ultimate.core.Log level for class [2025-01-08 22:48:52,359 INFO L130 SettingsManager]: Preferences different from defaults after loading the file: [2025-01-08 22:48:52,360 INFO L151 SettingsManager]: Preferences of UltimateCore differ from their defaults: [2025-01-08 22:48:52,360 INFO L153 SettingsManager]: * Log level for class=de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher=ERROR; [2025-01-08 22:48:52,360 INFO L151 SettingsManager]: Preferences of Boogie Preprocessor differ from their defaults: [2025-01-08 22:48:52,360 INFO L153 SettingsManager]: * Use memory slicer=true [2025-01-08 22:48:52,361 INFO L151 SettingsManager]: Preferences of Boogie Procedure Inliner differ from their defaults: [2025-01-08 22:48:52,361 INFO L153 SettingsManager]: * Ignore calls to procedures called more than once=ONLY_FOR_SEQUENTIAL_PROGRAMS [2025-01-08 22:48:52,361 INFO L151 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2025-01-08 22:48:52,361 INFO L153 SettingsManager]: * Create parallel compositions if possible=false [2025-01-08 22:48:52,361 INFO L153 SettingsManager]: * Use SBE=true [2025-01-08 22:48:52,361 INFO L151 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2025-01-08 22:48:52,361 INFO L153 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2025-01-08 22:48:52,361 INFO L153 SettingsManager]: * sizeof long=4 [2025-01-08 22:48:52,361 INFO L153 SettingsManager]: * sizeof POINTER=4 [2025-01-08 22:48:52,362 INFO L153 SettingsManager]: * Check division by zero=IGNORE [2025-01-08 22:48:52,362 INFO L153 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2025-01-08 22:48:52,362 INFO L153 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2025-01-08 22:48:52,362 INFO L153 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2025-01-08 22:48:52,362 INFO L153 SettingsManager]: * Adapt memory model on pointer casts if necessary=true [2025-01-08 22:48:52,362 INFO L153 SettingsManager]: * Use bitvectors instead of ints=true [2025-01-08 22:48:52,362 INFO L153 SettingsManager]: * Memory model=HoenickeLindenmann_4ByteResolution [2025-01-08 22:48:52,362 INFO L153 SettingsManager]: * sizeof long double=12 [2025-01-08 22:48:52,362 INFO L153 SettingsManager]: * Check if freed pointer was valid=false [2025-01-08 22:48:52,362 INFO L153 SettingsManager]: * Behaviour of calls to undefined functions=OVERAPPROXIMATE_BEHAVIOUR [2025-01-08 22:48:52,362 INFO L153 SettingsManager]: * Use constant arrays=true [2025-01-08 22:48:52,363 INFO L151 SettingsManager]: Preferences of IcfgBuilder differ from their defaults: [2025-01-08 22:48:52,363 INFO L153 SettingsManager]: * Size of a code block=SequenceOfStatements [2025-01-08 22:48:52,363 INFO L153 SettingsManager]: * Only consider context switches at boundaries of atomic blocks=true [2025-01-08 22:48:52,363 INFO L153 SettingsManager]: * SMT solver=External_DefaultMode [2025-01-08 22:48:52,363 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2025-01-08 22:48:52,363 INFO L151 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2025-01-08 22:48:52,363 INFO L153 SettingsManager]: * Size of a code block=SequenceOfStatements [2025-01-08 22:48:52,363 INFO L153 SettingsManager]: * Only consider context switches at boundaries of atomic blocks=true [2025-01-08 22:48:52,363 INFO L153 SettingsManager]: * SMT solver=External_DefaultMode [2025-01-08 22:48:52,363 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2025-01-08 22:48:52,364 INFO L151 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2025-01-08 22:48:52,364 INFO L153 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2025-01-08 22:48:52,364 INFO L153 SettingsManager]: * Compute procedure contracts=false [2025-01-08 22:48:52,364 INFO L153 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopHeads [2025-01-08 22:48:52,364 INFO L153 SettingsManager]: * Trace refinement strategy=FOX [2025-01-08 22:48:52,364 INFO L153 SettingsManager]: * Command for external solver=cvc4 --incremental --print-success --lang smt [2025-01-08 22:48:52,364 INFO L153 SettingsManager]: * Apply one-shot large block encoding in concurrent analysis=false [2025-01-08 22:48:52,364 INFO L153 SettingsManager]: * Automaton type used in concurrency analysis=PETRI_NET [2025-01-08 22:48:52,364 INFO L153 SettingsManager]: * Order on configurations for Petri net unfoldings=DBO [2025-01-08 22:48:52,364 INFO L153 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode [2025-01-08 22:48:52,364 INFO L153 SettingsManager]: * Looper check in Petri net analysis=SEMANTIC Applying setting for plugin de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator: Entry function -> main Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Witness directory -> /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Witness filename -> witness Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Write witness besides input file -> false Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Graph data specification -> CHECK( init(main()), LTL(G ! call(reach_error())) ) Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Graph data producer -> Automizer Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Graph data architecture -> 32bit Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Graph data programhash -> c9ff936057be59b0f479a8c37fd17409fe797633e9a8a05703f5728379735d91 [2025-01-08 22:48:52,630 INFO L75 nceAwareModelManager]: Repository-Root is: /tmp [2025-01-08 22:48:52,639 INFO L261 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2025-01-08 22:48:52,641 INFO L217 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2025-01-08 22:48:52,641 INFO L270 PluginConnector]: Initializing CDTParser... [2025-01-08 22:48:52,642 INFO L274 PluginConnector]: CDTParser initialized [2025-01-08 22:48:52,642 INFO L431 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/../sv-benchmarks/c/bitvector/soft_float_1-2a.c.cil.c [2025-01-08 22:48:53,766 INFO L533 CDTParser]: Created temporary CDT project at /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/data/1c1c1472b/11ecc125400c46a29a1f6888092164e1/FLAGd721cd407 [2025-01-08 22:48:54,016 INFO L384 CDTParser]: Found 1 translation units. [2025-01-08 22:48:54,016 INFO L180 CDTParser]: Scanning /storage/repos/ultimate-jdk21/releaseScripts/default/sv-benchmarks/c/bitvector/soft_float_1-2a.c.cil.c [2025-01-08 22:48:54,027 INFO L427 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/data/1c1c1472b/11ecc125400c46a29a1f6888092164e1/FLAGd721cd407 [2025-01-08 22:48:54,334 INFO L435 CDTParser]: Successfully deleted /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/data/1c1c1472b/11ecc125400c46a29a1f6888092164e1 [2025-01-08 22:48:54,336 INFO L299 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2025-01-08 22:48:54,337 INFO L133 ToolchainWalker]: Walking toolchain with 6 elements. [2025-01-08 22:48:54,338 INFO L112 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2025-01-08 22:48:54,338 INFO L270 PluginConnector]: Initializing CACSL2BoogieTranslator... [2025-01-08 22:48:54,345 INFO L274 PluginConnector]: CACSL2BoogieTranslator initialized [2025-01-08 22:48:54,346 INFO L184 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 08.01 10:48:54" (1/1) ... [2025-01-08 22:48:54,346 INFO L204 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@7962d1df and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.01 10:48:54, skipping insertion in model container [2025-01-08 22:48:54,347 INFO L184 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 08.01 10:48:54" (1/1) ... [2025-01-08 22:48:54,359 INFO L175 MainTranslator]: Built tables and reachable declarations [2025-01-08 22:48:54,441 WARN L250 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate-jdk21/releaseScripts/default/sv-benchmarks/c/bitvector/soft_float_1-2a.c.cil.c[755,768] [2025-01-08 22:48:54,474 INFO L210 PostProcessor]: Analyzing one entry point: main [2025-01-08 22:48:54,482 INFO L200 MainTranslator]: Completed pre-run [2025-01-08 22:48:54,489 WARN L250 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate-jdk21/releaseScripts/default/sv-benchmarks/c/bitvector/soft_float_1-2a.c.cil.c[755,768] [2025-01-08 22:48:54,507 INFO L210 PostProcessor]: Analyzing one entry point: main [2025-01-08 22:48:54,517 INFO L204 MainTranslator]: Completed translation [2025-01-08 22:48:54,518 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.01 10:48:54 WrapperNode [2025-01-08 22:48:54,519 INFO L131 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2025-01-08 22:48:54,519 INFO L112 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2025-01-08 22:48:54,519 INFO L270 PluginConnector]: Initializing Boogie Procedure Inliner... [2025-01-08 22:48:54,519 INFO L274 PluginConnector]: Boogie Procedure Inliner initialized [2025-01-08 22:48:54,525 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.01 10:48:54" (1/1) ... [2025-01-08 22:48:54,532 INFO L184 PluginConnector]: Executing the observer Inliner from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.01 10:48:54" (1/1) ... [2025-01-08 22:48:54,550 INFO L138 Inliner]: procedures = 17, calls = 18, calls flagged for inlining = 3, calls inlined = 3, statements flattened = 149 [2025-01-08 22:48:54,553 INFO L131 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2025-01-08 22:48:54,553 INFO L112 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2025-01-08 22:48:54,553 INFO L270 PluginConnector]: Initializing Boogie Preprocessor... [2025-01-08 22:48:54,553 INFO L274 PluginConnector]: Boogie Preprocessor initialized [2025-01-08 22:48:54,559 INFO L184 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.01 10:48:54" (1/1) ... [2025-01-08 22:48:54,559 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.01 10:48:54" (1/1) ... [2025-01-08 22:48:54,562 INFO L184 PluginConnector]: Executing the observer MemorySlicer from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.01 10:48:54" (1/1) ... [2025-01-08 22:48:54,577 INFO L175 MemorySlicer]: Split 2 memory accesses to 1 slices as follows [2]. 100 percent of accesses are in the largest equivalence class. The 2 initializations are split as follows [2]. The 0 writes are split as follows [0]. [2025-01-08 22:48:54,581 INFO L184 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.01 10:48:54" (1/1) ... [2025-01-08 22:48:54,581 INFO L184 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.01 10:48:54" (1/1) ... [2025-01-08 22:48:54,588 INFO L184 PluginConnector]: Executing the observer ReplaceArrayAssignments from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.01 10:48:54" (1/1) ... [2025-01-08 22:48:54,589 INFO L184 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.01 10:48:54" (1/1) ... [2025-01-08 22:48:54,595 INFO L184 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.01 10:48:54" (1/1) ... [2025-01-08 22:48:54,596 INFO L184 PluginConnector]: Executing the observer LTLStepAnnotator from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.01 10:48:54" (1/1) ... [2025-01-08 22:48:54,597 INFO L184 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.01 10:48:54" (1/1) ... [2025-01-08 22:48:54,599 INFO L131 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2025-01-08 22:48:54,603 INFO L112 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2025-01-08 22:48:54,603 INFO L270 PluginConnector]: Initializing RCFGBuilder... [2025-01-08 22:48:54,603 INFO L274 PluginConnector]: RCFGBuilder initialized [2025-01-08 22:48:54,604 INFO L184 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.01 10:48:54" (1/1) ... [2025-01-08 22:48:54,614 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2025-01-08 22:48:54,628 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 [2025-01-08 22:48:54,646 INFO L229 MonitoredProcess]: Starting monitored process 1 with /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 (exit command is (exit), workingDir is null) [2025-01-08 22:48:54,653 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 (1)] Waiting until timeout for monitored process [2025-01-08 22:48:54,670 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocInit [2025-01-08 22:48:54,671 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~intINTTYPE1#0 [2025-01-08 22:48:54,671 INFO L130 BoogieDeclarations]: Found specification of procedure base2flt [2025-01-08 22:48:54,671 INFO L138 BoogieDeclarations]: Found implementation of procedure base2flt [2025-01-08 22:48:54,671 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2025-01-08 22:48:54,671 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2025-01-08 22:48:54,671 INFO L130 BoogieDeclarations]: Found specification of procedure __VERIFIER_assert [2025-01-08 22:48:54,671 INFO L138 BoogieDeclarations]: Found implementation of procedure __VERIFIER_assert [2025-01-08 22:48:54,718 INFO L234 CfgBuilder]: Building ICFG [2025-01-08 22:48:54,719 INFO L260 CfgBuilder]: Building CFG for each procedure with an implementation [2025-01-08 22:48:55,007 INFO L? ?]: Removed 55 outVars from TransFormulas that were not future-live. [2025-01-08 22:48:55,007 INFO L283 CfgBuilder]: Performing block encoding [2025-01-08 22:48:55,020 INFO L307 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2025-01-08 22:48:55,020 INFO L312 CfgBuilder]: Removed 2 assume(true) statements. [2025-01-08 22:48:55,020 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 08.01 10:48:55 BoogieIcfgContainer [2025-01-08 22:48:55,021 INFO L131 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2025-01-08 22:48:55,022 INFO L112 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2025-01-08 22:48:55,022 INFO L270 PluginConnector]: Initializing TraceAbstraction... [2025-01-08 22:48:55,030 INFO L274 PluginConnector]: TraceAbstraction initialized [2025-01-08 22:48:55,030 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 08.01 10:48:54" (1/3) ... [2025-01-08 22:48:55,030 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@4e9f1061 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 08.01 10:48:55, skipping insertion in model container [2025-01-08 22:48:55,031 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.01 10:48:54" (2/3) ... [2025-01-08 22:48:55,031 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@4e9f1061 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 08.01 10:48:55, skipping insertion in model container [2025-01-08 22:48:55,031 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 08.01 10:48:55" (3/3) ... [2025-01-08 22:48:55,032 INFO L128 eAbstractionObserver]: Analyzing ICFG soft_float_1-2a.c.cil.c [2025-01-08 22:48:55,052 INFO L216 ceAbstractionStarter]: Automizer settings: Hoare:LoopHeads NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2025-01-08 22:48:55,057 INFO L151 ceAbstractionStarter]: Applying trace abstraction to ICFG soft_float_1-2a.c.cil.c that has 3 procedures, 70 locations, 1 initial locations, 2 loop locations, and 1 error locations. [2025-01-08 22:48:55,103 INFO L332 AbstractCegarLoop]: ======== Iteration 0 == of CEGAR loop == AllErrorsAtOnce ======== [2025-01-08 22:48:55,111 INFO L333 AbstractCegarLoop]: Settings: SEPARATE_VIOLATION_CHECK=true, mInterprocedural=true, mMaxIterations=1000000, mWatchIteration=1000000, mArtifact=RCFG, mInterpolation=FPandBP, mInterpolantAutomaton=STRAIGHT_LINE, mDumpAutomata=false, mAutomataFormat=ATS_NUMERATE, mDumpPath=., mDeterminiation=PREDICATE_ABSTRACTION, mMinimize=MINIMIZE_SEVPA, mAutomataTypeConcurrency=PETRI_NET, mHoareTripleChecks=INCREMENTAL, mHoareAnnotationPositions=LoopHeads, mDumpOnlyReuseAutomata=false, mLimitTraceHistogram=0, mErrorLocTimeLimit=0, mLimitPathProgramCount=0, mCollectInterpolantStatistics=true, mHeuristicEmptinessCheck=false, mHeuristicEmptinessCheckAStarHeuristic=ZERO, mHeuristicEmptinessCheckAStarHeuristicRandomSeed=1337, mHeuristicEmptinessCheckSmtFeatureScoringMethod=DAGSIZE, mSMTFeatureExtraction=false, mSMTFeatureExtractionDumpPath=., mOverrideInterpolantAutomaton=false, mMcrInterpolantMethod=WP, mPorIndependenceSettings=[Lde.uni_freiburg.informatik.ultimate.lib.tracecheckerutils.partialorder.independence.IndependenceSettings;@13bb0393, mLbeIndependenceSettings=[IndependenceType=SEMANTIC, AbstractionType=NONE, UseConditional=false, UseSemiCommutativity=true, Solver=Z3, SolverTimeout=1000ms] [2025-01-08 22:48:55,111 INFO L334 AbstractCegarLoop]: Starting to check reachability of 1 error locations. [2025-01-08 22:48:55,114 INFO L276 IsEmpty]: Start isEmpty. Operand has 70 states, 58 states have (on average 1.5862068965517242) internal successors, (92), 61 states have internal predecessors, (92), 8 states have call successors, (8), 2 states have call predecessors, (8), 2 states have return successors, (8), 8 states have call predecessors, (8), 8 states have call successors, (8) [2025-01-08 22:48:55,118 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 33 [2025-01-08 22:48:55,118 INFO L210 NwaCegarLoop]: Found error trace [2025-01-08 22:48:55,119 INFO L218 NwaCegarLoop]: trace histogram [3, 3, 3, 3, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-01-08 22:48:55,119 INFO L396 AbstractCegarLoop]: === Iteration 1 === Targeting __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-01-08 22:48:55,122 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-01-08 22:48:55,123 INFO L85 PathProgramCache]: Analyzing trace with hash -1087601879, now seen corresponding path program 1 times [2025-01-08 22:48:55,129 INFO L118 FreeRefinementEngine]: Executing refinement strategy FOX [2025-01-08 22:48:55,129 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleZ3 [2023973037] [2025-01-08 22:48:55,129 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-01-08 22:48:55,129 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-01-08 22:48:55,129 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 [2025-01-08 22:48:55,131 INFO L229 MonitoredProcess]: Starting monitored process 2 with /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2025-01-08 22:48:55,133 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (2)] Waiting until timeout for monitored process [2025-01-08 22:48:55,180 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 32 statements into 1 equivalence classes. [2025-01-08 22:48:55,203 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 32 of 32 statements. [2025-01-08 22:48:55,203 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-01-08 22:48:55,203 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-01-08 22:48:55,206 INFO L256 TraceCheckSpWp]: Trace formula consists of 72 conjuncts, 9 conjuncts are in the unsatisfiable core [2025-01-08 22:48:55,210 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-01-08 22:48:55,312 INFO L134 CoverageAnalysis]: Checked inductivity of 15 backedges. 3 proven. 3 refuted. 0 times theorem prover too weak. 9 trivial. 0 not checked. [2025-01-08 22:48:55,313 INFO L312 TraceCheckSpWp]: Computing backward predicates... [2025-01-08 22:48:55,361 INFO L134 CoverageAnalysis]: Checked inductivity of 15 backedges. 3 proven. 3 refuted. 0 times theorem prover too weak. 9 trivial. 0 not checked. [2025-01-08 22:48:55,361 INFO L136 FreeRefinementEngine]: Strategy FOX found an infeasible trace [2025-01-08 22:48:55,362 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [2023973037] [2025-01-08 22:48:55,362 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [2023973037] provided 0 perfect and 2 imperfect interpolant sequences [2025-01-08 22:48:55,362 INFO L185 FreeRefinementEngine]: Found 0 perfect and 2 imperfect interpolant sequences. [2025-01-08 22:48:55,362 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [8, 8] total 8 [2025-01-08 22:48:55,363 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1134699245] [2025-01-08 22:48:55,364 INFO L85 oduleStraightlineAll]: Using 2 imperfect interpolants to construct interpolant automaton [2025-01-08 22:48:55,366 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 8 states [2025-01-08 22:48:55,366 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy FOX [2025-01-08 22:48:55,377 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2025-01-08 22:48:55,378 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=13, Invalid=43, Unknown=0, NotChecked=0, Total=56 [2025-01-08 22:48:55,379 INFO L87 Difference]: Start difference. First operand has 70 states, 58 states have (on average 1.5862068965517242) internal successors, (92), 61 states have internal predecessors, (92), 8 states have call successors, (8), 2 states have call predecessors, (8), 2 states have return successors, (8), 8 states have call predecessors, (8), 8 states have call successors, (8) Second operand has 8 states, 8 states have (on average 2.5) internal successors, (20), 7 states have internal predecessors, (20), 3 states have call successors, (4), 2 states have call predecessors, (4), 2 states have return successors, (3), 3 states have call predecessors, (3), 2 states have call successors, (3) [2025-01-08 22:48:55,522 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-01-08 22:48:55,523 INFO L93 Difference]: Finished difference Result 171 states and 280 transitions. [2025-01-08 22:48:55,530 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2025-01-08 22:48:55,532 INFO L78 Accepts]: Start accepts. Automaton has has 8 states, 8 states have (on average 2.5) internal successors, (20), 7 states have internal predecessors, (20), 3 states have call successors, (4), 2 states have call predecessors, (4), 2 states have return successors, (3), 3 states have call predecessors, (3), 2 states have call successors, (3) Word has length 32 [2025-01-08 22:48:55,532 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-01-08 22:48:55,537 INFO L225 Difference]: With dead ends: 171 [2025-01-08 22:48:55,537 INFO L226 Difference]: Without dead ends: 98 [2025-01-08 22:48:55,539 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 65 GetRequests, 56 SyntacticMatches, 0 SemanticMatches, 9 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=28, Invalid=82, Unknown=0, NotChecked=0, Total=110 [2025-01-08 22:48:55,540 INFO L435 NwaCegarLoop]: 89 mSDtfsCounter, 33 mSDsluCounter, 520 mSDsCounter, 0 mSdLazyCounter, 123 mSolverCounterSat, 5 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 35 SdHoareTripleChecker+Valid, 609 SdHoareTripleChecker+Invalid, 128 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 5 IncrementalHoareTripleChecker+Valid, 123 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2025-01-08 22:48:55,541 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [35 Valid, 609 Invalid, 128 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [5 Valid, 123 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2025-01-08 22:48:55,548 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 98 states. [2025-01-08 22:48:55,571 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 98 to 96. [2025-01-08 22:48:55,572 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 96 states, 81 states have (on average 1.4814814814814814) internal successors, (120), 84 states have internal predecessors, (120), 11 states have call successors, (11), 2 states have call predecessors, (11), 3 states have return successors, (14), 11 states have call predecessors, (14), 10 states have call successors, (14) [2025-01-08 22:48:55,575 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 96 states to 96 states and 145 transitions. [2025-01-08 22:48:55,576 INFO L78 Accepts]: Start accepts. Automaton has 96 states and 145 transitions. Word has length 32 [2025-01-08 22:48:55,576 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-01-08 22:48:55,576 INFO L471 AbstractCegarLoop]: Abstraction has 96 states and 145 transitions. [2025-01-08 22:48:55,576 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 8 states, 8 states have (on average 2.5) internal successors, (20), 7 states have internal predecessors, (20), 3 states have call successors, (4), 2 states have call predecessors, (4), 2 states have return successors, (3), 3 states have call predecessors, (3), 2 states have call successors, (3) [2025-01-08 22:48:55,577 INFO L276 IsEmpty]: Start isEmpty. Operand 96 states and 145 transitions. [2025-01-08 22:48:55,580 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 36 [2025-01-08 22:48:55,580 INFO L210 NwaCegarLoop]: Found error trace [2025-01-08 22:48:55,580 INFO L218 NwaCegarLoop]: trace histogram [3, 3, 3, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-01-08 22:48:55,586 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (2)] Ended with exit code 0 [2025-01-08 22:48:55,784 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 2 /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-01-08 22:48:55,784 INFO L396 AbstractCegarLoop]: === Iteration 2 === Targeting __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-01-08 22:48:55,785 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-01-08 22:48:55,785 INFO L85 PathProgramCache]: Analyzing trace with hash -1769096391, now seen corresponding path program 1 times [2025-01-08 22:48:55,785 INFO L118 FreeRefinementEngine]: Executing refinement strategy FOX [2025-01-08 22:48:55,785 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleZ3 [2118048398] [2025-01-08 22:48:55,785 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-01-08 22:48:55,786 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-01-08 22:48:55,786 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 [2025-01-08 22:48:55,787 INFO L229 MonitoredProcess]: Starting monitored process 3 with /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2025-01-08 22:48:55,789 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (3)] Waiting until timeout for monitored process [2025-01-08 22:48:55,820 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 35 statements into 1 equivalence classes. [2025-01-08 22:48:55,831 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 35 of 35 statements. [2025-01-08 22:48:55,831 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-01-08 22:48:55,831 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-01-08 22:48:55,832 INFO L256 TraceCheckSpWp]: Trace formula consists of 75 conjuncts, 9 conjuncts are in the unsatisfiable core [2025-01-08 22:48:55,834 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-01-08 22:48:55,962 INFO L134 CoverageAnalysis]: Checked inductivity of 15 backedges. 0 proven. 9 refuted. 0 times theorem prover too weak. 6 trivial. 0 not checked. [2025-01-08 22:48:55,965 INFO L312 TraceCheckSpWp]: Computing backward predicates... [2025-01-08 22:48:56,048 INFO L134 CoverageAnalysis]: Checked inductivity of 15 backedges. 3 proven. 3 refuted. 0 times theorem prover too weak. 9 trivial. 0 not checked. [2025-01-08 22:48:56,049 INFO L136 FreeRefinementEngine]: Strategy FOX found an infeasible trace [2025-01-08 22:48:56,049 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [2118048398] [2025-01-08 22:48:56,050 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [2118048398] provided 0 perfect and 2 imperfect interpolant sequences [2025-01-08 22:48:56,050 INFO L185 FreeRefinementEngine]: Found 0 perfect and 2 imperfect interpolant sequences. [2025-01-08 22:48:56,050 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [10, 6] total 12 [2025-01-08 22:48:56,050 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [730011887] [2025-01-08 22:48:56,050 INFO L85 oduleStraightlineAll]: Using 2 imperfect interpolants to construct interpolant automaton [2025-01-08 22:48:56,051 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 12 states [2025-01-08 22:48:56,052 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy FOX [2025-01-08 22:48:56,052 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 12 interpolants. [2025-01-08 22:48:56,053 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=29, Invalid=103, Unknown=0, NotChecked=0, Total=132 [2025-01-08 22:48:56,053 INFO L87 Difference]: Start difference. First operand 96 states and 145 transitions. Second operand has 12 states, 11 states have (on average 2.727272727272727) internal successors, (30), 9 states have internal predecessors, (30), 5 states have call successors, (6), 2 states have call predecessors, (6), 3 states have return successors, (6), 6 states have call predecessors, (6), 4 states have call successors, (6) [2025-01-08 22:48:56,315 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-01-08 22:48:56,315 INFO L93 Difference]: Finished difference Result 228 states and 363 transitions. [2025-01-08 22:48:56,316 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 12 states. [2025-01-08 22:48:56,316 INFO L78 Accepts]: Start accepts. Automaton has has 12 states, 11 states have (on average 2.727272727272727) internal successors, (30), 9 states have internal predecessors, (30), 5 states have call successors, (6), 2 states have call predecessors, (6), 3 states have return successors, (6), 6 states have call predecessors, (6), 4 states have call successors, (6) Word has length 35 [2025-01-08 22:48:56,316 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-01-08 22:48:56,317 INFO L225 Difference]: With dead ends: 228 [2025-01-08 22:48:56,318 INFO L226 Difference]: Without dead ends: 162 [2025-01-08 22:48:56,318 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 68 GetRequests, 58 SyntacticMatches, 0 SemanticMatches, 10 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 8 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=29, Invalid=103, Unknown=0, NotChecked=0, Total=132 [2025-01-08 22:48:56,319 INFO L435 NwaCegarLoop]: 139 mSDtfsCounter, 51 mSDsluCounter, 1130 mSDsCounter, 0 mSdLazyCounter, 314 mSolverCounterSat, 6 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 60 SdHoareTripleChecker+Valid, 1269 SdHoareTripleChecker+Invalid, 320 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 6 IncrementalHoareTripleChecker+Valid, 314 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.2s IncrementalHoareTripleChecker+Time [2025-01-08 22:48:56,319 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [60 Valid, 1269 Invalid, 320 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [6 Valid, 314 Invalid, 0 Unknown, 0 Unchecked, 0.2s Time] [2025-01-08 22:48:56,319 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 162 states. [2025-01-08 22:48:56,328 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 162 to 124. [2025-01-08 22:48:56,329 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 124 states, 103 states have (on average 1.3883495145631068) internal successors, (143), 103 states have internal predecessors, (143), 16 states have call successors, (16), 2 states have call predecessors, (16), 4 states have return successors, (33), 20 states have call predecessors, (33), 15 states have call successors, (33) [2025-01-08 22:48:56,330 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 124 states to 124 states and 192 transitions. [2025-01-08 22:48:56,330 INFO L78 Accepts]: Start accepts. Automaton has 124 states and 192 transitions. Word has length 35 [2025-01-08 22:48:56,331 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-01-08 22:48:56,331 INFO L471 AbstractCegarLoop]: Abstraction has 124 states and 192 transitions. [2025-01-08 22:48:56,331 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 12 states, 11 states have (on average 2.727272727272727) internal successors, (30), 9 states have internal predecessors, (30), 5 states have call successors, (6), 2 states have call predecessors, (6), 3 states have return successors, (6), 6 states have call predecessors, (6), 4 states have call successors, (6) [2025-01-08 22:48:56,331 INFO L276 IsEmpty]: Start isEmpty. Operand 124 states and 192 transitions. [2025-01-08 22:48:56,332 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 39 [2025-01-08 22:48:56,332 INFO L210 NwaCegarLoop]: Found error trace [2025-01-08 22:48:56,332 INFO L218 NwaCegarLoop]: trace histogram [3, 3, 3, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-01-08 22:48:56,339 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (3)] Ended with exit code 0 [2025-01-08 22:48:56,533 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 3 /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-01-08 22:48:56,534 INFO L396 AbstractCegarLoop]: === Iteration 3 === Targeting __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-01-08 22:48:56,534 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-01-08 22:48:56,534 INFO L85 PathProgramCache]: Analyzing trace with hash 2102945705, now seen corresponding path program 1 times [2025-01-08 22:48:56,534 INFO L118 FreeRefinementEngine]: Executing refinement strategy FOX [2025-01-08 22:48:56,535 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleZ3 [886728765] [2025-01-08 22:48:56,535 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-01-08 22:48:56,535 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-01-08 22:48:56,535 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 [2025-01-08 22:48:56,539 INFO L229 MonitoredProcess]: Starting monitored process 4 with /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2025-01-08 22:48:56,540 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (4)] Waiting until timeout for monitored process [2025-01-08 22:48:56,574 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 38 statements into 1 equivalence classes. [2025-01-08 22:48:56,583 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 38 of 38 statements. [2025-01-08 22:48:56,583 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-01-08 22:48:56,583 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-01-08 22:48:56,584 INFO L256 TraceCheckSpWp]: Trace formula consists of 79 conjuncts, 3 conjuncts are in the unsatisfiable core [2025-01-08 22:48:56,585 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-01-08 22:48:56,608 INFO L134 CoverageAnalysis]: Checked inductivity of 17 backedges. 12 proven. 0 refuted. 0 times theorem prover too weak. 5 trivial. 0 not checked. [2025-01-08 22:48:56,608 INFO L308 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2025-01-08 22:48:56,608 INFO L136 FreeRefinementEngine]: Strategy FOX found an infeasible trace [2025-01-08 22:48:56,608 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [886728765] [2025-01-08 22:48:56,608 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [886728765] provided 1 perfect and 0 imperfect interpolant sequences [2025-01-08 22:48:56,608 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-01-08 22:48:56,608 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2025-01-08 22:48:56,609 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1191248331] [2025-01-08 22:48:56,609 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-01-08 22:48:56,609 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2025-01-08 22:48:56,609 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy FOX [2025-01-08 22:48:56,609 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2025-01-08 22:48:56,609 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2025-01-08 22:48:56,609 INFO L87 Difference]: Start difference. First operand 124 states and 192 transitions. Second operand has 4 states, 4 states have (on average 7.0) internal successors, (28), 4 states have internal predecessors, (28), 2 states have call successors, (4), 2 states have call predecessors, (4), 2 states have return successors, (3), 1 states have call predecessors, (3), 2 states have call successors, (3) [2025-01-08 22:48:56,655 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-01-08 22:48:56,655 INFO L93 Difference]: Finished difference Result 238 states and 369 transitions. [2025-01-08 22:48:56,656 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2025-01-08 22:48:56,656 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 4 states have (on average 7.0) internal successors, (28), 4 states have internal predecessors, (28), 2 states have call successors, (4), 2 states have call predecessors, (4), 2 states have return successors, (3), 1 states have call predecessors, (3), 2 states have call successors, (3) Word has length 38 [2025-01-08 22:48:56,656 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-01-08 22:48:56,657 INFO L225 Difference]: With dead ends: 238 [2025-01-08 22:48:56,659 INFO L226 Difference]: Without dead ends: 117 [2025-01-08 22:48:56,660 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 38 GetRequests, 35 SyntacticMatches, 0 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=9, Invalid=11, Unknown=0, NotChecked=0, Total=20 [2025-01-08 22:48:56,660 INFO L435 NwaCegarLoop]: 90 mSDtfsCounter, 22 mSDsluCounter, 164 mSDsCounter, 0 mSdLazyCounter, 31 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 22 SdHoareTripleChecker+Valid, 254 SdHoareTripleChecker+Invalid, 31 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 31 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2025-01-08 22:48:56,660 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [22 Valid, 254 Invalid, 31 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 31 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2025-01-08 22:48:56,661 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 117 states. [2025-01-08 22:48:56,673 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 117 to 107. [2025-01-08 22:48:56,675 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 107 states, 89 states have (on average 1.3932584269662922) internal successors, (124), 93 states have internal predecessors, (124), 12 states have call successors, (12), 2 states have call predecessors, (12), 5 states have return successors, (23), 13 states have call predecessors, (23), 11 states have call successors, (23) [2025-01-08 22:48:56,676 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 107 states to 107 states and 159 transitions. [2025-01-08 22:48:56,678 INFO L78 Accepts]: Start accepts. Automaton has 107 states and 159 transitions. Word has length 38 [2025-01-08 22:48:56,678 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-01-08 22:48:56,678 INFO L471 AbstractCegarLoop]: Abstraction has 107 states and 159 transitions. [2025-01-08 22:48:56,678 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 7.0) internal successors, (28), 4 states have internal predecessors, (28), 2 states have call successors, (4), 2 states have call predecessors, (4), 2 states have return successors, (3), 1 states have call predecessors, (3), 2 states have call successors, (3) [2025-01-08 22:48:56,678 INFO L276 IsEmpty]: Start isEmpty. Operand 107 states and 159 transitions. [2025-01-08 22:48:56,679 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 40 [2025-01-08 22:48:56,679 INFO L210 NwaCegarLoop]: Found error trace [2025-01-08 22:48:56,679 INFO L218 NwaCegarLoop]: trace histogram [3, 3, 3, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-01-08 22:48:56,689 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (4)] Ended with exit code 0 [2025-01-08 22:48:56,880 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 4 /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-01-08 22:48:56,880 INFO L396 AbstractCegarLoop]: === Iteration 4 === Targeting __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-01-08 22:48:56,881 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-01-08 22:48:56,881 INFO L85 PathProgramCache]: Analyzing trace with hash -478762087, now seen corresponding path program 1 times [2025-01-08 22:48:56,881 INFO L118 FreeRefinementEngine]: Executing refinement strategy FOX [2025-01-08 22:48:56,881 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleZ3 [445527527] [2025-01-08 22:48:56,881 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-01-08 22:48:56,881 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-01-08 22:48:56,881 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 [2025-01-08 22:48:56,883 INFO L229 MonitoredProcess]: Starting monitored process 5 with /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2025-01-08 22:48:56,886 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (5)] Waiting until timeout for monitored process [2025-01-08 22:48:56,913 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 39 statements into 1 equivalence classes. [2025-01-08 22:48:56,922 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 39 of 39 statements. [2025-01-08 22:48:56,922 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-01-08 22:48:56,922 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-01-08 22:48:56,924 INFO L256 TraceCheckSpWp]: Trace formula consists of 79 conjuncts, 13 conjuncts are in the unsatisfiable core [2025-01-08 22:48:56,925 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-01-08 22:48:57,116 INFO L134 CoverageAnalysis]: Checked inductivity of 15 backedges. 6 proven. 3 refuted. 0 times theorem prover too weak. 6 trivial. 0 not checked. [2025-01-08 22:48:57,117 INFO L312 TraceCheckSpWp]: Computing backward predicates... [2025-01-08 22:48:57,200 INFO L134 CoverageAnalysis]: Checked inductivity of 15 backedges. 6 proven. 0 refuted. 0 times theorem prover too weak. 9 trivial. 0 not checked. [2025-01-08 22:48:57,201 INFO L136 FreeRefinementEngine]: Strategy FOX found an infeasible trace [2025-01-08 22:48:57,201 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [445527527] [2025-01-08 22:48:57,201 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [445527527] provided 1 perfect and 1 imperfect interpolant sequences [2025-01-08 22:48:57,202 INFO L185 FreeRefinementEngine]: Found 1 perfect and 1 imperfect interpolant sequences. [2025-01-08 22:48:57,202 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [7] imperfect sequences [11] total 14 [2025-01-08 22:48:57,202 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2135996344] [2025-01-08 22:48:57,202 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-01-08 22:48:57,202 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 7 states [2025-01-08 22:48:57,202 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy FOX [2025-01-08 22:48:57,202 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2025-01-08 22:48:57,202 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=34, Invalid=148, Unknown=0, NotChecked=0, Total=182 [2025-01-08 22:48:57,203 INFO L87 Difference]: Start difference. First operand 107 states and 159 transitions. Second operand has 7 states, 7 states have (on average 4.0) internal successors, (28), 6 states have internal predecessors, (28), 2 states have call successors, (4), 2 states have call predecessors, (4), 2 states have return successors, (3), 2 states have call predecessors, (3), 1 states have call successors, (3) [2025-01-08 22:48:57,370 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-01-08 22:48:57,370 INFO L93 Difference]: Finished difference Result 225 states and 335 transitions. [2025-01-08 22:48:57,374 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2025-01-08 22:48:57,374 INFO L78 Accepts]: Start accepts. Automaton has has 7 states, 7 states have (on average 4.0) internal successors, (28), 6 states have internal predecessors, (28), 2 states have call successors, (4), 2 states have call predecessors, (4), 2 states have return successors, (3), 2 states have call predecessors, (3), 1 states have call successors, (3) Word has length 39 [2025-01-08 22:48:57,374 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-01-08 22:48:57,375 INFO L225 Difference]: With dead ends: 225 [2025-01-08 22:48:57,375 INFO L226 Difference]: Without dead ends: 170 [2025-01-08 22:48:57,375 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 77 GetRequests, 64 SyntacticMatches, 0 SemanticMatches, 13 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 16 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=38, Invalid=172, Unknown=0, NotChecked=0, Total=210 [2025-01-08 22:48:57,376 INFO L435 NwaCegarLoop]: 73 mSDtfsCounter, 37 mSDsluCounter, 346 mSDsCounter, 0 mSdLazyCounter, 159 mSolverCounterSat, 3 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 41 SdHoareTripleChecker+Valid, 419 SdHoareTripleChecker+Invalid, 162 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 3 IncrementalHoareTripleChecker+Valid, 159 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2025-01-08 22:48:57,376 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [41 Valid, 419 Invalid, 162 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [3 Valid, 159 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2025-01-08 22:48:57,376 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 170 states. [2025-01-08 22:48:57,383 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 170 to 128. [2025-01-08 22:48:57,384 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 128 states, 110 states have (on average 1.3454545454545455) internal successors, (148), 111 states have internal predecessors, (148), 12 states have call successors, (12), 2 states have call predecessors, (12), 5 states have return successors, (23), 16 states have call predecessors, (23), 11 states have call successors, (23) [2025-01-08 22:48:57,384 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 128 states to 128 states and 183 transitions. [2025-01-08 22:48:57,385 INFO L78 Accepts]: Start accepts. Automaton has 128 states and 183 transitions. Word has length 39 [2025-01-08 22:48:57,385 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-01-08 22:48:57,385 INFO L471 AbstractCegarLoop]: Abstraction has 128 states and 183 transitions. [2025-01-08 22:48:57,385 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 7 states, 7 states have (on average 4.0) internal successors, (28), 6 states have internal predecessors, (28), 2 states have call successors, (4), 2 states have call predecessors, (4), 2 states have return successors, (3), 2 states have call predecessors, (3), 1 states have call successors, (3) [2025-01-08 22:48:57,385 INFO L276 IsEmpty]: Start isEmpty. Operand 128 states and 183 transitions. [2025-01-08 22:48:57,386 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 40 [2025-01-08 22:48:57,386 INFO L210 NwaCegarLoop]: Found error trace [2025-01-08 22:48:57,386 INFO L218 NwaCegarLoop]: trace histogram [3, 3, 3, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-01-08 22:48:57,392 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (5)] Ended with exit code 0 [2025-01-08 22:48:57,590 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 5 /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-01-08 22:48:57,590 INFO L396 AbstractCegarLoop]: === Iteration 5 === Targeting __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-01-08 22:48:57,591 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-01-08 22:48:57,591 INFO L85 PathProgramCache]: Analyzing trace with hash -421503785, now seen corresponding path program 1 times [2025-01-08 22:48:57,591 INFO L118 FreeRefinementEngine]: Executing refinement strategy FOX [2025-01-08 22:48:57,591 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleZ3 [293360815] [2025-01-08 22:48:57,591 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-01-08 22:48:57,591 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-01-08 22:48:57,591 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 [2025-01-08 22:48:57,594 INFO L229 MonitoredProcess]: Starting monitored process 6 with /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2025-01-08 22:48:57,595 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (6)] Waiting until timeout for monitored process [2025-01-08 22:48:57,634 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 39 statements into 1 equivalence classes. [2025-01-08 22:48:57,643 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 39 of 39 statements. [2025-01-08 22:48:57,643 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-01-08 22:48:57,643 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-01-08 22:48:57,645 INFO L256 TraceCheckSpWp]: Trace formula consists of 76 conjuncts, 7 conjuncts are in the unsatisfiable core [2025-01-08 22:48:57,646 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-01-08 22:48:57,685 INFO L134 CoverageAnalysis]: Checked inductivity of 15 backedges. 6 proven. 0 refuted. 0 times theorem prover too weak. 9 trivial. 0 not checked. [2025-01-08 22:48:57,685 INFO L308 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2025-01-08 22:48:57,685 INFO L136 FreeRefinementEngine]: Strategy FOX found an infeasible trace [2025-01-08 22:48:57,685 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [293360815] [2025-01-08 22:48:57,685 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [293360815] provided 1 perfect and 0 imperfect interpolant sequences [2025-01-08 22:48:57,685 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-01-08 22:48:57,685 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2025-01-08 22:48:57,685 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1097713900] [2025-01-08 22:48:57,686 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-01-08 22:48:57,686 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 7 states [2025-01-08 22:48:57,686 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy FOX [2025-01-08 22:48:57,686 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2025-01-08 22:48:57,686 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=11, Invalid=31, Unknown=0, NotChecked=0, Total=42 [2025-01-08 22:48:57,686 INFO L87 Difference]: Start difference. First operand 128 states and 183 transitions. Second operand has 7 states, 7 states have (on average 4.0) internal successors, (28), 6 states have internal predecessors, (28), 2 states have call successors, (4), 2 states have call predecessors, (4), 2 states have return successors, (3), 2 states have call predecessors, (3), 1 states have call successors, (3) [2025-01-08 22:48:57,764 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-01-08 22:48:57,764 INFO L93 Difference]: Finished difference Result 227 states and 333 transitions. [2025-01-08 22:48:57,764 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2025-01-08 22:48:57,764 INFO L78 Accepts]: Start accepts. Automaton has has 7 states, 7 states have (on average 4.0) internal successors, (28), 6 states have internal predecessors, (28), 2 states have call successors, (4), 2 states have call predecessors, (4), 2 states have return successors, (3), 2 states have call predecessors, (3), 1 states have call successors, (3) Word has length 39 [2025-01-08 22:48:57,765 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-01-08 22:48:57,765 INFO L225 Difference]: With dead ends: 227 [2025-01-08 22:48:57,767 INFO L226 Difference]: Without dead ends: 166 [2025-01-08 22:48:57,767 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 39 GetRequests, 33 SyntacticMatches, 0 SemanticMatches, 6 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=15, Invalid=41, Unknown=0, NotChecked=0, Total=56 [2025-01-08 22:48:57,768 INFO L435 NwaCegarLoop]: 84 mSDtfsCounter, 31 mSDsluCounter, 409 mSDsCounter, 0 mSdLazyCounter, 87 mSolverCounterSat, 4 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 33 SdHoareTripleChecker+Valid, 493 SdHoareTripleChecker+Invalid, 91 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 4 IncrementalHoareTripleChecker+Valid, 87 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2025-01-08 22:48:57,768 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [33 Valid, 493 Invalid, 91 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [4 Valid, 87 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2025-01-08 22:48:57,768 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 166 states. [2025-01-08 22:48:57,779 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 166 to 164. [2025-01-08 22:48:57,782 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 164 states, 142 states have (on average 1.352112676056338) internal successors, (192), 145 states have internal predecessors, (192), 16 states have call successors, (16), 2 states have call predecessors, (16), 5 states have return successors, (27), 20 states have call predecessors, (27), 15 states have call successors, (27) [2025-01-08 22:48:57,783 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 164 states to 164 states and 235 transitions. [2025-01-08 22:48:57,784 INFO L78 Accepts]: Start accepts. Automaton has 164 states and 235 transitions. Word has length 39 [2025-01-08 22:48:57,785 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-01-08 22:48:57,785 INFO L471 AbstractCegarLoop]: Abstraction has 164 states and 235 transitions. [2025-01-08 22:48:57,785 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 7 states, 7 states have (on average 4.0) internal successors, (28), 6 states have internal predecessors, (28), 2 states have call successors, (4), 2 states have call predecessors, (4), 2 states have return successors, (3), 2 states have call predecessors, (3), 1 states have call successors, (3) [2025-01-08 22:48:57,785 INFO L276 IsEmpty]: Start isEmpty. Operand 164 states and 235 transitions. [2025-01-08 22:48:57,786 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 43 [2025-01-08 22:48:57,786 INFO L210 NwaCegarLoop]: Found error trace [2025-01-08 22:48:57,786 INFO L218 NwaCegarLoop]: trace histogram [3, 3, 3, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-01-08 22:48:57,792 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (6)] Forceful destruction successful, exit code 0 [2025-01-08 22:48:57,990 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 6 /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-01-08 22:48:57,990 INFO L396 AbstractCegarLoop]: === Iteration 6 === Targeting __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-01-08 22:48:57,991 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-01-08 22:48:57,991 INFO L85 PathProgramCache]: Analyzing trace with hash -1671505519, now seen corresponding path program 2 times [2025-01-08 22:48:57,991 INFO L118 FreeRefinementEngine]: Executing refinement strategy FOX [2025-01-08 22:48:57,991 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleZ3 [268477743] [2025-01-08 22:48:57,991 INFO L95 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST1 [2025-01-08 22:48:57,991 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-01-08 22:48:57,991 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 [2025-01-08 22:48:57,993 INFO L229 MonitoredProcess]: Starting monitored process 7 with /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2025-01-08 22:48:57,995 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (7)] Waiting until timeout for monitored process [2025-01-08 22:48:58,024 INFO L108 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 partitioned 42 statements into 2 equivalence classes. [2025-01-08 22:48:58,031 INFO L111 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 issued 1 check-sat command(s) and asserted 25 of 42 statements. [2025-01-08 22:48:58,031 INFO L114 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 issued 1 check-sat command(s) [2025-01-08 22:48:58,032 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-01-08 22:48:58,033 INFO L256 TraceCheckSpWp]: Trace formula consists of 55 conjuncts, 12 conjuncts are in the unsatisfiable core [2025-01-08 22:48:58,035 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-01-08 22:48:58,149 INFO L134 CoverageAnalysis]: Checked inductivity of 18 backedges. 6 proven. 0 refuted. 0 times theorem prover too weak. 12 trivial. 0 not checked. [2025-01-08 22:48:58,150 INFO L308 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2025-01-08 22:48:58,150 INFO L136 FreeRefinementEngine]: Strategy FOX found an infeasible trace [2025-01-08 22:48:58,150 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [268477743] [2025-01-08 22:48:58,150 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [268477743] provided 1 perfect and 0 imperfect interpolant sequences [2025-01-08 22:48:58,150 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-01-08 22:48:58,150 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [11] imperfect sequences [] total 11 [2025-01-08 22:48:58,150 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [321810310] [2025-01-08 22:48:58,150 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-01-08 22:48:58,150 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 11 states [2025-01-08 22:48:58,150 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy FOX [2025-01-08 22:48:58,157 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 11 interpolants. [2025-01-08 22:48:58,157 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=19, Invalid=91, Unknown=0, NotChecked=0, Total=110 [2025-01-08 22:48:58,157 INFO L87 Difference]: Start difference. First operand 164 states and 235 transitions. Second operand has 11 states, 10 states have (on average 2.8) internal successors, (28), 9 states have internal predecessors, (28), 2 states have call successors, (4), 2 states have call predecessors, (4), 2 states have return successors, (3), 2 states have call predecessors, (3), 1 states have call successors, (3) [2025-01-08 22:48:58,376 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-01-08 22:48:58,377 INFO L93 Difference]: Finished difference Result 284 states and 411 transitions. [2025-01-08 22:48:58,377 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 12 states. [2025-01-08 22:48:58,377 INFO L78 Accepts]: Start accepts. Automaton has has 11 states, 10 states have (on average 2.8) internal successors, (28), 9 states have internal predecessors, (28), 2 states have call successors, (4), 2 states have call predecessors, (4), 2 states have return successors, (3), 2 states have call predecessors, (3), 1 states have call successors, (3) Word has length 42 [2025-01-08 22:48:58,377 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-01-08 22:48:58,378 INFO L225 Difference]: With dead ends: 284 [2025-01-08 22:48:58,378 INFO L226 Difference]: Without dead ends: 239 [2025-01-08 22:48:58,379 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 46 GetRequests, 32 SyntacticMatches, 0 SemanticMatches, 14 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 7 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=44, Invalid=196, Unknown=0, NotChecked=0, Total=240 [2025-01-08 22:48:58,379 INFO L435 NwaCegarLoop]: 128 mSDtfsCounter, 58 mSDsluCounter, 1073 mSDsCounter, 0 mSdLazyCounter, 243 mSolverCounterSat, 9 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 60 SdHoareTripleChecker+Valid, 1201 SdHoareTripleChecker+Invalid, 252 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 9 IncrementalHoareTripleChecker+Valid, 243 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.2s IncrementalHoareTripleChecker+Time [2025-01-08 22:48:58,379 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [60 Valid, 1201 Invalid, 252 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [9 Valid, 243 Invalid, 0 Unknown, 0 Unchecked, 0.2s Time] [2025-01-08 22:48:58,380 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 239 states. [2025-01-08 22:48:58,392 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 239 to 236. [2025-01-08 22:48:58,396 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 236 states, 207 states have (on average 1.3526570048309179) internal successors, (280), 209 states have internal predecessors, (280), 22 states have call successors, (22), 3 states have call predecessors, (22), 6 states have return successors, (33), 29 states have call predecessors, (33), 21 states have call successors, (33) [2025-01-08 22:48:58,397 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 236 states to 236 states and 335 transitions. [2025-01-08 22:48:58,397 INFO L78 Accepts]: Start accepts. Automaton has 236 states and 335 transitions. Word has length 42 [2025-01-08 22:48:58,397 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-01-08 22:48:58,397 INFO L471 AbstractCegarLoop]: Abstraction has 236 states and 335 transitions. [2025-01-08 22:48:58,398 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 11 states, 10 states have (on average 2.8) internal successors, (28), 9 states have internal predecessors, (28), 2 states have call successors, (4), 2 states have call predecessors, (4), 2 states have return successors, (3), 2 states have call predecessors, (3), 1 states have call successors, (3) [2025-01-08 22:48:58,398 INFO L276 IsEmpty]: Start isEmpty. Operand 236 states and 335 transitions. [2025-01-08 22:48:58,399 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 43 [2025-01-08 22:48:58,399 INFO L210 NwaCegarLoop]: Found error trace [2025-01-08 22:48:58,399 INFO L218 NwaCegarLoop]: trace histogram [3, 3, 3, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-01-08 22:48:58,405 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (7)] Ended with exit code 0 [2025-01-08 22:48:58,599 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 7 /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-01-08 22:48:58,599 INFO L396 AbstractCegarLoop]: === Iteration 7 === Targeting __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-01-08 22:48:58,600 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-01-08 22:48:58,600 INFO L85 PathProgramCache]: Analyzing trace with hash -752948787, now seen corresponding path program 1 times [2025-01-08 22:48:58,600 INFO L118 FreeRefinementEngine]: Executing refinement strategy FOX [2025-01-08 22:48:58,600 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleZ3 [1131784539] [2025-01-08 22:48:58,600 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-01-08 22:48:58,600 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-01-08 22:48:58,601 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 [2025-01-08 22:48:58,602 INFO L229 MonitoredProcess]: Starting monitored process 8 with /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2025-01-08 22:48:58,604 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (8)] Waiting until timeout for monitored process [2025-01-08 22:48:58,639 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 42 statements into 1 equivalence classes. [2025-01-08 22:48:58,648 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 42 of 42 statements. [2025-01-08 22:48:58,648 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-01-08 22:48:58,648 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-01-08 22:48:58,649 INFO L256 TraceCheckSpWp]: Trace formula consists of 83 conjuncts, 7 conjuncts are in the unsatisfiable core [2025-01-08 22:48:58,650 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-01-08 22:48:58,698 INFO L134 CoverageAnalysis]: Checked inductivity of 17 backedges. 3 proven. 3 refuted. 0 times theorem prover too weak. 11 trivial. 0 not checked. [2025-01-08 22:48:58,698 INFO L312 TraceCheckSpWp]: Computing backward predicates... [2025-01-08 22:48:58,730 INFO L134 CoverageAnalysis]: Checked inductivity of 17 backedges. 3 proven. 3 refuted. 0 times theorem prover too weak. 11 trivial. 0 not checked. [2025-01-08 22:48:58,731 INFO L136 FreeRefinementEngine]: Strategy FOX found an infeasible trace [2025-01-08 22:48:58,731 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1131784539] [2025-01-08 22:48:58,731 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1131784539] provided 0 perfect and 2 imperfect interpolant sequences [2025-01-08 22:48:58,731 INFO L185 FreeRefinementEngine]: Found 0 perfect and 2 imperfect interpolant sequences. [2025-01-08 22:48:58,731 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [7, 7] total 7 [2025-01-08 22:48:58,731 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1480550584] [2025-01-08 22:48:58,731 INFO L85 oduleStraightlineAll]: Using 2 imperfect interpolants to construct interpolant automaton [2025-01-08 22:48:58,731 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 7 states [2025-01-08 22:48:58,731 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy FOX [2025-01-08 22:48:58,731 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2025-01-08 22:48:58,731 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=11, Invalid=31, Unknown=0, NotChecked=0, Total=42 [2025-01-08 22:48:58,732 INFO L87 Difference]: Start difference. First operand 236 states and 335 transitions. Second operand has 7 states, 7 states have (on average 4.142857142857143) internal successors, (29), 6 states have internal predecessors, (29), 3 states have call successors, (4), 2 states have call predecessors, (4), 2 states have return successors, (3), 3 states have call predecessors, (3), 2 states have call successors, (3) [2025-01-08 22:48:58,823 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-01-08 22:48:58,823 INFO L93 Difference]: Finished difference Result 413 states and 602 transitions. [2025-01-08 22:48:58,824 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2025-01-08 22:48:58,824 INFO L78 Accepts]: Start accepts. Automaton has has 7 states, 7 states have (on average 4.142857142857143) internal successors, (29), 6 states have internal predecessors, (29), 3 states have call successors, (4), 2 states have call predecessors, (4), 2 states have return successors, (3), 3 states have call predecessors, (3), 2 states have call successors, (3) Word has length 42 [2025-01-08 22:48:58,824 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-01-08 22:48:58,826 INFO L225 Difference]: With dead ends: 413 [2025-01-08 22:48:58,826 INFO L226 Difference]: Without dead ends: 327 [2025-01-08 22:48:58,826 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 83 GetRequests, 77 SyntacticMatches, 0 SemanticMatches, 6 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=15, Invalid=41, Unknown=0, NotChecked=0, Total=56 [2025-01-08 22:48:58,827 INFO L435 NwaCegarLoop]: 132 mSDtfsCounter, 46 mSDsluCounter, 596 mSDsCounter, 0 mSdLazyCounter, 104 mSolverCounterSat, 6 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 48 SdHoareTripleChecker+Valid, 728 SdHoareTripleChecker+Invalid, 110 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 6 IncrementalHoareTripleChecker+Valid, 104 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2025-01-08 22:48:58,827 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [48 Valid, 728 Invalid, 110 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [6 Valid, 104 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2025-01-08 22:48:58,827 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 327 states. [2025-01-08 22:48:58,840 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 327 to 323. [2025-01-08 22:48:58,840 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 323 states, 284 states have (on average 1.3556338028169015) internal successors, (385), 289 states have internal predecessors, (385), 32 states have call successors, (32), 3 states have call predecessors, (32), 6 states have return successors, (43), 39 states have call predecessors, (43), 31 states have call successors, (43) [2025-01-08 22:48:58,842 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 323 states to 323 states and 460 transitions. [2025-01-08 22:48:58,842 INFO L78 Accepts]: Start accepts. Automaton has 323 states and 460 transitions. Word has length 42 [2025-01-08 22:48:58,842 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-01-08 22:48:58,843 INFO L471 AbstractCegarLoop]: Abstraction has 323 states and 460 transitions. [2025-01-08 22:48:58,843 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 7 states, 7 states have (on average 4.142857142857143) internal successors, (29), 6 states have internal predecessors, (29), 3 states have call successors, (4), 2 states have call predecessors, (4), 2 states have return successors, (3), 3 states have call predecessors, (3), 2 states have call successors, (3) [2025-01-08 22:48:58,843 INFO L276 IsEmpty]: Start isEmpty. Operand 323 states and 460 transitions. [2025-01-08 22:48:58,847 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 43 [2025-01-08 22:48:58,847 INFO L210 NwaCegarLoop]: Found error trace [2025-01-08 22:48:58,847 INFO L218 NwaCegarLoop]: trace histogram [3, 3, 3, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-01-08 22:48:58,857 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (8)] Ended with exit code 0 [2025-01-08 22:48:59,047 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 8 /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-01-08 22:48:59,048 INFO L396 AbstractCegarLoop]: === Iteration 8 === Targeting __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-01-08 22:48:59,048 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-01-08 22:48:59,049 INFO L85 PathProgramCache]: Analyzing trace with hash -695690485, now seen corresponding path program 1 times [2025-01-08 22:48:59,049 INFO L118 FreeRefinementEngine]: Executing refinement strategy FOX [2025-01-08 22:48:59,049 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleZ3 [1538139565] [2025-01-08 22:48:59,049 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-01-08 22:48:59,049 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-01-08 22:48:59,049 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 [2025-01-08 22:48:59,051 INFO L229 MonitoredProcess]: Starting monitored process 9 with /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2025-01-08 22:48:59,052 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (9)] Waiting until timeout for monitored process [2025-01-08 22:48:59,081 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 42 statements into 1 equivalence classes. [2025-01-08 22:48:59,091 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 42 of 42 statements. [2025-01-08 22:48:59,091 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-01-08 22:48:59,091 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-01-08 22:48:59,092 INFO L256 TraceCheckSpWp]: Trace formula consists of 80 conjuncts, 11 conjuncts are in the unsatisfiable core [2025-01-08 22:48:59,093 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-01-08 22:48:59,236 INFO L134 CoverageAnalysis]: Checked inductivity of 17 backedges. 3 proven. 3 refuted. 0 times theorem prover too weak. 11 trivial. 0 not checked. [2025-01-08 22:48:59,237 INFO L312 TraceCheckSpWp]: Computing backward predicates... [2025-01-08 22:48:59,430 INFO L136 FreeRefinementEngine]: Strategy FOX found an infeasible trace [2025-01-08 22:48:59,431 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1538139565] [2025-01-08 22:48:59,431 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1538139565] provided 0 perfect and 1 imperfect interpolant sequences [2025-01-08 22:48:59,431 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleCvc4 [636835000] [2025-01-08 22:48:59,431 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-01-08 22:48:59,431 INFO L173 SolverBuilder]: Constructing external solver with command: cvc4 --incremental --print-success --lang smt [2025-01-08 22:48:59,431 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/cvc4 [2025-01-08 22:48:59,436 INFO L229 MonitoredProcess]: Starting monitored process 10 with /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/cvc4 --incremental --print-success --lang smt (exit command is (exit), workingDir is null) [2025-01-08 22:48:59,437 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/cvc4 --incremental --print-success --lang smt (10)] Waiting until timeout for monitored process [2025-01-08 22:48:59,499 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 42 statements into 1 equivalence classes. [2025-01-08 22:48:59,529 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 42 of 42 statements. [2025-01-08 22:48:59,529 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-01-08 22:48:59,529 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-01-08 22:48:59,530 INFO L256 TraceCheckSpWp]: Trace formula consists of 80 conjuncts, 11 conjuncts are in the unsatisfiable core [2025-01-08 22:48:59,531 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-01-08 22:48:59,580 INFO L134 CoverageAnalysis]: Checked inductivity of 17 backedges. 3 proven. 3 refuted. 0 times theorem prover too weak. 11 trivial. 0 not checked. [2025-01-08 22:48:59,580 INFO L312 TraceCheckSpWp]: Computing backward predicates... [2025-01-08 22:48:59,612 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleCvc4 [636835000] provided 0 perfect and 1 imperfect interpolant sequences [2025-01-08 22:48:59,612 INFO L185 FreeRefinementEngine]: Found 0 perfect and 2 imperfect interpolant sequences. [2025-01-08 22:48:59,612 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [10, 10] total 10 [2025-01-08 22:48:59,612 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2109163842] [2025-01-08 22:48:59,612 INFO L85 oduleStraightlineAll]: Using 2 imperfect interpolants to construct interpolant automaton [2025-01-08 22:48:59,612 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 10 states [2025-01-08 22:48:59,612 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy FOX [2025-01-08 22:48:59,613 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 10 interpolants. [2025-01-08 22:48:59,613 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=32, Invalid=178, Unknown=0, NotChecked=0, Total=210 [2025-01-08 22:48:59,613 INFO L87 Difference]: Start difference. First operand 323 states and 460 transitions. Second operand has 10 states, 9 states have (on average 3.2222222222222223) internal successors, (29), 8 states have internal predecessors, (29), 3 states have call successors, (4), 2 states have call predecessors, (4), 2 states have return successors, (3), 3 states have call predecessors, (3), 2 states have call successors, (3) [2025-01-08 22:48:59,785 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-01-08 22:48:59,785 INFO L93 Difference]: Finished difference Result 337 states and 472 transitions. [2025-01-08 22:48:59,785 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 10 states. [2025-01-08 22:48:59,786 INFO L78 Accepts]: Start accepts. Automaton has has 10 states, 9 states have (on average 3.2222222222222223) internal successors, (29), 8 states have internal predecessors, (29), 3 states have call successors, (4), 2 states have call predecessors, (4), 2 states have return successors, (3), 3 states have call predecessors, (3), 2 states have call successors, (3) Word has length 42 [2025-01-08 22:48:59,786 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-01-08 22:48:59,787 INFO L225 Difference]: With dead ends: 337 [2025-01-08 22:48:59,787 INFO L226 Difference]: Without dead ends: 335 [2025-01-08 22:48:59,788 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 115 GetRequests, 98 SyntacticMatches, 1 SemanticMatches, 16 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 15 ImplicationChecksByTransitivity, 0.3s TimeCoverageRelationStatistics Valid=53, Invalid=253, Unknown=0, NotChecked=0, Total=306 [2025-01-08 22:48:59,788 INFO L435 NwaCegarLoop]: 124 mSDtfsCounter, 48 mSDsluCounter, 923 mSDsCounter, 0 mSdLazyCounter, 194 mSolverCounterSat, 5 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 50 SdHoareTripleChecker+Valid, 1047 SdHoareTripleChecker+Invalid, 199 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 5 IncrementalHoareTripleChecker+Valid, 194 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2025-01-08 22:48:59,788 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [50 Valid, 1047 Invalid, 199 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [5 Valid, 194 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2025-01-08 22:48:59,789 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 335 states. [2025-01-08 22:48:59,798 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 335 to 331. [2025-01-08 22:48:59,798 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 331 states, 290 states have (on average 1.3482758620689654) internal successors, (391), 295 states have internal predecessors, (391), 32 states have call successors, (32), 5 states have call predecessors, (32), 8 states have return successors, (43), 39 states have call predecessors, (43), 31 states have call successors, (43) [2025-01-08 22:48:59,800 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 331 states to 331 states and 466 transitions. [2025-01-08 22:48:59,800 INFO L78 Accepts]: Start accepts. Automaton has 331 states and 466 transitions. Word has length 42 [2025-01-08 22:48:59,800 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-01-08 22:48:59,800 INFO L471 AbstractCegarLoop]: Abstraction has 331 states and 466 transitions. [2025-01-08 22:48:59,800 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 10 states, 9 states have (on average 3.2222222222222223) internal successors, (29), 8 states have internal predecessors, (29), 3 states have call successors, (4), 2 states have call predecessors, (4), 2 states have return successors, (3), 3 states have call predecessors, (3), 2 states have call successors, (3) [2025-01-08 22:48:59,800 INFO L276 IsEmpty]: Start isEmpty. Operand 331 states and 466 transitions. [2025-01-08 22:48:59,801 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 43 [2025-01-08 22:48:59,801 INFO L210 NwaCegarLoop]: Found error trace [2025-01-08 22:48:59,801 INFO L218 NwaCegarLoop]: trace histogram [3, 3, 3, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-01-08 22:48:59,807 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/cvc4 --incremental --print-success --lang smt (10)] Forceful destruction successful, exit code 0 [2025-01-08 22:49:00,009 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (9)] Ended with exit code 0 [2025-01-08 22:49:00,204 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 10 /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/cvc4 --incremental --print-success --lang smt,9 /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-01-08 22:49:00,204 INFO L396 AbstractCegarLoop]: === Iteration 9 === Targeting __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-01-08 22:49:00,204 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-01-08 22:49:00,204 INFO L85 PathProgramCache]: Analyzing trace with hash -895164663, now seen corresponding path program 1 times [2025-01-08 22:49:00,205 INFO L118 FreeRefinementEngine]: Executing refinement strategy FOX [2025-01-08 22:49:00,205 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleZ3 [73293957] [2025-01-08 22:49:00,205 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-01-08 22:49:00,205 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-01-08 22:49:00,205 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 [2025-01-08 22:49:00,207 INFO L229 MonitoredProcess]: Starting monitored process 11 with /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2025-01-08 22:49:00,208 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (11)] Waiting until timeout for monitored process [2025-01-08 22:49:00,238 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 42 statements into 1 equivalence classes. [2025-01-08 22:49:00,249 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 42 of 42 statements. [2025-01-08 22:49:00,250 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-01-08 22:49:00,250 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-01-08 22:49:00,250 INFO L256 TraceCheckSpWp]: Trace formula consists of 84 conjuncts, 9 conjuncts are in the unsatisfiable core [2025-01-08 22:49:00,252 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-01-08 22:49:00,328 INFO L134 CoverageAnalysis]: Checked inductivity of 18 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 18 trivial. 0 not checked. [2025-01-08 22:49:00,328 INFO L308 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2025-01-08 22:49:00,329 INFO L136 FreeRefinementEngine]: Strategy FOX found an infeasible trace [2025-01-08 22:49:00,329 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [73293957] [2025-01-08 22:49:00,329 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [73293957] provided 1 perfect and 0 imperfect interpolant sequences [2025-01-08 22:49:00,329 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-01-08 22:49:00,329 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2025-01-08 22:49:00,329 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2050027132] [2025-01-08 22:49:00,329 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-01-08 22:49:00,329 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2025-01-08 22:49:00,329 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy FOX [2025-01-08 22:49:00,329 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2025-01-08 22:49:00,329 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=9, Invalid=21, Unknown=0, NotChecked=0, Total=30 [2025-01-08 22:49:00,329 INFO L87 Difference]: Start difference. First operand 331 states and 466 transitions. Second operand has 6 states, 5 states have (on average 5.0) internal successors, (25), 5 states have internal predecessors, (25), 2 states have call successors, (4), 2 states have call predecessors, (4), 1 states have return successors, (3), 1 states have call predecessors, (3), 1 states have call successors, (3) [2025-01-08 22:49:00,397 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-01-08 22:49:00,397 INFO L93 Difference]: Finished difference Result 347 states and 483 transitions. [2025-01-08 22:49:00,398 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2025-01-08 22:49:00,398 INFO L78 Accepts]: Start accepts. Automaton has has 6 states, 5 states have (on average 5.0) internal successors, (25), 5 states have internal predecessors, (25), 2 states have call successors, (4), 2 states have call predecessors, (4), 1 states have return successors, (3), 1 states have call predecessors, (3), 1 states have call successors, (3) Word has length 42 [2025-01-08 22:49:00,398 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-01-08 22:49:00,399 INFO L225 Difference]: With dead ends: 347 [2025-01-08 22:49:00,399 INFO L226 Difference]: Without dead ends: 345 [2025-01-08 22:49:00,400 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 42 GetRequests, 37 SyntacticMatches, 0 SemanticMatches, 5 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=13, Invalid=29, Unknown=0, NotChecked=0, Total=42 [2025-01-08 22:49:00,400 INFO L435 NwaCegarLoop]: 99 mSDtfsCounter, 3 mSDsluCounter, 371 mSDsCounter, 0 mSdLazyCounter, 47 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 4 SdHoareTripleChecker+Valid, 470 SdHoareTripleChecker+Invalid, 47 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 47 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2025-01-08 22:49:00,400 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [4 Valid, 470 Invalid, 47 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 47 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2025-01-08 22:49:00,400 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 345 states. [2025-01-08 22:49:00,412 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 345 to 337. [2025-01-08 22:49:00,413 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 337 states, 294 states have (on average 1.346938775510204) internal successors, (396), 300 states have internal predecessors, (396), 33 states have call successors, (33), 6 states have call predecessors, (33), 9 states have return successors, (44), 39 states have call predecessors, (44), 32 states have call successors, (44) [2025-01-08 22:49:00,414 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 337 states to 337 states and 473 transitions. [2025-01-08 22:49:00,415 INFO L78 Accepts]: Start accepts. Automaton has 337 states and 473 transitions. Word has length 42 [2025-01-08 22:49:00,415 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-01-08 22:49:00,415 INFO L471 AbstractCegarLoop]: Abstraction has 337 states and 473 transitions. [2025-01-08 22:49:00,415 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 5 states have (on average 5.0) internal successors, (25), 5 states have internal predecessors, (25), 2 states have call successors, (4), 2 states have call predecessors, (4), 1 states have return successors, (3), 1 states have call predecessors, (3), 1 states have call successors, (3) [2025-01-08 22:49:00,415 INFO L276 IsEmpty]: Start isEmpty. Operand 337 states and 473 transitions. [2025-01-08 22:49:00,416 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 43 [2025-01-08 22:49:00,416 INFO L210 NwaCegarLoop]: Found error trace [2025-01-08 22:49:00,416 INFO L218 NwaCegarLoop]: trace histogram [3, 3, 3, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-01-08 22:49:00,422 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (11)] Forceful destruction successful, exit code 0 [2025-01-08 22:49:00,616 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 11 /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-01-08 22:49:00,617 INFO L396 AbstractCegarLoop]: === Iteration 10 === Targeting __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-01-08 22:49:00,617 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-01-08 22:49:00,617 INFO L85 PathProgramCache]: Analyzing trace with hash -837906361, now seen corresponding path program 1 times [2025-01-08 22:49:00,617 INFO L118 FreeRefinementEngine]: Executing refinement strategy FOX [2025-01-08 22:49:00,617 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleZ3 [809688848] [2025-01-08 22:49:00,617 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-01-08 22:49:00,618 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-01-08 22:49:00,618 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 [2025-01-08 22:49:00,619 INFO L229 MonitoredProcess]: Starting monitored process 12 with /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2025-01-08 22:49:00,621 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (12)] Waiting until timeout for monitored process [2025-01-08 22:49:00,646 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 42 statements into 1 equivalence classes. [2025-01-08 22:49:00,656 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 42 of 42 statements. [2025-01-08 22:49:00,656 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-01-08 22:49:00,656 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-01-08 22:49:00,658 INFO L256 TraceCheckSpWp]: Trace formula consists of 81 conjuncts, 6 conjuncts are in the unsatisfiable core [2025-01-08 22:49:00,659 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-01-08 22:49:00,710 INFO L134 CoverageAnalysis]: Checked inductivity of 18 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 18 trivial. 0 not checked. [2025-01-08 22:49:00,710 INFO L308 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2025-01-08 22:49:00,710 INFO L136 FreeRefinementEngine]: Strategy FOX found an infeasible trace [2025-01-08 22:49:00,710 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [809688848] [2025-01-08 22:49:00,711 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [809688848] provided 1 perfect and 0 imperfect interpolant sequences [2025-01-08 22:49:00,711 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-01-08 22:49:00,711 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2025-01-08 22:49:00,711 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1565832477] [2025-01-08 22:49:00,711 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-01-08 22:49:00,711 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2025-01-08 22:49:00,711 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy FOX [2025-01-08 22:49:00,711 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2025-01-08 22:49:00,712 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=9, Invalid=21, Unknown=0, NotChecked=0, Total=30 [2025-01-08 22:49:00,712 INFO L87 Difference]: Start difference. First operand 337 states and 473 transitions. Second operand has 6 states, 5 states have (on average 5.0) internal successors, (25), 5 states have internal predecessors, (25), 2 states have call successors, (4), 2 states have call predecessors, (4), 1 states have return successors, (3), 1 states have call predecessors, (3), 1 states have call successors, (3) [2025-01-08 22:49:00,769 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-01-08 22:49:00,769 INFO L93 Difference]: Finished difference Result 343 states and 478 transitions. [2025-01-08 22:49:00,769 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2025-01-08 22:49:00,770 INFO L78 Accepts]: Start accepts. Automaton has has 6 states, 5 states have (on average 5.0) internal successors, (25), 5 states have internal predecessors, (25), 2 states have call successors, (4), 2 states have call predecessors, (4), 1 states have return successors, (3), 1 states have call predecessors, (3), 1 states have call successors, (3) Word has length 42 [2025-01-08 22:49:00,770 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-01-08 22:49:00,771 INFO L225 Difference]: With dead ends: 343 [2025-01-08 22:49:00,771 INFO L226 Difference]: Without dead ends: 341 [2025-01-08 22:49:00,772 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 42 GetRequests, 37 SyntacticMatches, 0 SemanticMatches, 5 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=13, Invalid=29, Unknown=0, NotChecked=0, Total=42 [2025-01-08 22:49:00,772 INFO L435 NwaCegarLoop]: 94 mSDtfsCounter, 3 mSDsluCounter, 356 mSDsCounter, 0 mSdLazyCounter, 41 mSolverCounterSat, 1 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 4 SdHoareTripleChecker+Valid, 450 SdHoareTripleChecker+Invalid, 42 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 1 IncrementalHoareTripleChecker+Valid, 41 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2025-01-08 22:49:00,772 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [4 Valid, 450 Invalid, 42 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [1 Valid, 41 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2025-01-08 22:49:00,773 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 341 states. [2025-01-08 22:49:00,781 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 341 to 335. [2025-01-08 22:49:00,781 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 335 states, 293 states have (on average 1.3447098976109215) internal successors, (394), 298 states have internal predecessors, (394), 32 states have call successors, (32), 6 states have call predecessors, (32), 9 states have return successors, (43), 39 states have call predecessors, (43), 31 states have call successors, (43) [2025-01-08 22:49:00,782 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 335 states to 335 states and 469 transitions. [2025-01-08 22:49:00,783 INFO L78 Accepts]: Start accepts. Automaton has 335 states and 469 transitions. Word has length 42 [2025-01-08 22:49:00,783 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-01-08 22:49:00,783 INFO L471 AbstractCegarLoop]: Abstraction has 335 states and 469 transitions. [2025-01-08 22:49:00,783 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 5 states have (on average 5.0) internal successors, (25), 5 states have internal predecessors, (25), 2 states have call successors, (4), 2 states have call predecessors, (4), 1 states have return successors, (3), 1 states have call predecessors, (3), 1 states have call successors, (3) [2025-01-08 22:49:00,783 INFO L276 IsEmpty]: Start isEmpty. Operand 335 states and 469 transitions. [2025-01-08 22:49:00,783 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 44 [2025-01-08 22:49:00,784 INFO L210 NwaCegarLoop]: Found error trace [2025-01-08 22:49:00,784 INFO L218 NwaCegarLoop]: trace histogram [3, 3, 3, 3, 1, 1, 1, 1, 1, 1, 1, 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-01-08 22:49:00,789 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (12)] Forceful destruction successful, exit code 0 [2025-01-08 22:49:00,988 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 12 /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-01-08 22:49:00,988 INFO L396 AbstractCegarLoop]: === Iteration 11 === Targeting __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-01-08 22:49:00,988 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-01-08 22:49:00,989 INFO L85 PathProgramCache]: Analyzing trace with hash -449354911, now seen corresponding path program 1 times [2025-01-08 22:49:00,989 INFO L118 FreeRefinementEngine]: Executing refinement strategy FOX [2025-01-08 22:49:00,989 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleZ3 [1916351424] [2025-01-08 22:49:00,989 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-01-08 22:49:00,989 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-01-08 22:49:00,989 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 [2025-01-08 22:49:00,991 INFO L229 MonitoredProcess]: Starting monitored process 13 with /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2025-01-08 22:49:00,992 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (13)] Waiting until timeout for monitored process [2025-01-08 22:49:01,031 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 43 statements into 1 equivalence classes. [2025-01-08 22:49:01,040 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 43 of 43 statements. [2025-01-08 22:49:01,040 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-01-08 22:49:01,040 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-01-08 22:49:01,041 INFO L256 TraceCheckSpWp]: Trace formula consists of 78 conjuncts, 3 conjuncts are in the unsatisfiable core [2025-01-08 22:49:01,042 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-01-08 22:49:01,062 INFO L134 CoverageAnalysis]: Checked inductivity of 15 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 15 trivial. 0 not checked. [2025-01-08 22:49:01,063 INFO L308 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2025-01-08 22:49:01,063 INFO L136 FreeRefinementEngine]: Strategy FOX found an infeasible trace [2025-01-08 22:49:01,063 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1916351424] [2025-01-08 22:49:01,063 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1916351424] provided 1 perfect and 0 imperfect interpolant sequences [2025-01-08 22:49:01,063 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-01-08 22:49:01,063 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2025-01-08 22:49:01,063 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2119761347] [2025-01-08 22:49:01,063 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-01-08 22:49:01,063 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2025-01-08 22:49:01,063 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy FOX [2025-01-08 22:49:01,064 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2025-01-08 22:49:01,064 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2025-01-08 22:49:01,064 INFO L87 Difference]: Start difference. First operand 335 states and 469 transitions. Second operand has 4 states, 4 states have (on average 7.0) internal successors, (28), 4 states have internal predecessors, (28), 2 states have call successors, (4), 2 states have call predecessors, (4), 1 states have return successors, (3), 1 states have call predecessors, (3), 1 states have call successors, (3) [2025-01-08 22:49:01,083 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-01-08 22:49:01,083 INFO L93 Difference]: Finished difference Result 452 states and 645 transitions. [2025-01-08 22:49:01,083 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2025-01-08 22:49:01,083 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 4 states have (on average 7.0) internal successors, (28), 4 states have internal predecessors, (28), 2 states have call successors, (4), 2 states have call predecessors, (4), 1 states have return successors, (3), 1 states have call predecessors, (3), 1 states have call successors, (3) Word has length 43 [2025-01-08 22:49:01,083 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-01-08 22:49:01,084 INFO L225 Difference]: With dead ends: 452 [2025-01-08 22:49:01,084 INFO L226 Difference]: Without dead ends: 357 [2025-01-08 22:49:01,085 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 42 GetRequests, 40 SyntacticMatches, 0 SemanticMatches, 2 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2025-01-08 22:49:01,085 INFO L435 NwaCegarLoop]: 109 mSDtfsCounter, 14 mSDsluCounter, 199 mSDsCounter, 0 mSdLazyCounter, 14 mSolverCounterSat, 1 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 16 SdHoareTripleChecker+Valid, 308 SdHoareTripleChecker+Invalid, 15 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 1 IncrementalHoareTripleChecker+Valid, 14 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2025-01-08 22:49:01,085 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [16 Valid, 308 Invalid, 15 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [1 Valid, 14 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2025-01-08 22:49:01,085 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 357 states. [2025-01-08 22:49:01,118 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 357 to 357. [2025-01-08 22:49:01,122 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 357 states, 317 states have (on average 1.3059936908517351) internal successors, (414), 319 states have internal predecessors, (414), 30 states have call successors, (30), 6 states have call predecessors, (30), 9 states have return successors, (41), 37 states have call predecessors, (41), 29 states have call successors, (41) [2025-01-08 22:49:01,123 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 357 states to 357 states and 485 transitions. [2025-01-08 22:49:01,125 INFO L78 Accepts]: Start accepts. Automaton has 357 states and 485 transitions. Word has length 43 [2025-01-08 22:49:01,125 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-01-08 22:49:01,126 INFO L471 AbstractCegarLoop]: Abstraction has 357 states and 485 transitions. [2025-01-08 22:49:01,126 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 7.0) internal successors, (28), 4 states have internal predecessors, (28), 2 states have call successors, (4), 2 states have call predecessors, (4), 1 states have return successors, (3), 1 states have call predecessors, (3), 1 states have call successors, (3) [2025-01-08 22:49:01,126 INFO L276 IsEmpty]: Start isEmpty. Operand 357 states and 485 transitions. [2025-01-08 22:49:01,128 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 45 [2025-01-08 22:49:01,128 INFO L210 NwaCegarLoop]: Found error trace [2025-01-08 22:49:01,129 INFO L218 NwaCegarLoop]: trace histogram [3, 3, 3, 3, 1, 1, 1, 1, 1, 1, 1, 1, 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-01-08 22:49:01,137 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (13)] Forceful destruction successful, exit code 0 [2025-01-08 22:49:01,329 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 13 /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-01-08 22:49:01,330 INFO L396 AbstractCegarLoop]: === Iteration 12 === Targeting __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-01-08 22:49:01,330 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-01-08 22:49:01,330 INFO L85 PathProgramCache]: Analyzing trace with hash -1136916022, now seen corresponding path program 1 times [2025-01-08 22:49:01,330 INFO L118 FreeRefinementEngine]: Executing refinement strategy FOX [2025-01-08 22:49:01,330 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleZ3 [2008428636] [2025-01-08 22:49:01,331 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-01-08 22:49:01,331 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-01-08 22:49:01,331 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 [2025-01-08 22:49:01,333 INFO L229 MonitoredProcess]: Starting monitored process 14 with /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2025-01-08 22:49:01,334 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (14)] Waiting until timeout for monitored process [2025-01-08 22:49:01,360 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 44 statements into 1 equivalence classes. [2025-01-08 22:49:01,368 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 44 of 44 statements. [2025-01-08 22:49:01,368 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-01-08 22:49:01,368 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-01-08 22:49:01,370 INFO L256 TraceCheckSpWp]: Trace formula consists of 80 conjuncts, 3 conjuncts are in the unsatisfiable core [2025-01-08 22:49:01,371 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-01-08 22:49:01,383 INFO L134 CoverageAnalysis]: Checked inductivity of 15 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 15 trivial. 0 not checked. [2025-01-08 22:49:01,384 INFO L308 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2025-01-08 22:49:01,384 INFO L136 FreeRefinementEngine]: Strategy FOX found an infeasible trace [2025-01-08 22:49:01,384 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [2008428636] [2025-01-08 22:49:01,384 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [2008428636] provided 1 perfect and 0 imperfect interpolant sequences [2025-01-08 22:49:01,384 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-01-08 22:49:01,384 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2025-01-08 22:49:01,384 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [568622819] [2025-01-08 22:49:01,384 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-01-08 22:49:01,384 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2025-01-08 22:49:01,384 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy FOX [2025-01-08 22:49:01,385 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2025-01-08 22:49:01,385 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2025-01-08 22:49:01,385 INFO L87 Difference]: Start difference. First operand 357 states and 485 transitions. Second operand has 4 states, 4 states have (on average 7.25) internal successors, (29), 4 states have internal predecessors, (29), 2 states have call successors, (4), 2 states have call predecessors, (4), 1 states have return successors, (3), 1 states have call predecessors, (3), 1 states have call successors, (3) [2025-01-08 22:49:01,401 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-01-08 22:49:01,401 INFO L93 Difference]: Finished difference Result 370 states and 500 transitions. [2025-01-08 22:49:01,402 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2025-01-08 22:49:01,402 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 4 states have (on average 7.25) internal successors, (29), 4 states have internal predecessors, (29), 2 states have call successors, (4), 2 states have call predecessors, (4), 1 states have return successors, (3), 1 states have call predecessors, (3), 1 states have call successors, (3) Word has length 44 [2025-01-08 22:49:01,402 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-01-08 22:49:01,404 INFO L225 Difference]: With dead ends: 370 [2025-01-08 22:49:01,404 INFO L226 Difference]: Without dead ends: 363 [2025-01-08 22:49:01,404 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 43 GetRequests, 41 SyntacticMatches, 0 SemanticMatches, 2 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2025-01-08 22:49:01,404 INFO L435 NwaCegarLoop]: 95 mSDtfsCounter, 0 mSDsluCounter, 184 mSDsCounter, 0 mSdLazyCounter, 11 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 0 SdHoareTripleChecker+Valid, 279 SdHoareTripleChecker+Invalid, 11 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 11 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2025-01-08 22:49:01,404 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [0 Valid, 279 Invalid, 11 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 11 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2025-01-08 22:49:01,405 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 363 states. [2025-01-08 22:49:01,418 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 363 to 363. [2025-01-08 22:49:01,419 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 363 states, 323 states have (on average 1.3003095975232197) internal successors, (420), 325 states have internal predecessors, (420), 30 states have call successors, (30), 6 states have call predecessors, (30), 9 states have return successors, (41), 37 states have call predecessors, (41), 29 states have call successors, (41) [2025-01-08 22:49:01,421 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 363 states to 363 states and 491 transitions. [2025-01-08 22:49:01,422 INFO L78 Accepts]: Start accepts. Automaton has 363 states and 491 transitions. Word has length 44 [2025-01-08 22:49:01,422 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-01-08 22:49:01,422 INFO L471 AbstractCegarLoop]: Abstraction has 363 states and 491 transitions. [2025-01-08 22:49:01,422 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 7.25) internal successors, (29), 4 states have internal predecessors, (29), 2 states have call successors, (4), 2 states have call predecessors, (4), 1 states have return successors, (3), 1 states have call predecessors, (3), 1 states have call successors, (3) [2025-01-08 22:49:01,422 INFO L276 IsEmpty]: Start isEmpty. Operand 363 states and 491 transitions. [2025-01-08 22:49:01,423 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 45 [2025-01-08 22:49:01,423 INFO L210 NwaCegarLoop]: Found error trace [2025-01-08 22:49:01,423 INFO L218 NwaCegarLoop]: trace histogram [3, 3, 3, 3, 1, 1, 1, 1, 1, 1, 1, 1, 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-01-08 22:49:01,430 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (14)] Forceful destruction successful, exit code 0 [2025-01-08 22:49:01,624 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 14 /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-01-08 22:49:01,624 INFO L396 AbstractCegarLoop]: === Iteration 13 === Targeting __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-01-08 22:49:01,625 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-01-08 22:49:01,625 INFO L85 PathProgramCache]: Analyzing trace with hash 638091340, now seen corresponding path program 1 times [2025-01-08 22:49:01,625 INFO L118 FreeRefinementEngine]: Executing refinement strategy FOX [2025-01-08 22:49:01,625 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleZ3 [665679124] [2025-01-08 22:49:01,625 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-01-08 22:49:01,625 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-01-08 22:49:01,625 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 [2025-01-08 22:49:01,628 INFO L229 MonitoredProcess]: Starting monitored process 15 with /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2025-01-08 22:49:01,629 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (15)] Waiting until timeout for monitored process [2025-01-08 22:49:01,654 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 44 statements into 1 equivalence classes. [2025-01-08 22:49:01,662 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 44 of 44 statements. [2025-01-08 22:49:01,662 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-01-08 22:49:01,662 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-01-08 22:49:01,663 INFO L256 TraceCheckSpWp]: Trace formula consists of 80 conjuncts, 4 conjuncts are in the unsatisfiable core [2025-01-08 22:49:01,664 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-01-08 22:49:01,677 INFO L134 CoverageAnalysis]: Checked inductivity of 15 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 15 trivial. 0 not checked. [2025-01-08 22:49:01,677 INFO L308 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2025-01-08 22:49:01,677 INFO L136 FreeRefinementEngine]: Strategy FOX found an infeasible trace [2025-01-08 22:49:01,678 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [665679124] [2025-01-08 22:49:01,678 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [665679124] provided 1 perfect and 0 imperfect interpolant sequences [2025-01-08 22:49:01,678 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-01-08 22:49:01,678 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2025-01-08 22:49:01,678 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1631824301] [2025-01-08 22:49:01,678 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-01-08 22:49:01,678 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2025-01-08 22:49:01,678 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy FOX [2025-01-08 22:49:01,678 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2025-01-08 22:49:01,679 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2025-01-08 22:49:01,679 INFO L87 Difference]: Start difference. First operand 363 states and 491 transitions. Second operand has 5 states, 4 states have (on average 7.25) internal successors, (29), 4 states have internal predecessors, (29), 2 states have call successors, (4), 2 states have call predecessors, (4), 1 states have return successors, (3), 1 states have call predecessors, (3), 1 states have call successors, (3) [2025-01-08 22:49:01,701 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-01-08 22:49:01,701 INFO L93 Difference]: Finished difference Result 370 states and 497 transitions. [2025-01-08 22:49:01,701 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2025-01-08 22:49:01,701 INFO L78 Accepts]: Start accepts. Automaton has has 5 states, 4 states have (on average 7.25) internal successors, (29), 4 states have internal predecessors, (29), 2 states have call successors, (4), 2 states have call predecessors, (4), 1 states have return successors, (3), 1 states have call predecessors, (3), 1 states have call successors, (3) Word has length 44 [2025-01-08 22:49:01,702 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-01-08 22:49:01,703 INFO L225 Difference]: With dead ends: 370 [2025-01-08 22:49:01,703 INFO L226 Difference]: Without dead ends: 363 [2025-01-08 22:49:01,704 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 44 GetRequests, 40 SyntacticMatches, 0 SemanticMatches, 4 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=11, Invalid=19, Unknown=0, NotChecked=0, Total=30 [2025-01-08 22:49:01,705 INFO L435 NwaCegarLoop]: 95 mSDtfsCounter, 3 mSDsluCounter, 276 mSDsCounter, 0 mSdLazyCounter, 15 mSolverCounterSat, 1 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 3 SdHoareTripleChecker+Valid, 371 SdHoareTripleChecker+Invalid, 16 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 1 IncrementalHoareTripleChecker+Valid, 15 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2025-01-08 22:49:01,706 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [3 Valid, 371 Invalid, 16 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [1 Valid, 15 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2025-01-08 22:49:01,707 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 363 states. [2025-01-08 22:49:01,718 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 363 to 357. [2025-01-08 22:49:01,719 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 357 states, 317 states have (on average 1.2933753943217665) internal successors, (410), 319 states have internal predecessors, (410), 30 states have call successors, (30), 6 states have call predecessors, (30), 9 states have return successors, (41), 37 states have call predecessors, (41), 29 states have call successors, (41) [2025-01-08 22:49:01,721 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 357 states to 357 states and 481 transitions. [2025-01-08 22:49:01,721 INFO L78 Accepts]: Start accepts. Automaton has 357 states and 481 transitions. Word has length 44 [2025-01-08 22:49:01,722 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-01-08 22:49:01,722 INFO L471 AbstractCegarLoop]: Abstraction has 357 states and 481 transitions. [2025-01-08 22:49:01,722 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 4 states have (on average 7.25) internal successors, (29), 4 states have internal predecessors, (29), 2 states have call successors, (4), 2 states have call predecessors, (4), 1 states have return successors, (3), 1 states have call predecessors, (3), 1 states have call successors, (3) [2025-01-08 22:49:01,722 INFO L276 IsEmpty]: Start isEmpty. Operand 357 states and 481 transitions. [2025-01-08 22:49:01,723 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 45 [2025-01-08 22:49:01,723 INFO L210 NwaCegarLoop]: Found error trace [2025-01-08 22:49:01,724 INFO L218 NwaCegarLoop]: trace histogram [3, 3, 3, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-01-08 22:49:01,733 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (15)] Ended with exit code 0 [2025-01-08 22:49:01,924 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 15 /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-01-08 22:49:01,924 INFO L396 AbstractCegarLoop]: === Iteration 14 === Targeting __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-01-08 22:49:01,925 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-01-08 22:49:01,925 INFO L85 PathProgramCache]: Analyzing trace with hash -534772277, now seen corresponding path program 1 times [2025-01-08 22:49:01,925 INFO L118 FreeRefinementEngine]: Executing refinement strategy FOX [2025-01-08 22:49:01,925 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleZ3 [1971519900] [2025-01-08 22:49:01,925 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-01-08 22:49:01,925 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-01-08 22:49:01,925 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 [2025-01-08 22:49:01,930 INFO L229 MonitoredProcess]: Starting monitored process 16 with /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2025-01-08 22:49:01,931 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (16)] Waiting until timeout for monitored process [2025-01-08 22:49:01,957 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 44 statements into 1 equivalence classes. [2025-01-08 22:49:01,965 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 44 of 44 statements. [2025-01-08 22:49:01,965 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-01-08 22:49:01,965 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-01-08 22:49:01,966 INFO L256 TraceCheckSpWp]: Trace formula consists of 79 conjuncts, 3 conjuncts are in the unsatisfiable core [2025-01-08 22:49:01,966 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-01-08 22:49:01,980 INFO L134 CoverageAnalysis]: Checked inductivity of 15 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 15 trivial. 0 not checked. [2025-01-08 22:49:01,980 INFO L308 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2025-01-08 22:49:01,980 INFO L136 FreeRefinementEngine]: Strategy FOX found an infeasible trace [2025-01-08 22:49:01,980 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1971519900] [2025-01-08 22:49:01,980 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1971519900] provided 1 perfect and 0 imperfect interpolant sequences [2025-01-08 22:49:01,980 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-01-08 22:49:01,980 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2025-01-08 22:49:01,980 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [537873945] [2025-01-08 22:49:01,980 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-01-08 22:49:01,981 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2025-01-08 22:49:01,981 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy FOX [2025-01-08 22:49:01,981 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2025-01-08 22:49:01,981 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2025-01-08 22:49:01,981 INFO L87 Difference]: Start difference. First operand 357 states and 481 transitions. Second operand has 4 states, 4 states have (on average 7.5) internal successors, (30), 4 states have internal predecessors, (30), 2 states have call successors, (4), 2 states have call predecessors, (4), 1 states have return successors, (3), 1 states have call predecessors, (3), 1 states have call successors, (3) [2025-01-08 22:49:01,999 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-01-08 22:49:01,999 INFO L93 Difference]: Finished difference Result 589 states and 814 transitions. [2025-01-08 22:49:01,999 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2025-01-08 22:49:02,000 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 4 states have (on average 7.5) internal successors, (30), 4 states have internal predecessors, (30), 2 states have call successors, (4), 2 states have call predecessors, (4), 1 states have return successors, (3), 1 states have call predecessors, (3), 1 states have call successors, (3) Word has length 44 [2025-01-08 22:49:02,000 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-01-08 22:49:02,001 INFO L225 Difference]: With dead ends: 589 [2025-01-08 22:49:02,001 INFO L226 Difference]: Without dead ends: 497 [2025-01-08 22:49:02,002 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 43 GetRequests, 41 SyntacticMatches, 0 SemanticMatches, 2 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2025-01-08 22:49:02,002 INFO L435 NwaCegarLoop]: 109 mSDtfsCounter, 28 mSDsluCounter, 198 mSDsCounter, 0 mSdLazyCounter, 13 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 30 SdHoareTripleChecker+Valid, 307 SdHoareTripleChecker+Invalid, 13 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 13 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2025-01-08 22:49:02,002 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [30 Valid, 307 Invalid, 13 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 13 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2025-01-08 22:49:02,003 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 497 states. [2025-01-08 22:49:02,021 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 497 to 410. [2025-01-08 22:49:02,021 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 410 states, 366 states have (on average 1.2923497267759563) internal successors, (473), 366 states have internal predecessors, (473), 34 states have call successors, (34), 6 states have call predecessors, (34), 9 states have return successors, (45), 41 states have call predecessors, (45), 33 states have call successors, (45) [2025-01-08 22:49:02,023 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 410 states to 410 states and 552 transitions. [2025-01-08 22:49:02,023 INFO L78 Accepts]: Start accepts. Automaton has 410 states and 552 transitions. Word has length 44 [2025-01-08 22:49:02,023 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-01-08 22:49:02,023 INFO L471 AbstractCegarLoop]: Abstraction has 410 states and 552 transitions. [2025-01-08 22:49:02,023 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 7.5) internal successors, (30), 4 states have internal predecessors, (30), 2 states have call successors, (4), 2 states have call predecessors, (4), 1 states have return successors, (3), 1 states have call predecessors, (3), 1 states have call successors, (3) [2025-01-08 22:49:02,023 INFO L276 IsEmpty]: Start isEmpty. Operand 410 states and 552 transitions. [2025-01-08 22:49:02,024 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 48 [2025-01-08 22:49:02,024 INFO L210 NwaCegarLoop]: Found error trace [2025-01-08 22:49:02,024 INFO L218 NwaCegarLoop]: trace histogram [3, 3, 3, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-01-08 22:49:02,030 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (16)] Ended with exit code 0 [2025-01-08 22:49:02,225 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 16 /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-01-08 22:49:02,225 INFO L396 AbstractCegarLoop]: === Iteration 15 === Targeting __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-01-08 22:49:02,226 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-01-08 22:49:02,226 INFO L85 PathProgramCache]: Analyzing trace with hash -621873959, now seen corresponding path program 1 times [2025-01-08 22:49:02,226 INFO L118 FreeRefinementEngine]: Executing refinement strategy FOX [2025-01-08 22:49:02,226 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleZ3 [997403298] [2025-01-08 22:49:02,226 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-01-08 22:49:02,226 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-01-08 22:49:02,226 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 [2025-01-08 22:49:02,228 INFO L229 MonitoredProcess]: Starting monitored process 17 with /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2025-01-08 22:49:02,229 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (17)] Waiting until timeout for monitored process [2025-01-08 22:49:02,254 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 47 statements into 1 equivalence classes. [2025-01-08 22:49:02,263 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 47 of 47 statements. [2025-01-08 22:49:02,264 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-01-08 22:49:02,264 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-01-08 22:49:02,265 INFO L256 TraceCheckSpWp]: Trace formula consists of 83 conjuncts, 4 conjuncts are in the unsatisfiable core [2025-01-08 22:49:02,265 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-01-08 22:49:02,276 INFO L134 CoverageAnalysis]: Checked inductivity of 17 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 17 trivial. 0 not checked. [2025-01-08 22:49:02,277 INFO L308 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2025-01-08 22:49:02,277 INFO L136 FreeRefinementEngine]: Strategy FOX found an infeasible trace [2025-01-08 22:49:02,277 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [997403298] [2025-01-08 22:49:02,277 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [997403298] provided 1 perfect and 0 imperfect interpolant sequences [2025-01-08 22:49:02,277 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-01-08 22:49:02,277 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2025-01-08 22:49:02,277 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1927690699] [2025-01-08 22:49:02,277 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-01-08 22:49:02,277 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2025-01-08 22:49:02,277 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy FOX [2025-01-08 22:49:02,278 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2025-01-08 22:49:02,278 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2025-01-08 22:49:02,278 INFO L87 Difference]: Start difference. First operand 410 states and 552 transitions. Second operand has 4 states, 4 states have (on average 8.0) internal successors, (32), 4 states have internal predecessors, (32), 2 states have call successors, (4), 2 states have call predecessors, (4), 1 states have return successors, (3), 1 states have call predecessors, (3), 1 states have call successors, (3) [2025-01-08 22:49:02,327 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-01-08 22:49:02,327 INFO L93 Difference]: Finished difference Result 544 states and 737 transitions. [2025-01-08 22:49:02,327 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2025-01-08 22:49:02,327 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 4 states have (on average 8.0) internal successors, (32), 4 states have internal predecessors, (32), 2 states have call successors, (4), 2 states have call predecessors, (4), 1 states have return successors, (3), 1 states have call predecessors, (3), 1 states have call successors, (3) Word has length 47 [2025-01-08 22:49:02,328 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-01-08 22:49:02,329 INFO L225 Difference]: With dead ends: 544 [2025-01-08 22:49:02,329 INFO L226 Difference]: Without dead ends: 489 [2025-01-08 22:49:02,330 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 47 GetRequests, 44 SyntacticMatches, 0 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=9, Invalid=11, Unknown=0, NotChecked=0, Total=20 [2025-01-08 22:49:02,330 INFO L435 NwaCegarLoop]: 105 mSDtfsCounter, 41 mSDsluCounter, 170 mSDsCounter, 0 mSdLazyCounter, 40 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 45 SdHoareTripleChecker+Valid, 275 SdHoareTripleChecker+Invalid, 40 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 40 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2025-01-08 22:49:02,335 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [45 Valid, 275 Invalid, 40 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 40 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2025-01-08 22:49:02,335 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 489 states. [2025-01-08 22:49:02,359 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 489 to 418. [2025-01-08 22:49:02,359 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 418 states, 374 states have (on average 1.286096256684492) internal successors, (481), 374 states have internal predecessors, (481), 34 states have call successors, (34), 6 states have call predecessors, (34), 9 states have return successors, (45), 41 states have call predecessors, (45), 33 states have call successors, (45) [2025-01-08 22:49:02,364 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 418 states to 418 states and 560 transitions. [2025-01-08 22:49:02,364 INFO L78 Accepts]: Start accepts. Automaton has 418 states and 560 transitions. Word has length 47 [2025-01-08 22:49:02,364 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-01-08 22:49:02,364 INFO L471 AbstractCegarLoop]: Abstraction has 418 states and 560 transitions. [2025-01-08 22:49:02,365 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 8.0) internal successors, (32), 4 states have internal predecessors, (32), 2 states have call successors, (4), 2 states have call predecessors, (4), 1 states have return successors, (3), 1 states have call predecessors, (3), 1 states have call successors, (3) [2025-01-08 22:49:02,365 INFO L276 IsEmpty]: Start isEmpty. Operand 418 states and 560 transitions. [2025-01-08 22:49:02,366 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 48 [2025-01-08 22:49:02,366 INFO L210 NwaCegarLoop]: Found error trace [2025-01-08 22:49:02,366 INFO L218 NwaCegarLoop]: trace histogram [3, 3, 3, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-01-08 22:49:02,379 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (17)] Forceful destruction successful, exit code 0 [2025-01-08 22:49:02,566 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 17 /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-01-08 22:49:02,567 INFO L396 AbstractCegarLoop]: === Iteration 16 === Targeting __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-01-08 22:49:02,567 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-01-08 22:49:02,570 INFO L85 PathProgramCache]: Analyzing trace with hash 1766246999, now seen corresponding path program 1 times [2025-01-08 22:49:02,571 INFO L118 FreeRefinementEngine]: Executing refinement strategy FOX [2025-01-08 22:49:02,571 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleZ3 [32810205] [2025-01-08 22:49:02,571 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-01-08 22:49:02,571 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-01-08 22:49:02,571 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 [2025-01-08 22:49:02,573 INFO L229 MonitoredProcess]: Starting monitored process 18 with /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2025-01-08 22:49:02,577 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (18)] Waiting until timeout for monitored process [2025-01-08 22:49:02,605 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 47 statements into 1 equivalence classes. [2025-01-08 22:49:02,615 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 47 of 47 statements. [2025-01-08 22:49:02,615 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-01-08 22:49:02,615 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-01-08 22:49:02,617 INFO L256 TraceCheckSpWp]: Trace formula consists of 86 conjuncts, 16 conjuncts are in the unsatisfiable core [2025-01-08 22:49:02,618 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-01-08 22:49:02,732 INFO L134 CoverageAnalysis]: Checked inductivity of 17 backedges. 6 proven. 0 refuted. 0 times theorem prover too weak. 11 trivial. 0 not checked. [2025-01-08 22:49:02,732 INFO L308 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2025-01-08 22:49:02,732 INFO L136 FreeRefinementEngine]: Strategy FOX found an infeasible trace [2025-01-08 22:49:02,732 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [32810205] [2025-01-08 22:49:02,733 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [32810205] provided 1 perfect and 0 imperfect interpolant sequences [2025-01-08 22:49:02,733 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-01-08 22:49:02,733 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [11] imperfect sequences [] total 11 [2025-01-08 22:49:02,733 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2088349912] [2025-01-08 22:49:02,733 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-01-08 22:49:02,733 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 11 states [2025-01-08 22:49:02,733 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy FOX [2025-01-08 22:49:02,733 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 11 interpolants. [2025-01-08 22:49:02,734 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=19, Invalid=91, Unknown=0, NotChecked=0, Total=110 [2025-01-08 22:49:02,734 INFO L87 Difference]: Start difference. First operand 418 states and 560 transitions. Second operand has 11 states, 11 states have (on average 3.090909090909091) internal successors, (34), 10 states have internal predecessors, (34), 2 states have call successors, (4), 2 states have call predecessors, (4), 2 states have return successors, (3), 2 states have call predecessors, (3), 1 states have call successors, (3) [2025-01-08 22:49:03,061 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-01-08 22:49:03,062 INFO L93 Difference]: Finished difference Result 465 states and 624 transitions. [2025-01-08 22:49:03,062 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 12 states. [2025-01-08 22:49:03,062 INFO L78 Accepts]: Start accepts. Automaton has has 11 states, 11 states have (on average 3.090909090909091) internal successors, (34), 10 states have internal predecessors, (34), 2 states have call successors, (4), 2 states have call predecessors, (4), 2 states have return successors, (3), 2 states have call predecessors, (3), 1 states have call successors, (3) Word has length 47 [2025-01-08 22:49:03,062 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-01-08 22:49:03,065 INFO L225 Difference]: With dead ends: 465 [2025-01-08 22:49:03,065 INFO L226 Difference]: Without dead ends: 442 [2025-01-08 22:49:03,065 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 52 GetRequests, 37 SyntacticMatches, 0 SemanticMatches, 15 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 13 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=46, Invalid=226, Unknown=0, NotChecked=0, Total=272 [2025-01-08 22:49:03,066 INFO L435 NwaCegarLoop]: 115 mSDtfsCounter, 70 mSDsluCounter, 875 mSDsCounter, 0 mSdLazyCounter, 350 mSolverCounterSat, 7 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 74 SdHoareTripleChecker+Valid, 990 SdHoareTripleChecker+Invalid, 357 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 7 IncrementalHoareTripleChecker+Valid, 350 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.2s IncrementalHoareTripleChecker+Time [2025-01-08 22:49:03,067 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [74 Valid, 990 Invalid, 357 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [7 Valid, 350 Invalid, 0 Unknown, 0 Unchecked, 0.2s Time] [2025-01-08 22:49:03,067 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 442 states. [2025-01-08 22:49:03,079 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 442 to 437. [2025-01-08 22:49:03,080 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 437 states, 391 states have (on average 1.2838874680306904) internal successors, (502), 392 states have internal predecessors, (502), 36 states have call successors, (36), 6 states have call predecessors, (36), 9 states have return successors, (47), 43 states have call predecessors, (47), 35 states have call successors, (47) [2025-01-08 22:49:03,082 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 437 states to 437 states and 585 transitions. [2025-01-08 22:49:03,083 INFO L78 Accepts]: Start accepts. Automaton has 437 states and 585 transitions. Word has length 47 [2025-01-08 22:49:03,083 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-01-08 22:49:03,083 INFO L471 AbstractCegarLoop]: Abstraction has 437 states and 585 transitions. [2025-01-08 22:49:03,083 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 11 states, 11 states have (on average 3.090909090909091) internal successors, (34), 10 states have internal predecessors, (34), 2 states have call successors, (4), 2 states have call predecessors, (4), 2 states have return successors, (3), 2 states have call predecessors, (3), 1 states have call successors, (3) [2025-01-08 22:49:03,083 INFO L276 IsEmpty]: Start isEmpty. Operand 437 states and 585 transitions. [2025-01-08 22:49:03,084 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 48 [2025-01-08 22:49:03,085 INFO L210 NwaCegarLoop]: Found error trace [2025-01-08 22:49:03,085 INFO L218 NwaCegarLoop]: trace histogram [3, 3, 3, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-01-08 22:49:03,094 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (18)] Ended with exit code 0 [2025-01-08 22:49:03,285 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 18 /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-01-08 22:49:03,286 INFO L396 AbstractCegarLoop]: === Iteration 17 === Targeting __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-01-08 22:49:03,286 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-01-08 22:49:03,286 INFO L85 PathProgramCache]: Analyzing trace with hash 510885787, now seen corresponding path program 1 times [2025-01-08 22:49:03,286 INFO L118 FreeRefinementEngine]: Executing refinement strategy FOX [2025-01-08 22:49:03,286 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleZ3 [702678514] [2025-01-08 22:49:03,286 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-01-08 22:49:03,287 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-01-08 22:49:03,288 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 [2025-01-08 22:49:03,291 INFO L229 MonitoredProcess]: Starting monitored process 19 with /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2025-01-08 22:49:03,292 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (19)] Waiting until timeout for monitored process [2025-01-08 22:49:03,322 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 47 statements into 1 equivalence classes. [2025-01-08 22:49:03,332 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 47 of 47 statements. [2025-01-08 22:49:03,332 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-01-08 22:49:03,332 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-01-08 22:49:03,333 INFO L256 TraceCheckSpWp]: Trace formula consists of 87 conjuncts, 6 conjuncts are in the unsatisfiable core [2025-01-08 22:49:03,334 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-01-08 22:49:03,354 INFO L134 CoverageAnalysis]: Checked inductivity of 18 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 18 trivial. 0 not checked. [2025-01-08 22:49:03,354 INFO L308 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2025-01-08 22:49:03,354 INFO L136 FreeRefinementEngine]: Strategy FOX found an infeasible trace [2025-01-08 22:49:03,354 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [702678514] [2025-01-08 22:49:03,354 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [702678514] provided 1 perfect and 0 imperfect interpolant sequences [2025-01-08 22:49:03,354 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-01-08 22:49:03,354 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2025-01-08 22:49:03,355 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [96367620] [2025-01-08 22:49:03,356 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-01-08 22:49:03,356 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2025-01-08 22:49:03,356 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy FOX [2025-01-08 22:49:03,356 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2025-01-08 22:49:03,357 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2025-01-08 22:49:03,357 INFO L87 Difference]: Start difference. First operand 437 states and 585 transitions. Second operand has 5 states, 5 states have (on average 6.0) internal successors, (30), 5 states have internal predecessors, (30), 2 states have call successors, (4), 2 states have call predecessors, (4), 1 states have return successors, (3), 1 states have call predecessors, (3), 1 states have call successors, (3) [2025-01-08 22:49:03,435 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-01-08 22:49:03,435 INFO L93 Difference]: Finished difference Result 523 states and 703 transitions. [2025-01-08 22:49:03,436 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2025-01-08 22:49:03,436 INFO L78 Accepts]: Start accepts. Automaton has has 5 states, 5 states have (on average 6.0) internal successors, (30), 5 states have internal predecessors, (30), 2 states have call successors, (4), 2 states have call predecessors, (4), 1 states have return successors, (3), 1 states have call predecessors, (3), 1 states have call successors, (3) Word has length 47 [2025-01-08 22:49:03,436 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-01-08 22:49:03,438 INFO L225 Difference]: With dead ends: 523 [2025-01-08 22:49:03,438 INFO L226 Difference]: Without dead ends: 466 [2025-01-08 22:49:03,438 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 48 GetRequests, 43 SyntacticMatches, 0 SemanticMatches, 5 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=17, Invalid=25, Unknown=0, NotChecked=0, Total=42 [2025-01-08 22:49:03,438 INFO L435 NwaCegarLoop]: 111 mSDtfsCounter, 52 mSDsluCounter, 264 mSDsCounter, 0 mSdLazyCounter, 73 mSolverCounterSat, 4 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 56 SdHoareTripleChecker+Valid, 375 SdHoareTripleChecker+Invalid, 77 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 4 IncrementalHoareTripleChecker+Valid, 73 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2025-01-08 22:49:03,438 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [56 Valid, 375 Invalid, 77 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [4 Valid, 73 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2025-01-08 22:49:03,439 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 466 states. [2025-01-08 22:49:03,451 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 466 to 417. [2025-01-08 22:49:03,452 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 417 states, 373 states have (on average 1.2788203753351206) internal successors, (477), 373 states have internal predecessors, (477), 34 states have call successors, (34), 6 states have call predecessors, (34), 9 states have return successors, (45), 41 states have call predecessors, (45), 33 states have call successors, (45) [2025-01-08 22:49:03,454 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 417 states to 417 states and 556 transitions. [2025-01-08 22:49:03,454 INFO L78 Accepts]: Start accepts. Automaton has 417 states and 556 transitions. Word has length 47 [2025-01-08 22:49:03,454 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-01-08 22:49:03,454 INFO L471 AbstractCegarLoop]: Abstraction has 417 states and 556 transitions. [2025-01-08 22:49:03,454 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 6.0) internal successors, (30), 5 states have internal predecessors, (30), 2 states have call successors, (4), 2 states have call predecessors, (4), 1 states have return successors, (3), 1 states have call predecessors, (3), 1 states have call successors, (3) [2025-01-08 22:49:03,455 INFO L276 IsEmpty]: Start isEmpty. Operand 417 states and 556 transitions. [2025-01-08 22:49:03,455 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 49 [2025-01-08 22:49:03,455 INFO L210 NwaCegarLoop]: Found error trace [2025-01-08 22:49:03,456 INFO L218 NwaCegarLoop]: trace histogram [3, 3, 3, 3, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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-01-08 22:49:03,462 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (19)] Ended with exit code 0 [2025-01-08 22:49:03,656 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 19 /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-01-08 22:49:03,656 INFO L396 AbstractCegarLoop]: === Iteration 18 === Targeting __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-01-08 22:49:03,657 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-01-08 22:49:03,657 INFO L85 PathProgramCache]: Analyzing trace with hash 867602677, now seen corresponding path program 1 times [2025-01-08 22:49:03,657 INFO L118 FreeRefinementEngine]: Executing refinement strategy FOX [2025-01-08 22:49:03,657 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleZ3 [1837642590] [2025-01-08 22:49:03,657 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-01-08 22:49:03,657 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-01-08 22:49:03,657 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 [2025-01-08 22:49:03,662 INFO L229 MonitoredProcess]: Starting monitored process 20 with /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2025-01-08 22:49:03,663 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (20)] Waiting until timeout for monitored process [2025-01-08 22:49:03,691 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 48 statements into 1 equivalence classes. [2025-01-08 22:49:03,700 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 48 of 48 statements. [2025-01-08 22:49:03,700 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-01-08 22:49:03,700 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-01-08 22:49:03,703 INFO L256 TraceCheckSpWp]: Trace formula consists of 85 conjuncts, 10 conjuncts are in the unsatisfiable core [2025-01-08 22:49:03,704 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-01-08 22:49:03,812 INFO L134 CoverageAnalysis]: Checked inductivity of 15 backedges. 3 proven. 3 refuted. 0 times theorem prover too weak. 9 trivial. 0 not checked. [2025-01-08 22:49:03,813 INFO L312 TraceCheckSpWp]: Computing backward predicates... [2025-01-08 22:49:03,889 INFO L134 CoverageAnalysis]: Checked inductivity of 15 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 15 trivial. 0 not checked. [2025-01-08 22:49:03,889 INFO L136 FreeRefinementEngine]: Strategy FOX found an infeasible trace [2025-01-08 22:49:03,889 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1837642590] [2025-01-08 22:49:03,889 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1837642590] provided 1 perfect and 1 imperfect interpolant sequences [2025-01-08 22:49:03,889 INFO L185 FreeRefinementEngine]: Found 1 perfect and 1 imperfect interpolant sequences. [2025-01-08 22:49:03,889 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [10] total 14 [2025-01-08 22:49:03,889 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1578822229] [2025-01-08 22:49:03,889 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-01-08 22:49:03,889 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2025-01-08 22:49:03,889 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy FOX [2025-01-08 22:49:03,890 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2025-01-08 22:49:03,890 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=33, Invalid=149, Unknown=0, NotChecked=0, Total=182 [2025-01-08 22:49:03,890 INFO L87 Difference]: Start difference. First operand 417 states and 556 transitions. Second operand has 6 states, 6 states have (on average 5.5) internal successors, (33), 6 states have internal predecessors, (33), 2 states have call successors, (4), 2 states have call predecessors, (4), 1 states have return successors, (3), 1 states have call predecessors, (3), 1 states have call successors, (3) [2025-01-08 22:49:04,044 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-01-08 22:49:04,044 INFO L93 Difference]: Finished difference Result 609 states and 829 transitions. [2025-01-08 22:49:04,045 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2025-01-08 22:49:04,045 INFO L78 Accepts]: Start accepts. Automaton has has 6 states, 6 states have (on average 5.5) internal successors, (33), 6 states have internal predecessors, (33), 2 states have call successors, (4), 2 states have call predecessors, (4), 1 states have return successors, (3), 1 states have call predecessors, (3), 1 states have call successors, (3) Word has length 48 [2025-01-08 22:49:04,045 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-01-08 22:49:04,047 INFO L225 Difference]: With dead ends: 609 [2025-01-08 22:49:04,047 INFO L226 Difference]: Without dead ends: 569 [2025-01-08 22:49:04,047 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 94 GetRequests, 82 SyntacticMatches, 0 SemanticMatches, 12 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 22 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=33, Invalid=149, Unknown=0, NotChecked=0, Total=182 [2025-01-08 22:49:04,047 INFO L435 NwaCegarLoop]: 82 mSDtfsCounter, 25 mSDsluCounter, 268 mSDsCounter, 0 mSdLazyCounter, 138 mSolverCounterSat, 4 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 29 SdHoareTripleChecker+Valid, 350 SdHoareTripleChecker+Invalid, 142 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 4 IncrementalHoareTripleChecker+Valid, 138 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2025-01-08 22:49:04,047 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [29 Valid, 350 Invalid, 142 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [4 Valid, 138 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2025-01-08 22:49:04,048 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 569 states. [2025-01-08 22:49:04,075 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 569 to 450. [2025-01-08 22:49:04,075 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 450 states, 400 states have (on average 1.2675) internal successors, (507), 400 states have internal predecessors, (507), 40 states have call successors, (40), 6 states have call predecessors, (40), 9 states have return successors, (51), 47 states have call predecessors, (51), 39 states have call successors, (51) [2025-01-08 22:49:04,077 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 450 states to 450 states and 598 transitions. [2025-01-08 22:49:04,077 INFO L78 Accepts]: Start accepts. Automaton has 450 states and 598 transitions. Word has length 48 [2025-01-08 22:49:04,077 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-01-08 22:49:04,077 INFO L471 AbstractCegarLoop]: Abstraction has 450 states and 598 transitions. [2025-01-08 22:49:04,077 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 6 states have (on average 5.5) internal successors, (33), 6 states have internal predecessors, (33), 2 states have call successors, (4), 2 states have call predecessors, (4), 1 states have return successors, (3), 1 states have call predecessors, (3), 1 states have call successors, (3) [2025-01-08 22:49:04,078 INFO L276 IsEmpty]: Start isEmpty. Operand 450 states and 598 transitions. [2025-01-08 22:49:04,079 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 49 [2025-01-08 22:49:04,079 INFO L210 NwaCegarLoop]: Found error trace [2025-01-08 22:49:04,079 INFO L218 NwaCegarLoop]: trace histogram [3, 3, 3, 3, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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-01-08 22:49:04,085 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (20)] Ended with exit code 0 [2025-01-08 22:49:04,283 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 20 /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-01-08 22:49:04,283 INFO L396 AbstractCegarLoop]: === Iteration 19 === Targeting __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-01-08 22:49:04,283 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-01-08 22:49:04,283 INFO L85 PathProgramCache]: Analyzing trace with hash 1568667255, now seen corresponding path program 1 times [2025-01-08 22:49:04,284 INFO L118 FreeRefinementEngine]: Executing refinement strategy FOX [2025-01-08 22:49:04,284 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleZ3 [467866935] [2025-01-08 22:49:04,284 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-01-08 22:49:04,284 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-01-08 22:49:04,284 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 [2025-01-08 22:49:04,292 INFO L229 MonitoredProcess]: Starting monitored process 21 with /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2025-01-08 22:49:04,293 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (21)] Waiting until timeout for monitored process [2025-01-08 22:49:04,324 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 48 statements into 1 equivalence classes. [2025-01-08 22:49:04,333 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 48 of 48 statements. [2025-01-08 22:49:04,333 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-01-08 22:49:04,333 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-01-08 22:49:04,333 INFO L256 TraceCheckSpWp]: Trace formula consists of 85 conjuncts, 3 conjuncts are in the unsatisfiable core [2025-01-08 22:49:04,334 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-01-08 22:49:04,354 INFO L134 CoverageAnalysis]: Checked inductivity of 15 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 15 trivial. 0 not checked. [2025-01-08 22:49:04,355 INFO L308 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2025-01-08 22:49:04,355 INFO L136 FreeRefinementEngine]: Strategy FOX found an infeasible trace [2025-01-08 22:49:04,355 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [467866935] [2025-01-08 22:49:04,355 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [467866935] provided 1 perfect and 0 imperfect interpolant sequences [2025-01-08 22:49:04,355 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-01-08 22:49:04,355 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2025-01-08 22:49:04,355 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [986464788] [2025-01-08 22:49:04,355 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-01-08 22:49:04,355 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2025-01-08 22:49:04,355 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy FOX [2025-01-08 22:49:04,356 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2025-01-08 22:49:04,356 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2025-01-08 22:49:04,356 INFO L87 Difference]: Start difference. First operand 450 states and 598 transitions. Second operand has 4 states, 4 states have (on average 8.25) internal successors, (33), 4 states have internal predecessors, (33), 2 states have call successors, (4), 2 states have call predecessors, (4), 1 states have return successors, (3), 1 states have call predecessors, (3), 1 states have call successors, (3) [2025-01-08 22:49:04,376 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-01-08 22:49:04,376 INFO L93 Difference]: Finished difference Result 469 states and 619 transitions. [2025-01-08 22:49:04,376 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2025-01-08 22:49:04,377 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 4 states have (on average 8.25) internal successors, (33), 4 states have internal predecessors, (33), 2 states have call successors, (4), 2 states have call predecessors, (4), 1 states have return successors, (3), 1 states have call predecessors, (3), 1 states have call successors, (3) Word has length 48 [2025-01-08 22:49:04,377 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-01-08 22:49:04,378 INFO L225 Difference]: With dead ends: 469 [2025-01-08 22:49:04,378 INFO L226 Difference]: Without dead ends: 425 [2025-01-08 22:49:04,378 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 47 GetRequests, 45 SyntacticMatches, 0 SemanticMatches, 2 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2025-01-08 22:49:04,379 INFO L435 NwaCegarLoop]: 94 mSDtfsCounter, 0 mSDsluCounter, 182 mSDsCounter, 0 mSdLazyCounter, 8 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 0 SdHoareTripleChecker+Valid, 276 SdHoareTripleChecker+Invalid, 8 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 8 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2025-01-08 22:49:04,395 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [0 Valid, 276 Invalid, 8 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 8 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2025-01-08 22:49:04,395 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 425 states. [2025-01-08 22:49:04,408 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 425 to 421. [2025-01-08 22:49:04,408 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 421 states, 371 states have (on average 1.2722371967654986) internal successors, (472), 372 states have internal predecessors, (472), 40 states have call successors, (40), 6 states have call predecessors, (40), 9 states have return successors, (49), 46 states have call predecessors, (49), 39 states have call successors, (49) [2025-01-08 22:49:04,410 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 421 states to 421 states and 561 transitions. [2025-01-08 22:49:04,410 INFO L78 Accepts]: Start accepts. Automaton has 421 states and 561 transitions. Word has length 48 [2025-01-08 22:49:04,410 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-01-08 22:49:04,410 INFO L471 AbstractCegarLoop]: Abstraction has 421 states and 561 transitions. [2025-01-08 22:49:04,410 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 8.25) internal successors, (33), 4 states have internal predecessors, (33), 2 states have call successors, (4), 2 states have call predecessors, (4), 1 states have return successors, (3), 1 states have call predecessors, (3), 1 states have call successors, (3) [2025-01-08 22:49:04,410 INFO L276 IsEmpty]: Start isEmpty. Operand 421 states and 561 transitions. [2025-01-08 22:49:04,411 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 50 [2025-01-08 22:49:04,411 INFO L210 NwaCegarLoop]: Found error trace [2025-01-08 22:49:04,412 INFO L218 NwaCegarLoop]: trace histogram [3, 3, 3, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-01-08 22:49:04,420 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (21)] Ended with exit code 0 [2025-01-08 22:49:04,612 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 21 /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-01-08 22:49:04,612 INFO L396 AbstractCegarLoop]: === Iteration 20 === Targeting __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-01-08 22:49:04,613 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-01-08 22:49:04,613 INFO L85 PathProgramCache]: Analyzing trace with hash 134385715, now seen corresponding path program 1 times [2025-01-08 22:49:04,613 INFO L118 FreeRefinementEngine]: Executing refinement strategy FOX [2025-01-08 22:49:04,613 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleZ3 [1952313575] [2025-01-08 22:49:04,613 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-01-08 22:49:04,613 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-01-08 22:49:04,613 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 [2025-01-08 22:49:04,615 INFO L229 MonitoredProcess]: Starting monitored process 22 with /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2025-01-08 22:49:04,616 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (22)] Waiting until timeout for monitored process [2025-01-08 22:49:04,644 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 49 statements into 1 equivalence classes. [2025-01-08 22:49:04,653 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 49 of 49 statements. [2025-01-08 22:49:04,653 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-01-08 22:49:04,653 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-01-08 22:49:04,654 INFO L256 TraceCheckSpWp]: Trace formula consists of 89 conjuncts, 11 conjuncts are in the unsatisfiable core [2025-01-08 22:49:04,658 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-01-08 22:49:04,821 INFO L134 CoverageAnalysis]: Checked inductivity of 15 backedges. 6 proven. 0 refuted. 0 times theorem prover too weak. 9 trivial. 0 not checked. [2025-01-08 22:49:04,821 INFO L308 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2025-01-08 22:49:04,821 INFO L136 FreeRefinementEngine]: Strategy FOX found an infeasible trace [2025-01-08 22:49:04,821 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1952313575] [2025-01-08 22:49:04,821 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1952313575] provided 1 perfect and 0 imperfect interpolant sequences [2025-01-08 22:49:04,821 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-01-08 22:49:04,821 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [11] imperfect sequences [] total 11 [2025-01-08 22:49:04,821 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [501965511] [2025-01-08 22:49:04,821 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-01-08 22:49:04,821 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 11 states [2025-01-08 22:49:04,821 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy FOX [2025-01-08 22:49:04,822 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 11 interpolants. [2025-01-08 22:49:04,822 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=24, Invalid=86, Unknown=0, NotChecked=0, Total=110 [2025-01-08 22:49:04,822 INFO L87 Difference]: Start difference. First operand 421 states and 561 transitions. Second operand has 11 states, 11 states have (on average 3.3636363636363638) internal successors, (37), 10 states have internal predecessors, (37), 2 states have call successors, (4), 2 states have call predecessors, (4), 2 states have return successors, (3), 2 states have call predecessors, (3), 1 states have call successors, (3) [2025-01-08 22:49:05,056 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-01-08 22:49:05,056 INFO L93 Difference]: Finished difference Result 499 states and 665 transitions. [2025-01-08 22:49:05,056 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 14 states. [2025-01-08 22:49:05,056 INFO L78 Accepts]: Start accepts. Automaton has has 11 states, 11 states have (on average 3.3636363636363638) internal successors, (37), 10 states have internal predecessors, (37), 2 states have call successors, (4), 2 states have call predecessors, (4), 2 states have return successors, (3), 2 states have call predecessors, (3), 1 states have call successors, (3) Word has length 49 [2025-01-08 22:49:05,056 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-01-08 22:49:05,058 INFO L225 Difference]: With dead ends: 499 [2025-01-08 22:49:05,058 INFO L226 Difference]: Without dead ends: 460 [2025-01-08 22:49:05,059 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 51 GetRequests, 39 SyntacticMatches, 0 SemanticMatches, 12 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 3 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=39, Invalid=143, Unknown=0, NotChecked=0, Total=182 [2025-01-08 22:49:05,059 INFO L435 NwaCegarLoop]: 90 mSDtfsCounter, 48 mSDsluCounter, 736 mSDsCounter, 0 mSdLazyCounter, 318 mSolverCounterSat, 8 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 54 SdHoareTripleChecker+Valid, 826 SdHoareTripleChecker+Invalid, 326 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 8 IncrementalHoareTripleChecker+Valid, 318 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.2s IncrementalHoareTripleChecker+Time [2025-01-08 22:49:05,059 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [54 Valid, 826 Invalid, 326 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [8 Valid, 318 Invalid, 0 Unknown, 0 Unchecked, 0.2s Time] [2025-01-08 22:49:05,062 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 460 states. [2025-01-08 22:49:05,076 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 460 to 447. [2025-01-08 22:49:05,076 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 447 states, 393 states have (on average 1.2595419847328244) internal successors, (495), 396 states have internal predecessors, (495), 44 states have call successors, (44), 6 states have call predecessors, (44), 9 states have return successors, (52), 49 states have call predecessors, (52), 42 states have call successors, (52) [2025-01-08 22:49:05,078 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 447 states to 447 states and 591 transitions. [2025-01-08 22:49:05,078 INFO L78 Accepts]: Start accepts. Automaton has 447 states and 591 transitions. Word has length 49 [2025-01-08 22:49:05,078 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-01-08 22:49:05,078 INFO L471 AbstractCegarLoop]: Abstraction has 447 states and 591 transitions. [2025-01-08 22:49:05,078 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 11 states, 11 states have (on average 3.3636363636363638) internal successors, (37), 10 states have internal predecessors, (37), 2 states have call successors, (4), 2 states have call predecessors, (4), 2 states have return successors, (3), 2 states have call predecessors, (3), 1 states have call successors, (3) [2025-01-08 22:49:05,078 INFO L276 IsEmpty]: Start isEmpty. Operand 447 states and 591 transitions. [2025-01-08 22:49:05,080 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 50 [2025-01-08 22:49:05,080 INFO L210 NwaCegarLoop]: Found error trace [2025-01-08 22:49:05,080 INFO L218 NwaCegarLoop]: trace histogram [3, 3, 3, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-01-08 22:49:05,086 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (22)] Ended with exit code 0 [2025-01-08 22:49:05,282 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 22 /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-01-08 22:49:05,283 INFO L396 AbstractCegarLoop]: === Iteration 21 === Targeting __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-01-08 22:49:05,283 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-01-08 22:49:05,283 INFO L85 PathProgramCache]: Analyzing trace with hash -7830161, now seen corresponding path program 1 times [2025-01-08 22:49:05,283 INFO L118 FreeRefinementEngine]: Executing refinement strategy FOX [2025-01-08 22:49:05,283 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleZ3 [460585156] [2025-01-08 22:49:05,283 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-01-08 22:49:05,283 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-01-08 22:49:05,283 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 [2025-01-08 22:49:05,285 INFO L229 MonitoredProcess]: Starting monitored process 23 with /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2025-01-08 22:49:05,288 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (23)] Waiting until timeout for monitored process [2025-01-08 22:49:05,318 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 49 statements into 1 equivalence classes. [2025-01-08 22:49:05,331 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 49 of 49 statements. [2025-01-08 22:49:05,331 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-01-08 22:49:05,331 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-01-08 22:49:05,332 INFO L256 TraceCheckSpWp]: Trace formula consists of 90 conjuncts, 7 conjuncts are in the unsatisfiable core [2025-01-08 22:49:05,333 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-01-08 22:49:05,409 INFO L134 CoverageAnalysis]: Checked inductivity of 15 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 15 trivial. 0 not checked. [2025-01-08 22:49:05,409 INFO L308 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2025-01-08 22:49:05,409 INFO L136 FreeRefinementEngine]: Strategy FOX found an infeasible trace [2025-01-08 22:49:05,409 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [460585156] [2025-01-08 22:49:05,409 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [460585156] provided 1 perfect and 0 imperfect interpolant sequences [2025-01-08 22:49:05,409 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-01-08 22:49:05,410 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2025-01-08 22:49:05,410 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [955149590] [2025-01-08 22:49:05,410 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-01-08 22:49:05,410 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 7 states [2025-01-08 22:49:05,410 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy FOX [2025-01-08 22:49:05,410 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2025-01-08 22:49:05,410 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=11, Invalid=31, Unknown=0, NotChecked=0, Total=42 [2025-01-08 22:49:05,411 INFO L87 Difference]: Start difference. First operand 447 states and 591 transitions. Second operand has 7 states, 7 states have (on average 5.0) internal successors, (35), 7 states have internal predecessors, (35), 2 states have call successors, (4), 2 states have call predecessors, (4), 1 states have return successors, (3), 1 states have call predecessors, (3), 1 states have call successors, (3) [2025-01-08 22:49:05,580 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-01-08 22:49:05,580 INFO L93 Difference]: Finished difference Result 584 states and 778 transitions. [2025-01-08 22:49:05,580 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2025-01-08 22:49:05,580 INFO L78 Accepts]: Start accepts. Automaton has has 7 states, 7 states have (on average 5.0) internal successors, (35), 7 states have internal predecessors, (35), 2 states have call successors, (4), 2 states have call predecessors, (4), 1 states have return successors, (3), 1 states have call predecessors, (3), 1 states have call successors, (3) Word has length 49 [2025-01-08 22:49:05,581 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-01-08 22:49:05,583 INFO L225 Difference]: With dead ends: 584 [2025-01-08 22:49:05,583 INFO L226 Difference]: Without dead ends: 560 [2025-01-08 22:49:05,583 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 48 GetRequests, 43 SyntacticMatches, 0 SemanticMatches, 5 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=11, Invalid=31, Unknown=0, NotChecked=0, Total=42 [2025-01-08 22:49:05,584 INFO L435 NwaCegarLoop]: 108 mSDtfsCounter, 27 mSDsluCounter, 426 mSDsCounter, 0 mSdLazyCounter, 201 mSolverCounterSat, 4 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 31 SdHoareTripleChecker+Valid, 534 SdHoareTripleChecker+Invalid, 205 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 4 IncrementalHoareTripleChecker+Valid, 201 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2025-01-08 22:49:05,584 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [31 Valid, 534 Invalid, 205 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [4 Valid, 201 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2025-01-08 22:49:05,585 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 560 states. [2025-01-08 22:49:05,601 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 560 to 464. [2025-01-08 22:49:05,601 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 464 states, 406 states have (on average 1.2684729064039408) internal successors, (515), 411 states have internal predecessors, (515), 48 states have call successors, (48), 6 states have call predecessors, (48), 9 states have return successors, (56), 52 states have call predecessors, (56), 46 states have call successors, (56) [2025-01-08 22:49:05,603 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 464 states to 464 states and 619 transitions. [2025-01-08 22:49:05,603 INFO L78 Accepts]: Start accepts. Automaton has 464 states and 619 transitions. Word has length 49 [2025-01-08 22:49:05,603 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-01-08 22:49:05,603 INFO L471 AbstractCegarLoop]: Abstraction has 464 states and 619 transitions. [2025-01-08 22:49:05,604 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 7 states, 7 states have (on average 5.0) internal successors, (35), 7 states have internal predecessors, (35), 2 states have call successors, (4), 2 states have call predecessors, (4), 1 states have return successors, (3), 1 states have call predecessors, (3), 1 states have call successors, (3) [2025-01-08 22:49:05,604 INFO L276 IsEmpty]: Start isEmpty. Operand 464 states and 619 transitions. [2025-01-08 22:49:05,604 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 50 [2025-01-08 22:49:05,605 INFO L210 NwaCegarLoop]: Found error trace [2025-01-08 22:49:05,605 INFO L218 NwaCegarLoop]: trace histogram [3, 3, 3, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-01-08 22:49:05,634 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (23)] Ended with exit code 0 [2025-01-08 22:49:05,805 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 23 /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-01-08 22:49:05,806 INFO L396 AbstractCegarLoop]: === Iteration 22 === Targeting __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-01-08 22:49:05,806 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-01-08 22:49:05,807 INFO L85 PathProgramCache]: Analyzing trace with hash 708199725, now seen corresponding path program 1 times [2025-01-08 22:49:05,807 INFO L118 FreeRefinementEngine]: Executing refinement strategy FOX [2025-01-08 22:49:05,807 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleZ3 [1616290525] [2025-01-08 22:49:05,807 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-01-08 22:49:05,807 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-01-08 22:49:05,807 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 [2025-01-08 22:49:05,809 INFO L229 MonitoredProcess]: Starting monitored process 24 with /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2025-01-08 22:49:05,810 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (24)] Waiting until timeout for monitored process [2025-01-08 22:49:05,842 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 49 statements into 1 equivalence classes. [2025-01-08 22:49:05,851 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 49 of 49 statements. [2025-01-08 22:49:05,851 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-01-08 22:49:05,851 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-01-08 22:49:05,852 INFO L256 TraceCheckSpWp]: Trace formula consists of 86 conjuncts, 3 conjuncts are in the unsatisfiable core [2025-01-08 22:49:05,853 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-01-08 22:49:05,869 INFO L134 CoverageAnalysis]: Checked inductivity of 15 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 15 trivial. 0 not checked. [2025-01-08 22:49:05,869 INFO L308 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2025-01-08 22:49:05,870 INFO L136 FreeRefinementEngine]: Strategy FOX found an infeasible trace [2025-01-08 22:49:05,870 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1616290525] [2025-01-08 22:49:05,870 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1616290525] provided 1 perfect and 0 imperfect interpolant sequences [2025-01-08 22:49:05,870 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-01-08 22:49:05,870 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2025-01-08 22:49:05,870 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2057662010] [2025-01-08 22:49:05,870 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-01-08 22:49:05,870 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2025-01-08 22:49:05,870 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy FOX [2025-01-08 22:49:05,870 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2025-01-08 22:49:05,870 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2025-01-08 22:49:05,870 INFO L87 Difference]: Start difference. First operand 464 states and 619 transitions. Second operand has 4 states, 4 states have (on average 8.75) internal successors, (35), 4 states have internal predecessors, (35), 2 states have call successors, (4), 2 states have call predecessors, (4), 1 states have return successors, (3), 1 states have call predecessors, (3), 1 states have call successors, (3) [2025-01-08 22:49:05,890 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-01-08 22:49:05,891 INFO L93 Difference]: Finished difference Result 511 states and 678 transitions. [2025-01-08 22:49:05,892 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2025-01-08 22:49:05,892 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 4 states have (on average 8.75) internal successors, (35), 4 states have internal predecessors, (35), 2 states have call successors, (4), 2 states have call predecessors, (4), 1 states have return successors, (3), 1 states have call predecessors, (3), 1 states have call successors, (3) Word has length 49 [2025-01-08 22:49:05,892 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-01-08 22:49:05,893 INFO L225 Difference]: With dead ends: 511 [2025-01-08 22:49:05,893 INFO L226 Difference]: Without dead ends: 464 [2025-01-08 22:49:05,894 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 48 GetRequests, 46 SyntacticMatches, 0 SemanticMatches, 2 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2025-01-08 22:49:05,895 INFO L435 NwaCegarLoop]: 101 mSDtfsCounter, 26 mSDsluCounter, 171 mSDsCounter, 0 mSdLazyCounter, 14 mSolverCounterSat, 1 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 30 SdHoareTripleChecker+Valid, 272 SdHoareTripleChecker+Invalid, 15 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 1 IncrementalHoareTripleChecker+Valid, 14 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2025-01-08 22:49:05,895 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [30 Valid, 272 Invalid, 15 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [1 Valid, 14 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2025-01-08 22:49:05,896 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 464 states. [2025-01-08 22:49:05,908 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 464 to 464. [2025-01-08 22:49:05,909 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 464 states, 406 states have (on average 1.2167487684729064) internal successors, (494), 411 states have internal predecessors, (494), 48 states have call successors, (48), 6 states have call predecessors, (48), 9 states have return successors, (56), 52 states have call predecessors, (56), 46 states have call successors, (56) [2025-01-08 22:49:05,910 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 464 states to 464 states and 598 transitions. [2025-01-08 22:49:05,910 INFO L78 Accepts]: Start accepts. Automaton has 464 states and 598 transitions. Word has length 49 [2025-01-08 22:49:05,910 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-01-08 22:49:05,910 INFO L471 AbstractCegarLoop]: Abstraction has 464 states and 598 transitions. [2025-01-08 22:49:05,911 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 8.75) internal successors, (35), 4 states have internal predecessors, (35), 2 states have call successors, (4), 2 states have call predecessors, (4), 1 states have return successors, (3), 1 states have call predecessors, (3), 1 states have call successors, (3) [2025-01-08 22:49:05,911 INFO L276 IsEmpty]: Start isEmpty. Operand 464 states and 598 transitions. [2025-01-08 22:49:05,911 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 50 [2025-01-08 22:49:05,911 INFO L210 NwaCegarLoop]: Found error trace [2025-01-08 22:49:05,911 INFO L218 NwaCegarLoop]: trace histogram [3, 3, 3, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-01-08 22:49:05,917 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (24)] Ended with exit code 0 [2025-01-08 22:49:06,112 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 24 /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-01-08 22:49:06,112 INFO L396 AbstractCegarLoop]: === Iteration 23 === Targeting __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-01-08 22:49:06,113 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-01-08 22:49:06,113 INFO L85 PathProgramCache]: Analyzing trace with hash -1999328849, now seen corresponding path program 1 times [2025-01-08 22:49:06,113 INFO L118 FreeRefinementEngine]: Executing refinement strategy FOX [2025-01-08 22:49:06,113 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleZ3 [1270553918] [2025-01-08 22:49:06,113 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-01-08 22:49:06,114 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-01-08 22:49:06,114 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 [2025-01-08 22:49:06,116 INFO L229 MonitoredProcess]: Starting monitored process 25 with /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2025-01-08 22:49:06,117 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (25)] Waiting until timeout for monitored process [2025-01-08 22:49:06,143 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 49 statements into 1 equivalence classes. [2025-01-08 22:49:06,151 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 49 of 49 statements. [2025-01-08 22:49:06,151 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-01-08 22:49:06,151 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-01-08 22:49:06,152 INFO L256 TraceCheckSpWp]: Trace formula consists of 87 conjuncts, 6 conjuncts are in the unsatisfiable core [2025-01-08 22:49:06,153 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-01-08 22:49:06,191 INFO L134 CoverageAnalysis]: Checked inductivity of 15 backedges. 0 proven. 6 refuted. 0 times theorem prover too weak. 9 trivial. 0 not checked. [2025-01-08 22:49:06,191 INFO L312 TraceCheckSpWp]: Computing backward predicates... [2025-01-08 22:49:06,233 INFO L134 CoverageAnalysis]: Checked inductivity of 15 backedges. 0 proven. 6 refuted. 0 times theorem prover too weak. 9 trivial. 0 not checked. [2025-01-08 22:49:06,233 INFO L136 FreeRefinementEngine]: Strategy FOX found an infeasible trace [2025-01-08 22:49:06,233 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1270553918] [2025-01-08 22:49:06,233 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1270553918] provided 0 perfect and 2 imperfect interpolant sequences [2025-01-08 22:49:06,233 INFO L185 FreeRefinementEngine]: Found 0 perfect and 2 imperfect interpolant sequences. [2025-01-08 22:49:06,233 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [7, 7] total 7 [2025-01-08 22:49:06,233 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [913717817] [2025-01-08 22:49:06,233 INFO L85 oduleStraightlineAll]: Using 2 imperfect interpolants to construct interpolant automaton [2025-01-08 22:49:06,233 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 7 states [2025-01-08 22:49:06,233 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy FOX [2025-01-08 22:49:06,234 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2025-01-08 22:49:06,234 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=11, Invalid=31, Unknown=0, NotChecked=0, Total=42 [2025-01-08 22:49:06,234 INFO L87 Difference]: Start difference. First operand 464 states and 598 transitions. Second operand has 7 states, 7 states have (on average 5.428571428571429) internal successors, (38), 6 states have internal predecessors, (38), 3 states have call successors, (4), 2 states have call predecessors, (4), 2 states have return successors, (3), 2 states have call predecessors, (3), 2 states have call successors, (3) [2025-01-08 22:49:06,302 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-01-08 22:49:06,303 INFO L93 Difference]: Finished difference Result 492 states and 631 transitions. [2025-01-08 22:49:06,303 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2025-01-08 22:49:06,303 INFO L78 Accepts]: Start accepts. Automaton has has 7 states, 7 states have (on average 5.428571428571429) internal successors, (38), 6 states have internal predecessors, (38), 3 states have call successors, (4), 2 states have call predecessors, (4), 2 states have return successors, (3), 2 states have call predecessors, (3), 2 states have call successors, (3) Word has length 49 [2025-01-08 22:49:06,303 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-01-08 22:49:06,304 INFO L225 Difference]: With dead ends: 492 [2025-01-08 22:49:06,304 INFO L226 Difference]: Without dead ends: 456 [2025-01-08 22:49:06,305 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 97 GetRequests, 89 SyntacticMatches, 2 SemanticMatches, 6 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=15, Invalid=41, Unknown=0, NotChecked=0, Total=56 [2025-01-08 22:49:06,305 INFO L435 NwaCegarLoop]: 100 mSDtfsCounter, 20 mSDsluCounter, 463 mSDsCounter, 0 mSdLazyCounter, 72 mSolverCounterSat, 1 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 22 SdHoareTripleChecker+Valid, 563 SdHoareTripleChecker+Invalid, 73 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 1 IncrementalHoareTripleChecker+Valid, 72 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2025-01-08 22:49:06,305 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [22 Valid, 563 Invalid, 73 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [1 Valid, 72 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2025-01-08 22:49:06,306 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 456 states. [2025-01-08 22:49:06,327 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 456 to 440. [2025-01-08 22:49:06,327 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 440 states, 382 states have (on average 1.219895287958115) internal successors, (466), 388 states have internal predecessors, (466), 48 states have call successors, (48), 6 states have call predecessors, (48), 9 states have return successors, (56), 51 states have call predecessors, (56), 46 states have call successors, (56) [2025-01-08 22:49:06,330 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 440 states to 440 states and 570 transitions. [2025-01-08 22:49:06,330 INFO L78 Accepts]: Start accepts. Automaton has 440 states and 570 transitions. Word has length 49 [2025-01-08 22:49:06,330 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-01-08 22:49:06,330 INFO L471 AbstractCegarLoop]: Abstraction has 440 states and 570 transitions. [2025-01-08 22:49:06,330 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 7 states, 7 states have (on average 5.428571428571429) internal successors, (38), 6 states have internal predecessors, (38), 3 states have call successors, (4), 2 states have call predecessors, (4), 2 states have return successors, (3), 2 states have call predecessors, (3), 2 states have call successors, (3) [2025-01-08 22:49:06,331 INFO L276 IsEmpty]: Start isEmpty. Operand 440 states and 570 transitions. [2025-01-08 22:49:06,331 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 52 [2025-01-08 22:49:06,331 INFO L210 NwaCegarLoop]: Found error trace [2025-01-08 22:49:06,331 INFO L218 NwaCegarLoop]: trace histogram [3, 3, 3, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-01-08 22:49:06,337 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (25)] Ended with exit code 0 [2025-01-08 22:49:06,533 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 25 /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-01-08 22:49:06,534 INFO L396 AbstractCegarLoop]: === Iteration 24 === Targeting __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-01-08 22:49:06,534 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-01-08 22:49:06,534 INFO L85 PathProgramCache]: Analyzing trace with hash -206160817, now seen corresponding path program 1 times [2025-01-08 22:49:06,534 INFO L118 FreeRefinementEngine]: Executing refinement strategy FOX [2025-01-08 22:49:06,534 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleZ3 [1954001492] [2025-01-08 22:49:06,534 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-01-08 22:49:06,534 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-01-08 22:49:06,534 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 [2025-01-08 22:49:06,539 INFO L229 MonitoredProcess]: Starting monitored process 26 with /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2025-01-08 22:49:06,540 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (26)] Waiting until timeout for monitored process [2025-01-08 22:49:06,572 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 51 statements into 1 equivalence classes. [2025-01-08 22:49:06,582 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 51 of 51 statements. [2025-01-08 22:49:06,582 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-01-08 22:49:06,582 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-01-08 22:49:06,584 INFO L256 TraceCheckSpWp]: Trace formula consists of 91 conjuncts, 3 conjuncts are in the unsatisfiable core [2025-01-08 22:49:06,585 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-01-08 22:49:06,605 INFO L134 CoverageAnalysis]: Checked inductivity of 15 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 15 trivial. 0 not checked. [2025-01-08 22:49:06,606 INFO L308 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2025-01-08 22:49:06,606 INFO L136 FreeRefinementEngine]: Strategy FOX found an infeasible trace [2025-01-08 22:49:06,606 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1954001492] [2025-01-08 22:49:06,606 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1954001492] provided 1 perfect and 0 imperfect interpolant sequences [2025-01-08 22:49:06,606 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-01-08 22:49:06,606 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2025-01-08 22:49:06,606 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [708090097] [2025-01-08 22:49:06,606 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-01-08 22:49:06,607 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2025-01-08 22:49:06,607 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy FOX [2025-01-08 22:49:06,607 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2025-01-08 22:49:06,607 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2025-01-08 22:49:06,607 INFO L87 Difference]: Start difference. First operand 440 states and 570 transitions. Second operand has 4 states, 4 states have (on average 9.25) internal successors, (37), 4 states have internal predecessors, (37), 2 states have call successors, (4), 2 states have call predecessors, (4), 1 states have return successors, (3), 1 states have call predecessors, (3), 1 states have call successors, (3) [2025-01-08 22:49:06,631 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-01-08 22:49:06,631 INFO L93 Difference]: Finished difference Result 449 states and 578 transitions. [2025-01-08 22:49:06,631 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2025-01-08 22:49:06,631 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 4 states have (on average 9.25) internal successors, (37), 4 states have internal predecessors, (37), 2 states have call successors, (4), 2 states have call predecessors, (4), 1 states have return successors, (3), 1 states have call predecessors, (3), 1 states have call successors, (3) Word has length 51 [2025-01-08 22:49:06,631 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-01-08 22:49:06,632 INFO L225 Difference]: With dead ends: 449 [2025-01-08 22:49:06,632 INFO L226 Difference]: Without dead ends: 402 [2025-01-08 22:49:06,633 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 50 GetRequests, 48 SyntacticMatches, 0 SemanticMatches, 2 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2025-01-08 22:49:06,633 INFO L435 NwaCegarLoop]: 93 mSDtfsCounter, 0 mSDsluCounter, 180 mSDsCounter, 0 mSdLazyCounter, 8 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 0 SdHoareTripleChecker+Valid, 273 SdHoareTripleChecker+Invalid, 8 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 8 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2025-01-08 22:49:06,633 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [0 Valid, 273 Invalid, 8 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 8 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2025-01-08 22:49:06,633 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 402 states. [2025-01-08 22:49:06,645 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 402 to 365. [2025-01-08 22:49:06,645 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 365 states, 317 states have (on average 1.2176656151419558) internal successors, (386), 322 states have internal predecessors, (386), 38 states have call successors, (38), 6 states have call predecessors, (38), 9 states have return successors, (43), 40 states have call predecessors, (43), 36 states have call successors, (43) [2025-01-08 22:49:06,646 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 365 states to 365 states and 467 transitions. [2025-01-08 22:49:06,646 INFO L78 Accepts]: Start accepts. Automaton has 365 states and 467 transitions. Word has length 51 [2025-01-08 22:49:06,647 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-01-08 22:49:06,647 INFO L471 AbstractCegarLoop]: Abstraction has 365 states and 467 transitions. [2025-01-08 22:49:06,647 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 9.25) internal successors, (37), 4 states have internal predecessors, (37), 2 states have call successors, (4), 2 states have call predecessors, (4), 1 states have return successors, (3), 1 states have call predecessors, (3), 1 states have call successors, (3) [2025-01-08 22:49:06,647 INFO L276 IsEmpty]: Start isEmpty. Operand 365 states and 467 transitions. [2025-01-08 22:49:06,647 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 52 [2025-01-08 22:49:06,647 INFO L210 NwaCegarLoop]: Found error trace [2025-01-08 22:49:06,648 INFO L218 NwaCegarLoop]: trace histogram [3, 3, 3, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-01-08 22:49:06,654 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (26)] Forceful destruction successful, exit code 0 [2025-01-08 22:49:06,848 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 26 /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-01-08 22:49:06,848 INFO L396 AbstractCegarLoop]: === Iteration 25 === Targeting __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-01-08 22:49:06,849 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-01-08 22:49:06,849 INFO L85 PathProgramCache]: Analyzing trace with hash 60747821, now seen corresponding path program 1 times [2025-01-08 22:49:06,849 INFO L118 FreeRefinementEngine]: Executing refinement strategy FOX [2025-01-08 22:49:06,849 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleZ3 [660452271] [2025-01-08 22:49:06,849 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-01-08 22:49:06,849 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-01-08 22:49:06,849 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 [2025-01-08 22:49:06,854 INFO L229 MonitoredProcess]: Starting monitored process 27 with /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2025-01-08 22:49:06,861 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (27)] Waiting until timeout for monitored process [2025-01-08 22:49:06,889 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 51 statements into 1 equivalence classes. [2025-01-08 22:49:06,898 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 51 of 51 statements. [2025-01-08 22:49:06,898 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-01-08 22:49:06,898 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-01-08 22:49:06,899 INFO L256 TraceCheckSpWp]: Trace formula consists of 88 conjuncts, 10 conjuncts are in the unsatisfiable core [2025-01-08 22:49:06,901 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-01-08 22:49:07,002 INFO L134 CoverageAnalysis]: Checked inductivity of 15 backedges. 3 proven. 3 refuted. 0 times theorem prover too weak. 9 trivial. 0 not checked. [2025-01-08 22:49:07,002 INFO L312 TraceCheckSpWp]: Computing backward predicates... [2025-01-08 22:49:07,067 INFO L134 CoverageAnalysis]: Checked inductivity of 15 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 15 trivial. 0 not checked. [2025-01-08 22:49:07,067 INFO L136 FreeRefinementEngine]: Strategy FOX found an infeasible trace [2025-01-08 22:49:07,067 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [660452271] [2025-01-08 22:49:07,067 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [660452271] provided 1 perfect and 1 imperfect interpolant sequences [2025-01-08 22:49:07,067 INFO L185 FreeRefinementEngine]: Found 1 perfect and 1 imperfect interpolant sequences. [2025-01-08 22:49:07,067 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [10] total 14 [2025-01-08 22:49:07,068 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [593288589] [2025-01-08 22:49:07,068 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-01-08 22:49:07,068 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2025-01-08 22:49:07,068 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy FOX [2025-01-08 22:49:07,068 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2025-01-08 22:49:07,069 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=33, Invalid=149, Unknown=0, NotChecked=0, Total=182 [2025-01-08 22:49:07,069 INFO L87 Difference]: Start difference. First operand 365 states and 467 transitions. Second operand has 6 states, 6 states have (on average 6.166666666666667) internal successors, (37), 6 states have internal predecessors, (37), 2 states have call successors, (4), 2 states have call predecessors, (4), 1 states have return successors, (3), 1 states have call predecessors, (3), 1 states have call successors, (3) [2025-01-08 22:49:07,221 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-01-08 22:49:07,222 INFO L93 Difference]: Finished difference Result 446 states and 566 transitions. [2025-01-08 22:49:07,222 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2025-01-08 22:49:07,222 INFO L78 Accepts]: Start accepts. Automaton has has 6 states, 6 states have (on average 6.166666666666667) internal successors, (37), 6 states have internal predecessors, (37), 2 states have call successors, (4), 2 states have call predecessors, (4), 1 states have return successors, (3), 1 states have call predecessors, (3), 1 states have call successors, (3) Word has length 51 [2025-01-08 22:49:07,222 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-01-08 22:49:07,223 INFO L225 Difference]: With dead ends: 446 [2025-01-08 22:49:07,224 INFO L226 Difference]: Without dead ends: 385 [2025-01-08 22:49:07,224 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 102 GetRequests, 88 SyntacticMatches, 0 SemanticMatches, 14 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 31 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=41, Invalid=199, Unknown=0, NotChecked=0, Total=240 [2025-01-08 22:49:07,224 INFO L435 NwaCegarLoop]: 83 mSDtfsCounter, 24 mSDsluCounter, 263 mSDsCounter, 0 mSdLazyCounter, 128 mSolverCounterSat, 6 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 28 SdHoareTripleChecker+Valid, 346 SdHoareTripleChecker+Invalid, 134 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 6 IncrementalHoareTripleChecker+Valid, 128 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2025-01-08 22:49:07,224 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [28 Valid, 346 Invalid, 134 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [6 Valid, 128 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2025-01-08 22:49:07,225 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 385 states. [2025-01-08 22:49:07,236 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 385 to 355. [2025-01-08 22:49:07,239 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 355 states, 307 states have (on average 1.214983713355049) internal successors, (373), 311 states have internal predecessors, (373), 39 states have call successors, (39), 6 states have call predecessors, (39), 8 states have return successors, (40), 40 states have call predecessors, (40), 37 states have call successors, (40) [2025-01-08 22:49:07,240 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 355 states to 355 states and 452 transitions. [2025-01-08 22:49:07,240 INFO L78 Accepts]: Start accepts. Automaton has 355 states and 452 transitions. Word has length 51 [2025-01-08 22:49:07,240 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-01-08 22:49:07,240 INFO L471 AbstractCegarLoop]: Abstraction has 355 states and 452 transitions. [2025-01-08 22:49:07,241 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 6 states have (on average 6.166666666666667) internal successors, (37), 6 states have internal predecessors, (37), 2 states have call successors, (4), 2 states have call predecessors, (4), 1 states have return successors, (3), 1 states have call predecessors, (3), 1 states have call successors, (3) [2025-01-08 22:49:07,241 INFO L276 IsEmpty]: Start isEmpty. Operand 355 states and 452 transitions. [2025-01-08 22:49:07,241 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 53 [2025-01-08 22:49:07,241 INFO L210 NwaCegarLoop]: Found error trace [2025-01-08 22:49:07,242 INFO L218 NwaCegarLoop]: trace histogram [3, 3, 3, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-01-08 22:49:07,252 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (27)] Forceful destruction successful, exit code 0 [2025-01-08 22:49:07,442 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 27 /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-01-08 22:49:07,442 INFO L396 AbstractCegarLoop]: === Iteration 26 === Targeting __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-01-08 22:49:07,443 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-01-08 22:49:07,443 INFO L85 PathProgramCache]: Analyzing trace with hash 1894639580, now seen corresponding path program 1 times [2025-01-08 22:49:07,443 INFO L118 FreeRefinementEngine]: Executing refinement strategy FOX [2025-01-08 22:49:07,443 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleZ3 [963090002] [2025-01-08 22:49:07,443 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-01-08 22:49:07,443 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-01-08 22:49:07,443 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 [2025-01-08 22:49:07,445 INFO L229 MonitoredProcess]: Starting monitored process 28 with /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2025-01-08 22:49:07,447 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (28)] Waiting until timeout for monitored process [2025-01-08 22:49:07,480 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 52 statements into 1 equivalence classes. [2025-01-08 22:49:07,493 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 52 of 52 statements. [2025-01-08 22:49:07,494 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-01-08 22:49:07,494 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-01-08 22:49:07,495 INFO L256 TraceCheckSpWp]: Trace formula consists of 92 conjuncts, 21 conjuncts are in the unsatisfiable core [2025-01-08 22:49:07,496 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-01-08 22:49:07,676 INFO L134 CoverageAnalysis]: Checked inductivity of 20 backedges. 8 proven. 0 refuted. 0 times theorem prover too weak. 12 trivial. 0 not checked. [2025-01-08 22:49:07,676 INFO L308 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2025-01-08 22:49:07,676 INFO L136 FreeRefinementEngine]: Strategy FOX found an infeasible trace [2025-01-08 22:49:07,676 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [963090002] [2025-01-08 22:49:07,676 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [963090002] provided 1 perfect and 0 imperfect interpolant sequences [2025-01-08 22:49:07,676 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-01-08 22:49:07,676 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [13] imperfect sequences [] total 13 [2025-01-08 22:49:07,677 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1528944581] [2025-01-08 22:49:07,677 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-01-08 22:49:07,677 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 13 states [2025-01-08 22:49:07,677 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy FOX [2025-01-08 22:49:07,678 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 13 interpolants. [2025-01-08 22:49:07,678 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=27, Invalid=129, Unknown=0, NotChecked=0, Total=156 [2025-01-08 22:49:07,678 INFO L87 Difference]: Start difference. First operand 355 states and 452 transitions. Second operand has 13 states, 12 states have (on average 2.9166666666666665) internal successors, (35), 11 states have internal predecessors, (35), 4 states have call successors, (5), 2 states have call predecessors, (5), 2 states have return successors, (4), 4 states have call predecessors, (4), 3 states have call successors, (4) [2025-01-08 22:49:07,981 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-01-08 22:49:07,982 INFO L93 Difference]: Finished difference Result 441 states and 560 transitions. [2025-01-08 22:49:07,982 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 13 states. [2025-01-08 22:49:07,982 INFO L78 Accepts]: Start accepts. Automaton has has 13 states, 12 states have (on average 2.9166666666666665) internal successors, (35), 11 states have internal predecessors, (35), 4 states have call successors, (5), 2 states have call predecessors, (5), 2 states have return successors, (4), 4 states have call predecessors, (4), 3 states have call successors, (4) Word has length 52 [2025-01-08 22:49:07,982 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-01-08 22:49:07,984 INFO L225 Difference]: With dead ends: 441 [2025-01-08 22:49:07,984 INFO L226 Difference]: Without dead ends: 396 [2025-01-08 22:49:07,984 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 56 GetRequests, 40 SyntacticMatches, 0 SemanticMatches, 16 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 21 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=56, Invalid=250, Unknown=0, NotChecked=0, Total=306 [2025-01-08 22:49:07,984 INFO L435 NwaCegarLoop]: 90 mSDtfsCounter, 69 mSDsluCounter, 930 mSDsCounter, 0 mSdLazyCounter, 361 mSolverCounterSat, 2 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 77 SdHoareTripleChecker+Valid, 1020 SdHoareTripleChecker+Invalid, 363 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 2 IncrementalHoareTripleChecker+Valid, 361 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.2s IncrementalHoareTripleChecker+Time [2025-01-08 22:49:07,985 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [77 Valid, 1020 Invalid, 363 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [2 Valid, 361 Invalid, 0 Unknown, 0 Unchecked, 0.2s Time] [2025-01-08 22:49:07,985 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 396 states. [2025-01-08 22:49:07,995 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 396 to 355. [2025-01-08 22:49:07,995 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 355 states, 307 states have (on average 1.205211726384365) internal successors, (370), 311 states have internal predecessors, (370), 39 states have call successors, (39), 6 states have call predecessors, (39), 8 states have return successors, (40), 40 states have call predecessors, (40), 37 states have call successors, (40) [2025-01-08 22:49:07,996 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 355 states to 355 states and 449 transitions. [2025-01-08 22:49:07,996 INFO L78 Accepts]: Start accepts. Automaton has 355 states and 449 transitions. Word has length 52 [2025-01-08 22:49:07,996 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-01-08 22:49:07,996 INFO L471 AbstractCegarLoop]: Abstraction has 355 states and 449 transitions. [2025-01-08 22:49:07,996 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 13 states, 12 states have (on average 2.9166666666666665) internal successors, (35), 11 states have internal predecessors, (35), 4 states have call successors, (5), 2 states have call predecessors, (5), 2 states have return successors, (4), 4 states have call predecessors, (4), 3 states have call successors, (4) [2025-01-08 22:49:07,997 INFO L276 IsEmpty]: Start isEmpty. Operand 355 states and 449 transitions. [2025-01-08 22:49:07,997 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 53 [2025-01-08 22:49:07,997 INFO L210 NwaCegarLoop]: Found error trace [2025-01-08 22:49:07,997 INFO L218 NwaCegarLoop]: trace histogram [3, 3, 3, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-01-08 22:49:08,004 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (28)] Ended with exit code 0 [2025-01-08 22:49:08,197 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 28 /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-01-08 22:49:08,198 INFO L396 AbstractCegarLoop]: === Iteration 27 === Targeting __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-01-08 22:49:08,198 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-01-08 22:49:08,198 INFO L85 PathProgramCache]: Analyzing trace with hash 1752423704, now seen corresponding path program 1 times [2025-01-08 22:49:08,198 INFO L118 FreeRefinementEngine]: Executing refinement strategy FOX [2025-01-08 22:49:08,198 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleZ3 [1142846998] [2025-01-08 22:49:08,198 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-01-08 22:49:08,198 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-01-08 22:49:08,198 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 [2025-01-08 22:49:08,203 INFO L229 MonitoredProcess]: Starting monitored process 29 with /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2025-01-08 22:49:08,208 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (29)] Waiting until timeout for monitored process [2025-01-08 22:49:08,239 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 52 statements into 1 equivalence classes. [2025-01-08 22:49:08,250 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 52 of 52 statements. [2025-01-08 22:49:08,250 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-01-08 22:49:08,250 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-01-08 22:49:08,252 INFO L256 TraceCheckSpWp]: Trace formula consists of 93 conjuncts, 18 conjuncts are in the unsatisfiable core [2025-01-08 22:49:08,253 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-01-08 22:49:08,527 INFO L134 CoverageAnalysis]: Checked inductivity of 19 backedges. 5 proven. 3 refuted. 0 times theorem prover too weak. 11 trivial. 0 not checked. [2025-01-08 22:49:08,528 INFO L312 TraceCheckSpWp]: Computing backward predicates... [2025-01-08 22:49:08,772 INFO L136 FreeRefinementEngine]: Strategy FOX found an infeasible trace [2025-01-08 22:49:08,772 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1142846998] [2025-01-08 22:49:08,772 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1142846998] provided 0 perfect and 1 imperfect interpolant sequences [2025-01-08 22:49:08,773 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleCvc4 [802765991] [2025-01-08 22:49:08,773 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-01-08 22:49:08,773 INFO L173 SolverBuilder]: Constructing external solver with command: cvc4 --incremental --print-success --lang smt [2025-01-08 22:49:08,773 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/cvc4 [2025-01-08 22:49:08,775 INFO L229 MonitoredProcess]: Starting monitored process 30 with /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/cvc4 --incremental --print-success --lang smt (exit command is (exit), workingDir is null) [2025-01-08 22:49:08,776 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/cvc4 --incremental --print-success --lang smt (30)] Waiting until timeout for monitored process [2025-01-08 22:49:08,814 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 52 statements into 1 equivalence classes. [2025-01-08 22:49:08,842 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 52 of 52 statements. [2025-01-08 22:49:08,842 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-01-08 22:49:08,842 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-01-08 22:49:08,845 INFO L256 TraceCheckSpWp]: Trace formula consists of 93 conjuncts, 12 conjuncts are in the unsatisfiable core [2025-01-08 22:49:08,846 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-01-08 22:49:08,916 INFO L134 CoverageAnalysis]: Checked inductivity of 19 backedges. 5 proven. 3 refuted. 0 times theorem prover too weak. 11 trivial. 0 not checked. [2025-01-08 22:49:08,916 INFO L312 TraceCheckSpWp]: Computing backward predicates... [2025-01-08 22:49:09,047 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleCvc4 [802765991] provided 0 perfect and 1 imperfect interpolant sequences [2025-01-08 22:49:09,051 INFO L185 FreeRefinementEngine]: Found 0 perfect and 2 imperfect interpolant sequences. [2025-01-08 22:49:09,051 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [12, 10] total 12 [2025-01-08 22:49:09,052 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [822030200] [2025-01-08 22:49:09,052 INFO L85 oduleStraightlineAll]: Using 2 imperfect interpolants to construct interpolant automaton [2025-01-08 22:49:09,052 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 12 states [2025-01-08 22:49:09,052 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy FOX [2025-01-08 22:49:09,052 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 12 interpolants. [2025-01-08 22:49:09,052 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=59, Invalid=321, Unknown=0, NotChecked=0, Total=380 [2025-01-08 22:49:09,052 INFO L87 Difference]: Start difference. First operand 355 states and 449 transitions. Second operand has 12 states, 12 states have (on average 3.3333333333333335) internal successors, (40), 11 states have internal predecessors, (40), 4 states have call successors, (5), 2 states have call predecessors, (5), 3 states have return successors, (5), 4 states have call predecessors, (5), 3 states have call successors, (5) [2025-01-08 22:49:09,363 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-01-08 22:49:09,363 INFO L93 Difference]: Finished difference Result 436 states and 554 transitions. [2025-01-08 22:49:09,363 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 12 states. [2025-01-08 22:49:09,363 INFO L78 Accepts]: Start accepts. Automaton has has 12 states, 12 states have (on average 3.3333333333333335) internal successors, (40), 11 states have internal predecessors, (40), 4 states have call successors, (5), 2 states have call predecessors, (5), 3 states have return successors, (5), 4 states have call predecessors, (5), 3 states have call successors, (5) Word has length 52 [2025-01-08 22:49:09,363 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-01-08 22:49:09,365 INFO L225 Difference]: With dead ends: 436 [2025-01-08 22:49:09,365 INFO L226 Difference]: Without dead ends: 396 [2025-01-08 22:49:09,365 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 126 GetRequests, 102 SyntacticMatches, 2 SemanticMatches, 22 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 35 ImplicationChecksByTransitivity, 0.5s TimeCoverageRelationStatistics Valid=97, Invalid=455, Unknown=0, NotChecked=0, Total=552 [2025-01-08 22:49:09,365 INFO L435 NwaCegarLoop]: 110 mSDtfsCounter, 45 mSDsluCounter, 989 mSDsCounter, 0 mSdLazyCounter, 319 mSolverCounterSat, 4 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 47 SdHoareTripleChecker+Valid, 1099 SdHoareTripleChecker+Invalid, 323 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 4 IncrementalHoareTripleChecker+Valid, 319 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.2s IncrementalHoareTripleChecker+Time [2025-01-08 22:49:09,366 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [47 Valid, 1099 Invalid, 323 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [4 Valid, 319 Invalid, 0 Unknown, 0 Unchecked, 0.2s Time] [2025-01-08 22:49:09,366 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 396 states. [2025-01-08 22:49:09,388 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 396 to 355. [2025-01-08 22:49:09,388 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 355 states, 307 states have (on average 1.1986970684039089) internal successors, (368), 311 states have internal predecessors, (368), 39 states have call successors, (39), 6 states have call predecessors, (39), 8 states have return successors, (40), 40 states have call predecessors, (40), 37 states have call successors, (40) [2025-01-08 22:49:09,389 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 355 states to 355 states and 447 transitions. [2025-01-08 22:49:09,389 INFO L78 Accepts]: Start accepts. Automaton has 355 states and 447 transitions. Word has length 52 [2025-01-08 22:49:09,390 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-01-08 22:49:09,390 INFO L471 AbstractCegarLoop]: Abstraction has 355 states and 447 transitions. [2025-01-08 22:49:09,390 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 12 states, 12 states have (on average 3.3333333333333335) internal successors, (40), 11 states have internal predecessors, (40), 4 states have call successors, (5), 2 states have call predecessors, (5), 3 states have return successors, (5), 4 states have call predecessors, (5), 3 states have call successors, (5) [2025-01-08 22:49:09,390 INFO L276 IsEmpty]: Start isEmpty. Operand 355 states and 447 transitions. [2025-01-08 22:49:09,390 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 53 [2025-01-08 22:49:09,391 INFO L210 NwaCegarLoop]: Found error trace [2025-01-08 22:49:09,391 INFO L218 NwaCegarLoop]: trace histogram [3, 3, 3, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-01-08 22:49:09,393 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/cvc4 --incremental --print-success --lang smt (30)] Ended with exit code 0 [2025-01-08 22:49:09,599 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (29)] Forceful destruction successful, exit code 0 [2025-01-08 22:49:09,793 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 30 /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/cvc4 --incremental --print-success --lang smt,29 /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-01-08 22:49:09,793 INFO L396 AbstractCegarLoop]: === Iteration 28 === Targeting __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-01-08 22:49:09,793 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-01-08 22:49:09,793 INFO L85 PathProgramCache]: Analyzing trace with hash -2017737126, now seen corresponding path program 1 times [2025-01-08 22:49:09,794 INFO L118 FreeRefinementEngine]: Executing refinement strategy FOX [2025-01-08 22:49:09,794 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleZ3 [569500761] [2025-01-08 22:49:09,794 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-01-08 22:49:09,794 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-01-08 22:49:09,794 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 [2025-01-08 22:49:09,797 INFO L229 MonitoredProcess]: Starting monitored process 31 with /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2025-01-08 22:49:09,798 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (31)] Waiting until timeout for monitored process [2025-01-08 22:49:09,824 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 52 statements into 1 equivalence classes. [2025-01-08 22:49:09,835 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 52 of 52 statements. [2025-01-08 22:49:09,835 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-01-08 22:49:09,835 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-01-08 22:49:09,839 INFO L256 TraceCheckSpWp]: Trace formula consists of 96 conjuncts, 19 conjuncts are in the unsatisfiable core [2025-01-08 22:49:09,840 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-01-08 22:49:09,971 INFO L134 CoverageAnalysis]: Checked inductivity of 19 backedges. 8 proven. 0 refuted. 0 times theorem prover too weak. 11 trivial. 0 not checked. [2025-01-08 22:49:09,971 INFO L308 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2025-01-08 22:49:09,971 INFO L136 FreeRefinementEngine]: Strategy FOX found an infeasible trace [2025-01-08 22:49:09,971 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [569500761] [2025-01-08 22:49:09,971 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [569500761] provided 1 perfect and 0 imperfect interpolant sequences [2025-01-08 22:49:09,971 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-01-08 22:49:09,971 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [13] imperfect sequences [] total 13 [2025-01-08 22:49:09,971 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1766486801] [2025-01-08 22:49:09,972 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-01-08 22:49:09,972 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 13 states [2025-01-08 22:49:09,972 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy FOX [2025-01-08 22:49:09,972 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 13 interpolants. [2025-01-08 22:49:09,972 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=24, Invalid=132, Unknown=0, NotChecked=0, Total=156 [2025-01-08 22:49:09,972 INFO L87 Difference]: Start difference. First operand 355 states and 447 transitions. Second operand has 13 states, 13 states have (on average 2.8461538461538463) internal successors, (37), 12 states have internal predecessors, (37), 3 states have call successors, (5), 2 states have call predecessors, (5), 3 states have return successors, (4), 3 states have call predecessors, (4), 2 states have call successors, (4) [2025-01-08 22:49:10,261 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-01-08 22:49:10,261 INFO L93 Difference]: Finished difference Result 427 states and 535 transitions. [2025-01-08 22:49:10,261 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 14 states. [2025-01-08 22:49:10,261 INFO L78 Accepts]: Start accepts. Automaton has has 13 states, 13 states have (on average 2.8461538461538463) internal successors, (37), 12 states have internal predecessors, (37), 3 states have call successors, (5), 2 states have call predecessors, (5), 3 states have return successors, (4), 3 states have call predecessors, (4), 2 states have call successors, (4) Word has length 52 [2025-01-08 22:49:10,262 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-01-08 22:49:10,263 INFO L225 Difference]: With dead ends: 427 [2025-01-08 22:49:10,263 INFO L226 Difference]: Without dead ends: 373 [2025-01-08 22:49:10,263 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 57 GetRequests, 40 SyntacticMatches, 0 SemanticMatches, 17 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 11 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=59, Invalid=283, Unknown=0, NotChecked=0, Total=342 [2025-01-08 22:49:10,264 INFO L435 NwaCegarLoop]: 76 mSDtfsCounter, 53 mSDsluCounter, 726 mSDsCounter, 0 mSdLazyCounter, 304 mSolverCounterSat, 5 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 55 SdHoareTripleChecker+Valid, 802 SdHoareTripleChecker+Invalid, 309 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 5 IncrementalHoareTripleChecker+Valid, 304 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.2s IncrementalHoareTripleChecker+Time [2025-01-08 22:49:10,264 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [55 Valid, 802 Invalid, 309 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [5 Valid, 304 Invalid, 0 Unknown, 0 Unchecked, 0.2s Time] [2025-01-08 22:49:10,264 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 373 states. [2025-01-08 22:49:10,284 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 373 to 355. [2025-01-08 22:49:10,285 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 355 states, 307 states have (on average 1.1889250814332248) internal successors, (365), 311 states have internal predecessors, (365), 39 states have call successors, (39), 6 states have call predecessors, (39), 8 states have return successors, (40), 40 states have call predecessors, (40), 37 states have call successors, (40) [2025-01-08 22:49:10,285 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 355 states to 355 states and 444 transitions. [2025-01-08 22:49:10,285 INFO L78 Accepts]: Start accepts. Automaton has 355 states and 444 transitions. Word has length 52 [2025-01-08 22:49:10,286 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-01-08 22:49:10,286 INFO L471 AbstractCegarLoop]: Abstraction has 355 states and 444 transitions. [2025-01-08 22:49:10,286 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 13 states, 13 states have (on average 2.8461538461538463) internal successors, (37), 12 states have internal predecessors, (37), 3 states have call successors, (5), 2 states have call predecessors, (5), 3 states have return successors, (4), 3 states have call predecessors, (4), 2 states have call successors, (4) [2025-01-08 22:49:10,286 INFO L276 IsEmpty]: Start isEmpty. Operand 355 states and 444 transitions. [2025-01-08 22:49:10,286 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 53 [2025-01-08 22:49:10,286 INFO L210 NwaCegarLoop]: Found error trace [2025-01-08 22:49:10,286 INFO L218 NwaCegarLoop]: trace histogram [3, 3, 3, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-01-08 22:49:10,293 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (31)] Forceful destruction successful, exit code 0 [2025-01-08 22:49:10,487 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 31 /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-01-08 22:49:10,487 INFO L396 AbstractCegarLoop]: === Iteration 29 === Targeting __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-01-08 22:49:10,487 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-01-08 22:49:10,488 INFO L85 PathProgramCache]: Analyzing trace with hash 2135014294, now seen corresponding path program 1 times [2025-01-08 22:49:10,488 INFO L118 FreeRefinementEngine]: Executing refinement strategy FOX [2025-01-08 22:49:10,488 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleZ3 [860819116] [2025-01-08 22:49:10,488 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-01-08 22:49:10,488 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-01-08 22:49:10,488 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 [2025-01-08 22:49:10,490 INFO L229 MonitoredProcess]: Starting monitored process 32 with /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2025-01-08 22:49:10,491 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (32)] Waiting until timeout for monitored process [2025-01-08 22:49:10,523 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 52 statements into 1 equivalence classes. [2025-01-08 22:49:10,535 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 52 of 52 statements. [2025-01-08 22:49:10,535 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-01-08 22:49:10,535 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-01-08 22:49:10,539 INFO L256 TraceCheckSpWp]: Trace formula consists of 97 conjuncts, 11 conjuncts are in the unsatisfiable core [2025-01-08 22:49:10,540 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-01-08 22:49:14,042 INFO L134 CoverageAnalysis]: Checked inductivity of 20 backedges. 1 proven. 1 refuted. 0 times theorem prover too weak. 18 trivial. 0 not checked. [2025-01-08 22:49:14,042 INFO L312 TraceCheckSpWp]: Computing backward predicates... [2025-01-08 22:49:14,180 INFO L136 FreeRefinementEngine]: Strategy FOX found an infeasible trace [2025-01-08 22:49:14,180 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [860819116] [2025-01-08 22:49:14,180 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [860819116] provided 0 perfect and 1 imperfect interpolant sequences [2025-01-08 22:49:14,180 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleCvc4 [1912796714] [2025-01-08 22:49:14,180 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-01-08 22:49:14,180 INFO L173 SolverBuilder]: Constructing external solver with command: cvc4 --incremental --print-success --lang smt [2025-01-08 22:49:14,180 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/cvc4 [2025-01-08 22:49:14,185 INFO L229 MonitoredProcess]: Starting monitored process 33 with /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/cvc4 --incremental --print-success --lang smt (exit command is (exit), workingDir is null) [2025-01-08 22:49:14,187 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/cvc4 --incremental --print-success --lang smt (33)] Waiting until timeout for monitored process [2025-01-08 22:49:14,226 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 52 statements into 1 equivalence classes. [2025-01-08 22:49:14,256 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 52 of 52 statements. [2025-01-08 22:49:14,256 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-01-08 22:49:14,256 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-01-08 22:49:14,258 INFO L256 TraceCheckSpWp]: Trace formula consists of 97 conjuncts, 8 conjuncts are in the unsatisfiable core [2025-01-08 22:49:14,259 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-01-08 22:49:14,305 INFO L134 CoverageAnalysis]: Checked inductivity of 20 backedges. 2 proven. 0 refuted. 0 times theorem prover too weak. 18 trivial. 0 not checked. [2025-01-08 22:49:14,305 INFO L308 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2025-01-08 22:49:14,306 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleCvc4 [1912796714] provided 1 perfect and 0 imperfect interpolant sequences [2025-01-08 22:49:14,306 INFO L185 FreeRefinementEngine]: Found 1 perfect and 1 imperfect interpolant sequences. [2025-01-08 22:49:14,306 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [8] imperfect sequences [10] total 10 [2025-01-08 22:49:14,306 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1405739601] [2025-01-08 22:49:14,306 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-01-08 22:49:14,306 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 8 states [2025-01-08 22:49:14,306 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy FOX [2025-01-08 22:49:14,306 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2025-01-08 22:49:14,307 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=49, Invalid=160, Unknown=1, NotChecked=0, Total=210 [2025-01-08 22:49:14,307 INFO L87 Difference]: Start difference. First operand 355 states and 444 transitions. Second operand has 8 states, 7 states have (on average 4.714285714285714) internal successors, (33), 7 states have internal predecessors, (33), 3 states have call successors, (5), 2 states have call predecessors, (5), 1 states have return successors, (4), 2 states have call predecessors, (4), 2 states have call successors, (4) [2025-01-08 22:49:17,594 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 3.20s for a HTC check with result UNKNOWN. Formula has sorts [Bool, BitVec], hasArrays=false, hasNonlinArith=false, quantifiers [0] [2025-01-08 22:49:17,662 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-01-08 22:49:17,663 INFO L93 Difference]: Finished difference Result 375 states and 466 transitions. [2025-01-08 22:49:17,663 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2025-01-08 22:49:17,663 INFO L78 Accepts]: Start accepts. Automaton has has 8 states, 7 states have (on average 4.714285714285714) internal successors, (33), 7 states have internal predecessors, (33), 3 states have call successors, (5), 2 states have call predecessors, (5), 1 states have return successors, (4), 2 states have call predecessors, (4), 2 states have call successors, (4) Word has length 52 [2025-01-08 22:49:17,663 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-01-08 22:49:17,664 INFO L225 Difference]: With dead ends: 375 [2025-01-08 22:49:17,664 INFO L226 Difference]: Without dead ends: 373 [2025-01-08 22:49:17,665 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 113 GetRequests, 97 SyntacticMatches, 2 SemanticMatches, 14 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 47 ImplicationChecksByTransitivity, 3.6s TimeCoverageRelationStatistics Valid=56, Invalid=183, Unknown=1, NotChecked=0, Total=240 [2025-01-08 22:49:17,665 INFO L435 NwaCegarLoop]: 87 mSDtfsCounter, 8 mSDsluCounter, 323 mSDsCounter, 0 mSdLazyCounter, 59 mSolverCounterSat, 0 mSolverCounterUnsat, 1 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 3.3s Time, 0 mProtectedPredicate, 0 mProtectedAction, 9 SdHoareTripleChecker+Valid, 410 SdHoareTripleChecker+Invalid, 60 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 59 IncrementalHoareTripleChecker+Invalid, 1 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 3.3s IncrementalHoareTripleChecker+Time [2025-01-08 22:49:17,665 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [9 Valid, 410 Invalid, 60 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 59 Invalid, 1 Unknown, 0 Unchecked, 3.3s Time] [2025-01-08 22:49:17,665 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 373 states. [2025-01-08 22:49:17,676 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 373 to 362. [2025-01-08 22:49:17,676 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 362 states, 310 states have (on average 1.1870967741935483) internal successors, (368), 317 states have internal predecessors, (368), 42 states have call successors, (42), 7 states have call predecessors, (42), 9 states have return successors, (43), 40 states have call predecessors, (43), 40 states have call successors, (43) [2025-01-08 22:49:17,677 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 362 states to 362 states and 453 transitions. [2025-01-08 22:49:17,677 INFO L78 Accepts]: Start accepts. Automaton has 362 states and 453 transitions. Word has length 52 [2025-01-08 22:49:17,677 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-01-08 22:49:17,677 INFO L471 AbstractCegarLoop]: Abstraction has 362 states and 453 transitions. [2025-01-08 22:49:17,677 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 8 states, 7 states have (on average 4.714285714285714) internal successors, (33), 7 states have internal predecessors, (33), 3 states have call successors, (5), 2 states have call predecessors, (5), 1 states have return successors, (4), 2 states have call predecessors, (4), 2 states have call successors, (4) [2025-01-08 22:49:17,677 INFO L276 IsEmpty]: Start isEmpty. Operand 362 states and 453 transitions. [2025-01-08 22:49:17,678 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 54 [2025-01-08 22:49:17,678 INFO L210 NwaCegarLoop]: Found error trace [2025-01-08 22:49:17,678 INFO L218 NwaCegarLoop]: trace histogram [3, 3, 3, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-01-08 22:49:17,680 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/cvc4 --incremental --print-success --lang smt (33)] Ended with exit code 0 [2025-01-08 22:49:17,886 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (32)] Forceful destruction successful, exit code 0 [2025-01-08 22:49:18,084 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 33 /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/cvc4 --incremental --print-success --lang smt,32 /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-01-08 22:49:18,084 INFO L396 AbstractCegarLoop]: === Iteration 30 === Targeting __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-01-08 22:49:18,084 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-01-08 22:49:18,084 INFO L85 PathProgramCache]: Analyzing trace with hash -1709148992, now seen corresponding path program 1 times [2025-01-08 22:49:18,084 INFO L118 FreeRefinementEngine]: Executing refinement strategy FOX [2025-01-08 22:49:18,085 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleZ3 [1927575762] [2025-01-08 22:49:18,085 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-01-08 22:49:18,085 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-01-08 22:49:18,085 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 [2025-01-08 22:49:18,090 INFO L229 MonitoredProcess]: Starting monitored process 34 with /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2025-01-08 22:49:18,093 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (34)] Waiting until timeout for monitored process [2025-01-08 22:49:18,121 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 53 statements into 1 equivalence classes. [2025-01-08 22:49:18,132 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 53 of 53 statements. [2025-01-08 22:49:18,132 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-01-08 22:49:18,132 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-01-08 22:49:18,133 INFO L256 TraceCheckSpWp]: Trace formula consists of 95 conjuncts, 18 conjuncts are in the unsatisfiable core [2025-01-08 22:49:18,134 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-01-08 22:49:18,264 INFO L134 CoverageAnalysis]: Checked inductivity of 20 backedges. 8 proven. 0 refuted. 0 times theorem prover too weak. 12 trivial. 0 not checked. [2025-01-08 22:49:18,265 INFO L308 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2025-01-08 22:49:18,265 INFO L136 FreeRefinementEngine]: Strategy FOX found an infeasible trace [2025-01-08 22:49:18,265 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1927575762] [2025-01-08 22:49:18,265 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1927575762] provided 1 perfect and 0 imperfect interpolant sequences [2025-01-08 22:49:18,265 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-01-08 22:49:18,265 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [13] imperfect sequences [] total 13 [2025-01-08 22:49:18,265 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [979183754] [2025-01-08 22:49:18,265 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-01-08 22:49:18,265 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 13 states [2025-01-08 22:49:18,266 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy FOX [2025-01-08 22:49:18,266 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 13 interpolants. [2025-01-08 22:49:18,266 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=26, Invalid=130, Unknown=0, NotChecked=0, Total=156 [2025-01-08 22:49:18,266 INFO L87 Difference]: Start difference. First operand 362 states and 453 transitions. Second operand has 13 states, 11 states have (on average 3.272727272727273) internal successors, (36), 11 states have internal predecessors, (36), 4 states have call successors, (5), 2 states have call predecessors, (5), 3 states have return successors, (4), 4 states have call predecessors, (4), 3 states have call successors, (4) [2025-01-08 22:49:18,543 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-01-08 22:49:18,543 INFO L93 Difference]: Finished difference Result 416 states and 519 transitions. [2025-01-08 22:49:18,543 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 14 states. [2025-01-08 22:49:18,544 INFO L78 Accepts]: Start accepts. Automaton has has 13 states, 11 states have (on average 3.272727272727273) internal successors, (36), 11 states have internal predecessors, (36), 4 states have call successors, (5), 2 states have call predecessors, (5), 3 states have return successors, (4), 4 states have call predecessors, (4), 3 states have call successors, (4) Word has length 53 [2025-01-08 22:49:18,544 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-01-08 22:49:18,545 INFO L225 Difference]: With dead ends: 416 [2025-01-08 22:49:18,545 INFO L226 Difference]: Without dead ends: 369 [2025-01-08 22:49:18,545 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 56 GetRequests, 41 SyntacticMatches, 0 SemanticMatches, 15 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 18 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=47, Invalid=225, Unknown=0, NotChecked=0, Total=272 [2025-01-08 22:49:18,545 INFO L435 NwaCegarLoop]: 94 mSDtfsCounter, 57 mSDsluCounter, 874 mSDsCounter, 0 mSdLazyCounter, 394 mSolverCounterSat, 3 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 63 SdHoareTripleChecker+Valid, 968 SdHoareTripleChecker+Invalid, 397 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 3 IncrementalHoareTripleChecker+Valid, 394 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.2s IncrementalHoareTripleChecker+Time [2025-01-08 22:49:18,545 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [63 Valid, 968 Invalid, 397 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [3 Valid, 394 Invalid, 0 Unknown, 0 Unchecked, 0.2s Time] [2025-01-08 22:49:18,546 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 369 states. [2025-01-08 22:49:18,556 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 369 to 337. [2025-01-08 22:49:18,556 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 337 states, 288 states have (on average 1.1875) internal successors, (342), 294 states have internal predecessors, (342), 39 states have call successors, (39), 7 states have call predecessors, (39), 9 states have return successors, (40), 37 states have call predecessors, (40), 37 states have call successors, (40) [2025-01-08 22:49:18,557 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 337 states to 337 states and 421 transitions. [2025-01-08 22:49:18,557 INFO L78 Accepts]: Start accepts. Automaton has 337 states and 421 transitions. Word has length 53 [2025-01-08 22:49:18,557 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-01-08 22:49:18,557 INFO L471 AbstractCegarLoop]: Abstraction has 337 states and 421 transitions. [2025-01-08 22:49:18,557 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 13 states, 11 states have (on average 3.272727272727273) internal successors, (36), 11 states have internal predecessors, (36), 4 states have call successors, (5), 2 states have call predecessors, (5), 3 states have return successors, (4), 4 states have call predecessors, (4), 3 states have call successors, (4) [2025-01-08 22:49:18,557 INFO L276 IsEmpty]: Start isEmpty. Operand 337 states and 421 transitions. [2025-01-08 22:49:18,558 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 54 [2025-01-08 22:49:18,558 INFO L210 NwaCegarLoop]: Found error trace [2025-01-08 22:49:18,558 INFO L218 NwaCegarLoop]: trace histogram [3, 3, 3, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-01-08 22:49:18,564 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (34)] Forceful destruction successful, exit code 0 [2025-01-08 22:49:18,761 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 34 /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-01-08 22:49:18,762 INFO L396 AbstractCegarLoop]: === Iteration 31 === Targeting __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-01-08 22:49:18,762 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-01-08 22:49:18,762 INFO L85 PathProgramCache]: Analyzing trace with hash -1822873852, now seen corresponding path program 1 times [2025-01-08 22:49:18,763 INFO L118 FreeRefinementEngine]: Executing refinement strategy FOX [2025-01-08 22:49:18,763 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleZ3 [1321973611] [2025-01-08 22:49:18,763 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-01-08 22:49:18,763 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-01-08 22:49:18,763 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 [2025-01-08 22:49:18,765 INFO L229 MonitoredProcess]: Starting monitored process 35 with /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2025-01-08 22:49:18,766 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (35)] Waiting until timeout for monitored process [2025-01-08 22:49:18,803 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 53 statements into 1 equivalence classes. [2025-01-08 22:49:18,813 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 53 of 53 statements. [2025-01-08 22:49:18,813 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-01-08 22:49:18,813 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-01-08 22:49:18,814 INFO L256 TraceCheckSpWp]: Trace formula consists of 96 conjuncts, 8 conjuncts are in the unsatisfiable core [2025-01-08 22:49:18,815 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-01-08 22:49:18,861 INFO L134 CoverageAnalysis]: Checked inductivity of 19 backedges. 5 proven. 3 refuted. 0 times theorem prover too weak. 11 trivial. 0 not checked. [2025-01-08 22:49:18,861 INFO L312 TraceCheckSpWp]: Computing backward predicates... [2025-01-08 22:49:18,937 INFO L134 CoverageAnalysis]: Checked inductivity of 19 backedges. 5 proven. 3 refuted. 0 times theorem prover too weak. 11 trivial. 0 not checked. [2025-01-08 22:49:18,937 INFO L136 FreeRefinementEngine]: Strategy FOX found an infeasible trace [2025-01-08 22:49:18,937 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1321973611] [2025-01-08 22:49:18,937 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1321973611] provided 0 perfect and 2 imperfect interpolant sequences [2025-01-08 22:49:18,937 INFO L185 FreeRefinementEngine]: Found 0 perfect and 2 imperfect interpolant sequences. [2025-01-08 22:49:18,937 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [8, 8] total 13 [2025-01-08 22:49:18,937 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [429922729] [2025-01-08 22:49:18,937 INFO L85 oduleStraightlineAll]: Using 2 imperfect interpolants to construct interpolant automaton [2025-01-08 22:49:18,938 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 13 states [2025-01-08 22:49:18,938 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy FOX [2025-01-08 22:49:18,938 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 13 interpolants. [2025-01-08 22:49:18,938 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=28, Invalid=128, Unknown=0, NotChecked=0, Total=156 [2025-01-08 22:49:18,938 INFO L87 Difference]: Start difference. First operand 337 states and 421 transitions. Second operand has 13 states, 13 states have (on average 4.0) internal successors, (52), 11 states have internal predecessors, (52), 5 states have call successors, (6), 2 states have call predecessors, (6), 3 states have return successors, (6), 6 states have call predecessors, (6), 4 states have call successors, (6) [2025-01-08 22:49:19,054 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-01-08 22:49:19,054 INFO L93 Difference]: Finished difference Result 388 states and 483 transitions. [2025-01-08 22:49:19,055 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2025-01-08 22:49:19,055 INFO L78 Accepts]: Start accepts. Automaton has has 13 states, 13 states have (on average 4.0) internal successors, (52), 11 states have internal predecessors, (52), 5 states have call successors, (6), 2 states have call predecessors, (6), 3 states have return successors, (6), 6 states have call predecessors, (6), 4 states have call successors, (6) Word has length 53 [2025-01-08 22:49:19,055 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-01-08 22:49:19,056 INFO L225 Difference]: With dead ends: 388 [2025-01-08 22:49:19,056 INFO L226 Difference]: Without dead ends: 337 [2025-01-08 22:49:19,056 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 107 GetRequests, 93 SyntacticMatches, 0 SemanticMatches, 14 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 12 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=48, Invalid=192, Unknown=0, NotChecked=0, Total=240 [2025-01-08 22:49:19,057 INFO L435 NwaCegarLoop]: 100 mSDtfsCounter, 60 mSDsluCounter, 758 mSDsCounter, 0 mSdLazyCounter, 126 mSolverCounterSat, 4 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 61 SdHoareTripleChecker+Valid, 858 SdHoareTripleChecker+Invalid, 130 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 4 IncrementalHoareTripleChecker+Valid, 126 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2025-01-08 22:49:19,057 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [61 Valid, 858 Invalid, 130 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [4 Valid, 126 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2025-01-08 22:49:19,057 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 337 states. [2025-01-08 22:49:19,066 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 337 to 313. [2025-01-08 22:49:19,067 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 313 states, 267 states have (on average 1.1872659176029963) internal successors, (317), 272 states have internal predecessors, (317), 36 states have call successors, (36), 7 states have call predecessors, (36), 9 states have return successors, (37), 34 states have call predecessors, (37), 34 states have call successors, (37) [2025-01-08 22:49:19,067 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 313 states to 313 states and 390 transitions. [2025-01-08 22:49:19,067 INFO L78 Accepts]: Start accepts. Automaton has 313 states and 390 transitions. Word has length 53 [2025-01-08 22:49:19,067 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-01-08 22:49:19,067 INFO L471 AbstractCegarLoop]: Abstraction has 313 states and 390 transitions. [2025-01-08 22:49:19,068 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 13 states, 13 states have (on average 4.0) internal successors, (52), 11 states have internal predecessors, (52), 5 states have call successors, (6), 2 states have call predecessors, (6), 3 states have return successors, (6), 6 states have call predecessors, (6), 4 states have call successors, (6) [2025-01-08 22:49:19,068 INFO L276 IsEmpty]: Start isEmpty. Operand 313 states and 390 transitions. [2025-01-08 22:49:19,068 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 54 [2025-01-08 22:49:19,068 INFO L210 NwaCegarLoop]: Found error trace [2025-01-08 22:49:19,068 INFO L218 NwaCegarLoop]: trace histogram [3, 3, 3, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-01-08 22:49:19,075 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (35)] Ended with exit code 0 [2025-01-08 22:49:19,269 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 35 /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-01-08 22:49:19,269 INFO L396 AbstractCegarLoop]: === Iteration 32 === Targeting __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-01-08 22:49:19,269 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-01-08 22:49:19,269 INFO L85 PathProgramCache]: Analyzing trace with hash 1561224706, now seen corresponding path program 1 times [2025-01-08 22:49:19,269 INFO L118 FreeRefinementEngine]: Executing refinement strategy FOX [2025-01-08 22:49:19,269 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleZ3 [2033514073] [2025-01-08 22:49:19,269 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-01-08 22:49:19,269 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-01-08 22:49:19,270 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 [2025-01-08 22:49:19,272 INFO L229 MonitoredProcess]: Starting monitored process 36 with /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2025-01-08 22:49:19,273 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (36)] Waiting until timeout for monitored process [2025-01-08 22:49:19,300 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 53 statements into 1 equivalence classes. [2025-01-08 22:49:19,311 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 53 of 53 statements. [2025-01-08 22:49:19,311 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-01-08 22:49:19,311 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-01-08 22:49:19,312 INFO L256 TraceCheckSpWp]: Trace formula consists of 99 conjuncts, 9 conjuncts are in the unsatisfiable core [2025-01-08 22:49:19,312 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-01-08 22:49:19,364 INFO L134 CoverageAnalysis]: Checked inductivity of 19 backedges. 8 proven. 0 refuted. 0 times theorem prover too weak. 11 trivial. 0 not checked. [2025-01-08 22:49:19,364 INFO L308 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2025-01-08 22:49:19,364 INFO L136 FreeRefinementEngine]: Strategy FOX found an infeasible trace [2025-01-08 22:49:19,364 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [2033514073] [2025-01-08 22:49:19,364 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [2033514073] provided 1 perfect and 0 imperfect interpolant sequences [2025-01-08 22:49:19,364 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-01-08 22:49:19,365 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [9] imperfect sequences [] total 9 [2025-01-08 22:49:19,365 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [872150807] [2025-01-08 22:49:19,365 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-01-08 22:49:19,365 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 9 states [2025-01-08 22:49:19,365 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy FOX [2025-01-08 22:49:19,365 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2025-01-08 22:49:19,365 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=15, Invalid=57, Unknown=0, NotChecked=0, Total=72 [2025-01-08 22:49:19,365 INFO L87 Difference]: Start difference. First operand 313 states and 390 transitions. Second operand has 9 states, 9 states have (on average 4.222222222222222) internal successors, (38), 8 states have internal predecessors, (38), 3 states have call successors, (5), 2 states have call predecessors, (5), 2 states have return successors, (4), 3 states have call predecessors, (4), 2 states have call successors, (4) [2025-01-08 22:49:19,476 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-01-08 22:49:19,476 INFO L93 Difference]: Finished difference Result 342 states and 420 transitions. [2025-01-08 22:49:19,476 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 11 states. [2025-01-08 22:49:19,477 INFO L78 Accepts]: Start accepts. Automaton has has 9 states, 9 states have (on average 4.222222222222222) internal successors, (38), 8 states have internal predecessors, (38), 3 states have call successors, (5), 2 states have call predecessors, (5), 2 states have return successors, (4), 3 states have call predecessors, (4), 2 states have call successors, (4) Word has length 53 [2025-01-08 22:49:19,477 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-01-08 22:49:19,478 INFO L225 Difference]: With dead ends: 342 [2025-01-08 22:49:19,478 INFO L226 Difference]: Without dead ends: 261 [2025-01-08 22:49:19,478 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 57 GetRequests, 45 SyntacticMatches, 0 SemanticMatches, 12 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 8 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=41, Invalid=141, Unknown=0, NotChecked=0, Total=182 [2025-01-08 22:49:19,478 INFO L435 NwaCegarLoop]: 81 mSDtfsCounter, 39 mSDsluCounter, 550 mSDsCounter, 0 mSdLazyCounter, 122 mSolverCounterSat, 3 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 40 SdHoareTripleChecker+Valid, 631 SdHoareTripleChecker+Invalid, 125 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 3 IncrementalHoareTripleChecker+Valid, 122 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2025-01-08 22:49:19,478 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [40 Valid, 631 Invalid, 125 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [3 Valid, 122 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2025-01-08 22:49:19,480 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 261 states. [2025-01-08 22:49:19,486 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 261 to 245. [2025-01-08 22:49:19,487 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 245 states, 209 states have (on average 1.1770334928229664) internal successors, (246), 214 states have internal predecessors, (246), 26 states have call successors, (26), 7 states have call predecessors, (26), 9 states have return successors, (27), 24 states have call predecessors, (27), 24 states have call successors, (27) [2025-01-08 22:49:19,487 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 245 states to 245 states and 299 transitions. [2025-01-08 22:49:19,487 INFO L78 Accepts]: Start accepts. Automaton has 245 states and 299 transitions. Word has length 53 [2025-01-08 22:49:19,488 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-01-08 22:49:19,488 INFO L471 AbstractCegarLoop]: Abstraction has 245 states and 299 transitions. [2025-01-08 22:49:19,488 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 9 states, 9 states have (on average 4.222222222222222) internal successors, (38), 8 states have internal predecessors, (38), 3 states have call successors, (5), 2 states have call predecessors, (5), 2 states have return successors, (4), 3 states have call predecessors, (4), 2 states have call successors, (4) [2025-01-08 22:49:19,488 INFO L276 IsEmpty]: Start isEmpty. Operand 245 states and 299 transitions. [2025-01-08 22:49:19,488 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 54 [2025-01-08 22:49:19,488 INFO L210 NwaCegarLoop]: Found error trace [2025-01-08 22:49:19,488 INFO L218 NwaCegarLoop]: trace histogram [3, 3, 3, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-01-08 22:49:19,494 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (36)] Ended with exit code 0 [2025-01-08 22:49:19,689 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 36 /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-01-08 22:49:19,689 INFO L396 AbstractCegarLoop]: === Iteration 33 === Targeting __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-01-08 22:49:19,690 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-01-08 22:49:19,690 INFO L85 PathProgramCache]: Analyzing trace with hash 1447499846, now seen corresponding path program 1 times [2025-01-08 22:49:19,690 INFO L118 FreeRefinementEngine]: Executing refinement strategy FOX [2025-01-08 22:49:19,690 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleZ3 [1342245949] [2025-01-08 22:49:19,690 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-01-08 22:49:19,690 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-01-08 22:49:19,690 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 [2025-01-08 22:49:19,692 INFO L229 MonitoredProcess]: Starting monitored process 37 with /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2025-01-08 22:49:19,694 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (37)] Waiting until timeout for monitored process [2025-01-08 22:49:19,725 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 53 statements into 1 equivalence classes. [2025-01-08 22:49:19,737 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 53 of 53 statements. [2025-01-08 22:49:19,737 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-01-08 22:49:19,738 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-01-08 22:49:19,738 INFO L256 TraceCheckSpWp]: Trace formula consists of 100 conjuncts, 11 conjuncts are in the unsatisfiable core [2025-01-08 22:49:19,739 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-01-08 22:49:28,035 INFO L134 CoverageAnalysis]: Checked inductivity of 20 backedges. 1 proven. 1 refuted. 0 times theorem prover too weak. 18 trivial. 0 not checked. [2025-01-08 22:49:28,035 INFO L312 TraceCheckSpWp]: Computing backward predicates... [2025-01-08 22:49:28,218 INFO L136 FreeRefinementEngine]: Strategy FOX found an infeasible trace [2025-01-08 22:49:28,218 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1342245949] [2025-01-08 22:49:28,218 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1342245949] provided 0 perfect and 1 imperfect interpolant sequences [2025-01-08 22:49:28,218 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleCvc4 [1871331867] [2025-01-08 22:49:28,218 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-01-08 22:49:28,219 INFO L173 SolverBuilder]: Constructing external solver with command: cvc4 --incremental --print-success --lang smt [2025-01-08 22:49:28,219 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/cvc4 [2025-01-08 22:49:28,220 INFO L229 MonitoredProcess]: Starting monitored process 38 with /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/cvc4 --incremental --print-success --lang smt (exit command is (exit), workingDir is null) [2025-01-08 22:49:28,222 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/cvc4 --incremental --print-success --lang smt (38)] Waiting until timeout for monitored process [2025-01-08 22:49:28,267 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 53 statements into 1 equivalence classes. [2025-01-08 22:49:28,298 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 53 of 53 statements. [2025-01-08 22:49:28,299 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-01-08 22:49:28,299 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-01-08 22:49:28,300 INFO L256 TraceCheckSpWp]: Trace formula consists of 100 conjuncts, 8 conjuncts are in the unsatisfiable core [2025-01-08 22:49:28,301 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-01-08 22:49:28,436 INFO L134 CoverageAnalysis]: Checked inductivity of 20 backedges. 2 proven. 0 refuted. 0 times theorem prover too weak. 18 trivial. 0 not checked. [2025-01-08 22:49:28,436 INFO L308 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2025-01-08 22:49:28,436 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleCvc4 [1871331867] provided 1 perfect and 0 imperfect interpolant sequences [2025-01-08 22:49:28,436 INFO L185 FreeRefinementEngine]: Found 1 perfect and 1 imperfect interpolant sequences. [2025-01-08 22:49:28,436 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [8] imperfect sequences [10] total 10 [2025-01-08 22:49:28,436 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1150912867] [2025-01-08 22:49:28,436 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-01-08 22:49:28,436 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 8 states [2025-01-08 22:49:28,436 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy FOX [2025-01-08 22:49:28,436 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2025-01-08 22:49:28,436 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=46, Invalid=161, Unknown=3, NotChecked=0, Total=210 [2025-01-08 22:49:28,437 INFO L87 Difference]: Start difference. First operand 245 states and 299 transitions. Second operand has 8 states, 7 states have (on average 4.857142857142857) internal successors, (34), 7 states have internal predecessors, (34), 3 states have call successors, (5), 2 states have call predecessors, (5), 1 states have return successors, (4), 2 states have call predecessors, (4), 2 states have call successors, (4) [2025-01-08 22:49:32,448 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 4.00s for a HTC check with result UNKNOWN. Formula has sorts [Bool, BitVec], hasArrays=false, hasNonlinArith=false, quantifiers [0] [2025-01-08 22:49:36,466 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 4.00s for a HTC check with result UNKNOWN. Formula has sorts [Bool, BitVec], hasArrays=false, hasNonlinArith=false, quantifiers [0] [2025-01-08 22:49:40,471 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 4.00s for a HTC check with result UNKNOWN. Formula has sorts [Bool, BitVec], hasArrays=false, hasNonlinArith=false, quantifiers [0] [2025-01-08 22:49:44,501 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 4.03s for a HTC check with result UNKNOWN. Formula has sorts [Bool, BitVec], hasArrays=false, hasNonlinArith=false, quantifiers [0] [2025-01-08 22:49:48,514 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 4.00s for a HTC check with result UNKNOWN. Formula has sorts [Bool, BitVec], hasArrays=false, hasNonlinArith=false, quantifiers [0] [2025-01-08 22:49:51,991 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 3.25s for a HTC check with result INVALID. Formula has sorts [Bool, BitVec], hasArrays=false, hasNonlinArith=false, quantifiers [0] [2025-01-08 22:49:56,039 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 4.00s for a HTC check with result UNKNOWN. Formula has sorts [Bool, BitVec], hasArrays=false, hasNonlinArith=false, quantifiers [0] [2025-01-08 22:49:56,431 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-01-08 22:49:56,432 INFO L93 Difference]: Finished difference Result 262 states and 315 transitions. [2025-01-08 22:49:56,432 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2025-01-08 22:49:56,432 INFO L78 Accepts]: Start accepts. Automaton has has 8 states, 7 states have (on average 4.857142857142857) internal successors, (34), 7 states have internal predecessors, (34), 3 states have call successors, (5), 2 states have call predecessors, (5), 1 states have return successors, (4), 2 states have call predecessors, (4), 2 states have call successors, (4) Word has length 53 [2025-01-08 22:49:56,433 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-01-08 22:49:56,434 INFO L225 Difference]: With dead ends: 262 [2025-01-08 22:49:56,434 INFO L226 Difference]: Without dead ends: 260 [2025-01-08 22:49:56,434 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 117 GetRequests, 100 SyntacticMatches, 2 SemanticMatches, 15 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 36 ImplicationChecksByTransitivity, 8.5s TimeCoverageRelationStatistics Valid=59, Invalid=210, Unknown=3, NotChecked=0, Total=272 [2025-01-08 22:49:56,434 INFO L435 NwaCegarLoop]: 86 mSDtfsCounter, 9 mSDsluCounter, 318 mSDsCounter, 0 mSdLazyCounter, 64 mSolverCounterSat, 1 mSolverCounterUnsat, 6 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 27.8s Time, 0 mProtectedPredicate, 0 mProtectedAction, 11 SdHoareTripleChecker+Valid, 404 SdHoareTripleChecker+Invalid, 71 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 1 IncrementalHoareTripleChecker+Valid, 64 IncrementalHoareTripleChecker+Invalid, 6 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 27.9s IncrementalHoareTripleChecker+Time [2025-01-08 22:49:56,434 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [11 Valid, 404 Invalid, 71 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [1 Valid, 64 Invalid, 6 Unknown, 0 Unchecked, 27.9s Time] [2025-01-08 22:49:56,435 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 260 states. [2025-01-08 22:49:56,446 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 260 to 242. [2025-01-08 22:49:56,446 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 242 states, 209 states have (on average 1.1770334928229664) internal successors, (246), 211 states have internal predecessors, (246), 23 states have call successors, (23), 7 states have call predecessors, (23), 9 states have return successors, (24), 24 states have call predecessors, (24), 21 states have call successors, (24) [2025-01-08 22:49:56,447 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 242 states to 242 states and 293 transitions. [2025-01-08 22:49:56,447 INFO L78 Accepts]: Start accepts. Automaton has 242 states and 293 transitions. Word has length 53 [2025-01-08 22:49:56,447 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-01-08 22:49:56,447 INFO L471 AbstractCegarLoop]: Abstraction has 242 states and 293 transitions. [2025-01-08 22:49:56,447 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 8 states, 7 states have (on average 4.857142857142857) internal successors, (34), 7 states have internal predecessors, (34), 3 states have call successors, (5), 2 states have call predecessors, (5), 1 states have return successors, (4), 2 states have call predecessors, (4), 2 states have call successors, (4) [2025-01-08 22:49:56,447 INFO L276 IsEmpty]: Start isEmpty. Operand 242 states and 293 transitions. [2025-01-08 22:49:56,448 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 59 [2025-01-08 22:49:56,448 INFO L210 NwaCegarLoop]: Found error trace [2025-01-08 22:49:56,448 INFO L218 NwaCegarLoop]: trace histogram [3, 3, 3, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-01-08 22:49:56,454 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (37)] Ended with exit code 0 [2025-01-08 22:49:56,651 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/cvc4 --incremental --print-success --lang smt (38)] Ended with exit code 0 [2025-01-08 22:49:56,848 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 37 /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true,38 /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/cvc4 --incremental --print-success --lang smt [2025-01-08 22:49:56,849 INFO L396 AbstractCegarLoop]: === Iteration 34 === Targeting __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-01-08 22:49:56,849 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-01-08 22:49:56,849 INFO L85 PathProgramCache]: Analyzing trace with hash -906597081, now seen corresponding path program 1 times [2025-01-08 22:49:56,849 INFO L118 FreeRefinementEngine]: Executing refinement strategy FOX [2025-01-08 22:49:56,849 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleZ3 [1978816693] [2025-01-08 22:49:56,849 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-01-08 22:49:56,850 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-01-08 22:49:56,850 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 [2025-01-08 22:49:56,852 INFO L229 MonitoredProcess]: Starting monitored process 39 with /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2025-01-08 22:49:56,853 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (39)] Waiting until timeout for monitored process [2025-01-08 22:49:56,884 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 58 statements into 1 equivalence classes. [2025-01-08 22:49:56,894 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 58 of 58 statements. [2025-01-08 22:49:56,894 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-01-08 22:49:56,894 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-01-08 22:49:56,895 INFO L256 TraceCheckSpWp]: Trace formula consists of 100 conjuncts, 5 conjuncts are in the unsatisfiable core [2025-01-08 22:49:56,896 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-01-08 22:49:56,941 INFO L134 CoverageAnalysis]: Checked inductivity of 19 backedges. 2 proven. 0 refuted. 0 times theorem prover too weak. 17 trivial. 0 not checked. [2025-01-08 22:49:56,941 INFO L308 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2025-01-08 22:49:56,941 INFO L136 FreeRefinementEngine]: Strategy FOX found an infeasible trace [2025-01-08 22:49:56,941 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1978816693] [2025-01-08 22:49:56,941 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1978816693] provided 1 perfect and 0 imperfect interpolant sequences [2025-01-08 22:49:56,941 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-01-08 22:49:56,942 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2025-01-08 22:49:56,942 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1062562025] [2025-01-08 22:49:56,942 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-01-08 22:49:56,942 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2025-01-08 22:49:56,942 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy FOX [2025-01-08 22:49:56,942 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2025-01-08 22:49:56,942 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=9, Invalid=21, Unknown=0, NotChecked=0, Total=30 [2025-01-08 22:49:56,942 INFO L87 Difference]: Start difference. First operand 242 states and 293 transitions. Second operand has 6 states, 5 states have (on average 8.2) internal successors, (41), 5 states have internal predecessors, (41), 2 states have call successors, (5), 2 states have call predecessors, (5), 1 states have return successors, (4), 1 states have call predecessors, (4), 1 states have call successors, (4) [2025-01-08 22:49:57,014 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-01-08 22:49:57,014 INFO L93 Difference]: Finished difference Result 254 states and 305 transitions. [2025-01-08 22:49:57,015 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2025-01-08 22:49:57,015 INFO L78 Accepts]: Start accepts. Automaton has has 6 states, 5 states have (on average 8.2) internal successors, (41), 5 states have internal predecessors, (41), 2 states have call successors, (5), 2 states have call predecessors, (5), 1 states have return successors, (4), 1 states have call predecessors, (4), 1 states have call successors, (4) Word has length 58 [2025-01-08 22:49:57,015 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-01-08 22:49:57,016 INFO L225 Difference]: With dead ends: 254 [2025-01-08 22:49:57,016 INFO L226 Difference]: Without dead ends: 252 [2025-01-08 22:49:57,016 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 58 GetRequests, 53 SyntacticMatches, 0 SemanticMatches, 5 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=13, Invalid=29, Unknown=0, NotChecked=0, Total=42 [2025-01-08 22:49:57,016 INFO L435 NwaCegarLoop]: 92 mSDtfsCounter, 8 mSDsluCounter, 352 mSDsCounter, 0 mSdLazyCounter, 29 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 9 SdHoareTripleChecker+Valid, 444 SdHoareTripleChecker+Invalid, 29 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 29 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2025-01-08 22:49:57,017 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [9 Valid, 444 Invalid, 29 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 29 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2025-01-08 22:49:57,017 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 252 states. [2025-01-08 22:49:57,024 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 252 to 248. [2025-01-08 22:49:57,024 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 248 states, 213 states have (on average 1.1737089201877935) internal successors, (250), 216 states have internal predecessors, (250), 24 states have call successors, (24), 8 states have call predecessors, (24), 10 states have return successors, (25), 24 states have call predecessors, (25), 22 states have call successors, (25) [2025-01-08 22:49:57,025 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 248 states to 248 states and 299 transitions. [2025-01-08 22:49:57,025 INFO L78 Accepts]: Start accepts. Automaton has 248 states and 299 transitions. Word has length 58 [2025-01-08 22:49:57,025 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-01-08 22:49:57,025 INFO L471 AbstractCegarLoop]: Abstraction has 248 states and 299 transitions. [2025-01-08 22:49:57,025 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 5 states have (on average 8.2) internal successors, (41), 5 states have internal predecessors, (41), 2 states have call successors, (5), 2 states have call predecessors, (5), 1 states have return successors, (4), 1 states have call predecessors, (4), 1 states have call successors, (4) [2025-01-08 22:49:57,025 INFO L276 IsEmpty]: Start isEmpty. Operand 248 states and 299 transitions. [2025-01-08 22:49:57,026 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 59 [2025-01-08 22:49:57,026 INFO L210 NwaCegarLoop]: Found error trace [2025-01-08 22:49:57,026 INFO L218 NwaCegarLoop]: trace histogram [3, 3, 3, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-01-08 22:49:57,033 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (39)] Ended with exit code 0 [2025-01-08 22:49:57,228 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 39 /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-01-08 22:49:57,229 INFO L396 AbstractCegarLoop]: === Iteration 35 === Targeting __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-01-08 22:49:57,229 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-01-08 22:49:57,229 INFO L85 PathProgramCache]: Analyzing trace with hash 1138568107, now seen corresponding path program 1 times [2025-01-08 22:49:57,229 INFO L118 FreeRefinementEngine]: Executing refinement strategy FOX [2025-01-08 22:49:57,229 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleZ3 [1202086564] [2025-01-08 22:49:57,229 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-01-08 22:49:57,229 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-01-08 22:49:57,229 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 [2025-01-08 22:49:57,234 INFO L229 MonitoredProcess]: Starting monitored process 40 with /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2025-01-08 22:49:57,238 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (40)] Waiting until timeout for monitored process [2025-01-08 22:49:57,271 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 58 statements into 1 equivalence classes. [2025-01-08 22:49:57,282 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 58 of 58 statements. [2025-01-08 22:49:57,282 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-01-08 22:49:57,283 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-01-08 22:49:57,285 INFO L256 TraceCheckSpWp]: Trace formula consists of 103 conjuncts, 5 conjuncts are in the unsatisfiable core [2025-01-08 22:49:57,285 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-01-08 22:49:57,326 INFO L134 CoverageAnalysis]: Checked inductivity of 19 backedges. 2 proven. 0 refuted. 0 times theorem prover too weak. 17 trivial. 0 not checked. [2025-01-08 22:49:57,326 INFO L308 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2025-01-08 22:49:57,326 INFO L136 FreeRefinementEngine]: Strategy FOX found an infeasible trace [2025-01-08 22:49:57,326 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1202086564] [2025-01-08 22:49:57,327 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1202086564] provided 1 perfect and 0 imperfect interpolant sequences [2025-01-08 22:49:57,328 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-01-08 22:49:57,328 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2025-01-08 22:49:57,328 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1891186951] [2025-01-08 22:49:57,328 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-01-08 22:49:57,328 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2025-01-08 22:49:57,329 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy FOX [2025-01-08 22:49:57,329 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2025-01-08 22:49:57,329 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=9, Invalid=21, Unknown=0, NotChecked=0, Total=30 [2025-01-08 22:49:57,329 INFO L87 Difference]: Start difference. First operand 248 states and 299 transitions. Second operand has 6 states, 5 states have (on average 8.2) internal successors, (41), 5 states have internal predecessors, (41), 2 states have call successors, (5), 2 states have call predecessors, (5), 1 states have return successors, (4), 1 states have call predecessors, (4), 1 states have call successors, (4) [2025-01-08 22:49:57,397 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-01-08 22:49:57,397 INFO L93 Difference]: Finished difference Result 269 states and 320 transitions. [2025-01-08 22:49:57,398 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2025-01-08 22:49:57,398 INFO L78 Accepts]: Start accepts. Automaton has has 6 states, 5 states have (on average 8.2) internal successors, (41), 5 states have internal predecessors, (41), 2 states have call successors, (5), 2 states have call predecessors, (5), 1 states have return successors, (4), 1 states have call predecessors, (4), 1 states have call successors, (4) Word has length 58 [2025-01-08 22:49:57,401 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-01-08 22:49:57,402 INFO L225 Difference]: With dead ends: 269 [2025-01-08 22:49:57,402 INFO L226 Difference]: Without dead ends: 267 [2025-01-08 22:49:57,403 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 58 GetRequests, 53 SyntacticMatches, 0 SemanticMatches, 5 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=13, Invalid=29, Unknown=0, NotChecked=0, Total=42 [2025-01-08 22:49:57,403 INFO L435 NwaCegarLoop]: 111 mSDtfsCounter, 19 mSDsluCounter, 408 mSDsCounter, 0 mSdLazyCounter, 32 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 21 SdHoareTripleChecker+Valid, 519 SdHoareTripleChecker+Invalid, 32 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 32 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2025-01-08 22:49:57,403 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [21 Valid, 519 Invalid, 32 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 32 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2025-01-08 22:49:57,403 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 267 states. [2025-01-08 22:49:57,420 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 267 to 252. [2025-01-08 22:49:57,420 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 252 states, 216 states have (on average 1.1712962962962963) internal successors, (253), 219 states have internal predecessors, (253), 24 states have call successors, (24), 9 states have call predecessors, (24), 11 states have return successors, (25), 24 states have call predecessors, (25), 22 states have call successors, (25) [2025-01-08 22:49:57,420 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 252 states to 252 states and 302 transitions. [2025-01-08 22:49:57,421 INFO L78 Accepts]: Start accepts. Automaton has 252 states and 302 transitions. Word has length 58 [2025-01-08 22:49:57,421 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-01-08 22:49:57,421 INFO L471 AbstractCegarLoop]: Abstraction has 252 states and 302 transitions. [2025-01-08 22:49:57,421 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 5 states have (on average 8.2) internal successors, (41), 5 states have internal predecessors, (41), 2 states have call successors, (5), 2 states have call predecessors, (5), 1 states have return successors, (4), 1 states have call predecessors, (4), 1 states have call successors, (4) [2025-01-08 22:49:57,421 INFO L276 IsEmpty]: Start isEmpty. Operand 252 states and 302 transitions. [2025-01-08 22:49:57,421 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 64 [2025-01-08 22:49:57,421 INFO L210 NwaCegarLoop]: Found error trace [2025-01-08 22:49:57,421 INFO L218 NwaCegarLoop]: trace histogram [3, 3, 3, 3, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-01-08 22:49:57,438 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (40)] Ended with exit code 0 [2025-01-08 22:49:57,622 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 40 /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-01-08 22:49:57,622 INFO L396 AbstractCegarLoop]: === Iteration 36 === Targeting __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-01-08 22:49:57,625 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-01-08 22:49:57,626 INFO L85 PathProgramCache]: Analyzing trace with hash -999438926, now seen corresponding path program 1 times [2025-01-08 22:49:57,626 INFO L118 FreeRefinementEngine]: Executing refinement strategy FOX [2025-01-08 22:49:57,626 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleZ3 [1133072536] [2025-01-08 22:49:57,626 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-01-08 22:49:57,626 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-01-08 22:49:57,626 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 [2025-01-08 22:49:57,628 INFO L229 MonitoredProcess]: Starting monitored process 41 with /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2025-01-08 22:49:57,630 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (41)] Waiting until timeout for monitored process [2025-01-08 22:49:57,660 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 63 statements into 1 equivalence classes. [2025-01-08 22:49:57,676 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 63 of 63 statements. [2025-01-08 22:49:57,677 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-01-08 22:49:57,677 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-01-08 22:49:57,678 INFO L256 TraceCheckSpWp]: Trace formula consists of 113 conjuncts, 24 conjuncts are in the unsatisfiable core [2025-01-08 22:49:57,680 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-01-08 22:49:59,169 INFO L134 CoverageAnalysis]: Checked inductivity of 26 backedges. 4 proven. 3 refuted. 0 times theorem prover too weak. 19 trivial. 0 not checked. [2025-01-08 22:49:59,170 INFO L312 TraceCheckSpWp]: Computing backward predicates... [2025-01-08 22:50:01,601 INFO L134 CoverageAnalysis]: Checked inductivity of 26 backedges. 4 proven. 3 refuted. 0 times theorem prover too weak. 19 trivial. 0 not checked. [2025-01-08 22:50:01,601 INFO L136 FreeRefinementEngine]: Strategy FOX found an infeasible trace [2025-01-08 22:50:01,601 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1133072536] [2025-01-08 22:50:01,601 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1133072536] provided 0 perfect and 2 imperfect interpolant sequences [2025-01-08 22:50:01,601 INFO L185 FreeRefinementEngine]: Found 0 perfect and 2 imperfect interpolant sequences. [2025-01-08 22:50:01,602 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [15, 16] total 28 [2025-01-08 22:50:01,602 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1537619465] [2025-01-08 22:50:01,602 INFO L85 oduleStraightlineAll]: Using 2 imperfect interpolants to construct interpolant automaton [2025-01-08 22:50:01,602 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 28 states [2025-01-08 22:50:01,602 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy FOX [2025-01-08 22:50:01,602 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 28 interpolants. [2025-01-08 22:50:01,604 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=103, Invalid=653, Unknown=0, NotChecked=0, Total=756 [2025-01-08 22:50:01,605 INFO L87 Difference]: Start difference. First operand 252 states and 302 transitions. Second operand has 28 states, 27 states have (on average 2.1481481481481484) internal successors, (58), 27 states have internal predecessors, (58), 6 states have call successors, (8), 2 states have call predecessors, (8), 2 states have return successors, (7), 5 states have call predecessors, (7), 5 states have call successors, (7)