./Ultimate.py --spec ../sv-benchmarks/c/properties/unreach-call.prp --file ../sv-benchmarks/c/hardness-nfm22/hardness_fillercode_fillercodesize_ps-cn-500_file-12.i --full-output --architecture 32bit -------------------------------------------------------------------------------- Checking for ERROR reachability Using default analysis Version c00e63dc Calling Ultimate with: /root/.sdkman/candidates/java/21.0.5-tem/bin/java -Dosgi.configuration.area=/storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/data/config -Xmx15G -Xms4m -jar /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/plugins/org.eclipse.equinox.launcher_1.6.800.v20240513-1750.jar -data @noDefault -ultimatedata /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/data -tc /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/config/AutomizerReach.xml -i ../sv-benchmarks/c/hardness-nfm22/hardness_fillercode_fillercodesize_ps-cn-500_file-12.i -s /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/config/svcomp-Reach-32bit-Automizer_Default.epf --cacsl2boogietranslator.entry.function main --witnessprinter.witness.directory /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux --witnessprinter.witness.filename witness --witnessprinter.write.witness.besides.input.file false --witnessprinter.graph.data.specification CHECK( init(main()), LTL(G ! call(reach_error())) ) --witnessprinter.graph.data.producer Automizer --witnessprinter.graph.data.architecture 32bit --witnessprinter.graph.data.programhash 0195a79ad7eda7ad8a0c6adcb8066ff123870f81fcea1f23c209e71678638ac8 --- Real Ultimate output --- This is Ultimate 0.3.0-?-c00e63d-m [2025-02-05 21:54:49,724 INFO L188 SettingsManager]: Resetting all preferences to default values... [2025-02-05 21:54:49,779 INFO L114 SettingsManager]: Loading settings from /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/config/svcomp-Reach-32bit-Automizer_Default.epf [2025-02-05 21:54:49,783 WARN L101 SettingsManager]: Preference file contains the following unknown settings: [2025-02-05 21:54:49,784 WARN L103 SettingsManager]: * de.uni_freiburg.informatik.ultimate.core.Log level for class [2025-02-05 21:54:49,808 INFO L130 SettingsManager]: Preferences different from defaults after loading the file: [2025-02-05 21:54:49,809 INFO L151 SettingsManager]: Preferences of UltimateCore differ from their defaults: [2025-02-05 21:54:49,810 INFO L153 SettingsManager]: * Log level for class=de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher=ERROR; [2025-02-05 21:54:49,810 INFO L151 SettingsManager]: Preferences of Boogie Preprocessor differ from their defaults: [2025-02-05 21:54:49,810 INFO L153 SettingsManager]: * Use memory slicer=true [2025-02-05 21:54:49,810 INFO L151 SettingsManager]: Preferences of Boogie Procedure Inliner differ from their defaults: [2025-02-05 21:54:49,810 INFO L153 SettingsManager]: * Ignore calls to procedures called more than once=ONLY_FOR_SEQUENTIAL_PROGRAMS [2025-02-05 21:54:49,811 INFO L151 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2025-02-05 21:54:49,811 INFO L153 SettingsManager]: * Create parallel compositions if possible=false [2025-02-05 21:54:49,811 INFO L153 SettingsManager]: * Use SBE=true [2025-02-05 21:54:49,811 INFO L151 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2025-02-05 21:54:49,811 INFO L153 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2025-02-05 21:54:49,811 INFO L153 SettingsManager]: * sizeof long=4 [2025-02-05 21:54:49,812 INFO L153 SettingsManager]: * Overapproximate operations on floating types=true [2025-02-05 21:54:49,812 INFO L153 SettingsManager]: * sizeof POINTER=4 [2025-02-05 21:54:49,812 INFO L153 SettingsManager]: * Check division by zero=IGNORE [2025-02-05 21:54:49,812 INFO L153 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2025-02-05 21:54:49,812 INFO L153 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2025-02-05 21:54:49,812 INFO L153 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2025-02-05 21:54:49,812 INFO L153 SettingsManager]: * sizeof long double=12 [2025-02-05 21:54:49,813 INFO L153 SettingsManager]: * Check if freed pointer was valid=false [2025-02-05 21:54:49,813 INFO L153 SettingsManager]: * Behaviour of calls to undefined functions=OVERAPPROXIMATE_BEHAVIOUR [2025-02-05 21:54:49,813 INFO L153 SettingsManager]: * Use constant arrays=true [2025-02-05 21:54:49,813 INFO L151 SettingsManager]: Preferences of IcfgBuilder differ from their defaults: [2025-02-05 21:54:49,813 INFO L153 SettingsManager]: * Size of a code block=SequenceOfStatements [2025-02-05 21:54:49,813 INFO L153 SettingsManager]: * Only consider context switches at boundaries of atomic blocks=true [2025-02-05 21:54:49,813 INFO L153 SettingsManager]: * SMT solver=External_DefaultMode [2025-02-05 21:54:49,813 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2025-02-05 21:54:49,814 INFO L151 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2025-02-05 21:54:49,814 INFO L153 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2025-02-05 21:54:49,814 INFO L153 SettingsManager]: * Compute procedure contracts=false [2025-02-05 21:54:49,814 INFO L153 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopHeads [2025-02-05 21:54:49,814 INFO L153 SettingsManager]: * Trace refinement strategy=CAMEL [2025-02-05 21:54:49,814 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2025-02-05 21:54:49,814 INFO L153 SettingsManager]: * Apply one-shot large block encoding in concurrent analysis=false [2025-02-05 21:54:49,814 INFO L153 SettingsManager]: * Automaton type used in concurrency analysis=PETRI_NET [2025-02-05 21:54:49,815 INFO L153 SettingsManager]: * Order on configurations for Petri net unfoldings=DBO [2025-02-05 21:54:49,815 INFO L153 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode [2025-02-05 21:54:49,815 INFO L153 SettingsManager]: * Looper check in Petri net analysis=SEMANTIC Applying setting for plugin de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator: Entry function -> main Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Witness directory -> /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Witness filename -> witness Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Write witness besides input file -> false Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Graph data specification -> CHECK( init(main()), LTL(G ! call(reach_error())) ) Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Graph data producer -> Automizer Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Graph data architecture -> 32bit Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Graph data programhash -> 0195a79ad7eda7ad8a0c6adcb8066ff123870f81fcea1f23c209e71678638ac8 [2025-02-05 21:54:50,059 INFO L75 nceAwareModelManager]: Repository-Root is: /tmp [2025-02-05 21:54:50,065 INFO L261 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2025-02-05 21:54:50,068 INFO L217 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2025-02-05 21:54:50,069 INFO L270 PluginConnector]: Initializing CDTParser... [2025-02-05 21:54:50,069 INFO L274 PluginConnector]: CDTParser initialized [2025-02-05 21:54:50,070 INFO L431 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/../sv-benchmarks/c/hardness-nfm22/hardness_fillercode_fillercodesize_ps-cn-500_file-12.i [2025-02-05 21:54:51,253 INFO L533 CDTParser]: Created temporary CDT project at /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/data/9d69b4378/40d5814f3d87470a84a3c989f36bd19f/FLAGf4e885441 [2025-02-05 21:54:51,616 INFO L384 CDTParser]: Found 1 translation units. [2025-02-05 21:54:51,616 INFO L180 CDTParser]: Scanning /storage/repos/ultimate-jdk21/releaseScripts/default/sv-benchmarks/c/hardness-nfm22/hardness_fillercode_fillercodesize_ps-cn-500_file-12.i [2025-02-05 21:54:51,638 INFO L427 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/data/9d69b4378/40d5814f3d87470a84a3c989f36bd19f/FLAGf4e885441 [2025-02-05 21:54:51,851 INFO L435 CDTParser]: Successfully deleted /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/data/9d69b4378/40d5814f3d87470a84a3c989f36bd19f [2025-02-05 21:54:51,853 INFO L299 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2025-02-05 21:54:51,855 INFO L133 ToolchainWalker]: Walking toolchain with 6 elements. [2025-02-05 21:54:51,857 INFO L112 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2025-02-05 21:54:51,857 INFO L270 PluginConnector]: Initializing CACSL2BoogieTranslator... [2025-02-05 21:54:51,860 INFO L274 PluginConnector]: CACSL2BoogieTranslator initialized [2025-02-05 21:54:51,861 INFO L184 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 05.02 09:54:51" (1/1) ... [2025-02-05 21:54:51,862 INFO L204 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@26a9f603 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 05.02 09:54:51, skipping insertion in model container [2025-02-05 21:54:51,863 INFO L184 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 05.02 09:54:51" (1/1) ... [2025-02-05 21:54:51,895 INFO L175 MainTranslator]: Built tables and reachable declarations [2025-02-05 21:54:52,017 WARN L250 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate-jdk21/releaseScripts/default/sv-benchmarks/c/hardness-nfm22/hardness_fillercode_fillercodesize_ps-cn-500_file-12.i[916,929] [2025-02-05 21:54:52,213 INFO L210 PostProcessor]: Analyzing one entry point: main [2025-02-05 21:54:52,231 INFO L200 MainTranslator]: Completed pre-run [2025-02-05 21:54:52,239 WARN L250 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate-jdk21/releaseScripts/default/sv-benchmarks/c/hardness-nfm22/hardness_fillercode_fillercodesize_ps-cn-500_file-12.i[916,929] [2025-02-05 21:54:52,327 INFO L210 PostProcessor]: Analyzing one entry point: main [2025-02-05 21:54:52,344 INFO L204 MainTranslator]: Completed translation [2025-02-05 21:54:52,345 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 05.02 09:54:52 WrapperNode [2025-02-05 21:54:52,346 INFO L131 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2025-02-05 21:54:52,346 INFO L112 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2025-02-05 21:54:52,347 INFO L270 PluginConnector]: Initializing Boogie Procedure Inliner... [2025-02-05 21:54:52,347 INFO L274 PluginConnector]: Boogie Procedure Inliner initialized [2025-02-05 21:54:52,352 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 05.02 09:54:52" (1/1) ... [2025-02-05 21:54:52,365 INFO L184 PluginConnector]: Executing the observer Inliner from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 05.02 09:54:52" (1/1) ... [2025-02-05 21:54:52,424 INFO L138 Inliner]: procedures = 26, calls = 121, calls flagged for inlining = 8, calls inlined = 8, statements flattened = 820 [2025-02-05 21:54:52,424 INFO L131 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2025-02-05 21:54:52,425 INFO L112 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2025-02-05 21:54:52,425 INFO L270 PluginConnector]: Initializing Boogie Preprocessor... [2025-02-05 21:54:52,425 INFO L274 PluginConnector]: Boogie Preprocessor initialized [2025-02-05 21:54:52,434 INFO L184 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 05.02 09:54:52" (1/1) ... [2025-02-05 21:54:52,435 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 05.02 09:54:52" (1/1) ... [2025-02-05 21:54:52,451 INFO L184 PluginConnector]: Executing the observer MemorySlicer from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 05.02 09:54:52" (1/1) ... [2025-02-05 21:54:52,481 INFO L175 MemorySlicer]: Split 2 memory accesses to 1 slices as follows [2]. 100 percent of accesses are in the largest equivalence class. The 2 initializations are split as follows [2]. The 0 writes are split as follows [0]. [2025-02-05 21:54:52,482 INFO L184 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 05.02 09:54:52" (1/1) ... [2025-02-05 21:54:52,482 INFO L184 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 05.02 09:54:52" (1/1) ... [2025-02-05 21:54:52,498 INFO L184 PluginConnector]: Executing the observer ReplaceArrayAssignments from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 05.02 09:54:52" (1/1) ... [2025-02-05 21:54:52,503 INFO L184 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 05.02 09:54:52" (1/1) ... [2025-02-05 21:54:52,509 INFO L184 PluginConnector]: Executing the observer LTLStepAnnotator from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 05.02 09:54:52" (1/1) ... [2025-02-05 21:54:52,516 INFO L184 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 05.02 09:54:52" (1/1) ... [2025-02-05 21:54:52,526 INFO L131 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2025-02-05 21:54:52,527 INFO L112 PluginConnector]: ------------------------IcfgBuilder---------------------------- [2025-02-05 21:54:52,527 INFO L270 PluginConnector]: Initializing IcfgBuilder... [2025-02-05 21:54:52,528 INFO L274 PluginConnector]: IcfgBuilder initialized [2025-02-05 21:54:52,528 INFO L184 PluginConnector]: Executing the observer IcfgBuilderObserver from plugin IcfgBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 05.02 09:54:52" (1/1) ... [2025-02-05 21:54:52,533 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2025-02-05 21:54:52,549 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 [2025-02-05 21:54:52,562 INFO L229 MonitoredProcess]: Starting monitored process 1 with /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 (exit command is (exit), workingDir is null) [2025-02-05 21:54:52,565 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 (1)] Waiting until timeout for monitored process [2025-02-05 21:54:52,583 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocInit [2025-02-05 21:54:52,583 INFO L130 BoogieDeclarations]: Found specification of procedure assume_abort_if_not [2025-02-05 21:54:52,583 INFO L138 BoogieDeclarations]: Found implementation of procedure assume_abort_if_not [2025-02-05 21:54:52,583 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int#0 [2025-02-05 21:54:52,583 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2025-02-05 21:54:52,583 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2025-02-05 21:54:52,692 INFO L257 CfgBuilder]: Building ICFG [2025-02-05 21:54:52,694 INFO L287 CfgBuilder]: Building CFG for each procedure with an implementation [2025-02-05 21:54:53,788 INFO L? ?]: Removed 23 outVars from TransFormulas that were not future-live. [2025-02-05 21:54:53,788 INFO L308 CfgBuilder]: Performing block encoding [2025-02-05 21:54:53,822 INFO L332 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2025-02-05 21:54:53,827 INFO L337 CfgBuilder]: Removed 0 assume(true) statements. [2025-02-05 21:54:53,827 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.icfgbuilder CFG 05.02 09:54:53 BoogieIcfgContainer [2025-02-05 21:54:53,827 INFO L131 PluginConnector]: ------------------------ END IcfgBuilder---------------------------- [2025-02-05 21:54:53,829 INFO L112 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2025-02-05 21:54:53,829 INFO L270 PluginConnector]: Initializing TraceAbstraction... [2025-02-05 21:54:53,833 INFO L274 PluginConnector]: TraceAbstraction initialized [2025-02-05 21:54:53,833 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 05.02 09:54:51" (1/3) ... [2025-02-05 21:54:53,834 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@1df0f17f and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 05.02 09:54:53, skipping insertion in model container [2025-02-05 21:54:53,834 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 05.02 09:54:52" (2/3) ... [2025-02-05 21:54:53,834 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@1df0f17f and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 05.02 09:54:53, skipping insertion in model container [2025-02-05 21:54:53,834 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.icfgbuilder CFG 05.02 09:54:53" (3/3) ... [2025-02-05 21:54:53,835 INFO L128 eAbstractionObserver]: Analyzing ICFG hardness_fillercode_fillercodesize_ps-cn-500_file-12.i [2025-02-05 21:54:53,847 INFO L216 ceAbstractionStarter]: Automizer settings: Hoare:LoopHeads NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2025-02-05 21:54:53,851 INFO L151 ceAbstractionStarter]: Applying trace abstraction to ICFG hardness_fillercode_fillercodesize_ps-cn-500_file-12.i that has 2 procedures, 339 locations, 1 initial locations, 1 loop locations, and 1 error locations. [2025-02-05 21:54:53,910 INFO L332 AbstractCegarLoop]: ======== Iteration 0 == of CEGAR loop == AllErrorsAtOnce ======== [2025-02-05 21:54:53,924 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;@4087ebbb, mLbeIndependenceSettings=[IndependenceType=SEMANTIC, AbstractionType=NONE, UseConditional=false, UseSemiCommutativity=true, Solver=Z3, SolverTimeout=1000ms] [2025-02-05 21:54:53,924 INFO L334 AbstractCegarLoop]: Starting to check reachability of 1 error locations. [2025-02-05 21:54:53,929 INFO L276 IsEmpty]: Start isEmpty. Operand has 339 states, 228 states have (on average 1.5789473684210527) internal successors, (360), 229 states have internal predecessors, (360), 108 states have call successors, (108), 1 states have call predecessors, (108), 1 states have return successors, (108), 108 states have call predecessors, (108), 108 states have call successors, (108) [2025-02-05 21:54:53,956 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 691 [2025-02-05 21:54:53,957 INFO L210 NwaCegarLoop]: Found error trace [2025-02-05 21:54:53,958 INFO L218 NwaCegarLoop]: trace histogram [108, 108, 108, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-02-05 21:54:53,958 INFO L396 AbstractCegarLoop]: === Iteration 1 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-02-05 21:54:53,963 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-02-05 21:54:53,964 INFO L85 PathProgramCache]: Analyzing trace with hash -1946880649, now seen corresponding path program 1 times [2025-02-05 21:54:53,970 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-02-05 21:54:53,970 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [75118651] [2025-02-05 21:54:53,971 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-02-05 21:54:53,971 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-02-05 21:54:54,097 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 690 statements into 1 equivalence classes. [2025-02-05 21:54:54,290 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 690 of 690 statements. [2025-02-05 21:54:54,294 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-02-05 21:54:54,294 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-02-05 21:54:54,731 INFO L134 CoverageAnalysis]: Checked inductivity of 23112 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 23112 trivial. 0 not checked. [2025-02-05 21:54:54,731 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-02-05 21:54:54,732 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [75118651] [2025-02-05 21:54:54,733 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [75118651] provided 1 perfect and 0 imperfect interpolant sequences [2025-02-05 21:54:54,733 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-02-05 21:54:54,733 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2025-02-05 21:54:54,735 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [832164099] [2025-02-05 21:54:54,736 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-02-05 21:54:54,740 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 2 states [2025-02-05 21:54:54,742 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-02-05 21:54:54,768 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 2 interpolants. [2025-02-05 21:54:54,768 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=1, Invalid=1, Unknown=0, NotChecked=0, Total=2 [2025-02-05 21:54:54,773 INFO L87 Difference]: Start difference. First operand has 339 states, 228 states have (on average 1.5789473684210527) internal successors, (360), 229 states have internal predecessors, (360), 108 states have call successors, (108), 1 states have call predecessors, (108), 1 states have return successors, (108), 108 states have call predecessors, (108), 108 states have call successors, (108) Second operand has 2 states, 2 states have (on average 76.5) internal successors, (153), 2 states have internal predecessors, (153), 1 states have call successors, (108), 1 states have call predecessors, (108), 1 states have return successors, (108), 1 states have call predecessors, (108), 1 states have call successors, (108) [2025-02-05 21:54:54,880 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-02-05 21:54:54,881 INFO L93 Difference]: Finished difference Result 672 states and 1255 transitions. [2025-02-05 21:54:54,883 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 2 states. [2025-02-05 21:54:54,885 INFO L78 Accepts]: Start accepts. Automaton has has 2 states, 2 states have (on average 76.5) internal successors, (153), 2 states have internal predecessors, (153), 1 states have call successors, (108), 1 states have call predecessors, (108), 1 states have return successors, (108), 1 states have call predecessors, (108), 1 states have call successors, (108) Word has length 690 [2025-02-05 21:54:54,887 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-02-05 21:54:54,900 INFO L225 Difference]: With dead ends: 672 [2025-02-05 21:54:54,901 INFO L226 Difference]: Without dead ends: 336 [2025-02-05 21:54:54,909 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 2 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 0 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=1, Invalid=1, Unknown=0, NotChecked=0, Total=2 [2025-02-05 21:54:54,911 INFO L435 NwaCegarLoop]: 558 mSDtfsCounter, 0 mSDsluCounter, 0 mSDsCounter, 0 mSdLazyCounter, 12 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 0 SdHoareTripleChecker+Valid, 558 SdHoareTripleChecker+Invalid, 12 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 12 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2025-02-05 21:54:54,912 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [0 Valid, 558 Invalid, 12 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 12 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2025-02-05 21:54:54,927 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 336 states. [2025-02-05 21:54:54,992 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 336 to 336. [2025-02-05 21:54:54,994 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 336 states, 226 states have (on average 1.5663716814159292) internal successors, (354), 226 states have internal predecessors, (354), 108 states have call successors, (108), 1 states have call predecessors, (108), 1 states have return successors, (108), 108 states have call predecessors, (108), 108 states have call successors, (108) [2025-02-05 21:54:55,006 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 336 states to 336 states and 570 transitions. [2025-02-05 21:54:55,009 INFO L78 Accepts]: Start accepts. Automaton has 336 states and 570 transitions. Word has length 690 [2025-02-05 21:54:55,013 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-02-05 21:54:55,016 INFO L471 AbstractCegarLoop]: Abstraction has 336 states and 570 transitions. [2025-02-05 21:54:55,016 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 2 states, 2 states have (on average 76.5) internal successors, (153), 2 states have internal predecessors, (153), 1 states have call successors, (108), 1 states have call predecessors, (108), 1 states have return successors, (108), 1 states have call predecessors, (108), 1 states have call successors, (108) [2025-02-05 21:54:55,016 INFO L276 IsEmpty]: Start isEmpty. Operand 336 states and 570 transitions. [2025-02-05 21:54:55,031 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 692 [2025-02-05 21:54:55,032 INFO L210 NwaCegarLoop]: Found error trace [2025-02-05 21:54:55,032 INFO L218 NwaCegarLoop]: trace histogram [108, 108, 108, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-02-05 21:54:55,033 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable0 [2025-02-05 21:54:55,033 INFO L396 AbstractCegarLoop]: === Iteration 2 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-02-05 21:54:55,034 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-02-05 21:54:55,034 INFO L85 PathProgramCache]: Analyzing trace with hash 1669884111, now seen corresponding path program 1 times [2025-02-05 21:54:55,034 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-02-05 21:54:55,034 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [657722057] [2025-02-05 21:54:55,035 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-02-05 21:54:55,035 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-02-05 21:54:55,095 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 691 statements into 1 equivalence classes. [2025-02-05 21:54:55,179 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 691 of 691 statements. [2025-02-05 21:54:55,179 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-02-05 21:54:55,180 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-02-05 21:54:55,912 INFO L134 CoverageAnalysis]: Checked inductivity of 23112 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 23112 trivial. 0 not checked. [2025-02-05 21:54:55,912 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-02-05 21:54:55,912 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [657722057] [2025-02-05 21:54:55,912 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [657722057] provided 1 perfect and 0 imperfect interpolant sequences [2025-02-05 21:54:55,912 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-02-05 21:54:55,912 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2025-02-05 21:54:55,912 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1732805649] [2025-02-05 21:54:55,913 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-02-05 21:54:55,914 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2025-02-05 21:54:55,916 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-02-05 21:54:55,917 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2025-02-05 21:54:55,917 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-02-05 21:54:55,918 INFO L87 Difference]: Start difference. First operand 336 states and 570 transitions. Second operand has 3 states, 3 states have (on average 51.333333333333336) internal successors, (154), 3 states have internal predecessors, (154), 1 states have call successors, (108), 1 states have call predecessors, (108), 1 states have return successors, (108), 1 states have call predecessors, (108), 1 states have call successors, (108) [2025-02-05 21:54:56,052 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-02-05 21:54:56,053 INFO L93 Difference]: Finished difference Result 1001 states and 1702 transitions. [2025-02-05 21:54:56,053 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2025-02-05 21:54:56,053 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 51.333333333333336) internal successors, (154), 3 states have internal predecessors, (154), 1 states have call successors, (108), 1 states have call predecessors, (108), 1 states have return successors, (108), 1 states have call predecessors, (108), 1 states have call successors, (108) Word has length 691 [2025-02-05 21:54:56,055 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-02-05 21:54:56,066 INFO L225 Difference]: With dead ends: 1001 [2025-02-05 21:54:56,069 INFO L226 Difference]: Without dead ends: 668 [2025-02-05 21:54:56,071 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 3 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-02-05 21:54:56,072 INFO L435 NwaCegarLoop]: 548 mSDtfsCounter, 349 mSDsluCounter, 542 mSDsCounter, 0 mSdLazyCounter, 47 mSolverCounterSat, 1 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 349 SdHoareTripleChecker+Valid, 1090 SdHoareTripleChecker+Invalid, 48 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 1 IncrementalHoareTripleChecker+Valid, 47 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2025-02-05 21:54:56,072 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [349 Valid, 1090 Invalid, 48 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [1 Valid, 47 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2025-02-05 21:54:56,075 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 668 states. [2025-02-05 21:54:56,164 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 668 to 666. [2025-02-05 21:54:56,165 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 666 states, 447 states have (on average 1.5659955257270695) internal successors, (700), 447 states have internal predecessors, (700), 216 states have call successors, (216), 2 states have call predecessors, (216), 2 states have return successors, (216), 216 states have call predecessors, (216), 216 states have call successors, (216) [2025-02-05 21:54:56,170 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 666 states to 666 states and 1132 transitions. [2025-02-05 21:54:56,171 INFO L78 Accepts]: Start accepts. Automaton has 666 states and 1132 transitions. Word has length 691 [2025-02-05 21:54:56,173 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-02-05 21:54:56,173 INFO L471 AbstractCegarLoop]: Abstraction has 666 states and 1132 transitions. [2025-02-05 21:54:56,173 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 51.333333333333336) internal successors, (154), 3 states have internal predecessors, (154), 1 states have call successors, (108), 1 states have call predecessors, (108), 1 states have return successors, (108), 1 states have call predecessors, (108), 1 states have call successors, (108) [2025-02-05 21:54:56,174 INFO L276 IsEmpty]: Start isEmpty. Operand 666 states and 1132 transitions. [2025-02-05 21:54:56,184 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 693 [2025-02-05 21:54:56,184 INFO L210 NwaCegarLoop]: Found error trace [2025-02-05 21:54:56,184 INFO L218 NwaCegarLoop]: trace histogram [108, 108, 108, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-02-05 21:54:56,185 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable1 [2025-02-05 21:54:56,185 INFO L396 AbstractCegarLoop]: === Iteration 3 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-02-05 21:54:56,185 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-02-05 21:54:56,185 INFO L85 PathProgramCache]: Analyzing trace with hash 1775084902, now seen corresponding path program 1 times [2025-02-05 21:54:56,186 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-02-05 21:54:56,186 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [736330772] [2025-02-05 21:54:56,186 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-02-05 21:54:56,186 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-02-05 21:54:56,241 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 692 statements into 1 equivalence classes. [2025-02-05 21:54:56,294 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 692 of 692 statements. [2025-02-05 21:54:56,295 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-02-05 21:54:56,295 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-02-05 21:54:56,536 INFO L134 CoverageAnalysis]: Checked inductivity of 23112 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 23112 trivial. 0 not checked. [2025-02-05 21:54:56,536 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-02-05 21:54:56,536 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [736330772] [2025-02-05 21:54:56,536 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [736330772] provided 1 perfect and 0 imperfect interpolant sequences [2025-02-05 21:54:56,536 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-02-05 21:54:56,536 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2025-02-05 21:54:56,537 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1039226862] [2025-02-05 21:54:56,537 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-02-05 21:54:56,537 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2025-02-05 21:54:56,541 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-02-05 21:54:56,542 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2025-02-05 21:54:56,542 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-02-05 21:54:56,543 INFO L87 Difference]: Start difference. First operand 666 states and 1132 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, (108), 1 states have call predecessors, (108), 1 states have return successors, (108), 1 states have call predecessors, (108), 1 states have call successors, (108) [2025-02-05 21:54:56,668 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-02-05 21:54:56,669 INFO L93 Difference]: Finished difference Result 1714 states and 2928 transitions. [2025-02-05 21:54:56,669 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2025-02-05 21:54:56,670 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, (108), 1 states have call predecessors, (108), 1 states have return successors, (108), 1 states have call predecessors, (108), 1 states have call successors, (108) Word has length 692 [2025-02-05 21:54:56,672 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-02-05 21:54:56,685 INFO L225 Difference]: With dead ends: 1714 [2025-02-05 21:54:56,686 INFO L226 Difference]: Without dead ends: 1051 [2025-02-05 21:54:56,690 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 3 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-02-05 21:54:56,691 INFO L435 NwaCegarLoop]: 732 mSDtfsCounter, 333 mSDsluCounter, 542 mSDsCounter, 0 mSdLazyCounter, 49 mSolverCounterSat, 5 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 333 SdHoareTripleChecker+Valid, 1274 SdHoareTripleChecker+Invalid, 54 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 5 IncrementalHoareTripleChecker+Valid, 49 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2025-02-05 21:54:56,692 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [333 Valid, 1274 Invalid, 54 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [5 Valid, 49 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2025-02-05 21:54:56,693 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1051 states. [2025-02-05 21:54:56,847 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1051 to 1047. [2025-02-05 21:54:56,853 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 1047 states, 768 states have (on average 1.6197916666666667) internal successors, (1244), 770 states have internal predecessors, (1244), 274 states have call successors, (274), 4 states have call predecessors, (274), 4 states have return successors, (274), 272 states have call predecessors, (274), 274 states have call successors, (274) [2025-02-05 21:54:56,860 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1047 states to 1047 states and 1792 transitions. [2025-02-05 21:54:56,863 INFO L78 Accepts]: Start accepts. Automaton has 1047 states and 1792 transitions. Word has length 692 [2025-02-05 21:54:56,865 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-02-05 21:54:56,866 INFO L471 AbstractCegarLoop]: Abstraction has 1047 states and 1792 transitions. [2025-02-05 21:54:56,866 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, (108), 1 states have call predecessors, (108), 1 states have return successors, (108), 1 states have call predecessors, (108), 1 states have call successors, (108) [2025-02-05 21:54:56,866 INFO L276 IsEmpty]: Start isEmpty. Operand 1047 states and 1792 transitions. [2025-02-05 21:54:56,873 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 693 [2025-02-05 21:54:56,874 INFO L210 NwaCegarLoop]: Found error trace [2025-02-05 21:54:56,874 INFO L218 NwaCegarLoop]: trace histogram [108, 108, 108, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-02-05 21:54:56,874 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable2 [2025-02-05 21:54:56,874 INFO L396 AbstractCegarLoop]: === Iteration 4 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-02-05 21:54:56,876 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-02-05 21:54:56,877 INFO L85 PathProgramCache]: Analyzing trace with hash 941929158, now seen corresponding path program 1 times [2025-02-05 21:54:56,877 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-02-05 21:54:56,877 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1118568069] [2025-02-05 21:54:56,877 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-02-05 21:54:56,877 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-02-05 21:54:56,929 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 692 statements into 1 equivalence classes. [2025-02-05 21:54:56,979 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 692 of 692 statements. [2025-02-05 21:54:56,980 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-02-05 21:54:56,980 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-02-05 21:54:57,173 INFO L134 CoverageAnalysis]: Checked inductivity of 23112 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 23112 trivial. 0 not checked. [2025-02-05 21:54:57,173 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-02-05 21:54:57,173 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1118568069] [2025-02-05 21:54:57,173 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1118568069] provided 1 perfect and 0 imperfect interpolant sequences [2025-02-05 21:54:57,173 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-02-05 21:54:57,174 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2025-02-05 21:54:57,174 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1629073795] [2025-02-05 21:54:57,174 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-02-05 21:54:57,174 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2025-02-05 21:54:57,174 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-02-05 21:54:57,175 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2025-02-05 21:54:57,175 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-02-05 21:54:57,176 INFO L87 Difference]: Start difference. First operand 1047 states and 1792 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, (108), 1 states have call predecessors, (108), 1 states have return successors, (108), 1 states have call predecessors, (108), 1 states have call successors, (108) [2025-02-05 21:54:57,310 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-02-05 21:54:57,310 INFO L93 Difference]: Finished difference Result 2857 states and 4904 transitions. [2025-02-05 21:54:57,311 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2025-02-05 21:54:57,311 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, (108), 1 states have call predecessors, (108), 1 states have return successors, (108), 1 states have call predecessors, (108), 1 states have call successors, (108) Word has length 692 [2025-02-05 21:54:57,312 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-02-05 21:54:57,326 INFO L225 Difference]: With dead ends: 2857 [2025-02-05 21:54:57,327 INFO L226 Difference]: Without dead ends: 1813 [2025-02-05 21:54:57,331 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 3 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-02-05 21:54:57,333 INFO L435 NwaCegarLoop]: 702 mSDtfsCounter, 329 mSDsluCounter, 543 mSDsCounter, 0 mSdLazyCounter, 43 mSolverCounterSat, 8 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 329 SdHoareTripleChecker+Valid, 1245 SdHoareTripleChecker+Invalid, 51 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 8 IncrementalHoareTripleChecker+Valid, 43 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2025-02-05 21:54:57,334 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [329 Valid, 1245 Invalid, 51 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [8 Valid, 43 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2025-02-05 21:54:57,337 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1813 states. [2025-02-05 21:54:57,450 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1813 to 1809. [2025-02-05 21:54:57,455 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 1809 states, 1394 states have (on average 1.6384505021520803) internal successors, (2284), 1400 states have internal predecessors, (2284), 406 states have call successors, (406), 8 states have call predecessors, (406), 8 states have return successors, (406), 400 states have call predecessors, (406), 406 states have call successors, (406) [2025-02-05 21:54:57,495 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1809 states to 1809 states and 3096 transitions. [2025-02-05 21:54:57,496 INFO L78 Accepts]: Start accepts. Automaton has 1809 states and 3096 transitions. Word has length 692 [2025-02-05 21:54:57,497 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-02-05 21:54:57,497 INFO L471 AbstractCegarLoop]: Abstraction has 1809 states and 3096 transitions. [2025-02-05 21:54:57,498 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, (108), 1 states have call predecessors, (108), 1 states have return successors, (108), 1 states have call predecessors, (108), 1 states have call successors, (108) [2025-02-05 21:54:57,498 INFO L276 IsEmpty]: Start isEmpty. Operand 1809 states and 3096 transitions. [2025-02-05 21:54:57,505 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 693 [2025-02-05 21:54:57,505 INFO L210 NwaCegarLoop]: Found error trace [2025-02-05 21:54:57,506 INFO L218 NwaCegarLoop]: trace histogram [108, 108, 108, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-02-05 21:54:57,506 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable3 [2025-02-05 21:54:57,506 INFO L396 AbstractCegarLoop]: === Iteration 5 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-02-05 21:54:57,507 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-02-05 21:54:57,507 INFO L85 PathProgramCache]: Analyzing trace with hash -1202286938, now seen corresponding path program 1 times [2025-02-05 21:54:57,507 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-02-05 21:54:57,507 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2065123945] [2025-02-05 21:54:57,508 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-02-05 21:54:57,508 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-02-05 21:54:57,552 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 692 statements into 1 equivalence classes. [2025-02-05 21:54:57,600 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 692 of 692 statements. [2025-02-05 21:54:57,601 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-02-05 21:54:57,601 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-02-05 21:54:57,797 INFO L134 CoverageAnalysis]: Checked inductivity of 23112 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 23112 trivial. 0 not checked. [2025-02-05 21:54:57,797 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-02-05 21:54:57,797 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2065123945] [2025-02-05 21:54:57,797 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [2065123945] provided 1 perfect and 0 imperfect interpolant sequences [2025-02-05 21:54:57,797 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-02-05 21:54:57,797 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2025-02-05 21:54:57,798 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1677815086] [2025-02-05 21:54:57,798 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-02-05 21:54:57,799 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2025-02-05 21:54:57,799 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-02-05 21:54:57,800 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2025-02-05 21:54:57,800 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-02-05 21:54:57,800 INFO L87 Difference]: Start difference. First operand 1809 states and 3096 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, (108), 1 states have call predecessors, (108), 1 states have return successors, (108), 1 states have call predecessors, (108), 1 states have call successors, (108) [2025-02-05 21:54:57,976 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-02-05 21:54:57,976 INFO L93 Difference]: Finished difference Result 5357 states and 9166 transitions. [2025-02-05 21:54:57,976 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2025-02-05 21:54:57,977 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, (108), 1 states have call predecessors, (108), 1 states have return successors, (108), 1 states have call predecessors, (108), 1 states have call successors, (108) Word has length 692 [2025-02-05 21:54:57,978 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-02-05 21:54:58,000 INFO L225 Difference]: With dead ends: 5357 [2025-02-05 21:54:58,000 INFO L226 Difference]: Without dead ends: 3551 [2025-02-05 21:54:58,008 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 3 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-02-05 21:54:58,008 INFO L435 NwaCegarLoop]: 557 mSDtfsCounter, 544 mSDsluCounter, 549 mSDsCounter, 0 mSdLazyCounter, 29 mSolverCounterSat, 2 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 544 SdHoareTripleChecker+Valid, 1106 SdHoareTripleChecker+Invalid, 31 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 2 IncrementalHoareTripleChecker+Valid, 29 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2025-02-05 21:54:58,009 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [544 Valid, 1106 Invalid, 31 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [2 Valid, 29 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2025-02-05 21:54:58,012 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 3551 states. [2025-02-05 21:54:58,182 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 3551 to 1873. [2025-02-05 21:54:58,186 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 1873 states, 1458 states have (on average 1.635116598079561) internal successors, (2384), 1464 states have internal predecessors, (2384), 406 states have call successors, (406), 8 states have call predecessors, (406), 8 states have return successors, (406), 400 states have call predecessors, (406), 406 states have call successors, (406) [2025-02-05 21:54:58,196 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1873 states to 1873 states and 3196 transitions. [2025-02-05 21:54:58,199 INFO L78 Accepts]: Start accepts. Automaton has 1873 states and 3196 transitions. Word has length 692 [2025-02-05 21:54:58,200 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-02-05 21:54:58,200 INFO L471 AbstractCegarLoop]: Abstraction has 1873 states and 3196 transitions. [2025-02-05 21:54:58,201 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, (108), 1 states have call predecessors, (108), 1 states have return successors, (108), 1 states have call predecessors, (108), 1 states have call successors, (108) [2025-02-05 21:54:58,201 INFO L276 IsEmpty]: Start isEmpty. Operand 1873 states and 3196 transitions. [2025-02-05 21:54:58,206 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 693 [2025-02-05 21:54:58,207 INFO L210 NwaCegarLoop]: Found error trace [2025-02-05 21:54:58,207 INFO L218 NwaCegarLoop]: trace histogram [108, 108, 108, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-02-05 21:54:58,207 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable4 [2025-02-05 21:54:58,208 INFO L396 AbstractCegarLoop]: === Iteration 6 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-02-05 21:54:58,208 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-02-05 21:54:58,208 INFO L85 PathProgramCache]: Analyzing trace with hash 2095608005, now seen corresponding path program 1 times [2025-02-05 21:54:58,209 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-02-05 21:54:58,209 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1130551309] [2025-02-05 21:54:58,209 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-02-05 21:54:58,209 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-02-05 21:54:58,249 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 692 statements into 1 equivalence classes. [2025-02-05 21:54:58,322 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 692 of 692 statements. [2025-02-05 21:54:58,323 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-02-05 21:54:58,323 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-02-05 21:54:58,754 INFO L134 CoverageAnalysis]: Checked inductivity of 23112 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 23112 trivial. 0 not checked. [2025-02-05 21:54:58,754 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-02-05 21:54:58,754 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1130551309] [2025-02-05 21:54:58,754 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1130551309] provided 1 perfect and 0 imperfect interpolant sequences [2025-02-05 21:54:58,754 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-02-05 21:54:58,755 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2025-02-05 21:54:58,756 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1343453832] [2025-02-05 21:54:58,757 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-02-05 21:54:58,757 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2025-02-05 21:54:58,757 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-02-05 21:54:58,759 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2025-02-05 21:54:58,759 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-02-05 21:54:58,759 INFO L87 Difference]: Start difference. First operand 1873 states and 3196 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, (108), 1 states have call predecessors, (108), 1 states have return successors, (108), 1 states have call predecessors, (108), 1 states have call successors, (108) [2025-02-05 21:54:59,022 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-02-05 21:54:59,022 INFO L93 Difference]: Finished difference Result 4813 states and 8158 transitions. [2025-02-05 21:54:59,023 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2025-02-05 21:54:59,023 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, (108), 1 states have call predecessors, (108), 1 states have return successors, (108), 1 states have call predecessors, (108), 1 states have call successors, (108) Word has length 692 [2025-02-05 21:54:59,024 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-02-05 21:54:59,040 INFO L225 Difference]: With dead ends: 4813 [2025-02-05 21:54:59,040 INFO L226 Difference]: Without dead ends: 2943 [2025-02-05 21:54:59,047 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 3 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-02-05 21:54:59,047 INFO L435 NwaCegarLoop]: 581 mSDtfsCounter, 190 mSDsluCounter, 527 mSDsCounter, 0 mSdLazyCounter, 53 mSolverCounterSat, 1 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 190 SdHoareTripleChecker+Valid, 1108 SdHoareTripleChecker+Invalid, 54 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 1 IncrementalHoareTripleChecker+Valid, 53 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2025-02-05 21:54:59,048 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [190 Valid, 1108 Invalid, 54 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [1 Valid, 53 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2025-02-05 21:54:59,050 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 2943 states. [2025-02-05 21:54:59,290 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 2943 to 2937. [2025-02-05 21:54:59,295 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 2937 states, 2258 states have (on average 1.6067316209034543) internal successors, (3628), 2272 states have internal predecessors, (3628), 662 states have call successors, (662), 16 states have call predecessors, (662), 16 states have return successors, (662), 648 states have call predecessors, (662), 662 states have call successors, (662) [2025-02-05 21:54:59,307 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 2937 states to 2937 states and 4952 transitions. [2025-02-05 21:54:59,311 INFO L78 Accepts]: Start accepts. Automaton has 2937 states and 4952 transitions. Word has length 692 [2025-02-05 21:54:59,312 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-02-05 21:54:59,312 INFO L471 AbstractCegarLoop]: Abstraction has 2937 states and 4952 transitions. [2025-02-05 21:54:59,313 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, (108), 1 states have call predecessors, (108), 1 states have return successors, (108), 1 states have call predecessors, (108), 1 states have call successors, (108) [2025-02-05 21:54:59,313 INFO L276 IsEmpty]: Start isEmpty. Operand 2937 states and 4952 transitions. [2025-02-05 21:54:59,320 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 693 [2025-02-05 21:54:59,320 INFO L210 NwaCegarLoop]: Found error trace [2025-02-05 21:54:59,321 INFO L218 NwaCegarLoop]: trace histogram [108, 108, 108, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-02-05 21:54:59,321 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable5 [2025-02-05 21:54:59,321 INFO L396 AbstractCegarLoop]: === Iteration 7 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-02-05 21:54:59,322 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-02-05 21:54:59,322 INFO L85 PathProgramCache]: Analyzing trace with hash -1317449114, now seen corresponding path program 1 times [2025-02-05 21:54:59,322 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-02-05 21:54:59,322 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [106591040] [2025-02-05 21:54:59,322 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-02-05 21:54:59,322 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-02-05 21:54:59,361 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 692 statements into 1 equivalence classes. [2025-02-05 21:54:59,417 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 692 of 692 statements. [2025-02-05 21:54:59,417 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-02-05 21:54:59,417 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-02-05 21:55:00,064 INFO L134 CoverageAnalysis]: Checked inductivity of 23112 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 23112 trivial. 0 not checked. [2025-02-05 21:55:00,065 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-02-05 21:55:00,065 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [106591040] [2025-02-05 21:55:00,065 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [106591040] provided 1 perfect and 0 imperfect interpolant sequences [2025-02-05 21:55:00,065 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-02-05 21:55:00,065 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2025-02-05 21:55:00,065 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1043490337] [2025-02-05 21:55:00,065 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-02-05 21:55:00,066 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2025-02-05 21:55:00,066 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-02-05 21:55:00,067 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2025-02-05 21:55:00,067 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2025-02-05 21:55:00,067 INFO L87 Difference]: Start difference. First operand 2937 states and 4952 transitions. Second operand has 4 states, 4 states have (on average 38.75) internal successors, (155), 4 states have internal predecessors, (155), 1 states have call successors, (108), 1 states have call predecessors, (108), 1 states have return successors, (108), 1 states have call predecessors, (108), 1 states have call successors, (108) [2025-02-05 21:55:00,941 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-02-05 21:55:00,941 INFO L93 Difference]: Finished difference Result 11687 states and 19771 transitions. [2025-02-05 21:55:00,942 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2025-02-05 21:55:00,942 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 4 states have (on average 38.75) internal successors, (155), 4 states have internal predecessors, (155), 1 states have call successors, (108), 1 states have call predecessors, (108), 1 states have return successors, (108), 1 states have call predecessors, (108), 1 states have call successors, (108) Word has length 692 [2025-02-05 21:55:00,943 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-02-05 21:55:00,991 INFO L225 Difference]: With dead ends: 11687 [2025-02-05 21:55:00,992 INFO L226 Difference]: Without dead ends: 8753 [2025-02-05 21:55:01,005 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 7 GetRequests, 4 SyntacticMatches, 0 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=9, Invalid=11, Unknown=0, NotChecked=0, Total=20 [2025-02-05 21:55:01,005 INFO L435 NwaCegarLoop]: 1028 mSDtfsCounter, 894 mSDsluCounter, 1415 mSDsCounter, 0 mSdLazyCounter, 113 mSolverCounterSat, 111 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.3s Time, 0 mProtectedPredicate, 0 mProtectedAction, 894 SdHoareTripleChecker+Valid, 2443 SdHoareTripleChecker+Invalid, 224 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 111 IncrementalHoareTripleChecker+Valid, 113 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.3s IncrementalHoareTripleChecker+Time [2025-02-05 21:55:01,006 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [894 Valid, 2443 Invalid, 224 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [111 Valid, 113 Invalid, 0 Unknown, 0 Unchecked, 0.3s Time] [2025-02-05 21:55:01,013 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 8753 states. [2025-02-05 21:55:01,639 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 8753 to 7045. [2025-02-05 21:55:01,657 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 7045 states, 5116 states have (on average 1.5516028146989835) internal successors, (7938), 5162 states have internal predecessors, (7938), 1878 states have call successors, (1878), 50 states have call predecessors, (1878), 50 states have return successors, (1878), 1832 states have call predecessors, (1878), 1878 states have call successors, (1878) [2025-02-05 21:55:01,692 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 7045 states to 7045 states and 11694 transitions. [2025-02-05 21:55:01,700 INFO L78 Accepts]: Start accepts. Automaton has 7045 states and 11694 transitions. Word has length 692 [2025-02-05 21:55:01,701 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-02-05 21:55:01,701 INFO L471 AbstractCegarLoop]: Abstraction has 7045 states and 11694 transitions. [2025-02-05 21:55:01,705 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 38.75) internal successors, (155), 4 states have internal predecessors, (155), 1 states have call successors, (108), 1 states have call predecessors, (108), 1 states have return successors, (108), 1 states have call predecessors, (108), 1 states have call successors, (108) [2025-02-05 21:55:01,706 INFO L276 IsEmpty]: Start isEmpty. Operand 7045 states and 11694 transitions. [2025-02-05 21:55:01,718 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 693 [2025-02-05 21:55:01,718 INFO L210 NwaCegarLoop]: Found error trace [2025-02-05 21:55:01,719 INFO L218 NwaCegarLoop]: trace histogram [108, 108, 108, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-02-05 21:55:01,719 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable6 [2025-02-05 21:55:01,719 INFO L396 AbstractCegarLoop]: === Iteration 8 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-02-05 21:55:01,720 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-02-05 21:55:01,720 INFO L85 PathProgramCache]: Analyzing trace with hash -351396568, now seen corresponding path program 1 times [2025-02-05 21:55:01,720 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-02-05 21:55:01,720 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [454329569] [2025-02-05 21:55:01,720 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-02-05 21:55:01,720 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-02-05 21:55:01,758 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 692 statements into 1 equivalence classes. [2025-02-05 21:55:01,815 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 692 of 692 statements. [2025-02-05 21:55:01,815 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-02-05 21:55:01,820 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-02-05 21:55:02,590 INFO L134 CoverageAnalysis]: Checked inductivity of 23112 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 23112 trivial. 0 not checked. [2025-02-05 21:55:02,591 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-02-05 21:55:02,591 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [454329569] [2025-02-05 21:55:02,591 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [454329569] provided 1 perfect and 0 imperfect interpolant sequences [2025-02-05 21:55:02,591 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-02-05 21:55:02,591 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2025-02-05 21:55:02,591 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1187949335] [2025-02-05 21:55:02,591 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-02-05 21:55:02,594 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2025-02-05 21:55:02,594 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-02-05 21:55:02,594 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2025-02-05 21:55:02,595 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-02-05 21:55:02,595 INFO L87 Difference]: Start difference. First operand 7045 states and 11694 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, (108), 1 states have call predecessors, (108), 1 states have return successors, (108), 1 states have call predecessors, (108), 1 states have call successors, (108) [2025-02-05 21:55:03,468 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-02-05 21:55:03,469 INFO L93 Difference]: Finished difference Result 20711 states and 34356 transitions. [2025-02-05 21:55:03,469 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2025-02-05 21:55:03,469 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, (108), 1 states have call predecessors, (108), 1 states have return successors, (108), 1 states have call predecessors, (108), 1 states have call successors, (108) Word has length 692 [2025-02-05 21:55:03,470 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-02-05 21:55:03,544 INFO L225 Difference]: With dead ends: 20711 [2025-02-05 21:55:03,544 INFO L226 Difference]: Without dead ends: 13669 [2025-02-05 21:55:03,566 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 4 GetRequests, 3 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-02-05 21:55:03,566 INFO L435 NwaCegarLoop]: 727 mSDtfsCounter, 375 mSDsluCounter, 525 mSDsCounter, 0 mSdLazyCounter, 81 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 375 SdHoareTripleChecker+Valid, 1252 SdHoareTripleChecker+Invalid, 81 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 81 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2025-02-05 21:55:03,566 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [375 Valid, 1252 Invalid, 81 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 81 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2025-02-05 21:55:03,577 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 13669 states. [2025-02-05 21:55:04,498 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 13669 to 13663. [2025-02-05 21:55:04,528 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 13663 states, 9942 states have (on average 1.5477771072218869) internal successors, (15388), 10036 states have internal predecessors, (15388), 3620 states have call successors, (3620), 100 states have call predecessors, (3620), 100 states have return successors, (3620), 3526 states have call predecessors, (3620), 3620 states have call successors, (3620) [2025-02-05 21:55:04,598 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 13663 states to 13663 states and 22628 transitions. [2025-02-05 21:55:04,611 INFO L78 Accepts]: Start accepts. Automaton has 13663 states and 22628 transitions. Word has length 692 [2025-02-05 21:55:04,612 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-02-05 21:55:04,612 INFO L471 AbstractCegarLoop]: Abstraction has 13663 states and 22628 transitions. [2025-02-05 21:55:04,613 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, (108), 1 states have call predecessors, (108), 1 states have return successors, (108), 1 states have call predecessors, (108), 1 states have call successors, (108) [2025-02-05 21:55:04,614 INFO L276 IsEmpty]: Start isEmpty. Operand 13663 states and 22628 transitions. [2025-02-05 21:55:04,634 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 693 [2025-02-05 21:55:04,635 INFO L210 NwaCegarLoop]: Found error trace [2025-02-05 21:55:04,635 INFO L218 NwaCegarLoop]: trace histogram [108, 108, 108, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-02-05 21:55:04,635 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable7 [2025-02-05 21:55:04,635 INFO L396 AbstractCegarLoop]: === Iteration 9 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-02-05 21:55:04,636 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-02-05 21:55:04,637 INFO L85 PathProgramCache]: Analyzing trace with hash -800093207, now seen corresponding path program 1 times [2025-02-05 21:55:04,637 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-02-05 21:55:04,637 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [770276207] [2025-02-05 21:55:04,637 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-02-05 21:55:04,637 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-02-05 21:55:04,674 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 692 statements into 1 equivalence classes. [2025-02-05 21:55:04,767 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 692 of 692 statements. [2025-02-05 21:55:04,767 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-02-05 21:55:04,767 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-02-05 21:55:05,573 INFO L134 CoverageAnalysis]: Checked inductivity of 23112 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 23112 trivial. 0 not checked. [2025-02-05 21:55:05,574 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-02-05 21:55:05,574 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [770276207] [2025-02-05 21:55:05,574 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [770276207] provided 1 perfect and 0 imperfect interpolant sequences [2025-02-05 21:55:05,574 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-02-05 21:55:05,575 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2025-02-05 21:55:05,575 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1600694610] [2025-02-05 21:55:05,575 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-02-05 21:55:05,575 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2025-02-05 21:55:05,575 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-02-05 21:55:05,576 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2025-02-05 21:55:05,576 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=6, Invalid=6, Unknown=0, NotChecked=0, Total=12 [2025-02-05 21:55:05,576 INFO L87 Difference]: Start difference. First operand 13663 states and 22628 transitions. Second operand has 4 states, 4 states have (on average 38.75) internal successors, (155), 4 states have internal predecessors, (155), 1 states have call successors, (108), 1 states have call predecessors, (108), 1 states have return successors, (108), 1 states have call predecessors, (108), 1 states have call successors, (108) [2025-02-05 21:55:06,702 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-02-05 21:55:06,703 INFO L93 Difference]: Finished difference Result 27345 states and 45290 transitions. [2025-02-05 21:55:06,703 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2025-02-05 21:55:06,704 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 4 states have (on average 38.75) internal successors, (155), 4 states have internal predecessors, (155), 1 states have call successors, (108), 1 states have call predecessors, (108), 1 states have return successors, (108), 1 states have call predecessors, (108), 1 states have call successors, (108) Word has length 692 [2025-02-05 21:55:06,704 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-02-05 21:55:06,762 INFO L225 Difference]: With dead ends: 27345 [2025-02-05 21:55:06,762 INFO L226 Difference]: Without dead ends: 13685 [2025-02-05 21:55:06,799 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 6 GetRequests, 4 SyntacticMatches, 0 SemanticMatches, 2 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=6, Invalid=6, Unknown=0, NotChecked=0, Total=12 [2025-02-05 21:55:06,800 INFO L435 NwaCegarLoop]: 728 mSDtfsCounter, 396 mSDsluCounter, 1090 mSDsCounter, 0 mSdLazyCounter, 280 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.4s Time, 0 mProtectedPredicate, 0 mProtectedAction, 396 SdHoareTripleChecker+Valid, 1818 SdHoareTripleChecker+Invalid, 280 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 280 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.4s IncrementalHoareTripleChecker+Time [2025-02-05 21:55:06,800 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [396 Valid, 1818 Invalid, 280 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 280 Invalid, 0 Unknown, 0 Unchecked, 0.4s Time] [2025-02-05 21:55:06,811 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 13685 states. [2025-02-05 21:55:07,713 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 13685 to 13679. [2025-02-05 21:55:07,732 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 13679 states, 9958 states have (on average 1.5468969672625026) internal successors, (15404), 10052 states have internal predecessors, (15404), 3620 states have call successors, (3620), 100 states have call predecessors, (3620), 100 states have return successors, (3620), 3526 states have call predecessors, (3620), 3620 states have call successors, (3620) [2025-02-05 21:55:07,778 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 13679 states to 13679 states and 22644 transitions. [2025-02-05 21:55:07,794 INFO L78 Accepts]: Start accepts. Automaton has 13679 states and 22644 transitions. Word has length 692 [2025-02-05 21:55:07,795 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-02-05 21:55:07,795 INFO L471 AbstractCegarLoop]: Abstraction has 13679 states and 22644 transitions. [2025-02-05 21:55:07,795 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 38.75) internal successors, (155), 4 states have internal predecessors, (155), 1 states have call successors, (108), 1 states have call predecessors, (108), 1 states have return successors, (108), 1 states have call predecessors, (108), 1 states have call successors, (108) [2025-02-05 21:55:07,796 INFO L276 IsEmpty]: Start isEmpty. Operand 13679 states and 22644 transitions. [2025-02-05 21:55:07,812 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 693 [2025-02-05 21:55:07,812 INFO L210 NwaCegarLoop]: Found error trace [2025-02-05 21:55:07,812 INFO L218 NwaCegarLoop]: trace histogram [108, 108, 108, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-02-05 21:55:07,813 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable8 [2025-02-05 21:55:07,813 INFO L396 AbstractCegarLoop]: === Iteration 10 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-02-05 21:55:07,816 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-02-05 21:55:07,816 INFO L85 PathProgramCache]: Analyzing trace with hash -1008791510, now seen corresponding path program 1 times [2025-02-05 21:55:07,816 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-02-05 21:55:07,816 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [322233840] [2025-02-05 21:55:07,816 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-02-05 21:55:07,817 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-02-05 21:55:07,853 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 692 statements into 1 equivalence classes. [2025-02-05 21:55:07,883 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 692 of 692 statements. [2025-02-05 21:55:07,883 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-02-05 21:55:07,883 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-02-05 21:55:08,818 INFO L134 CoverageAnalysis]: Checked inductivity of 23112 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 23112 trivial. 0 not checked. [2025-02-05 21:55:08,818 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-02-05 21:55:08,819 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [322233840] [2025-02-05 21:55:08,819 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [322233840] provided 1 perfect and 0 imperfect interpolant sequences [2025-02-05 21:55:08,819 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-02-05 21:55:08,819 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [8] imperfect sequences [] total 8 [2025-02-05 21:55:08,819 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1112966784] [2025-02-05 21:55:08,819 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-02-05 21:55:08,820 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 8 states [2025-02-05 21:55:08,820 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-02-05 21:55:08,821 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2025-02-05 21:55:08,821 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=20, Invalid=36, Unknown=0, NotChecked=0, Total=56 [2025-02-05 21:55:08,821 INFO L87 Difference]: Start difference. First operand 13679 states and 22644 transitions. Second operand has 8 states, 8 states have (on average 19.375) internal successors, (155), 8 states have internal predecessors, (155), 1 states have call successors, (108), 1 states have call predecessors, (108), 1 states have return successors, (108), 1 states have call predecessors, (108), 1 states have call successors, (108) [2025-02-05 21:55:12,882 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-02-05 21:55:12,883 INFO L93 Difference]: Finished difference Result 40473 states and 66892 transitions. [2025-02-05 21:55:12,883 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2025-02-05 21:55:12,884 INFO L78 Accepts]: Start accepts. Automaton has has 8 states, 8 states have (on average 19.375) internal successors, (155), 8 states have internal predecessors, (155), 1 states have call successors, (108), 1 states have call predecessors, (108), 1 states have return successors, (108), 1 states have call predecessors, (108), 1 states have call successors, (108) Word has length 692 [2025-02-05 21:55:12,885 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-02-05 21:55:13,043 INFO L225 Difference]: With dead ends: 40473 [2025-02-05 21:55:13,044 INFO L226 Difference]: Without dead ends: 26789 [2025-02-05 21:55:13,108 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 13 GetRequests, 5 SyntacticMatches, 0 SemanticMatches, 8 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 6 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=34, Invalid=56, Unknown=0, NotChecked=0, Total=90 [2025-02-05 21:55:13,108 INFO L435 NwaCegarLoop]: 795 mSDtfsCounter, 1409 mSDsluCounter, 2232 mSDsCounter, 0 mSdLazyCounter, 1384 mSolverCounterSat, 551 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 1.6s Time, 0 mProtectedPredicate, 0 mProtectedAction, 1409 SdHoareTripleChecker+Valid, 3027 SdHoareTripleChecker+Invalid, 1935 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 551 IncrementalHoareTripleChecker+Valid, 1384 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 1.9s IncrementalHoareTripleChecker+Time [2025-02-05 21:55:13,109 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [1409 Valid, 3027 Invalid, 1935 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [551 Valid, 1384 Invalid, 0 Unknown, 0 Unchecked, 1.9s Time] [2025-02-05 21:55:13,144 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 26789 states. [2025-02-05 21:55:14,679 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 26789 to 20433. [2025-02-05 21:55:14,712 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 20433 states, 14944 states have (on average 1.5467077087794432) internal successors, (23114), 15086 states have internal predecessors, (23114), 5338 states have call successors, (5338), 150 states have call predecessors, (5338), 150 states have return successors, (5338), 5196 states have call predecessors, (5338), 5338 states have call successors, (5338) [2025-02-05 21:55:14,783 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 20433 states to 20433 states and 33790 transitions. [2025-02-05 21:55:14,814 INFO L78 Accepts]: Start accepts. Automaton has 20433 states and 33790 transitions. Word has length 692 [2025-02-05 21:55:14,815 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-02-05 21:55:14,815 INFO L471 AbstractCegarLoop]: Abstraction has 20433 states and 33790 transitions. [2025-02-05 21:55:14,815 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 8 states, 8 states have (on average 19.375) internal successors, (155), 8 states have internal predecessors, (155), 1 states have call successors, (108), 1 states have call predecessors, (108), 1 states have return successors, (108), 1 states have call predecessors, (108), 1 states have call successors, (108) [2025-02-05 21:55:14,815 INFO L276 IsEmpty]: Start isEmpty. Operand 20433 states and 33790 transitions. [2025-02-05 21:55:14,833 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 694 [2025-02-05 21:55:14,833 INFO L210 NwaCegarLoop]: Found error trace [2025-02-05 21:55:14,834 INFO L218 NwaCegarLoop]: trace histogram [108, 108, 108, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-02-05 21:55:14,834 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable9 [2025-02-05 21:55:14,834 INFO L396 AbstractCegarLoop]: === Iteration 11 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-02-05 21:55:14,835 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-02-05 21:55:14,835 INFO L85 PathProgramCache]: Analyzing trace with hash -248152429, now seen corresponding path program 1 times [2025-02-05 21:55:14,835 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-02-05 21:55:14,835 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [187940727] [2025-02-05 21:55:14,835 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-02-05 21:55:14,835 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-02-05 21:55:14,866 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 693 statements into 1 equivalence classes. [2025-02-05 21:55:14,890 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 693 of 693 statements. [2025-02-05 21:55:14,891 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-02-05 21:55:14,891 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-02-05 21:55:15,121 INFO L134 CoverageAnalysis]: Checked inductivity of 23112 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 23112 trivial. 0 not checked. [2025-02-05 21:55:15,122 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-02-05 21:55:15,122 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [187940727] [2025-02-05 21:55:15,122 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [187940727] provided 1 perfect and 0 imperfect interpolant sequences [2025-02-05 21:55:15,122 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-02-05 21:55:15,122 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2025-02-05 21:55:15,122 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1252003171] [2025-02-05 21:55:15,122 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-02-05 21:55:15,123 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2025-02-05 21:55:15,123 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-02-05 21:55:15,123 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2025-02-05 21:55:15,123 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=6, Invalid=6, Unknown=0, NotChecked=0, Total=12 [2025-02-05 21:55:15,124 INFO L87 Difference]: Start difference. First operand 20433 states and 33790 transitions. Second operand has 4 states, 4 states have (on average 39.0) internal successors, (156), 4 states have internal predecessors, (156), 1 states have call successors, (108), 1 states have call predecessors, (108), 1 states have return successors, (108), 1 states have call predecessors, (108), 1 states have call successors, (108) [2025-02-05 21:55:16,834 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-02-05 21:55:16,834 INFO L93 Difference]: Finished difference Result 51312 states and 84913 transitions. [2025-02-05 21:55:16,834 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2025-02-05 21:55:16,834 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 4 states have (on average 39.0) internal successors, (156), 4 states have internal predecessors, (156), 1 states have call successors, (108), 1 states have call predecessors, (108), 1 states have return successors, (108), 1 states have call predecessors, (108), 1 states have call successors, (108) Word has length 693 [2025-02-05 21:55:16,835 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-02-05 21:55:16,965 INFO L225 Difference]: With dead ends: 51312 [2025-02-05 21:55:16,966 INFO L226 Difference]: Without dead ends: 30874 [2025-02-05 21:55:17,018 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 5 GetRequests, 3 SyntacticMatches, 0 SemanticMatches, 2 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=6, Invalid=6, Unknown=0, NotChecked=0, Total=12 [2025-02-05 21:55:17,019 INFO L435 NwaCegarLoop]: 949 mSDtfsCounter, 555 mSDsluCounter, 1256 mSDsCounter, 0 mSdLazyCounter, 324 mSolverCounterSat, 1 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 555 SdHoareTripleChecker+Valid, 2205 SdHoareTripleChecker+Invalid, 325 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 1 IncrementalHoareTripleChecker+Valid, 324 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.3s IncrementalHoareTripleChecker+Time [2025-02-05 21:55:17,019 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [555 Valid, 2205 Invalid, 325 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [1 Valid, 324 Invalid, 0 Unknown, 0 Unchecked, 0.3s Time] [2025-02-05 21:55:17,036 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 30874 states. [2025-02-05 21:55:19,066 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 30874 to 21921. [2025-02-05 21:55:19,098 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 21921 states, 16432 states have (on average 1.568524829600779) internal successors, (25774), 16574 states have internal predecessors, (25774), 5338 states have call successors, (5338), 150 states have call predecessors, (5338), 150 states have return successors, (5338), 5196 states have call predecessors, (5338), 5338 states have call successors, (5338) [2025-02-05 21:55:19,191 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 21921 states to 21921 states and 36450 transitions. [2025-02-05 21:55:19,235 INFO L78 Accepts]: Start accepts. Automaton has 21921 states and 36450 transitions. Word has length 693 [2025-02-05 21:55:19,238 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-02-05 21:55:19,239 INFO L471 AbstractCegarLoop]: Abstraction has 21921 states and 36450 transitions. [2025-02-05 21:55:19,239 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 39.0) internal successors, (156), 4 states have internal predecessors, (156), 1 states have call successors, (108), 1 states have call predecessors, (108), 1 states have return successors, (108), 1 states have call predecessors, (108), 1 states have call successors, (108) [2025-02-05 21:55:19,239 INFO L276 IsEmpty]: Start isEmpty. Operand 21921 states and 36450 transitions. [2025-02-05 21:55:19,269 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 694 [2025-02-05 21:55:19,269 INFO L210 NwaCegarLoop]: Found error trace [2025-02-05 21:55:19,270 INFO L218 NwaCegarLoop]: trace histogram [108, 108, 108, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-02-05 21:55:19,270 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable10 [2025-02-05 21:55:19,270 INFO L396 AbstractCegarLoop]: === Iteration 12 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-02-05 21:55:19,270 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-02-05 21:55:19,271 INFO L85 PathProgramCache]: Analyzing trace with hash -905547371, now seen corresponding path program 1 times [2025-02-05 21:55:19,271 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-02-05 21:55:19,271 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [356494888] [2025-02-05 21:55:19,271 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-02-05 21:55:19,271 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-02-05 21:55:19,305 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 693 statements into 1 equivalence classes. [2025-02-05 21:55:19,342 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 693 of 693 statements. [2025-02-05 21:55:19,343 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-02-05 21:55:19,343 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-02-05 21:55:19,741 INFO L134 CoverageAnalysis]: Checked inductivity of 23112 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 23112 trivial. 0 not checked. [2025-02-05 21:55:19,741 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-02-05 21:55:19,741 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [356494888] [2025-02-05 21:55:19,742 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [356494888] provided 1 perfect and 0 imperfect interpolant sequences [2025-02-05 21:55:19,742 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-02-05 21:55:19,742 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2025-02-05 21:55:19,742 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [462173053] [2025-02-05 21:55:19,742 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-02-05 21:55:19,743 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2025-02-05 21:55:19,743 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-02-05 21:55:19,744 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2025-02-05 21:55:19,744 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-02-05 21:55:19,744 INFO L87 Difference]: Start difference. First operand 21921 states and 36450 transitions. Second operand has 3 states, 3 states have (on average 52.0) internal successors, (156), 3 states have internal predecessors, (156), 1 states have call successors, (108), 1 states have call predecessors, (108), 1 states have return successors, (108), 1 states have call predecessors, (108), 1 states have call successors, (108) [2025-02-05 21:55:21,859 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-02-05 21:55:21,859 INFO L93 Difference]: Finished difference Result 64269 states and 106684 transitions. [2025-02-05 21:55:21,860 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2025-02-05 21:55:21,860 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 52.0) internal successors, (156), 3 states have internal predecessors, (156), 1 states have call successors, (108), 1 states have call predecessors, (108), 1 states have return successors, (108), 1 states have call predecessors, (108), 1 states have call successors, (108) Word has length 693 [2025-02-05 21:55:21,860 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-02-05 21:55:22,037 INFO L225 Difference]: With dead ends: 64269 [2025-02-05 21:55:22,037 INFO L226 Difference]: Without dead ends: 42351 [2025-02-05 21:55:22,103 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 3 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-02-05 21:55:22,104 INFO L435 NwaCegarLoop]: 557 mSDtfsCounter, 380 mSDsluCounter, 552 mSDsCounter, 0 mSdLazyCounter, 28 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 380 SdHoareTripleChecker+Valid, 1109 SdHoareTripleChecker+Invalid, 28 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 28 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2025-02-05 21:55:22,104 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [380 Valid, 1109 Invalid, 28 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 28 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2025-02-05 21:55:22,129 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 42351 states. [2025-02-05 21:55:24,942 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 42351 to 42349. [2025-02-05 21:55:24,984 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 42349 states, 31372 states have (on average 1.5578222618895832) internal successors, (48872), 31656 states have internal predecessors, (48872), 10676 states have call successors, (10676), 300 states have call predecessors, (10676), 300 states have return successors, (10676), 10392 states have call predecessors, (10676), 10676 states have call successors, (10676) [2025-02-05 21:55:25,147 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 42349 states to 42349 states and 70224 transitions. [2025-02-05 21:55:25,191 INFO L78 Accepts]: Start accepts. Automaton has 42349 states and 70224 transitions. Word has length 693 [2025-02-05 21:55:25,192 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-02-05 21:55:25,192 INFO L471 AbstractCegarLoop]: Abstraction has 42349 states and 70224 transitions. [2025-02-05 21:55:25,192 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 52.0) internal successors, (156), 3 states have internal predecessors, (156), 1 states have call successors, (108), 1 states have call predecessors, (108), 1 states have return successors, (108), 1 states have call predecessors, (108), 1 states have call successors, (108) [2025-02-05 21:55:25,193 INFO L276 IsEmpty]: Start isEmpty. Operand 42349 states and 70224 transitions. [2025-02-05 21:55:25,232 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 694 [2025-02-05 21:55:25,232 INFO L210 NwaCegarLoop]: Found error trace [2025-02-05 21:55:25,233 INFO L218 NwaCegarLoop]: trace histogram [108, 108, 108, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-02-05 21:55:25,233 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable11 [2025-02-05 21:55:25,233 INFO L396 AbstractCegarLoop]: === Iteration 13 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-02-05 21:55:25,233 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-02-05 21:55:25,234 INFO L85 PathProgramCache]: Analyzing trace with hash -1203673708, now seen corresponding path program 1 times [2025-02-05 21:55:25,234 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-02-05 21:55:25,234 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1110163201] [2025-02-05 21:55:25,234 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-02-05 21:55:25,234 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-02-05 21:55:25,268 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 693 statements into 1 equivalence classes. [2025-02-05 21:55:25,421 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 693 of 693 statements. [2025-02-05 21:55:25,423 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-02-05 21:55:25,423 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-02-05 21:55:25,793 INFO L134 CoverageAnalysis]: Checked inductivity of 23112 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 23112 trivial. 0 not checked. [2025-02-05 21:55:25,793 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-02-05 21:55:25,794 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1110163201] [2025-02-05 21:55:25,794 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1110163201] provided 1 perfect and 0 imperfect interpolant sequences [2025-02-05 21:55:25,794 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-02-05 21:55:25,794 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2025-02-05 21:55:25,794 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1539443737] [2025-02-05 21:55:25,794 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-02-05 21:55:25,795 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2025-02-05 21:55:25,795 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-02-05 21:55:25,796 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2025-02-05 21:55:25,796 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-02-05 21:55:25,796 INFO L87 Difference]: Start difference. First operand 42349 states and 70224 transitions. Second operand has 3 states, 3 states have (on average 52.0) internal successors, (156), 3 states have internal predecessors, (156), 1 states have call successors, (108), 1 states have call predecessors, (108), 1 states have return successors, (108), 1 states have call predecessors, (108), 1 states have call successors, (108) [2025-02-05 21:55:29,561 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-02-05 21:55:29,561 INFO L93 Difference]: Finished difference Result 103553 states and 171698 transitions. [2025-02-05 21:55:29,562 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2025-02-05 21:55:29,562 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 52.0) internal successors, (156), 3 states have internal predecessors, (156), 1 states have call successors, (108), 1 states have call predecessors, (108), 1 states have return successors, (108), 1 states have call predecessors, (108), 1 states have call successors, (108) Word has length 693 [2025-02-05 21:55:29,563 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-02-05 21:55:29,923 INFO L225 Difference]: With dead ends: 103553 [2025-02-05 21:55:29,923 INFO L226 Difference]: Without dead ends: 61207 [2025-02-05 21:55:30,099 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 3 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-02-05 21:55:30,101 INFO L435 NwaCegarLoop]: 577 mSDtfsCounter, 204 mSDsluCounter, 527 mSDsCounter, 0 mSdLazyCounter, 56 mSolverCounterSat, 2 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 204 SdHoareTripleChecker+Valid, 1104 SdHoareTripleChecker+Invalid, 58 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 2 IncrementalHoareTripleChecker+Valid, 56 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2025-02-05 21:55:30,101 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [204 Valid, 1104 Invalid, 58 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [2 Valid, 56 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2025-02-05 21:55:30,149 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 61207 states. [2025-02-05 21:55:34,279 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 61207 to 43549. [2025-02-05 21:55:34,325 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 43549 states, 32572 states have (on average 1.5722706619182119) internal successors, (51212), 32856 states have internal predecessors, (51212), 10676 states have call successors, (10676), 300 states have call predecessors, (10676), 300 states have return successors, (10676), 10392 states have call predecessors, (10676), 10676 states have call successors, (10676) [2025-02-05 21:55:34,460 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 43549 states to 43549 states and 72564 transitions. [2025-02-05 21:55:34,554 INFO L78 Accepts]: Start accepts. Automaton has 43549 states and 72564 transitions. Word has length 693 [2025-02-05 21:55:34,554 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-02-05 21:55:34,554 INFO L471 AbstractCegarLoop]: Abstraction has 43549 states and 72564 transitions. [2025-02-05 21:55:34,554 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 52.0) internal successors, (156), 3 states have internal predecessors, (156), 1 states have call successors, (108), 1 states have call predecessors, (108), 1 states have return successors, (108), 1 states have call predecessors, (108), 1 states have call successors, (108) [2025-02-05 21:55:34,555 INFO L276 IsEmpty]: Start isEmpty. Operand 43549 states and 72564 transitions. [2025-02-05 21:55:34,589 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 694 [2025-02-05 21:55:34,590 INFO L210 NwaCegarLoop]: Found error trace [2025-02-05 21:55:34,590 INFO L218 NwaCegarLoop]: trace histogram [108, 108, 108, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-02-05 21:55:34,590 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable12 [2025-02-05 21:55:34,590 INFO L396 AbstractCegarLoop]: === Iteration 14 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-02-05 21:55:34,591 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-02-05 21:55:34,591 INFO L85 PathProgramCache]: Analyzing trace with hash -1102761741, now seen corresponding path program 1 times [2025-02-05 21:55:34,591 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-02-05 21:55:34,591 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [197076608] [2025-02-05 21:55:34,591 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-02-05 21:55:34,591 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-02-05 21:55:34,617 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 693 statements into 1 equivalence classes. [2025-02-05 21:55:34,902 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 693 of 693 statements. [2025-02-05 21:55:34,902 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-02-05 21:55:34,902 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-02-05 21:55:36,132 INFO L134 CoverageAnalysis]: Checked inductivity of 23112 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 23112 trivial. 0 not checked. [2025-02-05 21:55:36,132 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-02-05 21:55:36,132 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [197076608] [2025-02-05 21:55:36,133 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [197076608] provided 1 perfect and 0 imperfect interpolant sequences [2025-02-05 21:55:36,133 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-02-05 21:55:36,133 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2025-02-05 21:55:36,133 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1433530204] [2025-02-05 21:55:36,134 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-02-05 21:55:36,135 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2025-02-05 21:55:36,135 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-02-05 21:55:36,136 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2025-02-05 21:55:36,136 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2025-02-05 21:55:36,136 INFO L87 Difference]: Start difference. First operand 43549 states and 72564 transitions. Second operand has 5 states, 5 states have (on average 31.2) internal successors, (156), 5 states have internal predecessors, (156), 1 states have call successors, (108), 1 states have call predecessors, (108), 1 states have return successors, (108), 1 states have call predecessors, (108), 1 states have call successors, (108) [2025-02-05 21:55:39,444 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-02-05 21:55:39,444 INFO L93 Difference]: Finished difference Result 112903 states and 189493 transitions. [2025-02-05 21:55:39,444 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2025-02-05 21:55:39,445 INFO L78 Accepts]: Start accepts. Automaton has has 5 states, 5 states have (on average 31.2) internal successors, (156), 5 states have internal predecessors, (156), 1 states have call successors, (108), 1 states have call predecessors, (108), 1 states have return successors, (108), 1 states have call predecessors, (108), 1 states have call successors, (108) Word has length 693 [2025-02-05 21:55:39,445 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-02-05 21:55:39,641 INFO L225 Difference]: With dead ends: 112903 [2025-02-05 21:55:39,642 INFO L226 Difference]: Without dead ends: 69357 [2025-02-05 21:55:39,743 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 10 GetRequests, 5 SyntacticMatches, 0 SemanticMatches, 5 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=17, Invalid=25, Unknown=0, NotChecked=0, Total=42 [2025-02-05 21:55:39,744 INFO L435 NwaCegarLoop]: 552 mSDtfsCounter, 541 mSDsluCounter, 1425 mSDsCounter, 0 mSdLazyCounter, 297 mSolverCounterSat, 325 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.6s Time, 0 mProtectedPredicate, 0 mProtectedAction, 541 SdHoareTripleChecker+Valid, 1977 SdHoareTripleChecker+Invalid, 622 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 325 IncrementalHoareTripleChecker+Valid, 297 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.8s IncrementalHoareTripleChecker+Time [2025-02-05 21:55:39,744 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [541 Valid, 1977 Invalid, 622 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [325 Valid, 297 Invalid, 0 Unknown, 0 Unchecked, 0.8s Time] [2025-02-05 21:55:39,799 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 69357 states. [2025-02-05 21:55:42,999 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 69357 to 65035. [2025-02-05 21:55:43,053 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 65035 states, 53944 states have (on average 1.6343430223935933) internal successors, (88163), 54228 states have internal predecessors, (88163), 10784 states have call successors, (10784), 306 states have call predecessors, (10784), 306 states have return successors, (10784), 10500 states have call predecessors, (10784), 10784 states have call successors, (10784) [2025-02-05 21:55:43,223 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 65035 states to 65035 states and 109731 transitions. [2025-02-05 21:55:43,286 INFO L78 Accepts]: Start accepts. Automaton has 65035 states and 109731 transitions. Word has length 693 [2025-02-05 21:55:43,287 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-02-05 21:55:43,288 INFO L471 AbstractCegarLoop]: Abstraction has 65035 states and 109731 transitions. [2025-02-05 21:55:43,288 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 31.2) internal successors, (156), 5 states have internal predecessors, (156), 1 states have call successors, (108), 1 states have call predecessors, (108), 1 states have return successors, (108), 1 states have call predecessors, (108), 1 states have call successors, (108) [2025-02-05 21:55:43,288 INFO L276 IsEmpty]: Start isEmpty. Operand 65035 states and 109731 transitions. [2025-02-05 21:55:43,365 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 695 [2025-02-05 21:55:43,365 INFO L210 NwaCegarLoop]: Found error trace [2025-02-05 21:55:43,366 INFO L218 NwaCegarLoop]: trace histogram [108, 108, 108, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-02-05 21:55:43,366 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable13 [2025-02-05 21:55:43,366 INFO L396 AbstractCegarLoop]: === Iteration 15 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-02-05 21:55:43,367 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-02-05 21:55:43,371 INFO L85 PathProgramCache]: Analyzing trace with hash -597657129, now seen corresponding path program 1 times [2025-02-05 21:55:43,371 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-02-05 21:55:43,371 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1621939201] [2025-02-05 21:55:43,371 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-02-05 21:55:43,371 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-02-05 21:55:43,424 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 694 statements into 1 equivalence classes. [2025-02-05 21:55:43,946 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 694 of 694 statements. [2025-02-05 21:55:43,947 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-02-05 21:55:43,947 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-02-05 21:55:44,398 INFO L134 CoverageAnalysis]: Checked inductivity of 23112 backedges. 129 proven. 192 refuted. 0 times theorem prover too weak. 22791 trivial. 0 not checked. [2025-02-05 21:55:44,399 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-02-05 21:55:44,400 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1621939201] [2025-02-05 21:55:44,400 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1621939201] provided 0 perfect and 1 imperfect interpolant sequences [2025-02-05 21:55:44,400 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [800452575] [2025-02-05 21:55:44,400 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-02-05 21:55:44,400 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-02-05 21:55:44,400 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 [2025-02-05 21:55:44,406 INFO L229 MonitoredProcess]: Starting monitored process 2 with /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2025-02-05 21:55:44,407 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (2)] Waiting until timeout for monitored process [2025-02-05 21:55:44,575 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 694 statements into 1 equivalence classes. [2025-02-05 21:55:44,714 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 694 of 694 statements. [2025-02-05 21:55:44,714 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-02-05 21:55:44,715 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-02-05 21:55:44,726 INFO L256 TraceCheckSpWp]: Trace formula consists of 1563 conjuncts, 7 conjuncts are in the unsatisfiable core [2025-02-05 21:55:44,749 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-02-05 21:55:45,297 INFO L134 CoverageAnalysis]: Checked inductivity of 23112 backedges. 11357 proven. 186 refuted. 0 times theorem prover too weak. 11569 trivial. 0 not checked. [2025-02-05 21:55:45,297 INFO L312 TraceCheckSpWp]: Computing backward predicates... [2025-02-05 21:55:46,024 INFO L134 CoverageAnalysis]: Checked inductivity of 23112 backedges. 135 proven. 186 refuted. 0 times theorem prover too weak. 22791 trivial. 0 not checked. [2025-02-05 21:55:46,024 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [800452575] provided 0 perfect and 2 imperfect interpolant sequences [2025-02-05 21:55:46,024 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2025-02-05 21:55:46,025 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [6, 6, 6] total 11 [2025-02-05 21:55:46,025 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [822455133] [2025-02-05 21:55:46,025 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2025-02-05 21:55:46,027 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 11 states [2025-02-05 21:55:46,028 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-02-05 21:55:46,029 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 11 interpolants. [2025-02-05 21:55:46,029 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=29, Invalid=81, Unknown=0, NotChecked=0, Total=110 [2025-02-05 21:55:46,029 INFO L87 Difference]: Start difference. First operand 65035 states and 109731 transitions. Second operand has 11 states, 11 states have (on average 27.90909090909091) internal successors, (307), 11 states have internal predecessors, (307), 4 states have call successors, (234), 2 states have call predecessors, (234), 4 states have return successors, (236), 4 states have call predecessors, (236), 4 states have call successors, (236) [2025-02-05 21:55:50,846 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-02-05 21:55:50,847 INFO L93 Difference]: Finished difference Result 115727 states and 193516 transitions. [2025-02-05 21:55:50,847 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 22 states. [2025-02-05 21:55:50,847 INFO L78 Accepts]: Start accepts. Automaton has has 11 states, 11 states have (on average 27.90909090909091) internal successors, (307), 11 states have internal predecessors, (307), 4 states have call successors, (234), 2 states have call predecessors, (234), 4 states have return successors, (236), 4 states have call predecessors, (236), 4 states have call successors, (236) Word has length 694 [2025-02-05 21:55:50,848 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-02-05 21:55:51,087 INFO L225 Difference]: With dead ends: 115727 [2025-02-05 21:55:51,088 INFO L226 Difference]: Without dead ends: 65941 [2025-02-05 21:55:51,235 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 1412 GetRequests, 1384 SyntacticMatches, 1 SemanticMatches, 27 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 143 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=231, Invalid=581, Unknown=0, NotChecked=0, Total=812 [2025-02-05 21:55:51,236 INFO L435 NwaCegarLoop]: 662 mSDtfsCounter, 920 mSDsluCounter, 1360 mSDsCounter, 0 mSdLazyCounter, 1455 mSolverCounterSat, 473 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.8s Time, 0 mProtectedPredicate, 0 mProtectedAction, 921 SdHoareTripleChecker+Valid, 2022 SdHoareTripleChecker+Invalid, 1928 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 473 IncrementalHoareTripleChecker+Valid, 1455 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 1.0s IncrementalHoareTripleChecker+Time [2025-02-05 21:55:51,236 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [921 Valid, 2022 Invalid, 1928 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [473 Valid, 1455 Invalid, 0 Unknown, 0 Unchecked, 1.0s Time] [2025-02-05 21:55:51,282 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 65941 states. [2025-02-05 21:55:54,741 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 65941 to 62755. [2025-02-05 21:55:54,793 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 62755 states, 51590 states have (on average 1.6176972281449893) internal successors, (83457), 51874 states have internal predecessors, (83457), 10784 states have call successors, (10784), 380 states have call predecessors, (10784), 380 states have return successors, (10784), 10500 states have call predecessors, (10784), 10784 states have call successors, (10784) [2025-02-05 21:55:54,942 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 62755 states to 62755 states and 105025 transitions. [2025-02-05 21:55:54,996 INFO L78 Accepts]: Start accepts. Automaton has 62755 states and 105025 transitions. Word has length 694 [2025-02-05 21:55:54,997 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-02-05 21:55:54,997 INFO L471 AbstractCegarLoop]: Abstraction has 62755 states and 105025 transitions. [2025-02-05 21:55:54,997 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 11 states, 11 states have (on average 27.90909090909091) internal successors, (307), 11 states have internal predecessors, (307), 4 states have call successors, (234), 2 states have call predecessors, (234), 4 states have return successors, (236), 4 states have call predecessors, (236), 4 states have call successors, (236) [2025-02-05 21:55:54,997 INFO L276 IsEmpty]: Start isEmpty. Operand 62755 states and 105025 transitions. [2025-02-05 21:55:55,023 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 695 [2025-02-05 21:55:55,023 INFO L210 NwaCegarLoop]: Found error trace [2025-02-05 21:55:55,024 INFO L218 NwaCegarLoop]: trace histogram [108, 108, 108, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-02-05 21:55:55,041 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (2)] Ended with exit code 0 [2025-02-05 21:55:55,224 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 2 /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable14 [2025-02-05 21:55:55,224 INFO L396 AbstractCegarLoop]: === Iteration 16 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-02-05 21:55:55,225 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-02-05 21:55:55,225 INFO L85 PathProgramCache]: Analyzing trace with hash -1622351050, now seen corresponding path program 1 times [2025-02-05 21:55:55,225 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-02-05 21:55:55,225 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [125965789] [2025-02-05 21:55:55,225 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-02-05 21:55:55,225 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-02-05 21:55:55,257 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 694 statements into 1 equivalence classes. [2025-02-05 21:55:55,514 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 694 of 694 statements. [2025-02-05 21:55:55,514 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-02-05 21:55:55,514 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-02-05 21:55:55,871 INFO L134 CoverageAnalysis]: Checked inductivity of 23112 backedges. 129 proven. 192 refuted. 0 times theorem prover too weak. 22791 trivial. 0 not checked. [2025-02-05 21:55:55,871 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-02-05 21:55:55,871 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [125965789] [2025-02-05 21:55:55,871 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [125965789] provided 0 perfect and 1 imperfect interpolant sequences [2025-02-05 21:55:55,872 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1281406220] [2025-02-05 21:55:55,872 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-02-05 21:55:55,872 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-02-05 21:55:55,872 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 [2025-02-05 21:55:55,874 INFO L229 MonitoredProcess]: Starting monitored process 3 with /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2025-02-05 21:55:55,877 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (3)] Waiting until timeout for monitored process [2025-02-05 21:55:56,092 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 694 statements into 1 equivalence classes. [2025-02-05 21:55:56,216 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 694 of 694 statements. [2025-02-05 21:55:56,216 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-02-05 21:55:56,216 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-02-05 21:55:56,223 INFO L256 TraceCheckSpWp]: Trace formula consists of 1563 conjuncts, 8 conjuncts are in the unsatisfiable core [2025-02-05 21:55:56,231 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-02-05 21:55:56,744 INFO L134 CoverageAnalysis]: Checked inductivity of 23112 backedges. 11357 proven. 186 refuted. 0 times theorem prover too weak. 11569 trivial. 0 not checked. [2025-02-05 21:55:56,744 INFO L312 TraceCheckSpWp]: Computing backward predicates... [2025-02-05 21:55:57,219 INFO L134 CoverageAnalysis]: Checked inductivity of 23112 backedges. 135 proven. 186 refuted. 0 times theorem prover too weak. 22791 trivial. 0 not checked. [2025-02-05 21:55:57,219 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1281406220] provided 0 perfect and 2 imperfect interpolant sequences [2025-02-05 21:55:57,219 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2025-02-05 21:55:57,219 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [7, 7, 7] total 12 [2025-02-05 21:55:57,219 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1076130147] [2025-02-05 21:55:57,219 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2025-02-05 21:55:57,220 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 12 states [2025-02-05 21:55:57,220 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-02-05 21:55:57,221 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 12 interpolants. [2025-02-05 21:55:57,221 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=32, Invalid=100, Unknown=0, NotChecked=0, Total=132 [2025-02-05 21:55:57,221 INFO L87 Difference]: Start difference. First operand 62755 states and 105025 transitions. Second operand has 12 states, 12 states have (on average 19.083333333333332) internal successors, (229), 12 states have internal predecessors, (229), 3 states have call successors, (234), 2 states have call predecessors, (234), 4 states have return successors, (236), 3 states have call predecessors, (236), 3 states have call successors, (236)