./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 e2fb8bed Calling Ultimate with: /root/.sdkman/candidates/java/21.0.5-tem/bin/java -Dosgi.configuration.area=/storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/config -Xmx15G -Xms4m -jar /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/plugins/org.eclipse.equinox.launcher_1.6.800.v20240513-1750.jar -data @noDefault -ultimatedata /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data -tc /storage/repos/ultimate/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/releaseScripts/default/UAutomizer-linux/config/svcomp-Reach-32bit-Automizer_Default.epf --cacsl2boogietranslator.entry.function main --witnessprinter.witness.directory /storage/repos/ultimate/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-?-e2fb8be-m [2025-03-08 11:17:16,804 INFO L188 SettingsManager]: Resetting all preferences to default values... [2025-03-08 11:17:16,844 INFO L114 SettingsManager]: Loading settings from /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/config/svcomp-Reach-32bit-Automizer_Default.epf [2025-03-08 11:17:16,847 WARN L101 SettingsManager]: Preference file contains the following unknown settings: [2025-03-08 11:17:16,848 WARN L103 SettingsManager]: * de.uni_freiburg.informatik.ultimate.core.Log level for class [2025-03-08 11:17:16,866 INFO L130 SettingsManager]: Preferences different from defaults after loading the file: [2025-03-08 11:17:16,867 INFO L151 SettingsManager]: Preferences of UltimateCore differ from their defaults: [2025-03-08 11:17:16,868 INFO L153 SettingsManager]: * Log level for class=de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher=ERROR; [2025-03-08 11:17:16,868 INFO L151 SettingsManager]: Preferences of Boogie Preprocessor differ from their defaults: [2025-03-08 11:17:16,868 INFO L153 SettingsManager]: * Use memory slicer=true [2025-03-08 11:17:16,868 INFO L151 SettingsManager]: Preferences of Boogie Procedure Inliner differ from their defaults: [2025-03-08 11:17:16,868 INFO L153 SettingsManager]: * Ignore calls to procedures called more than once=ONLY_FOR_SEQUENTIAL_PROGRAMS [2025-03-08 11:17:16,869 INFO L151 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2025-03-08 11:17:16,869 INFO L153 SettingsManager]: * Create parallel compositions if possible=false [2025-03-08 11:17:16,869 INFO L153 SettingsManager]: * Use SBE=true [2025-03-08 11:17:16,869 INFO L151 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2025-03-08 11:17:16,869 INFO L153 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2025-03-08 11:17:16,869 INFO L153 SettingsManager]: * sizeof long=4 [2025-03-08 11:17:16,870 INFO L153 SettingsManager]: * Overapproximate operations on floating types=true [2025-03-08 11:17:16,870 INFO L153 SettingsManager]: * sizeof POINTER=4 [2025-03-08 11:17:16,870 INFO L153 SettingsManager]: * Check division by zero=IGNORE [2025-03-08 11:17:16,870 INFO L153 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2025-03-08 11:17:16,870 INFO L153 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2025-03-08 11:17:16,870 INFO L153 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2025-03-08 11:17:16,870 INFO L153 SettingsManager]: * sizeof long double=12 [2025-03-08 11:17:16,870 INFO L153 SettingsManager]: * Check if freed pointer was valid=false [2025-03-08 11:17:16,870 INFO L153 SettingsManager]: * Behaviour of calls to undefined functions=OVERAPPROXIMATE_BEHAVIOUR [2025-03-08 11:17:16,870 INFO L153 SettingsManager]: * Use constant arrays=true [2025-03-08 11:17:16,871 INFO L151 SettingsManager]: Preferences of IcfgBuilder differ from their defaults: [2025-03-08 11:17:16,871 INFO L153 SettingsManager]: * Size of a code block=SequenceOfStatements [2025-03-08 11:17:16,871 INFO L153 SettingsManager]: * Only consider context switches at boundaries of atomic blocks=true [2025-03-08 11:17:16,871 INFO L153 SettingsManager]: * SMT solver=External_DefaultMode [2025-03-08 11:17:16,871 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2025-03-08 11:17:16,871 INFO L151 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2025-03-08 11:17:16,871 INFO L153 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2025-03-08 11:17:16,871 INFO L153 SettingsManager]: * Compute procedure contracts=false [2025-03-08 11:17:16,871 INFO L153 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopHeads [2025-03-08 11:17:16,871 INFO L153 SettingsManager]: * Trace refinement strategy=CAMEL [2025-03-08 11:17:16,871 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2025-03-08 11:17:16,871 INFO L153 SettingsManager]: * Apply one-shot large block encoding in concurrent analysis=false [2025-03-08 11:17:16,871 INFO L153 SettingsManager]: * Automaton type used in concurrency analysis=PETRI_NET [2025-03-08 11:17:16,871 INFO L153 SettingsManager]: * Order on configurations for Petri net unfoldings=DBO [2025-03-08 11:17:16,871 INFO L153 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode [2025-03-08 11:17:16,871 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/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-03-08 11:17:17,082 INFO L75 nceAwareModelManager]: Repository-Root is: /tmp [2025-03-08 11:17:17,091 INFO L261 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2025-03-08 11:17:17,093 INFO L217 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2025-03-08 11:17:17,094 INFO L270 PluginConnector]: Initializing CDTParser... [2025-03-08 11:17:17,094 INFO L274 PluginConnector]: CDTParser initialized [2025-03-08 11:17:17,095 INFO L431 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/../sv-benchmarks/c/hardness-nfm22/hardness_fillercode_fillercodesize_ps-cn-500_file-2.i [2025-03-08 11:17:18,231 INFO L533 CDTParser]: Created temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/0af6c6c4c/a9218974433e446eb6faaa0845a1f4cf/FLAGa19ca2782 [2025-03-08 11:17:18,528 INFO L384 CDTParser]: Found 1 translation units. [2025-03-08 11:17:18,529 INFO L180 CDTParser]: Scanning /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/hardness-nfm22/hardness_fillercode_fillercodesize_ps-cn-500_file-2.i [2025-03-08 11:17:18,544 INFO L427 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/0af6c6c4c/a9218974433e446eb6faaa0845a1f4cf/FLAGa19ca2782 [2025-03-08 11:17:18,554 INFO L435 CDTParser]: Successfully deleted /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/0af6c6c4c/a9218974433e446eb6faaa0845a1f4cf [2025-03-08 11:17:18,557 INFO L299 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2025-03-08 11:17:18,559 INFO L133 ToolchainWalker]: Walking toolchain with 6 elements. [2025-03-08 11:17:18,560 INFO L112 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2025-03-08 11:17:18,560 INFO L270 PluginConnector]: Initializing CACSL2BoogieTranslator... [2025-03-08 11:17:18,563 INFO L274 PluginConnector]: CACSL2BoogieTranslator initialized [2025-03-08 11:17:18,564 INFO L184 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 08.03 11:17:18" (1/1) ... [2025-03-08 11:17:18,565 INFO L204 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@1b739f86 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.03 11:17:18, skipping insertion in model container [2025-03-08 11:17:18,565 INFO L184 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 08.03 11:17:18" (1/1) ... [2025-03-08 11:17:18,598 INFO L175 MainTranslator]: Built tables and reachable declarations [2025-03-08 11:17:18,710 WARN L250 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/hardness-nfm22/hardness_fillercode_fillercodesize_ps-cn-500_file-2.i[915,928] [2025-03-08 11:17:18,889 INFO L210 PostProcessor]: Analyzing one entry point: main [2025-03-08 11:17:18,910 INFO L200 MainTranslator]: Completed pre-run [2025-03-08 11:17:18,918 WARN L250 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/hardness-nfm22/hardness_fillercode_fillercodesize_ps-cn-500_file-2.i[915,928] [2025-03-08 11:17:18,990 INFO L210 PostProcessor]: Analyzing one entry point: main [2025-03-08 11:17:19,010 INFO L204 MainTranslator]: Completed translation [2025-03-08 11:17:19,011 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.03 11:17:19 WrapperNode [2025-03-08 11:17:19,011 INFO L131 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2025-03-08 11:17:19,012 INFO L112 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2025-03-08 11:17:19,012 INFO L270 PluginConnector]: Initializing Boogie Procedure Inliner... [2025-03-08 11:17:19,012 INFO L274 PluginConnector]: Boogie Procedure Inliner initialized [2025-03-08 11:17:19,018 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.03 11:17:19" (1/1) ... [2025-03-08 11:17:19,038 INFO L184 PluginConnector]: Executing the observer Inliner from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.03 11:17:19" (1/1) ... [2025-03-08 11:17:19,102 INFO L138 Inliner]: procedures = 26, calls = 112, calls flagged for inlining = 8, calls inlined = 8, statements flattened = 818 [2025-03-08 11:17:19,103 INFO L131 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2025-03-08 11:17:19,104 INFO L112 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2025-03-08 11:17:19,104 INFO L270 PluginConnector]: Initializing Boogie Preprocessor... [2025-03-08 11:17:19,104 INFO L274 PluginConnector]: Boogie Preprocessor initialized [2025-03-08 11:17:19,111 INFO L184 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.03 11:17:19" (1/1) ... [2025-03-08 11:17:19,112 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.03 11:17:19" (1/1) ... [2025-03-08 11:17:19,124 INFO L184 PluginConnector]: Executing the observer MemorySlicer from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.03 11:17:19" (1/1) ... [2025-03-08 11:17:19,163 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-03-08 11:17:19,163 INFO L184 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.03 11:17:19" (1/1) ... [2025-03-08 11:17:19,163 INFO L184 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.03 11:17:19" (1/1) ... [2025-03-08 11:17:19,191 INFO L184 PluginConnector]: Executing the observer ReplaceArrayAssignments from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.03 11:17:19" (1/1) ... [2025-03-08 11:17:19,199 INFO L184 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.03 11:17:19" (1/1) ... [2025-03-08 11:17:19,204 INFO L184 PluginConnector]: Executing the observer LTLStepAnnotator from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.03 11:17:19" (1/1) ... [2025-03-08 11:17:19,209 INFO L184 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.03 11:17:19" (1/1) ... [2025-03-08 11:17:19,217 INFO L131 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2025-03-08 11:17:19,218 INFO L112 PluginConnector]: ------------------------IcfgBuilder---------------------------- [2025-03-08 11:17:19,218 INFO L270 PluginConnector]: Initializing IcfgBuilder... [2025-03-08 11:17:19,218 INFO L274 PluginConnector]: IcfgBuilder initialized [2025-03-08 11:17:19,219 INFO L184 PluginConnector]: Executing the observer IcfgBuilderObserver from plugin IcfgBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.03 11:17:19" (1/1) ... [2025-03-08 11:17:19,222 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2025-03-08 11:17:19,230 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2025-03-08 11:17:19,242 INFO L229 MonitoredProcess]: Starting monitored process 1 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 (exit command is (exit), workingDir is null) [2025-03-08 11:17:19,244 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 (1)] Waiting until timeout for monitored process [2025-03-08 11:17:19,263 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocInit [2025-03-08 11:17:19,263 INFO L130 BoogieDeclarations]: Found specification of procedure assume_abort_if_not [2025-03-08 11:17:19,264 INFO L138 BoogieDeclarations]: Found implementation of procedure assume_abort_if_not [2025-03-08 11:17:19,264 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int#0 [2025-03-08 11:17:19,264 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2025-03-08 11:17:19,264 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2025-03-08 11:17:19,410 INFO L256 CfgBuilder]: Building ICFG [2025-03-08 11:17:19,411 INFO L286 CfgBuilder]: Building CFG for each procedure with an implementation [2025-03-08 11:17:20,366 INFO L? ?]: Removed 15 outVars from TransFormulas that were not future-live. [2025-03-08 11:17:20,366 INFO L307 CfgBuilder]: Performing block encoding [2025-03-08 11:17:20,396 INFO L331 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2025-03-08 11:17:20,396 INFO L336 CfgBuilder]: Removed 1 assume(true) statements. [2025-03-08 11:17:20,397 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.icfgbuilder CFG 08.03 11:17:20 BoogieIcfgContainer [2025-03-08 11:17:20,397 INFO L131 PluginConnector]: ------------------------ END IcfgBuilder---------------------------- [2025-03-08 11:17:20,399 INFO L112 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2025-03-08 11:17:20,399 INFO L270 PluginConnector]: Initializing TraceAbstraction... [2025-03-08 11:17:20,402 INFO L274 PluginConnector]: TraceAbstraction initialized [2025-03-08 11:17:20,402 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 08.03 11:17:18" (1/3) ... [2025-03-08 11:17:20,403 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@58dd8163 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 08.03 11:17:20, skipping insertion in model container [2025-03-08 11:17:20,403 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.03 11:17:19" (2/3) ... [2025-03-08 11:17:20,403 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@58dd8163 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 08.03 11:17:20, skipping insertion in model container [2025-03-08 11:17:20,403 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.icfgbuilder CFG 08.03 11:17:20" (3/3) ... [2025-03-08 11:17:20,404 INFO L128 eAbstractionObserver]: Analyzing ICFG hardness_fillercode_fillercodesize_ps-cn-500_file-2.i [2025-03-08 11:17:20,413 INFO L216 ceAbstractionStarter]: Automizer settings: Hoare:LoopHeads NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2025-03-08 11:17:20,417 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-03-08 11:17:20,485 INFO L332 AbstractCegarLoop]: ======== Iteration 0 == of CEGAR loop == AllErrorsAtOnce ======== [2025-03-08 11:17:20,496 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;@4fe199b0, mLbeIndependenceSettings=[IndependenceType=SEMANTIC, AbstractionType=NONE, UseConditional=false, UseSemiCommutativity=true, Solver=Z3, SolverTimeout=1000ms] [2025-03-08 11:17:20,496 INFO L334 AbstractCegarLoop]: Starting to check reachability of 1 error locations. [2025-03-08 11:17:20,500 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-03-08 11:17:20,525 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 643 [2025-03-08 11:17:20,525 INFO L210 NwaCegarLoop]: Found error trace [2025-03-08 11:17:20,526 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-03-08 11:17:20,526 INFO L396 AbstractCegarLoop]: === Iteration 1 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-03-08 11:17:20,531 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-08 11:17:20,532 INFO L85 PathProgramCache]: Analyzing trace with hash -1535950885, now seen corresponding path program 1 times [2025-03-08 11:17:20,537 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-08 11:17:20,538 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [689728098] [2025-03-08 11:17:20,538 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-08 11:17:20,538 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-08 11:17:20,657 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 642 statements into 1 equivalence classes. [2025-03-08 11:17:20,709 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 642 of 642 statements. [2025-03-08 11:17:20,713 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-08 11:17:20,713 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-08 11:17:21,148 INFO L134 CoverageAnalysis]: Checked inductivity of 19404 backedges. 0 proven. 196 refuted. 0 times theorem prover too weak. 19208 trivial. 0 not checked. [2025-03-08 11:17:21,149 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-08 11:17:21,150 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [689728098] [2025-03-08 11:17:21,150 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [689728098] provided 0 perfect and 1 imperfect interpolant sequences [2025-03-08 11:17:21,151 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1420406827] [2025-03-08 11:17:21,152 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-08 11:17:21,152 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-03-08 11:17:21,152 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2025-03-08 11:17:21,155 INFO L229 MonitoredProcess]: Starting monitored process 2 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2025-03-08 11:17:21,156 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (2)] Waiting until timeout for monitored process [2025-03-08 11:17:21,312 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 642 statements into 1 equivalence classes. [2025-03-08 11:17:21,498 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 642 of 642 statements. [2025-03-08 11:17:21,498 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-08 11:17:21,498 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-08 11:17:21,506 INFO L256 TraceCheckSpWp]: Trace formula consists of 1458 conjuncts, 1 conjuncts are in the unsatisfiable core [2025-03-08 11:17:21,528 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-03-08 11:17:21,591 INFO L134 CoverageAnalysis]: Checked inductivity of 19404 backedges. 196 proven. 0 refuted. 0 times theorem prover too weak. 19208 trivial. 0 not checked. [2025-03-08 11:17:21,592 INFO L308 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2025-03-08 11:17:21,592 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1420406827] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-08 11:17:21,592 INFO L185 FreeRefinementEngine]: Found 1 perfect and 1 imperfect interpolant sequences. [2025-03-08 11:17:21,593 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [2] total 2 [2025-03-08 11:17:21,594 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1539824521] [2025-03-08 11:17:21,595 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-08 11:17:21,599 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 2 states [2025-03-08 11:17:21,599 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-08 11:17:21,617 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 2 interpolants. [2025-03-08 11:17:21,617 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=1, Invalid=1, Unknown=0, NotChecked=0, Total=2 [2025-03-08 11:17:21,620 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-03-08 11:17:21,719 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-08 11:17:21,719 INFO L93 Difference]: Finished difference Result 661 states and 1222 transitions. [2025-03-08 11:17:21,720 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 2 states. [2025-03-08 11:17:21,721 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-03-08 11:17:21,721 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-08 11:17:21,731 INFO L225 Difference]: With dead ends: 661 [2025-03-08 11:17:21,731 INFO L226 Difference]: Without dead ends: 330 [2025-03-08 11:17:21,736 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-03-08 11:17:21,741 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-03-08 11:17:21,741 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-03-08 11:17:21,755 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 330 states. [2025-03-08 11:17:21,810 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 330 to 330. [2025-03-08 11:17:21,812 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-03-08 11:17:21,818 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 330 states to 330 states and 552 transitions. [2025-03-08 11:17:21,822 INFO L78 Accepts]: Start accepts. Automaton has 330 states and 552 transitions. Word has length 642 [2025-03-08 11:17:21,823 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-08 11:17:21,823 INFO L471 AbstractCegarLoop]: Abstraction has 330 states and 552 transitions. [2025-03-08 11:17:21,824 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-03-08 11:17:21,824 INFO L276 IsEmpty]: Start isEmpty. Operand 330 states and 552 transitions. [2025-03-08 11:17:21,838 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 644 [2025-03-08 11:17:21,838 INFO L210 NwaCegarLoop]: Found error trace [2025-03-08 11:17:21,838 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-03-08 11:17:21,849 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (2)] Ended with exit code 0 [2025-03-08 11:17:22,041 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 2 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable0 [2025-03-08 11:17:22,042 INFO L396 AbstractCegarLoop]: === Iteration 2 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-03-08 11:17:22,043 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-08 11:17:22,043 INFO L85 PathProgramCache]: Analyzing trace with hash 1887949195, now seen corresponding path program 1 times [2025-03-08 11:17:22,044 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-08 11:17:22,044 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1598342006] [2025-03-08 11:17:22,044 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-08 11:17:22,044 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-08 11:17:22,095 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 643 statements into 1 equivalence classes. [2025-03-08 11:17:22,182 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 643 of 643 statements. [2025-03-08 11:17:22,185 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-08 11:17:22,185 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-08 11:17:22,680 INFO L134 CoverageAnalysis]: Checked inductivity of 19404 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 19404 trivial. 0 not checked. [2025-03-08 11:17:22,682 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-08 11:17:22,682 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1598342006] [2025-03-08 11:17:22,682 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1598342006] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-08 11:17:22,682 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-08 11:17:22,683 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2025-03-08 11:17:22,683 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1498156901] [2025-03-08 11:17:22,684 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-08 11:17:22,685 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2025-03-08 11:17:22,687 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-08 11:17:22,688 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2025-03-08 11:17:22,688 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-03-08 11:17:22,688 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-03-08 11:17:22,810 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-08 11:17:22,814 INFO L93 Difference]: Finished difference Result 851 states and 1429 transitions. [2025-03-08 11:17:22,814 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2025-03-08 11:17:22,815 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-03-08 11:17:22,817 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-08 11:17:22,822 INFO L225 Difference]: With dead ends: 851 [2025-03-08 11:17:22,824 INFO L226 Difference]: Without dead ends: 524 [2025-03-08 11:17:22,826 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-03-08 11:17:22,826 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-03-08 11:17:22,827 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-03-08 11:17:22,828 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 524 states. [2025-03-08 11:17:22,884 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 524 to 521. [2025-03-08 11:17:22,886 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-03-08 11:17:22,889 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 521 states to 521 states and 873 transitions. [2025-03-08 11:17:22,890 INFO L78 Accepts]: Start accepts. Automaton has 521 states and 873 transitions. Word has length 643 [2025-03-08 11:17:22,891 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-08 11:17:22,891 INFO L471 AbstractCegarLoop]: Abstraction has 521 states and 873 transitions. [2025-03-08 11:17:22,892 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-03-08 11:17:22,892 INFO L276 IsEmpty]: Start isEmpty. Operand 521 states and 873 transitions. [2025-03-08 11:17:22,902 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 644 [2025-03-08 11:17:22,903 INFO L210 NwaCegarLoop]: Found error trace [2025-03-08 11:17:22,903 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-03-08 11:17:22,903 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable1 [2025-03-08 11:17:22,903 INFO L396 AbstractCegarLoop]: === Iteration 3 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-03-08 11:17:22,904 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-08 11:17:22,904 INFO L85 PathProgramCache]: Analyzing trace with hash -2091465269, now seen corresponding path program 1 times [2025-03-08 11:17:22,904 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-08 11:17:22,904 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [486912354] [2025-03-08 11:17:22,905 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-08 11:17:22,905 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-08 11:17:22,948 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 643 statements into 1 equivalence classes. [2025-03-08 11:17:23,004 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 643 of 643 statements. [2025-03-08 11:17:23,006 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-08 11:17:23,006 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-08 11:17:23,224 INFO L134 CoverageAnalysis]: Checked inductivity of 19404 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 19404 trivial. 0 not checked. [2025-03-08 11:17:23,224 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-08 11:17:23,224 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [486912354] [2025-03-08 11:17:23,224 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [486912354] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-08 11:17:23,224 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-08 11:17:23,224 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2025-03-08 11:17:23,224 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2072377174] [2025-03-08 11:17:23,225 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-08 11:17:23,225 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2025-03-08 11:17:23,225 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-08 11:17:23,226 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2025-03-08 11:17:23,226 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-03-08 11:17:23,226 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-03-08 11:17:23,339 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-08 11:17:23,339 INFO L93 Difference]: Finished difference Result 1046 states and 1748 transitions. [2025-03-08 11:17:23,340 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2025-03-08 11:17:23,340 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-03-08 11:17:23,341 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-08 11:17:23,344 INFO L225 Difference]: With dead ends: 1046 [2025-03-08 11:17:23,344 INFO L226 Difference]: Without dead ends: 528 [2025-03-08 11:17:23,345 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-03-08 11:17:23,346 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-03-08 11:17:23,346 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-03-08 11:17:23,347 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 528 states. [2025-03-08 11:17:23,390 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 528 to 453. [2025-03-08 11:17:23,393 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-03-08 11:17:23,396 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 453 states to 453 states and 760 transitions. [2025-03-08 11:17:23,398 INFO L78 Accepts]: Start accepts. Automaton has 453 states and 760 transitions. Word has length 643 [2025-03-08 11:17:23,399 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-08 11:17:23,401 INFO L471 AbstractCegarLoop]: Abstraction has 453 states and 760 transitions. [2025-03-08 11:17:23,401 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-03-08 11:17:23,401 INFO L276 IsEmpty]: Start isEmpty. Operand 453 states and 760 transitions. [2025-03-08 11:17:23,411 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 644 [2025-03-08 11:17:23,412 INFO L210 NwaCegarLoop]: Found error trace [2025-03-08 11:17:23,412 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-03-08 11:17:23,412 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable2 [2025-03-08 11:17:23,412 INFO L396 AbstractCegarLoop]: === Iteration 4 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-03-08 11:17:23,413 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-08 11:17:23,413 INFO L85 PathProgramCache]: Analyzing trace with hash 874356076, now seen corresponding path program 1 times [2025-03-08 11:17:23,414 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-08 11:17:23,414 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [825038636] [2025-03-08 11:17:23,414 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-08 11:17:23,414 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-08 11:17:23,446 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 643 statements into 1 equivalence classes. [2025-03-08 11:17:23,486 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 643 of 643 statements. [2025-03-08 11:17:23,486 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-08 11:17:23,486 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-08 11:17:23,650 INFO L134 CoverageAnalysis]: Checked inductivity of 19404 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 19404 trivial. 0 not checked. [2025-03-08 11:17:23,650 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-08 11:17:23,651 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [825038636] [2025-03-08 11:17:23,651 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [825038636] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-08 11:17:23,651 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-08 11:17:23,651 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2025-03-08 11:17:23,651 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [181000575] [2025-03-08 11:17:23,651 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-08 11:17:23,653 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2025-03-08 11:17:23,653 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-08 11:17:23,654 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2025-03-08 11:17:23,654 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-03-08 11:17:23,654 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-03-08 11:17:23,732 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-08 11:17:23,732 INFO L93 Difference]: Finished difference Result 1164 states and 1947 transitions. [2025-03-08 11:17:23,733 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2025-03-08 11:17:23,733 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-03-08 11:17:23,734 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-08 11:17:23,740 INFO L225 Difference]: With dead ends: 1164 [2025-03-08 11:17:23,740 INFO L226 Difference]: Without dead ends: 714 [2025-03-08 11:17:23,741 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-03-08 11:17:23,745 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.0s IncrementalHoareTripleChecker+Time [2025-03-08 11:17:23,746 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.0s Time] [2025-03-08 11:17:23,748 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 714 states. [2025-03-08 11:17:23,790 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 714 to 711. [2025-03-08 11:17:23,791 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-03-08 11:17:23,795 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 711 states to 711 states and 1186 transitions. [2025-03-08 11:17:23,796 INFO L78 Accepts]: Start accepts. Automaton has 711 states and 1186 transitions. Word has length 643 [2025-03-08 11:17:23,797 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-08 11:17:23,798 INFO L471 AbstractCegarLoop]: Abstraction has 711 states and 1186 transitions. [2025-03-08 11:17:23,799 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-03-08 11:17:23,799 INFO L276 IsEmpty]: Start isEmpty. Operand 711 states and 1186 transitions. [2025-03-08 11:17:23,804 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 644 [2025-03-08 11:17:23,804 INFO L210 NwaCegarLoop]: Found error trace [2025-03-08 11:17:23,805 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-03-08 11:17:23,806 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable3 [2025-03-08 11:17:23,806 INFO L396 AbstractCegarLoop]: === Iteration 5 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-03-08 11:17:23,807 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-08 11:17:23,807 INFO L85 PathProgramCache]: Analyzing trace with hash 633815947, now seen corresponding path program 1 times [2025-03-08 11:17:23,807 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-08 11:17:23,807 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [16088514] [2025-03-08 11:17:23,807 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-08 11:17:23,807 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-08 11:17:23,841 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 643 statements into 1 equivalence classes. [2025-03-08 11:17:23,875 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 643 of 643 statements. [2025-03-08 11:17:23,876 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-08 11:17:23,876 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-08 11:17:24,019 INFO L134 CoverageAnalysis]: Checked inductivity of 19404 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 19404 trivial. 0 not checked. [2025-03-08 11:17:24,019 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-08 11:17:24,020 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [16088514] [2025-03-08 11:17:24,020 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [16088514] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-08 11:17:24,020 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-08 11:17:24,020 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2025-03-08 11:17:24,020 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2108656837] [2025-03-08 11:17:24,020 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-08 11:17:24,020 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2025-03-08 11:17:24,020 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-08 11:17:24,021 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2025-03-08 11:17:24,021 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-03-08 11:17:24,021 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-03-08 11:17:24,073 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-08 11:17:24,074 INFO L93 Difference]: Finished difference Result 1423 states and 2377 transitions. [2025-03-08 11:17:24,074 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2025-03-08 11:17:24,074 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-03-08 11:17:24,075 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-08 11:17:24,080 INFO L225 Difference]: With dead ends: 1423 [2025-03-08 11:17:24,080 INFO L226 Difference]: Without dead ends: 715 [2025-03-08 11:17:24,082 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-03-08 11:17:24,082 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-03-08 11:17:24,082 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-03-08 11:17:24,083 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 715 states. [2025-03-08 11:17:24,106 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 715 to 715. [2025-03-08 11:17:24,108 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-03-08 11:17:24,110 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 715 states to 715 states and 1190 transitions. [2025-03-08 11:17:24,111 INFO L78 Accepts]: Start accepts. Automaton has 715 states and 1190 transitions. Word has length 643 [2025-03-08 11:17:24,112 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-08 11:17:24,112 INFO L471 AbstractCegarLoop]: Abstraction has 715 states and 1190 transitions. [2025-03-08 11:17:24,112 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-03-08 11:17:24,113 INFO L276 IsEmpty]: Start isEmpty. Operand 715 states and 1190 transitions. [2025-03-08 11:17:24,116 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 645 [2025-03-08 11:17:24,116 INFO L210 NwaCegarLoop]: Found error trace [2025-03-08 11:17:24,116 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-03-08 11:17:24,116 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable4 [2025-03-08 11:17:24,117 INFO L396 AbstractCegarLoop]: === Iteration 6 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-03-08 11:17:24,117 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-08 11:17:24,117 INFO L85 PathProgramCache]: Analyzing trace with hash -998938122, now seen corresponding path program 1 times [2025-03-08 11:17:24,117 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-08 11:17:24,117 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [804899236] [2025-03-08 11:17:24,117 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-08 11:17:24,118 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-08 11:17:24,148 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 644 statements into 1 equivalence classes. [2025-03-08 11:17:24,176 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 644 of 644 statements. [2025-03-08 11:17:24,177 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-08 11:17:24,177 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-08 11:17:24,471 INFO L134 CoverageAnalysis]: Checked inductivity of 19404 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 19404 trivial. 0 not checked. [2025-03-08 11:17:24,471 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-08 11:17:24,472 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [804899236] [2025-03-08 11:17:24,472 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [804899236] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-08 11:17:24,472 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-08 11:17:24,472 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2025-03-08 11:17:24,472 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1170427862] [2025-03-08 11:17:24,472 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-08 11:17:24,473 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2025-03-08 11:17:24,473 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-08 11:17:24,474 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2025-03-08 11:17:24,474 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2025-03-08 11:17:24,474 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-03-08 11:17:24,582 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-08 11:17:24,583 INFO L93 Difference]: Finished difference Result 1432 states and 2380 transitions. [2025-03-08 11:17:24,583 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2025-03-08 11:17:24,584 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-03-08 11:17:24,585 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-08 11:17:24,588 INFO L225 Difference]: With dead ends: 1432 [2025-03-08 11:17:24,589 INFO L226 Difference]: Without dead ends: 720 [2025-03-08 11:17:24,590 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-03-08 11:17:24,591 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-03-08 11:17:24,591 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-03-08 11:17:24,592 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 720 states. [2025-03-08 11:17:24,606 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 720 to 543. [2025-03-08 11:17:24,607 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-03-08 11:17:24,609 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 543 states to 543 states and 905 transitions. [2025-03-08 11:17:24,610 INFO L78 Accepts]: Start accepts. Automaton has 543 states and 905 transitions. Word has length 644 [2025-03-08 11:17:24,611 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-08 11:17:24,611 INFO L471 AbstractCegarLoop]: Abstraction has 543 states and 905 transitions. [2025-03-08 11:17:24,611 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-03-08 11:17:24,611 INFO L276 IsEmpty]: Start isEmpty. Operand 543 states and 905 transitions. [2025-03-08 11:17:24,615 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 646 [2025-03-08 11:17:24,615 INFO L210 NwaCegarLoop]: Found error trace [2025-03-08 11:17:24,615 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-03-08 11:17:24,615 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable5 [2025-03-08 11:17:24,616 INFO L396 AbstractCegarLoop]: === Iteration 7 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-03-08 11:17:24,616 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-08 11:17:24,616 INFO L85 PathProgramCache]: Analyzing trace with hash -939441634, now seen corresponding path program 1 times [2025-03-08 11:17:24,616 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-08 11:17:24,616 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [638574432] [2025-03-08 11:17:24,616 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-08 11:17:24,616 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-08 11:17:24,647 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 645 statements into 1 equivalence classes. [2025-03-08 11:17:24,694 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 645 of 645 statements. [2025-03-08 11:17:24,695 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-08 11:17:24,695 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-08 11:17:24,945 INFO L134 CoverageAnalysis]: Checked inductivity of 19404 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 19404 trivial. 0 not checked. [2025-03-08 11:17:24,945 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-08 11:17:24,945 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [638574432] [2025-03-08 11:17:24,945 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [638574432] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-08 11:17:24,945 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-08 11:17:24,946 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2025-03-08 11:17:24,946 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2008884527] [2025-03-08 11:17:24,946 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-08 11:17:24,946 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2025-03-08 11:17:24,946 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-08 11:17:24,947 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2025-03-08 11:17:24,947 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=8, Invalid=12, Unknown=0, NotChecked=0, Total=20 [2025-03-08 11:17:24,947 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-03-08 11:17:25,240 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-08 11:17:25,241 INFO L93 Difference]: Finished difference Result 1777 states and 2970 transitions. [2025-03-08 11:17:25,241 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2025-03-08 11:17:25,241 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-03-08 11:17:25,242 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-08 11:17:25,247 INFO L225 Difference]: With dead ends: 1777 [2025-03-08 11:17:25,247 INFO L226 Difference]: Without dead ends: 1237 [2025-03-08 11:17:25,249 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-03-08 11:17:25,249 INFO L435 NwaCegarLoop]: 645 mSDtfsCounter, 1012 mSDsluCounter, 1009 mSDsCounter, 0 mSdLazyCounter, 212 mSolverCounterSat, 32 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.2s 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.2s IncrementalHoareTripleChecker+Time [2025-03-08 11:17:25,250 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.2s Time] [2025-03-08 11:17:25,251 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1237 states. [2025-03-08 11:17:25,272 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1237 to 1150. [2025-03-08 11:17:25,274 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-03-08 11:17:25,277 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1150 states to 1150 states and 1939 transitions. [2025-03-08 11:17:25,278 INFO L78 Accepts]: Start accepts. Automaton has 1150 states and 1939 transitions. Word has length 645 [2025-03-08 11:17:25,279 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-08 11:17:25,279 INFO L471 AbstractCegarLoop]: Abstraction has 1150 states and 1939 transitions. [2025-03-08 11:17:25,279 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-03-08 11:17:25,279 INFO L276 IsEmpty]: Start isEmpty. Operand 1150 states and 1939 transitions. [2025-03-08 11:17:25,284 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 646 [2025-03-08 11:17:25,284 INFO L210 NwaCegarLoop]: Found error trace [2025-03-08 11:17:25,284 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-03-08 11:17:25,284 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable6 [2025-03-08 11:17:25,284 INFO L396 AbstractCegarLoop]: === Iteration 8 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-03-08 11:17:25,285 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-08 11:17:25,285 INFO L85 PathProgramCache]: Analyzing trace with hash -1569900259, now seen corresponding path program 1 times [2025-03-08 11:17:25,285 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-08 11:17:25,285 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1895619989] [2025-03-08 11:17:25,285 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-08 11:17:25,285 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-08 11:17:25,318 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 645 statements into 1 equivalence classes. [2025-03-08 11:17:25,360 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 645 of 645 statements. [2025-03-08 11:17:25,360 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-08 11:17:25,360 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-08 11:17:25,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-03-08 11:17:25,847 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-08 11:17:25,847 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1895619989] [2025-03-08 11:17:25,847 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1895619989] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-08 11:17:25,847 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-08 11:17:25,847 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2025-03-08 11:17:25,847 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2052471564] [2025-03-08 11:17:25,847 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-08 11:17:25,848 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2025-03-08 11:17:25,848 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-08 11:17:25,848 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2025-03-08 11:17:25,848 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2025-03-08 11:17:25,849 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-03-08 11:17:26,006 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-08 11:17:26,006 INFO L93 Difference]: Finished difference Result 3456 states and 5835 transitions. [2025-03-08 11:17:26,009 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2025-03-08 11:17:26,010 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-03-08 11:17:26,010 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-08 11:17:26,019 INFO L225 Difference]: With dead ends: 3456 [2025-03-08 11:17:26,020 INFO L226 Difference]: Without dead ends: 2309 [2025-03-08 11:17:26,023 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-03-08 11:17:26,023 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-03-08 11:17:26,023 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-03-08 11:17:26,025 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 2309 states. [2025-03-08 11:17:26,077 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 2309 to 2307. [2025-03-08 11:17:26,081 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-03-08 11:17:26,089 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 2307 states to 2307 states and 3882 transitions. [2025-03-08 11:17:26,090 INFO L78 Accepts]: Start accepts. Automaton has 2307 states and 3882 transitions. Word has length 645 [2025-03-08 11:17:26,091 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-08 11:17:26,091 INFO L471 AbstractCegarLoop]: Abstraction has 2307 states and 3882 transitions. [2025-03-08 11:17:26,092 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-03-08 11:17:26,092 INFO L276 IsEmpty]: Start isEmpty. Operand 2307 states and 3882 transitions. [2025-03-08 11:17:26,097 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 647 [2025-03-08 11:17:26,097 INFO L210 NwaCegarLoop]: Found error trace [2025-03-08 11:17:26,098 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-03-08 11:17:26,098 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable7 [2025-03-08 11:17:26,098 INFO L396 AbstractCegarLoop]: === Iteration 9 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-03-08 11:17:26,098 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-08 11:17:26,098 INFO L85 PathProgramCache]: Analyzing trace with hash 655955434, now seen corresponding path program 1 times [2025-03-08 11:17:26,099 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-08 11:17:26,099 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1666961295] [2025-03-08 11:17:26,099 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-08 11:17:26,099 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-08 11:17:26,129 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 646 statements into 1 equivalence classes. [2025-03-08 11:17:26,186 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 646 of 646 statements. [2025-03-08 11:17:26,186 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-08 11:17:26,186 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-08 11:17:26,600 INFO L134 CoverageAnalysis]: Checked inductivity of 19404 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 19404 trivial. 0 not checked. [2025-03-08 11:17:26,601 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-08 11:17:26,601 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1666961295] [2025-03-08 11:17:26,601 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1666961295] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-08 11:17:26,601 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-08 11:17:26,601 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2025-03-08 11:17:26,601 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1022130440] [2025-03-08 11:17:26,602 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-08 11:17:26,602 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2025-03-08 11:17:26,603 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-08 11:17:26,603 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2025-03-08 11:17:26,604 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=6, Invalid=6, Unknown=0, NotChecked=0, Total=12 [2025-03-08 11:17:26,604 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-03-08 11:17:26,704 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-08 11:17:26,704 INFO L93 Difference]: Finished difference Result 4611 states and 7761 transitions. [2025-03-08 11:17:26,705 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2025-03-08 11:17:26,705 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-03-08 11:17:26,706 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-08 11:17:26,715 INFO L225 Difference]: With dead ends: 4611 [2025-03-08 11:17:26,716 INFO L226 Difference]: Without dead ends: 2307 [2025-03-08 11:17:26,720 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-03-08 11:17:26,721 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-03-08 11:17:26,721 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-03-08 11:17:26,723 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 2307 states. [2025-03-08 11:17:26,785 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 2307 to 2307. [2025-03-08 11:17:26,789 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-03-08 11:17:26,796 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 2307 states to 2307 states and 3858 transitions. [2025-03-08 11:17:26,798 INFO L78 Accepts]: Start accepts. Automaton has 2307 states and 3858 transitions. Word has length 646 [2025-03-08 11:17:26,799 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-08 11:17:26,799 INFO L471 AbstractCegarLoop]: Abstraction has 2307 states and 3858 transitions. [2025-03-08 11:17:26,799 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-03-08 11:17:26,799 INFO L276 IsEmpty]: Start isEmpty. Operand 2307 states and 3858 transitions. [2025-03-08 11:17:26,804 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 648 [2025-03-08 11:17:26,804 INFO L210 NwaCegarLoop]: Found error trace [2025-03-08 11:17:26,805 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-03-08 11:17:26,805 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable8 [2025-03-08 11:17:26,805 INFO L396 AbstractCegarLoop]: === Iteration 10 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-03-08 11:17:26,805 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-08 11:17:26,806 INFO L85 PathProgramCache]: Analyzing trace with hash 1480112132, now seen corresponding path program 1 times [2025-03-08 11:17:26,806 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-08 11:17:26,806 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1793234418] [2025-03-08 11:17:26,806 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-08 11:17:26,806 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-08 11:17:26,837 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 647 statements into 1 equivalence classes. [2025-03-08 11:17:26,864 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 647 of 647 statements. [2025-03-08 11:17:26,865 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-08 11:17:26,865 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-08 11:17:27,162 INFO L134 CoverageAnalysis]: Checked inductivity of 19404 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 19404 trivial. 0 not checked. [2025-03-08 11:17:27,163 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-08 11:17:27,163 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1793234418] [2025-03-08 11:17:27,163 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1793234418] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-08 11:17:27,163 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-08 11:17:27,163 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2025-03-08 11:17:27,163 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [453785196] [2025-03-08 11:17:27,163 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-08 11:17:27,163 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2025-03-08 11:17:27,163 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-08 11:17:27,164 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2025-03-08 11:17:27,164 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-03-08 11:17:27,164 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-03-08 11:17:27,250 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-08 11:17:27,251 INFO L93 Difference]: Finished difference Result 4611 states and 7713 transitions. [2025-03-08 11:17:27,251 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2025-03-08 11:17:27,251 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-03-08 11:17:27,252 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-08 11:17:27,262 INFO L225 Difference]: With dead ends: 4611 [2025-03-08 11:17:27,262 INFO L226 Difference]: Without dead ends: 2307 [2025-03-08 11:17:27,267 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-03-08 11:17:27,268 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-03-08 11:17:27,268 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-03-08 11:17:27,270 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 2307 states. [2025-03-08 11:17:27,337 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 2307 to 2307. [2025-03-08 11:17:27,341 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-03-08 11:17:27,347 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 2307 states to 2307 states and 3818 transitions. [2025-03-08 11:17:27,349 INFO L78 Accepts]: Start accepts. Automaton has 2307 states and 3818 transitions. Word has length 647 [2025-03-08 11:17:27,350 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-08 11:17:27,350 INFO L471 AbstractCegarLoop]: Abstraction has 2307 states and 3818 transitions. [2025-03-08 11:17:27,350 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-03-08 11:17:27,351 INFO L276 IsEmpty]: Start isEmpty. Operand 2307 states and 3818 transitions. [2025-03-08 11:17:27,356 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 649 [2025-03-08 11:17:27,356 INFO L210 NwaCegarLoop]: Found error trace [2025-03-08 11:17:27,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] [2025-03-08 11:17:27,356 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable9 [2025-03-08 11:17:27,357 INFO L396 AbstractCegarLoop]: === Iteration 11 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-03-08 11:17:27,357 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-08 11:17:27,357 INFO L85 PathProgramCache]: Analyzing trace with hash -1443808417, now seen corresponding path program 1 times [2025-03-08 11:17:27,357 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-08 11:17:27,357 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1863080132] [2025-03-08 11:17:27,357 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-08 11:17:27,358 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-08 11:17:27,387 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 648 statements into 1 equivalence classes. [2025-03-08 11:17:27,451 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 648 of 648 statements. [2025-03-08 11:17:27,451 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-08 11:17:27,451 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-08 11:17:28,267 INFO L134 CoverageAnalysis]: Checked inductivity of 19404 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 19404 trivial. 0 not checked. [2025-03-08 11:17:28,267 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-08 11:17:28,267 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1863080132] [2025-03-08 11:17:28,267 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1863080132] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-08 11:17:28,267 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-08 11:17:28,268 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2025-03-08 11:17:28,268 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1044048773] [2025-03-08 11:17:28,268 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-08 11:17:28,268 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2025-03-08 11:17:28,270 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-08 11:17:28,270 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2025-03-08 11:17:28,271 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=11, Invalid=19, Unknown=0, NotChecked=0, Total=30 [2025-03-08 11:17:28,271 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-03-08 11:17:29,042 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-08 11:17:29,042 INFO L93 Difference]: Finished difference Result 4645 states and 7680 transitions. [2025-03-08 11:17:29,043 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2025-03-08 11:17:29,043 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-03-08 11:17:29,044 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-08 11:17:29,055 INFO L225 Difference]: With dead ends: 4645 [2025-03-08 11:17:29,055 INFO L226 Difference]: Without dead ends: 2341 [2025-03-08 11:17:29,060 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-03-08 11:17:29,061 INFO L435 NwaCegarLoop]: 571 mSDtfsCounter, 1235 mSDsluCounter, 568 mSDsCounter, 0 mSdLazyCounter, 580 mSolverCounterSat, 95 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.5s 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.6s IncrementalHoareTripleChecker+Time [2025-03-08 11:17:29,061 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.6s Time] [2025-03-08 11:17:29,064 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 2341 states. [2025-03-08 11:17:29,152 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 2341 to 1837. [2025-03-08 11:17:29,159 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-03-08 11:17:29,166 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1837 states to 1837 states and 3026 transitions. [2025-03-08 11:17:29,169 INFO L78 Accepts]: Start accepts. Automaton has 1837 states and 3026 transitions. Word has length 648 [2025-03-08 11:17:29,169 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-08 11:17:29,170 INFO L471 AbstractCegarLoop]: Abstraction has 1837 states and 3026 transitions. [2025-03-08 11:17:29,174 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-03-08 11:17:29,174 INFO L276 IsEmpty]: Start isEmpty. Operand 1837 states and 3026 transitions. [2025-03-08 11:17:29,180 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 650 [2025-03-08 11:17:29,180 INFO L210 NwaCegarLoop]: Found error trace [2025-03-08 11:17:29,181 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-03-08 11:17:29,181 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable10 [2025-03-08 11:17:29,181 INFO L396 AbstractCegarLoop]: === Iteration 12 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-03-08 11:17:29,181 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-08 11:17:29,181 INFO L85 PathProgramCache]: Analyzing trace with hash -1722556977, now seen corresponding path program 1 times [2025-03-08 11:17:29,182 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-08 11:17:29,182 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [533124583] [2025-03-08 11:17:29,182 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-08 11:17:29,183 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-08 11:17:29,214 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 649 statements into 1 equivalence classes. [2025-03-08 11:17:29,246 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 649 of 649 statements. [2025-03-08 11:17:29,247 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-08 11:17:29,247 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-08 11:17:29,497 INFO L134 CoverageAnalysis]: Checked inductivity of 19404 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 19404 trivial. 0 not checked. [2025-03-08 11:17:29,497 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-08 11:17:29,497 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [533124583] [2025-03-08 11:17:29,497 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [533124583] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-08 11:17:29,497 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-08 11:17:29,497 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2025-03-08 11:17:29,498 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [603326516] [2025-03-08 11:17:29,498 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-08 11:17:29,498 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2025-03-08 11:17:29,498 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-08 11:17:29,499 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2025-03-08 11:17:29,499 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-03-08 11:17:29,499 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-03-08 11:17:29,654 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-08 11:17:29,654 INFO L93 Difference]: Finished difference Result 5409 states and 8904 transitions. [2025-03-08 11:17:29,655 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2025-03-08 11:17:29,655 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-03-08 11:17:29,656 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-08 11:17:29,670 INFO L225 Difference]: With dead ends: 5409 [2025-03-08 11:17:29,670 INFO L226 Difference]: Without dead ends: 3575 [2025-03-08 11:17:29,676 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-03-08 11:17:29,676 INFO L435 NwaCegarLoop]: 907 mSDtfsCounter, 478 mSDsluCounter, 519 mSDsCounter, 0 mSdLazyCounter, 58 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s 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-03-08 11:17:29,676 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-03-08 11:17:29,679 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 3575 states. [2025-03-08 11:17:29,776 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 3575 to 2307. [2025-03-08 11:17:29,779 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-03-08 11:17:29,785 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 2307 states to 2307 states and 3816 transitions. [2025-03-08 11:17:29,788 INFO L78 Accepts]: Start accepts. Automaton has 2307 states and 3816 transitions. Word has length 649 [2025-03-08 11:17:29,788 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-08 11:17:29,788 INFO L471 AbstractCegarLoop]: Abstraction has 2307 states and 3816 transitions. [2025-03-08 11:17:29,789 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-03-08 11:17:29,789 INFO L276 IsEmpty]: Start isEmpty. Operand 2307 states and 3816 transitions. [2025-03-08 11:17:29,794 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 650 [2025-03-08 11:17:29,794 INFO L210 NwaCegarLoop]: Found error trace [2025-03-08 11:17:29,794 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-03-08 11:17:29,794 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable11 [2025-03-08 11:17:29,794 INFO L396 AbstractCegarLoop]: === Iteration 13 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-03-08 11:17:29,795 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-08 11:17:29,795 INFO L85 PathProgramCache]: Analyzing trace with hash -1823468944, now seen corresponding path program 1 times [2025-03-08 11:17:29,795 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-08 11:17:29,795 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1503035445] [2025-03-08 11:17:29,795 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-08 11:17:29,795 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-08 11:17:29,824 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 649 statements into 1 equivalence classes. [2025-03-08 11:17:29,889 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 649 of 649 statements. [2025-03-08 11:17:29,890 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-08 11:17:29,890 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-08 11:17:31,204 INFO L134 CoverageAnalysis]: Checked inductivity of 19404 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 19404 trivial. 0 not checked. [2025-03-08 11:17:31,204 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-08 11:17:31,204 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1503035445] [2025-03-08 11:17:31,204 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1503035445] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-08 11:17:31,204 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-08 11:17:31,204 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2025-03-08 11:17:31,205 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1127794174] [2025-03-08 11:17:31,205 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-08 11:17:31,205 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2025-03-08 11:17:31,205 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-08 11:17:31,206 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2025-03-08 11:17:31,206 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=8, Invalid=12, Unknown=0, NotChecked=0, Total=20 [2025-03-08 11:17:31,206 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-03-08 11:17:31,971 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-08 11:17:31,972 INFO L93 Difference]: Finished difference Result 4983 states and 8234 transitions. [2025-03-08 11:17:31,972 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2025-03-08 11:17:31,972 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-03-08 11:17:31,973 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-08 11:17:31,983 INFO L225 Difference]: With dead ends: 4983 [2025-03-08 11:17:31,984 INFO L226 Difference]: Without dead ends: 2679 [2025-03-08 11:17:31,988 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-03-08 11:17:31,988 INFO L435 NwaCegarLoop]: 838 mSDtfsCounter, 992 mSDsluCounter, 141 mSDsCounter, 0 mSdLazyCounter, 285 mSolverCounterSat, 401 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.5s 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.6s IncrementalHoareTripleChecker+Time [2025-03-08 11:17:31,988 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.6s Time] [2025-03-08 11:17:31,990 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 2679 states. [2025-03-08 11:17:32,070 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 2679 to 1890. [2025-03-08 11:17:32,072 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-03-08 11:17:32,077 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1890 states to 1890 states and 3102 transitions. [2025-03-08 11:17:32,079 INFO L78 Accepts]: Start accepts. Automaton has 1890 states and 3102 transitions. Word has length 649 [2025-03-08 11:17:32,080 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-08 11:17:32,080 INFO L471 AbstractCegarLoop]: Abstraction has 1890 states and 3102 transitions. [2025-03-08 11:17:32,080 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-03-08 11:17:32,081 INFO L276 IsEmpty]: Start isEmpty. Operand 1890 states and 3102 transitions. [2025-03-08 11:17:32,085 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 650 [2025-03-08 11:17:32,085 INFO L210 NwaCegarLoop]: Found error trace [2025-03-08 11:17:32,085 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-03-08 11:17:32,085 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable12 [2025-03-08 11:17:32,085 INFO L396 AbstractCegarLoop]: === Iteration 14 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-03-08 11:17:32,086 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-08 11:17:32,086 INFO L85 PathProgramCache]: Analyzing trace with hash -919555450, now seen corresponding path program 1 times [2025-03-08 11:17:32,086 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-08 11:17:32,086 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [976238124] [2025-03-08 11:17:32,086 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-08 11:17:32,086 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-08 11:17:32,128 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 649 statements into 1 equivalence classes. [2025-03-08 11:17:32,372 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 649 of 649 statements. [2025-03-08 11:17:32,372 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-08 11:17:32,372 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-08 11:17:32,819 INFO L134 CoverageAnalysis]: Checked inductivity of 19404 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 19404 trivial. 0 not checked. [2025-03-08 11:17:32,820 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-08 11:17:32,820 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [976238124] [2025-03-08 11:17:32,821 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [976238124] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-08 11:17:32,821 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-08 11:17:32,821 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2025-03-08 11:17:32,821 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [465854276] [2025-03-08 11:17:32,821 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-08 11:17:32,822 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2025-03-08 11:17:32,822 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-08 11:17:32,823 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2025-03-08 11:17:32,823 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=6, Invalid=6, Unknown=0, NotChecked=0, Total=12 [2025-03-08 11:17:32,823 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-03-08 11:17:33,145 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-08 11:17:33,146 INFO L93 Difference]: Finished difference Result 5558 states and 9144 transitions. [2025-03-08 11:17:33,146 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2025-03-08 11:17:33,146 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-03-08 11:17:33,147 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-08 11:17:33,162 INFO L225 Difference]: With dead ends: 5558 [2025-03-08 11:17:33,163 INFO L226 Difference]: Without dead ends: 3724 [2025-03-08 11:17:33,168 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-03-08 11:17:33,169 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-03-08 11:17:33,169 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-03-08 11:17:33,172 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 3724 states. [2025-03-08 11:17:33,315 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 3724 to 3722. [2025-03-08 11:17:33,319 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-03-08 11:17:33,330 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3722 states to 3722 states and 6114 transitions. [2025-03-08 11:17:33,333 INFO L78 Accepts]: Start accepts. Automaton has 3722 states and 6114 transitions. Word has length 649 [2025-03-08 11:17:33,334 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-08 11:17:33,335 INFO L471 AbstractCegarLoop]: Abstraction has 3722 states and 6114 transitions. [2025-03-08 11:17:33,335 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-03-08 11:17:33,335 INFO L276 IsEmpty]: Start isEmpty. Operand 3722 states and 6114 transitions. [2025-03-08 11:17:33,341 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 651 [2025-03-08 11:17:33,341 INFO L210 NwaCegarLoop]: Found error trace [2025-03-08 11:17:33,341 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-03-08 11:17:33,341 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable13 [2025-03-08 11:17:33,342 INFO L396 AbstractCegarLoop]: === Iteration 15 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-03-08 11:17:33,342 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-08 11:17:33,342 INFO L85 PathProgramCache]: Analyzing trace with hash -820930091, now seen corresponding path program 1 times [2025-03-08 11:17:33,342 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-08 11:17:33,342 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1406201279] [2025-03-08 11:17:33,343 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-08 11:17:33,343 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-08 11:17:33,371 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 650 statements into 1 equivalence classes. [2025-03-08 11:17:33,538 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 650 of 650 statements. [2025-03-08 11:17:33,541 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-08 11:17:33,542 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-08 11:17:34,350 INFO L134 CoverageAnalysis]: Checked inductivity of 19404 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 19404 trivial. 0 not checked. [2025-03-08 11:17:34,351 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-08 11:17:34,351 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1406201279] [2025-03-08 11:17:34,351 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1406201279] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-08 11:17:34,351 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-08 11:17:34,351 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [8] imperfect sequences [] total 8 [2025-03-08 11:17:34,351 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1158004400] [2025-03-08 11:17:34,351 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-08 11:17:34,352 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 8 states [2025-03-08 11:17:34,352 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-08 11:17:34,352 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2025-03-08 11:17:34,353 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=17, Invalid=39, Unknown=0, NotChecked=0, Total=56 [2025-03-08 11:17:34,353 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-03-08 11:17:36,013 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-08 11:17:36,015 INFO L93 Difference]: Finished difference Result 17844 states and 29303 transitions. [2025-03-08 11:17:36,015 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2025-03-08 11:17:36,015 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-03-08 11:17:36,016 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-08 11:17:36,058 INFO L225 Difference]: With dead ends: 17844 [2025-03-08 11:17:36,059 INFO L226 Difference]: Without dead ends: 14178 [2025-03-08 11:17:36,069 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 20 GetRequests, 10 SyntacticMatches, 0 SemanticMatches, 10 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 4 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=49, Invalid=83, Unknown=0, NotChecked=0, Total=132 [2025-03-08 11:17:36,070 INFO L435 NwaCegarLoop]: 776 mSDtfsCounter, 1374 mSDsluCounter, 2893 mSDsCounter, 0 mSdLazyCounter, 1014 mSolverCounterSat, 271 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.9s 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.1s IncrementalHoareTripleChecker+Time [2025-03-08 11:17:36,070 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.1s Time] [2025-03-08 11:17:36,081 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 14178 states. [2025-03-08 11:17:36,414 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 14178 to 8194. [2025-03-08 11:17:36,427 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-03-08 11:17:36,443 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 8194 states to 8194 states and 13390 transitions. [2025-03-08 11:17:36,448 INFO L78 Accepts]: Start accepts. Automaton has 8194 states and 13390 transitions. Word has length 650 [2025-03-08 11:17:36,449 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-08 11:17:36,449 INFO L471 AbstractCegarLoop]: Abstraction has 8194 states and 13390 transitions. [2025-03-08 11:17:36,450 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-03-08 11:17:36,450 INFO L276 IsEmpty]: Start isEmpty. Operand 8194 states and 13390 transitions. [2025-03-08 11:17:36,460 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 651 [2025-03-08 11:17:36,460 INFO L210 NwaCegarLoop]: Found error trace [2025-03-08 11:17:36,461 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-03-08 11:17:36,461 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable14 [2025-03-08 11:17:36,461 INFO L396 AbstractCegarLoop]: === Iteration 16 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-03-08 11:17:36,461 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-08 11:17:36,462 INFO L85 PathProgramCache]: Analyzing trace with hash 345766228, now seen corresponding path program 1 times [2025-03-08 11:17:36,462 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-08 11:17:36,462 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [45847872] [2025-03-08 11:17:36,462 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-08 11:17:36,462 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-08 11:17:36,493 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 650 statements into 1 equivalence classes. [2025-03-08 11:17:36,608 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 650 of 650 statements. [2025-03-08 11:17:36,609 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-08 11:17:36,609 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-08 11:17:37,191 INFO L134 CoverageAnalysis]: Checked inductivity of 19404 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 19404 trivial. 0 not checked. [2025-03-08 11:17:37,191 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-08 11:17:37,191 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [45847872] [2025-03-08 11:17:37,191 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [45847872] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-08 11:17:37,191 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-08 11:17:37,191 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2025-03-08 11:17:37,191 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [539048694] [2025-03-08 11:17:37,192 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-08 11:17:37,192 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2025-03-08 11:17:37,192 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-08 11:17:37,193 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2025-03-08 11:17:37,193 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=11, Invalid=19, Unknown=0, NotChecked=0, Total=30 [2025-03-08 11:17:37,193 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-03-08 11:17:38,630 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-08 11:17:38,630 INFO L93 Difference]: Finished difference Result 27062 states and 44220 transitions. [2025-03-08 11:17:38,631 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2025-03-08 11:17:38,631 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-03-08 11:17:38,632 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-08 11:17:38,685 INFO L225 Difference]: With dead ends: 27062 [2025-03-08 11:17:38,685 INFO L226 Difference]: Without dead ends: 22992 [2025-03-08 11:17:38,700 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-03-08 11:17:38,702 INFO L435 NwaCegarLoop]: 676 mSDtfsCounter, 955 mSDsluCounter, 2443 mSDsCounter, 0 mSdLazyCounter, 716 mSolverCounterSat, 138 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.8s 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.0s IncrementalHoareTripleChecker+Time [2025-03-08 11:17:38,702 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.0s Time] [2025-03-08 11:17:38,722 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 22992 states. [2025-03-08 11:17:39,494 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 22992 to 22965. [2025-03-08 11:17:39,521 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-03-08 11:17:39,575 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 22965 states to 22965 states and 37485 transitions. [2025-03-08 11:17:39,582 INFO L78 Accepts]: Start accepts. Automaton has 22965 states and 37485 transitions. Word has length 650 [2025-03-08 11:17:39,583 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-08 11:17:39,583 INFO L471 AbstractCegarLoop]: Abstraction has 22965 states and 37485 transitions. [2025-03-08 11:17:39,583 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-03-08 11:17:39,583 INFO L276 IsEmpty]: Start isEmpty. Operand 22965 states and 37485 transitions. [2025-03-08 11:17:39,608 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 651 [2025-03-08 11:17:39,609 INFO L210 NwaCegarLoop]: Found error trace [2025-03-08 11:17:39,609 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-03-08 11:17:39,609 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable15 [2025-03-08 11:17:39,609 INFO L396 AbstractCegarLoop]: === Iteration 17 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-03-08 11:17:39,610 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-08 11:17:39,610 INFO L85 PathProgramCache]: Analyzing trace with hash -1718863197, now seen corresponding path program 1 times [2025-03-08 11:17:39,610 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-08 11:17:39,610 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [332626846] [2025-03-08 11:17:39,610 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-08 11:17:39,610 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-08 11:17:39,649 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 650 statements into 1 equivalence classes. [2025-03-08 11:17:39,926 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 650 of 650 statements. [2025-03-08 11:17:39,926 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-08 11:17:39,926 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-08 11:17:40,341 INFO L134 CoverageAnalysis]: Checked inductivity of 19404 backedges. 189 proven. 105 refuted. 0 times theorem prover too weak. 19110 trivial. 0 not checked. [2025-03-08 11:17:40,341 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-08 11:17:40,341 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [332626846] [2025-03-08 11:17:40,341 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [332626846] provided 0 perfect and 1 imperfect interpolant sequences [2025-03-08 11:17:40,341 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [10966252] [2025-03-08 11:17:40,342 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-08 11:17:40,342 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-03-08 11:17:40,342 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2025-03-08 11:17:40,344 INFO L229 MonitoredProcess]: Starting monitored process 3 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2025-03-08 11:17:40,345 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (3)] Waiting until timeout for monitored process [2025-03-08 11:17:40,529 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 650 statements into 1 equivalence classes. [2025-03-08 11:17:40,654 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 650 of 650 statements. [2025-03-08 11:17:40,655 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-08 11:17:40,655 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-08 11:17:40,660 INFO L256 TraceCheckSpWp]: Trace formula consists of 1468 conjuncts, 6 conjuncts are in the unsatisfiable core [2025-03-08 11:17:40,672 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-03-08 11:17:41,021 INFO L134 CoverageAnalysis]: Checked inductivity of 19404 backedges. 9044 proven. 105 refuted. 0 times theorem prover too weak. 10255 trivial. 0 not checked. [2025-03-08 11:17:41,021 INFO L312 TraceCheckSpWp]: Computing backward predicates... [2025-03-08 11:17:41,563 INFO L134 CoverageAnalysis]: Checked inductivity of 19404 backedges. 189 proven. 105 refuted. 0 times theorem prover too weak. 19110 trivial. 0 not checked. [2025-03-08 11:17:41,564 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [10966252] provided 0 perfect and 2 imperfect interpolant sequences [2025-03-08 11:17:41,564 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2025-03-08 11:17:41,564 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [5, 5, 5] total 7 [2025-03-08 11:17:41,564 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1909170167] [2025-03-08 11:17:41,564 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2025-03-08 11:17:41,565 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 7 states [2025-03-08 11:17:41,565 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-08 11:17:41,566 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2025-03-08 11:17:41,566 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=17, Invalid=25, Unknown=0, NotChecked=0, Total=42 [2025-03-08 11:17:41,566 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-03-08 11:17:42,458 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-08 11:17:42,458 INFO L93 Difference]: Finished difference Result 40175 states and 65590 transitions. [2025-03-08 11:17:42,458 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2025-03-08 11:17:42,459 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-03-08 11:17:42,459 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-08 11:17:42,503 INFO L225 Difference]: With dead ends: 40175 [2025-03-08 11:17:42,503 INFO L226 Difference]: Without dead ends: 17301 [2025-03-08 11:17:42,530 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 1307 GetRequests, 1297 SyntacticMatches, 1 SemanticMatches, 9 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 4 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=45, Invalid=65, Unknown=0, NotChecked=0, Total=110 [2025-03-08 11:17:42,531 INFO L435 NwaCegarLoop]: 418 mSDtfsCounter, 345 mSDsluCounter, 635 mSDsCounter, 0 mSdLazyCounter, 549 mSolverCounterSat, 28 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.3s 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.4s IncrementalHoareTripleChecker+Time [2025-03-08 11:17:42,531 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.4s Time] [2025-03-08 11:17:42,541 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 17301 states. [2025-03-08 11:17:43,382 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 17301 to 17117. [2025-03-08 11:17:43,400 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-03-08 11:17:43,427 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 17117 states to 17117 states and 27861 transitions. [2025-03-08 11:17:43,434 INFO L78 Accepts]: Start accepts. Automaton has 17117 states and 27861 transitions. Word has length 650 [2025-03-08 11:17:43,435 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-08 11:17:43,435 INFO L471 AbstractCegarLoop]: Abstraction has 17117 states and 27861 transitions. [2025-03-08 11:17:43,435 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-03-08 11:17:43,435 INFO L276 IsEmpty]: Start isEmpty. Operand 17117 states and 27861 transitions. [2025-03-08 11:17:43,449 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 651 [2025-03-08 11:17:43,449 INFO L210 NwaCegarLoop]: Found error trace [2025-03-08 11:17:43,450 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-03-08 11:17:43,459 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (3)] Forceful destruction successful, exit code 0 [2025-03-08 11:17:43,650 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 3 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable16 [2025-03-08 11:17:43,651 INFO L396 AbstractCegarLoop]: === Iteration 18 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-03-08 11:17:43,651 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-08 11:17:43,652 INFO L85 PathProgramCache]: Analyzing trace with hash 1733342418, now seen corresponding path program 1 times [2025-03-08 11:17:43,652 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-08 11:17:43,652 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [398719366] [2025-03-08 11:17:43,652 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-08 11:17:43,652 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-08 11:17:43,679 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 650 statements into 1 equivalence classes. [2025-03-08 11:17:43,700 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 650 of 650 statements. [2025-03-08 11:17:43,700 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-08 11:17:43,700 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-08 11:17:43,944 INFO L134 CoverageAnalysis]: Checked inductivity of 19404 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 19404 trivial. 0 not checked. [2025-03-08 11:17:43,944 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-08 11:17:43,944 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [398719366] [2025-03-08 11:17:43,944 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [398719366] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-08 11:17:43,944 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-08 11:17:43,944 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2025-03-08 11:17:43,944 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1852292856] [2025-03-08 11:17:43,944 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-08 11:17:43,945 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2025-03-08 11:17:43,945 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-08 11:17:43,946 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2025-03-08 11:17:43,946 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-03-08 11:17:43,946 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-03-08 11:17:44,676 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-08 11:17:44,677 INFO L93 Difference]: Finished difference Result 34161 states and 55623 transitions. [2025-03-08 11:17:44,677 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2025-03-08 11:17:44,678 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-03-08 11:17:44,678 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-08 11:17:44,732 INFO L225 Difference]: With dead ends: 34161 [2025-03-08 11:17:44,732 INFO L226 Difference]: Without dead ends: 17135 [2025-03-08 11:17:44,856 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-03-08 11:17:44,860 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-03-08 11:17:44,861 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-03-08 11:17:44,869 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 17135 states. [2025-03-08 11:17:45,747 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 17135 to 17117. [2025-03-08 11:17:45,765 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-03-08 11:17:45,803 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 17117 states to 17117 states and 27813 transitions. [2025-03-08 11:17:45,812 INFO L78 Accepts]: Start accepts. Automaton has 17117 states and 27813 transitions. Word has length 650 [2025-03-08 11:17:45,813 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-08 11:17:45,813 INFO L471 AbstractCegarLoop]: Abstraction has 17117 states and 27813 transitions. [2025-03-08 11:17:45,813 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-03-08 11:17:45,813 INFO L276 IsEmpty]: Start isEmpty. Operand 17117 states and 27813 transitions. [2025-03-08 11:17:45,827 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 652 [2025-03-08 11:17:45,827 INFO L210 NwaCegarLoop]: Found error trace [2025-03-08 11:17:45,828 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-03-08 11:17:45,828 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable17 [2025-03-08 11:17:45,828 INFO L396 AbstractCegarLoop]: === Iteration 19 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-03-08 11:17:45,829 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-08 11:17:45,829 INFO L85 PathProgramCache]: Analyzing trace with hash -421685755, now seen corresponding path program 1 times [2025-03-08 11:17:45,829 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-08 11:17:45,829 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1951906864] [2025-03-08 11:17:45,829 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-08 11:17:45,829 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-08 11:17:45,854 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 651 statements into 1 equivalence classes. [2025-03-08 11:17:45,877 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 651 of 651 statements. [2025-03-08 11:17:45,878 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-08 11:17:45,878 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-08 11:17:46,027 INFO L134 CoverageAnalysis]: Checked inductivity of 19404 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 19404 trivial. 0 not checked. [2025-03-08 11:17:46,028 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-08 11:17:46,028 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1951906864] [2025-03-08 11:17:46,028 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1951906864] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-08 11:17:46,028 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-08 11:17:46,028 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2025-03-08 11:17:46,028 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [7915817] [2025-03-08 11:17:46,028 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-08 11:17:46,029 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2025-03-08 11:17:46,029 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-08 11:17:46,029 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2025-03-08 11:17:46,029 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-03-08 11:17:46,029 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-03-08 11:17:46,564 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-08 11:17:46,565 INFO L93 Difference]: Finished difference Result 25671 states and 41758 transitions. [2025-03-08 11:17:46,565 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2025-03-08 11:17:46,566 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-03-08 11:17:46,566 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-08 11:17:46,612 INFO L225 Difference]: With dead ends: 25671 [2025-03-08 11:17:46,613 INFO L226 Difference]: Without dead ends: 17149 [2025-03-08 11:17:46,625 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-03-08 11:17:46,625 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-03-08 11:17:46,626 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-03-08 11:17:46,634 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 17149 states. [2025-03-08 11:17:47,340 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 17149 to 17149. [2025-03-08 11:17:47,352 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-03-08 11:17:47,375 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 17149 states to 17149 states and 27845 transitions. [2025-03-08 11:17:47,382 INFO L78 Accepts]: Start accepts. Automaton has 17149 states and 27845 transitions. Word has length 651 [2025-03-08 11:17:47,382 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-08 11:17:47,383 INFO L471 AbstractCegarLoop]: Abstraction has 17149 states and 27845 transitions. [2025-03-08 11:17:47,383 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-03-08 11:17:47,383 INFO L276 IsEmpty]: Start isEmpty. Operand 17149 states and 27845 transitions. [2025-03-08 11:17:47,393 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 652 [2025-03-08 11:17:47,393 INFO L210 NwaCegarLoop]: Found error trace [2025-03-08 11:17:47,394 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-03-08 11:17:47,394 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable18 [2025-03-08 11:17:47,394 INFO L396 AbstractCegarLoop]: === Iteration 20 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-03-08 11:17:47,395 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-08 11:17:47,395 INFO L85 PathProgramCache]: Analyzing trace with hash 987226069, now seen corresponding path program 1 times [2025-03-08 11:17:47,395 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-08 11:17:47,395 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1340129917] [2025-03-08 11:17:47,395 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-08 11:17:47,395 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-08 11:17:47,423 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 651 statements into 1 equivalence classes. [2025-03-08 11:17:47,441 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 651 of 651 statements. [2025-03-08 11:17:47,441 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-08 11:17:47,441 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-08 11:17:47,567 INFO L134 CoverageAnalysis]: Checked inductivity of 19404 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 19404 trivial. 0 not checked. [2025-03-08 11:17:47,567 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-08 11:17:47,567 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1340129917] [2025-03-08 11:17:47,567 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1340129917] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-08 11:17:47,567 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-08 11:17:47,567 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2025-03-08 11:17:47,568 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1164028900] [2025-03-08 11:17:47,568 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-08 11:17:47,570 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2025-03-08 11:17:47,570 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-08 11:17:47,571 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2025-03-08 11:17:47,571 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-03-08 11:17:47,571 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-03-08 11:17:48,760 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-08 11:17:48,760 INFO L93 Difference]: Finished difference Result 51265 states and 83271 transitions. [2025-03-08 11:17:48,761 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2025-03-08 11:17:48,761 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-03-08 11:17:48,762 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-08 11:17:48,843 INFO L225 Difference]: With dead ends: 51265 [2025-03-08 11:17:48,843 INFO L226 Difference]: Without dead ends: 34207 [2025-03-08 11:17:48,876 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-03-08 11:17:48,878 INFO L435 NwaCegarLoop]: 555 mSDtfsCounter, 314 mSDsluCounter, 510 mSDsCounter, 0 mSdLazyCounter, 57 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s 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.0s IncrementalHoareTripleChecker+Time [2025-03-08 11:17:48,879 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.0s Time] [2025-03-08 11:17:48,902 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 34207 states. [2025-03-08 11:17:50,093 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 34207 to 34205. [2025-03-08 11:17:50,118 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-03-08 11:17:50,169 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 34205 states to 34205 states and 55461 transitions. [2025-03-08 11:17:50,180 INFO L78 Accepts]: Start accepts. Automaton has 34205 states and 55461 transitions. Word has length 651 [2025-03-08 11:17:50,181 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-08 11:17:50,181 INFO L471 AbstractCegarLoop]: Abstraction has 34205 states and 55461 transitions. [2025-03-08 11:17:50,181 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-03-08 11:17:50,181 INFO L276 IsEmpty]: Start isEmpty. Operand 34205 states and 55461 transitions. [2025-03-08 11:17:50,198 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 653 [2025-03-08 11:17:50,198 INFO L210 NwaCegarLoop]: Found error trace [2025-03-08 11:17:50,198 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-03-08 11:17:50,198 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable19 [2025-03-08 11:17:50,199 INFO L396 AbstractCegarLoop]: === Iteration 21 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-03-08 11:17:50,199 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-08 11:17:50,199 INFO L85 PathProgramCache]: Analyzing trace with hash -591503947, now seen corresponding path program 1 times [2025-03-08 11:17:50,199 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-08 11:17:50,199 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [937779606] [2025-03-08 11:17:50,199 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-08 11:17:50,199 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-08 11:17:50,224 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 652 statements into 1 equivalence classes. [2025-03-08 11:17:50,243 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 652 of 652 statements. [2025-03-08 11:17:50,243 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-08 11:17:50,243 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-08 11:17:50,451 INFO L134 CoverageAnalysis]: Checked inductivity of 19404 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 19404 trivial. 0 not checked. [2025-03-08 11:17:50,452 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-08 11:17:50,452 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [937779606] [2025-03-08 11:17:50,452 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [937779606] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-08 11:17:50,452 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-08 11:17:50,452 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2025-03-08 11:17:50,452 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1606419728] [2025-03-08 11:17:50,452 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-08 11:17:50,452 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2025-03-08 11:17:50,452 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-08 11:17:50,453 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2025-03-08 11:17:50,453 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-03-08 11:17:50,453 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-03-08 11:17:51,629 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-08 11:17:51,629 INFO L93 Difference]: Finished difference Result 68337 states and 110823 transitions. [2025-03-08 11:17:51,630 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2025-03-08 11:17:51,630 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-03-08 11:17:51,631 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-08 11:17:51,715 INFO L225 Difference]: With dead ends: 68337 [2025-03-08 11:17:51,715 INFO L226 Difference]: Without dead ends: 34223 [2025-03-08 11:17:51,761 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-03-08 11:17:51,762 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-03-08 11:17:51,762 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-03-08 11:17:51,781 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 34223 states. [2025-03-08 11:17:53,437 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 34223 to 34205. [2025-03-08 11:17:53,465 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-03-08 11:17:53,519 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 34205 states to 34205 states and 55413 transitions. [2025-03-08 11:17:53,536 INFO L78 Accepts]: Start accepts. Automaton has 34205 states and 55413 transitions. Word has length 652 [2025-03-08 11:17:53,536 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-08 11:17:53,536 INFO L471 AbstractCegarLoop]: Abstraction has 34205 states and 55413 transitions. [2025-03-08 11:17:53,536 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-03-08 11:17:53,537 INFO L276 IsEmpty]: Start isEmpty. Operand 34205 states and 55413 transitions. [2025-03-08 11:17:53,552 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 654 [2025-03-08 11:17:53,552 INFO L210 NwaCegarLoop]: Found error trace [2025-03-08 11:17:53,553 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-03-08 11:17:53,553 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable20 [2025-03-08 11:17:53,553 INFO L396 AbstractCegarLoop]: === Iteration 22 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-03-08 11:17:53,553 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-08 11:17:53,554 INFO L85 PathProgramCache]: Analyzing trace with hash -1217857409, now seen corresponding path program 1 times [2025-03-08 11:17:53,554 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-08 11:17:53,554 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1123374187] [2025-03-08 11:17:53,554 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-08 11:17:53,554 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-08 11:17:53,578 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 653 statements into 1 equivalence classes. [2025-03-08 11:17:53,602 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 653 of 653 statements. [2025-03-08 11:17:53,602 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-08 11:17:53,603 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-08 11:17:54,310 INFO L134 CoverageAnalysis]: Checked inductivity of 19404 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 19404 trivial. 0 not checked. [2025-03-08 11:17:54,310 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-08 11:17:54,310 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1123374187] [2025-03-08 11:17:54,310 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1123374187] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-08 11:17:54,310 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-08 11:17:54,310 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2025-03-08 11:17:54,310 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [485230112] [2025-03-08 11:17:54,311 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-08 11:17:54,311 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 7 states [2025-03-08 11:17:54,311 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-08 11:17:54,313 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2025-03-08 11:17:54,313 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=14, Invalid=28, Unknown=0, NotChecked=0, Total=42 [2025-03-08 11:17:54,314 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-03-08 11:17:56,825 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-08 11:17:56,825 INFO L93 Difference]: Finished difference Result 85571 states and 138480 transitions. [2025-03-08 11:17:56,827 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2025-03-08 11:17:56,827 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-03-08 11:17:56,827 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-08 11:17:56,940 INFO L225 Difference]: With dead ends: 85571 [2025-03-08 11:17:56,940 INFO L226 Difference]: Without dead ends: 51457 [2025-03-08 11:17:56,996 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-03-08 11:17:56,999 INFO L435 NwaCegarLoop]: 932 mSDtfsCounter, 969 mSDsluCounter, 2856 mSDsCounter, 0 mSdLazyCounter, 1062 mSolverCounterSat, 1 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.7s 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, 0.9s IncrementalHoareTripleChecker+Time [2025-03-08 11:17:57,000 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [969 Valid, 3788 Invalid, 1063 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [1 Valid, 1062 Invalid, 0 Unknown, 0 Unchecked, 0.9s Time] [2025-03-08 11:17:57,029 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 51457 states. [2025-03-08 11:17:59,145 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 51457 to 48893. [2025-03-08 11:17:59,189 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-03-08 11:17:59,294 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 48893 states to 48893 states and 79109 transitions. [2025-03-08 11:17:59,313 INFO L78 Accepts]: Start accepts. Automaton has 48893 states and 79109 transitions. Word has length 653 [2025-03-08 11:17:59,314 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-08 11:17:59,314 INFO L471 AbstractCegarLoop]: Abstraction has 48893 states and 79109 transitions. [2025-03-08 11:17:59,314 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-03-08 11:17:59,314 INFO L276 IsEmpty]: Start isEmpty. Operand 48893 states and 79109 transitions. [2025-03-08 11:17:59,344 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 654 [2025-03-08 11:17:59,344 INFO L210 NwaCegarLoop]: Found error trace [2025-03-08 11:17:59,344 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-03-08 11:17:59,344 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable21 [2025-03-08 11:17:59,344 INFO L396 AbstractCegarLoop]: === Iteration 23 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-03-08 11:17:59,345 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-08 11:17:59,345 INFO L85 PathProgramCache]: Analyzing trace with hash -350805184, now seen corresponding path program 1 times [2025-03-08 11:17:59,345 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-08 11:17:59,345 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [879656207] [2025-03-08 11:17:59,345 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-08 11:17:59,345 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-08 11:17:59,376 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 653 statements into 1 equivalence classes. [2025-03-08 11:17:59,621 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 653 of 653 statements. [2025-03-08 11:17:59,622 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-08 11:17:59,622 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-08 11:17:59,955 INFO L134 CoverageAnalysis]: Checked inductivity of 19404 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 19404 trivial. 0 not checked. [2025-03-08 11:17:59,956 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-08 11:17:59,956 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [879656207] [2025-03-08 11:17:59,956 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [879656207] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-08 11:17:59,956 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-08 11:17:59,956 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2025-03-08 11:17:59,956 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [488512823] [2025-03-08 11:17:59,956 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-08 11:17:59,957 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2025-03-08 11:17:59,957 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-08 11:17:59,957 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2025-03-08 11:17:59,957 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=6, Invalid=6, Unknown=0, NotChecked=0, Total=12 [2025-03-08 11:17:59,958 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) [2025-03-08 11:18:03,121 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-08 11:18:03,121 INFO L93 Difference]: Finished difference Result 163059 states and 260856 transitions. [2025-03-08 11:18:03,122 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2025-03-08 11:18:03,122 INFO L78 Accepts]: Start accepts. Automaton has 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) Word has length 653 [2025-03-08 11:18:03,122 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-08 11:18:03,369 INFO L225 Difference]: With dead ends: 163059 [2025-03-08 11:18:03,369 INFO L226 Difference]: Without dead ends: 103241 [2025-03-08 11:18:03,453 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-03-08 11:18:03,455 INFO L435 NwaCegarLoop]: 679 mSDtfsCounter, 593 mSDsluCounter, 894 mSDsCounter, 0 mSdLazyCounter, 210 mSolverCounterSat, 4 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 593 SdHoareTripleChecker+Valid, 1573 SdHoareTripleChecker+Invalid, 214 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 4 IncrementalHoareTripleChecker+Valid, 210 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.2s IncrementalHoareTripleChecker+Time [2025-03-08 11:18:03,455 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [593 Valid, 1573 Invalid, 214 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [4 Valid, 210 Invalid, 0 Unknown, 0 Unchecked, 0.2s Time] [2025-03-08 11:18:03,516 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 103241 states. [2025-03-08 11:18:06,547 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 103241 to 58253. [2025-03-08 11:18:06,599 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 58253 states, 53491 states have (on average 1.576844702847208) internal successors, (84347), 53620 states have internal predecessors, (84347), 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-03-08 11:18:06,722 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 58253 states to 58253 states and 93365 transitions. [2025-03-08 11:18:06,763 INFO L78 Accepts]: Start accepts. Automaton has 58253 states and 93365 transitions. Word has length 653 [2025-03-08 11:18:06,764 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-08 11:18:06,764 INFO L471 AbstractCegarLoop]: Abstraction has 58253 states and 93365 transitions. [2025-03-08 11:18:06,764 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has 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) [2025-03-08 11:18:06,764 INFO L276 IsEmpty]: Start isEmpty. Operand 58253 states and 93365 transitions. [2025-03-08 11:18:06,805 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 654 [2025-03-08 11:18:06,805 INFO L210 NwaCegarLoop]: Found error trace [2025-03-08 11:18:06,805 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-03-08 11:18:06,806 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable22 [2025-03-08 11:18:06,806 INFO L396 AbstractCegarLoop]: === Iteration 24 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-03-08 11:18:06,806 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-08 11:18:06,806 INFO L85 PathProgramCache]: Analyzing trace with hash -824108798, now seen corresponding path program 1 times [2025-03-08 11:18:06,806 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-08 11:18:06,807 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1843601352] [2025-03-08 11:18:06,807 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-08 11:18:06,807 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-08 11:18:06,840 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 653 statements into 1 equivalence classes. [2025-03-08 11:18:06,863 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 653 of 653 statements. [2025-03-08 11:18:06,863 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-08 11:18:06,863 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-08 11:18:06,998 INFO L134 CoverageAnalysis]: Checked inductivity of 19404 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 19404 trivial. 0 not checked. [2025-03-08 11:18:06,999 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-08 11:18:06,999 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1843601352] [2025-03-08 11:18:06,999 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1843601352] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-08 11:18:06,999 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-08 11:18:06,999 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2025-03-08 11:18:06,999 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [147052710] [2025-03-08 11:18:06,999 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-08 11:18:07,000 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2025-03-08 11:18:07,000 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-08 11:18:07,001 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2025-03-08 11:18:07,001 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-03-08 11:18:07,001 INFO L87 Difference]: Start difference. First operand 58253 states and 93365 transitions. Second operand has 3 states, 3 states have (on average 53.666666666666664) internal successors, (161), 3 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-03-08 11:18:10,090 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-08 11:18:10,090 INFO L93 Difference]: Finished difference Result 158737 states and 254199 transitions. [2025-03-08 11:18:10,091 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2025-03-08 11:18:10,091 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 53.666666666666664) internal successors, (161), 3 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-03-08 11:18:10,091 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-08 11:18:10,467 INFO L225 Difference]: With dead ends: 158737 [2025-03-08 11:18:10,468 INFO L226 Difference]: Without dead ends: 100575 [2025-03-08 11:18:10,518 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-03-08 11:18:10,519 INFO L435 NwaCegarLoop]: 521 mSDtfsCounter, 476 mSDsluCounter, 510 mSDsCounter, 0 mSdLazyCounter, 41 mSolverCounterSat, 4 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 476 SdHoareTripleChecker+Valid, 1031 SdHoareTripleChecker+Invalid, 45 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 4 IncrementalHoareTripleChecker+Valid, 41 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2025-03-08 11:18:10,519 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [476 Valid, 1031 Invalid, 45 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [4 Valid, 41 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2025-03-08 11:18:10,562 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 100575 states. [2025-03-08 11:18:12,624 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 100575 to 74549. [2025-03-08 11:18:12,692 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 74549 states, 69787 states have (on average 1.5724848467479617) internal successors, (109739), 69916 states have internal predecessors, (109739), 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-03-08 11:18:12,800 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 74549 states to 74549 states and 118757 transitions. [2025-03-08 11:18:12,831 INFO L78 Accepts]: Start accepts. Automaton has 74549 states and 118757 transitions. Word has length 653 [2025-03-08 11:18:12,832 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-08 11:18:12,832 INFO L471 AbstractCegarLoop]: Abstraction has 74549 states and 118757 transitions. [2025-03-08 11:18:12,832 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 53.666666666666664) internal successors, (161), 3 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-03-08 11:18:12,832 INFO L276 IsEmpty]: Start isEmpty. Operand 74549 states and 118757 transitions. [2025-03-08 11:18:12,872 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 654 [2025-03-08 11:18:12,873 INFO L210 NwaCegarLoop]: Found error trace [2025-03-08 11:18:12,873 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-03-08 11:18:12,873 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable23 [2025-03-08 11:18:12,873 INFO L396 AbstractCegarLoop]: === Iteration 25 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-03-08 11:18:12,873 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-08 11:18:12,874 INFO L85 PathProgramCache]: Analyzing trace with hash 844382691, now seen corresponding path program 1 times [2025-03-08 11:18:12,874 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-08 11:18:12,874 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1601721186] [2025-03-08 11:18:12,874 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-08 11:18:12,874 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-08 11:18:12,894 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 653 statements into 1 equivalence classes. [2025-03-08 11:18:13,253 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 653 of 653 statements. [2025-03-08 11:18:13,253 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-08 11:18:13,253 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-08 11:18:14,389 INFO L134 CoverageAnalysis]: Checked inductivity of 19404 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 19404 trivial. 0 not checked. [2025-03-08 11:18:14,390 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-08 11:18:14,390 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1601721186] [2025-03-08 11:18:14,390 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1601721186] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-08 11:18:14,390 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-08 11:18:14,390 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [12] imperfect sequences [] total 12 [2025-03-08 11:18:14,390 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1348038810] [2025-03-08 11:18:14,390 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-08 11:18:14,391 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 12 states [2025-03-08 11:18:14,391 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-08 11:18:14,391 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 12 interpolants. [2025-03-08 11:18:14,392 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=33, Invalid=99, Unknown=0, NotChecked=0, Total=132 [2025-03-08 11:18:14,392 INFO L87 Difference]: Start difference. First operand 74549 states and 118757 transitions. Second operand has 12 states, 12 states have (on average 13.416666666666666) internal successors, (161), 12 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)