./Ultimate.py --spec ../sv-benchmarks/c/properties/unreach-call.prp --file ../sv-benchmarks/c/hardness-nfm22/hardness_fillercode_fillercodestructure_filler-pr-co_file-3.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_fillercodestructure_filler-pr-co_file-3.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 81f9c885cba2dee1faa6ea50c6c887a8afbb04e68b15a3a5c9caa87415ef3349 --- Real Ultimate output --- This is Ultimate 0.3.0-?-551b009-m [2025-01-09 11:27:11,739 INFO L188 SettingsManager]: Resetting all preferences to default values... [2025-01-09 11:27:11,819 INFO L114 SettingsManager]: Loading settings from /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/config/svcomp-Reach-32bit-Automizer_Default.epf [2025-01-09 11:27:11,828 WARN L101 SettingsManager]: Preference file contains the following unknown settings: [2025-01-09 11:27:11,828 WARN L103 SettingsManager]: * de.uni_freiburg.informatik.ultimate.core.Log level for class [2025-01-09 11:27:11,849 INFO L130 SettingsManager]: Preferences different from defaults after loading the file: [2025-01-09 11:27:11,850 INFO L151 SettingsManager]: Preferences of UltimateCore differ from their defaults: [2025-01-09 11:27:11,851 INFO L153 SettingsManager]: * Log level for class=de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher=ERROR; [2025-01-09 11:27:11,851 INFO L151 SettingsManager]: Preferences of Boogie Preprocessor differ from their defaults: [2025-01-09 11:27:11,851 INFO L153 SettingsManager]: * Use memory slicer=true [2025-01-09 11:27:11,852 INFO L151 SettingsManager]: Preferences of Boogie Procedure Inliner differ from their defaults: [2025-01-09 11:27:11,853 INFO L153 SettingsManager]: * Ignore calls to procedures called more than once=ONLY_FOR_SEQUENTIAL_PROGRAMS [2025-01-09 11:27:11,853 INFO L151 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2025-01-09 11:27:11,853 INFO L153 SettingsManager]: * Create parallel compositions if possible=false [2025-01-09 11:27:11,853 INFO L153 SettingsManager]: * Use SBE=true [2025-01-09 11:27:11,853 INFO L151 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2025-01-09 11:27:11,854 INFO L153 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2025-01-09 11:27:11,854 INFO L153 SettingsManager]: * sizeof long=4 [2025-01-09 11:27:11,854 INFO L153 SettingsManager]: * Overapproximate operations on floating types=true [2025-01-09 11:27:11,854 INFO L153 SettingsManager]: * sizeof POINTER=4 [2025-01-09 11:27:11,854 INFO L153 SettingsManager]: * Check division by zero=IGNORE [2025-01-09 11:27:11,854 INFO L153 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2025-01-09 11:27:11,855 INFO L153 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2025-01-09 11:27:11,855 INFO L153 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2025-01-09 11:27:11,855 INFO L153 SettingsManager]: * sizeof long double=12 [2025-01-09 11:27:11,855 INFO L153 SettingsManager]: * Check if freed pointer was valid=false [2025-01-09 11:27:11,855 INFO L153 SettingsManager]: * Behaviour of calls to undefined functions=OVERAPPROXIMATE_BEHAVIOUR [2025-01-09 11:27:11,855 INFO L153 SettingsManager]: * Use constant arrays=true [2025-01-09 11:27:11,855 INFO L151 SettingsManager]: Preferences of IcfgBuilder differ from their defaults: [2025-01-09 11:27:11,855 INFO L153 SettingsManager]: * Size of a code block=SequenceOfStatements [2025-01-09 11:27:11,856 INFO L153 SettingsManager]: * Only consider context switches at boundaries of atomic blocks=true [2025-01-09 11:27:11,856 INFO L153 SettingsManager]: * SMT solver=External_DefaultMode [2025-01-09 11:27:11,856 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2025-01-09 11:27:11,856 INFO L151 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2025-01-09 11:27:11,857 INFO L153 SettingsManager]: * Size of a code block=SequenceOfStatements [2025-01-09 11:27:11,857 INFO L153 SettingsManager]: * Only consider context switches at boundaries of atomic blocks=true [2025-01-09 11:27:11,857 INFO L153 SettingsManager]: * SMT solver=External_DefaultMode [2025-01-09 11:27:11,857 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2025-01-09 11:27:11,857 INFO L151 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2025-01-09 11:27:11,857 INFO L153 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2025-01-09 11:27:11,858 INFO L153 SettingsManager]: * Compute procedure contracts=false [2025-01-09 11:27:11,858 INFO L153 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopHeads [2025-01-09 11:27:11,858 INFO L153 SettingsManager]: * Trace refinement strategy=CAMEL [2025-01-09 11:27:11,858 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2025-01-09 11:27:11,858 INFO L153 SettingsManager]: * Apply one-shot large block encoding in concurrent analysis=false [2025-01-09 11:27:11,858 INFO L153 SettingsManager]: * Automaton type used in concurrency analysis=PETRI_NET [2025-01-09 11:27:11,858 INFO L153 SettingsManager]: * Order on configurations for Petri net unfoldings=DBO [2025-01-09 11:27:11,858 INFO L153 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode [2025-01-09 11:27:11,858 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 -> 81f9c885cba2dee1faa6ea50c6c887a8afbb04e68b15a3a5c9caa87415ef3349 [2025-01-09 11:27:12,160 INFO L75 nceAwareModelManager]: Repository-Root is: /tmp [2025-01-09 11:27:12,172 INFO L261 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2025-01-09 11:27:12,174 INFO L217 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2025-01-09 11:27:12,178 INFO L270 PluginConnector]: Initializing CDTParser... [2025-01-09 11:27:12,179 INFO L274 PluginConnector]: CDTParser initialized [2025-01-09 11:27:12,181 INFO L431 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/../sv-benchmarks/c/hardness-nfm22/hardness_fillercode_fillercodestructure_filler-pr-co_file-3.i [2025-01-09 11:27:13,517 INFO L533 CDTParser]: Created temporary CDT project at /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/data/ff43fa37c/49828d37ef194d7297869b2bcf69188d/FLAG540284788 [2025-01-09 11:27:13,805 INFO L384 CDTParser]: Found 1 translation units. [2025-01-09 11:27:13,807 INFO L180 CDTParser]: Scanning /storage/repos/ultimate-jdk21/releaseScripts/default/sv-benchmarks/c/hardness-nfm22/hardness_fillercode_fillercodestructure_filler-pr-co_file-3.i [2025-01-09 11:27:13,813 INFO L427 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/data/ff43fa37c/49828d37ef194d7297869b2bcf69188d/FLAG540284788 [2025-01-09 11:27:13,824 INFO L435 CDTParser]: Successfully deleted /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/data/ff43fa37c/49828d37ef194d7297869b2bcf69188d [2025-01-09 11:27:13,826 INFO L299 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2025-01-09 11:27:13,827 INFO L133 ToolchainWalker]: Walking toolchain with 6 elements. [2025-01-09 11:27:13,828 INFO L112 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2025-01-09 11:27:13,828 INFO L270 PluginConnector]: Initializing CACSL2BoogieTranslator... [2025-01-09 11:27:13,832 INFO L274 PluginConnector]: CACSL2BoogieTranslator initialized [2025-01-09 11:27:13,832 INFO L184 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 09.01 11:27:13" (1/1) ... [2025-01-09 11:27:13,833 INFO L204 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@1f4366b7 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.01 11:27:13, skipping insertion in model container [2025-01-09 11:27:13,833 INFO L184 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 09.01 11:27:13" (1/1) ... [2025-01-09 11:27:13,850 INFO L175 MainTranslator]: Built tables and reachable declarations [2025-01-09 11:27:14,003 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_fillercodestructure_filler-pr-co_file-3.i[918,931] [2025-01-09 11:27:14,111 INFO L210 PostProcessor]: Analyzing one entry point: main [2025-01-09 11:27:14,133 INFO L200 MainTranslator]: Completed pre-run [2025-01-09 11:27:14,146 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_fillercodestructure_filler-pr-co_file-3.i[918,931] [2025-01-09 11:27:14,190 INFO L210 PostProcessor]: Analyzing one entry point: main [2025-01-09 11:27:14,213 INFO L204 MainTranslator]: Completed translation [2025-01-09 11:27:14,215 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.01 11:27:14 WrapperNode [2025-01-09 11:27:14,215 INFO L131 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2025-01-09 11:27:14,216 INFO L112 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2025-01-09 11:27:14,216 INFO L270 PluginConnector]: Initializing Boogie Procedure Inliner... [2025-01-09 11:27:14,216 INFO L274 PluginConnector]: Boogie Procedure Inliner initialized [2025-01-09 11:27:14,224 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.01 11:27:14" (1/1) ... [2025-01-09 11:27:14,241 INFO L184 PluginConnector]: Executing the observer Inliner from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.01 11:27:14" (1/1) ... [2025-01-09 11:27:14,295 INFO L138 Inliner]: procedures = 26, calls = 47, calls flagged for inlining = 8, calls inlined = 8, statements flattened = 271 [2025-01-09 11:27:14,299 INFO L131 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2025-01-09 11:27:14,299 INFO L112 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2025-01-09 11:27:14,299 INFO L270 PluginConnector]: Initializing Boogie Preprocessor... [2025-01-09 11:27:14,299 INFO L274 PluginConnector]: Boogie Preprocessor initialized [2025-01-09 11:27:14,310 INFO L184 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.01 11:27:14" (1/1) ... [2025-01-09 11:27:14,311 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.01 11:27:14" (1/1) ... [2025-01-09 11:27:14,315 INFO L184 PluginConnector]: Executing the observer MemorySlicer from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.01 11:27:14" (1/1) ... [2025-01-09 11:27:14,333 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 11:27:14,334 INFO L184 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.01 11:27:14" (1/1) ... [2025-01-09 11:27:14,334 INFO L184 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.01 11:27:14" (1/1) ... [2025-01-09 11:27:14,344 INFO L184 PluginConnector]: Executing the observer ReplaceArrayAssignments from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.01 11:27:14" (1/1) ... [2025-01-09 11:27:14,347 INFO L184 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.01 11:27:14" (1/1) ... [2025-01-09 11:27:14,355 INFO L184 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.01 11:27:14" (1/1) ... [2025-01-09 11:27:14,360 INFO L184 PluginConnector]: Executing the observer LTLStepAnnotator from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.01 11:27:14" (1/1) ... [2025-01-09 11:27:14,366 INFO L184 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.01 11:27:14" (1/1) ... [2025-01-09 11:27:14,376 INFO L131 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2025-01-09 11:27:14,377 INFO L112 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2025-01-09 11:27:14,377 INFO L270 PluginConnector]: Initializing RCFGBuilder... [2025-01-09 11:27:14,377 INFO L274 PluginConnector]: RCFGBuilder initialized [2025-01-09 11:27:14,378 INFO L184 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.01 11:27:14" (1/1) ... [2025-01-09 11:27:14,389 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2025-01-09 11:27:14,402 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 [2025-01-09 11:27:14,417 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 11:27:14,422 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 11:27:14,447 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocInit [2025-01-09 11:27:14,448 INFO L130 BoogieDeclarations]: Found specification of procedure assume_abort_if_not [2025-01-09 11:27:14,448 INFO L138 BoogieDeclarations]: Found implementation of procedure assume_abort_if_not [2025-01-09 11:27:14,448 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int#0 [2025-01-09 11:27:14,448 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2025-01-09 11:27:14,449 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2025-01-09 11:27:14,532 INFO L234 CfgBuilder]: Building ICFG [2025-01-09 11:27:14,534 INFO L260 CfgBuilder]: Building CFG for each procedure with an implementation [2025-01-09 11:27:15,141 INFO L? ?]: Removed 18 outVars from TransFormulas that were not future-live. [2025-01-09 11:27:15,141 INFO L283 CfgBuilder]: Performing block encoding [2025-01-09 11:27:15,157 INFO L307 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2025-01-09 11:27:15,158 INFO L312 CfgBuilder]: Removed 1 assume(true) statements. [2025-01-09 11:27:15,159 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 09.01 11:27:15 BoogieIcfgContainer [2025-01-09 11:27:15,159 INFO L131 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2025-01-09 11:27:15,161 INFO L112 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2025-01-09 11:27:15,162 INFO L270 PluginConnector]: Initializing TraceAbstraction... [2025-01-09 11:27:15,167 INFO L274 PluginConnector]: TraceAbstraction initialized [2025-01-09 11:27:15,167 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 09.01 11:27:13" (1/3) ... [2025-01-09 11:27:15,168 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@5b9e0123 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 09.01 11:27:15, skipping insertion in model container [2025-01-09 11:27:15,169 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.01 11:27:14" (2/3) ... [2025-01-09 11:27:15,169 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@5b9e0123 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 09.01 11:27:15, skipping insertion in model container [2025-01-09 11:27:15,169 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 09.01 11:27:15" (3/3) ... [2025-01-09 11:27:15,171 INFO L128 eAbstractionObserver]: Analyzing ICFG hardness_fillercode_fillercodestructure_filler-pr-co_file-3.i [2025-01-09 11:27:15,187 INFO L216 ceAbstractionStarter]: Automizer settings: Hoare:LoopHeads NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2025-01-09 11:27:15,189 INFO L151 ceAbstractionStarter]: Applying trace abstraction to ICFG hardness_fillercode_fillercodestructure_filler-pr-co_file-3.i that has 2 procedures, 122 locations, 1 initial locations, 1 loop locations, and 1 error locations. [2025-01-09 11:27:15,258 INFO L332 AbstractCegarLoop]: ======== Iteration 0 == of CEGAR loop == AllErrorsAtOnce ======== [2025-01-09 11:27:15,271 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;@6c8f9569, mLbeIndependenceSettings=[IndependenceType=SEMANTIC, AbstractionType=NONE, UseConditional=false, UseSemiCommutativity=true, Solver=Z3, SolverTimeout=1000ms] [2025-01-09 11:27:15,271 INFO L334 AbstractCegarLoop]: Starting to check reachability of 1 error locations. [2025-01-09 11:27:15,277 INFO L276 IsEmpty]: Start isEmpty. Operand has 122 states, 85 states have (on average 1.5058823529411764) internal successors, (128), 86 states have internal predecessors, (128), 34 states have call successors, (34), 1 states have call predecessors, (34), 1 states have return successors, (34), 34 states have call predecessors, (34), 34 states have call successors, (34) [2025-01-09 11:27:15,295 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 222 [2025-01-09 11:27:15,296 INFO L210 NwaCegarLoop]: Found error trace [2025-01-09 11:27:15,297 INFO L218 NwaCegarLoop]: trace histogram [34, 34, 34, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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 11:27:15,298 INFO L396 AbstractCegarLoop]: === Iteration 1 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-01-09 11:27:15,304 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-01-09 11:27:15,305 INFO L85 PathProgramCache]: Analyzing trace with hash 156149966, now seen corresponding path program 1 times [2025-01-09 11:27:15,313 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-01-09 11:27:15,315 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1584307542] [2025-01-09 11:27:15,315 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-01-09 11:27:15,318 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-01-09 11:27:15,450 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 221 statements into 1 equivalence classes. [2025-01-09 11:27:15,481 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 221 of 221 statements. [2025-01-09 11:27:15,481 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-01-09 11:27:15,482 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-01-09 11:27:15,711 INFO L134 CoverageAnalysis]: Checked inductivity of 2244 backedges. 0 proven. 66 refuted. 0 times theorem prover too weak. 2178 trivial. 0 not checked. [2025-01-09 11:27:15,711 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-01-09 11:27:15,712 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1584307542] [2025-01-09 11:27:15,713 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1584307542] provided 0 perfect and 1 imperfect interpolant sequences [2025-01-09 11:27:15,713 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [698001769] [2025-01-09 11:27:15,713 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-01-09 11:27:15,714 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-01-09 11:27:15,714 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 [2025-01-09 11:27:15,717 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 11:27:15,720 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 11:27:15,840 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 221 statements into 1 equivalence classes. [2025-01-09 11:27:15,977 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 221 of 221 statements. [2025-01-09 11:27:15,977 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-01-09 11:27:15,977 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-01-09 11:27:15,982 INFO L256 TraceCheckSpWp]: Trace formula consists of 497 conjuncts, 1 conjuncts are in the unsatisfiable core [2025-01-09 11:27:15,997 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-01-09 11:27:16,038 INFO L134 CoverageAnalysis]: Checked inductivity of 2244 backedges. 66 proven. 0 refuted. 0 times theorem prover too weak. 2178 trivial. 0 not checked. [2025-01-09 11:27:16,039 INFO L308 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2025-01-09 11:27:16,039 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [698001769] provided 1 perfect and 0 imperfect interpolant sequences [2025-01-09 11:27:16,040 INFO L185 FreeRefinementEngine]: Found 1 perfect and 1 imperfect interpolant sequences. [2025-01-09 11:27:16,040 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [2] total 2 [2025-01-09 11:27:16,042 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2031328375] [2025-01-09 11:27:16,043 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-01-09 11:27:16,048 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 2 states [2025-01-09 11:27:16,049 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-01-09 11:27:16,074 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 2 interpolants. [2025-01-09 11:27:16,075 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=1, Invalid=1, Unknown=0, NotChecked=0, Total=2 [2025-01-09 11:27:16,078 INFO L87 Difference]: Start difference. First operand has 122 states, 85 states have (on average 1.5058823529411764) internal successors, (128), 86 states have internal predecessors, (128), 34 states have call successors, (34), 1 states have call predecessors, (34), 1 states have return successors, (34), 34 states have call predecessors, (34), 34 states have call successors, (34) Second operand has 2 states, 2 states have (on average 28.0) internal successors, (56), 2 states have internal predecessors, (56), 2 states have call successors, (34), 2 states have call predecessors, (34), 1 states have return successors, (34), 1 states have call predecessors, (34), 2 states have call successors, (34) [2025-01-09 11:27:16,107 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-01-09 11:27:16,107 INFO L93 Difference]: Finished difference Result 238 states and 421 transitions. [2025-01-09 11:27:16,108 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 2 states. [2025-01-09 11:27:16,109 INFO L78 Accepts]: Start accepts. Automaton has has 2 states, 2 states have (on average 28.0) internal successors, (56), 2 states have internal predecessors, (56), 2 states have call successors, (34), 2 states have call predecessors, (34), 1 states have return successors, (34), 1 states have call predecessors, (34), 2 states have call successors, (34) Word has length 221 [2025-01-09 11:27:16,110 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-01-09 11:27:16,117 INFO L225 Difference]: With dead ends: 238 [2025-01-09 11:27:16,117 INFO L226 Difference]: Without dead ends: 119 [2025-01-09 11:27:16,120 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 222 GetRequests, 222 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 11:27:16,122 INFO L435 NwaCegarLoop]: 188 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, 188 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 11:27:16,123 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [0 Valid, 188 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 0 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2025-01-09 11:27:16,133 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 119 states. [2025-01-09 11:27:16,157 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 119 to 119. [2025-01-09 11:27:16,158 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 119 states, 83 states have (on average 1.4457831325301205) internal successors, (120), 83 states have internal predecessors, (120), 34 states have call successors, (34), 1 states have call predecessors, (34), 1 states have return successors, (34), 34 states have call predecessors, (34), 34 states have call successors, (34) [2025-01-09 11:27:16,168 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 119 states to 119 states and 188 transitions. [2025-01-09 11:27:16,170 INFO L78 Accepts]: Start accepts. Automaton has 119 states and 188 transitions. Word has length 221 [2025-01-09 11:27:16,172 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-01-09 11:27:16,172 INFO L471 AbstractCegarLoop]: Abstraction has 119 states and 188 transitions. [2025-01-09 11:27:16,172 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 2 states, 2 states have (on average 28.0) internal successors, (56), 2 states have internal predecessors, (56), 2 states have call successors, (34), 2 states have call predecessors, (34), 1 states have return successors, (34), 1 states have call predecessors, (34), 2 states have call successors, (34) [2025-01-09 11:27:16,173 INFO L276 IsEmpty]: Start isEmpty. Operand 119 states and 188 transitions. [2025-01-09 11:27:16,179 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 224 [2025-01-09 11:27:16,179 INFO L210 NwaCegarLoop]: Found error trace [2025-01-09 11:27:16,180 INFO L218 NwaCegarLoop]: trace histogram [34, 34, 34, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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 11:27:16,189 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 11:27:16,381 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 11:27:16,381 INFO L396 AbstractCegarLoop]: === Iteration 2 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-01-09 11:27:16,382 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-01-09 11:27:16,382 INFO L85 PathProgramCache]: Analyzing trace with hash -38119239, now seen corresponding path program 1 times [2025-01-09 11:27:16,382 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-01-09 11:27:16,382 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1845032028] [2025-01-09 11:27:16,382 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-01-09 11:27:16,382 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-01-09 11:27:16,415 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 223 statements into 1 equivalence classes. [2025-01-09 11:27:16,516 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 223 of 223 statements. [2025-01-09 11:27:16,516 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-01-09 11:27:16,516 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-01-09 11:27:17,032 INFO L134 CoverageAnalysis]: Checked inductivity of 2244 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 2244 trivial. 0 not checked. [2025-01-09 11:27:17,032 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-01-09 11:27:17,032 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1845032028] [2025-01-09 11:27:17,033 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1845032028] provided 1 perfect and 0 imperfect interpolant sequences [2025-01-09 11:27:17,033 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-01-09 11:27:17,033 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2025-01-09 11:27:17,033 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [833793814] [2025-01-09 11:27:17,033 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-01-09 11:27:17,037 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2025-01-09 11:27:17,037 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-01-09 11:27:17,038 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2025-01-09 11:27:17,038 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-01-09 11:27:17,038 INFO L87 Difference]: Start difference. First operand 119 states and 188 transitions. Second operand has 3 states, 3 states have (on average 18.666666666666668) internal successors, (56), 3 states have internal predecessors, (56), 1 states have call successors, (34), 1 states have call predecessors, (34), 1 states have return successors, (34), 1 states have call predecessors, (34), 1 states have call successors, (34) [2025-01-09 11:27:17,170 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-01-09 11:27:17,171 INFO L93 Difference]: Finished difference Result 351 states and 558 transitions. [2025-01-09 11:27:17,171 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2025-01-09 11:27:17,172 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 18.666666666666668) internal successors, (56), 3 states have internal predecessors, (56), 1 states have call successors, (34), 1 states have call predecessors, (34), 1 states have return successors, (34), 1 states have call predecessors, (34), 1 states have call successors, (34) Word has length 223 [2025-01-09 11:27:17,173 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-01-09 11:27:17,177 INFO L225 Difference]: With dead ends: 351 [2025-01-09 11:27:17,179 INFO L226 Difference]: Without dead ends: 235 [2025-01-09 11:27:17,180 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 5 GetRequests, 4 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 11:27:17,181 INFO L435 NwaCegarLoop]: 196 mSDtfsCounter, 110 mSDsluCounter, 160 mSDsCounter, 0 mSdLazyCounter, 45 mSolverCounterSat, 3 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 110 SdHoareTripleChecker+Valid, 356 SdHoareTripleChecker+Invalid, 48 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 3 IncrementalHoareTripleChecker+Valid, 45 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2025-01-09 11:27:17,182 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [110 Valid, 356 Invalid, 48 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [3 Valid, 45 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2025-01-09 11:27:17,183 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 235 states. [2025-01-09 11:27:17,241 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 235 to 233. [2025-01-09 11:27:17,242 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 233 states, 162 states have (on average 1.4320987654320987) internal successors, (232), 162 states have internal predecessors, (232), 68 states have call successors, (68), 2 states have call predecessors, (68), 2 states have return successors, (68), 68 states have call predecessors, (68), 68 states have call successors, (68) [2025-01-09 11:27:17,244 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 233 states to 233 states and 368 transitions. [2025-01-09 11:27:17,246 INFO L78 Accepts]: Start accepts. Automaton has 233 states and 368 transitions. Word has length 223 [2025-01-09 11:27:17,247 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-01-09 11:27:17,248 INFO L471 AbstractCegarLoop]: Abstraction has 233 states and 368 transitions. [2025-01-09 11:27:17,248 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 18.666666666666668) internal successors, (56), 3 states have internal predecessors, (56), 1 states have call successors, (34), 1 states have call predecessors, (34), 1 states have return successors, (34), 1 states have call predecessors, (34), 1 states have call successors, (34) [2025-01-09 11:27:17,248 INFO L276 IsEmpty]: Start isEmpty. Operand 233 states and 368 transitions. [2025-01-09 11:27:17,251 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 225 [2025-01-09 11:27:17,251 INFO L210 NwaCegarLoop]: Found error trace [2025-01-09 11:27:17,251 INFO L218 NwaCegarLoop]: trace histogram [34, 34, 34, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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 11:27:17,252 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable1 [2025-01-09 11:27:17,252 INFO L396 AbstractCegarLoop]: === Iteration 3 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-01-09 11:27:17,252 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-01-09 11:27:17,252 INFO L85 PathProgramCache]: Analyzing trace with hash 311957966, now seen corresponding path program 1 times [2025-01-09 11:27:17,252 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-01-09 11:27:17,253 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [628600567] [2025-01-09 11:27:17,253 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-01-09 11:27:17,253 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-01-09 11:27:17,275 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 224 statements into 1 equivalence classes. [2025-01-09 11:27:17,295 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 224 of 224 statements. [2025-01-09 11:27:17,296 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-01-09 11:27:17,296 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-01-09 11:27:17,392 INFO L134 CoverageAnalysis]: Checked inductivity of 2244 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 2244 trivial. 0 not checked. [2025-01-09 11:27:17,393 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-01-09 11:27:17,393 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [628600567] [2025-01-09 11:27:17,393 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [628600567] provided 1 perfect and 0 imperfect interpolant sequences [2025-01-09 11:27:17,393 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-01-09 11:27:17,393 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2025-01-09 11:27:17,393 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [866691524] [2025-01-09 11:27:17,393 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-01-09 11:27:17,394 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2025-01-09 11:27:17,394 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-01-09 11:27:17,395 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2025-01-09 11:27:17,395 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-01-09 11:27:17,395 INFO L87 Difference]: Start difference. First operand 233 states and 368 transitions. Second operand has 3 states, 3 states have (on average 19.0) internal successors, (57), 3 states have internal predecessors, (57), 1 states have call successors, (34), 1 states have call predecessors, (34), 1 states have return successors, (34), 1 states have call predecessors, (34), 1 states have call successors, (34) [2025-01-09 11:27:17,458 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-01-09 11:27:17,461 INFO L93 Difference]: Finished difference Result 573 states and 904 transitions. [2025-01-09 11:27:17,461 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2025-01-09 11:27:17,462 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 19.0) internal successors, (57), 3 states have internal predecessors, (57), 1 states have call successors, (34), 1 states have call predecessors, (34), 1 states have return successors, (34), 1 states have call predecessors, (34), 1 states have call successors, (34) Word has length 224 [2025-01-09 11:27:17,463 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-01-09 11:27:17,470 INFO L225 Difference]: With dead ends: 573 [2025-01-09 11:27:17,470 INFO L226 Difference]: Without dead ends: 343 [2025-01-09 11:27:17,471 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 11:27:17,472 INFO L435 NwaCegarLoop]: 261 mSDtfsCounter, 78 mSDsluCounter, 169 mSDsCounter, 0 mSdLazyCounter, 15 mSolverCounterSat, 6 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 78 SdHoareTripleChecker+Valid, 430 SdHoareTripleChecker+Invalid, 21 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 6 IncrementalHoareTripleChecker+Valid, 15 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2025-01-09 11:27:17,472 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [78 Valid, 430 Invalid, 21 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [6 Valid, 15 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2025-01-09 11:27:17,473 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 343 states. [2025-01-09 11:27:17,518 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 343 to 285. [2025-01-09 11:27:17,522 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 285 states, 214 states have (on average 1.485981308411215) internal successors, (318), 214 states have internal predecessors, (318), 68 states have call successors, (68), 2 states have call predecessors, (68), 2 states have return successors, (68), 68 states have call predecessors, (68), 68 states have call successors, (68) [2025-01-09 11:27:17,525 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 285 states to 285 states and 454 transitions. [2025-01-09 11:27:17,526 INFO L78 Accepts]: Start accepts. Automaton has 285 states and 454 transitions. Word has length 224 [2025-01-09 11:27:17,527 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-01-09 11:27:17,527 INFO L471 AbstractCegarLoop]: Abstraction has 285 states and 454 transitions. [2025-01-09 11:27:17,528 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 19.0) internal successors, (57), 3 states have internal predecessors, (57), 1 states have call successors, (34), 1 states have call predecessors, (34), 1 states have return successors, (34), 1 states have call predecessors, (34), 1 states have call successors, (34) [2025-01-09 11:27:17,528 INFO L276 IsEmpty]: Start isEmpty. Operand 285 states and 454 transitions. [2025-01-09 11:27:17,531 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 225 [2025-01-09 11:27:17,532 INFO L210 NwaCegarLoop]: Found error trace [2025-01-09 11:27:17,532 INFO L218 NwaCegarLoop]: trace histogram [34, 34, 34, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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 11:27:17,532 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable2 [2025-01-09 11:27:17,532 INFO L396 AbstractCegarLoop]: === Iteration 4 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-01-09 11:27:17,533 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-01-09 11:27:17,534 INFO L85 PathProgramCache]: Analyzing trace with hash -957596328, now seen corresponding path program 1 times [2025-01-09 11:27:17,534 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-01-09 11:27:17,534 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1513122024] [2025-01-09 11:27:17,534 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-01-09 11:27:17,534 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-01-09 11:27:17,554 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 224 statements into 1 equivalence classes. [2025-01-09 11:27:17,593 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 224 of 224 statements. [2025-01-09 11:27:17,594 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-01-09 11:27:17,594 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-01-09 11:27:17,717 INFO L134 CoverageAnalysis]: Checked inductivity of 2244 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 2244 trivial. 0 not checked. [2025-01-09 11:27:17,718 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-01-09 11:27:17,718 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1513122024] [2025-01-09 11:27:17,718 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1513122024] provided 1 perfect and 0 imperfect interpolant sequences [2025-01-09 11:27:17,718 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-01-09 11:27:17,718 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2025-01-09 11:27:17,719 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [161620216] [2025-01-09 11:27:17,719 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-01-09 11:27:17,720 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2025-01-09 11:27:17,720 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-01-09 11:27:17,721 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2025-01-09 11:27:17,721 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-01-09 11:27:17,721 INFO L87 Difference]: Start difference. First operand 285 states and 454 transitions. Second operand has 3 states, 3 states have (on average 19.0) internal successors, (57), 3 states have internal predecessors, (57), 1 states have call successors, (34), 1 states have call predecessors, (34), 1 states have return successors, (34), 1 states have call predecessors, (34), 1 states have call successors, (34) [2025-01-09 11:27:17,855 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-01-09 11:27:17,856 INFO L93 Difference]: Finished difference Result 829 states and 1330 transitions. [2025-01-09 11:27:17,856 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2025-01-09 11:27:17,856 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 19.0) internal successors, (57), 3 states have internal predecessors, (57), 1 states have call successors, (34), 1 states have call predecessors, (34), 1 states have return successors, (34), 1 states have call predecessors, (34), 1 states have call successors, (34) Word has length 224 [2025-01-09 11:27:17,857 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-01-09 11:27:17,861 INFO L225 Difference]: With dead ends: 829 [2025-01-09 11:27:17,861 INFO L226 Difference]: Without dead ends: 547 [2025-01-09 11:27:17,862 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 11:27:17,863 INFO L435 NwaCegarLoop]: 335 mSDtfsCounter, 165 mSDsluCounter, 153 mSDsCounter, 0 mSdLazyCounter, 52 mSolverCounterSat, 6 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 165 SdHoareTripleChecker+Valid, 488 SdHoareTripleChecker+Invalid, 58 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 6 IncrementalHoareTripleChecker+Valid, 52 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2025-01-09 11:27:17,864 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [165 Valid, 488 Invalid, 58 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [6 Valid, 52 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2025-01-09 11:27:17,865 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 547 states. [2025-01-09 11:27:17,936 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 547 to 545. [2025-01-09 11:27:17,938 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 545 states, 404 states have (on average 1.4653465346534653) internal successors, (592), 404 states have internal predecessors, (592), 136 states have call successors, (136), 4 states have call predecessors, (136), 4 states have return successors, (136), 136 states have call predecessors, (136), 136 states have call successors, (136) [2025-01-09 11:27:17,942 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 545 states to 545 states and 864 transitions. [2025-01-09 11:27:17,943 INFO L78 Accepts]: Start accepts. Automaton has 545 states and 864 transitions. Word has length 224 [2025-01-09 11:27:17,945 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-01-09 11:27:17,945 INFO L471 AbstractCegarLoop]: Abstraction has 545 states and 864 transitions. [2025-01-09 11:27:17,946 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 19.0) internal successors, (57), 3 states have internal predecessors, (57), 1 states have call successors, (34), 1 states have call predecessors, (34), 1 states have return successors, (34), 1 states have call predecessors, (34), 1 states have call successors, (34) [2025-01-09 11:27:17,946 INFO L276 IsEmpty]: Start isEmpty. Operand 545 states and 864 transitions. [2025-01-09 11:27:17,948 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 226 [2025-01-09 11:27:17,949 INFO L210 NwaCegarLoop]: Found error trace [2025-01-09 11:27:17,949 INFO L218 NwaCegarLoop]: trace histogram [34, 34, 34, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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 11:27:17,949 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable3 [2025-01-09 11:27:17,949 INFO L396 AbstractCegarLoop]: === Iteration 5 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-01-09 11:27:17,950 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-01-09 11:27:17,950 INFO L85 PathProgramCache]: Analyzing trace with hash -1324823195, now seen corresponding path program 1 times [2025-01-09 11:27:17,950 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-01-09 11:27:17,950 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [344316624] [2025-01-09 11:27:17,950 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-01-09 11:27:17,950 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-01-09 11:27:17,970 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 225 statements into 1 equivalence classes. [2025-01-09 11:27:18,017 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 225 of 225 statements. [2025-01-09 11:27:18,017 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-01-09 11:27:18,017 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-01-09 11:27:18,396 INFO L134 CoverageAnalysis]: Checked inductivity of 2244 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 2244 trivial. 0 not checked. [2025-01-09 11:27:18,396 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-01-09 11:27:18,396 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [344316624] [2025-01-09 11:27:18,396 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [344316624] provided 1 perfect and 0 imperfect interpolant sequences [2025-01-09 11:27:18,397 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-01-09 11:27:18,397 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2025-01-09 11:27:18,397 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [983546142] [2025-01-09 11:27:18,397 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-01-09 11:27:18,398 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2025-01-09 11:27:18,398 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-01-09 11:27:18,398 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2025-01-09 11:27:18,399 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=10, Invalid=20, Unknown=0, NotChecked=0, Total=30 [2025-01-09 11:27:18,399 INFO L87 Difference]: Start difference. First operand 545 states and 864 transitions. Second operand has 6 states, 6 states have (on average 9.666666666666666) internal successors, (58), 6 states have internal predecessors, (58), 1 states have call successors, (34), 1 states have call predecessors, (34), 1 states have return successors, (34), 1 states have call predecessors, (34), 1 states have call successors, (34) [2025-01-09 11:27:18,873 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-01-09 11:27:18,874 INFO L93 Difference]: Finished difference Result 1633 states and 2591 transitions. [2025-01-09 11:27:18,874 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2025-01-09 11:27:18,875 INFO L78 Accepts]: Start accepts. Automaton has has 6 states, 6 states have (on average 9.666666666666666) internal successors, (58), 6 states have internal predecessors, (58), 1 states have call successors, (34), 1 states have call predecessors, (34), 1 states have return successors, (34), 1 states have call predecessors, (34), 1 states have call successors, (34) Word has length 225 [2025-01-09 11:27:18,875 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-01-09 11:27:18,888 INFO L225 Difference]: With dead ends: 1633 [2025-01-09 11:27:18,889 INFO L226 Difference]: Without dead ends: 1091 [2025-01-09 11:27:18,893 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 8 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 6 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 3 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=20, Invalid=36, Unknown=0, NotChecked=0, Total=56 [2025-01-09 11:27:18,894 INFO L435 NwaCegarLoop]: 181 mSDtfsCounter, 124 mSDsluCounter, 538 mSDsCounter, 0 mSdLazyCounter, 235 mSolverCounterSat, 1 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.3s Time, 0 mProtectedPredicate, 0 mProtectedAction, 124 SdHoareTripleChecker+Valid, 719 SdHoareTripleChecker+Invalid, 236 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 1 IncrementalHoareTripleChecker+Valid, 235 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.3s IncrementalHoareTripleChecker+Time [2025-01-09 11:27:18,894 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [124 Valid, 719 Invalid, 236 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [1 Valid, 235 Invalid, 0 Unknown, 0 Unchecked, 0.3s Time] [2025-01-09 11:27:18,896 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1091 states. [2025-01-09 11:27:19,023 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1091 to 1083. [2025-01-09 11:27:19,029 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 1083 states, 802 states have (on average 1.458852867830424) internal successors, (1170), 802 states have internal predecessors, (1170), 272 states have call successors, (272), 8 states have call predecessors, (272), 8 states have return successors, (272), 272 states have call predecessors, (272), 272 states have call successors, (272) [2025-01-09 11:27:19,037 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1083 states to 1083 states and 1714 transitions. [2025-01-09 11:27:19,039 INFO L78 Accepts]: Start accepts. Automaton has 1083 states and 1714 transitions. Word has length 225 [2025-01-09 11:27:19,040 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-01-09 11:27:19,040 INFO L471 AbstractCegarLoop]: Abstraction has 1083 states and 1714 transitions. [2025-01-09 11:27:19,040 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 6 states have (on average 9.666666666666666) internal successors, (58), 6 states have internal predecessors, (58), 1 states have call successors, (34), 1 states have call predecessors, (34), 1 states have return successors, (34), 1 states have call predecessors, (34), 1 states have call successors, (34) [2025-01-09 11:27:19,040 INFO L276 IsEmpty]: Start isEmpty. Operand 1083 states and 1714 transitions. [2025-01-09 11:27:19,043 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 227 [2025-01-09 11:27:19,044 INFO L210 NwaCegarLoop]: Found error trace [2025-01-09 11:27:19,044 INFO L218 NwaCegarLoop]: trace histogram [34, 34, 34, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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 11:27:19,044 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable4 [2025-01-09 11:27:19,044 INFO L396 AbstractCegarLoop]: === Iteration 6 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-01-09 11:27:19,045 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-01-09 11:27:19,045 INFO L85 PathProgramCache]: Analyzing trace with hash 809642424, now seen corresponding path program 1 times [2025-01-09 11:27:19,045 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-01-09 11:27:19,045 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [808137825] [2025-01-09 11:27:19,045 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-01-09 11:27:19,045 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-01-09 11:27:19,069 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 226 statements into 1 equivalence classes. [2025-01-09 11:27:19,219 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 226 of 226 statements. [2025-01-09 11:27:19,220 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-01-09 11:27:19,220 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-01-09 11:27:19,503 INFO L134 CoverageAnalysis]: Checked inductivity of 2244 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 2244 trivial. 0 not checked. [2025-01-09 11:27:19,504 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-01-09 11:27:19,504 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [808137825] [2025-01-09 11:27:19,504 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [808137825] provided 1 perfect and 0 imperfect interpolant sequences [2025-01-09 11:27:19,505 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-01-09 11:27:19,505 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2025-01-09 11:27:19,505 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [263487986] [2025-01-09 11:27:19,505 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-01-09 11:27:19,506 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2025-01-09 11:27:19,506 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-01-09 11:27:19,507 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2025-01-09 11:27:19,507 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=6, Invalid=6, Unknown=0, NotChecked=0, Total=12 [2025-01-09 11:27:19,507 INFO L87 Difference]: Start difference. First operand 1083 states and 1714 transitions. Second operand has 4 states, 4 states have (on average 14.75) internal successors, (59), 4 states have internal predecessors, (59), 1 states have call successors, (34), 1 states have call predecessors, (34), 1 states have return successors, (34), 1 states have call predecessors, (34), 1 states have call successors, (34) [2025-01-09 11:27:19,878 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-01-09 11:27:19,879 INFO L93 Difference]: Finished difference Result 2165 states and 3426 transitions. [2025-01-09 11:27:19,879 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2025-01-09 11:27:19,880 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 4 states have (on average 14.75) internal successors, (59), 4 states have internal predecessors, (59), 1 states have call successors, (34), 1 states have call predecessors, (34), 1 states have return successors, (34), 1 states have call predecessors, (34), 1 states have call successors, (34) Word has length 226 [2025-01-09 11:27:19,881 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-01-09 11:27:19,891 INFO L225 Difference]: With dead ends: 2165 [2025-01-09 11:27:19,892 INFO L226 Difference]: Without dead ends: 1085 [2025-01-09 11:27:19,896 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 6 GetRequests, 4 SyntacticMatches, 0 SemanticMatches, 2 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=6, Invalid=6, Unknown=0, NotChecked=0, Total=12 [2025-01-09 11:27:19,897 INFO L435 NwaCegarLoop]: 291 mSDtfsCounter, 153 mSDsluCounter, 232 mSDsCounter, 0 mSdLazyCounter, 140 mSolverCounterSat, 2 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 153 SdHoareTripleChecker+Valid, 523 SdHoareTripleChecker+Invalid, 142 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 2 IncrementalHoareTripleChecker+Valid, 140 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.3s IncrementalHoareTripleChecker+Time [2025-01-09 11:27:19,898 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [153 Valid, 523 Invalid, 142 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [2 Valid, 140 Invalid, 0 Unknown, 0 Unchecked, 0.3s Time] [2025-01-09 11:27:19,900 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1085 states. [2025-01-09 11:27:19,978 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1085 to 1083. [2025-01-09 11:27:19,983 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 1083 states, 802 states have (on average 1.453865336658354) internal successors, (1166), 802 states have internal predecessors, (1166), 272 states have call successors, (272), 8 states have call predecessors, (272), 8 states have return successors, (272), 272 states have call predecessors, (272), 272 states have call successors, (272) [2025-01-09 11:27:19,992 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1083 states to 1083 states and 1710 transitions. [2025-01-09 11:27:19,996 INFO L78 Accepts]: Start accepts. Automaton has 1083 states and 1710 transitions. Word has length 226 [2025-01-09 11:27:19,997 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-01-09 11:27:19,997 INFO L471 AbstractCegarLoop]: Abstraction has 1083 states and 1710 transitions. [2025-01-09 11:27:19,998 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 14.75) internal successors, (59), 4 states have internal predecessors, (59), 1 states have call successors, (34), 1 states have call predecessors, (34), 1 states have return successors, (34), 1 states have call predecessors, (34), 1 states have call successors, (34) [2025-01-09 11:27:19,998 INFO L276 IsEmpty]: Start isEmpty. Operand 1083 states and 1710 transitions. [2025-01-09 11:27:20,000 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 228 [2025-01-09 11:27:20,001 INFO L210 NwaCegarLoop]: Found error trace [2025-01-09 11:27:20,001 INFO L218 NwaCegarLoop]: trace histogram [34, 34, 34, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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 11:27:20,001 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable5 [2025-01-09 11:27:20,001 INFO L396 AbstractCegarLoop]: === Iteration 7 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-01-09 11:27:20,003 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-01-09 11:27:20,003 INFO L85 PathProgramCache]: Analyzing trace with hash -1616870731, now seen corresponding path program 1 times [2025-01-09 11:27:20,003 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-01-09 11:27:20,003 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2131786273] [2025-01-09 11:27:20,003 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-01-09 11:27:20,004 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-01-09 11:27:20,028 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 227 statements into 1 equivalence classes. [2025-01-09 11:27:20,125 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 227 of 227 statements. [2025-01-09 11:27:20,126 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-01-09 11:27:20,126 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-01-09 11:27:20,398 INFO L134 CoverageAnalysis]: Checked inductivity of 2244 backedges. 63 proven. 36 refuted. 0 times theorem prover too weak. 2145 trivial. 0 not checked. [2025-01-09 11:27:20,398 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-01-09 11:27:20,398 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2131786273] [2025-01-09 11:27:20,398 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [2131786273] provided 0 perfect and 1 imperfect interpolant sequences [2025-01-09 11:27:20,399 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [2012296032] [2025-01-09 11:27:20,399 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-01-09 11:27:20,399 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-01-09 11:27:20,399 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 [2025-01-09 11:27:20,401 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 11:27:20,405 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 11:27:20,491 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 227 statements into 1 equivalence classes. [2025-01-09 11:27:20,568 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 227 of 227 statements. [2025-01-09 11:27:20,569 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-01-09 11:27:20,569 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-01-09 11:27:20,572 INFO L256 TraceCheckSpWp]: Trace formula consists of 506 conjuncts, 7 conjuncts are in the unsatisfiable core [2025-01-09 11:27:20,577 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-01-09 11:27:20,850 INFO L134 CoverageAnalysis]: Checked inductivity of 2244 backedges. 1083 proven. 36 refuted. 0 times theorem prover too weak. 1125 trivial. 0 not checked. [2025-01-09 11:27:20,851 INFO L312 TraceCheckSpWp]: Computing backward predicates... [2025-01-09 11:27:21,166 INFO L134 CoverageAnalysis]: Checked inductivity of 2244 backedges. 63 proven. 36 refuted. 0 times theorem prover too weak. 2145 trivial. 0 not checked. [2025-01-09 11:27:21,167 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [2012296032] provided 0 perfect and 2 imperfect interpolant sequences [2025-01-09 11:27:21,167 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2025-01-09 11:27:21,167 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [6, 6, 6] total 9 [2025-01-09 11:27:21,168 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [68272520] [2025-01-09 11:27:21,168 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2025-01-09 11:27:21,168 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 9 states [2025-01-09 11:27:21,169 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-01-09 11:27:21,169 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2025-01-09 11:27:21,169 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=24, Invalid=48, Unknown=0, NotChecked=0, Total=72 [2025-01-09 11:27:21,170 INFO L87 Difference]: Start difference. First operand 1083 states and 1710 transitions. Second operand has 9 states, 9 states have (on average 9.88888888888889) internal successors, (89), 9 states have internal predecessors, (89), 3 states have call successors, (58), 2 states have call predecessors, (58), 4 states have return successors, (59), 3 states have call predecessors, (59), 3 states have call successors, (59) [2025-01-09 11:27:22,005 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-01-09 11:27:22,006 INFO L93 Difference]: Finished difference Result 2795 states and 4375 transitions. [2025-01-09 11:27:22,006 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 15 states. [2025-01-09 11:27:22,007 INFO L78 Accepts]: Start accepts. Automaton has has 9 states, 9 states have (on average 9.88888888888889) internal successors, (89), 9 states have internal predecessors, (89), 3 states have call successors, (58), 2 states have call predecessors, (58), 4 states have return successors, (59), 3 states have call predecessors, (59), 3 states have call successors, (59) Word has length 227 [2025-01-09 11:27:22,008 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-01-09 11:27:22,020 INFO L225 Difference]: With dead ends: 2795 [2025-01-09 11:27:22,021 INFO L226 Difference]: Without dead ends: 1661 [2025-01-09 11:27:22,026 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 468 GetRequests, 452 SyntacticMatches, 0 SemanticMatches, 16 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 28 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=105, Invalid=201, Unknown=0, NotChecked=0, Total=306 [2025-01-09 11:27:22,027 INFO L435 NwaCegarLoop]: 228 mSDtfsCounter, 399 mSDsluCounter, 446 mSDsCounter, 0 mSdLazyCounter, 451 mSolverCounterSat, 121 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.5s Time, 0 mProtectedPredicate, 0 mProtectedAction, 421 SdHoareTripleChecker+Valid, 674 SdHoareTripleChecker+Invalid, 572 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 121 IncrementalHoareTripleChecker+Valid, 451 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.6s IncrementalHoareTripleChecker+Time [2025-01-09 11:27:22,027 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [421 Valid, 674 Invalid, 572 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [121 Valid, 451 Invalid, 0 Unknown, 0 Unchecked, 0.6s Time] [2025-01-09 11:27:22,029 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1661 states. [2025-01-09 11:27:22,181 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1661 to 1635. [2025-01-09 11:27:22,186 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 1635 states, 1202 states have (on average 1.4251247920133112) internal successors, (1713), 1202 states have internal predecessors, (1713), 408 states have call successors, (408), 24 states have call predecessors, (408), 24 states have return successors, (408), 408 states have call predecessors, (408), 408 states have call successors, (408) [2025-01-09 11:27:22,197 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1635 states to 1635 states and 2529 transitions. [2025-01-09 11:27:22,200 INFO L78 Accepts]: Start accepts. Automaton has 1635 states and 2529 transitions. Word has length 227 [2025-01-09 11:27:22,201 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-01-09 11:27:22,201 INFO L471 AbstractCegarLoop]: Abstraction has 1635 states and 2529 transitions. [2025-01-09 11:27:22,201 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 9 states, 9 states have (on average 9.88888888888889) internal successors, (89), 9 states have internal predecessors, (89), 3 states have call successors, (58), 2 states have call predecessors, (58), 4 states have return successors, (59), 3 states have call predecessors, (59), 3 states have call successors, (59) [2025-01-09 11:27:22,202 INFO L276 IsEmpty]: Start isEmpty. Operand 1635 states and 2529 transitions. [2025-01-09 11:27:22,206 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 229 [2025-01-09 11:27:22,207 INFO L210 NwaCegarLoop]: Found error trace [2025-01-09 11:27:22,208 INFO L218 NwaCegarLoop]: trace histogram [34, 34, 34, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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 11:27:22,217 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (3)] Ended with exit code 0 [2025-01-09 11:27:22,408 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 11:27:22,409 INFO L396 AbstractCegarLoop]: === Iteration 8 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-01-09 11:27:22,409 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-01-09 11:27:22,410 INFO L85 PathProgramCache]: Analyzing trace with hash -101441840, now seen corresponding path program 1 times [2025-01-09 11:27:22,410 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-01-09 11:27:22,410 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1943526502] [2025-01-09 11:27:22,410 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-01-09 11:27:22,410 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-01-09 11:27:22,438 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 228 statements into 1 equivalence classes. [2025-01-09 11:27:22,458 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 228 of 228 statements. [2025-01-09 11:27:22,459 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-01-09 11:27:22,459 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-01-09 11:27:22,650 INFO L134 CoverageAnalysis]: Checked inductivity of 2244 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 2244 trivial. 0 not checked. [2025-01-09 11:27:22,650 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-01-09 11:27:22,651 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1943526502] [2025-01-09 11:27:22,651 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1943526502] provided 1 perfect and 0 imperfect interpolant sequences [2025-01-09 11:27:22,651 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-01-09 11:27:22,651 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2025-01-09 11:27:22,651 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [965083785] [2025-01-09 11:27:22,651 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-01-09 11:27:22,652 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2025-01-09 11:27:22,652 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-01-09 11:27:22,652 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2025-01-09 11:27:22,653 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=6, Invalid=6, Unknown=0, NotChecked=0, Total=12 [2025-01-09 11:27:22,653 INFO L87 Difference]: Start difference. First operand 1635 states and 2529 transitions. Second operand has 4 states, 4 states have (on average 15.25) internal successors, (61), 4 states have internal predecessors, (61), 1 states have call successors, (34), 1 states have call predecessors, (34), 1 states have return successors, (34), 1 states have call predecessors, (34), 1 states have call successors, (34) [2025-01-09 11:27:23,396 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-01-09 11:27:23,397 INFO L93 Difference]: Finished difference Result 5015 states and 7773 transitions. [2025-01-09 11:27:23,398 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2025-01-09 11:27:23,398 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 4 states have (on average 15.25) internal successors, (61), 4 states have internal predecessors, (61), 1 states have call successors, (34), 1 states have call predecessors, (34), 1 states have return successors, (34), 1 states have call predecessors, (34), 1 states have call successors, (34) Word has length 228 [2025-01-09 11:27:23,398 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-01-09 11:27:23,428 INFO L225 Difference]: With dead ends: 5015 [2025-01-09 11:27:23,430 INFO L226 Difference]: Without dead ends: 3379 [2025-01-09 11:27:23,437 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 5 GetRequests, 3 SyntacticMatches, 0 SemanticMatches, 2 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=6, Invalid=6, Unknown=0, NotChecked=0, Total=12 [2025-01-09 11:27:23,438 INFO L435 NwaCegarLoop]: 179 mSDtfsCounter, 446 mSDsluCounter, 227 mSDsCounter, 0 mSdLazyCounter, 167 mSolverCounterSat, 75 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.4s Time, 0 mProtectedPredicate, 0 mProtectedAction, 446 SdHoareTripleChecker+Valid, 406 SdHoareTripleChecker+Invalid, 242 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 75 IncrementalHoareTripleChecker+Valid, 167 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.4s IncrementalHoareTripleChecker+Time [2025-01-09 11:27:23,439 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [446 Valid, 406 Invalid, 242 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [75 Valid, 167 Invalid, 0 Unknown, 0 Unchecked, 0.4s Time] [2025-01-09 11:27:23,442 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 3379 states. [2025-01-09 11:27:23,715 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 3379 to 3307. [2025-01-09 11:27:23,723 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 3307 states, 2442 states have (on average 1.418099918099918) internal successors, (3463), 2442 states have internal predecessors, (3463), 816 states have call successors, (816), 48 states have call predecessors, (816), 48 states have return successors, (816), 816 states have call predecessors, (816), 816 states have call successors, (816) [2025-01-09 11:27:23,778 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3307 states to 3307 states and 5095 transitions. [2025-01-09 11:27:23,783 INFO L78 Accepts]: Start accepts. Automaton has 3307 states and 5095 transitions. Word has length 228 [2025-01-09 11:27:23,784 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-01-09 11:27:23,784 INFO L471 AbstractCegarLoop]: Abstraction has 3307 states and 5095 transitions. [2025-01-09 11:27:23,784 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 15.25) internal successors, (61), 4 states have internal predecessors, (61), 1 states have call successors, (34), 1 states have call predecessors, (34), 1 states have return successors, (34), 1 states have call predecessors, (34), 1 states have call successors, (34) [2025-01-09 11:27:23,784 INFO L276 IsEmpty]: Start isEmpty. Operand 3307 states and 5095 transitions. [2025-01-09 11:27:23,788 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 229 [2025-01-09 11:27:23,788 INFO L210 NwaCegarLoop]: Found error trace [2025-01-09 11:27:23,789 INFO L218 NwaCegarLoop]: trace histogram [34, 34, 34, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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 11:27:23,789 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable7 [2025-01-09 11:27:23,789 INFO L396 AbstractCegarLoop]: === Iteration 9 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-01-09 11:27:23,790 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-01-09 11:27:23,790 INFO L85 PathProgramCache]: Analyzing trace with hash -2024601079, now seen corresponding path program 1 times [2025-01-09 11:27:23,790 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-01-09 11:27:23,790 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [755964959] [2025-01-09 11:27:23,790 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-01-09 11:27:23,790 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-01-09 11:27:23,809 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 228 statements into 1 equivalence classes. [2025-01-09 11:27:23,828 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 228 of 228 statements. [2025-01-09 11:27:23,829 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-01-09 11:27:23,829 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-01-09 11:27:24,056 INFO L134 CoverageAnalysis]: Checked inductivity of 2244 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 2244 trivial. 0 not checked. [2025-01-09 11:27:24,057 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-01-09 11:27:24,057 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [755964959] [2025-01-09 11:27:24,057 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [755964959] provided 1 perfect and 0 imperfect interpolant sequences [2025-01-09 11:27:24,057 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-01-09 11:27:24,058 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2025-01-09 11:27:24,058 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2057691772] [2025-01-09 11:27:24,058 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-01-09 11:27:24,059 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2025-01-09 11:27:24,059 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-01-09 11:27:24,060 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2025-01-09 11:27:24,060 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=9, Invalid=11, Unknown=0, NotChecked=0, Total=20 [2025-01-09 11:27:24,060 INFO L87 Difference]: Start difference. First operand 3307 states and 5095 transitions. Second operand has 5 states, 5 states have (on average 12.2) internal successors, (61), 5 states have internal predecessors, (61), 1 states have call successors, (34), 1 states have call predecessors, (34), 1 states have return successors, (34), 1 states have call predecessors, (34), 1 states have call successors, (34) [2025-01-09 11:27:25,090 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-01-09 11:27:25,090 INFO L93 Difference]: Finished difference Result 5723 states and 8835 transitions. [2025-01-09 11:27:25,091 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2025-01-09 11:27:25,091 INFO L78 Accepts]: Start accepts. Automaton has has 5 states, 5 states have (on average 12.2) internal successors, (61), 5 states have internal predecessors, (61), 1 states have call successors, (34), 1 states have call predecessors, (34), 1 states have return successors, (34), 1 states have call predecessors, (34), 1 states have call successors, (34) Word has length 228 [2025-01-09 11:27:25,092 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-01-09 11:27:25,119 INFO L225 Difference]: With dead ends: 5723 [2025-01-09 11:27:25,119 INFO L226 Difference]: Without dead ends: 3377 [2025-01-09 11:27:25,129 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 7 GetRequests, 3 SyntacticMatches, 0 SemanticMatches, 4 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=14, Invalid=16, Unknown=0, NotChecked=0, Total=30 [2025-01-09 11:27:25,130 INFO L435 NwaCegarLoop]: 179 mSDtfsCounter, 538 mSDsluCounter, 821 mSDsCounter, 0 mSdLazyCounter, 552 mSolverCounterSat, 4 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.6s Time, 0 mProtectedPredicate, 0 mProtectedAction, 538 SdHoareTripleChecker+Valid, 1000 SdHoareTripleChecker+Invalid, 556 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 4 IncrementalHoareTripleChecker+Valid, 552 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.7s IncrementalHoareTripleChecker+Time [2025-01-09 11:27:25,131 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [538 Valid, 1000 Invalid, 556 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [4 Valid, 552 Invalid, 0 Unknown, 0 Unchecked, 0.7s Time] [2025-01-09 11:27:25,135 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 3377 states. [2025-01-09 11:27:25,434 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 3377 to 3335. [2025-01-09 11:27:25,442 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 3335 states, 2470 states have (on average 1.4068825910931173) internal successors, (3475), 2470 states have internal predecessors, (3475), 816 states have call successors, (816), 48 states have call predecessors, (816), 48 states have return successors, (816), 816 states have call predecessors, (816), 816 states have call successors, (816) [2025-01-09 11:27:25,462 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3335 states to 3335 states and 5107 transitions. [2025-01-09 11:27:25,468 INFO L78 Accepts]: Start accepts. Automaton has 3335 states and 5107 transitions. Word has length 228 [2025-01-09 11:27:25,470 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-01-09 11:27:25,470 INFO L471 AbstractCegarLoop]: Abstraction has 3335 states and 5107 transitions. [2025-01-09 11:27:25,470 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 12.2) internal successors, (61), 5 states have internal predecessors, (61), 1 states have call successors, (34), 1 states have call predecessors, (34), 1 states have return successors, (34), 1 states have call predecessors, (34), 1 states have call successors, (34) [2025-01-09 11:27:25,471 INFO L276 IsEmpty]: Start isEmpty. Operand 3335 states and 5107 transitions. [2025-01-09 11:27:25,474 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 229 [2025-01-09 11:27:25,474 INFO L210 NwaCegarLoop]: Found error trace [2025-01-09 11:27:25,474 INFO L218 NwaCegarLoop]: trace histogram [34, 34, 34, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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 11:27:25,475 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable8 [2025-01-09 11:27:25,475 INFO L396 AbstractCegarLoop]: === Iteration 10 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-01-09 11:27:25,475 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-01-09 11:27:25,475 INFO L85 PathProgramCache]: Analyzing trace with hash -610914930, now seen corresponding path program 1 times [2025-01-09 11:27:25,475 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-01-09 11:27:25,476 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [686236756] [2025-01-09 11:27:25,476 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-01-09 11:27:25,476 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-01-09 11:27:25,493 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 228 statements into 1 equivalence classes. [2025-01-09 11:27:25,521 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 228 of 228 statements. [2025-01-09 11:27:25,522 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-01-09 11:27:25,523 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-01-09 11:27:25,775 INFO L134 CoverageAnalysis]: Checked inductivity of 2244 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 2244 trivial. 0 not checked. [2025-01-09 11:27:25,775 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-01-09 11:27:25,775 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [686236756] [2025-01-09 11:27:25,775 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [686236756] provided 1 perfect and 0 imperfect interpolant sequences [2025-01-09 11:27:25,775 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-01-09 11:27:25,775 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2025-01-09 11:27:25,775 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [607065361] [2025-01-09 11:27:25,776 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-01-09 11:27:25,776 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2025-01-09 11:27:25,776 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-01-09 11:27:25,777 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2025-01-09 11:27:25,777 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=6, Invalid=6, Unknown=0, NotChecked=0, Total=12 [2025-01-09 11:27:25,777 INFO L87 Difference]: Start difference. First operand 3335 states and 5107 transitions. Second operand has 4 states, 4 states have (on average 15.25) internal successors, (61), 4 states have internal predecessors, (61), 1 states have call successors, (34), 1 states have call predecessors, (34), 1 states have return successors, (34), 1 states have call predecessors, (34), 1 states have call successors, (34) [2025-01-09 11:27:26,361 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-01-09 11:27:26,361 INFO L93 Difference]: Finished difference Result 6677 states and 10109 transitions. [2025-01-09 11:27:26,362 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2025-01-09 11:27:26,362 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 4 states have (on average 15.25) internal successors, (61), 4 states have internal predecessors, (61), 1 states have call successors, (34), 1 states have call predecessors, (34), 1 states have return successors, (34), 1 states have call predecessors, (34), 1 states have call successors, (34) Word has length 228 [2025-01-09 11:27:26,363 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-01-09 11:27:26,400 INFO L225 Difference]: With dead ends: 6677 [2025-01-09 11:27:26,401 INFO L226 Difference]: Without dead ends: 4443 [2025-01-09 11:27:26,412 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 6 GetRequests, 4 SyntacticMatches, 0 SemanticMatches, 2 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=6, Invalid=6, Unknown=0, NotChecked=0, Total=12 [2025-01-09 11:27:26,413 INFO L435 NwaCegarLoop]: 169 mSDtfsCounter, 165 mSDsluCounter, 297 mSDsCounter, 0 mSdLazyCounter, 156 mSolverCounterSat, 5 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 165 SdHoareTripleChecker+Valid, 466 SdHoareTripleChecker+Invalid, 161 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 5 IncrementalHoareTripleChecker+Valid, 156 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.2s IncrementalHoareTripleChecker+Time [2025-01-09 11:27:26,414 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [165 Valid, 466 Invalid, 161 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [5 Valid, 156 Invalid, 0 Unknown, 0 Unchecked, 0.2s Time] [2025-01-09 11:27:26,419 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 4443 states. [2025-01-09 11:27:26,777 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 4443 to 4014. [2025-01-09 11:27:26,788 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 4014 states, 2859 states have (on average 1.366211962224554) internal successors, (3906), 2873 states have internal predecessors, (3906), 1082 states have call successors, (1082), 72 states have call predecessors, (1082), 72 states have return successors, (1082), 1068 states have call predecessors, (1082), 1082 states have call successors, (1082) [2025-01-09 11:27:26,823 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4014 states to 4014 states and 6070 transitions. [2025-01-09 11:27:26,831 INFO L78 Accepts]: Start accepts. Automaton has 4014 states and 6070 transitions. Word has length 228 [2025-01-09 11:27:26,832 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-01-09 11:27:26,832 INFO L471 AbstractCegarLoop]: Abstraction has 4014 states and 6070 transitions. [2025-01-09 11:27:26,832 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 15.25) internal successors, (61), 4 states have internal predecessors, (61), 1 states have call successors, (34), 1 states have call predecessors, (34), 1 states have return successors, (34), 1 states have call predecessors, (34), 1 states have call successors, (34) [2025-01-09 11:27:26,833 INFO L276 IsEmpty]: Start isEmpty. Operand 4014 states and 6070 transitions. [2025-01-09 11:27:26,837 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 229 [2025-01-09 11:27:26,837 INFO L210 NwaCegarLoop]: Found error trace [2025-01-09 11:27:26,838 INFO L218 NwaCegarLoop]: trace histogram [34, 34, 34, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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 11:27:26,838 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable9 [2025-01-09 11:27:26,838 INFO L396 AbstractCegarLoop]: === Iteration 11 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-01-09 11:27:26,839 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-01-09 11:27:26,839 INFO L85 PathProgramCache]: Analyzing trace with hash 198431696, now seen corresponding path program 1 times [2025-01-09 11:27:26,839 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-01-09 11:27:26,839 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1844833531] [2025-01-09 11:27:26,839 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-01-09 11:27:26,839 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-01-09 11:27:26,856 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 228 statements into 1 equivalence classes. [2025-01-09 11:27:26,909 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 228 of 228 statements. [2025-01-09 11:27:26,909 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-01-09 11:27:26,909 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-01-09 11:27:27,304 INFO L134 CoverageAnalysis]: Checked inductivity of 2244 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 2244 trivial. 0 not checked. [2025-01-09 11:27:27,304 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-01-09 11:27:27,304 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1844833531] [2025-01-09 11:27:27,305 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1844833531] provided 1 perfect and 0 imperfect interpolant sequences [2025-01-09 11:27:27,305 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-01-09 11:27:27,305 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2025-01-09 11:27:27,305 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [855895681] [2025-01-09 11:27:27,305 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-01-09 11:27:27,305 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2025-01-09 11:27:27,306 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-01-09 11:27:27,306 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2025-01-09 11:27:27,307 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2025-01-09 11:27:27,307 INFO L87 Difference]: Start difference. First operand 4014 states and 6070 transitions. Second operand has 5 states, 5 states have (on average 12.2) internal successors, (61), 5 states have internal predecessors, (61), 1 states have call successors, (34), 1 states have call predecessors, (34), 1 states have return successors, (34), 1 states have call predecessors, (34), 1 states have call successors, (34) [2025-01-09 11:27:28,179 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-01-09 11:27:28,179 INFO L93 Difference]: Finished difference Result 10896 states and 16438 transitions. [2025-01-09 11:27:28,180 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2025-01-09 11:27:28,180 INFO L78 Accepts]: Start accepts. Automaton has has 5 states, 5 states have (on average 12.2) internal successors, (61), 5 states have internal predecessors, (61), 1 states have call successors, (34), 1 states have call predecessors, (34), 1 states have return successors, (34), 1 states have call predecessors, (34), 1 states have call successors, (34) Word has length 228 [2025-01-09 11:27:28,182 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-01-09 11:27:28,241 INFO L225 Difference]: With dead ends: 10896 [2025-01-09 11:27:28,241 INFO L226 Difference]: Without dead ends: 6828 [2025-01-09 11:27:28,259 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 10 GetRequests, 5 SyntacticMatches, 0 SemanticMatches, 5 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=17, Invalid=25, Unknown=0, NotChecked=0, Total=42 [2025-01-09 11:27:28,260 INFO L435 NwaCegarLoop]: 201 mSDtfsCounter, 305 mSDsluCounter, 480 mSDsCounter, 0 mSdLazyCounter, 138 mSolverCounterSat, 176 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.3s Time, 0 mProtectedPredicate, 0 mProtectedAction, 305 SdHoareTripleChecker+Valid, 681 SdHoareTripleChecker+Invalid, 314 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 176 IncrementalHoareTripleChecker+Valid, 138 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.4s IncrementalHoareTripleChecker+Time [2025-01-09 11:27:28,260 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [305 Valid, 681 Invalid, 314 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [176 Valid, 138 Invalid, 0 Unknown, 0 Unchecked, 0.4s Time] [2025-01-09 11:27:28,268 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 6828 states. [2025-01-09 11:27:28,792 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 6828 to 5705. [2025-01-09 11:27:28,813 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 5705 states, 4046 states have (on average 1.3583786455758775) internal successors, (5496), 4069 states have internal predecessors, (5496), 1559 states have call successors, (1559), 99 states have call predecessors, (1559), 99 states have return successors, (1559), 1536 states have call predecessors, (1559), 1559 states have call successors, (1559) [2025-01-09 11:27:28,847 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5705 states to 5705 states and 8614 transitions. [2025-01-09 11:27:28,855 INFO L78 Accepts]: Start accepts. Automaton has 5705 states and 8614 transitions. Word has length 228 [2025-01-09 11:27:28,856 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-01-09 11:27:28,856 INFO L471 AbstractCegarLoop]: Abstraction has 5705 states and 8614 transitions. [2025-01-09 11:27:28,857 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 12.2) internal successors, (61), 5 states have internal predecessors, (61), 1 states have call successors, (34), 1 states have call predecessors, (34), 1 states have return successors, (34), 1 states have call predecessors, (34), 1 states have call successors, (34) [2025-01-09 11:27:28,857 INFO L276 IsEmpty]: Start isEmpty. Operand 5705 states and 8614 transitions. [2025-01-09 11:27:28,861 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 229 [2025-01-09 11:27:28,861 INFO L210 NwaCegarLoop]: Found error trace [2025-01-09 11:27:28,862 INFO L218 NwaCegarLoop]: trace histogram [34, 34, 34, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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 11:27:28,862 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable10 [2025-01-09 11:27:28,862 INFO L396 AbstractCegarLoop]: === Iteration 12 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-01-09 11:27:28,863 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-01-09 11:27:28,863 INFO L85 PathProgramCache]: Analyzing trace with hash -1387250099, now seen corresponding path program 1 times [2025-01-09 11:27:28,863 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-01-09 11:27:28,863 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [41822072] [2025-01-09 11:27:28,863 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-01-09 11:27:28,863 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-01-09 11:27:28,881 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 228 statements into 1 equivalence classes. [2025-01-09 11:27:28,930 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 228 of 228 statements. [2025-01-09 11:27:28,930 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-01-09 11:27:28,930 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-01-09 11:27:29,466 INFO L134 CoverageAnalysis]: Checked inductivity of 2244 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 2244 trivial. 0 not checked. [2025-01-09 11:27:29,466 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-01-09 11:27:29,466 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [41822072] [2025-01-09 11:27:29,466 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [41822072] provided 1 perfect and 0 imperfect interpolant sequences [2025-01-09 11:27:29,467 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-01-09 11:27:29,467 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2025-01-09 11:27:29,467 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [409689488] [2025-01-09 11:27:29,468 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-01-09 11:27:29,469 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2025-01-09 11:27:29,469 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-01-09 11:27:29,469 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2025-01-09 11:27:29,469 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2025-01-09 11:27:29,470 INFO L87 Difference]: Start difference. First operand 5705 states and 8614 transitions. Second operand has 5 states, 5 states have (on average 12.2) internal successors, (61), 5 states have internal predecessors, (61), 1 states have call successors, (34), 1 states have call predecessors, (34), 1 states have return successors, (34), 1 states have call predecessors, (34), 1 states have call successors, (34) [2025-01-09 11:27:30,329 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-01-09 11:27:30,329 INFO L93 Difference]: Finished difference Result 11428 states and 17255 transitions. [2025-01-09 11:27:30,330 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2025-01-09 11:27:30,330 INFO L78 Accepts]: Start accepts. Automaton has has 5 states, 5 states have (on average 12.2) internal successors, (61), 5 states have internal predecessors, (61), 1 states have call successors, (34), 1 states have call predecessors, (34), 1 states have return successors, (34), 1 states have call predecessors, (34), 1 states have call successors, (34) Word has length 228 [2025-01-09 11:27:30,331 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-01-09 11:27:30,382 INFO L225 Difference]: With dead ends: 11428 [2025-01-09 11:27:30,382 INFO L226 Difference]: Without dead ends: 5726 [2025-01-09 11:27:30,402 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 10 GetRequests, 5 SyntacticMatches, 0 SemanticMatches, 5 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=15, Invalid=27, Unknown=0, NotChecked=0, Total=42 [2025-01-09 11:27:30,403 INFO L435 NwaCegarLoop]: 157 mSDtfsCounter, 114 mSDsluCounter, 304 mSDsCounter, 0 mSdLazyCounter, 288 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.3s Time, 0 mProtectedPredicate, 0 mProtectedAction, 114 SdHoareTripleChecker+Valid, 461 SdHoareTripleChecker+Invalid, 288 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 288 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.3s IncrementalHoareTripleChecker+Time [2025-01-09 11:27:30,403 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [114 Valid, 461 Invalid, 288 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 288 Invalid, 0 Unknown, 0 Unchecked, 0.3s Time] [2025-01-09 11:27:30,410 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 5726 states. [2025-01-09 11:27:30,950 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 5726 to 5717. [2025-01-09 11:27:30,961 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 5717 states, 4058 states have (on average 1.358304583538689) internal successors, (5512), 4081 states have internal predecessors, (5512), 1559 states have call successors, (1559), 99 states have call predecessors, (1559), 99 states have return successors, (1559), 1536 states have call predecessors, (1559), 1559 states have call successors, (1559) [2025-01-09 11:27:30,987 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5717 states to 5717 states and 8630 transitions. [2025-01-09 11:27:30,999 INFO L78 Accepts]: Start accepts. Automaton has 5717 states and 8630 transitions. Word has length 228 [2025-01-09 11:27:31,000 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-01-09 11:27:31,000 INFO L471 AbstractCegarLoop]: Abstraction has 5717 states and 8630 transitions. [2025-01-09 11:27:31,000 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 12.2) internal successors, (61), 5 states have internal predecessors, (61), 1 states have call successors, (34), 1 states have call predecessors, (34), 1 states have return successors, (34), 1 states have call predecessors, (34), 1 states have call successors, (34) [2025-01-09 11:27:31,000 INFO L276 IsEmpty]: Start isEmpty. Operand 5717 states and 8630 transitions. [2025-01-09 11:27:31,003 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 229 [2025-01-09 11:27:31,004 INFO L210 NwaCegarLoop]: Found error trace [2025-01-09 11:27:31,004 INFO L218 NwaCegarLoop]: trace histogram [34, 34, 34, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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 11:27:31,004 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable11 [2025-01-09 11:27:31,004 INFO L396 AbstractCegarLoop]: === Iteration 13 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-01-09 11:27:31,005 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-01-09 11:27:31,005 INFO L85 PathProgramCache]: Analyzing trace with hash 2090068747, now seen corresponding path program 1 times [2025-01-09 11:27:31,005 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-01-09 11:27:31,005 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1142787357] [2025-01-09 11:27:31,005 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-01-09 11:27:31,005 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-01-09 11:27:31,020 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 228 statements into 1 equivalence classes. [2025-01-09 11:27:31,082 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 228 of 228 statements. [2025-01-09 11:27:31,082 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-01-09 11:27:31,083 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-01-09 11:27:31,576 INFO L134 CoverageAnalysis]: Checked inductivity of 2244 backedges. 57 proven. 42 refuted. 0 times theorem prover too weak. 2145 trivial. 0 not checked. [2025-01-09 11:27:31,576 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-01-09 11:27:31,576 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1142787357] [2025-01-09 11:27:31,576 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1142787357] provided 0 perfect and 1 imperfect interpolant sequences [2025-01-09 11:27:31,576 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [2028248675] [2025-01-09 11:27:31,576 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-01-09 11:27:31,576 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-01-09 11:27:31,577 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 [2025-01-09 11:27:31,579 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 11:27:31,582 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 11:27:31,670 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 228 statements into 1 equivalence classes. [2025-01-09 11:27:31,747 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 228 of 228 statements. [2025-01-09 11:27:31,748 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-01-09 11:27:31,748 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-01-09 11:27:31,751 INFO L256 TraceCheckSpWp]: Trace formula consists of 507 conjuncts, 11 conjuncts are in the unsatisfiable core [2025-01-09 11:27:31,760 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-01-09 11:27:32,588 INFO L134 CoverageAnalysis]: Checked inductivity of 2244 backedges. 1135 proven. 42 refuted. 0 times theorem prover too weak. 1067 trivial. 0 not checked. [2025-01-09 11:27:32,588 INFO L312 TraceCheckSpWp]: Computing backward predicates... [2025-01-09 11:27:33,368 INFO L134 CoverageAnalysis]: Checked inductivity of 2244 backedges. 57 proven. 42 refuted. 0 times theorem prover too weak. 2145 trivial. 0 not checked. [2025-01-09 11:27:33,369 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [2028248675] provided 0 perfect and 2 imperfect interpolant sequences [2025-01-09 11:27:33,369 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2025-01-09 11:27:33,369 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [8, 7, 8] total 20 [2025-01-09 11:27:33,371 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [383511951] [2025-01-09 11:27:33,371 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2025-01-09 11:27:33,372 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 20 states [2025-01-09 11:27:33,372 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-01-09 11:27:33,373 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 20 interpolants. [2025-01-09 11:27:33,373 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=106, Invalid=274, Unknown=0, NotChecked=0, Total=380 [2025-01-09 11:27:33,374 INFO L87 Difference]: Start difference. First operand 5717 states and 8630 transitions. Second operand has 20 states, 20 states have (on average 8.9) internal successors, (178), 20 states have internal predecessors, (178), 6 states have call successors, (102), 3 states have call predecessors, (102), 6 states have return successors, (102), 6 states have call predecessors, (102), 6 states have call successors, (102) [2025-01-09 11:27:37,384 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-01-09 11:27:37,385 INFO L93 Difference]: Finished difference Result 15089 states and 22483 transitions. [2025-01-09 11:27:37,386 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 48 states. [2025-01-09 11:27:37,386 INFO L78 Accepts]: Start accepts. Automaton has has 20 states, 20 states have (on average 8.9) internal successors, (178), 20 states have internal predecessors, (178), 6 states have call successors, (102), 3 states have call predecessors, (102), 6 states have return successors, (102), 6 states have call predecessors, (102), 6 states have call successors, (102) Word has length 228 [2025-01-09 11:27:37,387 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-01-09 11:27:37,440 INFO L225 Difference]: With dead ends: 15089 [2025-01-09 11:27:37,440 INFO L226 Difference]: Without dead ends: 9256 [2025-01-09 11:27:37,468 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 510 GetRequests, 453 SyntacticMatches, 0 SemanticMatches, 57 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 956 ImplicationChecksByTransitivity, 1.2s TimeCoverageRelationStatistics Valid=943, Invalid=2479, Unknown=0, NotChecked=0, Total=3422 [2025-01-09 11:27:37,469 INFO L435 NwaCegarLoop]: 169 mSDtfsCounter, 1800 mSDsluCounter, 1051 mSDsCounter, 0 mSdLazyCounter, 1710 mSolverCounterSat, 911 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 1.8s Time, 0 mProtectedPredicate, 0 mProtectedAction, 1858 SdHoareTripleChecker+Valid, 1220 SdHoareTripleChecker+Invalid, 2621 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 911 IncrementalHoareTripleChecker+Valid, 1710 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 2.2s IncrementalHoareTripleChecker+Time [2025-01-09 11:27:37,471 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [1858 Valid, 1220 Invalid, 2621 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [911 Valid, 1710 Invalid, 0 Unknown, 0 Unchecked, 2.2s Time] [2025-01-09 11:27:37,481 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 9256 states. [2025-01-09 11:27:38,277 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 9256 to 7799. [2025-01-09 11:27:38,292 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 7799 states, 5751 states have (on average 1.3564597461311076) internal successors, (7801), 5791 states have internal predecessors, (7801), 1882 states have call successors, (1882), 165 states have call predecessors, (1882), 165 states have return successors, (1882), 1842 states have call predecessors, (1882), 1882 states have call successors, (1882) [2025-01-09 11:27:38,319 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 7799 states to 7799 states and 11565 transitions. [2025-01-09 11:27:38,333 INFO L78 Accepts]: Start accepts. Automaton has 7799 states and 11565 transitions. Word has length 228 [2025-01-09 11:27:38,335 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-01-09 11:27:38,335 INFO L471 AbstractCegarLoop]: Abstraction has 7799 states and 11565 transitions. [2025-01-09 11:27:38,335 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 20 states, 20 states have (on average 8.9) internal successors, (178), 20 states have internal predecessors, (178), 6 states have call successors, (102), 3 states have call predecessors, (102), 6 states have return successors, (102), 6 states have call predecessors, (102), 6 states have call successors, (102) [2025-01-09 11:27:38,335 INFO L276 IsEmpty]: Start isEmpty. Operand 7799 states and 11565 transitions. [2025-01-09 11:27:38,339 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 229 [2025-01-09 11:27:38,339 INFO L210 NwaCegarLoop]: Found error trace [2025-01-09 11:27:38,340 INFO L218 NwaCegarLoop]: trace histogram [34, 34, 34, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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 11:27:38,350 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 11:27:38,540 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable12,4 /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-01-09 11:27:38,540 INFO L396 AbstractCegarLoop]: === Iteration 14 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-01-09 11:27:38,541 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-01-09 11:27:38,541 INFO L85 PathProgramCache]: Analyzing trace with hash -1395551923, now seen corresponding path program 1 times [2025-01-09 11:27:38,541 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-01-09 11:27:38,541 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [328728791] [2025-01-09 11:27:38,541 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-01-09 11:27:38,541 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-01-09 11:27:38,558 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 228 statements into 1 equivalence classes. [2025-01-09 11:27:38,618 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 228 of 228 statements. [2025-01-09 11:27:38,618 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-01-09 11:27:38,619 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-01-09 11:27:38,883 INFO L134 CoverageAnalysis]: Checked inductivity of 2244 backedges. 63 proven. 36 refuted. 0 times theorem prover too weak. 2145 trivial. 0 not checked. [2025-01-09 11:27:38,883 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-01-09 11:27:38,883 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [328728791] [2025-01-09 11:27:38,883 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [328728791] provided 0 perfect and 1 imperfect interpolant sequences [2025-01-09 11:27:38,883 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [113882196] [2025-01-09 11:27:38,883 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-01-09 11:27:38,884 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-01-09 11:27:38,884 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 [2025-01-09 11:27:38,886 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 11:27:38,889 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 11:27:38,968 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 228 statements into 1 equivalence classes. [2025-01-09 11:27:39,036 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 228 of 228 statements. [2025-01-09 11:27:39,036 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-01-09 11:27:39,036 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-01-09 11:27:39,040 INFO L256 TraceCheckSpWp]: Trace formula consists of 507 conjuncts, 9 conjuncts are in the unsatisfiable core [2025-01-09 11:27:39,044 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-01-09 11:27:39,676 INFO L134 CoverageAnalysis]: Checked inductivity of 2244 backedges. 1083 proven. 36 refuted. 0 times theorem prover too weak. 1125 trivial. 0 not checked. [2025-01-09 11:27:39,676 INFO L312 TraceCheckSpWp]: Computing backward predicates... [2025-01-09 11:27:40,037 INFO L134 CoverageAnalysis]: Checked inductivity of 2244 backedges. 63 proven. 36 refuted. 0 times theorem prover too weak. 2145 trivial. 0 not checked. [2025-01-09 11:27:40,037 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [113882196] provided 0 perfect and 2 imperfect interpolant sequences [2025-01-09 11:27:40,037 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2025-01-09 11:27:40,037 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [6, 5, 6] total 14 [2025-01-09 11:27:40,038 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [475902220] [2025-01-09 11:27:40,038 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2025-01-09 11:27:40,038 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 14 states [2025-01-09 11:27:40,039 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-01-09 11:27:40,039 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 14 interpolants. [2025-01-09 11:27:40,039 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=55, Invalid=127, Unknown=0, NotChecked=0, Total=182 [2025-01-09 11:27:40,040 INFO L87 Difference]: Start difference. First operand 7799 states and 11565 transitions. Second operand has 14 states, 14 states have (on average 10.714285714285714) internal successors, (150), 14 states have internal predecessors, (150), 6 states have call successors, (102), 3 states have call predecessors, (102), 6 states have return successors, (102), 6 states have call predecessors, (102), 6 states have call successors, (102) [2025-01-09 11:27:41,637 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-01-09 11:27:41,637 INFO L93 Difference]: Finished difference Result 16896 states and 24847 transitions. [2025-01-09 11:27:41,638 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 20 states. [2025-01-09 11:27:41,638 INFO L78 Accepts]: Start accepts. Automaton has has 14 states, 14 states have (on average 10.714285714285714) internal successors, (150), 14 states have internal predecessors, (150), 6 states have call successors, (102), 3 states have call predecessors, (102), 6 states have return successors, (102), 6 states have call predecessors, (102), 6 states have call successors, (102) Word has length 228 [2025-01-09 11:27:41,638 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-01-09 11:27:41,691 INFO L225 Difference]: With dead ends: 16896 [2025-01-09 11:27:41,691 INFO L226 Difference]: Without dead ends: 9883 [2025-01-09 11:27:41,715 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 476 GetRequests, 451 SyntacticMatches, 0 SemanticMatches, 25 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 146 ImplicationChecksByTransitivity, 0.4s TimeCoverageRelationStatistics Valid=227, Invalid=475, Unknown=0, NotChecked=0, Total=702 [2025-01-09 11:27:41,716 INFO L435 NwaCegarLoop]: 128 mSDtfsCounter, 1095 mSDsluCounter, 531 mSDsCounter, 0 mSdLazyCounter, 574 mSolverCounterSat, 466 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.6s Time, 0 mProtectedPredicate, 0 mProtectedAction, 1117 SdHoareTripleChecker+Valid, 659 SdHoareTripleChecker+Invalid, 1040 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 466 IncrementalHoareTripleChecker+Valid, 574 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.8s IncrementalHoareTripleChecker+Time [2025-01-09 11:27:41,716 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [1117 Valid, 659 Invalid, 1040 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [466 Valid, 574 Invalid, 0 Unknown, 0 Unchecked, 0.8s Time] [2025-01-09 11:27:41,727 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 9883 states. [2025-01-09 11:27:42,494 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 9883 to 8226. [2025-01-09 11:27:42,507 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 8226 states, 6010 states have (on average 1.3349417637271215) internal successors, (8023), 6057 states have internal predecessors, (8023), 2029 states have call successors, (2029), 186 states have call predecessors, (2029), 186 states have return successors, (2029), 1982 states have call predecessors, (2029), 2029 states have call successors, (2029) [2025-01-09 11:27:42,537 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 8226 states to 8226 states and 12081 transitions. [2025-01-09 11:27:42,551 INFO L78 Accepts]: Start accepts. Automaton has 8226 states and 12081 transitions. Word has length 228 [2025-01-09 11:27:42,552 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-01-09 11:27:42,552 INFO L471 AbstractCegarLoop]: Abstraction has 8226 states and 12081 transitions. [2025-01-09 11:27:42,552 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 14 states, 14 states have (on average 10.714285714285714) internal successors, (150), 14 states have internal predecessors, (150), 6 states have call successors, (102), 3 states have call predecessors, (102), 6 states have return successors, (102), 6 states have call predecessors, (102), 6 states have call successors, (102) [2025-01-09 11:27:42,553 INFO L276 IsEmpty]: Start isEmpty. Operand 8226 states and 12081 transitions. [2025-01-09 11:27:42,555 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 230 [2025-01-09 11:27:42,555 INFO L210 NwaCegarLoop]: Found error trace [2025-01-09 11:27:42,555 INFO L218 NwaCegarLoop]: trace histogram [34, 34, 34, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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 11:27:42,565 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 11:27:42,756 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,SelfDestructingSolverStorable13 [2025-01-09 11:27:42,756 INFO L396 AbstractCegarLoop]: === Iteration 15 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-01-09 11:27:42,757 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-01-09 11:27:42,757 INFO L85 PathProgramCache]: Analyzing trace with hash -383179374, now seen corresponding path program 1 times [2025-01-09 11:27:42,757 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-01-09 11:27:42,757 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2040628582] [2025-01-09 11:27:42,757 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-01-09 11:27:42,758 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-01-09 11:27:42,774 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 229 statements into 1 equivalence classes. [2025-01-09 11:27:42,823 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 229 of 229 statements. [2025-01-09 11:27:42,823 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-01-09 11:27:42,824 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-01-09 11:27:44,005 INFO L134 CoverageAnalysis]: Checked inductivity of 2244 backedges. 75 proven. 117 refuted. 0 times theorem prover too weak. 2052 trivial. 0 not checked. [2025-01-09 11:27:44,006 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-01-09 11:27:44,006 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2040628582] [2025-01-09 11:27:44,006 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [2040628582] provided 0 perfect and 1 imperfect interpolant sequences [2025-01-09 11:27:44,007 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [2013805261] [2025-01-09 11:27:44,007 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-01-09 11:27:44,007 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-01-09 11:27:44,007 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 [2025-01-09 11:27:44,009 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 11:27:44,011 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 11:27:44,102 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 229 statements into 1 equivalence classes. [2025-01-09 11:27:44,176 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 229 of 229 statements. [2025-01-09 11:27:44,177 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-01-09 11:27:44,177 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-01-09 11:27:44,180 INFO L256 TraceCheckSpWp]: Trace formula consists of 510 conjuncts, 14 conjuncts are in the unsatisfiable core [2025-01-09 11:27:44,186 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-01-09 11:27:45,237 INFO L134 CoverageAnalysis]: Checked inductivity of 2244 backedges. 1201 proven. 75 refuted. 0 times theorem prover too weak. 968 trivial. 0 not checked. [2025-01-09 11:27:45,237 INFO L312 TraceCheckSpWp]: Computing backward predicates... [2025-01-09 11:27:46,334 INFO L134 CoverageAnalysis]: Checked inductivity of 2244 backedges. 117 proven. 78 refuted. 0 times theorem prover too weak. 2049 trivial. 0 not checked. [2025-01-09 11:27:46,334 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [2013805261] provided 0 perfect and 2 imperfect interpolant sequences [2025-01-09 11:27:46,334 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2025-01-09 11:27:46,334 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [9, 9, 10] total 25 [2025-01-09 11:27:46,334 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1400664735] [2025-01-09 11:27:46,334 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2025-01-09 11:27:46,335 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 25 states [2025-01-09 11:27:46,335 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-01-09 11:27:46,336 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 25 interpolants. [2025-01-09 11:27:46,336 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=129, Invalid=471, Unknown=0, NotChecked=0, Total=600 [2025-01-09 11:27:46,336 INFO L87 Difference]: Start difference. First operand 8226 states and 12081 transitions. Second operand has 25 states, 25 states have (on average 7.6) internal successors, (190), 25 states have internal predecessors, (190), 9 states have call successors, (102), 4 states have call predecessors, (102), 9 states have return successors, (102), 9 states have call predecessors, (102), 9 states have call successors, (102) [2025-01-09 11:27:52,799 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-01-09 11:27:52,799 INFO L93 Difference]: Finished difference Result 20150 states and 28396 transitions. [2025-01-09 11:27:52,800 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 108 states. [2025-01-09 11:27:52,800 INFO L78 Accepts]: Start accepts. Automaton has has 25 states, 25 states have (on average 7.6) internal successors, (190), 25 states have internal predecessors, (190), 9 states have call successors, (102), 4 states have call predecessors, (102), 9 states have return successors, (102), 9 states have call predecessors, (102), 9 states have call successors, (102) Word has length 229 [2025-01-09 11:27:52,800 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-01-09 11:27:52,856 INFO L225 Difference]: With dead ends: 20150 [2025-01-09 11:27:52,856 INFO L226 Difference]: Without dead ends: 14344 [2025-01-09 11:27:52,873 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 592 GetRequests, 466 SyntacticMatches, 0 SemanticMatches, 126 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 6700 ImplicationChecksByTransitivity, 3.4s TimeCoverageRelationStatistics Valid=3449, Invalid=12807, Unknown=0, NotChecked=0, Total=16256 [2025-01-09 11:27:52,874 INFO L435 NwaCegarLoop]: 177 mSDtfsCounter, 4421 mSDsluCounter, 1259 mSDsCounter, 0 mSdLazyCounter, 2151 mSolverCounterSat, 1137 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 1.9s Time, 0 mProtectedPredicate, 0 mProtectedAction, 4425 SdHoareTripleChecker+Valid, 1436 SdHoareTripleChecker+Invalid, 3288 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 1137 IncrementalHoareTripleChecker+Valid, 2151 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 2.2s IncrementalHoareTripleChecker+Time [2025-01-09 11:27:52,874 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [4425 Valid, 1436 Invalid, 3288 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [1137 Valid, 2151 Invalid, 0 Unknown, 0 Unchecked, 2.2s Time] [2025-01-09 11:27:52,886 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 14344 states. [2025-01-09 11:27:53,967 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 14344 to 10167. [2025-01-09 11:27:53,978 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 10167 states, 8004 states have (on average 1.3408295852073964) internal successors, (10732), 8057 states have internal predecessors, (10732), 1830 states have call successors, (1830), 332 states have call predecessors, (1830), 332 states have return successors, (1830), 1777 states have call predecessors, (1830), 1830 states have call successors, (1830) [2025-01-09 11:27:54,001 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 10167 states to 10167 states and 14392 transitions. [2025-01-09 11:27:54,015 INFO L78 Accepts]: Start accepts. Automaton has 10167 states and 14392 transitions. Word has length 229 [2025-01-09 11:27:54,016 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-01-09 11:27:54,016 INFO L471 AbstractCegarLoop]: Abstraction has 10167 states and 14392 transitions. [2025-01-09 11:27:54,016 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 25 states, 25 states have (on average 7.6) internal successors, (190), 25 states have internal predecessors, (190), 9 states have call successors, (102), 4 states have call predecessors, (102), 9 states have return successors, (102), 9 states have call predecessors, (102), 9 states have call successors, (102) [2025-01-09 11:27:54,017 INFO L276 IsEmpty]: Start isEmpty. Operand 10167 states and 14392 transitions. [2025-01-09 11:27:54,020 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 231 [2025-01-09 11:27:54,020 INFO L210 NwaCegarLoop]: Found error trace [2025-01-09 11:27:54,021 INFO L218 NwaCegarLoop]: trace histogram [34, 34, 34, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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 11:27:54,029 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 11:27:54,221 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 11:27:54,221 INFO L396 AbstractCegarLoop]: === Iteration 16 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-01-09 11:27:54,222 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-01-09 11:27:54,222 INFO L85 PathProgramCache]: Analyzing trace with hash -75774195, now seen corresponding path program 1 times [2025-01-09 11:27:54,222 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-01-09 11:27:54,222 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [134024400] [2025-01-09 11:27:54,222 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-01-09 11:27:54,222 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-01-09 11:27:54,235 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 230 statements into 1 equivalence classes. [2025-01-09 11:27:54,265 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 230 of 230 statements. [2025-01-09 11:27:54,265 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-01-09 11:27:54,265 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-01-09 11:27:54,476 INFO L134 CoverageAnalysis]: Checked inductivity of 2244 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 2244 trivial. 0 not checked. [2025-01-09 11:27:54,476 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-01-09 11:27:54,476 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [134024400] [2025-01-09 11:27:54,476 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [134024400] provided 1 perfect and 0 imperfect interpolant sequences [2025-01-09 11:27:54,476 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-01-09 11:27:54,476 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2025-01-09 11:27:54,476 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1844095162] [2025-01-09 11:27:54,476 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-01-09 11:27:54,477 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2025-01-09 11:27:54,477 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-01-09 11:27:54,477 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2025-01-09 11:27:54,477 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2025-01-09 11:27:54,477 INFO L87 Difference]: Start difference. First operand 10167 states and 14392 transitions. Second operand has 5 states, 5 states have (on average 12.6) internal successors, (63), 5 states have internal predecessors, (63), 2 states have call successors, (34), 1 states have call predecessors, (34), 1 states have return successors, (34), 2 states have call predecessors, (34), 2 states have call successors, (34) [2025-01-09 11:27:55,700 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-01-09 11:27:55,701 INFO L93 Difference]: Finished difference Result 21646 states and 30627 transitions. [2025-01-09 11:27:55,701 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2025-01-09 11:27:55,702 INFO L78 Accepts]: Start accepts. Automaton has has 5 states, 5 states have (on average 12.6) internal successors, (63), 5 states have internal predecessors, (63), 2 states have call successors, (34), 1 states have call predecessors, (34), 1 states have return successors, (34), 2 states have call predecessors, (34), 2 states have call successors, (34) Word has length 230 [2025-01-09 11:27:55,702 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-01-09 11:27:55,755 INFO L225 Difference]: With dead ends: 21646 [2025-01-09 11:27:55,756 INFO L226 Difference]: Without dead ends: 11482 [2025-01-09 11:27:55,779 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 11 GetRequests, 6 SyntacticMatches, 0 SemanticMatches, 5 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=17, Invalid=25, Unknown=0, NotChecked=0, Total=42 [2025-01-09 11:27:55,779 INFO L435 NwaCegarLoop]: 149 mSDtfsCounter, 502 mSDsluCounter, 530 mSDsCounter, 0 mSdLazyCounter, 195 mSolverCounterSat, 277 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.3s Time, 0 mProtectedPredicate, 0 mProtectedAction, 502 SdHoareTripleChecker+Valid, 679 SdHoareTripleChecker+Invalid, 472 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 277 IncrementalHoareTripleChecker+Valid, 195 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.4s IncrementalHoareTripleChecker+Time [2025-01-09 11:27:55,780 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [502 Valid, 679 Invalid, 472 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [277 Valid, 195 Invalid, 0 Unknown, 0 Unchecked, 0.4s Time] [2025-01-09 11:27:55,788 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 11482 states. [2025-01-09 11:27:57,355 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 11482 to 11444. [2025-01-09 11:27:57,368 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 11444 states, 8936 states have (on average 1.3341539838854073) internal successors, (11922), 9000 states have internal predecessors, (11922), 2123 states have call successors, (2123), 384 states have call predecessors, (2123), 384 states have return successors, (2123), 2059 states have call predecessors, (2123), 2123 states have call successors, (2123) [2025-01-09 11:27:57,406 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 11444 states to 11444 states and 16168 transitions. [2025-01-09 11:27:57,425 INFO L78 Accepts]: Start accepts. Automaton has 11444 states and 16168 transitions. Word has length 230 [2025-01-09 11:27:57,425 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-01-09 11:27:57,426 INFO L471 AbstractCegarLoop]: Abstraction has 11444 states and 16168 transitions. [2025-01-09 11:27:57,426 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 12.6) internal successors, (63), 5 states have internal predecessors, (63), 2 states have call successors, (34), 1 states have call predecessors, (34), 1 states have return successors, (34), 2 states have call predecessors, (34), 2 states have call successors, (34) [2025-01-09 11:27:57,426 INFO L276 IsEmpty]: Start isEmpty. Operand 11444 states and 16168 transitions. [2025-01-09 11:27:57,429 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 231 [2025-01-09 11:27:57,429 INFO L210 NwaCegarLoop]: Found error trace [2025-01-09 11:27:57,429 INFO L218 NwaCegarLoop]: trace histogram [34, 34, 34, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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 11:27:57,429 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable15 [2025-01-09 11:27:57,430 INFO L396 AbstractCegarLoop]: === Iteration 17 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-01-09 11:27:57,430 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-01-09 11:27:57,430 INFO L85 PathProgramCache]: Analyzing trace with hash 1753322066, now seen corresponding path program 1 times [2025-01-09 11:27:57,430 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-01-09 11:27:57,430 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1036695173] [2025-01-09 11:27:57,430 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-01-09 11:27:57,431 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-01-09 11:27:57,446 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 230 statements into 1 equivalence classes. [2025-01-09 11:27:57,532 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 230 of 230 statements. [2025-01-09 11:27:57,533 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-01-09 11:27:57,533 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-01-09 11:27:58,327 INFO L134 CoverageAnalysis]: Checked inductivity of 2244 backedges. 87 proven. 192 refuted. 0 times theorem prover too weak. 1965 trivial. 0 not checked. [2025-01-09 11:27:58,327 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-01-09 11:27:58,327 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1036695173] [2025-01-09 11:27:58,328 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1036695173] provided 0 perfect and 1 imperfect interpolant sequences [2025-01-09 11:27:58,328 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [2046750077] [2025-01-09 11:27:58,328 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-01-09 11:27:58,328 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-01-09 11:27:58,328 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 [2025-01-09 11:27:58,330 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 11:27:58,332 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 11:27:58,411 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 230 statements into 1 equivalence classes. [2025-01-09 11:27:58,473 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 230 of 230 statements. [2025-01-09 11:27:58,474 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-01-09 11:27:58,474 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-01-09 11:27:58,477 INFO L256 TraceCheckSpWp]: Trace formula consists of 512 conjuncts, 25 conjuncts are in the unsatisfiable core [2025-01-09 11:27:58,484 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-01-09 11:27:59,678 INFO L134 CoverageAnalysis]: Checked inductivity of 2244 backedges. 1196 proven. 285 refuted. 0 times theorem prover too weak. 763 trivial. 0 not checked. [2025-01-09 11:27:59,678 INFO L312 TraceCheckSpWp]: Computing backward predicates... [2025-01-09 11:28:00,686 INFO L134 CoverageAnalysis]: Checked inductivity of 2244 backedges. 84 proven. 204 refuted. 0 times theorem prover too weak. 1956 trivial. 0 not checked. [2025-01-09 11:28:00,686 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [2046750077] provided 0 perfect and 2 imperfect interpolant sequences [2025-01-09 11:28:00,686 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2025-01-09 11:28:00,686 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [8, 15, 12] total 29 [2025-01-09 11:28:00,687 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1956776575] [2025-01-09 11:28:00,687 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2025-01-09 11:28:00,688 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 29 states [2025-01-09 11:28:00,688 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-01-09 11:28:00,690 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 29 interpolants. [2025-01-09 11:28:00,690 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=192, Invalid=620, Unknown=0, NotChecked=0, Total=812 [2025-01-09 11:28:00,690 INFO L87 Difference]: Start difference. First operand 11444 states and 16168 transitions. Second operand has 29 states, 29 states have (on average 5.103448275862069) internal successors, (148), 29 states have internal predecessors, (148), 11 states have call successors, (89), 5 states have call predecessors, (89), 11 states have return successors, (91), 10 states have call predecessors, (91), 11 states have call successors, (91) [2025-01-09 11:28:02,790 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-01-09 11:28:02,791 INFO L93 Difference]: Finished difference Result 19133 states and 26451 transitions. [2025-01-09 11:28:02,791 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 28 states. [2025-01-09 11:28:02,791 INFO L78 Accepts]: Start accepts. Automaton has has 29 states, 29 states have (on average 5.103448275862069) internal successors, (148), 29 states have internal predecessors, (148), 11 states have call successors, (89), 5 states have call predecessors, (89), 11 states have return successors, (91), 10 states have call predecessors, (91), 11 states have call successors, (91) Word has length 230 [2025-01-09 11:28:02,792 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-01-09 11:28:02,832 INFO L225 Difference]: With dead ends: 19133 [2025-01-09 11:28:02,832 INFO L226 Difference]: Without dead ends: 9970 [2025-01-09 11:28:02,850 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 501 GetRequests, 447 SyntacticMatches, 1 SemanticMatches, 53 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 653 ImplicationChecksByTransitivity, 1.0s TimeCoverageRelationStatistics Valid=884, Invalid=2086, Unknown=0, NotChecked=0, Total=2970 [2025-01-09 11:28:02,851 INFO L435 NwaCegarLoop]: 128 mSDtfsCounter, 1216 mSDsluCounter, 441 mSDsCounter, 0 mSdLazyCounter, 708 mSolverCounterSat, 244 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.5s Time, 0 mProtectedPredicate, 0 mProtectedAction, 1216 SdHoareTripleChecker+Valid, 569 SdHoareTripleChecker+Invalid, 952 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 244 IncrementalHoareTripleChecker+Valid, 708 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.5s IncrementalHoareTripleChecker+Time [2025-01-09 11:28:02,852 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [1216 Valid, 569 Invalid, 952 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [244 Valid, 708 Invalid, 0 Unknown, 0 Unchecked, 0.5s Time] [2025-01-09 11:28:02,859 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 9970 states. [2025-01-09 11:28:03,869 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 9970 to 9078. [2025-01-09 11:28:03,876 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 9078 states, 6953 states have (on average 1.287357974974831) internal successors, (8951), 7006 states have internal predecessors, (8951), 1649 states have call successors, (1649), 475 states have call predecessors, (1649), 475 states have return successors, (1649), 1596 states have call predecessors, (1649), 1649 states have call successors, (1649) [2025-01-09 11:28:03,893 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 9078 states to 9078 states and 12249 transitions. [2025-01-09 11:28:03,907 INFO L78 Accepts]: Start accepts. Automaton has 9078 states and 12249 transitions. Word has length 230 [2025-01-09 11:28:03,907 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-01-09 11:28:03,908 INFO L471 AbstractCegarLoop]: Abstraction has 9078 states and 12249 transitions. [2025-01-09 11:28:03,908 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 29 states, 29 states have (on average 5.103448275862069) internal successors, (148), 29 states have internal predecessors, (148), 11 states have call successors, (89), 5 states have call predecessors, (89), 11 states have return successors, (91), 10 states have call predecessors, (91), 11 states have call successors, (91) [2025-01-09 11:28:03,908 INFO L276 IsEmpty]: Start isEmpty. Operand 9078 states and 12249 transitions. [2025-01-09 11:28:03,910 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 232 [2025-01-09 11:28:03,910 INFO L210 NwaCegarLoop]: Found error trace [2025-01-09 11:28:03,911 INFO L218 NwaCegarLoop]: trace histogram [34, 34, 34, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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 11:28:03,919 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (7)] Ended with exit code 0 [2025-01-09 11:28:04,111 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 7 /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable16 [2025-01-09 11:28:04,112 INFO L396 AbstractCegarLoop]: === Iteration 18 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-01-09 11:28:04,112 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-01-09 11:28:04,112 INFO L85 PathProgramCache]: Analyzing trace with hash 1659747660, now seen corresponding path program 1 times [2025-01-09 11:28:04,113 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-01-09 11:28:04,113 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [952377957] [2025-01-09 11:28:04,113 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-01-09 11:28:04,113 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-01-09 11:28:04,126 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 231 statements into 1 equivalence classes. [2025-01-09 11:28:04,160 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 231 of 231 statements. [2025-01-09 11:28:04,160 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-01-09 11:28:04,160 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-01-09 11:28:04,446 INFO L134 CoverageAnalysis]: Checked inductivity of 2244 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 2244 trivial. 0 not checked. [2025-01-09 11:28:04,447 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-01-09 11:28:04,447 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [952377957] [2025-01-09 11:28:04,447 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [952377957] provided 1 perfect and 0 imperfect interpolant sequences [2025-01-09 11:28:04,447 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-01-09 11:28:04,447 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [8] imperfect sequences [] total 8 [2025-01-09 11:28:04,447 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [988335310] [2025-01-09 11:28:04,447 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-01-09 11:28:04,448 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 8 states [2025-01-09 11:28:04,449 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-01-09 11:28:04,449 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2025-01-09 11:28:04,449 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=14, Invalid=42, Unknown=0, NotChecked=0, Total=56 [2025-01-09 11:28:04,450 INFO L87 Difference]: Start difference. First operand 9078 states and 12249 transitions. Second operand has 8 states, 8 states have (on average 8.0) internal successors, (64), 8 states have internal predecessors, (64), 2 states have call successors, (34), 1 states have call predecessors, (34), 1 states have return successors, (34), 2 states have call predecessors, (34), 2 states have call successors, (34) [2025-01-09 11:28:06,214 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-01-09 11:28:06,214 INFO L93 Difference]: Finished difference Result 18215 states and 24571 transitions. [2025-01-09 11:28:06,215 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2025-01-09 11:28:06,215 INFO L78 Accepts]: Start accepts. Automaton has has 8 states, 8 states have (on average 8.0) internal successors, (64), 8 states have internal predecessors, (64), 2 states have call successors, (34), 1 states have call predecessors, (34), 1 states have return successors, (34), 2 states have call predecessors, (34), 2 states have call successors, (34) Word has length 231 [2025-01-09 11:28:06,215 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-01-09 11:28:06,257 INFO L225 Difference]: With dead ends: 18215 [2025-01-09 11:28:06,257 INFO L226 Difference]: Without dead ends: 9140 [2025-01-09 11:28:06,273 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 16 GetRequests, 4 SyntacticMatches, 0 SemanticMatches, 12 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 13 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=57, Invalid=125, Unknown=0, NotChecked=0, Total=182 [2025-01-09 11:28:06,274 INFO L435 NwaCegarLoop]: 170 mSDtfsCounter, 549 mSDsluCounter, 576 mSDsCounter, 0 mSdLazyCounter, 434 mSolverCounterSat, 345 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.6s Time, 0 mProtectedPredicate, 0 mProtectedAction, 549 SdHoareTripleChecker+Valid, 746 SdHoareTripleChecker+Invalid, 779 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 345 IncrementalHoareTripleChecker+Valid, 434 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.7s IncrementalHoareTripleChecker+Time [2025-01-09 11:28:06,274 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [549 Valid, 746 Invalid, 779 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [345 Valid, 434 Invalid, 0 Unknown, 0 Unchecked, 0.7s Time] [2025-01-09 11:28:06,279 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 9140 states. [2025-01-09 11:28:07,630 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 9140 to 9110. [2025-01-09 11:28:07,636 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 9110 states, 6985 states have (on average 1.285612025769506) internal successors, (8980), 7038 states have internal predecessors, (8980), 1649 states have call successors, (1649), 475 states have call predecessors, (1649), 475 states have return successors, (1649), 1596 states have call predecessors, (1649), 1649 states have call successors, (1649) [2025-01-09 11:28:07,657 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 9110 states to 9110 states and 12278 transitions. [2025-01-09 11:28:07,673 INFO L78 Accepts]: Start accepts. Automaton has 9110 states and 12278 transitions. Word has length 231 [2025-01-09 11:28:07,673 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-01-09 11:28:07,674 INFO L471 AbstractCegarLoop]: Abstraction has 9110 states and 12278 transitions. [2025-01-09 11:28:07,674 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 8 states, 8 states have (on average 8.0) internal successors, (64), 8 states have internal predecessors, (64), 2 states have call successors, (34), 1 states have call predecessors, (34), 1 states have return successors, (34), 2 states have call predecessors, (34), 2 states have call successors, (34) [2025-01-09 11:28:07,674 INFO L276 IsEmpty]: Start isEmpty. Operand 9110 states and 12278 transitions. [2025-01-09 11:28:07,676 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 232 [2025-01-09 11:28:07,676 INFO L210 NwaCegarLoop]: Found error trace [2025-01-09 11:28:07,676 INFO L218 NwaCegarLoop]: trace histogram [34, 34, 34, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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 11:28:07,677 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable17 [2025-01-09 11:28:07,677 INFO L396 AbstractCegarLoop]: === Iteration 19 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-01-09 11:28:07,678 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-01-09 11:28:07,679 INFO L85 PathProgramCache]: Analyzing trace with hash -1883647921, now seen corresponding path program 1 times [2025-01-09 11:28:07,679 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-01-09 11:28:07,679 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [46777950] [2025-01-09 11:28:07,679 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-01-09 11:28:07,679 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-01-09 11:28:07,693 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 231 statements into 1 equivalence classes. [2025-01-09 11:28:07,721 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 231 of 231 statements. [2025-01-09 11:28:07,722 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-01-09 11:28:07,722 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-01-09 11:28:07,895 INFO L134 CoverageAnalysis]: Checked inductivity of 2244 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 2244 trivial. 0 not checked. [2025-01-09 11:28:07,896 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-01-09 11:28:07,896 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [46777950] [2025-01-09 11:28:07,896 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [46777950] provided 1 perfect and 0 imperfect interpolant sequences [2025-01-09 11:28:07,896 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-01-09 11:28:07,896 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2025-01-09 11:28:07,896 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [398186925] [2025-01-09 11:28:07,896 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-01-09 11:28:07,897 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2025-01-09 11:28:07,897 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-01-09 11:28:07,898 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2025-01-09 11:28:07,898 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2025-01-09 11:28:07,898 INFO L87 Difference]: Start difference. First operand 9110 states and 12278 transitions. Second operand has 5 states, 5 states have (on average 12.8) internal successors, (64), 5 states have internal predecessors, (64), 1 states have call successors, (34), 1 states have call predecessors, (34), 1 states have return successors, (34), 1 states have call predecessors, (34), 1 states have call successors, (34) [2025-01-09 11:28:10,046 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-01-09 11:28:10,046 INFO L93 Difference]: Finished difference Result 23253 states and 31327 transitions. [2025-01-09 11:28:10,047 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2025-01-09 11:28:10,047 INFO L78 Accepts]: Start accepts. Automaton has has 5 states, 5 states have (on average 12.8) internal successors, (64), 5 states have internal predecessors, (64), 1 states have call successors, (34), 1 states have call predecessors, (34), 1 states have return successors, (34), 1 states have call predecessors, (34), 1 states have call successors, (34) Word has length 231 [2025-01-09 11:28:10,047 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-01-09 11:28:10,113 INFO L225 Difference]: With dead ends: 23253 [2025-01-09 11:28:10,113 INFO L226 Difference]: Without dead ends: 15026 [2025-01-09 11:28:10,135 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 9 GetRequests, 4 SyntacticMatches, 0 SemanticMatches, 5 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=15, Invalid=27, Unknown=0, NotChecked=0, Total=42 [2025-01-09 11:28:10,136 INFO L435 NwaCegarLoop]: 213 mSDtfsCounter, 170 mSDsluCounter, 348 mSDsCounter, 0 mSdLazyCounter, 391 mSolverCounterSat, 2 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.3s Time, 0 mProtectedPredicate, 0 mProtectedAction, 170 SdHoareTripleChecker+Valid, 561 SdHoareTripleChecker+Invalid, 393 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 2 IncrementalHoareTripleChecker+Valid, 391 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.4s IncrementalHoareTripleChecker+Time [2025-01-09 11:28:10,136 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [170 Valid, 561 Invalid, 393 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [2 Valid, 391 Invalid, 0 Unknown, 0 Unchecked, 0.4s Time] [2025-01-09 11:28:10,147 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 15026 states. [2025-01-09 11:28:12,243 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 15026 to 13249. [2025-01-09 11:28:12,251 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 13249 states, 10077 states have (on average 1.2784558896496974) internal successors, (12883), 10156 states have internal predecessors, (12883), 2460 states have call successors, (2460), 711 states have call predecessors, (2460), 711 states have return successors, (2460), 2381 states have call predecessors, (2460), 2460 states have call successors, (2460) [2025-01-09 11:28:12,272 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 13249 states to 13249 states and 17803 transitions. [2025-01-09 11:28:12,288 INFO L78 Accepts]: Start accepts. Automaton has 13249 states and 17803 transitions. Word has length 231 [2025-01-09 11:28:12,288 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-01-09 11:28:12,288 INFO L471 AbstractCegarLoop]: Abstraction has 13249 states and 17803 transitions. [2025-01-09 11:28:12,288 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 12.8) internal successors, (64), 5 states have internal predecessors, (64), 1 states have call successors, (34), 1 states have call predecessors, (34), 1 states have return successors, (34), 1 states have call predecessors, (34), 1 states have call successors, (34) [2025-01-09 11:28:12,288 INFO L276 IsEmpty]: Start isEmpty. Operand 13249 states and 17803 transitions. [2025-01-09 11:28:12,291 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 233 [2025-01-09 11:28:12,291 INFO L210 NwaCegarLoop]: Found error trace [2025-01-09 11:28:12,291 INFO L218 NwaCegarLoop]: trace histogram [34, 34, 34, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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 11:28:12,291 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable18 [2025-01-09 11:28:12,291 INFO L396 AbstractCegarLoop]: === Iteration 20 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-01-09 11:28:12,291 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-01-09 11:28:12,292 INFO L85 PathProgramCache]: Analyzing trace with hash 751306769, now seen corresponding path program 1 times [2025-01-09 11:28:12,292 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-01-09 11:28:12,292 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [110395588] [2025-01-09 11:28:12,292 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-01-09 11:28:12,292 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-01-09 11:28:12,304 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 232 statements into 1 equivalence classes. [2025-01-09 11:28:12,322 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 232 of 232 statements. [2025-01-09 11:28:12,322 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-01-09 11:28:12,322 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-01-09 11:28:12,573 INFO L134 CoverageAnalysis]: Checked inductivity of 2244 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 2244 trivial. 0 not checked. [2025-01-09 11:28:12,574 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-01-09 11:28:12,574 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [110395588] [2025-01-09 11:28:12,574 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [110395588] provided 1 perfect and 0 imperfect interpolant sequences [2025-01-09 11:28:12,574 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-01-09 11:28:12,574 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2025-01-09 11:28:12,575 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [303333687] [2025-01-09 11:28:12,575 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-01-09 11:28:12,575 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 7 states [2025-01-09 11:28:12,575 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-01-09 11:28:12,576 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2025-01-09 11:28:12,576 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=15, Invalid=27, Unknown=0, NotChecked=0, Total=42 [2025-01-09 11:28:12,576 INFO L87 Difference]: Start difference. First operand 13249 states and 17803 transitions. Second operand has 7 states, 7 states have (on average 9.285714285714286) internal successors, (65), 7 states have internal predecessors, (65), 2 states have call successors, (34), 1 states have call predecessors, (34), 1 states have return successors, (34), 2 states have call predecessors, (34), 2 states have call successors, (34) [2025-01-09 11:28:14,600 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-01-09 11:28:14,600 INFO L93 Difference]: Finished difference Result 21718 states and 29224 transitions. [2025-01-09 11:28:14,600 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2025-01-09 11:28:14,600 INFO L78 Accepts]: Start accepts. Automaton has has 7 states, 7 states have (on average 9.285714285714286) internal successors, (65), 7 states have internal predecessors, (65), 2 states have call successors, (34), 1 states have call predecessors, (34), 1 states have return successors, (34), 2 states have call predecessors, (34), 2 states have call successors, (34) Word has length 232 [2025-01-09 11:28:14,601 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-01-09 11:28:14,663 INFO L225 Difference]: With dead ends: 21718 [2025-01-09 11:28:14,663 INFO L226 Difference]: Without dead ends: 13277 [2025-01-09 11:28:14,684 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 14 GetRequests, 6 SyntacticMatches, 0 SemanticMatches, 8 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 6 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=36, Invalid=54, Unknown=0, NotChecked=0, Total=90 [2025-01-09 11:28:14,685 INFO L435 NwaCegarLoop]: 155 mSDtfsCounter, 701 mSDsluCounter, 613 mSDsCounter, 0 mSdLazyCounter, 347 mSolverCounterSat, 514 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.6s Time, 0 mProtectedPredicate, 0 mProtectedAction, 701 SdHoareTripleChecker+Valid, 768 SdHoareTripleChecker+Invalid, 861 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 514 IncrementalHoareTripleChecker+Valid, 347 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.7s IncrementalHoareTripleChecker+Time [2025-01-09 11:28:14,685 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [701 Valid, 768 Invalid, 861 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [514 Valid, 347 Invalid, 0 Unknown, 0 Unchecked, 0.7s Time] [2025-01-09 11:28:14,696 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 13277 states. [2025-01-09 11:28:17,014 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 13277 to 13233. [2025-01-09 11:28:17,026 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 13233 states, 10061 states have (on average 1.2767120564556207) internal successors, (12845), 10140 states have internal predecessors, (12845), 2460 states have call successors, (2460), 711 states have call predecessors, (2460), 711 states have return successors, (2460), 2381 states have call predecessors, (2460), 2460 states have call successors, (2460) [2025-01-09 11:28:17,050 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 13233 states to 13233 states and 17765 transitions. [2025-01-09 11:28:17,068 INFO L78 Accepts]: Start accepts. Automaton has 13233 states and 17765 transitions. Word has length 232 [2025-01-09 11:28:17,069 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-01-09 11:28:17,069 INFO L471 AbstractCegarLoop]: Abstraction has 13233 states and 17765 transitions. [2025-01-09 11:28:17,069 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 7 states, 7 states have (on average 9.285714285714286) internal successors, (65), 7 states have internal predecessors, (65), 2 states have call successors, (34), 1 states have call predecessors, (34), 1 states have return successors, (34), 2 states have call predecessors, (34), 2 states have call successors, (34) [2025-01-09 11:28:17,069 INFO L276 IsEmpty]: Start isEmpty. Operand 13233 states and 17765 transitions. [2025-01-09 11:28:17,071 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 233 [2025-01-09 11:28:17,071 INFO L210 NwaCegarLoop]: Found error trace [2025-01-09 11:28:17,072 INFO L218 NwaCegarLoop]: trace histogram [34, 34, 34, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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 11:28:17,072 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable19 [2025-01-09 11:28:17,072 INFO L396 AbstractCegarLoop]: === Iteration 21 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-01-09 11:28:17,072 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-01-09 11:28:17,072 INFO L85 PathProgramCache]: Analyzing trace with hash 1026066383, now seen corresponding path program 1 times [2025-01-09 11:28:17,072 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-01-09 11:28:17,072 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1277595698] [2025-01-09 11:28:17,073 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-01-09 11:28:17,073 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-01-09 11:28:17,086 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 232 statements into 1 equivalence classes. [2025-01-09 11:28:17,104 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 232 of 232 statements. [2025-01-09 11:28:17,104 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-01-09 11:28:17,104 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-01-09 11:28:17,471 INFO L134 CoverageAnalysis]: Checked inductivity of 2244 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 2244 trivial. 0 not checked. [2025-01-09 11:28:17,472 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-01-09 11:28:17,472 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1277595698] [2025-01-09 11:28:17,472 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1277595698] provided 1 perfect and 0 imperfect interpolant sequences [2025-01-09 11:28:17,472 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-01-09 11:28:17,472 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [9] imperfect sequences [] total 9 [2025-01-09 11:28:17,472 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1155736078] [2025-01-09 11:28:17,472 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-01-09 11:28:17,473 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 9 states [2025-01-09 11:28:17,473 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-01-09 11:28:17,473 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2025-01-09 11:28:17,473 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=15, Invalid=57, Unknown=0, NotChecked=0, Total=72 [2025-01-09 11:28:17,473 INFO L87 Difference]: Start difference. First operand 13233 states and 17765 transitions. Second operand has 9 states, 9 states have (on average 7.222222222222222) internal successors, (65), 9 states have internal predecessors, (65), 2 states have call successors, (34), 1 states have call predecessors, (34), 1 states have return successors, (34), 2 states have call predecessors, (34), 2 states have call successors, (34)