./Ultimate.py --spec ../sv-benchmarks/c/properties/unreach-call.prp --file ../sv-benchmarks/c/hardness-nfm22/hardness_fillercode_fillercodesize_ps-cn-500_file-2.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-500_file-2.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 8d5a9dc649f7d9ee20b528a56ea1dacc56986892fbe7bb53a5fab357faf2d873 --- Real Ultimate output --- This is Ultimate 0.3.0-?-c00e63d-m [2025-02-05 21:55:42,384 INFO L188 SettingsManager]: Resetting all preferences to default values... [2025-02-05 21:55:42,448 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:55:42,453 WARN L101 SettingsManager]: Preference file contains the following unknown settings: [2025-02-05 21:55:42,454 WARN L103 SettingsManager]: * de.uni_freiburg.informatik.ultimate.core.Log level for class [2025-02-05 21:55:42,473 INFO L130 SettingsManager]: Preferences different from defaults after loading the file: [2025-02-05 21:55:42,474 INFO L151 SettingsManager]: Preferences of UltimateCore differ from their defaults: [2025-02-05 21:55:42,474 INFO L153 SettingsManager]: * Log level for class=de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher=ERROR; [2025-02-05 21:55:42,474 INFO L151 SettingsManager]: Preferences of Boogie Preprocessor differ from their defaults: [2025-02-05 21:55:42,475 INFO L153 SettingsManager]: * Use memory slicer=true [2025-02-05 21:55:42,476 INFO L151 SettingsManager]: Preferences of Boogie Procedure Inliner differ from their defaults: [2025-02-05 21:55:42,476 INFO L153 SettingsManager]: * Ignore calls to procedures called more than once=ONLY_FOR_SEQUENTIAL_PROGRAMS [2025-02-05 21:55:42,476 INFO L151 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2025-02-05 21:55:42,476 INFO L153 SettingsManager]: * Create parallel compositions if possible=false [2025-02-05 21:55:42,476 INFO L153 SettingsManager]: * Use SBE=true [2025-02-05 21:55:42,476 INFO L151 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2025-02-05 21:55:42,477 INFO L153 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2025-02-05 21:55:42,477 INFO L153 SettingsManager]: * sizeof long=4 [2025-02-05 21:55:42,477 INFO L153 SettingsManager]: * Overapproximate operations on floating types=true [2025-02-05 21:55:42,477 INFO L153 SettingsManager]: * sizeof POINTER=4 [2025-02-05 21:55:42,477 INFO L153 SettingsManager]: * Check division by zero=IGNORE [2025-02-05 21:55:42,477 INFO L153 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2025-02-05 21:55:42,478 INFO L153 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2025-02-05 21:55:42,478 INFO L153 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2025-02-05 21:55:42,478 INFO L153 SettingsManager]: * sizeof long double=12 [2025-02-05 21:55:42,478 INFO L153 SettingsManager]: * Check if freed pointer was valid=false [2025-02-05 21:55:42,478 INFO L153 SettingsManager]: * Behaviour of calls to undefined functions=OVERAPPROXIMATE_BEHAVIOUR [2025-02-05 21:55:42,478 INFO L153 SettingsManager]: * Use constant arrays=true [2025-02-05 21:55:42,478 INFO L151 SettingsManager]: Preferences of IcfgBuilder differ from their defaults: [2025-02-05 21:55:42,478 INFO L153 SettingsManager]: * Size of a code block=SequenceOfStatements [2025-02-05 21:55:42,478 INFO L153 SettingsManager]: * Only consider context switches at boundaries of atomic blocks=true [2025-02-05 21:55:42,478 INFO L153 SettingsManager]: * SMT solver=External_DefaultMode [2025-02-05 21:55:42,479 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2025-02-05 21:55:42,479 INFO L151 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2025-02-05 21:55:42,479 INFO L153 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2025-02-05 21:55:42,479 INFO L153 SettingsManager]: * Compute procedure contracts=false [2025-02-05 21:55:42,479 INFO L153 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopHeads [2025-02-05 21:55:42,480 INFO L153 SettingsManager]: * Trace refinement strategy=CAMEL [2025-02-05 21:55:42,480 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2025-02-05 21:55:42,480 INFO L153 SettingsManager]: * Apply one-shot large block encoding in concurrent analysis=false [2025-02-05 21:55:42,480 INFO L153 SettingsManager]: * Automaton type used in concurrency analysis=PETRI_NET [2025-02-05 21:55:42,480 INFO L153 SettingsManager]: * Order on configurations for Petri net unfoldings=DBO [2025-02-05 21:55:42,480 INFO L153 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode [2025-02-05 21:55:42,480 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 -> 8d5a9dc649f7d9ee20b528a56ea1dacc56986892fbe7bb53a5fab357faf2d873 [2025-02-05 21:55:42,907 INFO L75 nceAwareModelManager]: Repository-Root is: /tmp [2025-02-05 21:55:42,917 INFO L261 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2025-02-05 21:55:42,919 INFO L217 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2025-02-05 21:55:42,920 INFO L270 PluginConnector]: Initializing CDTParser... [2025-02-05 21:55:42,921 INFO L274 PluginConnector]: CDTParser initialized [2025-02-05 21:55:42,922 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-500_file-2.i [2025-02-05 21:55:44,200 INFO L533 CDTParser]: Created temporary CDT project at /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/data/9725d159c/21858351369a44dfb53027d1f5cdfadd/FLAGf2cb11524 [2025-02-05 21:55:44,561 INFO L384 CDTParser]: Found 1 translation units. [2025-02-05 21:55:44,563 INFO L180 CDTParser]: Scanning /storage/repos/ultimate-jdk21/releaseScripts/default/sv-benchmarks/c/hardness-nfm22/hardness_fillercode_fillercodesize_ps-cn-500_file-2.i [2025-02-05 21:55:44,578 INFO L427 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/data/9725d159c/21858351369a44dfb53027d1f5cdfadd/FLAGf2cb11524 [2025-02-05 21:55:44,770 INFO L435 CDTParser]: Successfully deleted /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/data/9725d159c/21858351369a44dfb53027d1f5cdfadd [2025-02-05 21:55:44,772 INFO L299 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2025-02-05 21:55:44,773 INFO L133 ToolchainWalker]: Walking toolchain with 6 elements. [2025-02-05 21:55:44,774 INFO L112 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2025-02-05 21:55:44,774 INFO L270 PluginConnector]: Initializing CACSL2BoogieTranslator... [2025-02-05 21:55:44,778 INFO L274 PluginConnector]: CACSL2BoogieTranslator initialized [2025-02-05 21:55:44,780 INFO L184 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 05.02 09:55:44" (1/1) ... [2025-02-05 21:55:44,782 INFO L204 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@2b533ee8 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 05.02 09:55:44, skipping insertion in model container [2025-02-05 21:55:44,783 INFO L184 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 05.02 09:55:44" (1/1) ... [2025-02-05 21:55:44,819 INFO L175 MainTranslator]: Built tables and reachable declarations [2025-02-05 21:55:44,978 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-500_file-2.i[915,928] [2025-02-05 21:55:45,196 INFO L210 PostProcessor]: Analyzing one entry point: main [2025-02-05 21:55:45,219 INFO L200 MainTranslator]: Completed pre-run [2025-02-05 21:55:45,231 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-500_file-2.i[915,928] [2025-02-05 21:55:45,345 INFO L210 PostProcessor]: Analyzing one entry point: main [2025-02-05 21:55:45,367 INFO L204 MainTranslator]: Completed translation [2025-02-05 21:55:45,368 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 05.02 09:55:45 WrapperNode [2025-02-05 21:55:45,368 INFO L131 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2025-02-05 21:55:45,369 INFO L112 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2025-02-05 21:55:45,369 INFO L270 PluginConnector]: Initializing Boogie Procedure Inliner... [2025-02-05 21:55:45,369 INFO L274 PluginConnector]: Boogie Procedure Inliner initialized [2025-02-05 21:55:45,377 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:55:45" (1/1) ... [2025-02-05 21:55:45,408 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:55:45" (1/1) ... [2025-02-05 21:55:45,497 INFO L138 Inliner]: procedures = 26, calls = 112, calls flagged for inlining = 8, calls inlined = 8, statements flattened = 818 [2025-02-05 21:55:45,497 INFO L131 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2025-02-05 21:55:45,498 INFO L112 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2025-02-05 21:55:45,499 INFO L270 PluginConnector]: Initializing Boogie Preprocessor... [2025-02-05 21:55:45,499 INFO L274 PluginConnector]: Boogie Preprocessor initialized [2025-02-05 21:55:45,507 INFO L184 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 05.02 09:55:45" (1/1) ... [2025-02-05 21:55:45,508 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 05.02 09:55:45" (1/1) ... [2025-02-05 21:55:45,526 INFO L184 PluginConnector]: Executing the observer MemorySlicer from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 05.02 09:55:45" (1/1) ... [2025-02-05 21:55:45,575 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:55:45,576 INFO L184 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 05.02 09:55:45" (1/1) ... [2025-02-05 21:55:45,576 INFO L184 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 05.02 09:55:45" (1/1) ... [2025-02-05 21:55:45,613 INFO L184 PluginConnector]: Executing the observer ReplaceArrayAssignments from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 05.02 09:55:45" (1/1) ... [2025-02-05 21:55:45,622 INFO L184 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 05.02 09:55:45" (1/1) ... [2025-02-05 21:55:45,635 INFO L184 PluginConnector]: Executing the observer LTLStepAnnotator from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 05.02 09:55:45" (1/1) ... [2025-02-05 21:55:45,642 INFO L184 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 05.02 09:55:45" (1/1) ... [2025-02-05 21:55:45,657 INFO L131 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2025-02-05 21:55:45,659 INFO L112 PluginConnector]: ------------------------IcfgBuilder---------------------------- [2025-02-05 21:55:45,659 INFO L270 PluginConnector]: Initializing IcfgBuilder... [2025-02-05 21:55:45,659 INFO L274 PluginConnector]: IcfgBuilder initialized [2025-02-05 21:55:45,660 INFO L184 PluginConnector]: Executing the observer IcfgBuilderObserver from plugin IcfgBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 05.02 09:55:45" (1/1) ... [2025-02-05 21:55:45,666 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2025-02-05 21:55:45,680 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 [2025-02-05 21:55:45,698 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:55:45,703 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:55:45,728 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocInit [2025-02-05 21:55:45,729 INFO L130 BoogieDeclarations]: Found specification of procedure assume_abort_if_not [2025-02-05 21:55:45,729 INFO L138 BoogieDeclarations]: Found implementation of procedure assume_abort_if_not [2025-02-05 21:55:45,729 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int#0 [2025-02-05 21:55:45,729 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2025-02-05 21:55:45,729 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2025-02-05 21:55:45,892 INFO L257 CfgBuilder]: Building ICFG [2025-02-05 21:55:45,895 INFO L287 CfgBuilder]: Building CFG for each procedure with an implementation [2025-02-05 21:55:47,249 INFO L? ?]: Removed 15 outVars from TransFormulas that were not future-live. [2025-02-05 21:55:47,250 INFO L308 CfgBuilder]: Performing block encoding [2025-02-05 21:55:47,297 INFO L332 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2025-02-05 21:55:47,300 INFO L337 CfgBuilder]: Removed 1 assume(true) statements. [2025-02-05 21:55:47,301 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.icfgbuilder CFG 05.02 09:55:47 BoogieIcfgContainer [2025-02-05 21:55:47,301 INFO L131 PluginConnector]: ------------------------ END IcfgBuilder---------------------------- [2025-02-05 21:55:47,303 INFO L112 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2025-02-05 21:55:47,303 INFO L270 PluginConnector]: Initializing TraceAbstraction... [2025-02-05 21:55:47,308 INFO L274 PluginConnector]: TraceAbstraction initialized [2025-02-05 21:55:47,309 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 05.02 09:55:44" (1/3) ... [2025-02-05 21:55:47,310 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@3c895f7d and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 05.02 09:55:47, skipping insertion in model container [2025-02-05 21:55:47,310 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 05.02 09:55:45" (2/3) ... [2025-02-05 21:55:47,310 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@3c895f7d and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 05.02 09:55:47, skipping insertion in model container [2025-02-05 21:55:47,311 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.icfgbuilder CFG 05.02 09:55:47" (3/3) ... [2025-02-05 21:55:47,312 INFO L128 eAbstractionObserver]: Analyzing ICFG hardness_fillercode_fillercodesize_ps-cn-500_file-2.i [2025-02-05 21:55:47,325 INFO L216 ceAbstractionStarter]: Automizer settings: Hoare:LoopHeads NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2025-02-05 21:55:47,329 INFO L151 ceAbstractionStarter]: Applying trace abstraction to ICFG hardness_fillercode_fillercodesize_ps-cn-500_file-2.i that has 2 procedures, 334 locations, 1 initial locations, 1 loop locations, and 1 error locations. [2025-02-05 21:55:47,405 INFO L332 AbstractCegarLoop]: ======== Iteration 0 == of CEGAR loop == AllErrorsAtOnce ======== [2025-02-05 21:55:47,418 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;@1b2e6b70, mLbeIndependenceSettings=[IndependenceType=SEMANTIC, AbstractionType=NONE, UseConditional=false, UseSemiCommutativity=true, Solver=Z3, SolverTimeout=1000ms] [2025-02-05 21:55:47,420 INFO L334 AbstractCegarLoop]: Starting to check reachability of 1 error locations. [2025-02-05 21:55:47,427 INFO L276 IsEmpty]: Start isEmpty. Operand has 334 states, 232 states have (on average 1.581896551724138) internal successors, (367), 233 states have internal predecessors, (367), 99 states have call successors, (99), 1 states have call predecessors, (99), 1 states have return successors, (99), 99 states have call predecessors, (99), 99 states have call successors, (99) [2025-02-05 21:55:47,464 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 643 [2025-02-05 21:55:47,465 INFO L210 NwaCegarLoop]: Found error trace [2025-02-05 21:55:47,466 INFO L218 NwaCegarLoop]: trace histogram [99, 99, 99, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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:55:47,467 INFO L396 AbstractCegarLoop]: === Iteration 1 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-02-05 21:55:47,472 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-02-05 21:55:47,473 INFO L85 PathProgramCache]: Analyzing trace with hash -1535950885, now seen corresponding path program 1 times [2025-02-05 21:55:47,479 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-02-05 21:55:47,479 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [577603289] [2025-02-05 21:55:47,480 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-02-05 21:55:47,480 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-02-05 21:55:47,614 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 642 statements into 1 equivalence classes. [2025-02-05 21:55:47,685 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 642 of 642 statements. [2025-02-05 21:55:47,686 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-02-05 21:55:47,686 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-02-05 21:55:48,218 INFO L134 CoverageAnalysis]: Checked inductivity of 19404 backedges. 0 proven. 196 refuted. 0 times theorem prover too weak. 19208 trivial. 0 not checked. [2025-02-05 21:55:48,218 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-02-05 21:55:48,219 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [577603289] [2025-02-05 21:55:48,220 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [577603289] provided 0 perfect and 1 imperfect interpolant sequences [2025-02-05 21:55:48,220 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1256361278] [2025-02-05 21:55:48,220 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-02-05 21:55:48,221 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-02-05 21:55:48,221 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 [2025-02-05 21:55:48,224 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:55:48,227 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:55:48,423 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 642 statements into 1 equivalence classes. [2025-02-05 21:55:48,649 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 642 of 642 statements. [2025-02-05 21:55:48,649 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-02-05 21:55:48,649 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-02-05 21:55:48,658 INFO L256 TraceCheckSpWp]: Trace formula consists of 1458 conjuncts, 1 conjuncts are in the unsatisfiable core [2025-02-05 21:55:48,690 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-02-05 21:55:48,779 INFO L134 CoverageAnalysis]: Checked inductivity of 19404 backedges. 196 proven. 0 refuted. 0 times theorem prover too weak. 19208 trivial. 0 not checked. [2025-02-05 21:55:48,780 INFO L308 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2025-02-05 21:55:48,780 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1256361278] provided 1 perfect and 0 imperfect interpolant sequences [2025-02-05 21:55:48,780 INFO L185 FreeRefinementEngine]: Found 1 perfect and 1 imperfect interpolant sequences. [2025-02-05 21:55:48,781 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [2] total 2 [2025-02-05 21:55:48,783 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1965405449] [2025-02-05 21:55:48,784 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-02-05 21:55:48,790 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 2 states [2025-02-05 21:55:48,792 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-02-05 21:55:48,809 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 2 interpolants. [2025-02-05 21:55:48,810 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=1, Invalid=1, Unknown=0, NotChecked=0, Total=2 [2025-02-05 21:55:48,814 INFO L87 Difference]: Start difference. First operand has 334 states, 232 states have (on average 1.581896551724138) internal successors, (367), 233 states have internal predecessors, (367), 99 states have call successors, (99), 1 states have call predecessors, (99), 1 states have return successors, (99), 99 states have call predecessors, (99), 99 states have call successors, (99) Second operand has 2 states, 2 states have (on average 76.0) internal successors, (152), 2 states have internal predecessors, (152), 2 states have call successors, (99), 2 states have call predecessors, (99), 1 states have return successors, (99), 1 states have call predecessors, (99), 2 states have call successors, (99) [2025-02-05 21:55:48,899 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-02-05 21:55:48,899 INFO L93 Difference]: Finished difference Result 661 states and 1222 transitions. [2025-02-05 21:55:48,901 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 2 states. [2025-02-05 21:55:48,903 INFO L78 Accepts]: Start accepts. Automaton has has 2 states, 2 states have (on average 76.0) internal successors, (152), 2 states have internal predecessors, (152), 2 states have call successors, (99), 2 states have call predecessors, (99), 1 states have return successors, (99), 1 states have call predecessors, (99), 2 states have call successors, (99) Word has length 642 [2025-02-05 21:55:48,903 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-02-05 21:55:48,911 INFO L225 Difference]: With dead ends: 661 [2025-02-05 21:55:48,911 INFO L226 Difference]: Without dead ends: 330 [2025-02-05 21:55:48,916 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 643 GetRequests, 643 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:55:48,919 INFO L435 NwaCegarLoop]: 535 mSDtfsCounter, 0 mSDsluCounter, 0 mSDsCounter, 0 mSdLazyCounter, 17 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 0 SdHoareTripleChecker+Valid, 535 SdHoareTripleChecker+Invalid, 17 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 17 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2025-02-05 21:55:48,919 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [0 Valid, 535 Invalid, 17 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 17 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2025-02-05 21:55:48,932 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 330 states. [2025-02-05 21:55:48,996 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 330 to 330. [2025-02-05 21:55:48,998 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 330 states, 229 states have (on average 1.5458515283842795) internal successors, (354), 229 states have internal predecessors, (354), 99 states have call successors, (99), 1 states have call predecessors, (99), 1 states have return successors, (99), 99 states have call predecessors, (99), 99 states have call successors, (99) [2025-02-05 21:55:49,006 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 330 states to 330 states and 552 transitions. [2025-02-05 21:55:49,008 INFO L78 Accepts]: Start accepts. Automaton has 330 states and 552 transitions. Word has length 642 [2025-02-05 21:55:49,008 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-02-05 21:55:49,009 INFO L471 AbstractCegarLoop]: Abstraction has 330 states and 552 transitions. [2025-02-05 21:55:49,009 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 2 states, 2 states have (on average 76.0) internal successors, (152), 2 states have internal predecessors, (152), 2 states have call successors, (99), 2 states have call predecessors, (99), 1 states have return successors, (99), 1 states have call predecessors, (99), 2 states have call successors, (99) [2025-02-05 21:55:49,009 INFO L276 IsEmpty]: Start isEmpty. Operand 330 states and 552 transitions. [2025-02-05 21:55:49,025 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 644 [2025-02-05 21:55:49,026 INFO L210 NwaCegarLoop]: Found error trace [2025-02-05 21:55:49,026 INFO L218 NwaCegarLoop]: trace histogram [99, 99, 99, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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:55:49,037 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:55:49,230 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:55:49,230 INFO L396 AbstractCegarLoop]: === Iteration 2 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-02-05 21:55:49,231 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-02-05 21:55:49,231 INFO L85 PathProgramCache]: Analyzing trace with hash 1887949195, now seen corresponding path program 1 times [2025-02-05 21:55:49,232 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-02-05 21:55:49,232 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1154860831] [2025-02-05 21:55:49,232 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-02-05 21:55:49,232 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-02-05 21:55:49,291 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 643 statements into 1 equivalence classes. [2025-02-05 21:55:49,420 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 643 of 643 statements. [2025-02-05 21:55:49,420 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-02-05 21:55:49,420 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-02-05 21:55:50,110 INFO L134 CoverageAnalysis]: Checked inductivity of 19404 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 19404 trivial. 0 not checked. [2025-02-05 21:55:50,112 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-02-05 21:55:50,112 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1154860831] [2025-02-05 21:55:50,112 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1154860831] provided 1 perfect and 0 imperfect interpolant sequences [2025-02-05 21:55:50,112 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-02-05 21:55:50,113 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2025-02-05 21:55:50,113 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1238927157] [2025-02-05 21:55:50,113 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-02-05 21:55:50,115 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2025-02-05 21:55:50,117 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-02-05 21:55:50,118 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2025-02-05 21:55:50,119 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-02-05 21:55:50,120 INFO L87 Difference]: Start difference. First operand 330 states and 552 transitions. Second operand has 3 states, 3 states have (on average 50.333333333333336) internal successors, (151), 3 states have internal predecessors, (151), 1 states have call successors, (99), 1 states have call predecessors, (99), 1 states have return successors, (99), 1 states have call predecessors, (99), 1 states have call successors, (99) [2025-02-05 21:55:50,292 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-02-05 21:55:50,293 INFO L93 Difference]: Finished difference Result 851 states and 1429 transitions. [2025-02-05 21:55:50,294 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2025-02-05 21:55:50,294 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 50.333333333333336) internal successors, (151), 3 states have internal predecessors, (151), 1 states have call successors, (99), 1 states have call predecessors, (99), 1 states have return successors, (99), 1 states have call predecessors, (99), 1 states have call successors, (99) Word has length 643 [2025-02-05 21:55:50,297 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-02-05 21:55:50,303 INFO L225 Difference]: With dead ends: 851 [2025-02-05 21:55:50,304 INFO L226 Difference]: Without dead ends: 524 [2025-02-05 21:55:50,306 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:55:50,306 INFO L435 NwaCegarLoop]: 586 mSDtfsCounter, 334 mSDsluCounter, 498 mSDsCounter, 0 mSdLazyCounter, 53 mSolverCounterSat, 11 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 334 SdHoareTripleChecker+Valid, 1084 SdHoareTripleChecker+Invalid, 64 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 11 IncrementalHoareTripleChecker+Valid, 53 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2025-02-05 21:55:50,307 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [334 Valid, 1084 Invalid, 64 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [11 Valid, 53 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2025-02-05 21:55:50,308 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 524 states. [2025-02-05 21:55:50,377 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 524 to 521. [2025-02-05 21:55:50,379 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 521 states, 392 states have (on average 1.5841836734693877) internal successors, (621), 393 states have internal predecessors, (621), 126 states have call successors, (126), 2 states have call predecessors, (126), 2 states have return successors, (126), 125 states have call predecessors, (126), 126 states have call successors, (126) [2025-02-05 21:55:50,385 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 521 states to 521 states and 873 transitions. [2025-02-05 21:55:50,388 INFO L78 Accepts]: Start accepts. Automaton has 521 states and 873 transitions. Word has length 643 [2025-02-05 21:55:50,391 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-02-05 21:55:50,391 INFO L471 AbstractCegarLoop]: Abstraction has 521 states and 873 transitions. [2025-02-05 21:55:50,392 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 50.333333333333336) internal successors, (151), 3 states have internal predecessors, (151), 1 states have call successors, (99), 1 states have call predecessors, (99), 1 states have return successors, (99), 1 states have call predecessors, (99), 1 states have call successors, (99) [2025-02-05 21:55:50,392 INFO L276 IsEmpty]: Start isEmpty. Operand 521 states and 873 transitions. [2025-02-05 21:55:50,410 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 644 [2025-02-05 21:55:50,410 INFO L210 NwaCegarLoop]: Found error trace [2025-02-05 21:55:50,411 INFO L218 NwaCegarLoop]: trace histogram [99, 99, 99, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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:55:50,411 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable1 [2025-02-05 21:55:50,411 INFO L396 AbstractCegarLoop]: === Iteration 3 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-02-05 21:55:50,413 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-02-05 21:55:50,413 INFO L85 PathProgramCache]: Analyzing trace with hash -2091465269, now seen corresponding path program 1 times [2025-02-05 21:55:50,413 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-02-05 21:55:50,414 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1434372753] [2025-02-05 21:55:50,415 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-02-05 21:55:50,415 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-02-05 21:55:50,475 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 643 statements into 1 equivalence classes. [2025-02-05 21:55:50,554 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 643 of 643 statements. [2025-02-05 21:55:50,558 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-02-05 21:55:50,558 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-02-05 21:55:50,844 INFO L134 CoverageAnalysis]: Checked inductivity of 19404 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 19404 trivial. 0 not checked. [2025-02-05 21:55:50,845 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-02-05 21:55:50,845 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1434372753] [2025-02-05 21:55:50,845 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1434372753] provided 1 perfect and 0 imperfect interpolant sequences [2025-02-05 21:55:50,845 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-02-05 21:55:50,845 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2025-02-05 21:55:50,846 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1492051254] [2025-02-05 21:55:50,846 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-02-05 21:55:50,847 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2025-02-05 21:55:50,847 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-02-05 21:55:50,848 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2025-02-05 21:55:50,848 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-02-05 21:55:50,848 INFO L87 Difference]: Start difference. First operand 521 states and 873 transitions. Second operand has 3 states, 3 states have (on average 50.333333333333336) internal successors, (151), 3 states have internal predecessors, (151), 1 states have call successors, (99), 1 states have call predecessors, (99), 1 states have return successors, (99), 1 states have call predecessors, (99), 1 states have call successors, (99) [2025-02-05 21:55:50,963 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-02-05 21:55:50,964 INFO L93 Difference]: Finished difference Result 1046 states and 1748 transitions. [2025-02-05 21:55:50,964 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2025-02-05 21:55:50,965 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 50.333333333333336) internal successors, (151), 3 states have internal predecessors, (151), 1 states have call successors, (99), 1 states have call predecessors, (99), 1 states have return successors, (99), 1 states have call predecessors, (99), 1 states have call successors, (99) Word has length 643 [2025-02-05 21:55:50,966 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-02-05 21:55:50,970 INFO L225 Difference]: With dead ends: 1046 [2025-02-05 21:55:50,970 INFO L226 Difference]: Without dead ends: 528 [2025-02-05 21:55:50,971 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:55:50,972 INFO L435 NwaCegarLoop]: 606 mSDtfsCounter, 280 mSDsluCounter, 517 mSDsCounter, 0 mSdLazyCounter, 53 mSolverCounterSat, 3 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 280 SdHoareTripleChecker+Valid, 1123 SdHoareTripleChecker+Invalid, 56 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 3 IncrementalHoareTripleChecker+Valid, 53 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2025-02-05 21:55:50,972 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [280 Valid, 1123 Invalid, 56 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [3 Valid, 53 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2025-02-05 21:55:50,974 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 528 states. [2025-02-05 21:55:51,028 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 528 to 453. [2025-02-05 21:55:51,029 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 453 states, 351 states have (on average 1.601139601139601) internal successors, (562), 351 states have internal predecessors, (562), 99 states have call successors, (99), 2 states have call predecessors, (99), 2 states have return successors, (99), 99 states have call predecessors, (99), 99 states have call successors, (99) [2025-02-05 21:55:51,033 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 453 states to 453 states and 760 transitions. [2025-02-05 21:55:51,034 INFO L78 Accepts]: Start accepts. Automaton has 453 states and 760 transitions. Word has length 643 [2025-02-05 21:55:51,038 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-02-05 21:55:51,038 INFO L471 AbstractCegarLoop]: Abstraction has 453 states and 760 transitions. [2025-02-05 21:55:51,038 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 50.333333333333336) internal successors, (151), 3 states have internal predecessors, (151), 1 states have call successors, (99), 1 states have call predecessors, (99), 1 states have return successors, (99), 1 states have call predecessors, (99), 1 states have call successors, (99) [2025-02-05 21:55:51,038 INFO L276 IsEmpty]: Start isEmpty. Operand 453 states and 760 transitions. [2025-02-05 21:55:51,045 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 644 [2025-02-05 21:55:51,046 INFO L210 NwaCegarLoop]: Found error trace [2025-02-05 21:55:51,047 INFO L218 NwaCegarLoop]: trace histogram [99, 99, 99, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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:55:51,047 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable2 [2025-02-05 21:55:51,047 INFO L396 AbstractCegarLoop]: === Iteration 4 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-02-05 21:55:51,048 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-02-05 21:55:51,048 INFO L85 PathProgramCache]: Analyzing trace with hash 874356076, now seen corresponding path program 1 times [2025-02-05 21:55:51,049 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-02-05 21:55:51,049 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [492983549] [2025-02-05 21:55:51,049 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-02-05 21:55:51,049 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-02-05 21:55:51,098 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 643 statements into 1 equivalence classes. [2025-02-05 21:55:51,161 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 643 of 643 statements. [2025-02-05 21:55:51,161 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-02-05 21:55:51,161 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-02-05 21:55:51,442 INFO L134 CoverageAnalysis]: Checked inductivity of 19404 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 19404 trivial. 0 not checked. [2025-02-05 21:55:51,443 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-02-05 21:55:51,443 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [492983549] [2025-02-05 21:55:51,443 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [492983549] provided 1 perfect and 0 imperfect interpolant sequences [2025-02-05 21:55:51,443 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-02-05 21:55:51,443 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2025-02-05 21:55:51,443 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [965009820] [2025-02-05 21:55:51,443 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-02-05 21:55:51,444 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2025-02-05 21:55:51,444 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-02-05 21:55:51,445 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2025-02-05 21:55:51,445 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-02-05 21:55:51,445 INFO L87 Difference]: Start difference. First operand 453 states and 760 transitions. Second operand has 3 states, 3 states have (on average 50.333333333333336) internal successors, (151), 3 states have internal predecessors, (151), 1 states have call successors, (99), 1 states have call predecessors, (99), 1 states have return successors, (99), 1 states have call predecessors, (99), 1 states have call successors, (99) [2025-02-05 21:55:51,546 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-02-05 21:55:51,547 INFO L93 Difference]: Finished difference Result 1164 states and 1947 transitions. [2025-02-05 21:55:51,547 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2025-02-05 21:55:51,548 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 50.333333333333336) internal successors, (151), 3 states have internal predecessors, (151), 1 states have call successors, (99), 1 states have call predecessors, (99), 1 states have return successors, (99), 1 states have call predecessors, (99), 1 states have call successors, (99) Word has length 643 [2025-02-05 21:55:51,549 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-02-05 21:55:51,556 INFO L225 Difference]: With dead ends: 1164 [2025-02-05 21:55:51,557 INFO L226 Difference]: Without dead ends: 714 [2025-02-05 21:55:51,559 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:55:51,561 INFO L435 NwaCegarLoop]: 794 mSDtfsCounter, 303 mSDsluCounter, 520 mSDsCounter, 0 mSdLazyCounter, 50 mSolverCounterSat, 1 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 303 SdHoareTripleChecker+Valid, 1314 SdHoareTripleChecker+Invalid, 51 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 1 IncrementalHoareTripleChecker+Valid, 50 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2025-02-05 21:55:51,561 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [303 Valid, 1314 Invalid, 51 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [1 Valid, 50 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2025-02-05 21:55:51,563 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 714 states. [2025-02-05 21:55:51,608 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 714 to 711. [2025-02-05 21:55:51,609 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 711 states, 545 states have (on average 1.5853211009174313) internal successors, (864), 546 states have internal predecessors, (864), 161 states have call successors, (161), 4 states have call predecessors, (161), 4 states have return successors, (161), 160 states have call predecessors, (161), 161 states have call successors, (161) [2025-02-05 21:55:51,613 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 711 states to 711 states and 1186 transitions. [2025-02-05 21:55:51,615 INFO L78 Accepts]: Start accepts. Automaton has 711 states and 1186 transitions. Word has length 643 [2025-02-05 21:55:51,616 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-02-05 21:55:51,617 INFO L471 AbstractCegarLoop]: Abstraction has 711 states and 1186 transitions. [2025-02-05 21:55:51,618 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 50.333333333333336) internal successors, (151), 3 states have internal predecessors, (151), 1 states have call successors, (99), 1 states have call predecessors, (99), 1 states have return successors, (99), 1 states have call predecessors, (99), 1 states have call successors, (99) [2025-02-05 21:55:51,618 INFO L276 IsEmpty]: Start isEmpty. Operand 711 states and 1186 transitions. [2025-02-05 21:55:51,624 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 644 [2025-02-05 21:55:51,624 INFO L210 NwaCegarLoop]: Found error trace [2025-02-05 21:55:51,625 INFO L218 NwaCegarLoop]: trace histogram [99, 99, 99, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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:55:51,625 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable3 [2025-02-05 21:55:51,625 INFO L396 AbstractCegarLoop]: === Iteration 5 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-02-05 21:55:51,626 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-02-05 21:55:51,626 INFO L85 PathProgramCache]: Analyzing trace with hash 633815947, now seen corresponding path program 1 times [2025-02-05 21:55:51,626 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-02-05 21:55:51,626 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1200558889] [2025-02-05 21:55:51,626 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-02-05 21:55:51,626 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-02-05 21:55:51,671 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 643 statements into 1 equivalence classes. [2025-02-05 21:55:51,715 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 643 of 643 statements. [2025-02-05 21:55:51,715 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-02-05 21:55:51,715 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-02-05 21:55:51,969 INFO L134 CoverageAnalysis]: Checked inductivity of 19404 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 19404 trivial. 0 not checked. [2025-02-05 21:55:51,969 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-02-05 21:55:51,969 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1200558889] [2025-02-05 21:55:51,969 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1200558889] provided 1 perfect and 0 imperfect interpolant sequences [2025-02-05 21:55:51,969 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-02-05 21:55:51,970 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2025-02-05 21:55:51,970 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1231918723] [2025-02-05 21:55:51,970 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-02-05 21:55:51,972 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2025-02-05 21:55:51,972 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-02-05 21:55:51,973 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2025-02-05 21:55:51,973 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-02-05 21:55:51,974 INFO L87 Difference]: Start difference. First operand 711 states and 1186 transitions. Second operand has 3 states, 3 states have (on average 50.333333333333336) internal successors, (151), 3 states have internal predecessors, (151), 1 states have call successors, (99), 1 states have call predecessors, (99), 1 states have return successors, (99), 1 states have call predecessors, (99), 1 states have call successors, (99) [2025-02-05 21:55:52,055 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-02-05 21:55:52,056 INFO L93 Difference]: Finished difference Result 1423 states and 2377 transitions. [2025-02-05 21:55:52,057 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2025-02-05 21:55:52,057 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 50.333333333333336) internal successors, (151), 3 states have internal predecessors, (151), 1 states have call successors, (99), 1 states have call predecessors, (99), 1 states have return successors, (99), 1 states have call predecessors, (99), 1 states have call successors, (99) Word has length 643 [2025-02-05 21:55:52,059 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-02-05 21:55:52,065 INFO L225 Difference]: With dead ends: 1423 [2025-02-05 21:55:52,066 INFO L226 Difference]: Without dead ends: 715 [2025-02-05 21:55:52,068 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:55:52,069 INFO L435 NwaCegarLoop]: 534 mSDtfsCounter, 0 mSDsluCounter, 527 mSDsCounter, 0 mSdLazyCounter, 42 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 0 SdHoareTripleChecker+Valid, 1061 SdHoareTripleChecker+Invalid, 42 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 42 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2025-02-05 21:55:52,069 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [0 Valid, 1061 Invalid, 42 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 42 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2025-02-05 21:55:52,071 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 715 states. [2025-02-05 21:55:52,118 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 715 to 715. [2025-02-05 21:55:52,124 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 715 states, 549 states have (on average 1.5810564663023678) internal successors, (868), 550 states have internal predecessors, (868), 161 states have call successors, (161), 4 states have call predecessors, (161), 4 states have return successors, (161), 160 states have call predecessors, (161), 161 states have call successors, (161) [2025-02-05 21:55:52,128 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 715 states to 715 states and 1190 transitions. [2025-02-05 21:55:52,129 INFO L78 Accepts]: Start accepts. Automaton has 715 states and 1190 transitions. Word has length 643 [2025-02-05 21:55:52,132 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-02-05 21:55:52,132 INFO L471 AbstractCegarLoop]: Abstraction has 715 states and 1190 transitions. [2025-02-05 21:55:52,133 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 50.333333333333336) internal successors, (151), 3 states have internal predecessors, (151), 1 states have call successors, (99), 1 states have call predecessors, (99), 1 states have return successors, (99), 1 states have call predecessors, (99), 1 states have call successors, (99) [2025-02-05 21:55:52,133 INFO L276 IsEmpty]: Start isEmpty. Operand 715 states and 1190 transitions. [2025-02-05 21:55:52,139 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 645 [2025-02-05 21:55:52,139 INFO L210 NwaCegarLoop]: Found error trace [2025-02-05 21:55:52,140 INFO L218 NwaCegarLoop]: trace histogram [99, 99, 99, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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:55:52,140 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable4 [2025-02-05 21:55:52,140 INFO L396 AbstractCegarLoop]: === Iteration 6 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-02-05 21:55:52,141 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-02-05 21:55:52,143 INFO L85 PathProgramCache]: Analyzing trace with hash -998938122, now seen corresponding path program 1 times [2025-02-05 21:55:52,143 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-02-05 21:55:52,143 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1213423536] [2025-02-05 21:55:52,143 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-02-05 21:55:52,143 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-02-05 21:55:52,184 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 644 statements into 1 equivalence classes. [2025-02-05 21:55:52,225 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 644 of 644 statements. [2025-02-05 21:55:52,225 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-02-05 21:55:52,225 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-02-05 21:55:52,624 INFO L134 CoverageAnalysis]: Checked inductivity of 19404 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 19404 trivial. 0 not checked. [2025-02-05 21:55:52,624 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-02-05 21:55:52,624 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1213423536] [2025-02-05 21:55:52,624 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1213423536] provided 1 perfect and 0 imperfect interpolant sequences [2025-02-05 21:55:52,624 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-02-05 21:55:52,624 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2025-02-05 21:55:52,625 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [72623298] [2025-02-05 21:55:52,625 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-02-05 21:55:52,625 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2025-02-05 21:55:52,625 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-02-05 21:55:52,626 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2025-02-05 21:55:52,626 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2025-02-05 21:55:52,627 INFO L87 Difference]: Start difference. First operand 715 states and 1190 transitions. Second operand has 4 states, 4 states have (on average 38.0) internal successors, (152), 4 states have internal predecessors, (152), 1 states have call successors, (99), 1 states have call predecessors, (99), 1 states have return successors, (99), 1 states have call predecessors, (99), 1 states have call successors, (99) [2025-02-05 21:55:52,770 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-02-05 21:55:52,770 INFO L93 Difference]: Finished difference Result 1432 states and 2380 transitions. [2025-02-05 21:55:52,771 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2025-02-05 21:55:52,771 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 4 states have (on average 38.0) internal successors, (152), 4 states have internal predecessors, (152), 1 states have call successors, (99), 1 states have call predecessors, (99), 1 states have return successors, (99), 1 states have call predecessors, (99), 1 states have call successors, (99) Word has length 644 [2025-02-05 21:55:52,772 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-02-05 21:55:52,777 INFO L225 Difference]: With dead ends: 1432 [2025-02-05 21:55:52,777 INFO L226 Difference]: Without dead ends: 720 [2025-02-05 21:55:52,780 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 5 GetRequests, 2 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:55:52,780 INFO L435 NwaCegarLoop]: 645 mSDtfsCounter, 296 mSDsluCounter, 1159 mSDsCounter, 0 mSdLazyCounter, 85 mSolverCounterSat, 2 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 296 SdHoareTripleChecker+Valid, 1804 SdHoareTripleChecker+Invalid, 87 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 2 IncrementalHoareTripleChecker+Valid, 85 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2025-02-05 21:55:52,781 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [296 Valid, 1804 Invalid, 87 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [2 Valid, 85 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2025-02-05 21:55:52,782 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 720 states. [2025-02-05 21:55:52,819 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 720 to 543. [2025-02-05 21:55:52,820 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 543 states, 440 states have (on average 1.606818181818182) internal successors, (707), 440 states have internal predecessors, (707), 99 states have call successors, (99), 3 states have call predecessors, (99), 3 states have return successors, (99), 99 states have call predecessors, (99), 99 states have call successors, (99) [2025-02-05 21:55:52,823 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 543 states to 543 states and 905 transitions. [2025-02-05 21:55:52,824 INFO L78 Accepts]: Start accepts. Automaton has 543 states and 905 transitions. Word has length 644 [2025-02-05 21:55:52,825 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-02-05 21:55:52,825 INFO L471 AbstractCegarLoop]: Abstraction has 543 states and 905 transitions. [2025-02-05 21:55:52,826 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 38.0) internal successors, (152), 4 states have internal predecessors, (152), 1 states have call successors, (99), 1 states have call predecessors, (99), 1 states have return successors, (99), 1 states have call predecessors, (99), 1 states have call successors, (99) [2025-02-05 21:55:52,826 INFO L276 IsEmpty]: Start isEmpty. Operand 543 states and 905 transitions. [2025-02-05 21:55:52,831 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 646 [2025-02-05 21:55:52,832 INFO L210 NwaCegarLoop]: Found error trace [2025-02-05 21:55:52,832 INFO L218 NwaCegarLoop]: trace histogram [99, 99, 99, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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:55:52,832 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable5 [2025-02-05 21:55:52,833 INFO L396 AbstractCegarLoop]: === Iteration 7 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-02-05 21:55:52,833 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-02-05 21:55:52,833 INFO L85 PathProgramCache]: Analyzing trace with hash -939441634, now seen corresponding path program 1 times [2025-02-05 21:55:52,833 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-02-05 21:55:52,833 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [28160001] [2025-02-05 21:55:52,834 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-02-05 21:55:52,834 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-02-05 21:55:52,875 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 645 statements into 1 equivalence classes. [2025-02-05 21:55:52,945 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 645 of 645 statements. [2025-02-05 21:55:52,946 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-02-05 21:55:52,946 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-02-05 21:55:53,353 INFO L134 CoverageAnalysis]: Checked inductivity of 19404 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 19404 trivial. 0 not checked. [2025-02-05 21:55:53,354 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-02-05 21:55:53,354 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [28160001] [2025-02-05 21:55:53,354 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [28160001] provided 1 perfect and 0 imperfect interpolant sequences [2025-02-05 21:55:53,354 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-02-05 21:55:53,354 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2025-02-05 21:55:53,354 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [219016876] [2025-02-05 21:55:53,354 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-02-05 21:55:53,355 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2025-02-05 21:55:53,355 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-02-05 21:55:53,356 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2025-02-05 21:55:53,356 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=8, Invalid=12, Unknown=0, NotChecked=0, Total=20 [2025-02-05 21:55:53,357 INFO L87 Difference]: Start difference. First operand 543 states and 905 transitions. Second operand has 5 states, 5 states have (on average 30.6) internal successors, (153), 5 states have internal predecessors, (153), 1 states have call successors, (99), 1 states have call predecessors, (99), 1 states have return successors, (99), 1 states have call predecessors, (99), 1 states have call successors, (99) [2025-02-05 21:55:53,728 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-02-05 21:55:53,728 INFO L93 Difference]: Finished difference Result 1777 states and 2970 transitions. [2025-02-05 21:55:53,729 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2025-02-05 21:55:53,729 INFO L78 Accepts]: Start accepts. Automaton has has 5 states, 5 states have (on average 30.6) internal successors, (153), 5 states have internal predecessors, (153), 1 states have call successors, (99), 1 states have call predecessors, (99), 1 states have return successors, (99), 1 states have call predecessors, (99), 1 states have call successors, (99) Word has length 645 [2025-02-05 21:55:53,730 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-02-05 21:55:53,737 INFO L225 Difference]: With dead ends: 1777 [2025-02-05 21:55:53,737 INFO L226 Difference]: Without dead ends: 1237 [2025-02-05 21:55:53,739 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 7 GetRequests, 3 SyntacticMatches, 0 SemanticMatches, 4 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=13, Invalid=17, Unknown=0, NotChecked=0, Total=30 [2025-02-05 21:55:53,739 INFO L435 NwaCegarLoop]: 645 mSDtfsCounter, 1012 mSDsluCounter, 1009 mSDsCounter, 0 mSdLazyCounter, 212 mSolverCounterSat, 32 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.3s Time, 0 mProtectedPredicate, 0 mProtectedAction, 1012 SdHoareTripleChecker+Valid, 1654 SdHoareTripleChecker+Invalid, 244 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 32 IncrementalHoareTripleChecker+Valid, 212 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.3s IncrementalHoareTripleChecker+Time [2025-02-05 21:55:53,740 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [1012 Valid, 1654 Invalid, 244 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [32 Valid, 212 Invalid, 0 Unknown, 0 Unchecked, 0.3s Time] [2025-02-05 21:55:53,741 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1237 states. [2025-02-05 21:55:53,773 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1237 to 1150. [2025-02-05 21:55:53,776 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 1150 states, 1031 states have (on average 1.6595538312318139) internal successors, (1711), 1032 states have internal predecessors, (1711), 114 states have call successors, (114), 4 states have call predecessors, (114), 4 states have return successors, (114), 113 states have call predecessors, (114), 114 states have call successors, (114) [2025-02-05 21:55:53,781 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1150 states to 1150 states and 1939 transitions. [2025-02-05 21:55:53,782 INFO L78 Accepts]: Start accepts. Automaton has 1150 states and 1939 transitions. Word has length 645 [2025-02-05 21:55:53,783 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-02-05 21:55:53,783 INFO L471 AbstractCegarLoop]: Abstraction has 1150 states and 1939 transitions. [2025-02-05 21:55:53,783 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 30.6) internal successors, (153), 5 states have internal predecessors, (153), 1 states have call successors, (99), 1 states have call predecessors, (99), 1 states have return successors, (99), 1 states have call predecessors, (99), 1 states have call successors, (99) [2025-02-05 21:55:53,783 INFO L276 IsEmpty]: Start isEmpty. Operand 1150 states and 1939 transitions. [2025-02-05 21:55:53,789 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 646 [2025-02-05 21:55:53,789 INFO L210 NwaCegarLoop]: Found error trace [2025-02-05 21:55:53,790 INFO L218 NwaCegarLoop]: trace histogram [99, 99, 99, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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:55:53,790 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable6 [2025-02-05 21:55:53,790 INFO L396 AbstractCegarLoop]: === Iteration 8 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-02-05 21:55:53,791 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-02-05 21:55:53,791 INFO L85 PathProgramCache]: Analyzing trace with hash -1569900259, now seen corresponding path program 1 times [2025-02-05 21:55:53,791 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-02-05 21:55:53,791 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1950938702] [2025-02-05 21:55:53,791 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-02-05 21:55:53,791 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-02-05 21:55:53,836 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 645 statements into 1 equivalence classes. [2025-02-05 21:55:53,896 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 645 of 645 statements. [2025-02-05 21:55:53,896 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-02-05 21:55:53,896 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-02-05 21:55:54,678 INFO L134 CoverageAnalysis]: Checked inductivity of 19404 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 19404 trivial. 0 not checked. [2025-02-05 21:55:54,678 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-02-05 21:55:54,679 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1950938702] [2025-02-05 21:55:54,679 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1950938702] provided 1 perfect and 0 imperfect interpolant sequences [2025-02-05 21:55:54,679 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-02-05 21:55:54,679 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2025-02-05 21:55:54,679 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [726018418] [2025-02-05 21:55:54,679 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-02-05 21:55:54,680 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2025-02-05 21:55:54,680 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-02-05 21:55:54,681 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2025-02-05 21:55:54,681 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2025-02-05 21:55:54,681 INFO L87 Difference]: Start difference. First operand 1150 states and 1939 transitions. Second operand has 4 states, 4 states have (on average 38.25) internal successors, (153), 4 states have internal predecessors, (153), 1 states have call successors, (99), 1 states have call predecessors, (99), 1 states have return successors, (99), 1 states have call predecessors, (99), 1 states have call successors, (99) [2025-02-05 21:55:54,883 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-02-05 21:55:54,883 INFO L93 Difference]: Finished difference Result 3456 states and 5835 transitions. [2025-02-05 21:55:54,884 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2025-02-05 21:55:54,885 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 4 states have (on average 38.25) internal successors, (153), 4 states have internal predecessors, (153), 1 states have call successors, (99), 1 states have call predecessors, (99), 1 states have return successors, (99), 1 states have call predecessors, (99), 1 states have call successors, (99) Word has length 645 [2025-02-05 21:55:54,887 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-02-05 21:55:54,900 INFO L225 Difference]: With dead ends: 3456 [2025-02-05 21:55:54,900 INFO L226 Difference]: Without dead ends: 2309 [2025-02-05 21:55:54,904 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:55:54,905 INFO L435 NwaCegarLoop]: 526 mSDtfsCounter, 346 mSDsluCounter, 1036 mSDsCounter, 0 mSdLazyCounter, 95 mSolverCounterSat, 1 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 346 SdHoareTripleChecker+Valid, 1562 SdHoareTripleChecker+Invalid, 96 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 1 IncrementalHoareTripleChecker+Valid, 95 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2025-02-05 21:55:54,905 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [346 Valid, 1562 Invalid, 96 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [1 Valid, 95 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2025-02-05 21:55:54,907 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 2309 states. [2025-02-05 21:55:54,982 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 2309 to 2307. [2025-02-05 21:55:54,987 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 2307 states, 2070 states have (on average 1.655072463768116) internal successors, (3426), 2072 states have internal predecessors, (3426), 228 states have call successors, (228), 8 states have call predecessors, (228), 8 states have return successors, (228), 226 states have call predecessors, (228), 228 states have call successors, (228) [2025-02-05 21:55:54,998 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 2307 states to 2307 states and 3882 transitions. [2025-02-05 21:55:55,000 INFO L78 Accepts]: Start accepts. Automaton has 2307 states and 3882 transitions. Word has length 645 [2025-02-05 21:55:55,001 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-02-05 21:55:55,001 INFO L471 AbstractCegarLoop]: Abstraction has 2307 states and 3882 transitions. [2025-02-05 21:55:55,002 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 38.25) internal successors, (153), 4 states have internal predecessors, (153), 1 states have call successors, (99), 1 states have call predecessors, (99), 1 states have return successors, (99), 1 states have call predecessors, (99), 1 states have call successors, (99) [2025-02-05 21:55:55,002 INFO L276 IsEmpty]: Start isEmpty. Operand 2307 states and 3882 transitions. [2025-02-05 21:55:55,009 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 647 [2025-02-05 21:55:55,009 INFO L210 NwaCegarLoop]: Found error trace [2025-02-05 21:55:55,010 INFO L218 NwaCegarLoop]: trace histogram [99, 99, 99, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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:55:55,010 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable7 [2025-02-05 21:55:55,010 INFO L396 AbstractCegarLoop]: === Iteration 9 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-02-05 21:55:55,010 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-02-05 21:55:55,011 INFO L85 PathProgramCache]: Analyzing trace with hash 655955434, now seen corresponding path program 1 times [2025-02-05 21:55:55,011 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-02-05 21:55:55,011 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1503400533] [2025-02-05 21:55:55,011 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-02-05 21:55:55,011 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-02-05 21:55:55,071 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 646 statements into 1 equivalence classes. [2025-02-05 21:55:55,152 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 646 of 646 statements. [2025-02-05 21:55:55,152 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-02-05 21:55:55,152 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-02-05 21:55:55,719 INFO L134 CoverageAnalysis]: Checked inductivity of 19404 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 19404 trivial. 0 not checked. [2025-02-05 21:55:55,720 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-02-05 21:55:55,720 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1503400533] [2025-02-05 21:55:55,720 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1503400533] provided 1 perfect and 0 imperfect interpolant sequences [2025-02-05 21:55:55,720 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-02-05 21:55:55,720 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2025-02-05 21:55:55,720 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1904319911] [2025-02-05 21:55:55,720 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-02-05 21:55:55,721 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2025-02-05 21:55:55,721 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-02-05 21:55:55,722 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2025-02-05 21:55:55,722 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=6, Invalid=6, Unknown=0, NotChecked=0, Total=12 [2025-02-05 21:55:55,722 INFO L87 Difference]: Start difference. First operand 2307 states and 3882 transitions. Second operand has 4 states, 4 states have (on average 38.5) internal successors, (154), 4 states have internal predecessors, (154), 1 states have call successors, (99), 1 states have call predecessors, (99), 1 states have return successors, (99), 1 states have call predecessors, (99), 1 states have call successors, (99) [2025-02-05 21:55:55,837 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-02-05 21:55:55,837 INFO L93 Difference]: Finished difference Result 4611 states and 7761 transitions. [2025-02-05 21:55:55,838 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2025-02-05 21:55:55,838 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 4 states have (on average 38.5) internal successors, (154), 4 states have internal predecessors, (154), 1 states have call successors, (99), 1 states have call predecessors, (99), 1 states have return successors, (99), 1 states have call predecessors, (99), 1 states have call successors, (99) Word has length 646 [2025-02-05 21:55:55,840 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-02-05 21:55:55,852 INFO L225 Difference]: With dead ends: 4611 [2025-02-05 21:55:55,853 INFO L226 Difference]: Without dead ends: 2307 [2025-02-05 21:55:55,858 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 4 GetRequests, 2 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:55:55,859 INFO L435 NwaCegarLoop]: 525 mSDtfsCounter, 384 mSDsluCounter, 0 mSDsCounter, 0 mSdLazyCounter, 26 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 384 SdHoareTripleChecker+Valid, 525 SdHoareTripleChecker+Invalid, 26 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 26 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2025-02-05 21:55:55,859 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [384 Valid, 525 Invalid, 26 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 26 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2025-02-05 21:55:55,862 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 2307 states. [2025-02-05 21:55:55,955 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 2307 to 2307. [2025-02-05 21:55:55,960 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 2307 states, 2070 states have (on average 1.6434782608695653) internal successors, (3402), 2072 states have internal predecessors, (3402), 228 states have call successors, (228), 8 states have call predecessors, (228), 8 states have return successors, (228), 226 states have call predecessors, (228), 228 states have call successors, (228) [2025-02-05 21:55:55,969 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 2307 states to 2307 states and 3858 transitions. [2025-02-05 21:55:55,972 INFO L78 Accepts]: Start accepts. Automaton has 2307 states and 3858 transitions. Word has length 646 [2025-02-05 21:55:55,973 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-02-05 21:55:55,973 INFO L471 AbstractCegarLoop]: Abstraction has 2307 states and 3858 transitions. [2025-02-05 21:55:55,973 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 38.5) internal successors, (154), 4 states have internal predecessors, (154), 1 states have call successors, (99), 1 states have call predecessors, (99), 1 states have return successors, (99), 1 states have call predecessors, (99), 1 states have call successors, (99) [2025-02-05 21:55:55,973 INFO L276 IsEmpty]: Start isEmpty. Operand 2307 states and 3858 transitions. [2025-02-05 21:55:55,980 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 648 [2025-02-05 21:55:55,980 INFO L210 NwaCegarLoop]: Found error trace [2025-02-05 21:55:55,981 INFO L218 NwaCegarLoop]: trace histogram [99, 99, 99, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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:55:55,981 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable8 [2025-02-05 21:55:55,981 INFO L396 AbstractCegarLoop]: === Iteration 10 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-02-05 21:55:55,982 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-02-05 21:55:55,982 INFO L85 PathProgramCache]: Analyzing trace with hash 1480112132, now seen corresponding path program 1 times [2025-02-05 21:55:55,982 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-02-05 21:55:55,982 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1248524483] [2025-02-05 21:55:55,982 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-02-05 21:55:55,982 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-02-05 21:55:56,024 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 647 statements into 1 equivalence classes. [2025-02-05 21:55:56,061 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 647 of 647 statements. [2025-02-05 21:55:56,061 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-02-05 21:55:56,062 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-02-05 21:55:56,550 INFO L134 CoverageAnalysis]: Checked inductivity of 19404 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 19404 trivial. 0 not checked. [2025-02-05 21:55:56,552 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-02-05 21:55:56,552 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1248524483] [2025-02-05 21:55:56,552 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1248524483] provided 1 perfect and 0 imperfect interpolant sequences [2025-02-05 21:55:56,552 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-02-05 21:55:56,552 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2025-02-05 21:55:56,552 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1631606748] [2025-02-05 21:55:56,552 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-02-05 21:55:56,553 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2025-02-05 21:55:56,553 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-02-05 21:55:56,554 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2025-02-05 21:55:56,554 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-02-05 21:55:56,554 INFO L87 Difference]: Start difference. First operand 2307 states and 3858 transitions. Second operand has 3 states, 3 states have (on average 51.666666666666664) internal successors, (155), 3 states have internal predecessors, (155), 1 states have call successors, (99), 1 states have call predecessors, (99), 1 states have return successors, (99), 1 states have call predecessors, (99), 1 states have call successors, (99) [2025-02-05 21:55:56,677 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-02-05 21:55:56,677 INFO L93 Difference]: Finished difference Result 4611 states and 7713 transitions. [2025-02-05 21:55:56,678 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2025-02-05 21:55:56,678 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 51.666666666666664) internal successors, (155), 3 states have internal predecessors, (155), 1 states have call successors, (99), 1 states have call predecessors, (99), 1 states have return successors, (99), 1 states have call predecessors, (99), 1 states have call successors, (99) Word has length 647 [2025-02-05 21:55:56,679 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-02-05 21:55:56,694 INFO L225 Difference]: With dead ends: 4611 [2025-02-05 21:55:56,694 INFO L226 Difference]: Without dead ends: 2307 [2025-02-05 21:55:56,699 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:55:56,700 INFO L435 NwaCegarLoop]: 525 mSDtfsCounter, 336 mSDsluCounter, 0 mSDsCounter, 0 mSdLazyCounter, 23 mSolverCounterSat, 2 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 336 SdHoareTripleChecker+Valid, 525 SdHoareTripleChecker+Invalid, 25 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 2 IncrementalHoareTripleChecker+Valid, 23 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2025-02-05 21:55:56,700 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [336 Valid, 525 Invalid, 25 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [2 Valid, 23 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2025-02-05 21:55:56,703 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 2307 states. [2025-02-05 21:55:56,818 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 2307 to 2307. [2025-02-05 21:55:56,824 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 2307 states, 2070 states have (on average 1.6241545893719807) internal successors, (3362), 2072 states have internal predecessors, (3362), 228 states have call successors, (228), 8 states have call predecessors, (228), 8 states have return successors, (228), 226 states have call predecessors, (228), 228 states have call successors, (228) [2025-02-05 21:55:56,836 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 2307 states to 2307 states and 3818 transitions. [2025-02-05 21:55:56,838 INFO L78 Accepts]: Start accepts. Automaton has 2307 states and 3818 transitions. Word has length 647 [2025-02-05 21:55:56,839 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-02-05 21:55:56,839 INFO L471 AbstractCegarLoop]: Abstraction has 2307 states and 3818 transitions. [2025-02-05 21:55:56,840 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 51.666666666666664) internal successors, (155), 3 states have internal predecessors, (155), 1 states have call successors, (99), 1 states have call predecessors, (99), 1 states have return successors, (99), 1 states have call predecessors, (99), 1 states have call successors, (99) [2025-02-05 21:55:56,840 INFO L276 IsEmpty]: Start isEmpty. Operand 2307 states and 3818 transitions. [2025-02-05 21:55:56,864 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 649 [2025-02-05 21:55:56,864 INFO L210 NwaCegarLoop]: Found error trace [2025-02-05 21:55:56,864 INFO L218 NwaCegarLoop]: trace histogram [99, 99, 99, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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:55:56,864 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable9 [2025-02-05 21:55:56,865 INFO L396 AbstractCegarLoop]: === Iteration 11 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-02-05 21:55:56,865 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-02-05 21:55:56,866 INFO L85 PathProgramCache]: Analyzing trace with hash -1443808417, now seen corresponding path program 1 times [2025-02-05 21:55:56,866 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-02-05 21:55:56,866 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [363812412] [2025-02-05 21:55:56,866 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-02-05 21:55:56,866 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-02-05 21:55:56,912 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 648 statements into 1 equivalence classes. [2025-02-05 21:55:57,022 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 648 of 648 statements. [2025-02-05 21:55:57,023 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-02-05 21:55:57,023 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-02-05 21:55:58,202 INFO L134 CoverageAnalysis]: Checked inductivity of 19404 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 19404 trivial. 0 not checked. [2025-02-05 21:55:58,202 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-02-05 21:55:58,202 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [363812412] [2025-02-05 21:55:58,202 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [363812412] provided 1 perfect and 0 imperfect interpolant sequences [2025-02-05 21:55:58,202 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-02-05 21:55:58,202 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2025-02-05 21:55:58,202 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [604877358] [2025-02-05 21:55:58,202 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-02-05 21:55:58,203 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2025-02-05 21:55:58,203 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-02-05 21:55:58,204 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2025-02-05 21:55:58,204 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=11, Invalid=19, Unknown=0, NotChecked=0, Total=30 [2025-02-05 21:55:58,204 INFO L87 Difference]: Start difference. First operand 2307 states and 3818 transitions. Second operand has 6 states, 6 states have (on average 26.0) internal successors, (156), 6 states have internal predecessors, (156), 2 states have call successors, (99), 1 states have call predecessors, (99), 1 states have return successors, (99), 2 states have call predecessors, (99), 2 states have call successors, (99) [2025-02-05 21:55:59,145 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-02-05 21:55:59,146 INFO L93 Difference]: Finished difference Result 4645 states and 7680 transitions. [2025-02-05 21:55:59,146 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2025-02-05 21:55:59,147 INFO L78 Accepts]: Start accepts. Automaton has has 6 states, 6 states have (on average 26.0) internal successors, (156), 6 states have internal predecessors, (156), 2 states have call successors, (99), 1 states have call predecessors, (99), 1 states have return successors, (99), 2 states have call predecessors, (99), 2 states have call successors, (99) Word has length 648 [2025-02-05 21:55:59,148 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-02-05 21:55:59,178 INFO L225 Difference]: With dead ends: 4645 [2025-02-05 21:55:59,178 INFO L226 Difference]: Without dead ends: 2341 [2025-02-05 21:55:59,182 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 12 GetRequests, 6 SyntacticMatches, 1 SemanticMatches, 5 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 2 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=17, Invalid=25, Unknown=0, NotChecked=0, Total=42 [2025-02-05 21:55:59,182 INFO L435 NwaCegarLoop]: 571 mSDtfsCounter, 1235 mSDsluCounter, 568 mSDsCounter, 0 mSdLazyCounter, 580 mSolverCounterSat, 95 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.7s Time, 0 mProtectedPredicate, 0 mProtectedAction, 1235 SdHoareTripleChecker+Valid, 1139 SdHoareTripleChecker+Invalid, 675 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 95 IncrementalHoareTripleChecker+Valid, 580 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.8s IncrementalHoareTripleChecker+Time [2025-02-05 21:55:59,183 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [1235 Valid, 1139 Invalid, 675 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [95 Valid, 580 Invalid, 0 Unknown, 0 Unchecked, 0.8s Time] [2025-02-05 21:55:59,185 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 2341 states. [2025-02-05 21:55:59,313 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 2341 to 1837. [2025-02-05 21:55:59,320 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 1837 states, 1600 states have (on average 1.60625) internal successors, (2570), 1602 states have internal predecessors, (2570), 228 states have call successors, (228), 8 states have call predecessors, (228), 8 states have return successors, (228), 226 states have call predecessors, (228), 228 states have call successors, (228) [2025-02-05 21:55:59,334 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1837 states to 1837 states and 3026 transitions. [2025-02-05 21:55:59,336 INFO L78 Accepts]: Start accepts. Automaton has 1837 states and 3026 transitions. Word has length 648 [2025-02-05 21:55:59,338 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-02-05 21:55:59,338 INFO L471 AbstractCegarLoop]: Abstraction has 1837 states and 3026 transitions. [2025-02-05 21:55:59,342 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 6 states have (on average 26.0) internal successors, (156), 6 states have internal predecessors, (156), 2 states have call successors, (99), 1 states have call predecessors, (99), 1 states have return successors, (99), 2 states have call predecessors, (99), 2 states have call successors, (99) [2025-02-05 21:55:59,342 INFO L276 IsEmpty]: Start isEmpty. Operand 1837 states and 3026 transitions. [2025-02-05 21:55:59,355 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 650 [2025-02-05 21:55:59,355 INFO L210 NwaCegarLoop]: Found error trace [2025-02-05 21:55:59,356 INFO L218 NwaCegarLoop]: trace histogram [99, 99, 99, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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:55:59,356 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable10 [2025-02-05 21:55:59,356 INFO L396 AbstractCegarLoop]: === Iteration 12 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-02-05 21:55:59,357 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-02-05 21:55:59,357 INFO L85 PathProgramCache]: Analyzing trace with hash -1722556977, now seen corresponding path program 1 times [2025-02-05 21:55:59,357 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-02-05 21:55:59,357 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1211286461] [2025-02-05 21:55:59,357 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-02-05 21:55:59,357 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-02-05 21:55:59,408 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 649 statements into 1 equivalence classes. [2025-02-05 21:55:59,457 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 649 of 649 statements. [2025-02-05 21:55:59,458 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-02-05 21:55:59,458 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-02-05 21:55:59,846 INFO L134 CoverageAnalysis]: Checked inductivity of 19404 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 19404 trivial. 0 not checked. [2025-02-05 21:55:59,847 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-02-05 21:55:59,847 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1211286461] [2025-02-05 21:55:59,847 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1211286461] provided 1 perfect and 0 imperfect interpolant sequences [2025-02-05 21:55:59,847 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-02-05 21:55:59,847 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2025-02-05 21:55:59,847 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1306988489] [2025-02-05 21:55:59,847 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-02-05 21:55:59,848 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2025-02-05 21:55:59,848 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-02-05 21:55:59,849 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2025-02-05 21:55:59,849 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-02-05 21:55:59,850 INFO L87 Difference]: Start difference. First operand 1837 states and 3026 transitions. Second operand has 3 states, 3 states have (on average 52.333333333333336) internal successors, (157), 3 states have internal predecessors, (157), 1 states have call successors, (99), 1 states have call predecessors, (99), 1 states have return successors, (99), 1 states have call predecessors, (99), 1 states have call successors, (99) [2025-02-05 21:56:00,053 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-02-05 21:56:00,053 INFO L93 Difference]: Finished difference Result 5409 states and 8904 transitions. [2025-02-05 21:56:00,053 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2025-02-05 21:56:00,054 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 52.333333333333336) internal successors, (157), 3 states have internal predecessors, (157), 1 states have call successors, (99), 1 states have call predecessors, (99), 1 states have return successors, (99), 1 states have call predecessors, (99), 1 states have call successors, (99) Word has length 649 [2025-02-05 21:56:00,055 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-02-05 21:56:00,073 INFO L225 Difference]: With dead ends: 5409 [2025-02-05 21:56:00,074 INFO L226 Difference]: Without dead ends: 3575 [2025-02-05 21:56:00,079 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 5 GetRequests, 4 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-02-05 21:56:00,080 INFO L435 NwaCegarLoop]: 907 mSDtfsCounter, 478 mSDsluCounter, 519 mSDsCounter, 0 mSdLazyCounter, 58 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 478 SdHoareTripleChecker+Valid, 1426 SdHoareTripleChecker+Invalid, 58 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 58 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2025-02-05 21:56:00,080 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [478 Valid, 1426 Invalid, 58 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 58 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2025-02-05 21:56:00,084 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 3575 states. [2025-02-05 21:56:00,222 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 3575 to 2307. [2025-02-05 21:56:00,226 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 2307 states, 2070 states have (on average 1.6231884057971016) internal successors, (3360), 2072 states have internal predecessors, (3360), 228 states have call successors, (228), 8 states have call predecessors, (228), 8 states have return successors, (228), 226 states have call predecessors, (228), 228 states have call successors, (228) [2025-02-05 21:56:00,236 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 2307 states to 2307 states and 3816 transitions. [2025-02-05 21:56:00,239 INFO L78 Accepts]: Start accepts. Automaton has 2307 states and 3816 transitions. Word has length 649 [2025-02-05 21:56:00,241 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-02-05 21:56:00,241 INFO L471 AbstractCegarLoop]: Abstraction has 2307 states and 3816 transitions. [2025-02-05 21:56:00,241 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 52.333333333333336) internal successors, (157), 3 states have internal predecessors, (157), 1 states have call successors, (99), 1 states have call predecessors, (99), 1 states have return successors, (99), 1 states have call predecessors, (99), 1 states have call successors, (99) [2025-02-05 21:56:00,241 INFO L276 IsEmpty]: Start isEmpty. Operand 2307 states and 3816 transitions. [2025-02-05 21:56:00,248 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 650 [2025-02-05 21:56:00,248 INFO L210 NwaCegarLoop]: Found error trace [2025-02-05 21:56:00,248 INFO L218 NwaCegarLoop]: trace histogram [99, 99, 99, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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:56:00,249 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable11 [2025-02-05 21:56:00,249 INFO L396 AbstractCegarLoop]: === Iteration 13 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-02-05 21:56:00,250 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-02-05 21:56:00,250 INFO L85 PathProgramCache]: Analyzing trace with hash -1823468944, now seen corresponding path program 1 times [2025-02-05 21:56:00,250 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-02-05 21:56:00,250 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [898481170] [2025-02-05 21:56:00,250 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-02-05 21:56:00,250 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-02-05 21:56:00,289 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 649 statements into 1 equivalence classes. [2025-02-05 21:56:00,408 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 649 of 649 statements. [2025-02-05 21:56:00,408 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-02-05 21:56:00,408 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-02-05 21:56:02,157 INFO L134 CoverageAnalysis]: Checked inductivity of 19404 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 19404 trivial. 0 not checked. [2025-02-05 21:56:02,157 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-02-05 21:56:02,157 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [898481170] [2025-02-05 21:56:02,157 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [898481170] provided 1 perfect and 0 imperfect interpolant sequences [2025-02-05 21:56:02,157 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-02-05 21:56:02,158 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2025-02-05 21:56:02,158 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1081913549] [2025-02-05 21:56:02,158 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-02-05 21:56:02,159 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2025-02-05 21:56:02,159 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-02-05 21:56:02,160 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2025-02-05 21:56:02,160 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=8, Invalid=12, Unknown=0, NotChecked=0, Total=20 [2025-02-05 21:56:02,160 INFO L87 Difference]: Start difference. First operand 2307 states and 3816 transitions. Second operand has 5 states, 5 states have (on average 31.4) internal successors, (157), 5 states have internal predecessors, (157), 2 states have call successors, (99), 1 states have call predecessors, (99), 1 states have return successors, (99), 2 states have call predecessors, (99), 2 states have call successors, (99) [2025-02-05 21:56:03,247 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-02-05 21:56:03,247 INFO L93 Difference]: Finished difference Result 4983 states and 8234 transitions. [2025-02-05 21:56:03,247 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2025-02-05 21:56:03,248 INFO L78 Accepts]: Start accepts. Automaton has has 5 states, 5 states have (on average 31.4) internal successors, (157), 5 states have internal predecessors, (157), 2 states have call successors, (99), 1 states have call predecessors, (99), 1 states have return successors, (99), 2 states have call predecessors, (99), 2 states have call successors, (99) Word has length 649 [2025-02-05 21:56:03,249 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-02-05 21:56:03,265 INFO L225 Difference]: With dead ends: 4983 [2025-02-05 21:56:03,265 INFO L226 Difference]: Without dead ends: 2679 [2025-02-05 21:56:03,272 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 11 GetRequests, 6 SyntacticMatches, 1 SemanticMatches, 4 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=13, Invalid=17, Unknown=0, NotChecked=0, Total=30 [2025-02-05 21:56:03,273 INFO L435 NwaCegarLoop]: 838 mSDtfsCounter, 992 mSDsluCounter, 141 mSDsCounter, 0 mSdLazyCounter, 285 mSolverCounterSat, 401 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.7s Time, 0 mProtectedPredicate, 0 mProtectedAction, 992 SdHoareTripleChecker+Valid, 979 SdHoareTripleChecker+Invalid, 686 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 401 IncrementalHoareTripleChecker+Valid, 285 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.9s IncrementalHoareTripleChecker+Time [2025-02-05 21:56:03,273 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [992 Valid, 979 Invalid, 686 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [401 Valid, 285 Invalid, 0 Unknown, 0 Unchecked, 0.9s Time] [2025-02-05 21:56:03,277 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 2679 states. [2025-02-05 21:56:03,393 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 2679 to 1890. [2025-02-05 21:56:03,398 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 1890 states, 1624 states have (on average 1.5960591133004927) internal successors, (2592), 1627 states have internal predecessors, (2592), 255 states have call successors, (255), 10 states have call predecessors, (255), 10 states have return successors, (255), 252 states have call predecessors, (255), 255 states have call successors, (255) [2025-02-05 21:56:03,406 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1890 states to 1890 states and 3102 transitions. [2025-02-05 21:56:03,409 INFO L78 Accepts]: Start accepts. Automaton has 1890 states and 3102 transitions. Word has length 649 [2025-02-05 21:56:03,410 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-02-05 21:56:03,410 INFO L471 AbstractCegarLoop]: Abstraction has 1890 states and 3102 transitions. [2025-02-05 21:56:03,411 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 31.4) internal successors, (157), 5 states have internal predecessors, (157), 2 states have call successors, (99), 1 states have call predecessors, (99), 1 states have return successors, (99), 2 states have call predecessors, (99), 2 states have call successors, (99) [2025-02-05 21:56:03,411 INFO L276 IsEmpty]: Start isEmpty. Operand 1890 states and 3102 transitions. [2025-02-05 21:56:03,416 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 650 [2025-02-05 21:56:03,417 INFO L210 NwaCegarLoop]: Found error trace [2025-02-05 21:56:03,417 INFO L218 NwaCegarLoop]: trace histogram [99, 99, 99, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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:56:03,417 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable12 [2025-02-05 21:56:03,418 INFO L396 AbstractCegarLoop]: === Iteration 14 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-02-05 21:56:03,418 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-02-05 21:56:03,420 INFO L85 PathProgramCache]: Analyzing trace with hash -919555450, now seen corresponding path program 1 times [2025-02-05 21:56:03,421 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-02-05 21:56:03,421 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [399058485] [2025-02-05 21:56:03,421 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-02-05 21:56:03,421 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-02-05 21:56:03,461 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 649 statements into 1 equivalence classes. [2025-02-05 21:56:03,831 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 649 of 649 statements. [2025-02-05 21:56:03,831 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-02-05 21:56:03,831 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-02-05 21:56:04,447 INFO L134 CoverageAnalysis]: Checked inductivity of 19404 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 19404 trivial. 0 not checked. [2025-02-05 21:56:04,447 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-02-05 21:56:04,448 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [399058485] [2025-02-05 21:56:04,448 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [399058485] provided 1 perfect and 0 imperfect interpolant sequences [2025-02-05 21:56:04,448 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-02-05 21:56:04,449 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2025-02-05 21:56:04,449 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1252087417] [2025-02-05 21:56:04,449 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-02-05 21:56:04,450 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2025-02-05 21:56:04,450 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-02-05 21:56:04,451 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2025-02-05 21:56:04,451 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=6, Invalid=6, Unknown=0, NotChecked=0, Total=12 [2025-02-05 21:56:04,452 INFO L87 Difference]: Start difference. First operand 1890 states and 3102 transitions. Second operand has 4 states, 4 states have (on average 39.25) internal successors, (157), 4 states have internal predecessors, (157), 2 states have call successors, (99), 1 states have call predecessors, (99), 1 states have return successors, (99), 2 states have call predecessors, (99), 2 states have call successors, (99) [2025-02-05 21:56:04,860 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-02-05 21:56:04,860 INFO L93 Difference]: Finished difference Result 5558 states and 9144 transitions. [2025-02-05 21:56:04,860 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2025-02-05 21:56:04,861 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 4 states have (on average 39.25) internal successors, (157), 4 states have internal predecessors, (157), 2 states have call successors, (99), 1 states have call predecessors, (99), 1 states have return successors, (99), 2 states have call predecessors, (99), 2 states have call successors, (99) Word has length 649 [2025-02-05 21:56:04,862 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-02-05 21:56:04,890 INFO L225 Difference]: With dead ends: 5558 [2025-02-05 21:56:04,891 INFO L226 Difference]: Without dead ends: 3724 [2025-02-05 21:56:04,897 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:56:04,898 INFO L435 NwaCegarLoop]: 564 mSDtfsCounter, 682 mSDsluCounter, 499 mSDsCounter, 0 mSdLazyCounter, 70 mSolverCounterSat, 99 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 682 SdHoareTripleChecker+Valid, 1063 SdHoareTripleChecker+Invalid, 169 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 99 IncrementalHoareTripleChecker+Valid, 70 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.2s IncrementalHoareTripleChecker+Time [2025-02-05 21:56:04,898 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [682 Valid, 1063 Invalid, 169 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [99 Valid, 70 Invalid, 0 Unknown, 0 Unchecked, 0.2s Time] [2025-02-05 21:56:04,902 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 3724 states. [2025-02-05 21:56:05,125 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 3724 to 3722. [2025-02-05 21:56:05,131 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 3722 states, 3220 states have (on average 1.5987577639751553) internal successors, (5148), 3225 states have internal predecessors, (5148), 483 states have call successors, (483), 18 states have call predecessors, (483), 18 states have return successors, (483), 478 states have call predecessors, (483), 483 states have call successors, (483) [2025-02-05 21:56:05,147 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3722 states to 3722 states and 6114 transitions. [2025-02-05 21:56:05,150 INFO L78 Accepts]: Start accepts. Automaton has 3722 states and 6114 transitions. Word has length 649 [2025-02-05 21:56:05,152 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-02-05 21:56:05,152 INFO L471 AbstractCegarLoop]: Abstraction has 3722 states and 6114 transitions. [2025-02-05 21:56:05,152 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 39.25) internal successors, (157), 4 states have internal predecessors, (157), 2 states have call successors, (99), 1 states have call predecessors, (99), 1 states have return successors, (99), 2 states have call predecessors, (99), 2 states have call successors, (99) [2025-02-05 21:56:05,152 INFO L276 IsEmpty]: Start isEmpty. Operand 3722 states and 6114 transitions. [2025-02-05 21:56:05,159 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 651 [2025-02-05 21:56:05,160 INFO L210 NwaCegarLoop]: Found error trace [2025-02-05 21:56:05,160 INFO L218 NwaCegarLoop]: trace histogram [99, 99, 99, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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:56:05,160 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable13 [2025-02-05 21:56:05,160 INFO L396 AbstractCegarLoop]: === Iteration 15 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-02-05 21:56:05,161 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-02-05 21:56:05,161 INFO L85 PathProgramCache]: Analyzing trace with hash -820930091, now seen corresponding path program 1 times [2025-02-05 21:56:05,161 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-02-05 21:56:05,161 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1021043562] [2025-02-05 21:56:05,161 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-02-05 21:56:05,162 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-02-05 21:56:05,200 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 650 statements into 1 equivalence classes. [2025-02-05 21:56:05,445 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 650 of 650 statements. [2025-02-05 21:56:05,445 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-02-05 21:56:05,446 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-02-05 21:56:06,508 INFO L134 CoverageAnalysis]: Checked inductivity of 19404 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 19404 trivial. 0 not checked. [2025-02-05 21:56:06,509 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-02-05 21:56:06,509 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1021043562] [2025-02-05 21:56:06,509 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1021043562] provided 1 perfect and 0 imperfect interpolant sequences [2025-02-05 21:56:06,509 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-02-05 21:56:06,509 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [8] imperfect sequences [] total 8 [2025-02-05 21:56:06,509 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1888227073] [2025-02-05 21:56:06,509 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-02-05 21:56:06,510 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 8 states [2025-02-05 21:56:06,510 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-02-05 21:56:06,511 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2025-02-05 21:56:06,511 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=17, Invalid=39, Unknown=0, NotChecked=0, Total=56 [2025-02-05 21:56:06,511 INFO L87 Difference]: Start difference. First operand 3722 states and 6114 transitions. Second operand has 8 states, 8 states have (on average 19.75) internal successors, (158), 8 states have internal predecessors, (158), 1 states have call successors, (99), 1 states have call predecessors, (99), 1 states have return successors, (99), 1 states have call predecessors, (99), 1 states have call successors, (99) [2025-02-05 21:56:08,817 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-02-05 21:56:08,817 INFO L93 Difference]: Finished difference Result 17844 states and 29303 transitions. [2025-02-05 21:56:08,818 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2025-02-05 21:56:08,818 INFO L78 Accepts]: Start accepts. Automaton has has 8 states, 8 states have (on average 19.75) internal successors, (158), 8 states have internal predecessors, (158), 1 states have call successors, (99), 1 states have call predecessors, (99), 1 states have return successors, (99), 1 states have call predecessors, (99), 1 states have call successors, (99) Word has length 650 [2025-02-05 21:56:08,819 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-02-05 21:56:08,887 INFO L225 Difference]: With dead ends: 17844 [2025-02-05 21:56:08,888 INFO L226 Difference]: Without dead ends: 14178 [2025-02-05 21:56:08,906 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 20 GetRequests, 10 SyntacticMatches, 0 SemanticMatches, 10 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 4 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=49, Invalid=83, Unknown=0, NotChecked=0, Total=132 [2025-02-05 21:56:08,908 INFO L435 NwaCegarLoop]: 776 mSDtfsCounter, 1374 mSDsluCounter, 2893 mSDsCounter, 0 mSdLazyCounter, 1014 mSolverCounterSat, 271 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 1.3s Time, 0 mProtectedPredicate, 0 mProtectedAction, 1374 SdHoareTripleChecker+Valid, 3669 SdHoareTripleChecker+Invalid, 1285 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 271 IncrementalHoareTripleChecker+Valid, 1014 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 1.5s IncrementalHoareTripleChecker+Time [2025-02-05 21:56:08,908 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [1374 Valid, 3669 Invalid, 1285 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [271 Valid, 1014 Invalid, 0 Unknown, 0 Unchecked, 1.5s Time] [2025-02-05 21:56:08,923 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 14178 states. [2025-02-05 21:56:09,372 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 14178 to 8194. [2025-02-05 21:56:09,386 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 8194 states, 7488 states have (on average 1.607905982905983) internal successors, (12040), 7501 states have internal predecessors, (12040), 675 states have call successors, (675), 30 states have call predecessors, (675), 30 states have return successors, (675), 662 states have call predecessors, (675), 675 states have call successors, (675) [2025-02-05 21:56:09,410 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 8194 states to 8194 states and 13390 transitions. [2025-02-05 21:56:09,415 INFO L78 Accepts]: Start accepts. Automaton has 8194 states and 13390 transitions. Word has length 650 [2025-02-05 21:56:09,416 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-02-05 21:56:09,416 INFO L471 AbstractCegarLoop]: Abstraction has 8194 states and 13390 transitions. [2025-02-05 21:56:09,417 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 8 states, 8 states have (on average 19.75) internal successors, (158), 8 states have internal predecessors, (158), 1 states have call successors, (99), 1 states have call predecessors, (99), 1 states have return successors, (99), 1 states have call predecessors, (99), 1 states have call successors, (99) [2025-02-05 21:56:09,417 INFO L276 IsEmpty]: Start isEmpty. Operand 8194 states and 13390 transitions. [2025-02-05 21:56:09,429 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 651 [2025-02-05 21:56:09,430 INFO L210 NwaCegarLoop]: Found error trace [2025-02-05 21:56:09,430 INFO L218 NwaCegarLoop]: trace histogram [99, 99, 99, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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:56:09,430 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable14 [2025-02-05 21:56:09,430 INFO L396 AbstractCegarLoop]: === Iteration 16 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-02-05 21:56:09,431 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-02-05 21:56:09,431 INFO L85 PathProgramCache]: Analyzing trace with hash 345766228, now seen corresponding path program 1 times [2025-02-05 21:56:09,431 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-02-05 21:56:09,431 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1999831405] [2025-02-05 21:56:09,432 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-02-05 21:56:09,432 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-02-05 21:56:09,474 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 650 statements into 1 equivalence classes. [2025-02-05 21:56:09,655 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 650 of 650 statements. [2025-02-05 21:56:09,655 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-02-05 21:56:09,655 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-02-05 21:56:10,619 INFO L134 CoverageAnalysis]: Checked inductivity of 19404 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 19404 trivial. 0 not checked. [2025-02-05 21:56:10,619 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-02-05 21:56:10,619 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1999831405] [2025-02-05 21:56:10,619 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1999831405] provided 1 perfect and 0 imperfect interpolant sequences [2025-02-05 21:56:10,619 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-02-05 21:56:10,620 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2025-02-05 21:56:10,620 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1699817149] [2025-02-05 21:56:10,620 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-02-05 21:56:10,621 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2025-02-05 21:56:10,621 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-02-05 21:56:10,621 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2025-02-05 21:56:10,621 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=11, Invalid=19, Unknown=0, NotChecked=0, Total=30 [2025-02-05 21:56:10,622 INFO L87 Difference]: Start difference. First operand 8194 states and 13390 transitions. Second operand has 6 states, 6 states have (on average 26.333333333333332) internal successors, (158), 6 states have internal predecessors, (158), 2 states have call successors, (99), 1 states have call predecessors, (99), 1 states have return successors, (99), 2 states have call predecessors, (99), 2 states have call successors, (99) [2025-02-05 21:56:12,580 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-02-05 21:56:12,581 INFO L93 Difference]: Finished difference Result 27062 states and 44220 transitions. [2025-02-05 21:56:12,582 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2025-02-05 21:56:12,582 INFO L78 Accepts]: Start accepts. Automaton has has 6 states, 6 states have (on average 26.333333333333332) internal successors, (158), 6 states have internal predecessors, (158), 2 states have call successors, (99), 1 states have call predecessors, (99), 1 states have return successors, (99), 2 states have call predecessors, (99), 2 states have call successors, (99) Word has length 650 [2025-02-05 21:56:12,583 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-02-05 21:56:12,662 INFO L225 Difference]: With dead ends: 27062 [2025-02-05 21:56:12,662 INFO L226 Difference]: Without dead ends: 22992 [2025-02-05 21:56:12,683 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 10 GetRequests, 5 SyntacticMatches, 0 SemanticMatches, 5 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 2 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=17, Invalid=25, Unknown=0, NotChecked=0, Total=42 [2025-02-05 21:56:12,684 INFO L435 NwaCegarLoop]: 676 mSDtfsCounter, 955 mSDsluCounter, 2443 mSDsCounter, 0 mSdLazyCounter, 716 mSolverCounterSat, 138 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 1.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 955 SdHoareTripleChecker+Valid, 3119 SdHoareTripleChecker+Invalid, 854 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 138 IncrementalHoareTripleChecker+Valid, 716 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 1.2s IncrementalHoareTripleChecker+Time [2025-02-05 21:56:12,684 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [955 Valid, 3119 Invalid, 854 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [138 Valid, 716 Invalid, 0 Unknown, 0 Unchecked, 1.2s Time] [2025-02-05 21:56:12,710 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 22992 states. [2025-02-05 21:56:13,744 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 22992 to 22965. [2025-02-05 21:56:13,785 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 22965 states, 21107 states have (on average 1.6079499692045294) internal successors, (33939), 21148 states have internal predecessors, (33939), 1773 states have call successors, (1773), 84 states have call predecessors, (1773), 84 states have return successors, (1773), 1732 states have call predecessors, (1773), 1773 states have call successors, (1773) [2025-02-05 21:56:13,851 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 22965 states to 22965 states and 37485 transitions. [2025-02-05 21:56:13,862 INFO L78 Accepts]: Start accepts. Automaton has 22965 states and 37485 transitions. Word has length 650 [2025-02-05 21:56:13,863 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-02-05 21:56:13,863 INFO L471 AbstractCegarLoop]: Abstraction has 22965 states and 37485 transitions. [2025-02-05 21:56:13,864 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 6 states have (on average 26.333333333333332) internal successors, (158), 6 states have internal predecessors, (158), 2 states have call successors, (99), 1 states have call predecessors, (99), 1 states have return successors, (99), 2 states have call predecessors, (99), 2 states have call successors, (99) [2025-02-05 21:56:13,864 INFO L276 IsEmpty]: Start isEmpty. Operand 22965 states and 37485 transitions. [2025-02-05 21:56:13,892 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 651 [2025-02-05 21:56:13,893 INFO L210 NwaCegarLoop]: Found error trace [2025-02-05 21:56:13,893 INFO L218 NwaCegarLoop]: trace histogram [99, 99, 99, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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:56:13,894 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable15 [2025-02-05 21:56:13,894 INFO L396 AbstractCegarLoop]: === Iteration 17 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-02-05 21:56:13,894 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-02-05 21:56:13,895 INFO L85 PathProgramCache]: Analyzing trace with hash -1718863197, now seen corresponding path program 1 times [2025-02-05 21:56:13,895 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-02-05 21:56:13,895 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1600127045] [2025-02-05 21:56:13,895 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-02-05 21:56:13,895 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-02-05 21:56:13,936 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 650 statements into 1 equivalence classes. [2025-02-05 21:56:14,371 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 650 of 650 statements. [2025-02-05 21:56:14,372 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-02-05 21:56:14,372 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-02-05 21:56:14,797 INFO L134 CoverageAnalysis]: Checked inductivity of 19404 backedges. 189 proven. 105 refuted. 0 times theorem prover too weak. 19110 trivial. 0 not checked. [2025-02-05 21:56:14,797 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-02-05 21:56:14,797 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1600127045] [2025-02-05 21:56:14,797 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1600127045] provided 0 perfect and 1 imperfect interpolant sequences [2025-02-05 21:56:14,797 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1406293517] [2025-02-05 21:56:14,798 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-02-05 21:56:14,798 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-02-05 21:56:14,798 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 [2025-02-05 21:56:14,800 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:56:14,802 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:56:15,049 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 650 statements into 1 equivalence classes. [2025-02-05 21:56:15,231 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 650 of 650 statements. [2025-02-05 21:56:15,232 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-02-05 21:56:15,232 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-02-05 21:56:15,241 INFO L256 TraceCheckSpWp]: Trace formula consists of 1468 conjuncts, 6 conjuncts are in the unsatisfiable core [2025-02-05 21:56:15,259 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-02-05 21:56:15,809 INFO L134 CoverageAnalysis]: Checked inductivity of 19404 backedges. 9044 proven. 105 refuted. 0 times theorem prover too weak. 10255 trivial. 0 not checked. [2025-02-05 21:56:15,809 INFO L312 TraceCheckSpWp]: Computing backward predicates... [2025-02-05 21:56:16,444 INFO L134 CoverageAnalysis]: Checked inductivity of 19404 backedges. 189 proven. 105 refuted. 0 times theorem prover too weak. 19110 trivial. 0 not checked. [2025-02-05 21:56:16,445 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1406293517] provided 0 perfect and 2 imperfect interpolant sequences [2025-02-05 21:56:16,445 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2025-02-05 21:56:16,445 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [5, 5, 5] total 7 [2025-02-05 21:56:16,446 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1246225109] [2025-02-05 21:56:16,446 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2025-02-05 21:56:16,448 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 7 states [2025-02-05 21:56:16,448 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-02-05 21:56:16,449 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2025-02-05 21:56:16,449 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=17, Invalid=25, Unknown=0, NotChecked=0, Total=42 [2025-02-05 21:56:16,449 INFO L87 Difference]: Start difference. First operand 22965 states and 37485 transitions. Second operand has 7 states, 7 states have (on average 23.857142857142858) internal successors, (167), 7 states have internal predecessors, (167), 2 states have call successors, (134), 2 states have call predecessors, (134), 4 states have return successors, (135), 2 states have call predecessors, (135), 2 states have call successors, (135) [2025-02-05 21:56:17,976 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-02-05 21:56:17,976 INFO L93 Difference]: Finished difference Result 40175 states and 65590 transitions. [2025-02-05 21:56:17,977 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2025-02-05 21:56:17,977 INFO L78 Accepts]: Start accepts. Automaton has has 7 states, 7 states have (on average 23.857142857142858) internal successors, (167), 7 states have internal predecessors, (167), 2 states have call successors, (134), 2 states have call predecessors, (134), 4 states have return successors, (135), 2 states have call predecessors, (135), 2 states have call successors, (135) Word has length 650 [2025-02-05 21:56:17,978 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-02-05 21:56:18,045 INFO L225 Difference]: With dead ends: 40175 [2025-02-05 21:56:18,045 INFO L226 Difference]: Without dead ends: 17301 [2025-02-05 21:56:18,089 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 1307 GetRequests, 1297 SyntacticMatches, 1 SemanticMatches, 9 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 4 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=45, Invalid=65, Unknown=0, NotChecked=0, Total=110 [2025-02-05 21:56:18,090 INFO L435 NwaCegarLoop]: 418 mSDtfsCounter, 345 mSDsluCounter, 635 mSDsCounter, 0 mSdLazyCounter, 549 mSolverCounterSat, 28 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.6s Time, 0 mProtectedPredicate, 0 mProtectedAction, 407 SdHoareTripleChecker+Valid, 1053 SdHoareTripleChecker+Invalid, 577 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 28 IncrementalHoareTripleChecker+Valid, 549 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.7s IncrementalHoareTripleChecker+Time [2025-02-05 21:56:18,090 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [407 Valid, 1053 Invalid, 577 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [28 Valid, 549 Invalid, 0 Unknown, 0 Unchecked, 0.7s Time] [2025-02-05 21:56:18,106 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 17301 states. [2025-02-05 21:56:19,141 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 17301 to 17117. [2025-02-05 21:56:19,170 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 17117 states, 15251 states have (on average 1.5943216838240115) internal successors, (24315), 15292 states have internal predecessors, (24315), 1773 states have call successors, (1773), 92 states have call predecessors, (1773), 92 states have return successors, (1773), 1732 states have call predecessors, (1773), 1773 states have call successors, (1773) [2025-02-05 21:56:19,214 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 17117 states to 17117 states and 27861 transitions. [2025-02-05 21:56:19,225 INFO L78 Accepts]: Start accepts. Automaton has 17117 states and 27861 transitions. Word has length 650 [2025-02-05 21:56:19,226 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-02-05 21:56:19,226 INFO L471 AbstractCegarLoop]: Abstraction has 17117 states and 27861 transitions. [2025-02-05 21:56:19,227 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 7 states, 7 states have (on average 23.857142857142858) internal successors, (167), 7 states have internal predecessors, (167), 2 states have call successors, (134), 2 states have call predecessors, (134), 4 states have return successors, (135), 2 states have call predecessors, (135), 2 states have call successors, (135) [2025-02-05 21:56:19,227 INFO L276 IsEmpty]: Start isEmpty. Operand 17117 states and 27861 transitions. [2025-02-05 21:56:19,247 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 651 [2025-02-05 21:56:19,248 INFO L210 NwaCegarLoop]: Found error trace [2025-02-05 21:56:19,248 INFO L218 NwaCegarLoop]: trace histogram [99, 99, 99, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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:56:19,260 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:56:19,449 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,SelfDestructingSolverStorable16 [2025-02-05 21:56:19,450 INFO L396 AbstractCegarLoop]: === Iteration 18 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-02-05 21:56:19,450 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-02-05 21:56:19,451 INFO L85 PathProgramCache]: Analyzing trace with hash 1733342418, now seen corresponding path program 1 times [2025-02-05 21:56:19,451 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-02-05 21:56:19,451 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1060847486] [2025-02-05 21:56:19,451 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-02-05 21:56:19,451 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-02-05 21:56:19,603 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 650 statements into 1 equivalence classes. [2025-02-05 21:56:19,636 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 650 of 650 statements. [2025-02-05 21:56:19,636 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-02-05 21:56:19,636 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-02-05 21:56:20,061 INFO L134 CoverageAnalysis]: Checked inductivity of 19404 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 19404 trivial. 0 not checked. [2025-02-05 21:56:20,061 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-02-05 21:56:20,061 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1060847486] [2025-02-05 21:56:20,061 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1060847486] provided 1 perfect and 0 imperfect interpolant sequences [2025-02-05 21:56:20,062 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-02-05 21:56:20,062 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2025-02-05 21:56:20,062 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [341978230] [2025-02-05 21:56:20,062 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-02-05 21:56:20,063 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2025-02-05 21:56:20,063 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-02-05 21:56:20,063 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2025-02-05 21:56:20,064 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-02-05 21:56:20,064 INFO L87 Difference]: Start difference. First operand 17117 states and 27861 transitions. Second operand has 3 states, 3 states have (on average 52.666666666666664) internal successors, (158), 3 states have internal predecessors, (158), 1 states have call successors, (99), 1 states have call predecessors, (99), 1 states have return successors, (99), 1 states have call predecessors, (99), 1 states have call successors, (99) [2025-02-05 21:56:21,091 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-02-05 21:56:21,092 INFO L93 Difference]: Finished difference Result 34161 states and 55623 transitions. [2025-02-05 21:56:21,096 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2025-02-05 21:56:21,096 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 52.666666666666664) internal successors, (158), 3 states have internal predecessors, (158), 1 states have call successors, (99), 1 states have call predecessors, (99), 1 states have return successors, (99), 1 states have call predecessors, (99), 1 states have call successors, (99) Word has length 650 [2025-02-05 21:56:21,097 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-02-05 21:56:21,181 INFO L225 Difference]: With dead ends: 34161 [2025-02-05 21:56:21,181 INFO L226 Difference]: Without dead ends: 17135 [2025-02-05 21:56:21,205 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:56:21,206 INFO L435 NwaCegarLoop]: 583 mSDtfsCounter, 314 mSDsluCounter, 509 mSDsCounter, 0 mSdLazyCounter, 55 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 314 SdHoareTripleChecker+Valid, 1092 SdHoareTripleChecker+Invalid, 55 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 55 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2025-02-05 21:56:21,206 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [314 Valid, 1092 Invalid, 55 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 55 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2025-02-05 21:56:21,218 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 17135 states. [2025-02-05 21:56:22,054 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 17135 to 17117. [2025-02-05 21:56:22,077 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 17117 states, 15251 states have (on average 1.5911743492230017) internal successors, (24267), 15292 states have internal predecessors, (24267), 1773 states have call successors, (1773), 92 states have call predecessors, (1773), 92 states have return successors, (1773), 1732 states have call predecessors, (1773), 1773 states have call successors, (1773) [2025-02-05 21:56:22,118 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 17117 states to 17117 states and 27813 transitions. [2025-02-05 21:56:22,130 INFO L78 Accepts]: Start accepts. Automaton has 17117 states and 27813 transitions. Word has length 650 [2025-02-05 21:56:22,132 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-02-05 21:56:22,132 INFO L471 AbstractCegarLoop]: Abstraction has 17117 states and 27813 transitions. [2025-02-05 21:56:22,132 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 52.666666666666664) internal successors, (158), 3 states have internal predecessors, (158), 1 states have call successors, (99), 1 states have call predecessors, (99), 1 states have return successors, (99), 1 states have call predecessors, (99), 1 states have call successors, (99) [2025-02-05 21:56:22,132 INFO L276 IsEmpty]: Start isEmpty. Operand 17117 states and 27813 transitions. [2025-02-05 21:56:22,148 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 652 [2025-02-05 21:56:22,149 INFO L210 NwaCegarLoop]: Found error trace [2025-02-05 21:56:22,149 INFO L218 NwaCegarLoop]: trace histogram [99, 99, 99, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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:56:22,149 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable17 [2025-02-05 21:56:22,150 INFO L396 AbstractCegarLoop]: === Iteration 19 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-02-05 21:56:22,152 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-02-05 21:56:22,153 INFO L85 PathProgramCache]: Analyzing trace with hash -421685755, now seen corresponding path program 1 times [2025-02-05 21:56:22,153 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-02-05 21:56:22,153 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [472147460] [2025-02-05 21:56:22,153 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-02-05 21:56:22,153 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-02-05 21:56:22,194 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 651 statements into 1 equivalence classes. [2025-02-05 21:56:22,236 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 651 of 651 statements. [2025-02-05 21:56:22,237 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-02-05 21:56:22,237 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-02-05 21:56:22,519 INFO L134 CoverageAnalysis]: Checked inductivity of 19404 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 19404 trivial. 0 not checked. [2025-02-05 21:56:22,520 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-02-05 21:56:22,520 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [472147460] [2025-02-05 21:56:22,520 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [472147460] provided 1 perfect and 0 imperfect interpolant sequences [2025-02-05 21:56:22,520 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-02-05 21:56:22,520 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2025-02-05 21:56:22,520 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1744910667] [2025-02-05 21:56:22,520 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-02-05 21:56:22,521 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2025-02-05 21:56:22,522 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-02-05 21:56:22,522 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2025-02-05 21:56:22,522 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-02-05 21:56:22,523 INFO L87 Difference]: Start difference. First operand 17117 states and 27813 transitions. Second operand has 3 states, 3 states have (on average 53.0) internal successors, (159), 3 states have internal predecessors, (159), 1 states have call successors, (99), 1 states have call predecessors, (99), 1 states have return successors, (99), 1 states have call predecessors, (99), 1 states have call successors, (99) [2025-02-05 21:56:23,272 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-02-05 21:56:23,275 INFO L93 Difference]: Finished difference Result 25671 states and 41758 transitions. [2025-02-05 21:56:23,277 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2025-02-05 21:56:23,277 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 53.0) internal successors, (159), 3 states have internal predecessors, (159), 1 states have call successors, (99), 1 states have call predecessors, (99), 1 states have return successors, (99), 1 states have call predecessors, (99), 1 states have call successors, (99) Word has length 651 [2025-02-05 21:56:23,278 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-02-05 21:56:23,398 INFO L225 Difference]: With dead ends: 25671 [2025-02-05 21:56:23,399 INFO L226 Difference]: Without dead ends: 17149 [2025-02-05 21:56:23,412 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:56:23,413 INFO L435 NwaCegarLoop]: 522 mSDtfsCounter, 0 mSDsluCounter, 518 mSDsCounter, 0 mSdLazyCounter, 39 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 0 SdHoareTripleChecker+Valid, 1040 SdHoareTripleChecker+Invalid, 39 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 39 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2025-02-05 21:56:23,413 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [0 Valid, 1040 Invalid, 39 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 39 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2025-02-05 21:56:23,426 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 17149 states. [2025-02-05 21:56:24,348 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 17149 to 17149. [2025-02-05 21:56:24,369 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 17149 states, 15283 states have (on average 1.5899365307858404) internal successors, (24299), 15324 states have internal predecessors, (24299), 1773 states have call successors, (1773), 92 states have call predecessors, (1773), 92 states have return successors, (1773), 1732 states have call predecessors, (1773), 1773 states have call successors, (1773) [2025-02-05 21:56:24,411 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 17149 states to 17149 states and 27845 transitions. [2025-02-05 21:56:24,424 INFO L78 Accepts]: Start accepts. Automaton has 17149 states and 27845 transitions. Word has length 651 [2025-02-05 21:56:24,425 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-02-05 21:56:24,426 INFO L471 AbstractCegarLoop]: Abstraction has 17149 states and 27845 transitions. [2025-02-05 21:56:24,426 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 53.0) internal successors, (159), 3 states have internal predecessors, (159), 1 states have call successors, (99), 1 states have call predecessors, (99), 1 states have return successors, (99), 1 states have call predecessors, (99), 1 states have call successors, (99) [2025-02-05 21:56:24,426 INFO L276 IsEmpty]: Start isEmpty. Operand 17149 states and 27845 transitions. [2025-02-05 21:56:24,444 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 652 [2025-02-05 21:56:24,444 INFO L210 NwaCegarLoop]: Found error trace [2025-02-05 21:56:24,444 INFO L218 NwaCegarLoop]: trace histogram [99, 99, 99, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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:56:24,445 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable18 [2025-02-05 21:56:24,445 INFO L396 AbstractCegarLoop]: === Iteration 20 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-02-05 21:56:24,446 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-02-05 21:56:24,446 INFO L85 PathProgramCache]: Analyzing trace with hash 987226069, now seen corresponding path program 1 times [2025-02-05 21:56:24,446 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-02-05 21:56:24,446 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [869236055] [2025-02-05 21:56:24,446 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-02-05 21:56:24,446 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-02-05 21:56:24,485 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 651 statements into 1 equivalence classes. [2025-02-05 21:56:24,514 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 651 of 651 statements. [2025-02-05 21:56:24,515 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-02-05 21:56:24,515 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-02-05 21:56:24,700 INFO L134 CoverageAnalysis]: Checked inductivity of 19404 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 19404 trivial. 0 not checked. [2025-02-05 21:56:24,700 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-02-05 21:56:24,700 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [869236055] [2025-02-05 21:56:24,700 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [869236055] provided 1 perfect and 0 imperfect interpolant sequences [2025-02-05 21:56:24,700 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-02-05 21:56:24,700 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2025-02-05 21:56:24,701 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1421614980] [2025-02-05 21:56:24,701 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-02-05 21:56:24,703 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2025-02-05 21:56:24,703 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-02-05 21:56:24,703 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2025-02-05 21:56:24,704 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-02-05 21:56:24,704 INFO L87 Difference]: Start difference. First operand 17149 states and 27845 transitions. Second operand has 3 states, 3 states have (on average 53.0) internal successors, (159), 3 states have internal predecessors, (159), 1 states have call successors, (99), 1 states have call predecessors, (99), 1 states have return successors, (99), 1 states have call predecessors, (99), 1 states have call successors, (99) [2025-02-05 21:56:26,267 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-02-05 21:56:26,268 INFO L93 Difference]: Finished difference Result 51265 states and 83271 transitions. [2025-02-05 21:56:26,269 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2025-02-05 21:56:26,269 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 53.0) internal successors, (159), 3 states have internal predecessors, (159), 1 states have call successors, (99), 1 states have call predecessors, (99), 1 states have return successors, (99), 1 states have call predecessors, (99), 1 states have call successors, (99) Word has length 651 [2025-02-05 21:56:26,270 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-02-05 21:56:26,376 INFO L225 Difference]: With dead ends: 51265 [2025-02-05 21:56:26,377 INFO L226 Difference]: Without dead ends: 34207 [2025-02-05 21:56:26,413 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:56:26,415 INFO L435 NwaCegarLoop]: 555 mSDtfsCounter, 314 mSDsluCounter, 510 mSDsCounter, 0 mSdLazyCounter, 57 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 314 SdHoareTripleChecker+Valid, 1065 SdHoareTripleChecker+Invalid, 57 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 57 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2025-02-05 21:56:26,415 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [314 Valid, 1065 Invalid, 57 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 57 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2025-02-05 21:56:26,447 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 34207 states. [2025-02-05 21:56:28,438 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 34207 to 34205. [2025-02-05 21:56:28,474 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 34205 states, 30523 states have (on average 1.587622448645284) internal successors, (48459), 30604 states have internal predecessors, (48459), 3501 states have call successors, (3501), 180 states have call predecessors, (3501), 180 states have return successors, (3501), 3420 states have call predecessors, (3501), 3501 states have call successors, (3501) [2025-02-05 21:56:28,551 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 34205 states to 34205 states and 55461 transitions. [2025-02-05 21:56:28,572 INFO L78 Accepts]: Start accepts. Automaton has 34205 states and 55461 transitions. Word has length 651 [2025-02-05 21:56:28,573 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-02-05 21:56:28,573 INFO L471 AbstractCegarLoop]: Abstraction has 34205 states and 55461 transitions. [2025-02-05 21:56:28,573 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 53.0) internal successors, (159), 3 states have internal predecessors, (159), 1 states have call successors, (99), 1 states have call predecessors, (99), 1 states have return successors, (99), 1 states have call predecessors, (99), 1 states have call successors, (99) [2025-02-05 21:56:28,573 INFO L276 IsEmpty]: Start isEmpty. Operand 34205 states and 55461 transitions. [2025-02-05 21:56:28,596 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 653 [2025-02-05 21:56:28,597 INFO L210 NwaCegarLoop]: Found error trace [2025-02-05 21:56:28,597 INFO L218 NwaCegarLoop]: trace histogram [99, 99, 99, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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:56:28,597 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable19 [2025-02-05 21:56:28,598 INFO L396 AbstractCegarLoop]: === Iteration 21 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-02-05 21:56:28,598 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-02-05 21:56:28,599 INFO L85 PathProgramCache]: Analyzing trace with hash -591503947, now seen corresponding path program 1 times [2025-02-05 21:56:28,599 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-02-05 21:56:28,599 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [485716583] [2025-02-05 21:56:28,599 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-02-05 21:56:28,599 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-02-05 21:56:28,637 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 652 statements into 1 equivalence classes. [2025-02-05 21:56:28,670 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 652 of 652 statements. [2025-02-05 21:56:28,670 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-02-05 21:56:28,670 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-02-05 21:56:29,161 INFO L134 CoverageAnalysis]: Checked inductivity of 19404 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 19404 trivial. 0 not checked. [2025-02-05 21:56:29,162 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-02-05 21:56:29,162 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [485716583] [2025-02-05 21:56:29,162 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [485716583] provided 1 perfect and 0 imperfect interpolant sequences [2025-02-05 21:56:29,162 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-02-05 21:56:29,162 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2025-02-05 21:56:29,162 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1511565251] [2025-02-05 21:56:29,164 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-02-05 21:56:29,164 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2025-02-05 21:56:29,164 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-02-05 21:56:29,165 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2025-02-05 21:56:29,165 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-02-05 21:56:29,166 INFO L87 Difference]: Start difference. First operand 34205 states and 55461 transitions. Second operand has 3 states, 3 states have (on average 53.333333333333336) internal successors, (160), 3 states have internal predecessors, (160), 1 states have call successors, (99), 1 states have call predecessors, (99), 1 states have return successors, (99), 1 states have call predecessors, (99), 1 states have call successors, (99) [2025-02-05 21:56:30,871 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-02-05 21:56:30,871 INFO L93 Difference]: Finished difference Result 68337 states and 110823 transitions. [2025-02-05 21:56:30,872 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2025-02-05 21:56:30,872 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 53.333333333333336) internal successors, (160), 3 states have internal predecessors, (160), 1 states have call successors, (99), 1 states have call predecessors, (99), 1 states have return successors, (99), 1 states have call predecessors, (99), 1 states have call successors, (99) Word has length 652 [2025-02-05 21:56:30,873 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-02-05 21:56:30,976 INFO L225 Difference]: With dead ends: 68337 [2025-02-05 21:56:30,977 INFO L226 Difference]: Without dead ends: 34223 [2025-02-05 21:56:31,041 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:56:31,042 INFO L435 NwaCegarLoop]: 553 mSDtfsCounter, 309 mSDsluCounter, 503 mSDsCounter, 0 mSdLazyCounter, 69 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 309 SdHoareTripleChecker+Valid, 1056 SdHoareTripleChecker+Invalid, 69 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 69 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2025-02-05 21:56:31,042 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [309 Valid, 1056 Invalid, 69 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 69 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2025-02-05 21:56:31,070 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 34223 states. [2025-02-05 21:56:33,273 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 34223 to 34205. [2025-02-05 21:56:33,301 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 34205 states, 30523 states have (on average 1.5860498640369558) internal successors, (48411), 30604 states have internal predecessors, (48411), 3501 states have call successors, (3501), 180 states have call predecessors, (3501), 180 states have return successors, (3501), 3420 states have call predecessors, (3501), 3501 states have call successors, (3501) [2025-02-05 21:56:33,372 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 34205 states to 34205 states and 55413 transitions. [2025-02-05 21:56:33,398 INFO L78 Accepts]: Start accepts. Automaton has 34205 states and 55413 transitions. Word has length 652 [2025-02-05 21:56:33,399 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-02-05 21:56:33,399 INFO L471 AbstractCegarLoop]: Abstraction has 34205 states and 55413 transitions. [2025-02-05 21:56:33,399 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 53.333333333333336) internal successors, (160), 3 states have internal predecessors, (160), 1 states have call successors, (99), 1 states have call predecessors, (99), 1 states have return successors, (99), 1 states have call predecessors, (99), 1 states have call successors, (99) [2025-02-05 21:56:33,399 INFO L276 IsEmpty]: Start isEmpty. Operand 34205 states and 55413 transitions. [2025-02-05 21:56:33,424 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 654 [2025-02-05 21:56:33,424 INFO L210 NwaCegarLoop]: Found error trace [2025-02-05 21:56:33,425 INFO L218 NwaCegarLoop]: trace histogram [99, 99, 99, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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:56:33,425 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable20 [2025-02-05 21:56:33,425 INFO L396 AbstractCegarLoop]: === Iteration 22 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-02-05 21:56:33,426 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-02-05 21:56:33,426 INFO L85 PathProgramCache]: Analyzing trace with hash -1217857409, now seen corresponding path program 1 times [2025-02-05 21:56:33,426 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-02-05 21:56:33,426 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [303877878] [2025-02-05 21:56:33,427 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-02-05 21:56:33,427 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-02-05 21:56:33,462 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 653 statements into 1 equivalence classes. [2025-02-05 21:56:33,497 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 653 of 653 statements. [2025-02-05 21:56:33,498 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-02-05 21:56:33,498 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-02-05 21:56:34,571 INFO L134 CoverageAnalysis]: Checked inductivity of 19404 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 19404 trivial. 0 not checked. [2025-02-05 21:56:34,572 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-02-05 21:56:34,572 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [303877878] [2025-02-05 21:56:34,572 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [303877878] provided 1 perfect and 0 imperfect interpolant sequences [2025-02-05 21:56:34,572 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-02-05 21:56:34,572 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2025-02-05 21:56:34,572 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [549585148] [2025-02-05 21:56:34,572 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-02-05 21:56:34,573 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 7 states [2025-02-05 21:56:34,573 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-02-05 21:56:34,574 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2025-02-05 21:56:34,575 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=14, Invalid=28, Unknown=0, NotChecked=0, Total=42 [2025-02-05 21:56:34,575 INFO L87 Difference]: Start difference. First operand 34205 states and 55413 transitions. Second operand has 7 states, 7 states have (on average 23.0) internal successors, (161), 7 states have internal predecessors, (161), 1 states have call successors, (99), 1 states have call predecessors, (99), 1 states have return successors, (99), 1 states have call predecessors, (99), 1 states have call successors, (99) [2025-02-05 21:56:38,010 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-02-05 21:56:38,010 INFO L93 Difference]: Finished difference Result 85571 states and 138480 transitions. [2025-02-05 21:56:38,011 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2025-02-05 21:56:38,011 INFO L78 Accepts]: Start accepts. Automaton has has 7 states, 7 states have (on average 23.0) internal successors, (161), 7 states have internal predecessors, (161), 1 states have call successors, (99), 1 states have call predecessors, (99), 1 states have return successors, (99), 1 states have call predecessors, (99), 1 states have call successors, (99) Word has length 653 [2025-02-05 21:56:38,014 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-02-05 21:56:38,183 INFO L225 Difference]: With dead ends: 85571 [2025-02-05 21:56:38,184 INFO L226 Difference]: Without dead ends: 51457 [2025-02-05 21:56:38,268 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 9 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 7 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 7 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=26, Invalid=46, Unknown=0, NotChecked=0, Total=72 [2025-02-05 21:56:38,272 INFO L435 NwaCegarLoop]: 932 mSDtfsCounter, 969 mSDsluCounter, 2856 mSDsCounter, 0 mSdLazyCounter, 1062 mSolverCounterSat, 1 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.9s Time, 0 mProtectedPredicate, 0 mProtectedAction, 969 SdHoareTripleChecker+Valid, 3788 SdHoareTripleChecker+Invalid, 1063 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 1 IncrementalHoareTripleChecker+Valid, 1062 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 1.0s IncrementalHoareTripleChecker+Time [2025-02-05 21:56:38,272 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [969 Valid, 3788 Invalid, 1063 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [1 Valid, 1062 Invalid, 0 Unknown, 0 Unchecked, 1.0s Time] [2025-02-05 21:56:38,317 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 51457 states. [2025-02-05 21:56:40,540 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 51457 to 48893. [2025-02-05 21:56:40,590 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 48893 states, 44131 states have (on average 1.588248623416646) internal successors, (70091), 44260 states have internal predecessors, (70091), 4509 states have call successors, (4509), 252 states have call predecessors, (4509), 252 states have return successors, (4509), 4380 states have call predecessors, (4509), 4509 states have call successors, (4509) [2025-02-05 21:56:40,705 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 48893 states to 48893 states and 79109 transitions. [2025-02-05 21:56:40,729 INFO L78 Accepts]: Start accepts. Automaton has 48893 states and 79109 transitions. Word has length 653 [2025-02-05 21:56:40,730 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-02-05 21:56:40,730 INFO L471 AbstractCegarLoop]: Abstraction has 48893 states and 79109 transitions. [2025-02-05 21:56:40,730 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 7 states, 7 states have (on average 23.0) internal successors, (161), 7 states have internal predecessors, (161), 1 states have call successors, (99), 1 states have call predecessors, (99), 1 states have return successors, (99), 1 states have call predecessors, (99), 1 states have call successors, (99) [2025-02-05 21:56:40,730 INFO L276 IsEmpty]: Start isEmpty. Operand 48893 states and 79109 transitions. [2025-02-05 21:56:40,768 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 654 [2025-02-05 21:56:40,768 INFO L210 NwaCegarLoop]: Found error trace [2025-02-05 21:56:40,769 INFO L218 NwaCegarLoop]: trace histogram [99, 99, 99, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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:56:40,769 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable21 [2025-02-05 21:56:40,770 INFO L396 AbstractCegarLoop]: === Iteration 23 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-02-05 21:56:40,770 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-02-05 21:56:40,770 INFO L85 PathProgramCache]: Analyzing trace with hash -350805184, now seen corresponding path program 1 times [2025-02-05 21:56:40,771 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-02-05 21:56:40,771 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1657133029] [2025-02-05 21:56:40,771 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-02-05 21:56:40,771 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-02-05 21:56:40,816 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 653 statements into 1 equivalence classes. [2025-02-05 21:56:41,017 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 653 of 653 statements. [2025-02-05 21:56:41,017 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-02-05 21:56:41,018 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-02-05 21:56:41,679 INFO L134 CoverageAnalysis]: Checked inductivity of 19404 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 19404 trivial. 0 not checked. [2025-02-05 21:56:41,680 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-02-05 21:56:41,680 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1657133029] [2025-02-05 21:56:41,680 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1657133029] provided 1 perfect and 0 imperfect interpolant sequences [2025-02-05 21:56:41,680 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-02-05 21:56:41,680 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2025-02-05 21:56:41,680 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [227321450] [2025-02-05 21:56:41,681 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-02-05 21:56:41,681 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2025-02-05 21:56:41,681 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-02-05 21:56:41,682 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2025-02-05 21:56:41,682 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=6, Invalid=6, Unknown=0, NotChecked=0, Total=12 [2025-02-05 21:56:41,682 INFO L87 Difference]: Start difference. First operand 48893 states and 79109 transitions. Second operand has 4 states, 4 states have (on average 40.25) internal successors, (161), 4 states have internal predecessors, (161), 1 states have call successors, (99), 1 states have call predecessors, (99), 1 states have return successors, (99), 1 states have call predecessors, (99), 1 states have call successors, (99)