./Ultimate.py --spec ../sv-benchmarks/c/properties/unreach-call.prp --file ../sv-benchmarks/c/hardness-nfm22/hardness_fillercode_fillercodesize_ps-cn-250_file-72.i --full-output --architecture 32bit -------------------------------------------------------------------------------- Checking for ERROR reachability Using default analysis Version c00e63dc Calling Ultimate with: /root/.sdkman/candidates/java/21.0.5-tem/bin/java -Dosgi.configuration.area=/storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/data/config -Xmx15G -Xms4m -jar /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/plugins/org.eclipse.equinox.launcher_1.6.800.v20240513-1750.jar -data @noDefault -ultimatedata /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/data -tc /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/config/AutomizerReach.xml -i ../sv-benchmarks/c/hardness-nfm22/hardness_fillercode_fillercodesize_ps-cn-250_file-72.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 5d61e8fa49d21946be87d65ea6f560fd70d33fb1241a73bd802d2afa2c954396 --- Real Ultimate output --- This is Ultimate 0.3.0-?-c00e63d-m [2025-02-05 21:38:58,258 INFO L188 SettingsManager]: Resetting all preferences to default values... [2025-02-05 21:38:58,314 INFO L114 SettingsManager]: Loading settings from /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/config/svcomp-Reach-32bit-Automizer_Default.epf [2025-02-05 21:38:58,322 WARN L101 SettingsManager]: Preference file contains the following unknown settings: [2025-02-05 21:38:58,322 WARN L103 SettingsManager]: * de.uni_freiburg.informatik.ultimate.core.Log level for class [2025-02-05 21:38:58,349 INFO L130 SettingsManager]: Preferences different from defaults after loading the file: [2025-02-05 21:38:58,349 INFO L151 SettingsManager]: Preferences of UltimateCore differ from their defaults: [2025-02-05 21:38:58,349 INFO L153 SettingsManager]: * Log level for class=de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher=ERROR; [2025-02-05 21:38:58,350 INFO L151 SettingsManager]: Preferences of Boogie Preprocessor differ from their defaults: [2025-02-05 21:38:58,350 INFO L153 SettingsManager]: * Use memory slicer=true [2025-02-05 21:38:58,350 INFO L151 SettingsManager]: Preferences of Boogie Procedure Inliner differ from their defaults: [2025-02-05 21:38:58,350 INFO L153 SettingsManager]: * Ignore calls to procedures called more than once=ONLY_FOR_SEQUENTIAL_PROGRAMS [2025-02-05 21:38:58,350 INFO L151 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2025-02-05 21:38:58,350 INFO L153 SettingsManager]: * Create parallel compositions if possible=false [2025-02-05 21:38:58,350 INFO L153 SettingsManager]: * Use SBE=true [2025-02-05 21:38:58,350 INFO L151 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2025-02-05 21:38:58,350 INFO L153 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2025-02-05 21:38:58,350 INFO L153 SettingsManager]: * sizeof long=4 [2025-02-05 21:38:58,350 INFO L153 SettingsManager]: * Overapproximate operations on floating types=true [2025-02-05 21:38:58,350 INFO L153 SettingsManager]: * sizeof POINTER=4 [2025-02-05 21:38:58,351 INFO L153 SettingsManager]: * Check division by zero=IGNORE [2025-02-05 21:38:58,351 INFO L153 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2025-02-05 21:38:58,351 INFO L153 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2025-02-05 21:38:58,351 INFO L153 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2025-02-05 21:38:58,351 INFO L153 SettingsManager]: * sizeof long double=12 [2025-02-05 21:38:58,351 INFO L153 SettingsManager]: * Check if freed pointer was valid=false [2025-02-05 21:38:58,351 INFO L153 SettingsManager]: * Behaviour of calls to undefined functions=OVERAPPROXIMATE_BEHAVIOUR [2025-02-05 21:38:58,351 INFO L153 SettingsManager]: * Use constant arrays=true [2025-02-05 21:38:58,351 INFO L151 SettingsManager]: Preferences of IcfgBuilder differ from their defaults: [2025-02-05 21:38:58,351 INFO L153 SettingsManager]: * Size of a code block=SequenceOfStatements [2025-02-05 21:38:58,351 INFO L153 SettingsManager]: * Only consider context switches at boundaries of atomic blocks=true [2025-02-05 21:38:58,351 INFO L153 SettingsManager]: * SMT solver=External_DefaultMode [2025-02-05 21:38:58,351 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2025-02-05 21:38:58,351 INFO L151 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2025-02-05 21:38:58,351 INFO L153 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2025-02-05 21:38:58,351 INFO L153 SettingsManager]: * Compute procedure contracts=false [2025-02-05 21:38:58,351 INFO L153 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopHeads [2025-02-05 21:38:58,353 INFO L153 SettingsManager]: * Trace refinement strategy=CAMEL [2025-02-05 21:38:58,354 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2025-02-05 21:38:58,354 INFO L153 SettingsManager]: * Apply one-shot large block encoding in concurrent analysis=false [2025-02-05 21:38:58,354 INFO L153 SettingsManager]: * Automaton type used in concurrency analysis=PETRI_NET [2025-02-05 21:38:58,354 INFO L153 SettingsManager]: * Order on configurations for Petri net unfoldings=DBO [2025-02-05 21:38:58,354 INFO L153 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode [2025-02-05 21:38:58,354 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 -> 5d61e8fa49d21946be87d65ea6f560fd70d33fb1241a73bd802d2afa2c954396 [2025-02-05 21:38:58,579 INFO L75 nceAwareModelManager]: Repository-Root is: /tmp [2025-02-05 21:38:58,586 INFO L261 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2025-02-05 21:38:58,588 INFO L217 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2025-02-05 21:38:58,589 INFO L270 PluginConnector]: Initializing CDTParser... [2025-02-05 21:38:58,589 INFO L274 PluginConnector]: CDTParser initialized [2025-02-05 21:38:58,591 INFO L431 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/../sv-benchmarks/c/hardness-nfm22/hardness_fillercode_fillercodesize_ps-cn-250_file-72.i [2025-02-05 21:38:59,782 INFO L533 CDTParser]: Created temporary CDT project at /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/data/a1f9d761e/afba302b73184a71994f388da6b160dd/FLAGe3f2da029 [2025-02-05 21:39:00,094 INFO L384 CDTParser]: Found 1 translation units. [2025-02-05 21:39:00,094 INFO L180 CDTParser]: Scanning /storage/repos/ultimate-jdk21/releaseScripts/default/sv-benchmarks/c/hardness-nfm22/hardness_fillercode_fillercodesize_ps-cn-250_file-72.i [2025-02-05 21:39:00,111 INFO L427 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/data/a1f9d761e/afba302b73184a71994f388da6b160dd/FLAGe3f2da029 [2025-02-05 21:39:00,367 INFO L435 CDTParser]: Successfully deleted /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/data/a1f9d761e/afba302b73184a71994f388da6b160dd [2025-02-05 21:39:00,370 INFO L299 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2025-02-05 21:39:00,372 INFO L133 ToolchainWalker]: Walking toolchain with 6 elements. [2025-02-05 21:39:00,373 INFO L112 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2025-02-05 21:39:00,373 INFO L270 PluginConnector]: Initializing CACSL2BoogieTranslator... [2025-02-05 21:39:00,377 INFO L274 PluginConnector]: CACSL2BoogieTranslator initialized [2025-02-05 21:39:00,377 INFO L184 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 05.02 09:39:00" (1/1) ... [2025-02-05 21:39:00,378 INFO L204 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@1046b7ca and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 05.02 09:39:00, skipping insertion in model container [2025-02-05 21:39:00,378 INFO L184 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 05.02 09:39:00" (1/1) ... [2025-02-05 21:39:00,402 INFO L175 MainTranslator]: Built tables and reachable declarations [2025-02-05 21:39:00,595 WARN L250 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate-jdk21/releaseScripts/default/sv-benchmarks/c/hardness-nfm22/hardness_fillercode_fillercodesize_ps-cn-250_file-72.i[916,929] [2025-02-05 21:39:00,814 INFO L210 PostProcessor]: Analyzing one entry point: main [2025-02-05 21:39:00,844 INFO L200 MainTranslator]: Completed pre-run [2025-02-05 21:39:00,862 WARN L250 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate-jdk21/releaseScripts/default/sv-benchmarks/c/hardness-nfm22/hardness_fillercode_fillercodesize_ps-cn-250_file-72.i[916,929] [2025-02-05 21:39:00,961 INFO L210 PostProcessor]: Analyzing one entry point: main [2025-02-05 21:39:00,990 INFO L204 MainTranslator]: Completed translation [2025-02-05 21:39:00,991 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 05.02 09:39:00 WrapperNode [2025-02-05 21:39:00,995 INFO L131 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2025-02-05 21:39:00,997 INFO L112 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2025-02-05 21:39:01,000 INFO L270 PluginConnector]: Initializing Boogie Procedure Inliner... [2025-02-05 21:39:01,001 INFO L274 PluginConnector]: Boogie Procedure Inliner initialized [2025-02-05 21:39:01,005 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 05.02 09:39:00" (1/1) ... [2025-02-05 21:39:01,035 INFO L184 PluginConnector]: Executing the observer Inliner from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 05.02 09:39:00" (1/1) ... [2025-02-05 21:39:01,134 INFO L138 Inliner]: procedures = 26, calls = 80, calls flagged for inlining = 8, calls inlined = 8, statements flattened = 505 [2025-02-05 21:39:01,134 INFO L131 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2025-02-05 21:39:01,135 INFO L112 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2025-02-05 21:39:01,135 INFO L270 PluginConnector]: Initializing Boogie Preprocessor... [2025-02-05 21:39:01,135 INFO L274 PluginConnector]: Boogie Preprocessor initialized [2025-02-05 21:39:01,145 INFO L184 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 05.02 09:39:00" (1/1) ... [2025-02-05 21:39:01,147 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 05.02 09:39:00" (1/1) ... [2025-02-05 21:39:01,157 INFO L184 PluginConnector]: Executing the observer MemorySlicer from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 05.02 09:39:00" (1/1) ... [2025-02-05 21:39:01,203 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-02-05 21:39:01,212 INFO L184 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 05.02 09:39:00" (1/1) ... [2025-02-05 21:39:01,212 INFO L184 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 05.02 09:39:00" (1/1) ... [2025-02-05 21:39:01,245 INFO L184 PluginConnector]: Executing the observer ReplaceArrayAssignments from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 05.02 09:39:00" (1/1) ... [2025-02-05 21:39:01,253 INFO L184 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 05.02 09:39:00" (1/1) ... [2025-02-05 21:39:01,263 INFO L184 PluginConnector]: Executing the observer LTLStepAnnotator from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 05.02 09:39:00" (1/1) ... [2025-02-05 21:39:01,274 INFO L184 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 05.02 09:39:00" (1/1) ... [2025-02-05 21:39:01,286 INFO L131 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2025-02-05 21:39:01,291 INFO L112 PluginConnector]: ------------------------IcfgBuilder---------------------------- [2025-02-05 21:39:01,291 INFO L270 PluginConnector]: Initializing IcfgBuilder... [2025-02-05 21:39:01,291 INFO L274 PluginConnector]: IcfgBuilder initialized [2025-02-05 21:39:01,292 INFO L184 PluginConnector]: Executing the observer IcfgBuilderObserver from plugin IcfgBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 05.02 09:39:00" (1/1) ... [2025-02-05 21:39:01,300 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2025-02-05 21:39:01,320 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 [2025-02-05 21:39:01,333 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-02-05 21:39:01,338 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-02-05 21:39:01,371 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocInit [2025-02-05 21:39:01,372 INFO L130 BoogieDeclarations]: Found specification of procedure assume_abort_if_not [2025-02-05 21:39:01,372 INFO L138 BoogieDeclarations]: Found implementation of procedure assume_abort_if_not [2025-02-05 21:39:01,372 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int#0 [2025-02-05 21:39:01,372 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2025-02-05 21:39:01,372 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2025-02-05 21:39:01,529 INFO L257 CfgBuilder]: Building ICFG [2025-02-05 21:39:01,533 INFO L287 CfgBuilder]: Building CFG for each procedure with an implementation [2025-02-05 21:39:02,210 INFO L? ?]: Removed 10 outVars from TransFormulas that were not future-live. [2025-02-05 21:39:02,210 INFO L308 CfgBuilder]: Performing block encoding [2025-02-05 21:39:02,227 INFO L332 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2025-02-05 21:39:02,228 INFO L337 CfgBuilder]: Removed 0 assume(true) statements. [2025-02-05 21:39:02,228 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.icfgbuilder CFG 05.02 09:39:02 BoogieIcfgContainer [2025-02-05 21:39:02,228 INFO L131 PluginConnector]: ------------------------ END IcfgBuilder---------------------------- [2025-02-05 21:39:02,230 INFO L112 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2025-02-05 21:39:02,230 INFO L270 PluginConnector]: Initializing TraceAbstraction... [2025-02-05 21:39:02,233 INFO L274 PluginConnector]: TraceAbstraction initialized [2025-02-05 21:39:02,233 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 05.02 09:39:00" (1/3) ... [2025-02-05 21:39:02,233 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@6bb4be66 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 05.02 09:39:02, skipping insertion in model container [2025-02-05 21:39:02,233 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 05.02 09:39:00" (2/3) ... [2025-02-05 21:39:02,234 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@6bb4be66 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 05.02 09:39:02, skipping insertion in model container [2025-02-05 21:39:02,234 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.icfgbuilder CFG 05.02 09:39:02" (3/3) ... [2025-02-05 21:39:02,235 INFO L128 eAbstractionObserver]: Analyzing ICFG hardness_fillercode_fillercodesize_ps-cn-250_file-72.i [2025-02-05 21:39:02,244 INFO L216 ceAbstractionStarter]: Automizer settings: Hoare:LoopHeads NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2025-02-05 21:39:02,246 INFO L151 ceAbstractionStarter]: Applying trace abstraction to ICFG hardness_fillercode_fillercodesize_ps-cn-250_file-72.i that has 2 procedures, 211 locations, 1 initial locations, 1 loop locations, and 1 error locations. [2025-02-05 21:39:02,283 INFO L332 AbstractCegarLoop]: ======== Iteration 0 == of CEGAR loop == AllErrorsAtOnce ======== [2025-02-05 21:39:02,291 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;@2bcce287, mLbeIndependenceSettings=[IndependenceType=SEMANTIC, AbstractionType=NONE, UseConditional=false, UseSemiCommutativity=true, Solver=Z3, SolverTimeout=1000ms] [2025-02-05 21:39:02,291 INFO L334 AbstractCegarLoop]: Starting to check reachability of 1 error locations. [2025-02-05 21:39:02,293 INFO L276 IsEmpty]: Start isEmpty. Operand has 211 states, 141 states have (on average 1.5602836879432624) internal successors, (220), 142 states have internal predecessors, (220), 67 states have call successors, (67), 1 states have call predecessors, (67), 1 states have return successors, (67), 67 states have call predecessors, (67), 67 states have call successors, (67) [2025-02-05 21:39:02,306 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 429 [2025-02-05 21:39:02,307 INFO L210 NwaCegarLoop]: Found error trace [2025-02-05 21:39:02,307 INFO L218 NwaCegarLoop]: trace histogram [67, 67, 67, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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-02-05 21:39:02,308 INFO L396 AbstractCegarLoop]: === Iteration 1 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-02-05 21:39:02,311 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-02-05 21:39:02,311 INFO L85 PathProgramCache]: Analyzing trace with hash 129389065, now seen corresponding path program 1 times [2025-02-05 21:39:02,316 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-02-05 21:39:02,316 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2084493708] [2025-02-05 21:39:02,316 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-02-05 21:39:02,317 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-02-05 21:39:02,391 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 428 statements into 1 equivalence classes. [2025-02-05 21:39:02,415 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 428 of 428 statements. [2025-02-05 21:39:02,416 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-02-05 21:39:02,416 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-02-05 21:39:02,713 INFO L134 CoverageAnalysis]: Checked inductivity of 8844 backedges. 0 proven. 132 refuted. 0 times theorem prover too weak. 8712 trivial. 0 not checked. [2025-02-05 21:39:02,713 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-02-05 21:39:02,713 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2084493708] [2025-02-05 21:39:02,714 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [2084493708] provided 0 perfect and 1 imperfect interpolant sequences [2025-02-05 21:39:02,714 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [2070953993] [2025-02-05 21:39:02,714 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-02-05 21:39:02,715 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-02-05 21:39:02,715 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 [2025-02-05 21:39:02,720 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-02-05 21:39:02,721 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-02-05 21:39:02,828 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 428 statements into 1 equivalence classes. [2025-02-05 21:39:02,949 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 428 of 428 statements. [2025-02-05 21:39:02,949 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-02-05 21:39:02,949 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-02-05 21:39:02,954 INFO L256 TraceCheckSpWp]: Trace formula consists of 989 conjuncts, 1 conjuncts are in the unsatisfiable core [2025-02-05 21:39:02,966 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-02-05 21:39:03,025 INFO L134 CoverageAnalysis]: Checked inductivity of 8844 backedges. 132 proven. 0 refuted. 0 times theorem prover too weak. 8712 trivial. 0 not checked. [2025-02-05 21:39:03,026 INFO L308 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2025-02-05 21:39:03,026 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [2070953993] provided 1 perfect and 0 imperfect interpolant sequences [2025-02-05 21:39:03,026 INFO L185 FreeRefinementEngine]: Found 1 perfect and 1 imperfect interpolant sequences. [2025-02-05 21:39:03,026 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [2] total 2 [2025-02-05 21:39:03,032 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1970435132] [2025-02-05 21:39:03,032 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-02-05 21:39:03,036 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 2 states [2025-02-05 21:39:03,038 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-02-05 21:39:03,057 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 2 interpolants. [2025-02-05 21:39:03,057 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=1, Invalid=1, Unknown=0, NotChecked=0, Total=2 [2025-02-05 21:39:03,059 INFO L87 Difference]: Start difference. First operand has 211 states, 141 states have (on average 1.5602836879432624) internal successors, (220), 142 states have internal predecessors, (220), 67 states have call successors, (67), 1 states have call predecessors, (67), 1 states have return successors, (67), 67 states have call predecessors, (67), 67 states have call successors, (67) Second operand has 2 states, 2 states have (on average 49.0) internal successors, (98), 2 states have internal predecessors, (98), 2 states have call successors, (67), 2 states have call predecessors, (67), 1 states have return successors, (67), 1 states have call predecessors, (67), 2 states have call successors, (67) [2025-02-05 21:39:03,098 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-02-05 21:39:03,098 INFO L93 Difference]: Finished difference Result 416 states and 770 transitions. [2025-02-05 21:39:03,099 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 2 states. [2025-02-05 21:39:03,101 INFO L78 Accepts]: Start accepts. Automaton has has 2 states, 2 states have (on average 49.0) internal successors, (98), 2 states have internal predecessors, (98), 2 states have call successors, (67), 2 states have call predecessors, (67), 1 states have return successors, (67), 1 states have call predecessors, (67), 2 states have call successors, (67) Word has length 428 [2025-02-05 21:39:03,101 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-02-05 21:39:03,108 INFO L225 Difference]: With dead ends: 416 [2025-02-05 21:39:03,108 INFO L226 Difference]: Without dead ends: 208 [2025-02-05 21:39:03,111 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 429 GetRequests, 429 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-02-05 21:39:03,116 INFO L435 NwaCegarLoop]: 341 mSDtfsCounter, 0 mSDsluCounter, 0 mSDsCounter, 0 mSdLazyCounter, 8 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 0 SdHoareTripleChecker+Valid, 341 SdHoareTripleChecker+Invalid, 8 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 8 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2025-02-05 21:39:03,116 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [0 Valid, 341 Invalid, 8 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 8 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2025-02-05 21:39:03,129 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 208 states. [2025-02-05 21:39:03,165 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 208 to 208. [2025-02-05 21:39:03,166 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 208 states, 139 states have (on average 1.5467625899280575) internal successors, (215), 139 states have internal predecessors, (215), 67 states have call successors, (67), 1 states have call predecessors, (67), 1 states have return successors, (67), 67 states have call predecessors, (67), 67 states have call successors, (67) [2025-02-05 21:39:03,174 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 208 states to 208 states and 349 transitions. [2025-02-05 21:39:03,177 INFO L78 Accepts]: Start accepts. Automaton has 208 states and 349 transitions. Word has length 428 [2025-02-05 21:39:03,178 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-02-05 21:39:03,178 INFO L471 AbstractCegarLoop]: Abstraction has 208 states and 349 transitions. [2025-02-05 21:39:03,178 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 2 states, 2 states have (on average 49.0) internal successors, (98), 2 states have internal predecessors, (98), 2 states have call successors, (67), 2 states have call predecessors, (67), 1 states have return successors, (67), 1 states have call predecessors, (67), 2 states have call successors, (67) [2025-02-05 21:39:03,179 INFO L276 IsEmpty]: Start isEmpty. Operand 208 states and 349 transitions. [2025-02-05 21:39:03,185 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 429 [2025-02-05 21:39:03,186 INFO L210 NwaCegarLoop]: Found error trace [2025-02-05 21:39:03,186 INFO L218 NwaCegarLoop]: trace histogram [67, 67, 67, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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-02-05 21:39:03,194 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-02-05 21:39:03,388 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-02-05 21:39:03,389 INFO L396 AbstractCegarLoop]: === Iteration 2 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-02-05 21:39:03,389 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-02-05 21:39:03,390 INFO L85 PathProgramCache]: Analyzing trace with hash -2068698842, now seen corresponding path program 1 times [2025-02-05 21:39:03,390 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-02-05 21:39:03,390 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [186707633] [2025-02-05 21:39:03,390 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-02-05 21:39:03,390 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-02-05 21:39:03,420 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 428 statements into 1 equivalence classes. [2025-02-05 21:39:03,526 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 428 of 428 statements. [2025-02-05 21:39:03,528 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-02-05 21:39:03,529 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-02-05 21:39:03,785 INFO L134 CoverageAnalysis]: Checked inductivity of 8844 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 8844 trivial. 0 not checked. [2025-02-05 21:39:03,785 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-02-05 21:39:03,785 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [186707633] [2025-02-05 21:39:03,785 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [186707633] provided 1 perfect and 0 imperfect interpolant sequences [2025-02-05 21:39:03,785 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-02-05 21:39:03,785 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2025-02-05 21:39:03,785 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1814687112] [2025-02-05 21:39:03,785 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-02-05 21:39:03,786 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2025-02-05 21:39:03,786 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-02-05 21:39:03,789 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2025-02-05 21:39:03,790 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-02-05 21:39:03,790 INFO L87 Difference]: Start difference. First operand 208 states and 349 transitions. Second operand has 3 states, 3 states have (on average 32.0) internal successors, (96), 3 states have internal predecessors, (96), 1 states have call successors, (67), 1 states have call predecessors, (67), 1 states have return successors, (67), 1 states have call predecessors, (67), 1 states have call successors, (67) [2025-02-05 21:39:03,873 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-02-05 21:39:03,875 INFO L93 Difference]: Finished difference Result 532 states and 898 transitions. [2025-02-05 21:39:03,876 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2025-02-05 21:39:03,876 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 32.0) internal successors, (96), 3 states have internal predecessors, (96), 1 states have call successors, (67), 1 states have call predecessors, (67), 1 states have return successors, (67), 1 states have call predecessors, (67), 1 states have call successors, (67) Word has length 428 [2025-02-05 21:39:03,877 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-02-05 21:39:03,883 INFO L225 Difference]: With dead ends: 532 [2025-02-05 21:39:03,884 INFO L226 Difference]: Without dead ends: 327 [2025-02-05 21:39:03,885 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-02-05 21:39:03,887 INFO L435 NwaCegarLoop]: 498 mSDtfsCounter, 200 mSDsluCounter, 324 mSDsCounter, 0 mSdLazyCounter, 32 mSolverCounterSat, 2 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 200 SdHoareTripleChecker+Valid, 822 SdHoareTripleChecker+Invalid, 34 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 2 IncrementalHoareTripleChecker+Valid, 32 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2025-02-05 21:39:03,888 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [200 Valid, 822 Invalid, 34 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [2 Valid, 32 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2025-02-05 21:39:03,888 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 327 states. [2025-02-05 21:39:03,922 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 327 to 324. [2025-02-05 21:39:03,925 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 324 states, 237 states have (on average 1.6033755274261603) internal successors, (380), 238 states have internal predecessors, (380), 84 states have call successors, (84), 2 states have call predecessors, (84), 2 states have return successors, (84), 83 states have call predecessors, (84), 84 states have call successors, (84) [2025-02-05 21:39:03,927 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 324 states to 324 states and 548 transitions. [2025-02-05 21:39:03,929 INFO L78 Accepts]: Start accepts. Automaton has 324 states and 548 transitions. Word has length 428 [2025-02-05 21:39:03,930 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-02-05 21:39:03,931 INFO L471 AbstractCegarLoop]: Abstraction has 324 states and 548 transitions. [2025-02-05 21:39:03,932 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 32.0) internal successors, (96), 3 states have internal predecessors, (96), 1 states have call successors, (67), 1 states have call predecessors, (67), 1 states have return successors, (67), 1 states have call predecessors, (67), 1 states have call successors, (67) [2025-02-05 21:39:03,932 INFO L276 IsEmpty]: Start isEmpty. Operand 324 states and 548 transitions. [2025-02-05 21:39:03,936 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 430 [2025-02-05 21:39:03,937 INFO L210 NwaCegarLoop]: Found error trace [2025-02-05 21:39:03,937 INFO L218 NwaCegarLoop]: trace histogram [67, 67, 67, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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-02-05 21:39:03,937 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable1 [2025-02-05 21:39:03,937 INFO L396 AbstractCegarLoop]: === Iteration 3 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-02-05 21:39:03,940 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-02-05 21:39:03,940 INFO L85 PathProgramCache]: Analyzing trace with hash -567231751, now seen corresponding path program 1 times [2025-02-05 21:39:03,940 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-02-05 21:39:03,940 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1501448278] [2025-02-05 21:39:03,940 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-02-05 21:39:03,940 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-02-05 21:39:03,974 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 429 statements into 1 equivalence classes. [2025-02-05 21:39:04,029 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 429 of 429 statements. [2025-02-05 21:39:04,030 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-02-05 21:39:04,030 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-02-05 21:39:04,256 INFO L134 CoverageAnalysis]: Checked inductivity of 8844 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 8844 trivial. 0 not checked. [2025-02-05 21:39:04,256 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-02-05 21:39:04,256 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1501448278] [2025-02-05 21:39:04,257 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1501448278] provided 1 perfect and 0 imperfect interpolant sequences [2025-02-05 21:39:04,257 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-02-05 21:39:04,257 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2025-02-05 21:39:04,257 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [471490610] [2025-02-05 21:39:04,257 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-02-05 21:39:04,258 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2025-02-05 21:39:04,258 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-02-05 21:39:04,259 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2025-02-05 21:39:04,260 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-02-05 21:39:04,260 INFO L87 Difference]: Start difference. First operand 324 states and 548 transitions. Second operand has 3 states, 3 states have (on average 32.333333333333336) internal successors, (97), 3 states have internal predecessors, (97), 1 states have call successors, (67), 1 states have call predecessors, (67), 1 states have return successors, (67), 1 states have call predecessors, (67), 1 states have call successors, (67) [2025-02-05 21:39:04,336 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-02-05 21:39:04,337 INFO L93 Difference]: Finished difference Result 850 states and 1425 transitions. [2025-02-05 21:39:04,337 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2025-02-05 21:39:04,337 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 32.333333333333336) internal successors, (97), 3 states have internal predecessors, (97), 1 states have call successors, (67), 1 states have call predecessors, (67), 1 states have return successors, (67), 1 states have call predecessors, (67), 1 states have call successors, (67) Word has length 429 [2025-02-05 21:39:04,338 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-02-05 21:39:04,342 INFO L225 Difference]: With dead ends: 850 [2025-02-05 21:39:04,342 INFO L226 Difference]: Without dead ends: 529 [2025-02-05 21:39:04,343 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-02-05 21:39:04,343 INFO L435 NwaCegarLoop]: 533 mSDtfsCounter, 229 mSDsluCounter, 331 mSDsCounter, 0 mSdLazyCounter, 30 mSolverCounterSat, 1 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 229 SdHoareTripleChecker+Valid, 864 SdHoareTripleChecker+Invalid, 31 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 1 IncrementalHoareTripleChecker+Valid, 30 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2025-02-05 21:39:04,344 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [229 Valid, 864 Invalid, 31 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [1 Valid, 30 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2025-02-05 21:39:04,345 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 529 states. [2025-02-05 21:39:04,377 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 529 to 326. [2025-02-05 21:39:04,377 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 326 states, 239 states have (on average 1.598326359832636) internal successors, (382), 240 states have internal predecessors, (382), 84 states have call successors, (84), 2 states have call predecessors, (84), 2 states have return successors, (84), 83 states have call predecessors, (84), 84 states have call successors, (84) [2025-02-05 21:39:04,381 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 326 states to 326 states and 550 transitions. [2025-02-05 21:39:04,382 INFO L78 Accepts]: Start accepts. Automaton has 326 states and 550 transitions. Word has length 429 [2025-02-05 21:39:04,382 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-02-05 21:39:04,382 INFO L471 AbstractCegarLoop]: Abstraction has 326 states and 550 transitions. [2025-02-05 21:39:04,383 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 32.333333333333336) internal successors, (97), 3 states have internal predecessors, (97), 1 states have call successors, (67), 1 states have call predecessors, (67), 1 states have return successors, (67), 1 states have call predecessors, (67), 1 states have call successors, (67) [2025-02-05 21:39:04,383 INFO L276 IsEmpty]: Start isEmpty. Operand 326 states and 550 transitions. [2025-02-05 21:39:04,387 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 430 [2025-02-05 21:39:04,387 INFO L210 NwaCegarLoop]: Found error trace [2025-02-05 21:39:04,388 INFO L218 NwaCegarLoop]: trace histogram [67, 67, 67, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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-02-05 21:39:04,388 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable2 [2025-02-05 21:39:04,388 INFO L396 AbstractCegarLoop]: === Iteration 4 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-02-05 21:39:04,388 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-02-05 21:39:04,388 INFO L85 PathProgramCache]: Analyzing trace with hash -1920541448, now seen corresponding path program 1 times [2025-02-05 21:39:04,389 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-02-05 21:39:04,389 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [230592380] [2025-02-05 21:39:04,389 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-02-05 21:39:04,389 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-02-05 21:39:04,425 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 429 statements into 1 equivalence classes. [2025-02-05 21:39:04,473 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 429 of 429 statements. [2025-02-05 21:39:04,473 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-02-05 21:39:04,473 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-02-05 21:39:04,866 INFO L134 CoverageAnalysis]: Checked inductivity of 8844 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 8844 trivial. 0 not checked. [2025-02-05 21:39:04,866 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-02-05 21:39:04,866 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [230592380] [2025-02-05 21:39:04,866 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [230592380] provided 1 perfect and 0 imperfect interpolant sequences [2025-02-05 21:39:04,866 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-02-05 21:39:04,866 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2025-02-05 21:39:04,867 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1415279286] [2025-02-05 21:39:04,867 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-02-05 21:39:04,867 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2025-02-05 21:39:04,867 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-02-05 21:39:04,868 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2025-02-05 21:39:04,869 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-02-05 21:39:04,869 INFO L87 Difference]: Start difference. First operand 326 states and 550 transitions. Second operand has 3 states, 3 states have (on average 32.333333333333336) internal successors, (97), 3 states have internal predecessors, (97), 1 states have call successors, (67), 1 states have call predecessors, (67), 1 states have return successors, (67), 1 states have call predecessors, (67), 1 states have call successors, (67) [2025-02-05 21:39:04,938 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-02-05 21:39:04,938 INFO L93 Difference]: Finished difference Result 681 states and 1142 transitions. [2025-02-05 21:39:04,939 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2025-02-05 21:39:04,939 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 32.333333333333336) internal successors, (97), 3 states have internal predecessors, (97), 1 states have call successors, (67), 1 states have call predecessors, (67), 1 states have return successors, (67), 1 states have call predecessors, (67), 1 states have call successors, (67) Word has length 429 [2025-02-05 21:39:04,940 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-02-05 21:39:04,942 INFO L225 Difference]: With dead ends: 681 [2025-02-05 21:39:04,942 INFO L226 Difference]: Without dead ends: 358 [2025-02-05 21:39:04,945 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 4 GetRequests, 3 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-02-05 21:39:04,947 INFO L435 NwaCegarLoop]: 351 mSDtfsCounter, 18 mSDsluCounter, 328 mSDsCounter, 0 mSdLazyCounter, 33 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 18 SdHoareTripleChecker+Valid, 679 SdHoareTripleChecker+Invalid, 33 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 33 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2025-02-05 21:39:04,948 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [18 Valid, 679 Invalid, 33 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 33 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2025-02-05 21:39:04,949 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 358 states. [2025-02-05 21:39:04,983 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 358 to 334. [2025-02-05 21:39:04,984 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 334 states, 247 states have (on average 1.5951417004048583) internal successors, (394), 248 states have internal predecessors, (394), 84 states have call successors, (84), 2 states have call predecessors, (84), 2 states have return successors, (84), 83 states have call predecessors, (84), 84 states have call successors, (84) [2025-02-05 21:39:04,986 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 334 states to 334 states and 562 transitions. [2025-02-05 21:39:04,987 INFO L78 Accepts]: Start accepts. Automaton has 334 states and 562 transitions. Word has length 429 [2025-02-05 21:39:04,987 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-02-05 21:39:04,989 INFO L471 AbstractCegarLoop]: Abstraction has 334 states and 562 transitions. [2025-02-05 21:39:04,989 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 32.333333333333336) internal successors, (97), 3 states have internal predecessors, (97), 1 states have call successors, (67), 1 states have call predecessors, (67), 1 states have return successors, (67), 1 states have call predecessors, (67), 1 states have call successors, (67) [2025-02-05 21:39:04,989 INFO L276 IsEmpty]: Start isEmpty. Operand 334 states and 562 transitions. [2025-02-05 21:39:04,996 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 431 [2025-02-05 21:39:04,997 INFO L210 NwaCegarLoop]: Found error trace [2025-02-05 21:39:04,997 INFO L218 NwaCegarLoop]: trace histogram [67, 67, 67, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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-02-05 21:39:04,997 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable3 [2025-02-05 21:39:04,997 INFO L396 AbstractCegarLoop]: === Iteration 5 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-02-05 21:39:04,998 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-02-05 21:39:04,998 INFO L85 PathProgramCache]: Analyzing trace with hash 1056579403, now seen corresponding path program 1 times [2025-02-05 21:39:04,998 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-02-05 21:39:04,998 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1146200811] [2025-02-05 21:39:04,999 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-02-05 21:39:04,999 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-02-05 21:39:05,032 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 430 statements into 1 equivalence classes. [2025-02-05 21:39:05,064 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 430 of 430 statements. [2025-02-05 21:39:05,064 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-02-05 21:39:05,064 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-02-05 21:39:05,302 INFO L134 CoverageAnalysis]: Checked inductivity of 8844 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 8844 trivial. 0 not checked. [2025-02-05 21:39:05,303 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-02-05 21:39:05,303 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1146200811] [2025-02-05 21:39:05,303 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1146200811] provided 1 perfect and 0 imperfect interpolant sequences [2025-02-05 21:39:05,303 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-02-05 21:39:05,303 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2025-02-05 21:39:05,303 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [86030811] [2025-02-05 21:39:05,303 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-02-05 21:39:05,304 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2025-02-05 21:39:05,304 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-02-05 21:39:05,305 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2025-02-05 21:39:05,305 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2025-02-05 21:39:05,305 INFO L87 Difference]: Start difference. First operand 334 states and 562 transitions. Second operand has 4 states, 4 states have (on average 24.5) internal successors, (98), 4 states have internal predecessors, (98), 2 states have call successors, (67), 1 states have call predecessors, (67), 1 states have return successors, (67), 2 states have call predecessors, (67), 2 states have call successors, (67) [2025-02-05 21:39:05,582 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-02-05 21:39:05,582 INFO L93 Difference]: Finished difference Result 988 states and 1668 transitions. [2025-02-05 21:39:05,583 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2025-02-05 21:39:05,583 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 4 states have (on average 24.5) internal successors, (98), 4 states have internal predecessors, (98), 2 states have call successors, (67), 1 states have call predecessors, (67), 1 states have return successors, (67), 2 states have call predecessors, (67), 2 states have call successors, (67) Word has length 430 [2025-02-05 21:39:05,584 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-02-05 21:39:05,589 INFO L225 Difference]: With dead ends: 988 [2025-02-05 21:39:05,589 INFO L226 Difference]: Without dead ends: 657 [2025-02-05 21:39:05,590 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 6 GetRequests, 3 SyntacticMatches, 0 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=9, Invalid=11, Unknown=0, NotChecked=0, Total=20 [2025-02-05 21:39:05,592 INFO L435 NwaCegarLoop]: 333 mSDtfsCounter, 547 mSDsluCounter, 325 mSDsCounter, 0 mSdLazyCounter, 34 mSolverCounterSat, 210 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 547 SdHoareTripleChecker+Valid, 658 SdHoareTripleChecker+Invalid, 244 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 210 IncrementalHoareTripleChecker+Valid, 34 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.2s IncrementalHoareTripleChecker+Time [2025-02-05 21:39:05,592 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [547 Valid, 658 Invalid, 244 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [210 Valid, 34 Invalid, 0 Unknown, 0 Unchecked, 0.2s Time] [2025-02-05 21:39:05,593 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 657 states. [2025-02-05 21:39:05,634 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 657 to 334. [2025-02-05 21:39:05,635 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 334 states, 247 states have (on average 1.5951417004048583) internal successors, (394), 248 states have internal predecessors, (394), 84 states have call successors, (84), 2 states have call predecessors, (84), 2 states have return successors, (84), 83 states have call predecessors, (84), 84 states have call successors, (84) [2025-02-05 21:39:05,636 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 334 states to 334 states and 562 transitions. [2025-02-05 21:39:05,637 INFO L78 Accepts]: Start accepts. Automaton has 334 states and 562 transitions. Word has length 430 [2025-02-05 21:39:05,637 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-02-05 21:39:05,637 INFO L471 AbstractCegarLoop]: Abstraction has 334 states and 562 transitions. [2025-02-05 21:39:05,638 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 24.5) internal successors, (98), 4 states have internal predecessors, (98), 2 states have call successors, (67), 1 states have call predecessors, (67), 1 states have return successors, (67), 2 states have call predecessors, (67), 2 states have call successors, (67) [2025-02-05 21:39:05,638 INFO L276 IsEmpty]: Start isEmpty. Operand 334 states and 562 transitions. [2025-02-05 21:39:05,641 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 431 [2025-02-05 21:39:05,642 INFO L210 NwaCegarLoop]: Found error trace [2025-02-05 21:39:05,642 INFO L218 NwaCegarLoop]: trace histogram [67, 67, 67, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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-02-05 21:39:05,642 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable4 [2025-02-05 21:39:05,642 INFO L396 AbstractCegarLoop]: === Iteration 6 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-02-05 21:39:05,643 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-02-05 21:39:05,643 INFO L85 PathProgramCache]: Analyzing trace with hash -1904974291, now seen corresponding path program 1 times [2025-02-05 21:39:05,643 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-02-05 21:39:05,643 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1328562296] [2025-02-05 21:39:05,643 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-02-05 21:39:05,643 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-02-05 21:39:05,663 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 430 statements into 1 equivalence classes. [2025-02-05 21:39:05,697 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 430 of 430 statements. [2025-02-05 21:39:05,698 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-02-05 21:39:05,698 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-02-05 21:39:05,893 INFO L134 CoverageAnalysis]: Checked inductivity of 8844 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 8844 trivial. 0 not checked. [2025-02-05 21:39:05,893 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-02-05 21:39:05,893 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1328562296] [2025-02-05 21:39:05,893 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1328562296] provided 1 perfect and 0 imperfect interpolant sequences [2025-02-05 21:39:05,894 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-02-05 21:39:05,894 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2025-02-05 21:39:05,894 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [537338326] [2025-02-05 21:39:05,894 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-02-05 21:39:05,894 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2025-02-05 21:39:05,897 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-02-05 21:39:05,898 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2025-02-05 21:39:05,898 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-02-05 21:39:05,898 INFO L87 Difference]: Start difference. First operand 334 states and 562 transitions. Second operand has 3 states, 3 states have (on average 32.666666666666664) internal successors, (98), 3 states have internal predecessors, (98), 1 states have call successors, (67), 1 states have call predecessors, (67), 1 states have return successors, (67), 1 states have call predecessors, (67), 1 states have call successors, (67) [2025-02-05 21:39:05,964 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-02-05 21:39:05,965 INFO L93 Difference]: Finished difference Result 996 states and 1680 transitions. [2025-02-05 21:39:05,965 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2025-02-05 21:39:05,966 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 32.666666666666664) internal successors, (98), 3 states have internal predecessors, (98), 1 states have call successors, (67), 1 states have call predecessors, (67), 1 states have return successors, (67), 1 states have call predecessors, (67), 1 states have call successors, (67) Word has length 430 [2025-02-05 21:39:05,966 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-02-05 21:39:05,971 INFO L225 Difference]: With dead ends: 996 [2025-02-05 21:39:05,971 INFO L226 Difference]: Without dead ends: 665 [2025-02-05 21:39:05,972 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 4 GetRequests, 3 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-02-05 21:39:05,973 INFO L435 NwaCegarLoop]: 591 mSDtfsCounter, 341 mSDsluCounter, 334 mSDsCounter, 0 mSdLazyCounter, 31 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 341 SdHoareTripleChecker+Valid, 925 SdHoareTripleChecker+Invalid, 31 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 31 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2025-02-05 21:39:05,973 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [341 Valid, 925 Invalid, 31 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 31 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2025-02-05 21:39:05,974 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 665 states. [2025-02-05 21:39:06,026 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 665 to 663. [2025-02-05 21:39:06,028 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 663 states, 490 states have (on average 1.5959183673469388) internal successors, (782), 492 states have internal predecessors, (782), 168 states have call successors, (168), 4 states have call predecessors, (168), 4 states have return successors, (168), 166 states have call predecessors, (168), 168 states have call successors, (168) [2025-02-05 21:39:06,030 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 663 states to 663 states and 1118 transitions. [2025-02-05 21:39:06,031 INFO L78 Accepts]: Start accepts. Automaton has 663 states and 1118 transitions. Word has length 430 [2025-02-05 21:39:06,031 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-02-05 21:39:06,032 INFO L471 AbstractCegarLoop]: Abstraction has 663 states and 1118 transitions. [2025-02-05 21:39:06,032 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 32.666666666666664) internal successors, (98), 3 states have internal predecessors, (98), 1 states have call successors, (67), 1 states have call predecessors, (67), 1 states have return successors, (67), 1 states have call predecessors, (67), 1 states have call successors, (67) [2025-02-05 21:39:06,032 INFO L276 IsEmpty]: Start isEmpty. Operand 663 states and 1118 transitions. [2025-02-05 21:39:06,036 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 431 [2025-02-05 21:39:06,036 INFO L210 NwaCegarLoop]: Found error trace [2025-02-05 21:39:06,036 INFO L218 NwaCegarLoop]: trace histogram [67, 67, 67, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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-02-05 21:39:06,036 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable5 [2025-02-05 21:39:06,036 INFO L396 AbstractCegarLoop]: === Iteration 7 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-02-05 21:39:06,037 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-02-05 21:39:06,037 INFO L85 PathProgramCache]: Analyzing trace with hash 206316078, now seen corresponding path program 1 times [2025-02-05 21:39:06,037 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-02-05 21:39:06,037 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1044476072] [2025-02-05 21:39:06,037 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-02-05 21:39:06,037 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-02-05 21:39:06,057 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 430 statements into 1 equivalence classes. [2025-02-05 21:39:06,100 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 430 of 430 statements. [2025-02-05 21:39:06,100 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-02-05 21:39:06,100 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-02-05 21:39:06,627 INFO L134 CoverageAnalysis]: Checked inductivity of 8844 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 8844 trivial. 0 not checked. [2025-02-05 21:39:06,627 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-02-05 21:39:06,628 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1044476072] [2025-02-05 21:39:06,628 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1044476072] provided 1 perfect and 0 imperfect interpolant sequences [2025-02-05 21:39:06,628 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-02-05 21:39:06,628 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2025-02-05 21:39:06,628 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1655129801] [2025-02-05 21:39:06,628 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-02-05 21:39:06,628 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2025-02-05 21:39:06,629 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-02-05 21:39:06,629 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2025-02-05 21:39:06,629 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=10, Invalid=10, Unknown=0, NotChecked=0, Total=20 [2025-02-05 21:39:06,629 INFO L87 Difference]: Start difference. First operand 663 states and 1118 transitions. Second operand has 5 states, 5 states have (on average 19.6) internal successors, (98), 5 states have internal predecessors, (98), 1 states have call successors, (67), 1 states have call predecessors, (67), 1 states have return successors, (67), 1 states have call predecessors, (67), 1 states have call successors, (67) [2025-02-05 21:39:07,094 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-02-05 21:39:07,094 INFO L93 Difference]: Finished difference Result 1985 states and 3349 transitions. [2025-02-05 21:39:07,094 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2025-02-05 21:39:07,096 INFO L78 Accepts]: Start accepts. Automaton has has 5 states, 5 states have (on average 19.6) internal successors, (98), 5 states have internal predecessors, (98), 1 states have call successors, (67), 1 states have call predecessors, (67), 1 states have return successors, (67), 1 states have call predecessors, (67), 1 states have call successors, (67) Word has length 430 [2025-02-05 21:39:07,096 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-02-05 21:39:07,104 INFO L225 Difference]: With dead ends: 1985 [2025-02-05 21:39:07,104 INFO L226 Difference]: Without dead ends: 1325 [2025-02-05 21:39:07,106 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 6 GetRequests, 3 SyntacticMatches, 0 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=10, Invalid=10, Unknown=0, NotChecked=0, Total=20 [2025-02-05 21:39:07,107 INFO L435 NwaCegarLoop]: 588 mSDtfsCounter, 755 mSDsluCounter, 521 mSDsCounter, 0 mSdLazyCounter, 196 mSolverCounterSat, 135 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.3s Time, 0 mProtectedPredicate, 0 mProtectedAction, 755 SdHoareTripleChecker+Valid, 1109 SdHoareTripleChecker+Invalid, 331 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 135 IncrementalHoareTripleChecker+Valid, 196 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.4s IncrementalHoareTripleChecker+Time [2025-02-05 21:39:07,107 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [755 Valid, 1109 Invalid, 331 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [135 Valid, 196 Invalid, 0 Unknown, 0 Unchecked, 0.4s Time] [2025-02-05 21:39:07,108 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1325 states. [2025-02-05 21:39:07,231 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1325 to 1301. [2025-02-05 21:39:07,235 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 1301 states, 956 states have (on average 1.5878661087866108) internal successors, (1518), 960 states have internal predecessors, (1518), 336 states have call successors, (336), 8 states have call predecessors, (336), 8 states have return successors, (336), 332 states have call predecessors, (336), 336 states have call successors, (336) [2025-02-05 21:39:07,242 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1301 states to 1301 states and 2190 transitions. [2025-02-05 21:39:07,243 INFO L78 Accepts]: Start accepts. Automaton has 1301 states and 2190 transitions. Word has length 430 [2025-02-05 21:39:07,244 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-02-05 21:39:07,244 INFO L471 AbstractCegarLoop]: Abstraction has 1301 states and 2190 transitions. [2025-02-05 21:39:07,245 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 19.6) internal successors, (98), 5 states have internal predecessors, (98), 1 states have call successors, (67), 1 states have call predecessors, (67), 1 states have return successors, (67), 1 states have call predecessors, (67), 1 states have call successors, (67) [2025-02-05 21:39:07,245 INFO L276 IsEmpty]: Start isEmpty. Operand 1301 states and 2190 transitions. [2025-02-05 21:39:07,250 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 431 [2025-02-05 21:39:07,250 INFO L210 NwaCegarLoop]: Found error trace [2025-02-05 21:39:07,251 INFO L218 NwaCegarLoop]: trace histogram [67, 67, 67, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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-02-05 21:39:07,251 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable6 [2025-02-05 21:39:07,251 INFO L396 AbstractCegarLoop]: === Iteration 8 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-02-05 21:39:07,251 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-02-05 21:39:07,252 INFO L85 PathProgramCache]: Analyzing trace with hash 237335885, now seen corresponding path program 1 times [2025-02-05 21:39:07,252 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-02-05 21:39:07,252 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1140832161] [2025-02-05 21:39:07,252 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-02-05 21:39:07,252 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-02-05 21:39:07,280 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 430 statements into 1 equivalence classes. [2025-02-05 21:39:07,378 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 430 of 430 statements. [2025-02-05 21:39:07,379 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-02-05 21:39:07,379 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-02-05 21:39:07,575 INFO L134 CoverageAnalysis]: Checked inductivity of 8844 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 8844 trivial. 0 not checked. [2025-02-05 21:39:07,575 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-02-05 21:39:07,575 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1140832161] [2025-02-05 21:39:07,575 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1140832161] provided 1 perfect and 0 imperfect interpolant sequences [2025-02-05 21:39:07,575 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-02-05 21:39:07,576 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2025-02-05 21:39:07,576 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [890087108] [2025-02-05 21:39:07,576 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-02-05 21:39:07,577 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2025-02-05 21:39:07,577 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-02-05 21:39:07,577 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2025-02-05 21:39:07,578 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2025-02-05 21:39:07,578 INFO L87 Difference]: Start difference. First operand 1301 states and 2190 transitions. Second operand has 4 states, 4 states have (on average 24.5) internal successors, (98), 4 states have internal predecessors, (98), 1 states have call successors, (67), 1 states have call predecessors, (67), 1 states have return successors, (67), 1 states have call predecessors, (67), 1 states have call successors, (67) [2025-02-05 21:39:08,033 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-02-05 21:39:08,033 INFO L93 Difference]: Finished difference Result 6493 states and 10938 transitions. [2025-02-05 21:39:08,034 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2025-02-05 21:39:08,034 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 4 states have (on average 24.5) internal successors, (98), 4 states have internal predecessors, (98), 1 states have call successors, (67), 1 states have call predecessors, (67), 1 states have return successors, (67), 1 states have call predecessors, (67), 1 states have call successors, (67) Word has length 430 [2025-02-05 21:39:08,035 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-02-05 21:39:08,059 INFO L225 Difference]: With dead ends: 6493 [2025-02-05 21:39:08,059 INFO L226 Difference]: Without dead ends: 5195 [2025-02-05 21:39:08,064 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 7 GetRequests, 4 SyntacticMatches, 0 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=9, Invalid=11, Unknown=0, NotChecked=0, Total=20 [2025-02-05 21:39:08,065 INFO L435 NwaCegarLoop]: 624 mSDtfsCounter, 787 mSDsluCounter, 993 mSDsCounter, 0 mSdLazyCounter, 70 mSolverCounterSat, 134 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 787 SdHoareTripleChecker+Valid, 1617 SdHoareTripleChecker+Invalid, 204 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 134 IncrementalHoareTripleChecker+Valid, 70 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.2s IncrementalHoareTripleChecker+Time [2025-02-05 21:39:08,065 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [787 Valid, 1617 Invalid, 204 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [134 Valid, 70 Invalid, 0 Unknown, 0 Unchecked, 0.2s Time] [2025-02-05 21:39:08,069 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 5195 states. [2025-02-05 21:39:08,384 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 5195 to 5173. [2025-02-05 21:39:08,393 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 5173 states, 3796 states have (on average 1.58377239199157) internal successors, (6012), 3812 states have internal predecessors, (6012), 1344 states have call successors, (1344), 32 states have call predecessors, (1344), 32 states have return successors, (1344), 1328 states have call predecessors, (1344), 1344 states have call successors, (1344) [2025-02-05 21:39:08,428 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5173 states to 5173 states and 8700 transitions. [2025-02-05 21:39:08,436 INFO L78 Accepts]: Start accepts. Automaton has 5173 states and 8700 transitions. Word has length 430 [2025-02-05 21:39:08,441 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-02-05 21:39:08,441 INFO L471 AbstractCegarLoop]: Abstraction has 5173 states and 8700 transitions. [2025-02-05 21:39:08,441 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 24.5) internal successors, (98), 4 states have internal predecessors, (98), 1 states have call successors, (67), 1 states have call predecessors, (67), 1 states have return successors, (67), 1 states have call predecessors, (67), 1 states have call successors, (67) [2025-02-05 21:39:08,441 INFO L276 IsEmpty]: Start isEmpty. Operand 5173 states and 8700 transitions. [2025-02-05 21:39:08,445 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 431 [2025-02-05 21:39:08,448 INFO L210 NwaCegarLoop]: Found error trace [2025-02-05 21:39:08,449 INFO L218 NwaCegarLoop]: trace histogram [67, 67, 67, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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-02-05 21:39:08,449 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable7 [2025-02-05 21:39:08,449 INFO L396 AbstractCegarLoop]: === Iteration 9 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-02-05 21:39:08,449 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-02-05 21:39:08,449 INFO L85 PathProgramCache]: Analyzing trace with hash -1772767956, now seen corresponding path program 1 times [2025-02-05 21:39:08,449 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-02-05 21:39:08,449 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1561125006] [2025-02-05 21:39:08,450 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-02-05 21:39:08,450 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-02-05 21:39:08,488 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 430 statements into 1 equivalence classes. [2025-02-05 21:39:08,525 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 430 of 430 statements. [2025-02-05 21:39:08,528 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-02-05 21:39:08,529 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-02-05 21:39:08,676 INFO L134 CoverageAnalysis]: Checked inductivity of 8844 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 8844 trivial. 0 not checked. [2025-02-05 21:39:08,676 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-02-05 21:39:08,676 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1561125006] [2025-02-05 21:39:08,676 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1561125006] provided 1 perfect and 0 imperfect interpolant sequences [2025-02-05 21:39:08,676 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-02-05 21:39:08,676 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2025-02-05 21:39:08,676 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1758571419] [2025-02-05 21:39:08,676 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-02-05 21:39:08,681 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2025-02-05 21:39:08,681 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-02-05 21:39:08,681 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2025-02-05 21:39:08,681 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-02-05 21:39:08,682 INFO L87 Difference]: Start difference. First operand 5173 states and 8700 transitions. Second operand has 3 states, 3 states have (on average 32.666666666666664) internal successors, (98), 3 states have internal predecessors, (98), 1 states have call successors, (67), 1 states have call predecessors, (67), 1 states have return successors, (67), 1 states have call predecessors, (67), 1 states have call successors, (67) [2025-02-05 21:39:09,402 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-02-05 21:39:09,403 INFO L93 Difference]: Finished difference Result 13945 states and 23298 transitions. [2025-02-05 21:39:09,403 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2025-02-05 21:39:09,404 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 32.666666666666664) internal successors, (98), 3 states have internal predecessors, (98), 1 states have call successors, (67), 1 states have call predecessors, (67), 1 states have return successors, (67), 1 states have call predecessors, (67), 1 states have call successors, (67) Word has length 430 [2025-02-05 21:39:09,404 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-02-05 21:39:09,498 INFO L225 Difference]: With dead ends: 13945 [2025-02-05 21:39:09,498 INFO L226 Difference]: Without dead ends: 8775 [2025-02-05 21:39:09,526 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-02-05 21:39:09,527 INFO L435 NwaCegarLoop]: 449 mSDtfsCounter, 224 mSDsluCounter, 329 mSDsCounter, 0 mSdLazyCounter, 30 mSolverCounterSat, 3 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 224 SdHoareTripleChecker+Valid, 778 SdHoareTripleChecker+Invalid, 33 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 3 IncrementalHoareTripleChecker+Valid, 30 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2025-02-05 21:39:09,527 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [224 Valid, 778 Invalid, 33 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [3 Valid, 30 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2025-02-05 21:39:09,540 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 8775 states. [2025-02-05 21:39:10,342 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 8775 to 8437. [2025-02-05 21:39:10,359 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 8437 states, 6084 states have (on average 1.5450361604207759) internal successors, (9400), 6132 states have internal predecessors, (9400), 2288 states have call successors, (2288), 64 states have call predecessors, (2288), 64 states have return successors, (2288), 2240 states have call predecessors, (2288), 2288 states have call successors, (2288) [2025-02-05 21:39:10,390 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 8437 states to 8437 states and 13976 transitions. [2025-02-05 21:39:10,397 INFO L78 Accepts]: Start accepts. Automaton has 8437 states and 13976 transitions. Word has length 430 [2025-02-05 21:39:10,398 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-02-05 21:39:10,398 INFO L471 AbstractCegarLoop]: Abstraction has 8437 states and 13976 transitions. [2025-02-05 21:39:10,398 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 32.666666666666664) internal successors, (98), 3 states have internal predecessors, (98), 1 states have call successors, (67), 1 states have call predecessors, (67), 1 states have return successors, (67), 1 states have call predecessors, (67), 1 states have call successors, (67) [2025-02-05 21:39:10,398 INFO L276 IsEmpty]: Start isEmpty. Operand 8437 states and 13976 transitions. [2025-02-05 21:39:10,403 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 431 [2025-02-05 21:39:10,403 INFO L210 NwaCegarLoop]: Found error trace [2025-02-05 21:39:10,403 INFO L218 NwaCegarLoop]: trace histogram [67, 67, 67, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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-02-05 21:39:10,403 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable8 [2025-02-05 21:39:10,404 INFO L396 AbstractCegarLoop]: === Iteration 10 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-02-05 21:39:10,404 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-02-05 21:39:10,404 INFO L85 PathProgramCache]: Analyzing trace with hash 2073502701, now seen corresponding path program 1 times [2025-02-05 21:39:10,404 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-02-05 21:39:10,404 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1571349012] [2025-02-05 21:39:10,404 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-02-05 21:39:10,404 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-02-05 21:39:10,422 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 430 statements into 1 equivalence classes. [2025-02-05 21:39:10,438 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 430 of 430 statements. [2025-02-05 21:39:10,438 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-02-05 21:39:10,439 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-02-05 21:39:10,506 INFO L134 CoverageAnalysis]: Checked inductivity of 8844 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 8844 trivial. 0 not checked. [2025-02-05 21:39:10,506 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-02-05 21:39:10,506 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1571349012] [2025-02-05 21:39:10,506 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1571349012] provided 1 perfect and 0 imperfect interpolant sequences [2025-02-05 21:39:10,506 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-02-05 21:39:10,506 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2025-02-05 21:39:10,506 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1650885453] [2025-02-05 21:39:10,507 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-02-05 21:39:10,507 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2025-02-05 21:39:10,507 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-02-05 21:39:10,507 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2025-02-05 21:39:10,507 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-02-05 21:39:10,508 INFO L87 Difference]: Start difference. First operand 8437 states and 13976 transitions. Second operand has 3 states, 3 states have (on average 32.666666666666664) internal successors, (98), 3 states have internal predecessors, (98), 1 states have call successors, (67), 1 states have call predecessors, (67), 1 states have return successors, (67), 1 states have call predecessors, (67), 1 states have call successors, (67) [2025-02-05 21:39:10,805 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-02-05 21:39:10,805 INFO L93 Difference]: Finished difference Result 15601 states and 25878 transitions. [2025-02-05 21:39:10,806 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2025-02-05 21:39:10,807 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 32.666666666666664) internal successors, (98), 3 states have internal predecessors, (98), 1 states have call successors, (67), 1 states have call predecessors, (67), 1 states have return successors, (67), 1 states have call predecessors, (67), 1 states have call successors, (67) Word has length 430 [2025-02-05 21:39:10,807 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-02-05 21:39:10,849 INFO L225 Difference]: With dead ends: 15601 [2025-02-05 21:39:10,849 INFO L226 Difference]: Without dead ends: 7167 [2025-02-05 21:39:10,864 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-02-05 21:39:10,865 INFO L435 NwaCegarLoop]: 422 mSDtfsCounter, 217 mSDsluCounter, 327 mSDsCounter, 0 mSdLazyCounter, 34 mSolverCounterSat, 2 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 217 SdHoareTripleChecker+Valid, 749 SdHoareTripleChecker+Invalid, 36 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 2 IncrementalHoareTripleChecker+Valid, 34 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2025-02-05 21:39:10,865 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [217 Valid, 749 Invalid, 36 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [2 Valid, 34 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2025-02-05 21:39:10,869 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 7167 states. [2025-02-05 21:39:11,135 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 7167 to 5813. [2025-02-05 21:39:11,142 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 5813 states, 4420 states have (on average 1.5873303167420814) internal successors, (7016), 4436 states have internal predecessors, (7016), 1344 states have call successors, (1344), 48 states have call predecessors, (1344), 48 states have return successors, (1344), 1328 states have call predecessors, (1344), 1344 states have call successors, (1344) [2025-02-05 21:39:11,161 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5813 states to 5813 states and 9704 transitions. [2025-02-05 21:39:11,168 INFO L78 Accepts]: Start accepts. Automaton has 5813 states and 9704 transitions. Word has length 430 [2025-02-05 21:39:11,168 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-02-05 21:39:11,169 INFO L471 AbstractCegarLoop]: Abstraction has 5813 states and 9704 transitions. [2025-02-05 21:39:11,169 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 32.666666666666664) internal successors, (98), 3 states have internal predecessors, (98), 1 states have call successors, (67), 1 states have call predecessors, (67), 1 states have return successors, (67), 1 states have call predecessors, (67), 1 states have call successors, (67) [2025-02-05 21:39:11,169 INFO L276 IsEmpty]: Start isEmpty. Operand 5813 states and 9704 transitions. [2025-02-05 21:39:11,194 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 431 [2025-02-05 21:39:11,194 INFO L210 NwaCegarLoop]: Found error trace [2025-02-05 21:39:11,194 INFO L218 NwaCegarLoop]: trace histogram [67, 67, 67, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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-02-05 21:39:11,194 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable9 [2025-02-05 21:39:11,195 INFO L396 AbstractCegarLoop]: === Iteration 11 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-02-05 21:39:11,195 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-02-05 21:39:11,195 INFO L85 PathProgramCache]: Analyzing trace with hash -976700114, now seen corresponding path program 1 times [2025-02-05 21:39:11,195 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-02-05 21:39:11,195 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [225750927] [2025-02-05 21:39:11,196 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-02-05 21:39:11,196 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-02-05 21:39:11,215 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 430 statements into 1 equivalence classes. [2025-02-05 21:39:11,233 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 430 of 430 statements. [2025-02-05 21:39:11,233 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-02-05 21:39:11,233 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-02-05 21:39:11,420 INFO L134 CoverageAnalysis]: Checked inductivity of 8844 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 8844 trivial. 0 not checked. [2025-02-05 21:39:11,420 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-02-05 21:39:11,420 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [225750927] [2025-02-05 21:39:11,420 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [225750927] provided 1 perfect and 0 imperfect interpolant sequences [2025-02-05 21:39:11,420 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-02-05 21:39:11,420 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2025-02-05 21:39:11,420 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [489630659] [2025-02-05 21:39:11,420 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-02-05 21:39:11,421 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2025-02-05 21:39:11,421 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-02-05 21:39:11,421 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2025-02-05 21:39:11,421 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-02-05 21:39:11,422 INFO L87 Difference]: Start difference. First operand 5813 states and 9704 transitions. Second operand has 3 states, 3 states have (on average 32.666666666666664) internal successors, (98), 3 states have internal predecessors, (98), 1 states have call successors, (67), 1 states have call predecessors, (67), 1 states have return successors, (67), 1 states have call predecessors, (67), 1 states have call successors, (67) [2025-02-05 21:39:11,683 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-02-05 21:39:11,684 INFO L93 Difference]: Finished difference Result 13257 states and 22148 transitions. [2025-02-05 21:39:11,684 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2025-02-05 21:39:11,685 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 32.666666666666664) internal successors, (98), 3 states have internal predecessors, (98), 1 states have call successors, (67), 1 states have call predecessors, (67), 1 states have return successors, (67), 1 states have call predecessors, (67), 1 states have call successors, (67) Word has length 430 [2025-02-05 21:39:11,685 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-02-05 21:39:11,748 INFO L225 Difference]: With dead ends: 13257 [2025-02-05 21:39:11,748 INFO L226 Difference]: Without dead ends: 7447 [2025-02-05 21:39:11,759 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 4 GetRequests, 3 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-02-05 21:39:11,760 INFO L435 NwaCegarLoop]: 406 mSDtfsCounter, 199 mSDsluCounter, 329 mSDsCounter, 0 mSdLazyCounter, 35 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 199 SdHoareTripleChecker+Valid, 735 SdHoareTripleChecker+Invalid, 35 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 35 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2025-02-05 21:39:11,760 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [199 Valid, 735 Invalid, 35 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 35 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2025-02-05 21:39:11,766 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 7447 states. [2025-02-05 21:39:12,095 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 7447 to 4509. [2025-02-05 21:39:12,101 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 4509 states, 3464 states have (on average 1.5941108545034641) internal successors, (5522), 3476 states have internal predecessors, (5522), 1008 states have call successors, (1008), 36 states have call predecessors, (1008), 36 states have return successors, (1008), 996 states have call predecessors, (1008), 1008 states have call successors, (1008) [2025-02-05 21:39:12,114 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4509 states to 4509 states and 7538 transitions. [2025-02-05 21:39:12,120 INFO L78 Accepts]: Start accepts. Automaton has 4509 states and 7538 transitions. Word has length 430 [2025-02-05 21:39:12,121 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-02-05 21:39:12,121 INFO L471 AbstractCegarLoop]: Abstraction has 4509 states and 7538 transitions. [2025-02-05 21:39:12,121 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 32.666666666666664) internal successors, (98), 3 states have internal predecessors, (98), 1 states have call successors, (67), 1 states have call predecessors, (67), 1 states have return successors, (67), 1 states have call predecessors, (67), 1 states have call successors, (67) [2025-02-05 21:39:12,121 INFO L276 IsEmpty]: Start isEmpty. Operand 4509 states and 7538 transitions. [2025-02-05 21:39:12,127 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 432 [2025-02-05 21:39:12,127 INFO L210 NwaCegarLoop]: Found error trace [2025-02-05 21:39:12,127 INFO L218 NwaCegarLoop]: trace histogram [67, 67, 67, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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-02-05 21:39:12,127 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable10 [2025-02-05 21:39:12,128 INFO L396 AbstractCegarLoop]: === Iteration 12 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-02-05 21:39:12,129 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-02-05 21:39:12,129 INFO L85 PathProgramCache]: Analyzing trace with hash 1868748613, now seen corresponding path program 1 times [2025-02-05 21:39:12,129 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-02-05 21:39:12,129 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1488812352] [2025-02-05 21:39:12,129 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-02-05 21:39:12,129 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-02-05 21:39:12,154 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 431 statements into 1 equivalence classes. [2025-02-05 21:39:12,291 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 431 of 431 statements. [2025-02-05 21:39:12,291 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-02-05 21:39:12,291 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-02-05 21:39:12,697 INFO L134 CoverageAnalysis]: Checked inductivity of 8844 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 8844 trivial. 0 not checked. [2025-02-05 21:39:12,697 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-02-05 21:39:12,698 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1488812352] [2025-02-05 21:39:12,698 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1488812352] provided 1 perfect and 0 imperfect interpolant sequences [2025-02-05 21:39:12,698 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-02-05 21:39:12,698 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2025-02-05 21:39:12,698 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [816766976] [2025-02-05 21:39:12,698 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-02-05 21:39:12,698 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2025-02-05 21:39:12,698 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-02-05 21:39:12,699 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2025-02-05 21:39:12,699 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=6, Invalid=6, Unknown=0, NotChecked=0, Total=12 [2025-02-05 21:39:12,699 INFO L87 Difference]: Start difference. First operand 4509 states and 7538 transitions. Second operand has 4 states, 4 states have (on average 24.75) internal successors, (99), 4 states have internal predecessors, (99), 1 states have call successors, (67), 1 states have call predecessors, (67), 1 states have return successors, (67), 1 states have call predecessors, (67), 1 states have call successors, (67) [2025-02-05 21:39:13,408 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-02-05 21:39:13,408 INFO L93 Difference]: Finished difference Result 13579 states and 22599 transitions. [2025-02-05 21:39:13,409 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2025-02-05 21:39:13,409 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 4 states have (on average 24.75) internal successors, (99), 4 states have internal predecessors, (99), 1 states have call successors, (67), 1 states have call predecessors, (67), 1 states have return successors, (67), 1 states have call predecessors, (67), 1 states have call successors, (67) Word has length 431 [2025-02-05 21:39:13,410 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-02-05 21:39:13,435 INFO L225 Difference]: With dead ends: 13579 [2025-02-05 21:39:13,435 INFO L226 Difference]: Without dead ends: 9073 [2025-02-05 21:39:13,447 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-02-05 21:39:13,464 INFO L435 NwaCegarLoop]: 652 mSDtfsCounter, 374 mSDsluCounter, 826 mSDsCounter, 0 mSdLazyCounter, 206 mSolverCounterSat, 1 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.3s Time, 0 mProtectedPredicate, 0 mProtectedAction, 374 SdHoareTripleChecker+Valid, 1478 SdHoareTripleChecker+Invalid, 207 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 1 IncrementalHoareTripleChecker+Valid, 206 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.4s IncrementalHoareTripleChecker+Time [2025-02-05 21:39:13,464 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [374 Valid, 1478 Invalid, 207 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [1 Valid, 206 Invalid, 0 Unknown, 0 Unchecked, 0.4s Time] [2025-02-05 21:39:13,470 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 9073 states. [2025-02-05 21:39:13,927 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 9073 to 6032. [2025-02-05 21:39:13,933 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 6032 states, 4269 states have (on average 1.5045678144764583) internal successors, (6423), 4305 states have internal predecessors, (6423), 1679 states have call successors, (1679), 83 states have call predecessors, (1679), 83 states have return successors, (1679), 1643 states have call predecessors, (1679), 1679 states have call successors, (1679) [2025-02-05 21:39:13,946 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 6032 states to 6032 states and 9781 transitions. [2025-02-05 21:39:13,952 INFO L78 Accepts]: Start accepts. Automaton has 6032 states and 9781 transitions. Word has length 431 [2025-02-05 21:39:13,952 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-02-05 21:39:13,952 INFO L471 AbstractCegarLoop]: Abstraction has 6032 states and 9781 transitions. [2025-02-05 21:39:13,953 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 24.75) internal successors, (99), 4 states have internal predecessors, (99), 1 states have call successors, (67), 1 states have call predecessors, (67), 1 states have return successors, (67), 1 states have call predecessors, (67), 1 states have call successors, (67) [2025-02-05 21:39:13,953 INFO L276 IsEmpty]: Start isEmpty. Operand 6032 states and 9781 transitions. [2025-02-05 21:39:13,956 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 432 [2025-02-05 21:39:13,956 INFO L210 NwaCegarLoop]: Found error trace [2025-02-05 21:39:13,957 INFO L218 NwaCegarLoop]: trace histogram [67, 67, 67, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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-02-05 21:39:13,957 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable11 [2025-02-05 21:39:13,957 INFO L396 AbstractCegarLoop]: === Iteration 13 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-02-05 21:39:13,957 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-02-05 21:39:13,957 INFO L85 PathProgramCache]: Analyzing trace with hash -683408348, now seen corresponding path program 1 times [2025-02-05 21:39:13,957 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-02-05 21:39:13,958 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [552497682] [2025-02-05 21:39:13,958 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-02-05 21:39:13,958 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-02-05 21:39:13,977 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 431 statements into 1 equivalence classes. [2025-02-05 21:39:14,015 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 431 of 431 statements. [2025-02-05 21:39:14,015 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-02-05 21:39:14,015 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-02-05 21:39:16,247 INFO L134 CoverageAnalysis]: Checked inductivity of 8844 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 8844 trivial. 0 not checked. [2025-02-05 21:39:16,247 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-02-05 21:39:16,248 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [552497682] [2025-02-05 21:39:16,248 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [552497682] provided 1 perfect and 0 imperfect interpolant sequences [2025-02-05 21:39:16,248 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-02-05 21:39:16,248 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2025-02-05 21:39:16,248 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1839583513] [2025-02-05 21:39:16,248 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-02-05 21:39:16,248 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2025-02-05 21:39:16,249 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-02-05 21:39:16,249 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2025-02-05 21:39:16,249 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=9, Invalid=11, Unknown=0, NotChecked=0, Total=20 [2025-02-05 21:39:16,250 INFO L87 Difference]: Start difference. First operand 6032 states and 9781 transitions. Second operand has 5 states, 5 states have (on average 19.8) internal successors, (99), 5 states have internal predecessors, (99), 1 states have call successors, (67), 1 states have call predecessors, (67), 1 states have return successors, (67), 1 states have call predecessors, (67), 1 states have call successors, (67) [2025-02-05 21:39:17,478 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-02-05 21:39:17,478 INFO L93 Difference]: Finished difference Result 21681 states and 35082 transitions. [2025-02-05 21:39:17,478 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2025-02-05 21:39:17,479 INFO L78 Accepts]: Start accepts. Automaton has has 5 states, 5 states have (on average 19.8) internal successors, (99), 5 states have internal predecessors, (99), 1 states have call successors, (67), 1 states have call predecessors, (67), 1 states have return successors, (67), 1 states have call predecessors, (67), 1 states have call successors, (67) Word has length 431 [2025-02-05 21:39:17,479 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-02-05 21:39:17,532 INFO L225 Difference]: With dead ends: 21681 [2025-02-05 21:39:17,532 INFO L226 Difference]: Without dead ends: 15652 [2025-02-05 21:39:17,551 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 10 GetRequests, 5 SyntacticMatches, 1 SemanticMatches, 4 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=14, Invalid=16, Unknown=0, NotChecked=0, Total=30 [2025-02-05 21:39:17,551 INFO L435 NwaCegarLoop]: 411 mSDtfsCounter, 442 mSDsluCounter, 1056 mSDsCounter, 0 mSdLazyCounter, 348 mSolverCounterSat, 5 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.5s Time, 0 mProtectedPredicate, 0 mProtectedAction, 442 SdHoareTripleChecker+Valid, 1467 SdHoareTripleChecker+Invalid, 353 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 5 IncrementalHoareTripleChecker+Valid, 348 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.6s IncrementalHoareTripleChecker+Time [2025-02-05 21:39:17,552 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [442 Valid, 1467 Invalid, 353 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [5 Valid, 348 Invalid, 0 Unknown, 0 Unchecked, 0.6s Time] [2025-02-05 21:39:17,561 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 15652 states. [2025-02-05 21:39:18,376 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 15652 to 15602. [2025-02-05 21:39:18,395 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 15602 states, 11422 states have (on average 1.5132201015583961) internal successors, (17284), 11554 states have internal predecessors, (17284), 3954 states have call successors, (3954), 225 states have call predecessors, (3954), 225 states have return successors, (3954), 3822 states have call predecessors, (3954), 3954 states have call successors, (3954) [2025-02-05 21:39:18,437 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 15602 states to 15602 states and 25192 transitions. [2025-02-05 21:39:18,451 INFO L78 Accepts]: Start accepts. Automaton has 15602 states and 25192 transitions. Word has length 431 [2025-02-05 21:39:18,452 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-02-05 21:39:18,452 INFO L471 AbstractCegarLoop]: Abstraction has 15602 states and 25192 transitions. [2025-02-05 21:39:18,452 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 19.8) internal successors, (99), 5 states have internal predecessors, (99), 1 states have call successors, (67), 1 states have call predecessors, (67), 1 states have return successors, (67), 1 states have call predecessors, (67), 1 states have call successors, (67) [2025-02-05 21:39:18,452 INFO L276 IsEmpty]: Start isEmpty. Operand 15602 states and 25192 transitions. [2025-02-05 21:39:18,460 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 432 [2025-02-05 21:39:18,461 INFO L210 NwaCegarLoop]: Found error trace [2025-02-05 21:39:18,461 INFO L218 NwaCegarLoop]: trace histogram [67, 67, 67, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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-02-05 21:39:18,461 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable12 [2025-02-05 21:39:18,461 INFO L396 AbstractCegarLoop]: === Iteration 14 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-02-05 21:39:18,462 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-02-05 21:39:18,462 INFO L85 PathProgramCache]: Analyzing trace with hash 933280900, now seen corresponding path program 1 times [2025-02-05 21:39:18,462 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-02-05 21:39:18,462 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1977805232] [2025-02-05 21:39:18,462 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-02-05 21:39:18,462 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-02-05 21:39:18,480 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 431 statements into 1 equivalence classes. [2025-02-05 21:39:18,590 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 431 of 431 statements. [2025-02-05 21:39:18,590 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-02-05 21:39:18,590 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-02-05 21:39:20,235 INFO L134 CoverageAnalysis]: Checked inductivity of 8844 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 8844 trivial. 0 not checked. [2025-02-05 21:39:20,236 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-02-05 21:39:20,236 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1977805232] [2025-02-05 21:39:20,236 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1977805232] provided 1 perfect and 0 imperfect interpolant sequences [2025-02-05 21:39:20,236 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-02-05 21:39:20,236 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [9] imperfect sequences [] total 9 [2025-02-05 21:39:20,236 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1755053818] [2025-02-05 21:39:20,236 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-02-05 21:39:20,237 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 9 states [2025-02-05 21:39:20,237 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-02-05 21:39:20,237 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2025-02-05 21:39:20,237 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=15, Invalid=57, Unknown=0, NotChecked=0, Total=72 [2025-02-05 21:39:20,237 INFO L87 Difference]: Start difference. First operand 15602 states and 25192 transitions. Second operand has 9 states, 9 states have (on average 11.0) internal successors, (99), 9 states have internal predecessors, (99), 3 states have call successors, (67), 1 states have call predecessors, (67), 1 states have return successors, (67), 3 states have call predecessors, (67), 3 states have call successors, (67) [2025-02-05 21:39:37,190 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-02-05 21:39:37,191 INFO L93 Difference]: Finished difference Result 123723 states and 197088 transitions. [2025-02-05 21:39:37,191 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 19 states. [2025-02-05 21:39:37,191 INFO L78 Accepts]: Start accepts. Automaton has has 9 states, 9 states have (on average 11.0) internal successors, (99), 9 states have internal predecessors, (99), 3 states have call successors, (67), 1 states have call predecessors, (67), 1 states have return successors, (67), 3 states have call predecessors, (67), 3 states have call successors, (67) Word has length 431 [2025-02-05 21:39:37,192 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-02-05 21:39:37,605 INFO L225 Difference]: With dead ends: 123723 [2025-02-05 21:39:37,606 INFO L226 Difference]: Without dead ends: 118165 [2025-02-05 21:39:37,650 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 46 GetRequests, 22 SyntacticMatches, 0 SemanticMatches, 24 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 119 ImplicationChecksByTransitivity, 1.1s TimeCoverageRelationStatistics Valid=203, Invalid=447, Unknown=0, NotChecked=0, Total=650 [2025-02-05 21:39:37,651 INFO L435 NwaCegarLoop]: 885 mSDtfsCounter, 4160 mSDsluCounter, 2681 mSDsCounter, 0 mSdLazyCounter, 2293 mSolverCounterSat, 2033 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 4.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 4160 SdHoareTripleChecker+Valid, 3566 SdHoareTripleChecker+Invalid, 4326 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 2033 IncrementalHoareTripleChecker+Valid, 2293 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 4.8s IncrementalHoareTripleChecker+Time [2025-02-05 21:39:37,651 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [4160 Valid, 3566 Invalid, 4326 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [2033 Valid, 2293 Invalid, 0 Unknown, 0 Unchecked, 4.8s Time] [2025-02-05 21:39:37,734 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 118165 states. [2025-02-05 21:39:47,217 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 118165 to 77842. [2025-02-05 21:39:47,294 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 77842 states, 56883 states have (on average 1.5001845894203891) internal successors, (85335), 57652 states have internal predecessors, (85335), 19739 states have call successors, (19739), 1219 states have call predecessors, (19739), 1219 states have return successors, (19739), 18970 states have call predecessors, (19739), 19739 states have call successors, (19739) [2025-02-05 21:39:47,474 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 77842 states to 77842 states and 124813 transitions. [2025-02-05 21:39:47,575 INFO L78 Accepts]: Start accepts. Automaton has 77842 states and 124813 transitions. Word has length 431 [2025-02-05 21:39:47,576 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-02-05 21:39:47,576 INFO L471 AbstractCegarLoop]: Abstraction has 77842 states and 124813 transitions. [2025-02-05 21:39:47,576 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 9 states, 9 states have (on average 11.0) internal successors, (99), 9 states have internal predecessors, (99), 3 states have call successors, (67), 1 states have call predecessors, (67), 1 states have return successors, (67), 3 states have call predecessors, (67), 3 states have call successors, (67) [2025-02-05 21:39:47,576 INFO L276 IsEmpty]: Start isEmpty. Operand 77842 states and 124813 transitions. [2025-02-05 21:39:47,600 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 432 [2025-02-05 21:39:47,600 INFO L210 NwaCegarLoop]: Found error trace [2025-02-05 21:39:47,600 INFO L218 NwaCegarLoop]: trace histogram [67, 67, 67, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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-02-05 21:39:47,600 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable13 [2025-02-05 21:39:47,601 INFO L396 AbstractCegarLoop]: === Iteration 15 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-02-05 21:39:47,601 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-02-05 21:39:47,601 INFO L85 PathProgramCache]: Analyzing trace with hash 1144631813, now seen corresponding path program 1 times [2025-02-05 21:39:47,601 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-02-05 21:39:47,601 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [273875334] [2025-02-05 21:39:47,601 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-02-05 21:39:47,601 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-02-05 21:39:47,622 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 431 statements into 1 equivalence classes. [2025-02-05 21:39:47,747 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 431 of 431 statements. [2025-02-05 21:39:47,747 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-02-05 21:39:47,747 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-02-05 21:39:47,920 INFO L134 CoverageAnalysis]: Checked inductivity of 8844 backedges. 15 proven. 183 refuted. 0 times theorem prover too weak. 8646 trivial. 0 not checked. [2025-02-05 21:39:47,921 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-02-05 21:39:47,921 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [273875334] [2025-02-05 21:39:47,921 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [273875334] provided 0 perfect and 1 imperfect interpolant sequences [2025-02-05 21:39:47,921 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1646665513] [2025-02-05 21:39:47,921 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-02-05 21:39:47,921 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-02-05 21:39:47,922 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 [2025-02-05 21:39:47,923 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-02-05 21:39:47,925 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-02-05 21:39:48,030 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 431 statements into 1 equivalence classes. [2025-02-05 21:39:48,312 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 431 of 431 statements. [2025-02-05 21:39:48,312 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-02-05 21:39:48,312 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-02-05 21:39:48,315 INFO L256 TraceCheckSpWp]: Trace formula consists of 992 conjuncts, 6 conjuncts are in the unsatisfiable core [2025-02-05 21:39:48,322 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-02-05 21:39:48,922 INFO L134 CoverageAnalysis]: Checked inductivity of 8844 backedges. 4216 proven. 123 refuted. 0 times theorem prover too weak. 4505 trivial. 0 not checked. [2025-02-05 21:39:48,923 INFO L312 TraceCheckSpWp]: Computing backward predicates... [2025-02-05 21:39:49,423 INFO L134 CoverageAnalysis]: Checked inductivity of 8844 backedges. 75 proven. 123 refuted. 0 times theorem prover too weak. 8646 trivial. 0 not checked. [2025-02-05 21:39:49,424 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1646665513] provided 0 perfect and 2 imperfect interpolant sequences [2025-02-05 21:39:49,424 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2025-02-05 21:39:49,424 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [5, 5, 5] total 9 [2025-02-05 21:39:49,425 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1038652325] [2025-02-05 21:39:49,426 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2025-02-05 21:39:49,426 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 9 states [2025-02-05 21:39:49,426 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-02-05 21:39:49,427 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2025-02-05 21:39:49,427 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=24, Invalid=48, Unknown=0, NotChecked=0, Total=72 [2025-02-05 21:39:49,428 INFO L87 Difference]: Start difference. First operand 77842 states and 124813 transitions. Second operand has 9 states, 9 states have (on average 26.333333333333332) internal successors, (237), 9 states have internal predecessors, (237), 4 states have call successors, (169), 2 states have call predecessors, (169), 4 states have return successors, (171), 4 states have call predecessors, (171), 4 states have call successors, (171) [2025-02-05 21:39:55,453 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-02-05 21:39:55,453 INFO L93 Difference]: Finished difference Result 137806 states and 220709 transitions. [2025-02-05 21:39:55,454 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 12 states. [2025-02-05 21:39:55,454 INFO L78 Accepts]: Start accepts. Automaton has has 9 states, 9 states have (on average 26.333333333333332) internal successors, (237), 9 states have internal predecessors, (237), 4 states have call successors, (169), 2 states have call predecessors, (169), 4 states have return successors, (171), 4 states have call predecessors, (171), 4 states have call successors, (171) Word has length 431 [2025-02-05 21:39:55,454 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-02-05 21:39:55,672 INFO L225 Difference]: With dead ends: 137806 [2025-02-05 21:39:55,672 INFO L226 Difference]: Without dead ends: 60008 [2025-02-05 21:39:55,795 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 874 GetRequests, 859 SyntacticMatches, 0 SemanticMatches, 15 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 21 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=94, Invalid=178, Unknown=0, NotChecked=0, Total=272 [2025-02-05 21:39:55,796 INFO L435 NwaCegarLoop]: 268 mSDtfsCounter, 612 mSDsluCounter, 399 mSDsCounter, 0 mSdLazyCounter, 429 mSolverCounterSat, 229 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.4s Time, 0 mProtectedPredicate, 0 mProtectedAction, 618 SdHoareTripleChecker+Valid, 667 SdHoareTripleChecker+Invalid, 658 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 229 IncrementalHoareTripleChecker+Valid, 429 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.5s IncrementalHoareTripleChecker+Time [2025-02-05 21:39:55,796 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [618 Valid, 667 Invalid, 658 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [229 Valid, 429 Invalid, 0 Unknown, 0 Unchecked, 0.5s Time] [2025-02-05 21:39:55,827 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 60008 states. [2025-02-05 21:40:01,755 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 60008 to 59118. [2025-02-05 21:40:01,828 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 59118 states, 47302 states have (on average 1.519808887573464) internal successors, (71890), 47675 states have internal predecessors, (71890), 10451 states have call successors, (10451), 1364 states have call predecessors, (10451), 1364 states have return successors, (10451), 10078 states have call predecessors, (10451), 10451 states have call successors, (10451) [2025-02-05 21:40:01,949 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 59118 states to 59118 states and 92792 transitions. [2025-02-05 21:40:01,992 INFO L78 Accepts]: Start accepts. Automaton has 59118 states and 92792 transitions. Word has length 431 [2025-02-05 21:40:01,993 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-02-05 21:40:01,993 INFO L471 AbstractCegarLoop]: Abstraction has 59118 states and 92792 transitions. [2025-02-05 21:40:01,993 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 9 states, 9 states have (on average 26.333333333333332) internal successors, (237), 9 states have internal predecessors, (237), 4 states have call successors, (169), 2 states have call predecessors, (169), 4 states have return successors, (171), 4 states have call predecessors, (171), 4 states have call successors, (171) [2025-02-05 21:40:01,993 INFO L276 IsEmpty]: Start isEmpty. Operand 59118 states and 92792 transitions. [2025-02-05 21:40:02,010 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 434 [2025-02-05 21:40:02,010 INFO L210 NwaCegarLoop]: Found error trace [2025-02-05 21:40:02,010 INFO L218 NwaCegarLoop]: trace histogram [67, 67, 67, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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-02-05 21:40:02,018 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-02-05 21:40:02,211 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 3 /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable14 [2025-02-05 21:40:02,211 INFO L396 AbstractCegarLoop]: === Iteration 16 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-02-05 21:40:02,212 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-02-05 21:40:02,212 INFO L85 PathProgramCache]: Analyzing trace with hash 299194324, now seen corresponding path program 1 times [2025-02-05 21:40:02,213 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-02-05 21:40:02,213 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [201652710] [2025-02-05 21:40:02,213 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-02-05 21:40:02,213 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-02-05 21:40:02,232 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 433 statements into 1 equivalence classes. [2025-02-05 21:40:02,303 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 433 of 433 statements. [2025-02-05 21:40:02,304 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-02-05 21:40:02,306 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-02-05 21:40:02,451 INFO L134 CoverageAnalysis]: Checked inductivity of 8844 backedges. 102 proven. 96 refuted. 0 times theorem prover too weak. 8646 trivial. 0 not checked. [2025-02-05 21:40:02,451 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-02-05 21:40:02,451 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [201652710] [2025-02-05 21:40:02,451 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [201652710] provided 0 perfect and 1 imperfect interpolant sequences [2025-02-05 21:40:02,451 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [2002272570] [2025-02-05 21:40:02,451 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-02-05 21:40:02,451 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-02-05 21:40:02,452 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 [2025-02-05 21:40:02,453 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-02-05 21:40:02,455 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-02-05 21:40:02,558 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 433 statements into 1 equivalence classes. [2025-02-05 21:40:02,641 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 433 of 433 statements. [2025-02-05 21:40:02,642 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-02-05 21:40:02,642 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-02-05 21:40:02,644 INFO L256 TraceCheckSpWp]: Trace formula consists of 990 conjuncts, 6 conjuncts are in the unsatisfiable core [2025-02-05 21:40:02,649 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-02-05 21:40:02,970 INFO L134 CoverageAnalysis]: Checked inductivity of 8844 backedges. 4108 proven. 69 refuted. 0 times theorem prover too weak. 4667 trivial. 0 not checked. [2025-02-05 21:40:02,970 INFO L312 TraceCheckSpWp]: Computing backward predicates... [2025-02-05 21:40:03,224 INFO L134 CoverageAnalysis]: Checked inductivity of 8844 backedges. 129 proven. 69 refuted. 0 times theorem prover too weak. 8646 trivial. 0 not checked. [2025-02-05 21:40:03,225 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [2002272570] provided 0 perfect and 2 imperfect interpolant sequences [2025-02-05 21:40:03,225 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2025-02-05 21:40:03,225 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [5, 5, 5] total 8 [2025-02-05 21:40:03,225 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1919875072] [2025-02-05 21:40:03,225 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2025-02-05 21:40:03,226 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 8 states [2025-02-05 21:40:03,226 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-02-05 21:40:03,227 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2025-02-05 21:40:03,227 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=19, Invalid=37, Unknown=0, NotChecked=0, Total=56 [2025-02-05 21:40:03,227 INFO L87 Difference]: Start difference. First operand 59118 states and 92792 transitions. Second operand has 8 states, 8 states have (on average 17.375) internal successors, (139), 8 states have internal predecessors, (139), 3 states have call successors, (122), 2 states have call predecessors, (122), 4 states have return successors, (124), 3 states have call predecessors, (124), 3 states have call successors, (124) [2025-02-05 21:40:07,035 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-02-05 21:40:07,036 INFO L93 Difference]: Finished difference Result 93802 states and 145639 transitions. [2025-02-05 21:40:07,036 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 14 states. [2025-02-05 21:40:07,036 INFO L78 Accepts]: Start accepts. Automaton has has 8 states, 8 states have (on average 17.375) internal successors, (139), 8 states have internal predecessors, (139), 3 states have call successors, (122), 2 states have call predecessors, (122), 4 states have return successors, (124), 3 states have call predecessors, (124), 3 states have call successors, (124) Word has length 433 [2025-02-05 21:40:07,037 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-02-05 21:40:07,165 INFO L225 Difference]: With dead ends: 93802 [2025-02-05 21:40:07,165 INFO L226 Difference]: Without dead ends: 34732 [2025-02-05 21:40:07,247 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 880 GetRequests, 863 SyntacticMatches, 1 SemanticMatches, 16 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 34 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=103, Invalid=203, Unknown=0, NotChecked=0, Total=306 [2025-02-05 21:40:07,248 INFO L435 NwaCegarLoop]: 311 mSDtfsCounter, 575 mSDsluCounter, 472 mSDsCounter, 0 mSdLazyCounter, 588 mSolverCounterSat, 216 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.3s Time, 0 mProtectedPredicate, 0 mProtectedAction, 610 SdHoareTripleChecker+Valid, 783 SdHoareTripleChecker+Invalid, 804 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 216 IncrementalHoareTripleChecker+Valid, 588 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.4s IncrementalHoareTripleChecker+Time [2025-02-05 21:40:07,248 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [610 Valid, 783 Invalid, 804 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [216 Valid, 588 Invalid, 0 Unknown, 0 Unchecked, 0.4s Time] [2025-02-05 21:40:07,268 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 34732 states. [2025-02-05 21:40:09,507 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 34732 to 21284. [2025-02-05 21:40:09,525 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 21284 states, 16284 states have (on average 1.447003193318595) internal successors, (23563), 16440 states have internal predecessors, (23563), 4379 states have call successors, (4379), 620 states have call predecessors, (4379), 620 states have return successors, (4379), 4223 states have call predecessors, (4379), 4379 states have call successors, (4379) [2025-02-05 21:40:09,562 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 21284 states to 21284 states and 32321 transitions. [2025-02-05 21:40:09,597 INFO L78 Accepts]: Start accepts. Automaton has 21284 states and 32321 transitions. Word has length 433 [2025-02-05 21:40:09,598 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-02-05 21:40:09,598 INFO L471 AbstractCegarLoop]: Abstraction has 21284 states and 32321 transitions. [2025-02-05 21:40:09,598 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 8 states, 8 states have (on average 17.375) internal successors, (139), 8 states have internal predecessors, (139), 3 states have call successors, (122), 2 states have call predecessors, (122), 4 states have return successors, (124), 3 states have call predecessors, (124), 3 states have call successors, (124) [2025-02-05 21:40:09,598 INFO L276 IsEmpty]: Start isEmpty. Operand 21284 states and 32321 transitions. [2025-02-05 21:40:09,606 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 435 [2025-02-05 21:40:09,606 INFO L210 NwaCegarLoop]: Found error trace [2025-02-05 21:40:09,606 INFO L218 NwaCegarLoop]: trace histogram [67, 67, 67, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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-02-05 21:40:09,616 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-02-05 21:40:09,806 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable15,4 /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-02-05 21:40:09,807 INFO L396 AbstractCegarLoop]: === Iteration 17 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-02-05 21:40:09,807 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-02-05 21:40:09,808 INFO L85 PathProgramCache]: Analyzing trace with hash -92266163, now seen corresponding path program 1 times [2025-02-05 21:40:09,808 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-02-05 21:40:09,808 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1218589966] [2025-02-05 21:40:09,808 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-02-05 21:40:09,808 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-02-05 21:40:09,823 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 434 statements into 1 equivalence classes. [2025-02-05 21:40:09,853 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 434 of 434 statements. [2025-02-05 21:40:09,853 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-02-05 21:40:09,854 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-02-05 21:40:10,566 INFO L134 CoverageAnalysis]: Checked inductivity of 8844 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 8844 trivial. 0 not checked. [2025-02-05 21:40:10,566 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-02-05 21:40:10,566 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1218589966] [2025-02-05 21:40:10,566 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1218589966] provided 1 perfect and 0 imperfect interpolant sequences [2025-02-05 21:40:10,566 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-02-05 21:40:10,567 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [10] imperfect sequences [] total 10 [2025-02-05 21:40:10,567 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [476177233] [2025-02-05 21:40:10,567 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-02-05 21:40:10,567 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 10 states [2025-02-05 21:40:10,567 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-02-05 21:40:10,568 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 10 interpolants. [2025-02-05 21:40:10,568 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=20, Invalid=70, Unknown=0, NotChecked=0, Total=90 [2025-02-05 21:40:10,569 INFO L87 Difference]: Start difference. First operand 21284 states and 32321 transitions. Second operand has 10 states, 10 states have (on average 10.2) internal successors, (102), 10 states have internal predecessors, (102), 1 states have call successors, (67), 1 states have call predecessors, (67), 1 states have return successors, (67), 1 states have call predecessors, (67), 1 states have call successors, (67)