./Ultimate.py --spec ../sv-benchmarks/c/properties/unreach-call.prp --file ../sv-benchmarks/c/hardness-nfm22/hardness_fillercode_fillercodesize_ps-cn-250_file-92.i --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/hardness-nfm22/hardness_fillercode_fillercodesize_ps-cn-250_file-92.i -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 d7c6ee6eb0f585efaab30d46a49b7995a5952ad7cab5794b55d5ffb7d0a6deb0 --- Real Ultimate output --- This is Ultimate 0.3.0-?-551b009-m [2025-01-09 09:48:51,312 INFO L188 SettingsManager]: Resetting all preferences to default values... [2025-01-09 09:48:51,380 INFO L114 SettingsManager]: Loading settings from /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/config/svcomp-Reach-32bit-Automizer_Default.epf [2025-01-09 09:48:51,392 WARN L101 SettingsManager]: Preference file contains the following unknown settings: [2025-01-09 09:48:51,392 WARN L103 SettingsManager]: * de.uni_freiburg.informatik.ultimate.core.Log level for class [2025-01-09 09:48:51,422 INFO L130 SettingsManager]: Preferences different from defaults after loading the file: [2025-01-09 09:48:51,423 INFO L151 SettingsManager]: Preferences of UltimateCore differ from their defaults: [2025-01-09 09:48:51,423 INFO L153 SettingsManager]: * Log level for class=de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher=ERROR; [2025-01-09 09:48:51,423 INFO L151 SettingsManager]: Preferences of Boogie Preprocessor differ from their defaults: [2025-01-09 09:48:51,424 INFO L153 SettingsManager]: * Use memory slicer=true [2025-01-09 09:48:51,424 INFO L151 SettingsManager]: Preferences of Boogie Procedure Inliner differ from their defaults: [2025-01-09 09:48:51,424 INFO L153 SettingsManager]: * Ignore calls to procedures called more than once=ONLY_FOR_SEQUENTIAL_PROGRAMS [2025-01-09 09:48:51,424 INFO L151 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2025-01-09 09:48:51,425 INFO L153 SettingsManager]: * Create parallel compositions if possible=false [2025-01-09 09:48:51,425 INFO L153 SettingsManager]: * Use SBE=true [2025-01-09 09:48:51,425 INFO L151 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2025-01-09 09:48:51,426 INFO L153 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2025-01-09 09:48:51,426 INFO L153 SettingsManager]: * sizeof long=4 [2025-01-09 09:48:51,426 INFO L153 SettingsManager]: * Overapproximate operations on floating types=true [2025-01-09 09:48:51,426 INFO L153 SettingsManager]: * sizeof POINTER=4 [2025-01-09 09:48:51,426 INFO L153 SettingsManager]: * Check division by zero=IGNORE [2025-01-09 09:48:51,426 INFO L153 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2025-01-09 09:48:51,427 INFO L153 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2025-01-09 09:48:51,427 INFO L153 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2025-01-09 09:48:51,427 INFO L153 SettingsManager]: * sizeof long double=12 [2025-01-09 09:48:51,427 INFO L153 SettingsManager]: * Check if freed pointer was valid=false [2025-01-09 09:48:51,427 INFO L153 SettingsManager]: * Behaviour of calls to undefined functions=OVERAPPROXIMATE_BEHAVIOUR [2025-01-09 09:48:51,427 INFO L153 SettingsManager]: * Use constant arrays=true [2025-01-09 09:48:51,427 INFO L151 SettingsManager]: Preferences of IcfgBuilder differ from their defaults: [2025-01-09 09:48:51,427 INFO L153 SettingsManager]: * Size of a code block=SequenceOfStatements [2025-01-09 09:48:51,427 INFO L153 SettingsManager]: * Only consider context switches at boundaries of atomic blocks=true [2025-01-09 09:48:51,428 INFO L153 SettingsManager]: * SMT solver=External_DefaultMode [2025-01-09 09:48:51,428 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2025-01-09 09:48:51,428 INFO L151 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2025-01-09 09:48:51,428 INFO L153 SettingsManager]: * Size of a code block=SequenceOfStatements [2025-01-09 09:48:51,428 INFO L153 SettingsManager]: * Only consider context switches at boundaries of atomic blocks=true [2025-01-09 09:48:51,428 INFO L153 SettingsManager]: * SMT solver=External_DefaultMode [2025-01-09 09:48:51,428 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2025-01-09 09:48:51,428 INFO L151 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2025-01-09 09:48:51,429 INFO L153 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2025-01-09 09:48:51,429 INFO L153 SettingsManager]: * Compute procedure contracts=false [2025-01-09 09:48:51,429 INFO L153 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopHeads [2025-01-09 09:48:51,429 INFO L153 SettingsManager]: * Trace refinement strategy=CAMEL [2025-01-09 09:48:51,429 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2025-01-09 09:48:51,429 INFO L153 SettingsManager]: * Apply one-shot large block encoding in concurrent analysis=false [2025-01-09 09:48:51,429 INFO L153 SettingsManager]: * Automaton type used in concurrency analysis=PETRI_NET [2025-01-09 09:48:51,429 INFO L153 SettingsManager]: * Order on configurations for Petri net unfoldings=DBO [2025-01-09 09:48:51,429 INFO L153 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode [2025-01-09 09:48:51,429 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 -> d7c6ee6eb0f585efaab30d46a49b7995a5952ad7cab5794b55d5ffb7d0a6deb0 [2025-01-09 09:48:51,733 INFO L75 nceAwareModelManager]: Repository-Root is: /tmp [2025-01-09 09:48:51,744 INFO L261 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2025-01-09 09:48:51,748 INFO L217 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2025-01-09 09:48:51,750 INFO L270 PluginConnector]: Initializing CDTParser... [2025-01-09 09:48:51,750 INFO L274 PluginConnector]: CDTParser initialized [2025-01-09 09:48:51,752 INFO L431 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/../sv-benchmarks/c/hardness-nfm22/hardness_fillercode_fillercodesize_ps-cn-250_file-92.i [2025-01-09 09:48:53,054 INFO L533 CDTParser]: Created temporary CDT project at /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/data/6857d6b4e/e44eeca2471b470faa5a1ea809d708a8/FLAG87b3086df [2025-01-09 09:48:53,332 INFO L384 CDTParser]: Found 1 translation units. [2025-01-09 09:48:53,333 INFO L180 CDTParser]: Scanning /storage/repos/ultimate-jdk21/releaseScripts/default/sv-benchmarks/c/hardness-nfm22/hardness_fillercode_fillercodesize_ps-cn-250_file-92.i [2025-01-09 09:48:53,351 INFO L427 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/data/6857d6b4e/e44eeca2471b470faa5a1ea809d708a8/FLAG87b3086df [2025-01-09 09:48:53,619 INFO L435 CDTParser]: Successfully deleted /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/data/6857d6b4e/e44eeca2471b470faa5a1ea809d708a8 [2025-01-09 09:48:53,621 INFO L299 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2025-01-09 09:48:53,622 INFO L133 ToolchainWalker]: Walking toolchain with 6 elements. [2025-01-09 09:48:53,623 INFO L112 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2025-01-09 09:48:53,624 INFO L270 PluginConnector]: Initializing CACSL2BoogieTranslator... [2025-01-09 09:48:53,627 INFO L274 PluginConnector]: CACSL2BoogieTranslator initialized [2025-01-09 09:48:53,628 INFO L184 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 09.01 09:48:53" (1/1) ... [2025-01-09 09:48:53,629 INFO L204 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@47b5fcf7 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.01 09:48:53, skipping insertion in model container [2025-01-09 09:48:53,629 INFO L184 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 09.01 09:48:53" (1/1) ... [2025-01-09 09:48:53,650 INFO L175 MainTranslator]: Built tables and reachable declarations [2025-01-09 09:48:53,800 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/hardness-nfm22/hardness_fillercode_fillercodesize_ps-cn-250_file-92.i[916,929] [2025-01-09 09:48:53,933 INFO L210 PostProcessor]: Analyzing one entry point: main [2025-01-09 09:48:53,950 INFO L200 MainTranslator]: Completed pre-run [2025-01-09 09:48:53,960 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/hardness-nfm22/hardness_fillercode_fillercodesize_ps-cn-250_file-92.i[916,929] [2025-01-09 09:48:54,041 INFO L210 PostProcessor]: Analyzing one entry point: main [2025-01-09 09:48:54,064 INFO L204 MainTranslator]: Completed translation [2025-01-09 09:48:54,065 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.01 09:48:54 WrapperNode [2025-01-09 09:48:54,065 INFO L131 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2025-01-09 09:48:54,066 INFO L112 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2025-01-09 09:48:54,067 INFO L270 PluginConnector]: Initializing Boogie Procedure Inliner... [2025-01-09 09:48:54,067 INFO L274 PluginConnector]: Boogie Procedure Inliner initialized [2025-01-09 09:48:54,074 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.01 09:48:54" (1/1) ... [2025-01-09 09:48:54,097 INFO L184 PluginConnector]: Executing the observer Inliner from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.01 09:48:54" (1/1) ... [2025-01-09 09:48:54,160 INFO L138 Inliner]: procedures = 26, calls = 71, calls flagged for inlining = 8, calls inlined = 8, statements flattened = 502 [2025-01-09 09:48:54,161 INFO L131 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2025-01-09 09:48:54,161 INFO L112 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2025-01-09 09:48:54,161 INFO L270 PluginConnector]: Initializing Boogie Preprocessor... [2025-01-09 09:48:54,161 INFO L274 PluginConnector]: Boogie Preprocessor initialized [2025-01-09 09:48:54,169 INFO L184 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.01 09:48:54" (1/1) ... [2025-01-09 09:48:54,169 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.01 09:48:54" (1/1) ... [2025-01-09 09:48:54,181 INFO L184 PluginConnector]: Executing the observer MemorySlicer from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.01 09:48:54" (1/1) ... [2025-01-09 09:48:54,225 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-09 09:48:54,225 INFO L184 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.01 09:48:54" (1/1) ... [2025-01-09 09:48:54,225 INFO L184 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.01 09:48:54" (1/1) ... [2025-01-09 09:48:54,260 INFO L184 PluginConnector]: Executing the observer ReplaceArrayAssignments from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.01 09:48:54" (1/1) ... [2025-01-09 09:48:54,267 INFO L184 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.01 09:48:54" (1/1) ... [2025-01-09 09:48:54,277 INFO L184 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.01 09:48:54" (1/1) ... [2025-01-09 09:48:54,287 INFO L184 PluginConnector]: Executing the observer LTLStepAnnotator from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.01 09:48:54" (1/1) ... [2025-01-09 09:48:54,296 INFO L184 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.01 09:48:54" (1/1) ... [2025-01-09 09:48:54,310 INFO L131 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2025-01-09 09:48:54,311 INFO L112 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2025-01-09 09:48:54,312 INFO L270 PluginConnector]: Initializing RCFGBuilder... [2025-01-09 09:48:54,312 INFO L274 PluginConnector]: RCFGBuilder initialized [2025-01-09 09:48:54,313 INFO L184 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.01 09:48:54" (1/1) ... [2025-01-09 09:48:54,317 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2025-01-09 09:48:54,328 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 [2025-01-09 09:48:54,342 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-09 09:48:54,346 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-09 09:48:54,369 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocInit [2025-01-09 09:48:54,370 INFO L130 BoogieDeclarations]: Found specification of procedure assume_abort_if_not [2025-01-09 09:48:54,370 INFO L138 BoogieDeclarations]: Found implementation of procedure assume_abort_if_not [2025-01-09 09:48:54,370 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int#0 [2025-01-09 09:48:54,370 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2025-01-09 09:48:54,370 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2025-01-09 09:48:54,474 INFO L234 CfgBuilder]: Building ICFG [2025-01-09 09:48:54,475 INFO L260 CfgBuilder]: Building CFG for each procedure with an implementation [2025-01-09 09:48:55,324 INFO L? ?]: Removed 23 outVars from TransFormulas that were not future-live. [2025-01-09 09:48:55,324 INFO L283 CfgBuilder]: Performing block encoding [2025-01-09 09:48:55,343 INFO L307 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2025-01-09 09:48:55,345 INFO L312 CfgBuilder]: Removed 1 assume(true) statements. [2025-01-09 09:48:55,346 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 09.01 09:48:55 BoogieIcfgContainer [2025-01-09 09:48:55,346 INFO L131 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2025-01-09 09:48:55,348 INFO L112 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2025-01-09 09:48:55,348 INFO L270 PluginConnector]: Initializing TraceAbstraction... [2025-01-09 09:48:55,352 INFO L274 PluginConnector]: TraceAbstraction initialized [2025-01-09 09:48:55,353 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 09.01 09:48:53" (1/3) ... [2025-01-09 09:48:55,354 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@48a58520 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 09.01 09:48:55, skipping insertion in model container [2025-01-09 09:48:55,354 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.01 09:48:54" (2/3) ... [2025-01-09 09:48:55,355 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@48a58520 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 09.01 09:48:55, skipping insertion in model container [2025-01-09 09:48:55,355 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 09.01 09:48:55" (3/3) ... [2025-01-09 09:48:55,356 INFO L128 eAbstractionObserver]: Analyzing ICFG hardness_fillercode_fillercodesize_ps-cn-250_file-92.i [2025-01-09 09:48:55,371 INFO L216 ceAbstractionStarter]: Automizer settings: Hoare:LoopHeads NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2025-01-09 09:48:55,374 INFO L151 ceAbstractionStarter]: Applying trace abstraction to ICFG hardness_fillercode_fillercodesize_ps-cn-250_file-92.i that has 2 procedures, 211 locations, 1 initial locations, 1 loop locations, and 1 error locations. [2025-01-09 09:48:55,435 INFO L332 AbstractCegarLoop]: ======== Iteration 0 == of CEGAR loop == AllErrorsAtOnce ======== [2025-01-09 09:48:55,446 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;@740979e1, mLbeIndependenceSettings=[IndependenceType=SEMANTIC, AbstractionType=NONE, UseConditional=false, UseSemiCommutativity=true, Solver=Z3, SolverTimeout=1000ms] [2025-01-09 09:48:55,447 INFO L334 AbstractCegarLoop]: Starting to check reachability of 1 error locations. [2025-01-09 09:48:55,452 INFO L276 IsEmpty]: Start isEmpty. Operand has 211 states, 150 states have (on average 1.5733333333333333) internal successors, (236), 151 states have internal predecessors, (236), 58 states have call successors, (58), 1 states have call predecessors, (58), 1 states have return successors, (58), 58 states have call predecessors, (58), 58 states have call successors, (58) [2025-01-09 09:48:55,476 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 376 [2025-01-09 09:48:55,476 INFO L210 NwaCegarLoop]: Found error trace [2025-01-09 09:48:55,478 INFO L218 NwaCegarLoop]: trace histogram [58, 58, 58, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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-09 09:48:55,478 INFO L396 AbstractCegarLoop]: === Iteration 1 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-01-09 09:48:55,484 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-01-09 09:48:55,485 INFO L85 PathProgramCache]: Analyzing trace with hash 1066556053, now seen corresponding path program 1 times [2025-01-09 09:48:55,491 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-01-09 09:48:55,492 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [392670620] [2025-01-09 09:48:55,492 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-01-09 09:48:55,495 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-01-09 09:48:55,621 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 375 statements into 1 equivalence classes. [2025-01-09 09:48:55,671 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 375 of 375 statements. [2025-01-09 09:48:55,672 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-01-09 09:48:55,672 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-01-09 09:48:56,120 INFO L134 CoverageAnalysis]: Checked inductivity of 6612 backedges. 0 proven. 114 refuted. 0 times theorem prover too weak. 6498 trivial. 0 not checked. [2025-01-09 09:48:56,122 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-01-09 09:48:56,122 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [392670620] [2025-01-09 09:48:56,123 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [392670620] provided 0 perfect and 1 imperfect interpolant sequences [2025-01-09 09:48:56,123 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [46227665] [2025-01-09 09:48:56,123 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-01-09 09:48:56,123 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-01-09 09:48:56,123 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 [2025-01-09 09:48:56,127 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-09 09:48:56,129 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-09 09:48:56,269 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 375 statements into 1 equivalence classes. [2025-01-09 09:48:56,417 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 375 of 375 statements. [2025-01-09 09:48:56,417 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-01-09 09:48:56,418 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-01-09 09:48:56,424 INFO L256 TraceCheckSpWp]: Trace formula consists of 856 conjuncts, 1 conjuncts are in the unsatisfiable core [2025-01-09 09:48:56,443 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-01-09 09:48:56,493 INFO L134 CoverageAnalysis]: Checked inductivity of 6612 backedges. 114 proven. 0 refuted. 0 times theorem prover too weak. 6498 trivial. 0 not checked. [2025-01-09 09:48:56,493 INFO L308 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2025-01-09 09:48:56,493 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [46227665] provided 1 perfect and 0 imperfect interpolant sequences [2025-01-09 09:48:56,493 INFO L185 FreeRefinementEngine]: Found 1 perfect and 1 imperfect interpolant sequences. [2025-01-09 09:48:56,494 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [2] total 2 [2025-01-09 09:48:56,496 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2091726960] [2025-01-09 09:48:56,497 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-01-09 09:48:56,500 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 2 states [2025-01-09 09:48:56,500 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-01-09 09:48:56,515 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 2 interpolants. [2025-01-09 09:48:56,515 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=1, Invalid=1, Unknown=0, NotChecked=0, Total=2 [2025-01-09 09:48:56,517 INFO L87 Difference]: Start difference. First operand has 211 states, 150 states have (on average 1.5733333333333333) internal successors, (236), 151 states have internal predecessors, (236), 58 states have call successors, (58), 1 states have call predecessors, (58), 1 states have return successors, (58), 58 states have call predecessors, (58), 58 states have call successors, (58) Second operand has 2 states, 2 states have (on average 45.0) internal successors, (90), 2 states have internal predecessors, (90), 2 states have call successors, (58), 2 states have call predecessors, (58), 1 states have return successors, (58), 1 states have call predecessors, (58), 2 states have call successors, (58) [2025-01-09 09:48:56,559 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-01-09 09:48:56,560 INFO L93 Difference]: Finished difference Result 416 states and 757 transitions. [2025-01-09 09:48:56,560 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 2 states. [2025-01-09 09:48:56,562 INFO L78 Accepts]: Start accepts. Automaton has has 2 states, 2 states have (on average 45.0) internal successors, (90), 2 states have internal predecessors, (90), 2 states have call successors, (58), 2 states have call predecessors, (58), 1 states have return successors, (58), 1 states have call predecessors, (58), 2 states have call successors, (58) Word has length 375 [2025-01-09 09:48:56,562 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-01-09 09:48:56,569 INFO L225 Difference]: With dead ends: 416 [2025-01-09 09:48:56,569 INFO L226 Difference]: Without dead ends: 208 [2025-01-09 09:48:56,573 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 376 GetRequests, 376 SyntacticMatches, 0 SemanticMatches, 0 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=1, Invalid=1, Unknown=0, NotChecked=0, Total=2 [2025-01-09 09:48:56,578 INFO L435 NwaCegarLoop]: 347 mSDtfsCounter, 0 mSDsluCounter, 0 mSDsCounter, 0 mSdLazyCounter, 0 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 0 SdHoareTripleChecker+Valid, 347 SdHoareTripleChecker+Invalid, 0 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 0 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2025-01-09 09:48:56,580 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [0 Valid, 347 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 0 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2025-01-09 09:48:56,591 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 208 states. [2025-01-09 09:48:56,630 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 208 to 208. [2025-01-09 09:48:56,633 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 208 states, 148 states have (on average 1.5608108108108107) internal successors, (231), 148 states have internal predecessors, (231), 58 states have call successors, (58), 1 states have call predecessors, (58), 1 states have return successors, (58), 58 states have call predecessors, (58), 58 states have call successors, (58) [2025-01-09 09:48:56,642 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 208 states to 208 states and 347 transitions. [2025-01-09 09:48:56,646 INFO L78 Accepts]: Start accepts. Automaton has 208 states and 347 transitions. Word has length 375 [2025-01-09 09:48:56,647 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-01-09 09:48:56,647 INFO L471 AbstractCegarLoop]: Abstraction has 208 states and 347 transitions. [2025-01-09 09:48:56,648 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 2 states, 2 states have (on average 45.0) internal successors, (90), 2 states have internal predecessors, (90), 2 states have call successors, (58), 2 states have call predecessors, (58), 1 states have return successors, (58), 1 states have call predecessors, (58), 2 states have call successors, (58) [2025-01-09 09:48:56,648 INFO L276 IsEmpty]: Start isEmpty. Operand 208 states and 347 transitions. [2025-01-09 09:48:56,660 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 376 [2025-01-09 09:48:56,660 INFO L210 NwaCegarLoop]: Found error trace [2025-01-09 09:48:56,660 INFO L218 NwaCegarLoop]: trace histogram [58, 58, 58, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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-09 09:48:56,670 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-09 09:48:56,861 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-09 09:48:56,862 INFO L396 AbstractCegarLoop]: === Iteration 2 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-01-09 09:48:56,862 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-01-09 09:48:56,862 INFO L85 PathProgramCache]: Analyzing trace with hash -1099961471, now seen corresponding path program 1 times [2025-01-09 09:48:56,862 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-01-09 09:48:56,863 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1116262412] [2025-01-09 09:48:56,863 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-01-09 09:48:56,863 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-01-09 09:48:56,895 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 375 statements into 1 equivalence classes. [2025-01-09 09:48:57,016 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 375 of 375 statements. [2025-01-09 09:48:57,016 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-01-09 09:48:57,016 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-01-09 09:48:57,324 INFO L134 CoverageAnalysis]: Checked inductivity of 6612 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 6612 trivial. 0 not checked. [2025-01-09 09:48:57,325 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-01-09 09:48:57,325 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1116262412] [2025-01-09 09:48:57,325 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1116262412] provided 1 perfect and 0 imperfect interpolant sequences [2025-01-09 09:48:57,325 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-01-09 09:48:57,325 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2025-01-09 09:48:57,325 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1104882012] [2025-01-09 09:48:57,325 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-01-09 09:48:57,329 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2025-01-09 09:48:57,329 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-01-09 09:48:57,330 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2025-01-09 09:48:57,331 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-01-09 09:48:57,332 INFO L87 Difference]: Start difference. First operand 208 states and 347 transitions. Second operand has 3 states, 3 states have (on average 29.333333333333332) internal successors, (88), 3 states have internal predecessors, (88), 1 states have call successors, (58), 1 states have call predecessors, (58), 1 states have return successors, (58), 1 states have call predecessors, (58), 1 states have call successors, (58) [2025-01-09 09:48:57,442 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-01-09 09:48:57,444 INFO L93 Difference]: Finished difference Result 552 states and 924 transitions. [2025-01-09 09:48:57,445 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2025-01-09 09:48:57,445 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 29.333333333333332) internal successors, (88), 3 states have internal predecessors, (88), 1 states have call successors, (58), 1 states have call predecessors, (58), 1 states have return successors, (58), 1 states have call predecessors, (58), 1 states have call successors, (58) Word has length 375 [2025-01-09 09:48:57,447 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-01-09 09:48:57,453 INFO L225 Difference]: With dead ends: 552 [2025-01-09 09:48:57,453 INFO L226 Difference]: Without dead ends: 347 [2025-01-09 09:48:57,455 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-09 09:48:57,455 INFO L435 NwaCegarLoop]: 420 mSDtfsCounter, 221 mSDsluCounter, 317 mSDsCounter, 0 mSdLazyCounter, 22 mSolverCounterSat, 14 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 221 SdHoareTripleChecker+Valid, 737 SdHoareTripleChecker+Invalid, 36 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 14 IncrementalHoareTripleChecker+Valid, 22 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2025-01-09 09:48:57,456 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [221 Valid, 737 Invalid, 36 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [14 Valid, 22 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2025-01-09 09:48:57,460 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 347 states. [2025-01-09 09:48:57,506 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 347 to 344. [2025-01-09 09:48:57,510 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 344 states, 253 states have (on average 1.5573122529644268) internal successors, (394), 254 states have internal predecessors, (394), 88 states have call successors, (88), 2 states have call predecessors, (88), 2 states have return successors, (88), 87 states have call predecessors, (88), 88 states have call successors, (88) [2025-01-09 09:48:57,513 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 344 states to 344 states and 570 transitions. [2025-01-09 09:48:57,516 INFO L78 Accepts]: Start accepts. Automaton has 344 states and 570 transitions. Word has length 375 [2025-01-09 09:48:57,518 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-01-09 09:48:57,519 INFO L471 AbstractCegarLoop]: Abstraction has 344 states and 570 transitions. [2025-01-09 09:48:57,519 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 29.333333333333332) internal successors, (88), 3 states have internal predecessors, (88), 1 states have call successors, (58), 1 states have call predecessors, (58), 1 states have return successors, (58), 1 states have call predecessors, (58), 1 states have call successors, (58) [2025-01-09 09:48:57,519 INFO L276 IsEmpty]: Start isEmpty. Operand 344 states and 570 transitions. [2025-01-09 09:48:57,525 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 376 [2025-01-09 09:48:57,525 INFO L210 NwaCegarLoop]: Found error trace [2025-01-09 09:48:57,526 INFO L218 NwaCegarLoop]: trace histogram [58, 58, 58, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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-09 09:48:57,529 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable1 [2025-01-09 09:48:57,530 INFO L396 AbstractCegarLoop]: === Iteration 3 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-01-09 09:48:57,530 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-01-09 09:48:57,531 INFO L85 PathProgramCache]: Analyzing trace with hash -827491371, now seen corresponding path program 1 times [2025-01-09 09:48:57,532 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-01-09 09:48:57,532 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1036910250] [2025-01-09 09:48:57,532 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-01-09 09:48:57,532 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-01-09 09:48:57,570 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 375 statements into 1 equivalence classes. [2025-01-09 09:48:57,637 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 375 of 375 statements. [2025-01-09 09:48:57,638 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-01-09 09:48:57,638 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-01-09 09:48:58,054 INFO L134 CoverageAnalysis]: Checked inductivity of 6612 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 6612 trivial. 0 not checked. [2025-01-09 09:48:58,057 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-01-09 09:48:58,057 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1036910250] [2025-01-09 09:48:58,057 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1036910250] provided 1 perfect and 0 imperfect interpolant sequences [2025-01-09 09:48:58,057 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-01-09 09:48:58,057 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2025-01-09 09:48:58,057 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [528878856] [2025-01-09 09:48:58,057 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-01-09 09:48:58,058 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2025-01-09 09:48:58,058 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-01-09 09:48:58,059 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2025-01-09 09:48:58,059 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2025-01-09 09:48:58,059 INFO L87 Difference]: Start difference. First operand 344 states and 570 transitions. Second operand has 4 states, 4 states have (on average 22.0) internal successors, (88), 4 states have internal predecessors, (88), 1 states have call successors, (58), 1 states have call predecessors, (58), 1 states have return successors, (58), 1 states have call predecessors, (58), 1 states have call successors, (58) [2025-01-09 09:48:58,913 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-01-09 09:48:58,913 INFO L93 Difference]: Finished difference Result 1288 states and 2119 transitions. [2025-01-09 09:48:58,913 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2025-01-09 09:48:58,914 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 4 states have (on average 22.0) internal successors, (88), 4 states have internal predecessors, (88), 1 states have call successors, (58), 1 states have call predecessors, (58), 1 states have return successors, (58), 1 states have call predecessors, (58), 1 states have call successors, (58) Word has length 375 [2025-01-09 09:48:58,915 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-01-09 09:48:58,928 INFO L225 Difference]: With dead ends: 1288 [2025-01-09 09:48:58,928 INFO L226 Difference]: Without dead ends: 947 [2025-01-09 09:48:58,930 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-09 09:48:58,932 INFO L435 NwaCegarLoop]: 440 mSDtfsCounter, 610 mSDsluCounter, 455 mSDsCounter, 0 mSdLazyCounter, 253 mSolverCounterSat, 81 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.6s Time, 0 mProtectedPredicate, 0 mProtectedAction, 610 SdHoareTripleChecker+Valid, 895 SdHoareTripleChecker+Invalid, 334 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 81 IncrementalHoareTripleChecker+Valid, 253 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.7s IncrementalHoareTripleChecker+Time [2025-01-09 09:48:58,932 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [610 Valid, 895 Invalid, 334 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [81 Valid, 253 Invalid, 0 Unknown, 0 Unchecked, 0.7s Time] [2025-01-09 09:48:58,935 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 947 states. [2025-01-09 09:48:59,037 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 947 to 573. [2025-01-09 09:48:59,039 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 573 states, 410 states have (on average 1.5341463414634147) internal successors, (629), 413 states have internal predecessors, (629), 158 states have call successors, (158), 4 states have call predecessors, (158), 4 states have return successors, (158), 155 states have call predecessors, (158), 158 states have call successors, (158) [2025-01-09 09:48:59,045 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 573 states to 573 states and 945 transitions. [2025-01-09 09:48:59,046 INFO L78 Accepts]: Start accepts. Automaton has 573 states and 945 transitions. Word has length 375 [2025-01-09 09:48:59,048 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-01-09 09:48:59,048 INFO L471 AbstractCegarLoop]: Abstraction has 573 states and 945 transitions. [2025-01-09 09:48:59,049 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 22.0) internal successors, (88), 4 states have internal predecessors, (88), 1 states have call successors, (58), 1 states have call predecessors, (58), 1 states have return successors, (58), 1 states have call predecessors, (58), 1 states have call successors, (58) [2025-01-09 09:48:59,049 INFO L276 IsEmpty]: Start isEmpty. Operand 573 states and 945 transitions. [2025-01-09 09:48:59,054 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 377 [2025-01-09 09:48:59,055 INFO L210 NwaCegarLoop]: Found error trace [2025-01-09 09:48:59,055 INFO L218 NwaCegarLoop]: trace histogram [58, 58, 58, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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-09 09:48:59,055 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable2 [2025-01-09 09:48:59,055 INFO L396 AbstractCegarLoop]: === Iteration 4 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-01-09 09:48:59,056 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-01-09 09:48:59,056 INFO L85 PathProgramCache]: Analyzing trace with hash -884115657, now seen corresponding path program 1 times [2025-01-09 09:48:59,056 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-01-09 09:48:59,056 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1599548455] [2025-01-09 09:48:59,057 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-01-09 09:48:59,057 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-01-09 09:48:59,088 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 376 statements into 1 equivalence classes. [2025-01-09 09:48:59,147 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 376 of 376 statements. [2025-01-09 09:48:59,148 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-01-09 09:48:59,148 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-01-09 09:48:59,374 INFO L134 CoverageAnalysis]: Checked inductivity of 6612 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 6612 trivial. 0 not checked. [2025-01-09 09:48:59,374 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-01-09 09:48:59,375 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1599548455] [2025-01-09 09:48:59,375 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1599548455] provided 1 perfect and 0 imperfect interpolant sequences [2025-01-09 09:48:59,375 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-01-09 09:48:59,375 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2025-01-09 09:48:59,375 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1016018877] [2025-01-09 09:48:59,375 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-01-09 09:48:59,376 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2025-01-09 09:48:59,376 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-01-09 09:48:59,377 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2025-01-09 09:48:59,377 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-01-09 09:48:59,377 INFO L87 Difference]: Start difference. First operand 573 states and 945 transitions. Second operand has 3 states, 3 states have (on average 29.666666666666668) internal successors, (89), 3 states have internal predecessors, (89), 1 states have call successors, (58), 1 states have call predecessors, (58), 1 states have return successors, (58), 1 states have call predecessors, (58), 1 states have call successors, (58) [2025-01-09 09:48:59,447 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-01-09 09:48:59,448 INFO L93 Difference]: Finished difference Result 1144 states and 1887 transitions. [2025-01-09 09:48:59,448 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2025-01-09 09:48:59,449 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 29.666666666666668) internal successors, (89), 3 states have internal predecessors, (89), 1 states have call successors, (58), 1 states have call predecessors, (58), 1 states have return successors, (58), 1 states have call predecessors, (58), 1 states have call successors, (58) Word has length 376 [2025-01-09 09:48:59,450 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-01-09 09:48:59,459 INFO L225 Difference]: With dead ends: 1144 [2025-01-09 09:48:59,459 INFO L226 Difference]: Without dead ends: 574 [2025-01-09 09:48:59,461 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-09 09:48:59,462 INFO L435 NwaCegarLoop]: 452 mSDtfsCounter, 199 mSDsluCounter, 333 mSDsCounter, 0 mSdLazyCounter, 16 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 199 SdHoareTripleChecker+Valid, 785 SdHoareTripleChecker+Invalid, 16 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 16 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2025-01-09 09:48:59,462 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [199 Valid, 785 Invalid, 16 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 16 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2025-01-09 09:48:59,463 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 574 states. [2025-01-09 09:48:59,533 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 574 to 571. [2025-01-09 09:48:59,535 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 571 states, 408 states have (on average 1.5318627450980393) internal successors, (625), 411 states have internal predecessors, (625), 158 states have call successors, (158), 4 states have call predecessors, (158), 4 states have return successors, (158), 155 states have call predecessors, (158), 158 states have call successors, (158) [2025-01-09 09:48:59,539 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 571 states to 571 states and 941 transitions. [2025-01-09 09:48:59,540 INFO L78 Accepts]: Start accepts. Automaton has 571 states and 941 transitions. Word has length 376 [2025-01-09 09:48:59,541 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-01-09 09:48:59,541 INFO L471 AbstractCegarLoop]: Abstraction has 571 states and 941 transitions. [2025-01-09 09:48:59,541 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 29.666666666666668) internal successors, (89), 3 states have internal predecessors, (89), 1 states have call successors, (58), 1 states have call predecessors, (58), 1 states have return successors, (58), 1 states have call predecessors, (58), 1 states have call successors, (58) [2025-01-09 09:48:59,542 INFO L276 IsEmpty]: Start isEmpty. Operand 571 states and 941 transitions. [2025-01-09 09:48:59,544 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 377 [2025-01-09 09:48:59,544 INFO L210 NwaCegarLoop]: Found error trace [2025-01-09 09:48:59,546 INFO L218 NwaCegarLoop]: trace histogram [58, 58, 58, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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-09 09:48:59,546 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable3 [2025-01-09 09:48:59,546 INFO L396 AbstractCegarLoop]: === Iteration 5 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-01-09 09:48:59,547 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-01-09 09:48:59,547 INFO L85 PathProgramCache]: Analyzing trace with hash 911198532, now seen corresponding path program 1 times [2025-01-09 09:48:59,547 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-01-09 09:48:59,547 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1021923819] [2025-01-09 09:48:59,548 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-01-09 09:48:59,548 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-01-09 09:48:59,574 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 376 statements into 1 equivalence classes. [2025-01-09 09:48:59,644 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 376 of 376 statements. [2025-01-09 09:48:59,644 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-01-09 09:48:59,644 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-01-09 09:49:00,276 INFO L134 CoverageAnalysis]: Checked inductivity of 6612 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 6612 trivial. 0 not checked. [2025-01-09 09:49:00,276 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-01-09 09:49:00,276 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1021923819] [2025-01-09 09:49:00,276 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1021923819] provided 1 perfect and 0 imperfect interpolant sequences [2025-01-09 09:49:00,276 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-01-09 09:49:00,276 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2025-01-09 09:49:00,276 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1085440559] [2025-01-09 09:49:00,277 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-01-09 09:49:00,277 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2025-01-09 09:49:00,278 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-01-09 09:49:00,278 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2025-01-09 09:49:00,279 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2025-01-09 09:49:00,279 INFO L87 Difference]: Start difference. First operand 571 states and 941 transitions. Second operand has 5 states, 5 states have (on average 17.8) internal successors, (89), 5 states have internal predecessors, (89), 1 states have call successors, (58), 1 states have call predecessors, (58), 1 states have return successors, (58), 1 states have call predecessors, (58), 1 states have call successors, (58) [2025-01-09 09:49:00,789 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-01-09 09:49:00,789 INFO L93 Difference]: Finished difference Result 1761 states and 2890 transitions. [2025-01-09 09:49:00,790 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2025-01-09 09:49:00,790 INFO L78 Accepts]: Start accepts. Automaton has has 5 states, 5 states have (on average 17.8) internal successors, (89), 5 states have internal predecessors, (89), 1 states have call successors, (58), 1 states have call predecessors, (58), 1 states have return successors, (58), 1 states have call predecessors, (58), 1 states have call successors, (58) Word has length 376 [2025-01-09 09:49:00,791 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-01-09 09:49:00,799 INFO L225 Difference]: With dead ends: 1761 [2025-01-09 09:49:00,799 INFO L226 Difference]: Without dead ends: 1193 [2025-01-09 09:49:00,802 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 9 GetRequests, 4 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-09 09:49:00,802 INFO L435 NwaCegarLoop]: 355 mSDtfsCounter, 389 mSDsluCounter, 899 mSDsCounter, 0 mSdLazyCounter, 160 mSolverCounterSat, 175 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.3s Time, 0 mProtectedPredicate, 0 mProtectedAction, 389 SdHoareTripleChecker+Valid, 1254 SdHoareTripleChecker+Invalid, 335 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 175 IncrementalHoareTripleChecker+Valid, 160 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.4s IncrementalHoareTripleChecker+Time [2025-01-09 09:49:00,803 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [389 Valid, 1254 Invalid, 335 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [175 Valid, 160 Invalid, 0 Unknown, 0 Unchecked, 0.4s Time] [2025-01-09 09:49:00,804 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1193 states. [2025-01-09 09:49:00,951 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1193 to 1141. [2025-01-09 09:49:00,954 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 1141 states, 816 states have (on average 1.5318627450980393) internal successors, (1250), 822 states have internal predecessors, (1250), 316 states have call successors, (316), 8 states have call predecessors, (316), 8 states have return successors, (316), 310 states have call predecessors, (316), 316 states have call successors, (316) [2025-01-09 09:49:00,963 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1141 states to 1141 states and 1882 transitions. [2025-01-09 09:49:00,964 INFO L78 Accepts]: Start accepts. Automaton has 1141 states and 1882 transitions. Word has length 376 [2025-01-09 09:49:00,965 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-01-09 09:49:00,965 INFO L471 AbstractCegarLoop]: Abstraction has 1141 states and 1882 transitions. [2025-01-09 09:49:00,966 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 17.8) internal successors, (89), 5 states have internal predecessors, (89), 1 states have call successors, (58), 1 states have call predecessors, (58), 1 states have return successors, (58), 1 states have call predecessors, (58), 1 states have call successors, (58) [2025-01-09 09:49:00,966 INFO L276 IsEmpty]: Start isEmpty. Operand 1141 states and 1882 transitions. [2025-01-09 09:49:00,970 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 378 [2025-01-09 09:49:00,970 INFO L210 NwaCegarLoop]: Found error trace [2025-01-09 09:49:00,970 INFO L218 NwaCegarLoop]: trace histogram [58, 58, 58, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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-09 09:49:00,970 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable4 [2025-01-09 09:49:00,970 INFO L396 AbstractCegarLoop]: === Iteration 6 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-01-09 09:49:00,971 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-01-09 09:49:00,971 INFO L85 PathProgramCache]: Analyzing trace with hash -1076663831, now seen corresponding path program 1 times [2025-01-09 09:49:00,971 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-01-09 09:49:00,971 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2027587493] [2025-01-09 09:49:00,971 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-01-09 09:49:00,971 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-01-09 09:49:01,002 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 377 statements into 1 equivalence classes. [2025-01-09 09:49:01,146 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 377 of 377 statements. [2025-01-09 09:49:01,146 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-01-09 09:49:01,146 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-01-09 09:49:02,546 INFO L134 CoverageAnalysis]: Checked inductivity of 6612 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 6612 trivial. 0 not checked. [2025-01-09 09:49:02,546 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-01-09 09:49:02,546 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2027587493] [2025-01-09 09:49:02,547 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [2027587493] provided 1 perfect and 0 imperfect interpolant sequences [2025-01-09 09:49:02,547 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-01-09 09:49:02,547 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2025-01-09 09:49:02,547 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [200451909] [2025-01-09 09:49:02,547 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-01-09 09:49:02,548 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2025-01-09 09:49:02,548 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-01-09 09:49:02,548 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2025-01-09 09:49:02,549 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=10, Invalid=20, Unknown=0, NotChecked=0, Total=30 [2025-01-09 09:49:02,549 INFO L87 Difference]: Start difference. First operand 1141 states and 1882 transitions. Second operand has 6 states, 6 states have (on average 15.0) internal successors, (90), 6 states have internal predecessors, (90), 1 states have call successors, (58), 1 states have call predecessors, (58), 1 states have return successors, (58), 1 states have call predecessors, (58), 1 states have call successors, (58) [2025-01-09 09:49:03,278 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-01-09 09:49:03,279 INFO L93 Difference]: Finished difference Result 2728 states and 4491 transitions. [2025-01-09 09:49:03,279 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2025-01-09 09:49:03,279 INFO L78 Accepts]: Start accepts. Automaton has has 6 states, 6 states have (on average 15.0) internal successors, (90), 6 states have internal predecessors, (90), 1 states have call successors, (58), 1 states have call predecessors, (58), 1 states have return successors, (58), 1 states have call predecessors, (58), 1 states have call successors, (58) Word has length 377 [2025-01-09 09:49:03,280 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-01-09 09:49:03,290 INFO L225 Difference]: With dead ends: 2728 [2025-01-09 09:49:03,291 INFO L226 Difference]: Without dead ends: 1590 [2025-01-09 09:49:03,295 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 12 GetRequests, 5 SyntacticMatches, 1 SemanticMatches, 6 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 2 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=19, Invalid=37, Unknown=0, NotChecked=0, Total=56 [2025-01-09 09:49:03,295 INFO L435 NwaCegarLoop]: 329 mSDtfsCounter, 358 mSDsluCounter, 1057 mSDsCounter, 0 mSdLazyCounter, 306 mSolverCounterSat, 176 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.4s Time, 0 mProtectedPredicate, 0 mProtectedAction, 358 SdHoareTripleChecker+Valid, 1386 SdHoareTripleChecker+Invalid, 482 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 176 IncrementalHoareTripleChecker+Valid, 306 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.5s IncrementalHoareTripleChecker+Time [2025-01-09 09:49:03,296 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [358 Valid, 1386 Invalid, 482 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [176 Valid, 306 Invalid, 0 Unknown, 0 Unchecked, 0.5s Time] [2025-01-09 09:49:03,299 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1590 states. [2025-01-09 09:49:03,452 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1590 to 1524. [2025-01-09 09:49:03,455 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 1524 states, 1140 states have (on average 1.5535087719298246) internal successors, (1771), 1146 states have internal predecessors, (1771), 374 states have call successors, (374), 9 states have call predecessors, (374), 9 states have return successors, (374), 368 states have call predecessors, (374), 374 states have call successors, (374) [2025-01-09 09:49:03,464 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1524 states to 1524 states and 2519 transitions. [2025-01-09 09:49:03,467 INFO L78 Accepts]: Start accepts. Automaton has 1524 states and 2519 transitions. Word has length 377 [2025-01-09 09:49:03,467 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-01-09 09:49:03,467 INFO L471 AbstractCegarLoop]: Abstraction has 1524 states and 2519 transitions. [2025-01-09 09:49:03,468 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 6 states have (on average 15.0) internal successors, (90), 6 states have internal predecessors, (90), 1 states have call successors, (58), 1 states have call predecessors, (58), 1 states have return successors, (58), 1 states have call predecessors, (58), 1 states have call successors, (58) [2025-01-09 09:49:03,468 INFO L276 IsEmpty]: Start isEmpty. Operand 1524 states and 2519 transitions. [2025-01-09 09:49:03,473 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 380 [2025-01-09 09:49:03,473 INFO L210 NwaCegarLoop]: Found error trace [2025-01-09 09:49:03,473 INFO L218 NwaCegarLoop]: trace histogram [58, 58, 58, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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-09 09:49:03,473 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable5 [2025-01-09 09:49:03,473 INFO L396 AbstractCegarLoop]: === Iteration 7 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-01-09 09:49:03,474 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-01-09 09:49:03,474 INFO L85 PathProgramCache]: Analyzing trace with hash -135263452, now seen corresponding path program 1 times [2025-01-09 09:49:03,474 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-01-09 09:49:03,474 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1608932603] [2025-01-09 09:49:03,474 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-01-09 09:49:03,475 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-01-09 09:49:03,500 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 379 statements into 1 equivalence classes. [2025-01-09 09:49:03,631 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 379 of 379 statements. [2025-01-09 09:49:03,631 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-01-09 09:49:03,631 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-01-09 09:49:03,995 INFO L134 CoverageAnalysis]: Checked inductivity of 6612 backedges. 120 proven. 51 refuted. 0 times theorem prover too weak. 6441 trivial. 0 not checked. [2025-01-09 09:49:03,995 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-01-09 09:49:03,995 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1608932603] [2025-01-09 09:49:03,995 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1608932603] provided 0 perfect and 1 imperfect interpolant sequences [2025-01-09 09:49:03,996 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1555439618] [2025-01-09 09:49:03,996 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-01-09 09:49:03,996 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-01-09 09:49:03,996 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 [2025-01-09 09:49:03,998 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-09 09:49:04,001 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-09 09:49:04,131 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 379 statements into 1 equivalence classes. [2025-01-09 09:49:04,252 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 379 of 379 statements. [2025-01-09 09:49:04,252 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-01-09 09:49:04,252 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-01-09 09:49:04,256 INFO L256 TraceCheckSpWp]: Trace formula consists of 858 conjuncts, 6 conjuncts are in the unsatisfiable core [2025-01-09 09:49:04,268 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-01-09 09:49:04,552 INFO L134 CoverageAnalysis]: Checked inductivity of 6612 backedges. 2857 proven. 51 refuted. 0 times theorem prover too weak. 3704 trivial. 0 not checked. [2025-01-09 09:49:04,552 INFO L312 TraceCheckSpWp]: Computing backward predicates... [2025-01-09 09:49:04,924 INFO L134 CoverageAnalysis]: Checked inductivity of 6612 backedges. 120 proven. 51 refuted. 0 times theorem prover too weak. 6441 trivial. 0 not checked. [2025-01-09 09:49:04,925 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1555439618] provided 0 perfect and 2 imperfect interpolant sequences [2025-01-09 09:49:04,925 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2025-01-09 09:49:04,925 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [5, 5, 5] total 8 [2025-01-09 09:49:04,925 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [122247043] [2025-01-09 09:49:04,925 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2025-01-09 09:49:04,926 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 8 states [2025-01-09 09:49:04,926 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-01-09 09:49:04,927 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2025-01-09 09:49:04,927 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=22, Invalid=34, Unknown=0, NotChecked=0, Total=56 [2025-01-09 09:49:04,927 INFO L87 Difference]: Start difference. First operand 1524 states and 2519 transitions. Second operand has 8 states, 8 states have (on average 16.25) internal successors, (130), 8 states have internal predecessors, (130), 3 states have call successors, (92), 2 states have call predecessors, (92), 4 states have return successors, (93), 3 states have call predecessors, (93), 3 states have call successors, (93) [2025-01-09 09:49:05,374 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-01-09 09:49:05,374 INFO L93 Difference]: Finished difference Result 2228 states and 3673 transitions. [2025-01-09 09:49:05,374 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2025-01-09 09:49:05,375 INFO L78 Accepts]: Start accepts. Automaton has has 8 states, 8 states have (on average 16.25) internal successors, (130), 8 states have internal predecessors, (130), 3 states have call successors, (92), 2 states have call predecessors, (92), 4 states have return successors, (93), 3 states have call predecessors, (93), 3 states have call successors, (93) Word has length 379 [2025-01-09 09:49:05,376 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-01-09 09:49:05,385 INFO L225 Difference]: With dead ends: 2228 [2025-01-09 09:49:05,386 INFO L226 Difference]: Without dead ends: 988 [2025-01-09 09:49:05,390 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 764 GetRequests, 755 SyntacticMatches, 0 SemanticMatches, 9 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 2 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=46, Invalid=64, Unknown=0, NotChecked=0, Total=110 [2025-01-09 09:49:05,390 INFO L435 NwaCegarLoop]: 276 mSDtfsCounter, 435 mSDsluCounter, 435 mSDsCounter, 0 mSdLazyCounter, 314 mSolverCounterSat, 98 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.3s Time, 0 mProtectedPredicate, 0 mProtectedAction, 475 SdHoareTripleChecker+Valid, 711 SdHoareTripleChecker+Invalid, 412 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 98 IncrementalHoareTripleChecker+Valid, 314 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.3s IncrementalHoareTripleChecker+Time [2025-01-09 09:49:05,392 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [475 Valid, 711 Invalid, 412 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [98 Valid, 314 Invalid, 0 Unknown, 0 Unchecked, 0.3s Time] [2025-01-09 09:49:05,393 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 988 states. [2025-01-09 09:49:05,478 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 988 to 978. [2025-01-09 09:49:05,480 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 978 states, 735 states have (on average 1.5537414965986394) internal successors, (1142), 737 states have internal predecessors, (1142), 234 states have call successors, (234), 8 states have call predecessors, (234), 8 states have return successors, (234), 232 states have call predecessors, (234), 234 states have call successors, (234) [2025-01-09 09:49:05,488 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 978 states to 978 states and 1610 transitions. [2025-01-09 09:49:05,490 INFO L78 Accepts]: Start accepts. Automaton has 978 states and 1610 transitions. Word has length 379 [2025-01-09 09:49:05,491 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-01-09 09:49:05,491 INFO L471 AbstractCegarLoop]: Abstraction has 978 states and 1610 transitions. [2025-01-09 09:49:05,491 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 8 states, 8 states have (on average 16.25) internal successors, (130), 8 states have internal predecessors, (130), 3 states have call successors, (92), 2 states have call predecessors, (92), 4 states have return successors, (93), 3 states have call predecessors, (93), 3 states have call successors, (93) [2025-01-09 09:49:05,492 INFO L276 IsEmpty]: Start isEmpty. Operand 978 states and 1610 transitions. [2025-01-09 09:49:05,496 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 380 [2025-01-09 09:49:05,497 INFO L210 NwaCegarLoop]: Found error trace [2025-01-09 09:49:05,497 INFO L218 NwaCegarLoop]: trace histogram [58, 58, 58, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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-09 09:49:05,507 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (3)] Forceful destruction successful, exit code 0 [2025-01-09 09:49:05,697 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable6,3 /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-01-09 09:49:05,698 INFO L396 AbstractCegarLoop]: === Iteration 8 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-01-09 09:49:05,699 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-01-09 09:49:05,699 INFO L85 PathProgramCache]: Analyzing trace with hash 19215657, now seen corresponding path program 1 times [2025-01-09 09:49:05,699 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-01-09 09:49:05,699 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [808488922] [2025-01-09 09:49:05,700 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-01-09 09:49:05,700 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-01-09 09:49:05,725 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 379 statements into 1 equivalence classes. [2025-01-09 09:49:05,872 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 379 of 379 statements. [2025-01-09 09:49:05,873 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-01-09 09:49:05,873 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-01-09 09:49:08,815 INFO L134 CoverageAnalysis]: Checked inductivity of 6612 backedges. 210 proven. 126 refuted. 0 times theorem prover too weak. 6276 trivial. 0 not checked. [2025-01-09 09:49:08,816 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-01-09 09:49:08,816 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [808488922] [2025-01-09 09:49:08,816 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [808488922] provided 0 perfect and 1 imperfect interpolant sequences [2025-01-09 09:49:08,816 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [962787822] [2025-01-09 09:49:08,816 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-01-09 09:49:08,816 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-01-09 09:49:08,816 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 [2025-01-09 09:49:08,820 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-09 09:49:08,822 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-09 09:49:08,951 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 379 statements into 1 equivalence classes. [2025-01-09 09:49:09,063 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 379 of 379 statements. [2025-01-09 09:49:09,064 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-01-09 09:49:09,064 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-01-09 09:49:09,069 INFO L256 TraceCheckSpWp]: Trace formula consists of 860 conjuncts, 12 conjuncts are in the unsatisfiable core [2025-01-09 09:49:09,077 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-01-09 09:49:09,782 INFO L134 CoverageAnalysis]: Checked inductivity of 6612 backedges. 4223 proven. 138 refuted. 0 times theorem prover too weak. 2251 trivial. 0 not checked. [2025-01-09 09:49:09,782 INFO L312 TraceCheckSpWp]: Computing backward predicates... [2025-01-09 09:49:10,214 INFO L134 CoverageAnalysis]: Checked inductivity of 6612 backedges. 120 proven. 51 refuted. 0 times theorem prover too weak. 6441 trivial. 0 not checked. [2025-01-09 09:49:10,215 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [962787822] provided 0 perfect and 2 imperfect interpolant sequences [2025-01-09 09:49:10,215 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2025-01-09 09:49:10,215 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [10, 9, 6] total 18 [2025-01-09 09:49:10,215 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [472937608] [2025-01-09 09:49:10,215 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2025-01-09 09:49:10,217 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 18 states [2025-01-09 09:49:10,217 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-01-09 09:49:10,218 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 18 interpolants. [2025-01-09 09:49:10,218 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=57, Invalid=249, Unknown=0, NotChecked=0, Total=306 [2025-01-09 09:49:10,218 INFO L87 Difference]: Start difference. First operand 978 states and 1610 transitions. Second operand has 18 states, 18 states have (on average 9.277777777777779) internal successors, (167), 18 states have internal predecessors, (167), 5 states have call successors, (118), 3 states have call predecessors, (118), 6 states have return successors, (119), 5 states have call predecessors, (119), 5 states have call successors, (119) [2025-01-09 09:49:13,815 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-01-09 09:49:13,816 INFO L93 Difference]: Finished difference Result 2803 states and 4514 transitions. [2025-01-09 09:49:13,816 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 42 states. [2025-01-09 09:49:13,817 INFO L78 Accepts]: Start accepts. Automaton has has 18 states, 18 states have (on average 9.277777777777779) internal successors, (167), 18 states have internal predecessors, (167), 5 states have call successors, (118), 3 states have call predecessors, (118), 6 states have return successors, (119), 5 states have call predecessors, (119), 5 states have call successors, (119) Word has length 379 [2025-01-09 09:49:13,817 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-01-09 09:49:13,832 INFO L225 Difference]: With dead ends: 2803 [2025-01-09 09:49:13,832 INFO L226 Difference]: Without dead ends: 1981 [2025-01-09 09:49:13,836 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 810 GetRequests, 759 SyntacticMatches, 0 SemanticMatches, 51 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 616 ImplicationChecksByTransitivity, 1.0s TimeCoverageRelationStatistics Valid=700, Invalid=2056, Unknown=0, NotChecked=0, Total=2756 [2025-01-09 09:49:13,837 INFO L435 NwaCegarLoop]: 378 mSDtfsCounter, 2695 mSDsluCounter, 1618 mSDsCounter, 0 mSdLazyCounter, 2374 mSolverCounterSat, 571 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 2.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 2697 SdHoareTripleChecker+Valid, 1996 SdHoareTripleChecker+Invalid, 2945 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 571 IncrementalHoareTripleChecker+Valid, 2374 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 2.6s IncrementalHoareTripleChecker+Time [2025-01-09 09:49:13,837 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [2697 Valid, 1996 Invalid, 2945 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [571 Valid, 2374 Invalid, 0 Unknown, 0 Unchecked, 2.6s Time] [2025-01-09 09:49:13,839 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1981 states. [2025-01-09 09:49:13,929 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1981 to 1119. [2025-01-09 09:49:13,931 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 1119 states, 861 states have (on average 1.5214866434378629) internal successors, (1310), 863 states have internal predecessors, (1310), 234 states have call successors, (234), 23 states have call predecessors, (234), 23 states have return successors, (234), 232 states have call predecessors, (234), 234 states have call successors, (234) [2025-01-09 09:49:13,941 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1119 states to 1119 states and 1778 transitions. [2025-01-09 09:49:13,943 INFO L78 Accepts]: Start accepts. Automaton has 1119 states and 1778 transitions. Word has length 379 [2025-01-09 09:49:13,944 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-01-09 09:49:13,944 INFO L471 AbstractCegarLoop]: Abstraction has 1119 states and 1778 transitions. [2025-01-09 09:49:13,944 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 18 states, 18 states have (on average 9.277777777777779) internal successors, (167), 18 states have internal predecessors, (167), 5 states have call successors, (118), 3 states have call predecessors, (118), 6 states have return successors, (119), 5 states have call predecessors, (119), 5 states have call successors, (119) [2025-01-09 09:49:13,944 INFO L276 IsEmpty]: Start isEmpty. Operand 1119 states and 1778 transitions. [2025-01-09 09:49:13,946 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 380 [2025-01-09 09:49:13,947 INFO L210 NwaCegarLoop]: Found error trace [2025-01-09 09:49:13,948 INFO L218 NwaCegarLoop]: trace histogram [58, 58, 58, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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-09 09:49:13,957 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-09 09:49:14,152 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-09 09:49:14,152 INFO L396 AbstractCegarLoop]: === Iteration 9 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-01-09 09:49:14,153 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-01-09 09:49:14,153 INFO L85 PathProgramCache]: Analyzing trace with hash -1104445147, now seen corresponding path program 1 times [2025-01-09 09:49:14,153 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-01-09 09:49:14,153 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [810792869] [2025-01-09 09:49:14,153 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-01-09 09:49:14,154 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-01-09 09:49:14,174 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 379 statements into 1 equivalence classes. [2025-01-09 09:49:14,223 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 379 of 379 statements. [2025-01-09 09:49:14,223 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-01-09 09:49:14,223 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-01-09 09:49:14,465 INFO L134 CoverageAnalysis]: Checked inductivity of 6612 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 6612 trivial. 0 not checked. [2025-01-09 09:49:14,466 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-01-09 09:49:14,466 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [810792869] [2025-01-09 09:49:14,466 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [810792869] provided 1 perfect and 0 imperfect interpolant sequences [2025-01-09 09:49:14,466 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-01-09 09:49:14,466 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2025-01-09 09:49:14,466 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [848305664] [2025-01-09 09:49:14,467 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-01-09 09:49:14,467 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2025-01-09 09:49:14,467 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-01-09 09:49:14,468 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2025-01-09 09:49:14,468 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2025-01-09 09:49:14,469 INFO L87 Difference]: Start difference. First operand 1119 states and 1778 transitions. Second operand has 4 states, 4 states have (on average 23.0) internal successors, (92), 4 states have internal predecessors, (92), 1 states have call successors, (58), 1 states have call predecessors, (58), 1 states have return successors, (58), 1 states have call predecessors, (58), 1 states have call successors, (58) [2025-01-09 09:49:15,459 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-01-09 09:49:15,459 INFO L93 Difference]: Finished difference Result 4601 states and 7330 transitions. [2025-01-09 09:49:15,459 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2025-01-09 09:49:15,460 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 4 states have (on average 23.0) internal successors, (92), 4 states have internal predecessors, (92), 1 states have call successors, (58), 1 states have call predecessors, (58), 1 states have return successors, (58), 1 states have call predecessors, (58), 1 states have call successors, (58) Word has length 379 [2025-01-09 09:49:15,460 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-01-09 09:49:15,482 INFO L225 Difference]: With dead ends: 4601 [2025-01-09 09:49:15,482 INFO L226 Difference]: Without dead ends: 3707 [2025-01-09 09:49:15,487 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-09 09:49:15,490 INFO L435 NwaCegarLoop]: 578 mSDtfsCounter, 822 mSDsluCounter, 1024 mSDsCounter, 0 mSdLazyCounter, 343 mSolverCounterSat, 178 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.6s Time, 0 mProtectedPredicate, 0 mProtectedAction, 822 SdHoareTripleChecker+Valid, 1602 SdHoareTripleChecker+Invalid, 521 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 178 IncrementalHoareTripleChecker+Valid, 343 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.7s IncrementalHoareTripleChecker+Time [2025-01-09 09:49:15,490 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [822 Valid, 1602 Invalid, 521 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [178 Valid, 343 Invalid, 0 Unknown, 0 Unchecked, 0.7s Time] [2025-01-09 09:49:15,495 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 3707 states. [2025-01-09 09:49:15,819 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 3707 to 3665. [2025-01-09 09:49:15,825 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 3665 states, 2825 states have (on average 1.5260176991150443) internal successors, (4311), 2833 states have internal predecessors, (4311), 762 states have call successors, (762), 77 states have call predecessors, (762), 77 states have return successors, (762), 754 states have call predecessors, (762), 762 states have call successors, (762) [2025-01-09 09:49:15,840 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3665 states to 3665 states and 5835 transitions. [2025-01-09 09:49:15,844 INFO L78 Accepts]: Start accepts. Automaton has 3665 states and 5835 transitions. Word has length 379 [2025-01-09 09:49:15,844 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-01-09 09:49:15,844 INFO L471 AbstractCegarLoop]: Abstraction has 3665 states and 5835 transitions. [2025-01-09 09:49:15,845 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 23.0) internal successors, (92), 4 states have internal predecessors, (92), 1 states have call successors, (58), 1 states have call predecessors, (58), 1 states have return successors, (58), 1 states have call predecessors, (58), 1 states have call successors, (58) [2025-01-09 09:49:15,845 INFO L276 IsEmpty]: Start isEmpty. Operand 3665 states and 5835 transitions. [2025-01-09 09:49:15,848 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 381 [2025-01-09 09:49:15,848 INFO L210 NwaCegarLoop]: Found error trace [2025-01-09 09:49:15,849 INFO L218 NwaCegarLoop]: trace histogram [58, 58, 58, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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-09 09:49:15,849 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable8 [2025-01-09 09:49:15,849 INFO L396 AbstractCegarLoop]: === Iteration 10 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-01-09 09:49:15,849 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-01-09 09:49:15,850 INFO L85 PathProgramCache]: Analyzing trace with hash 1710406902, now seen corresponding path program 1 times [2025-01-09 09:49:15,850 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-01-09 09:49:15,850 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1030298924] [2025-01-09 09:49:15,850 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-01-09 09:49:15,850 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-01-09 09:49:15,869 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 380 statements into 1 equivalence classes. [2025-01-09 09:49:15,915 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 380 of 380 statements. [2025-01-09 09:49:15,916 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-01-09 09:49:15,916 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-01-09 09:49:17,462 INFO L134 CoverageAnalysis]: Checked inductivity of 6612 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 6612 trivial. 0 not checked. [2025-01-09 09:49:17,462 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-01-09 09:49:17,462 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1030298924] [2025-01-09 09:49:17,462 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1030298924] provided 1 perfect and 0 imperfect interpolant sequences [2025-01-09 09:49:17,462 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-01-09 09:49:17,462 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2025-01-09 09:49:17,463 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [683780132] [2025-01-09 09:49:17,463 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-01-09 09:49:17,463 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 7 states [2025-01-09 09:49:17,463 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-01-09 09:49:17,464 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2025-01-09 09:49:17,464 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=14, Invalid=28, Unknown=0, NotChecked=0, Total=42 [2025-01-09 09:49:17,464 INFO L87 Difference]: Start difference. First operand 3665 states and 5835 transitions. Second operand has 7 states, 7 states have (on average 13.285714285714286) internal successors, (93), 7 states have internal predecessors, (93), 1 states have call successors, (58), 1 states have call predecessors, (58), 1 states have return successors, (58), 1 states have call predecessors, (58), 1 states have call successors, (58) [2025-01-09 09:49:20,078 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-01-09 09:49:20,079 INFO L93 Difference]: Finished difference Result 16485 states and 26594 transitions. [2025-01-09 09:49:20,079 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2025-01-09 09:49:20,079 INFO L78 Accepts]: Start accepts. Automaton has has 7 states, 7 states have (on average 13.285714285714286) internal successors, (93), 7 states have internal predecessors, (93), 1 states have call successors, (58), 1 states have call predecessors, (58), 1 states have return successors, (58), 1 states have call predecessors, (58), 1 states have call successors, (58) Word has length 380 [2025-01-09 09:49:20,080 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-01-09 09:49:20,166 INFO L225 Difference]: With dead ends: 16485 [2025-01-09 09:49:20,166 INFO L226 Difference]: Without dead ends: 13323 [2025-01-09 09:49:20,183 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 20 GetRequests, 11 SyntacticMatches, 0 SemanticMatches, 9 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 3 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=42, Invalid=68, Unknown=0, NotChecked=0, Total=110 [2025-01-09 09:49:20,184 INFO L435 NwaCegarLoop]: 501 mSDtfsCounter, 1384 mSDsluCounter, 936 mSDsCounter, 0 mSdLazyCounter, 771 mSolverCounterSat, 316 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 1.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 1384 SdHoareTripleChecker+Valid, 1437 SdHoareTripleChecker+Invalid, 1087 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 316 IncrementalHoareTripleChecker+Valid, 771 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 1.4s IncrementalHoareTripleChecker+Time [2025-01-09 09:49:20,184 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [1384 Valid, 1437 Invalid, 1087 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [316 Valid, 771 Invalid, 0 Unknown, 0 Unchecked, 1.4s Time] [2025-01-09 09:49:20,197 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 13323 states. [2025-01-09 09:49:20,913 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 13323 to 4685. [2025-01-09 09:49:20,927 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 4685 states, 3844 states have (on average 1.5832466181061395) internal successors, (6086), 3852 states have internal predecessors, (6086), 762 states have call successors, (762), 78 states have call predecessors, (762), 78 states have return successors, (762), 754 states have call predecessors, (762), 762 states have call successors, (762) [2025-01-09 09:49:20,945 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4685 states to 4685 states and 7610 transitions. [2025-01-09 09:49:20,956 INFO L78 Accepts]: Start accepts. Automaton has 4685 states and 7610 transitions. Word has length 380 [2025-01-09 09:49:20,957 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-01-09 09:49:20,957 INFO L471 AbstractCegarLoop]: Abstraction has 4685 states and 7610 transitions. [2025-01-09 09:49:20,957 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 7 states, 7 states have (on average 13.285714285714286) internal successors, (93), 7 states have internal predecessors, (93), 1 states have call successors, (58), 1 states have call predecessors, (58), 1 states have return successors, (58), 1 states have call predecessors, (58), 1 states have call successors, (58) [2025-01-09 09:49:20,957 INFO L276 IsEmpty]: Start isEmpty. Operand 4685 states and 7610 transitions. [2025-01-09 09:49:20,964 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 381 [2025-01-09 09:49:20,964 INFO L210 NwaCegarLoop]: Found error trace [2025-01-09 09:49:20,964 INFO L218 NwaCegarLoop]: trace histogram [58, 58, 58, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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-09 09:49:20,965 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable9 [2025-01-09 09:49:20,965 INFO L396 AbstractCegarLoop]: === Iteration 11 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-01-09 09:49:20,965 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-01-09 09:49:20,965 INFO L85 PathProgramCache]: Analyzing trace with hash -1882960520, now seen corresponding path program 1 times [2025-01-09 09:49:20,965 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-01-09 09:49:20,965 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1963175090] [2025-01-09 09:49:20,966 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-01-09 09:49:20,966 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-01-09 09:49:21,015 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 380 statements into 1 equivalence classes. [2025-01-09 09:49:21,032 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 380 of 380 statements. [2025-01-09 09:49:21,033 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-01-09 09:49:21,033 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-01-09 09:49:21,130 INFO L134 CoverageAnalysis]: Checked inductivity of 6612 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 6612 trivial. 0 not checked. [2025-01-09 09:49:21,130 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-01-09 09:49:21,130 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1963175090] [2025-01-09 09:49:21,130 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1963175090] provided 1 perfect and 0 imperfect interpolant sequences [2025-01-09 09:49:21,130 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-01-09 09:49:21,130 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2025-01-09 09:49:21,130 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [186365831] [2025-01-09 09:49:21,131 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-01-09 09:49:21,131 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2025-01-09 09:49:21,131 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-01-09 09:49:21,132 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2025-01-09 09:49:21,132 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-01-09 09:49:21,132 INFO L87 Difference]: Start difference. First operand 4685 states and 7610 transitions. Second operand has 3 states, 3 states have (on average 31.0) internal successors, (93), 3 states have internal predecessors, (93), 1 states have call successors, (58), 1 states have call predecessors, (58), 1 states have return successors, (58), 1 states have call predecessors, (58), 1 states have call successors, (58) [2025-01-09 09:49:21,765 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-01-09 09:49:21,766 INFO L93 Difference]: Finished difference Result 12305 states and 19856 transitions. [2025-01-09 09:49:21,766 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2025-01-09 09:49:21,766 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 31.0) internal successors, (93), 3 states have internal predecessors, (93), 1 states have call successors, (58), 1 states have call predecessors, (58), 1 states have return successors, (58), 1 states have call predecessors, (58), 1 states have call successors, (58) Word has length 380 [2025-01-09 09:49:21,767 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-01-09 09:49:21,802 INFO L225 Difference]: With dead ends: 12305 [2025-01-09 09:49:21,802 INFO L226 Difference]: Without dead ends: 8439 [2025-01-09 09:49:21,817 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-09 09:49:21,818 INFO L435 NwaCegarLoop]: 427 mSDtfsCounter, 219 mSDsluCounter, 333 mSDsCounter, 0 mSdLazyCounter, 15 mSolverCounterSat, 1 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 219 SdHoareTripleChecker+Valid, 760 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-09 09:49:21,818 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [219 Valid, 760 Invalid, 16 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [1 Valid, 15 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2025-01-09 09:49:21,827 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 8439 states. [2025-01-09 09:49:22,913 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 8439 to 8437. [2025-01-09 09:49:22,943 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 8437 states, 6820 states have (on average 1.5621700879765397) internal successors, (10654), 6836 states have internal predecessors, (10654), 1466 states have call successors, (1466), 150 states have call predecessors, (1466), 150 states have return successors, (1466), 1450 states have call predecessors, (1466), 1466 states have call successors, (1466) [2025-01-09 09:49:22,972 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 8437 states to 8437 states and 13586 transitions. [2025-01-09 09:49:22,980 INFO L78 Accepts]: Start accepts. Automaton has 8437 states and 13586 transitions. Word has length 380 [2025-01-09 09:49:22,981 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-01-09 09:49:22,981 INFO L471 AbstractCegarLoop]: Abstraction has 8437 states and 13586 transitions. [2025-01-09 09:49:22,981 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 31.0) internal successors, (93), 3 states have internal predecessors, (93), 1 states have call successors, (58), 1 states have call predecessors, (58), 1 states have return successors, (58), 1 states have call predecessors, (58), 1 states have call successors, (58) [2025-01-09 09:49:22,981 INFO L276 IsEmpty]: Start isEmpty. Operand 8437 states and 13586 transitions. [2025-01-09 09:49:22,986 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 381 [2025-01-09 09:49:22,986 INFO L210 NwaCegarLoop]: Found error trace [2025-01-09 09:49:22,986 INFO L218 NwaCegarLoop]: trace histogram [58, 58, 58, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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-09 09:49:22,986 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable10 [2025-01-09 09:49:22,987 INFO L396 AbstractCegarLoop]: === Iteration 12 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-01-09 09:49:22,987 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-01-09 09:49:22,987 INFO L85 PathProgramCache]: Analyzing trace with hash -656287692, now seen corresponding path program 1 times [2025-01-09 09:49:22,987 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-01-09 09:49:22,987 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1846129034] [2025-01-09 09:49:22,988 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-01-09 09:49:22,988 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-01-09 09:49:23,012 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 380 statements into 1 equivalence classes. [2025-01-09 09:49:23,054 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 380 of 380 statements. [2025-01-09 09:49:23,055 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-01-09 09:49:23,055 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-01-09 09:49:24,674 INFO L134 CoverageAnalysis]: Checked inductivity of 6612 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 6612 trivial. 0 not checked. [2025-01-09 09:49:24,674 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-01-09 09:49:24,674 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1846129034] [2025-01-09 09:49:24,675 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1846129034] provided 1 perfect and 0 imperfect interpolant sequences [2025-01-09 09:49:24,675 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-01-09 09:49:24,675 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2025-01-09 09:49:24,675 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1975980799] [2025-01-09 09:49:24,675 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-01-09 09:49:24,676 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2025-01-09 09:49:24,676 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-01-09 09:49:24,676 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2025-01-09 09:49:24,676 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=10, Invalid=10, Unknown=0, NotChecked=0, Total=20 [2025-01-09 09:49:24,677 INFO L87 Difference]: Start difference. First operand 8437 states and 13586 transitions. Second operand has 5 states, 5 states have (on average 18.6) internal successors, (93), 5 states have internal predecessors, (93), 1 states have call successors, (58), 1 states have call predecessors, (58), 1 states have return successors, (58), 1 states have call predecessors, (58), 1 states have call successors, (58) [2025-01-09 09:49:25,919 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-01-09 09:49:25,919 INFO L93 Difference]: Finished difference Result 19262 states and 30996 transitions. [2025-01-09 09:49:25,919 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2025-01-09 09:49:25,920 INFO L78 Accepts]: Start accepts. Automaton has has 5 states, 5 states have (on average 18.6) internal successors, (93), 5 states have internal predecessors, (93), 1 states have call successors, (58), 1 states have call predecessors, (58), 1 states have return successors, (58), 1 states have call predecessors, (58), 1 states have call successors, (58) Word has length 380 [2025-01-09 09:49:25,921 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-01-09 09:49:25,973 INFO L225 Difference]: With dead ends: 19262 [2025-01-09 09:49:25,973 INFO L226 Difference]: Without dead ends: 12054 [2025-01-09 09:49:25,995 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 7 GetRequests, 4 SyntacticMatches, 0 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=10, Invalid=10, Unknown=0, NotChecked=0, Total=20 [2025-01-09 09:49:25,996 INFO L435 NwaCegarLoop]: 531 mSDtfsCounter, 641 mSDsluCounter, 574 mSDsCounter, 0 mSdLazyCounter, 304 mSolverCounterSat, 1 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.4s Time, 0 mProtectedPredicate, 0 mProtectedAction, 641 SdHoareTripleChecker+Valid, 1105 SdHoareTripleChecker+Invalid, 305 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 1 IncrementalHoareTripleChecker+Valid, 304 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.5s IncrementalHoareTripleChecker+Time [2025-01-09 09:49:25,996 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [641 Valid, 1105 Invalid, 305 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [1 Valid, 304 Invalid, 0 Unknown, 0 Unchecked, 0.5s Time] [2025-01-09 09:49:26,007 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 12054 states. [2025-01-09 09:49:27,110 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 12054 to 8605. [2025-01-09 09:49:27,125 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 8605 states, 6988 states have (on average 1.5645392100744133) internal successors, (10933), 7004 states have internal predecessors, (10933), 1466 states have call successors, (1466), 150 states have call predecessors, (1466), 150 states have return successors, (1466), 1450 states have call predecessors, (1466), 1466 states have call successors, (1466) [2025-01-09 09:49:27,145 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 8605 states to 8605 states and 13865 transitions. [2025-01-09 09:49:27,154 INFO L78 Accepts]: Start accepts. Automaton has 8605 states and 13865 transitions. Word has length 380 [2025-01-09 09:49:27,155 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-01-09 09:49:27,155 INFO L471 AbstractCegarLoop]: Abstraction has 8605 states and 13865 transitions. [2025-01-09 09:49:27,155 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 18.6) internal successors, (93), 5 states have internal predecessors, (93), 1 states have call successors, (58), 1 states have call predecessors, (58), 1 states have return successors, (58), 1 states have call predecessors, (58), 1 states have call successors, (58) [2025-01-09 09:49:27,155 INFO L276 IsEmpty]: Start isEmpty. Operand 8605 states and 13865 transitions. [2025-01-09 09:49:27,160 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 382 [2025-01-09 09:49:27,160 INFO L210 NwaCegarLoop]: Found error trace [2025-01-09 09:49:27,160 INFO L218 NwaCegarLoop]: trace histogram [58, 58, 58, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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-09 09:49:27,161 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable11 [2025-01-09 09:49:27,161 INFO L396 AbstractCegarLoop]: === Iteration 13 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-01-09 09:49:27,161 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-01-09 09:49:27,161 INFO L85 PathProgramCache]: Analyzing trace with hash -1889710646, now seen corresponding path program 1 times [2025-01-09 09:49:27,161 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-01-09 09:49:27,162 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [751591702] [2025-01-09 09:49:27,162 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-01-09 09:49:27,162 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-01-09 09:49:27,184 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 381 statements into 1 equivalence classes. [2025-01-09 09:49:27,349 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 381 of 381 statements. [2025-01-09 09:49:27,351 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-01-09 09:49:27,352 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unknown [2025-01-09 09:49:27,356 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleZ3 [215878634] [2025-01-09 09:49:27,357 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-01-09 09:49:27,357 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-01-09 09:49:27,357 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 [2025-01-09 09:49:27,360 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-09 09:49:27,362 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-09 09:49:27,495 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 381 statements into 1 equivalence classes. [2025-01-09 09:49:27,652 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 381 of 381 statements. [2025-01-09 09:49:27,652 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-01-09 09:49:27,652 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-01-09 09:49:27,661 INFO L256 TraceCheckSpWp]: Trace formula consists of 862 conjuncts, 22 conjuncts are in the unsatisfiable core [2025-01-09 09:49:27,668 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-01-09 09:49:28,605 INFO L134 CoverageAnalysis]: Checked inductivity of 6612 backedges. 4247 proven. 126 refuted. 0 times theorem prover too weak. 2239 trivial. 0 not checked. [2025-01-09 09:49:28,605 INFO L312 TraceCheckSpWp]: Computing backward predicates... [2025-01-09 09:49:30,329 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-01-09 09:49:30,329 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [751591702] [2025-01-09 09:49:30,330 WARN L311 FreeRefinementEngine]: Interpolation failed due to KNOWN_IGNORE: SMT_SOLVER_CANNOT_INTERPOLATE_INPUT [2025-01-09 09:49:30,330 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [215878634] [2025-01-09 09:49:30,330 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [215878634] provided 0 perfect and 1 imperfect interpolant sequences [2025-01-09 09:49:30,330 INFO L185 FreeRefinementEngine]: Found 0 perfect and 1 imperfect interpolant sequences. [2025-01-09 09:49:30,330 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [14] total 14 [2025-01-09 09:49:30,331 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1492222635] [2025-01-09 09:49:30,331 INFO L85 oduleStraightlineAll]: Using 1 imperfect interpolants to construct interpolant automaton [2025-01-09 09:49:30,331 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 14 states [2025-01-09 09:49:30,331 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-01-09 09:49:30,332 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 14 interpolants. [2025-01-09 09:49:30,332 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=109, Invalid=443, Unknown=0, NotChecked=0, Total=552 [2025-01-09 09:49:30,333 INFO L87 Difference]: Start difference. First operand 8605 states and 13865 transitions. Second operand has 14 states, 14 states have (on average 7.571428571428571) internal successors, (106), 14 states have internal predecessors, (106), 3 states have call successors, (58), 3 states have call predecessors, (58), 5 states have return successors, (58), 3 states have call predecessors, (58), 3 states have call successors, (58) [2025-01-09 09:49:34,435 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-01-09 09:49:34,435 INFO L93 Difference]: Finished difference Result 15787 states and 25059 transitions. [2025-01-09 09:49:34,436 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 50 states. [2025-01-09 09:49:34,436 INFO L78 Accepts]: Start accepts. Automaton has has 14 states, 14 states have (on average 7.571428571428571) internal successors, (106), 14 states have internal predecessors, (106), 3 states have call successors, (58), 3 states have call predecessors, (58), 5 states have return successors, (58), 3 states have call predecessors, (58), 3 states have call successors, (58) Word has length 381 [2025-01-09 09:49:34,436 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-01-09 09:49:34,496 INFO L225 Difference]: With dead ends: 15787 [2025-01-09 09:49:34,496 INFO L226 Difference]: Without dead ends: 13706 [2025-01-09 09:49:34,509 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 477 GetRequests, 418 SyntacticMatches, 0 SemanticMatches, 59 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 884 ImplicationChecksByTransitivity, 1.6s TimeCoverageRelationStatistics Valid=841, Invalid=2819, Unknown=0, NotChecked=0, Total=3660 [2025-01-09 09:49:34,510 INFO L435 NwaCegarLoop]: 490 mSDtfsCounter, 938 mSDsluCounter, 2076 mSDsCounter, 0 mSdLazyCounter, 3104 mSolverCounterSat, 225 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 1.8s Time, 0 mProtectedPredicate, 0 mProtectedAction, 1046 SdHoareTripleChecker+Valid, 2566 SdHoareTripleChecker+Invalid, 3329 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 225 IncrementalHoareTripleChecker+Valid, 3104 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 2.1s IncrementalHoareTripleChecker+Time [2025-01-09 09:49:34,510 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [1046 Valid, 2566 Invalid, 3329 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [225 Valid, 3104 Invalid, 0 Unknown, 0 Unchecked, 2.1s Time] [2025-01-09 09:49:34,522 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 13706 states. [2025-01-09 09:49:35,529 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 13706 to 9503. [2025-01-09 09:49:35,539 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 9503 states, 7694 states have (on average 1.5544580192357682) internal successors, (11960), 7714 states have internal predecessors, (11960), 1634 states have call successors, (1634), 174 states have call predecessors, (1634), 174 states have return successors, (1634), 1614 states have call predecessors, (1634), 1634 states have call successors, (1634) [2025-01-09 09:49:35,562 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 9503 states to 9503 states and 15228 transitions. [2025-01-09 09:49:35,573 INFO L78 Accepts]: Start accepts. Automaton has 9503 states and 15228 transitions. Word has length 381 [2025-01-09 09:49:35,573 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-01-09 09:49:35,574 INFO L471 AbstractCegarLoop]: Abstraction has 9503 states and 15228 transitions. [2025-01-09 09:49:35,574 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 14 states, 14 states have (on average 7.571428571428571) internal successors, (106), 14 states have internal predecessors, (106), 3 states have call successors, (58), 3 states have call predecessors, (58), 5 states have return successors, (58), 3 states have call predecessors, (58), 3 states have call successors, (58) [2025-01-09 09:49:35,574 INFO L276 IsEmpty]: Start isEmpty. Operand 9503 states and 15228 transitions. [2025-01-09 09:49:35,579 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 382 [2025-01-09 09:49:35,579 INFO L210 NwaCegarLoop]: Found error trace [2025-01-09 09:49:35,579 INFO L218 NwaCegarLoop]: trace histogram [58, 58, 58, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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-09 09:49:35,590 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-09 09:49:35,784 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,SelfDestructingSolverStorable12 [2025-01-09 09:49:35,784 INFO L396 AbstractCegarLoop]: === Iteration 14 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-01-09 09:49:35,785 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-01-09 09:49:35,785 INFO L85 PathProgramCache]: Analyzing trace with hash -278774435, now seen corresponding path program 1 times [2025-01-09 09:49:35,785 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-01-09 09:49:35,785 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [662580170] [2025-01-09 09:49:35,786 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-01-09 09:49:35,786 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-01-09 09:49:35,806 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 381 statements into 1 equivalence classes. [2025-01-09 09:49:35,918 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 381 of 381 statements. [2025-01-09 09:49:35,919 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-01-09 09:49:35,919 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-01-09 09:49:36,586 INFO L134 CoverageAnalysis]: Checked inductivity of 6612 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 6612 trivial. 0 not checked. [2025-01-09 09:49:36,586 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-01-09 09:49:36,586 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [662580170] [2025-01-09 09:49:36,586 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [662580170] provided 1 perfect and 0 imperfect interpolant sequences [2025-01-09 09:49:36,587 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-01-09 09:49:36,587 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2025-01-09 09:49:36,587 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [748529919] [2025-01-09 09:49:36,587 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-01-09 09:49:36,588 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2025-01-09 09:49:36,588 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-01-09 09:49:36,588 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2025-01-09 09:49:36,588 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=12, Invalid=18, Unknown=0, NotChecked=0, Total=30 [2025-01-09 09:49:36,589 INFO L87 Difference]: Start difference. First operand 9503 states and 15228 transitions. Second operand has 6 states, 6 states have (on average 15.666666666666666) internal successors, (94), 6 states have internal predecessors, (94), 1 states have call successors, (58), 1 states have call predecessors, (58), 1 states have return successors, (58), 1 states have call predecessors, (58), 1 states have call successors, (58) [2025-01-09 09:49:37,980 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-01-09 09:49:37,980 INFO L93 Difference]: Finished difference Result 21464 states and 34318 transitions. [2025-01-09 09:49:37,981 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2025-01-09 09:49:37,981 INFO L78 Accepts]: Start accepts. Automaton has has 6 states, 6 states have (on average 15.666666666666666) internal successors, (94), 6 states have internal predecessors, (94), 1 states have call successors, (58), 1 states have call predecessors, (58), 1 states have return successors, (58), 1 states have call predecessors, (58), 1 states have call successors, (58) Word has length 381 [2025-01-09 09:49:37,981 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-01-09 09:49:38,033 INFO L225 Difference]: With dead ends: 21464 [2025-01-09 09:49:38,034 INFO L226 Difference]: Without dead ends: 13210 [2025-01-09 09:49:38,057 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 10 GetRequests, 5 SyntacticMatches, 0 SemanticMatches, 5 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 2 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=18, Invalid=24, Unknown=0, NotChecked=0, Total=42 [2025-01-09 09:49:38,057 INFO L435 NwaCegarLoop]: 437 mSDtfsCounter, 397 mSDsluCounter, 1258 mSDsCounter, 0 mSdLazyCounter, 136 mSolverCounterSat, 176 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.3s Time, 0 mProtectedPredicate, 0 mProtectedAction, 397 SdHoareTripleChecker+Valid, 1695 SdHoareTripleChecker+Invalid, 312 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 176 IncrementalHoareTripleChecker+Valid, 136 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.4s IncrementalHoareTripleChecker+Time [2025-01-09 09:49:38,058 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [397 Valid, 1695 Invalid, 312 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [176 Valid, 136 Invalid, 0 Unknown, 0 Unchecked, 0.4s Time] [2025-01-09 09:49:38,068 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 13210 states. [2025-01-09 09:49:39,964 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 13210 to 13208. [2025-01-09 09:49:39,976 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 13208 states, 10623 states have (on average 1.548150240045185) internal successors, (16446), 10651 states have internal predecessors, (16446), 2338 states have call successors, (2338), 246 states have call predecessors, (2338), 246 states have return successors, (2338), 2310 states have call predecessors, (2338), 2338 states have call successors, (2338) [2025-01-09 09:49:40,008 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 13208 states to 13208 states and 21122 transitions. [2025-01-09 09:49:40,021 INFO L78 Accepts]: Start accepts. Automaton has 13208 states and 21122 transitions. Word has length 381 [2025-01-09 09:49:40,022 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-01-09 09:49:40,022 INFO L471 AbstractCegarLoop]: Abstraction has 13208 states and 21122 transitions. [2025-01-09 09:49:40,022 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 6 states have (on average 15.666666666666666) internal successors, (94), 6 states have internal predecessors, (94), 1 states have call successors, (58), 1 states have call predecessors, (58), 1 states have return successors, (58), 1 states have call predecessors, (58), 1 states have call successors, (58) [2025-01-09 09:49:40,022 INFO L276 IsEmpty]: Start isEmpty. Operand 13208 states and 21122 transitions. [2025-01-09 09:49:40,028 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 382 [2025-01-09 09:49:40,028 INFO L210 NwaCegarLoop]: Found error trace [2025-01-09 09:49:40,028 INFO L218 NwaCegarLoop]: trace histogram [58, 58, 58, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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-09 09:49:40,028 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable13 [2025-01-09 09:49:40,029 INFO L396 AbstractCegarLoop]: === Iteration 15 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-01-09 09:49:40,029 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-01-09 09:49:40,029 INFO L85 PathProgramCache]: Analyzing trace with hash 2052168268, now seen corresponding path program 1 times [2025-01-09 09:49:40,029 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-01-09 09:49:40,029 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1134135408] [2025-01-09 09:49:40,030 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-01-09 09:49:40,030 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-01-09 09:49:40,048 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 381 statements into 1 equivalence classes. [2025-01-09 09:49:40,184 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 381 of 381 statements. [2025-01-09 09:49:40,184 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-01-09 09:49:40,184 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unknown [2025-01-09 09:49:40,188 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleZ3 [150342308] [2025-01-09 09:49:40,188 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-01-09 09:49:40,188 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-01-09 09:49:40,189 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 [2025-01-09 09:49:40,191 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-09 09:49:40,193 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-09 09:49:40,330 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 381 statements into 1 equivalence classes. [2025-01-09 09:49:40,491 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 381 of 381 statements. [2025-01-09 09:49:40,491 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-01-09 09:49:40,491 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-01-09 09:49:40,496 INFO L256 TraceCheckSpWp]: Trace formula consists of 860 conjuncts, 17 conjuncts are in the unsatisfiable core [2025-01-09 09:49:40,506 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-01-09 09:49:41,196 INFO L134 CoverageAnalysis]: Checked inductivity of 6612 backedges. 3351 proven. 90 refuted. 0 times theorem prover too weak. 3171 trivial. 0 not checked. [2025-01-09 09:49:41,196 INFO L312 TraceCheckSpWp]: Computing backward predicates... [2025-01-09 09:49:41,962 INFO L134 CoverageAnalysis]: Checked inductivity of 6612 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 6612 trivial. 0 not checked. [2025-01-09 09:49:41,962 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-01-09 09:49:41,963 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1134135408] [2025-01-09 09:49:41,963 WARN L311 FreeRefinementEngine]: Interpolation failed due to KNOWN_IGNORE: SMT_SOLVER_CANNOT_INTERPOLATE_INPUT [2025-01-09 09:49:41,963 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [150342308] [2025-01-09 09:49:41,963 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [150342308] provided 1 perfect and 1 imperfect interpolant sequences [2025-01-09 09:49:41,963 INFO L185 FreeRefinementEngine]: Found 1 perfect and 1 imperfect interpolant sequences. [2025-01-09 09:49:41,963 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [10] imperfect sequences [11] total 19 [2025-01-09 09:49:41,963 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [768223462] [2025-01-09 09:49:41,963 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-01-09 09:49:41,963 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 10 states [2025-01-09 09:49:41,963 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-01-09 09:49:41,964 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 10 interpolants. [2025-01-09 09:49:41,964 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=66, Invalid=276, Unknown=0, NotChecked=0, Total=342 [2025-01-09 09:49:41,965 INFO L87 Difference]: Start difference. First operand 13208 states and 21122 transitions. Second operand has 10 states, 10 states have (on average 9.4) internal successors, (94), 10 states have internal predecessors, (94), 1 states have call successors, (58), 1 states have call predecessors, (58), 1 states have return successors, (58), 1 states have call predecessors, (58), 1 states have call successors, (58) [2025-01-09 09:49:52,890 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-01-09 09:49:52,890 INFO L93 Difference]: Finished difference Result 61785 states and 97817 transitions. [2025-01-09 09:49:52,891 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 20 states. [2025-01-09 09:49:52,891 INFO L78 Accepts]: Start accepts. Automaton has has 10 states, 10 states have (on average 9.4) internal successors, (94), 10 states have internal predecessors, (94), 1 states have call successors, (58), 1 states have call predecessors, (58), 1 states have return successors, (58), 1 states have call predecessors, (58), 1 states have call successors, (58) Word has length 381 [2025-01-09 09:49:52,891 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-01-09 09:49:53,089 INFO L225 Difference]: With dead ends: 61785 [2025-01-09 09:49:53,089 INFO L226 Difference]: Without dead ends: 53595 [2025-01-09 09:49:53,129 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 779 GetRequests, 750 SyntacticMatches, 0 SemanticMatches, 29 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 181 ImplicationChecksByTransitivity, 0.9s TimeCoverageRelationStatistics Valid=193, Invalid=737, Unknown=0, NotChecked=0, Total=930 [2025-01-09 09:49:53,130 INFO L435 NwaCegarLoop]: 936 mSDtfsCounter, 2307 mSDsluCounter, 2675 mSDsCounter, 0 mSdLazyCounter, 2113 mSolverCounterSat, 779 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 2.9s Time, 0 mProtectedPredicate, 0 mProtectedAction, 2307 SdHoareTripleChecker+Valid, 3611 SdHoareTripleChecker+Invalid, 2892 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 779 IncrementalHoareTripleChecker+Valid, 2113 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 3.2s IncrementalHoareTripleChecker+Time [2025-01-09 09:49:53,130 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [2307 Valid, 3611 Invalid, 2892 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [779 Valid, 2113 Invalid, 0 Unknown, 0 Unchecked, 3.2s Time] [2025-01-09 09:49:53,166 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 53595 states. [2025-01-09 09:49:56,867 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 53595 to 21621. [2025-01-09 09:49:56,887 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 21621 states, 17132 states have (on average 1.5412094326406724) internal successors, (26404), 17208 states have internal predecessors, (26404), 4058 states have call successors, (4058), 430 states have call predecessors, (4058), 430 states have return successors, (4058), 3982 states have call predecessors, (4058), 4058 states have call successors, (4058) [2025-01-09 09:49:56,947 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 21621 states to 21621 states and 34520 transitions. [2025-01-09 09:49:56,986 INFO L78 Accepts]: Start accepts. Automaton has 21621 states and 34520 transitions. Word has length 381 [2025-01-09 09:49:56,986 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-01-09 09:49:56,987 INFO L471 AbstractCegarLoop]: Abstraction has 21621 states and 34520 transitions. [2025-01-09 09:49:56,987 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 10 states, 10 states have (on average 9.4) internal successors, (94), 10 states have internal predecessors, (94), 1 states have call successors, (58), 1 states have call predecessors, (58), 1 states have return successors, (58), 1 states have call predecessors, (58), 1 states have call successors, (58) [2025-01-09 09:49:56,987 INFO L276 IsEmpty]: Start isEmpty. Operand 21621 states and 34520 transitions. [2025-01-09 09:49:56,996 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 383 [2025-01-09 09:49:56,996 INFO L210 NwaCegarLoop]: Found error trace [2025-01-09 09:49:56,997 INFO L218 NwaCegarLoop]: trace histogram [58, 58, 58, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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-09 09:49:57,007 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (6)] Ended with exit code 0 [2025-01-09 09:49:57,200 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,SelfDestructingSolverStorable14 [2025-01-09 09:49:57,201 INFO L396 AbstractCegarLoop]: === Iteration 16 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-01-09 09:49:57,202 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-01-09 09:49:57,202 INFO L85 PathProgramCache]: Analyzing trace with hash -1796160422, now seen corresponding path program 1 times [2025-01-09 09:49:57,202 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-01-09 09:49:57,202 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2024650660] [2025-01-09 09:49:57,202 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-01-09 09:49:57,202 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-01-09 09:49:57,227 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 382 statements into 1 equivalence classes. [2025-01-09 09:49:57,411 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 382 of 382 statements. [2025-01-09 09:49:57,413 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-01-09 09:49:57,413 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unknown [2025-01-09 09:49:57,417 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleZ3 [1145162172] [2025-01-09 09:49:57,417 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-01-09 09:49:57,417 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-01-09 09:49:57,417 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 [2025-01-09 09:49:57,419 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-09 09:49:57,422 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-09 09:49:57,586 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 382 statements into 1 equivalence classes. [2025-01-09 09:49:57,699 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 382 of 382 statements. [2025-01-09 09:49:57,699 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-01-09 09:49:57,699 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-01-09 09:49:57,703 INFO L256 TraceCheckSpWp]: Trace formula consists of 863 conjuncts, 36 conjuncts are in the unsatisfiable core [2025-01-09 09:49:57,711 INFO L279 TraceCheckSpWp]: Computing forward predicates...