./Ultimate.py --spec ../sv-benchmarks/c/properties/unreach-call.prp --file ../sv-benchmarks/c/hardness-nfm22/hardness_fillercode_fillercodesize_ps-cn-250_file-81.i --full-output --architecture 32bit -------------------------------------------------------------------------------- Checking for ERROR reachability Using default analysis Version 8fc3dc66 Calling Ultimate with: /root/.sdkman/candidates/java/21.0.5-tem/bin/java -Dosgi.configuration.area=/storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/config -Xmx15G -Xms4m -jar /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/plugins/org.eclipse.equinox.launcher_1.6.800.v20240513-1750.jar -data @noDefault -ultimatedata /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data -tc /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/config/AutomizerReach.xml -i ../sv-benchmarks/c/hardness-nfm22/hardness_fillercode_fillercodesize_ps-cn-250_file-81.i -s /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/config/svcomp-Reach-32bit-Automizer_Default.epf --cacsl2boogietranslator.entry.function main --witnessprinter.witness.directory /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux --witnessprinter.witness.filename witness --witnessprinter.write.witness.besides.input.file false --witnessprinter.graph.data.specification CHECK( init(main()), LTL(G ! call(reach_error())) ) --witnessprinter.graph.data.producer Automizer --witnessprinter.graph.data.architecture 32bit --witnessprinter.graph.data.programhash bec7db2d8bcad481bf37cc90d23f2eda8abfeabb35b205024dfceac80e64e988 --- Real Ultimate output --- This is Ultimate 0.3.0-?-8fc3dc6-m [2025-03-17 00:10:22,730 INFO L188 SettingsManager]: Resetting all preferences to default values... [2025-03-17 00:10:22,785 INFO L114 SettingsManager]: Loading settings from /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/config/svcomp-Reach-32bit-Automizer_Default.epf [2025-03-17 00:10:22,788 WARN L101 SettingsManager]: Preference file contains the following unknown settings: [2025-03-17 00:10:22,788 WARN L103 SettingsManager]: * de.uni_freiburg.informatik.ultimate.core.Log level for class [2025-03-17 00:10:22,816 INFO L130 SettingsManager]: Preferences different from defaults after loading the file: [2025-03-17 00:10:22,817 INFO L151 SettingsManager]: Preferences of UltimateCore differ from their defaults: [2025-03-17 00:10:22,817 INFO L153 SettingsManager]: * Log level for class=de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher=ERROR; [2025-03-17 00:10:22,817 INFO L151 SettingsManager]: Preferences of Boogie Preprocessor differ from their defaults: [2025-03-17 00:10:22,817 INFO L153 SettingsManager]: * Use memory slicer=true [2025-03-17 00:10:22,817 INFO L151 SettingsManager]: Preferences of Boogie Procedure Inliner differ from their defaults: [2025-03-17 00:10:22,818 INFO L153 SettingsManager]: * Ignore calls to procedures called more than once=ONLY_FOR_SEQUENTIAL_PROGRAMS [2025-03-17 00:10:22,818 INFO L151 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2025-03-17 00:10:22,818 INFO L153 SettingsManager]: * Create parallel compositions if possible=false [2025-03-17 00:10:22,818 INFO L153 SettingsManager]: * Use SBE=true [2025-03-17 00:10:22,818 INFO L151 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2025-03-17 00:10:22,818 INFO L153 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2025-03-17 00:10:22,818 INFO L153 SettingsManager]: * sizeof long=4 [2025-03-17 00:10:22,819 INFO L153 SettingsManager]: * Overapproximate operations on floating types=true [2025-03-17 00:10:22,819 INFO L153 SettingsManager]: * sizeof POINTER=4 [2025-03-17 00:10:22,819 INFO L153 SettingsManager]: * Check division by zero=IGNORE [2025-03-17 00:10:22,819 INFO L153 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2025-03-17 00:10:22,819 INFO L153 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2025-03-17 00:10:22,819 INFO L153 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2025-03-17 00:10:22,819 INFO L153 SettingsManager]: * sizeof long double=12 [2025-03-17 00:10:22,819 INFO L153 SettingsManager]: * Check if freed pointer was valid=false [2025-03-17 00:10:22,819 INFO L153 SettingsManager]: * Behaviour of calls to undefined functions=OVERAPPROXIMATE_BEHAVIOUR [2025-03-17 00:10:22,819 INFO L153 SettingsManager]: * Use constant arrays=true [2025-03-17 00:10:22,820 INFO L151 SettingsManager]: Preferences of IcfgBuilder differ from their defaults: [2025-03-17 00:10:22,820 INFO L153 SettingsManager]: * Size of a code block=SequenceOfStatements [2025-03-17 00:10:22,820 INFO L153 SettingsManager]: * Only consider context switches at boundaries of atomic blocks=true [2025-03-17 00:10:22,820 INFO L153 SettingsManager]: * SMT solver=External_DefaultMode [2025-03-17 00:10:22,820 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2025-03-17 00:10:22,820 INFO L151 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2025-03-17 00:10:22,820 INFO L153 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2025-03-17 00:10:22,820 INFO L153 SettingsManager]: * Compute procedure contracts=false [2025-03-17 00:10:22,820 INFO L153 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopHeads [2025-03-17 00:10:22,820 INFO L153 SettingsManager]: * Trace refinement strategy=CAMEL [2025-03-17 00:10:22,820 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2025-03-17 00:10:22,820 INFO L153 SettingsManager]: * Apply one-shot large block encoding in concurrent analysis=false [2025-03-17 00:10:22,821 INFO L153 SettingsManager]: * Automaton type used in concurrency analysis=PETRI_NET [2025-03-17 00:10:22,821 INFO L153 SettingsManager]: * Order on configurations for Petri net unfoldings=DBO [2025-03-17 00:10:22,821 INFO L153 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode [2025-03-17 00:10:22,821 INFO L153 SettingsManager]: * Looper check in Petri net analysis=SEMANTIC Applying setting for plugin de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator: Entry function -> main Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Witness directory -> /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Witness filename -> witness Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Write witness besides input file -> false Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Graph data specification -> CHECK( init(main()), LTL(G ! call(reach_error())) ) Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Graph data producer -> Automizer Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Graph data architecture -> 32bit Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Graph data programhash -> bec7db2d8bcad481bf37cc90d23f2eda8abfeabb35b205024dfceac80e64e988 [2025-03-17 00:10:23,071 INFO L75 nceAwareModelManager]: Repository-Root is: /tmp [2025-03-17 00:10:23,076 INFO L261 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2025-03-17 00:10:23,080 INFO L217 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2025-03-17 00:10:23,081 INFO L270 PluginConnector]: Initializing CDTParser... [2025-03-17 00:10:23,081 INFO L274 PluginConnector]: CDTParser initialized [2025-03-17 00:10:23,083 INFO L431 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/../sv-benchmarks/c/hardness-nfm22/hardness_fillercode_fillercodesize_ps-cn-250_file-81.i [2025-03-17 00:10:24,234 INFO L533 CDTParser]: Created temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/4737e7207/1982bd422ed74479bf2c6b56cb1126d2/FLAGc2460313f [2025-03-17 00:10:24,528 INFO L384 CDTParser]: Found 1 translation units. [2025-03-17 00:10:24,535 INFO L180 CDTParser]: Scanning /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/hardness-nfm22/hardness_fillercode_fillercodesize_ps-cn-250_file-81.i [2025-03-17 00:10:24,546 INFO L427 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/4737e7207/1982bd422ed74479bf2c6b56cb1126d2/FLAGc2460313f [2025-03-17 00:10:24,791 INFO L435 CDTParser]: Successfully deleted /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/4737e7207/1982bd422ed74479bf2c6b56cb1126d2 [2025-03-17 00:10:24,793 INFO L299 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2025-03-17 00:10:24,795 INFO L133 ToolchainWalker]: Walking toolchain with 6 elements. [2025-03-17 00:10:24,796 INFO L112 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2025-03-17 00:10:24,796 INFO L270 PluginConnector]: Initializing CACSL2BoogieTranslator... [2025-03-17 00:10:24,799 INFO L274 PluginConnector]: CACSL2BoogieTranslator initialized [2025-03-17 00:10:24,800 INFO L184 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 17.03 12:10:24" (1/1) ... [2025-03-17 00:10:24,800 INFO L204 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@2a132d31 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 17.03 12:10:24, skipping insertion in model container [2025-03-17 00:10:24,800 INFO L184 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 17.03 12:10:24" (1/1) ... [2025-03-17 00:10:24,821 INFO L175 MainTranslator]: Built tables and reachable declarations [2025-03-17 00:10:24,922 WARN L250 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/hardness-nfm22/hardness_fillercode_fillercodesize_ps-cn-250_file-81.i[916,929] [2025-03-17 00:10:25,024 INFO L210 PostProcessor]: Analyzing one entry point: main [2025-03-17 00:10:25,035 INFO L200 MainTranslator]: Completed pre-run [2025-03-17 00:10:25,043 WARN L250 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/hardness-nfm22/hardness_fillercode_fillercodesize_ps-cn-250_file-81.i[916,929] [2025-03-17 00:10:25,083 INFO L210 PostProcessor]: Analyzing one entry point: main [2025-03-17 00:10:25,096 INFO L204 MainTranslator]: Completed translation [2025-03-17 00:10:25,097 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 17.03 12:10:25 WrapperNode [2025-03-17 00:10:25,097 INFO L131 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2025-03-17 00:10:25,098 INFO L112 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2025-03-17 00:10:25,098 INFO L270 PluginConnector]: Initializing Boogie Procedure Inliner... [2025-03-17 00:10:25,098 INFO L274 PluginConnector]: Boogie Procedure Inliner initialized [2025-03-17 00:10:25,101 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 17.03 12:10:25" (1/1) ... [2025-03-17 00:10:25,113 INFO L184 PluginConnector]: Executing the observer Inliner from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 17.03 12:10:25" (1/1) ... [2025-03-17 00:10:25,158 INFO L138 Inliner]: procedures = 26, calls = 93, calls flagged for inlining = 8, calls inlined = 8, statements flattened = 502 [2025-03-17 00:10:25,158 INFO L131 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2025-03-17 00:10:25,159 INFO L112 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2025-03-17 00:10:25,159 INFO L270 PluginConnector]: Initializing Boogie Preprocessor... [2025-03-17 00:10:25,159 INFO L274 PluginConnector]: Boogie Preprocessor initialized [2025-03-17 00:10:25,165 INFO L184 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 17.03 12:10:25" (1/1) ... [2025-03-17 00:10:25,165 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 17.03 12:10:25" (1/1) ... [2025-03-17 00:10:25,179 INFO L184 PluginConnector]: Executing the observer MemorySlicer from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 17.03 12:10:25" (1/1) ... [2025-03-17 00:10:25,208 INFO L175 MemorySlicer]: Split 2 memory accesses to 1 slices as follows [2]. 100 percent of accesses are in the largest equivalence class. The 2 initializations are split as follows [2]. The 0 writes are split as follows [0]. [2025-03-17 00:10:25,209 INFO L184 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 17.03 12:10:25" (1/1) ... [2025-03-17 00:10:25,209 INFO L184 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 17.03 12:10:25" (1/1) ... [2025-03-17 00:10:25,230 INFO L184 PluginConnector]: Executing the observer ReplaceArrayAssignments from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 17.03 12:10:25" (1/1) ... [2025-03-17 00:10:25,233 INFO L184 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 17.03 12:10:25" (1/1) ... [2025-03-17 00:10:25,239 INFO L184 PluginConnector]: Executing the observer LTLStepAnnotator from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 17.03 12:10:25" (1/1) ... [2025-03-17 00:10:25,244 INFO L184 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 17.03 12:10:25" (1/1) ... [2025-03-17 00:10:25,251 INFO L131 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2025-03-17 00:10:25,252 INFO L112 PluginConnector]: ------------------------IcfgBuilder---------------------------- [2025-03-17 00:10:25,252 INFO L270 PluginConnector]: Initializing IcfgBuilder... [2025-03-17 00:10:25,252 INFO L274 PluginConnector]: IcfgBuilder initialized [2025-03-17 00:10:25,252 INFO L184 PluginConnector]: Executing the observer IcfgBuilderObserver from plugin IcfgBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 17.03 12:10:25" (1/1) ... [2025-03-17 00:10:25,257 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2025-03-17 00:10:25,266 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2025-03-17 00:10:25,277 INFO L229 MonitoredProcess]: Starting monitored process 1 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 (exit command is (exit), workingDir is null) [2025-03-17 00:10:25,280 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 (1)] Waiting until timeout for monitored process [2025-03-17 00:10:25,297 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocInit [2025-03-17 00:10:25,297 INFO L130 BoogieDeclarations]: Found specification of procedure assume_abort_if_not [2025-03-17 00:10:25,297 INFO L138 BoogieDeclarations]: Found implementation of procedure assume_abort_if_not [2025-03-17 00:10:25,297 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int#0 [2025-03-17 00:10:25,297 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2025-03-17 00:10:25,297 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2025-03-17 00:10:25,381 INFO L256 CfgBuilder]: Building ICFG [2025-03-17 00:10:25,382 INFO L286 CfgBuilder]: Building CFG for each procedure with an implementation [2025-03-17 00:10:25,917 INFO L1322 $ProcedureCfgBuilder]: dead code at ProgramPoint L448: havoc property_#t~bitwise52#1;havoc property_#t~short53#1; [2025-03-17 00:10:26,006 INFO L? ?]: Removed 14 outVars from TransFormulas that were not future-live. [2025-03-17 00:10:26,006 INFO L307 CfgBuilder]: Performing block encoding [2025-03-17 00:10:26,029 INFO L331 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2025-03-17 00:10:26,033 INFO L336 CfgBuilder]: Removed 0 assume(true) statements. [2025-03-17 00:10:26,033 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.icfgbuilder CFG 17.03 12:10:26 BoogieIcfgContainer [2025-03-17 00:10:26,034 INFO L131 PluginConnector]: ------------------------ END IcfgBuilder---------------------------- [2025-03-17 00:10:26,035 INFO L112 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2025-03-17 00:10:26,036 INFO L270 PluginConnector]: Initializing TraceAbstraction... [2025-03-17 00:10:26,039 INFO L274 PluginConnector]: TraceAbstraction initialized [2025-03-17 00:10:26,040 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 17.03 12:10:24" (1/3) ... [2025-03-17 00:10:26,041 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@20dc9d6a and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 17.03 12:10:26, skipping insertion in model container [2025-03-17 00:10:26,041 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 17.03 12:10:25" (2/3) ... [2025-03-17 00:10:26,041 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@20dc9d6a and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 17.03 12:10:26, skipping insertion in model container [2025-03-17 00:10:26,041 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.icfgbuilder CFG 17.03 12:10:26" (3/3) ... [2025-03-17 00:10:26,042 INFO L128 eAbstractionObserver]: Analyzing ICFG hardness_fillercode_fillercodesize_ps-cn-250_file-81.i [2025-03-17 00:10:26,053 INFO L216 ceAbstractionStarter]: Automizer settings: Hoare:LoopHeads NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2025-03-17 00:10:26,057 INFO L151 ceAbstractionStarter]: Applying trace abstraction to ICFG hardness_fillercode_fillercodesize_ps-cn-250_file-81.i that has 2 procedures, 214 locations, 1 initial locations, 1 loop locations, and 1 error locations. [2025-03-17 00:10:26,110 INFO L332 AbstractCegarLoop]: ======== Iteration 0 == of CEGAR loop == AllErrorsAtOnce ======== [2025-03-17 00:10:26,120 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;@4433e896, mLbeIndependenceSettings=[IndependenceType=SEMANTIC, AbstractionType=NONE, UseConditional=false, UseSemiCommutativity=true, Solver=Z3, SolverTimeout=1000ms] [2025-03-17 00:10:26,121 INFO L334 AbstractCegarLoop]: Starting to check reachability of 1 error locations. [2025-03-17 00:10:26,125 INFO L276 IsEmpty]: Start isEmpty. Operand has 214 states, 131 states have (on average 1.534351145038168) internal successors, (201), 132 states have internal predecessors, (201), 80 states have call successors, (80), 1 states have call predecessors, (80), 1 states have return successors, (80), 80 states have call predecessors, (80), 80 states have call successors, (80) [2025-03-17 00:10:26,144 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 491 [2025-03-17 00:10:26,144 INFO L210 NwaCegarLoop]: Found error trace [2025-03-17 00:10:26,145 INFO L218 NwaCegarLoop]: trace histogram [80, 80, 80, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-03-17 00:10:26,146 INFO L396 AbstractCegarLoop]: === Iteration 1 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-03-17 00:10:26,150 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-17 00:10:26,151 INFO L85 PathProgramCache]: Analyzing trace with hash 1402124168, now seen corresponding path program 1 times [2025-03-17 00:10:26,156 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-17 00:10:26,157 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1242597138] [2025-03-17 00:10:26,157 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-17 00:10:26,157 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-17 00:10:26,260 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 490 statements into 1 equivalence classes. [2025-03-17 00:10:26,302 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 490 of 490 statements. [2025-03-17 00:10:26,306 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-17 00:10:26,306 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-17 00:10:26,656 INFO L134 CoverageAnalysis]: Checked inductivity of 12640 backedges. 0 proven. 158 refuted. 0 times theorem prover too weak. 12482 trivial. 0 not checked. [2025-03-17 00:10:26,656 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-17 00:10:26,657 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1242597138] [2025-03-17 00:10:26,657 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1242597138] provided 0 perfect and 1 imperfect interpolant sequences [2025-03-17 00:10:26,658 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [26918690] [2025-03-17 00:10:26,658 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-17 00:10:26,658 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-03-17 00:10:26,658 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2025-03-17 00:10:26,660 INFO L229 MonitoredProcess]: Starting monitored process 2 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2025-03-17 00:10:26,662 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (2)] Waiting until timeout for monitored process [2025-03-17 00:10:26,773 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 490 statements into 1 equivalence classes. [2025-03-17 00:10:26,902 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 490 of 490 statements. [2025-03-17 00:10:26,903 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-17 00:10:26,903 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-17 00:10:26,909 INFO L256 TraceCheckSpWp]: Trace formula consists of 1076 conjuncts, 1 conjuncts are in the unsatisfiable core [2025-03-17 00:10:26,930 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-03-17 00:10:26,976 INFO L134 CoverageAnalysis]: Checked inductivity of 12640 backedges. 158 proven. 0 refuted. 0 times theorem prover too weak. 12482 trivial. 0 not checked. [2025-03-17 00:10:26,977 INFO L308 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2025-03-17 00:10:26,977 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [26918690] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-17 00:10:26,977 INFO L185 FreeRefinementEngine]: Found 1 perfect and 1 imperfect interpolant sequences. [2025-03-17 00:10:26,978 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [2] total 2 [2025-03-17 00:10:26,979 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [452669869] [2025-03-17 00:10:26,980 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-17 00:10:26,985 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 2 states [2025-03-17 00:10:26,985 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-17 00:10:27,001 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 2 interpolants. [2025-03-17 00:10:27,002 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=1, Invalid=1, Unknown=0, NotChecked=0, Total=2 [2025-03-17 00:10:27,004 INFO L87 Difference]: Start difference. First operand has 214 states, 131 states have (on average 1.534351145038168) internal successors, (201), 132 states have internal predecessors, (201), 80 states have call successors, (80), 1 states have call predecessors, (80), 1 states have return successors, (80), 80 states have call predecessors, (80), 80 states have call successors, (80) Second operand has 2 states, 2 states have (on average 47.5) internal successors, (95), 2 states have internal predecessors, (95), 2 states have call successors, (80), 2 states have call predecessors, (80), 1 states have return successors, (80), 1 states have call predecessors, (80), 2 states have call successors, (80) [2025-03-17 00:10:27,051 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-17 00:10:27,052 INFO L93 Difference]: Finished difference Result 425 states and 800 transitions. [2025-03-17 00:10:27,053 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 2 states. [2025-03-17 00:10:27,054 INFO L78 Accepts]: Start accepts. Automaton has has 2 states, 2 states have (on average 47.5) internal successors, (95), 2 states have internal predecessors, (95), 2 states have call successors, (80), 2 states have call predecessors, (80), 1 states have return successors, (80), 1 states have call predecessors, (80), 2 states have call successors, (80) Word has length 490 [2025-03-17 00:10:27,055 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-17 00:10:27,060 INFO L225 Difference]: With dead ends: 425 [2025-03-17 00:10:27,062 INFO L226 Difference]: Without dead ends: 212 [2025-03-17 00:10:27,069 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 491 GetRequests, 491 SyntacticMatches, 0 SemanticMatches, 0 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=1, Invalid=1, Unknown=0, NotChecked=0, Total=2 [2025-03-17 00:10:27,071 INFO L435 NwaCegarLoop]: 351 mSDtfsCounter, 0 mSDsluCounter, 0 mSDsCounter, 0 mSdLazyCounter, 5 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 0 SdHoareTripleChecker+Valid, 351 SdHoareTripleChecker+Invalid, 5 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 5 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2025-03-17 00:10:27,072 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [0 Valid, 351 Invalid, 5 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 5 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2025-03-17 00:10:27,085 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 212 states. [2025-03-17 00:10:27,126 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 212 to 212. [2025-03-17 00:10:27,128 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 212 states, 130 states have (on average 1.5076923076923077) internal successors, (196), 130 states have internal predecessors, (196), 80 states have call successors, (80), 1 states have call predecessors, (80), 1 states have return successors, (80), 80 states have call predecessors, (80), 80 states have call successors, (80) [2025-03-17 00:10:27,133 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 212 states to 212 states and 356 transitions. [2025-03-17 00:10:27,137 INFO L78 Accepts]: Start accepts. Automaton has 212 states and 356 transitions. Word has length 490 [2025-03-17 00:10:27,137 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-17 00:10:27,137 INFO L471 AbstractCegarLoop]: Abstraction has 212 states and 356 transitions. [2025-03-17 00:10:27,139 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 2 states, 2 states have (on average 47.5) internal successors, (95), 2 states have internal predecessors, (95), 2 states have call successors, (80), 2 states have call predecessors, (80), 1 states have return successors, (80), 1 states have call predecessors, (80), 2 states have call successors, (80) [2025-03-17 00:10:27,139 INFO L276 IsEmpty]: Start isEmpty. Operand 212 states and 356 transitions. [2025-03-17 00:10:27,159 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 492 [2025-03-17 00:10:27,159 INFO L210 NwaCegarLoop]: Found error trace [2025-03-17 00:10:27,159 INFO L218 NwaCegarLoop]: trace histogram [80, 80, 80, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-03-17 00:10:27,169 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (2)] Forceful destruction successful, exit code 0 [2025-03-17 00:10:27,360 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 2 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable0 [2025-03-17 00:10:27,360 INFO L396 AbstractCegarLoop]: === Iteration 2 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-03-17 00:10:27,361 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-17 00:10:27,361 INFO L85 PathProgramCache]: Analyzing trace with hash -492238243, now seen corresponding path program 1 times [2025-03-17 00:10:27,361 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-17 00:10:27,361 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [900294684] [2025-03-17 00:10:27,362 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-17 00:10:27,362 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-17 00:10:27,386 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 491 statements into 1 equivalence classes. [2025-03-17 00:10:27,451 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 491 of 491 statements. [2025-03-17 00:10:27,454 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-17 00:10:27,454 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-17 00:10:27,740 INFO L134 CoverageAnalysis]: Checked inductivity of 12640 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 12640 trivial. 0 not checked. [2025-03-17 00:10:27,742 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-17 00:10:27,742 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [900294684] [2025-03-17 00:10:27,742 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [900294684] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-17 00:10:27,743 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-17 00:10:27,743 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2025-03-17 00:10:27,743 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [157026658] [2025-03-17 00:10:27,743 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-17 00:10:27,744 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2025-03-17 00:10:27,746 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-17 00:10:27,747 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2025-03-17 00:10:27,747 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-03-17 00:10:27,747 INFO L87 Difference]: Start difference. First operand 212 states and 356 transitions. Second operand has 3 states, 3 states have (on average 31.333333333333332) internal successors, (94), 3 states have internal predecessors, (94), 1 states have call successors, (80), 1 states have call predecessors, (80), 1 states have return successors, (80), 1 states have call predecessors, (80), 1 states have call successors, (80) [2025-03-17 00:10:27,821 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-17 00:10:27,822 INFO L93 Difference]: Finished difference Result 546 states and 921 transitions. [2025-03-17 00:10:27,823 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2025-03-17 00:10:27,823 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 31.333333333333332) internal successors, (94), 3 states have internal predecessors, (94), 1 states have call successors, (80), 1 states have call predecessors, (80), 1 states have return successors, (80), 1 states have call predecessors, (80), 1 states have call successors, (80) Word has length 491 [2025-03-17 00:10:27,825 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-17 00:10:27,830 INFO L225 Difference]: With dead ends: 546 [2025-03-17 00:10:27,830 INFO L226 Difference]: Without dead ends: 335 [2025-03-17 00:10:27,831 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 3 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-03-17 00:10:27,832 INFO L435 NwaCegarLoop]: 519 mSDtfsCounter, 208 mSDsluCounter, 337 mSDsCounter, 0 mSdLazyCounter, 26 mSolverCounterSat, 3 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 208 SdHoareTripleChecker+Valid, 856 SdHoareTripleChecker+Invalid, 29 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 3 IncrementalHoareTripleChecker+Valid, 26 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2025-03-17 00:10:27,832 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [208 Valid, 856 Invalid, 29 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [3 Valid, 26 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2025-03-17 00:10:27,834 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 335 states. [2025-03-17 00:10:27,890 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 335 to 332. [2025-03-17 00:10:27,893 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 332 states, 223 states have (on average 1.5695067264573992) internal successors, (350), 224 states have internal predecessors, (350), 106 states have call successors, (106), 2 states have call predecessors, (106), 2 states have return successors, (106), 105 states have call predecessors, (106), 106 states have call successors, (106) [2025-03-17 00:10:27,896 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 332 states to 332 states and 562 transitions. [2025-03-17 00:10:27,896 INFO L78 Accepts]: Start accepts. Automaton has 332 states and 562 transitions. Word has length 491 [2025-03-17 00:10:27,898 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-17 00:10:27,899 INFO L471 AbstractCegarLoop]: Abstraction has 332 states and 562 transitions. [2025-03-17 00:10:27,899 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 31.333333333333332) internal successors, (94), 3 states have internal predecessors, (94), 1 states have call successors, (80), 1 states have call predecessors, (80), 1 states have return successors, (80), 1 states have call predecessors, (80), 1 states have call successors, (80) [2025-03-17 00:10:27,899 INFO L276 IsEmpty]: Start isEmpty. Operand 332 states and 562 transitions. [2025-03-17 00:10:27,902 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 492 [2025-03-17 00:10:27,903 INFO L210 NwaCegarLoop]: Found error trace [2025-03-17 00:10:27,904 INFO L218 NwaCegarLoop]: trace histogram [80, 80, 80, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-03-17 00:10:27,904 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable1 [2025-03-17 00:10:27,904 INFO L396 AbstractCegarLoop]: === Iteration 3 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-03-17 00:10:27,905 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-17 00:10:27,905 INFO L85 PathProgramCache]: Analyzing trace with hash 2101988574, now seen corresponding path program 1 times [2025-03-17 00:10:27,906 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-17 00:10:27,907 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [588731969] [2025-03-17 00:10:27,907 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-17 00:10:27,907 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-17 00:10:27,937 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 491 statements into 1 equivalence classes. [2025-03-17 00:10:28,008 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 491 of 491 statements. [2025-03-17 00:10:28,008 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-17 00:10:28,009 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-17 00:10:28,511 INFO L134 CoverageAnalysis]: Checked inductivity of 12640 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 12640 trivial. 0 not checked. [2025-03-17 00:10:28,511 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-17 00:10:28,514 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [588731969] [2025-03-17 00:10:28,514 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [588731969] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-17 00:10:28,514 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-17 00:10:28,514 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2025-03-17 00:10:28,514 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1730081526] [2025-03-17 00:10:28,514 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-17 00:10:28,515 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2025-03-17 00:10:28,515 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-17 00:10:28,516 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2025-03-17 00:10:28,516 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-03-17 00:10:28,516 INFO L87 Difference]: Start difference. First operand 332 states and 562 transitions. Second operand has 3 states, 3 states have (on average 31.333333333333332) internal successors, (94), 3 states have internal predecessors, (94), 1 states have call successors, (80), 1 states have call predecessors, (80), 1 states have return successors, (80), 1 states have call predecessors, (80), 1 states have call successors, (80) [2025-03-17 00:10:28,585 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-17 00:10:28,585 INFO L93 Difference]: Finished difference Result 990 states and 1676 transitions. [2025-03-17 00:10:28,586 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2025-03-17 00:10:28,586 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 31.333333333333332) internal successors, (94), 3 states have internal predecessors, (94), 1 states have call successors, (80), 1 states have call predecessors, (80), 1 states have return successors, (80), 1 states have call predecessors, (80), 1 states have call successors, (80) Word has length 491 [2025-03-17 00:10:28,587 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-17 00:10:28,594 INFO L225 Difference]: With dead ends: 990 [2025-03-17 00:10:28,594 INFO L226 Difference]: Without dead ends: 659 [2025-03-17 00:10:28,596 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 4 GetRequests, 3 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-03-17 00:10:28,596 INFO L435 NwaCegarLoop]: 349 mSDtfsCounter, 204 mSDsluCounter, 344 mSDsCounter, 0 mSdLazyCounter, 18 mSolverCounterSat, 1 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 204 SdHoareTripleChecker+Valid, 693 SdHoareTripleChecker+Invalid, 19 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 1 IncrementalHoareTripleChecker+Valid, 18 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2025-03-17 00:10:28,597 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [204 Valid, 693 Invalid, 19 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [1 Valid, 18 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2025-03-17 00:10:28,599 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 659 states. [2025-03-17 00:10:28,669 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 659 to 657. [2025-03-17 00:10:28,671 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 657 states, 440 states have (on average 1.559090909090909) internal successors, (686), 442 states have internal predecessors, (686), 212 states have call successors, (212), 4 states have call predecessors, (212), 4 states have return successors, (212), 210 states have call predecessors, (212), 212 states have call successors, (212) [2025-03-17 00:10:28,674 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 657 states to 657 states and 1110 transitions. [2025-03-17 00:10:28,675 INFO L78 Accepts]: Start accepts. Automaton has 657 states and 1110 transitions. Word has length 491 [2025-03-17 00:10:28,677 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-17 00:10:28,677 INFO L471 AbstractCegarLoop]: Abstraction has 657 states and 1110 transitions. [2025-03-17 00:10:28,677 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 31.333333333333332) internal successors, (94), 3 states have internal predecessors, (94), 1 states have call successors, (80), 1 states have call predecessors, (80), 1 states have return successors, (80), 1 states have call predecessors, (80), 1 states have call successors, (80) [2025-03-17 00:10:28,677 INFO L276 IsEmpty]: Start isEmpty. Operand 657 states and 1110 transitions. [2025-03-17 00:10:28,681 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 492 [2025-03-17 00:10:28,682 INFO L210 NwaCegarLoop]: Found error trace [2025-03-17 00:10:28,682 INFO L218 NwaCegarLoop]: trace histogram [80, 80, 80, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-03-17 00:10:28,682 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable2 [2025-03-17 00:10:28,682 INFO L396 AbstractCegarLoop]: === Iteration 4 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-03-17 00:10:28,683 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-17 00:10:28,683 INFO L85 PathProgramCache]: Analyzing trace with hash -1951757348, now seen corresponding path program 1 times [2025-03-17 00:10:28,683 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-17 00:10:28,683 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [254797459] [2025-03-17 00:10:28,683 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-17 00:10:28,683 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-17 00:10:28,715 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 491 statements into 1 equivalence classes. [2025-03-17 00:10:28,880 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 491 of 491 statements. [2025-03-17 00:10:28,881 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-17 00:10:28,881 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-17 00:10:29,296 INFO L134 CoverageAnalysis]: Checked inductivity of 12640 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 12640 trivial. 0 not checked. [2025-03-17 00:10:29,297 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-17 00:10:29,297 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [254797459] [2025-03-17 00:10:29,297 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [254797459] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-17 00:10:29,297 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-17 00:10:29,297 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2025-03-17 00:10:29,297 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1030633235] [2025-03-17 00:10:29,297 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-17 00:10:29,298 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2025-03-17 00:10:29,298 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-17 00:10:29,298 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2025-03-17 00:10:29,299 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2025-03-17 00:10:29,299 INFO L87 Difference]: Start difference. First operand 657 states and 1110 transitions. Second operand has 4 states, 4 states have (on average 23.5) internal successors, (94), 4 states have internal predecessors, (94), 1 states have call successors, (80), 1 states have call predecessors, (80), 1 states have return successors, (80), 1 states have call predecessors, (80), 1 states have call successors, (80) [2025-03-17 00:10:29,399 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-17 00:10:29,399 INFO L93 Difference]: Finished difference Result 1443 states and 2408 transitions. [2025-03-17 00:10:29,400 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2025-03-17 00:10:29,400 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 4 states have (on average 23.5) internal successors, (94), 4 states have internal predecessors, (94), 1 states have call successors, (80), 1 states have call predecessors, (80), 1 states have return successors, (80), 1 states have call predecessors, (80), 1 states have call successors, (80) Word has length 491 [2025-03-17 00:10:29,401 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-17 00:10:29,407 INFO L225 Difference]: With dead ends: 1443 [2025-03-17 00:10:29,408 INFO L226 Difference]: Without dead ends: 787 [2025-03-17 00:10:29,410 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 5 GetRequests, 3 SyntacticMatches, 0 SemanticMatches, 2 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2025-03-17 00:10:29,410 INFO L435 NwaCegarLoop]: 359 mSDtfsCounter, 41 mSDsluCounter, 682 mSDsCounter, 0 mSdLazyCounter, 52 mSolverCounterSat, 3 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 41 SdHoareTripleChecker+Valid, 1041 SdHoareTripleChecker+Invalid, 55 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 3 IncrementalHoareTripleChecker+Valid, 52 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2025-03-17 00:10:29,410 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [41 Valid, 1041 Invalid, 55 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [3 Valid, 52 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2025-03-17 00:10:29,411 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 787 states. [2025-03-17 00:10:29,471 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 787 to 781. [2025-03-17 00:10:29,473 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 781 states, 544 states have (on average 1.525735294117647) internal successors, (830), 550 states have internal predecessors, (830), 228 states have call successors, (228), 8 states have call predecessors, (228), 8 states have return successors, (228), 222 states have call predecessors, (228), 228 states have call successors, (228) [2025-03-17 00:10:29,477 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 781 states to 781 states and 1286 transitions. [2025-03-17 00:10:29,477 INFO L78 Accepts]: Start accepts. Automaton has 781 states and 1286 transitions. Word has length 491 [2025-03-17 00:10:29,478 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-17 00:10:29,478 INFO L471 AbstractCegarLoop]: Abstraction has 781 states and 1286 transitions. [2025-03-17 00:10:29,478 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 23.5) internal successors, (94), 4 states have internal predecessors, (94), 1 states have call successors, (80), 1 states have call predecessors, (80), 1 states have return successors, (80), 1 states have call predecessors, (80), 1 states have call successors, (80) [2025-03-17 00:10:29,478 INFO L276 IsEmpty]: Start isEmpty. Operand 781 states and 1286 transitions. [2025-03-17 00:10:29,481 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 492 [2025-03-17 00:10:29,481 INFO L210 NwaCegarLoop]: Found error trace [2025-03-17 00:10:29,482 INFO L218 NwaCegarLoop]: trace histogram [80, 80, 80, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-03-17 00:10:29,482 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable3 [2025-03-17 00:10:29,482 INFO L396 AbstractCegarLoop]: === Iteration 5 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-03-17 00:10:29,483 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-17 00:10:29,483 INFO L85 PathProgramCache]: Analyzing trace with hash -1755243843, now seen corresponding path program 1 times [2025-03-17 00:10:29,484 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-17 00:10:29,484 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1627611001] [2025-03-17 00:10:29,484 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-17 00:10:29,484 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-17 00:10:29,508 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 491 statements into 1 equivalence classes. [2025-03-17 00:10:29,712 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 491 of 491 statements. [2025-03-17 00:10:29,713 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-17 00:10:29,713 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-17 00:10:40,854 INFO L134 CoverageAnalysis]: Checked inductivity of 12640 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 12640 trivial. 0 not checked. [2025-03-17 00:10:40,855 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-17 00:10:40,855 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1627611001] [2025-03-17 00:10:40,855 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1627611001] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-17 00:10:40,855 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-17 00:10:40,855 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [9] imperfect sequences [] total 9 [2025-03-17 00:10:40,855 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [226044818] [2025-03-17 00:10:40,855 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-17 00:10:40,856 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 9 states [2025-03-17 00:10:40,856 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-17 00:10:40,856 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2025-03-17 00:10:40,857 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=30, Invalid=42, Unknown=0, NotChecked=0, Total=72 [2025-03-17 00:10:40,857 INFO L87 Difference]: Start difference. First operand 781 states and 1286 transitions. Second operand has 9 states, 9 states have (on average 10.444444444444445) internal successors, (94), 9 states have internal predecessors, (94), 1 states have call successors, (80), 1 states have call predecessors, (80), 1 states have return successors, (80), 1 states have call predecessors, (80), 1 states have call successors, (80) [2025-03-17 00:10:41,454 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-17 00:10:41,456 INFO L93 Difference]: Finished difference Result 1784 states and 2879 transitions. [2025-03-17 00:10:41,456 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2025-03-17 00:10:41,457 INFO L78 Accepts]: Start accepts. Automaton has has 9 states, 9 states have (on average 10.444444444444445) internal successors, (94), 9 states have internal predecessors, (94), 1 states have call successors, (80), 1 states have call predecessors, (80), 1 states have return successors, (80), 1 states have call predecessors, (80), 1 states have call successors, (80) Word has length 491 [2025-03-17 00:10:41,457 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-17 00:10:41,463 INFO L225 Difference]: With dead ends: 1784 [2025-03-17 00:10:41,463 INFO L226 Difference]: Without dead ends: 1004 [2025-03-17 00:10:41,466 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 11 GetRequests, 3 SyntacticMatches, 0 SemanticMatches, 8 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 5 ImplicationChecksByTransitivity, 2.9s TimeCoverageRelationStatistics Valid=39, Invalid=51, Unknown=0, NotChecked=0, Total=90 [2025-03-17 00:10:41,466 INFO L435 NwaCegarLoop]: 334 mSDtfsCounter, 194 mSDsluCounter, 699 mSDsCounter, 0 mSdLazyCounter, 185 mSolverCounterSat, 1 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.4s Time, 0 mProtectedPredicate, 0 mProtectedAction, 194 SdHoareTripleChecker+Valid, 1033 SdHoareTripleChecker+Invalid, 186 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 1 IncrementalHoareTripleChecker+Valid, 185 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.5s IncrementalHoareTripleChecker+Time [2025-03-17 00:10:41,467 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [194 Valid, 1033 Invalid, 186 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [1 Valid, 185 Invalid, 0 Unknown, 0 Unchecked, 0.5s Time] [2025-03-17 00:10:41,468 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1004 states. [2025-03-17 00:10:41,520 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1004 to 821. [2025-03-17 00:10:41,522 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 821 states, 584 states have (on average 1.5171232876712328) internal successors, (886), 590 states have internal predecessors, (886), 228 states have call successors, (228), 8 states have call predecessors, (228), 8 states have return successors, (228), 222 states have call predecessors, (228), 228 states have call successors, (228) [2025-03-17 00:10:41,527 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 821 states to 821 states and 1342 transitions. [2025-03-17 00:10:41,529 INFO L78 Accepts]: Start accepts. Automaton has 821 states and 1342 transitions. Word has length 491 [2025-03-17 00:10:41,529 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-17 00:10:41,531 INFO L471 AbstractCegarLoop]: Abstraction has 821 states and 1342 transitions. [2025-03-17 00:10:41,531 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 9 states, 9 states have (on average 10.444444444444445) internal successors, (94), 9 states have internal predecessors, (94), 1 states have call successors, (80), 1 states have call predecessors, (80), 1 states have return successors, (80), 1 states have call predecessors, (80), 1 states have call successors, (80) [2025-03-17 00:10:41,531 INFO L276 IsEmpty]: Start isEmpty. Operand 821 states and 1342 transitions. [2025-03-17 00:10:41,534 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 492 [2025-03-17 00:10:41,534 INFO L210 NwaCegarLoop]: Found error trace [2025-03-17 00:10:41,534 INFO L218 NwaCegarLoop]: trace histogram [80, 80, 80, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-03-17 00:10:41,534 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable4 [2025-03-17 00:10:41,535 INFO L396 AbstractCegarLoop]: === Iteration 6 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-03-17 00:10:41,536 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-17 00:10:41,536 INFO L85 PathProgramCache]: Analyzing trace with hash 742772094, now seen corresponding path program 1 times [2025-03-17 00:10:41,537 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-17 00:10:41,537 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1988545580] [2025-03-17 00:10:41,537 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-17 00:10:41,537 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-17 00:10:41,555 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 491 statements into 1 equivalence classes. [2025-03-17 00:10:41,727 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 491 of 491 statements. [2025-03-17 00:10:41,728 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-17 00:10:41,728 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-17 00:10:51,075 INFO L134 CoverageAnalysis]: Checked inductivity of 12640 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 12640 trivial. 0 not checked. [2025-03-17 00:10:51,075 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-17 00:10:51,075 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1988545580] [2025-03-17 00:10:51,075 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1988545580] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-17 00:10:51,075 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-17 00:10:51,075 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [9] imperfect sequences [] total 9 [2025-03-17 00:10:51,075 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1697115915] [2025-03-17 00:10:51,075 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-17 00:10:51,076 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 9 states [2025-03-17 00:10:51,076 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-17 00:10:51,077 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2025-03-17 00:10:51,077 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=30, Invalid=42, Unknown=0, NotChecked=0, Total=72 [2025-03-17 00:10:51,078 INFO L87 Difference]: Start difference. First operand 821 states and 1342 transitions. Second operand has 9 states, 9 states have (on average 10.444444444444445) internal successors, (94), 9 states have internal predecessors, (94), 1 states have call successors, (80), 1 states have call predecessors, (80), 1 states have return successors, (80), 1 states have call predecessors, (80), 1 states have call successors, (80) [2025-03-17 00:10:51,747 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-17 00:10:51,748 INFO L93 Difference]: Finished difference Result 1786 states and 2882 transitions. [2025-03-17 00:10:51,748 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2025-03-17 00:10:51,749 INFO L78 Accepts]: Start accepts. Automaton has has 9 states, 9 states have (on average 10.444444444444445) internal successors, (94), 9 states have internal predecessors, (94), 1 states have call successors, (80), 1 states have call predecessors, (80), 1 states have return successors, (80), 1 states have call predecessors, (80), 1 states have call successors, (80) Word has length 491 [2025-03-17 00:10:51,750 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-17 00:10:51,756 INFO L225 Difference]: With dead ends: 1786 [2025-03-17 00:10:51,757 INFO L226 Difference]: Without dead ends: 966 [2025-03-17 00:10:51,759 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 11 GetRequests, 3 SyntacticMatches, 0 SemanticMatches, 8 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 5 ImplicationChecksByTransitivity, 1.8s TimeCoverageRelationStatistics Valid=39, Invalid=51, Unknown=0, NotChecked=0, Total=90 [2025-03-17 00:10:51,761 INFO L435 NwaCegarLoop]: 334 mSDtfsCounter, 120 mSDsluCounter, 981 mSDsCounter, 0 mSdLazyCounter, 193 mSolverCounterSat, 2 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.5s Time, 0 mProtectedPredicate, 0 mProtectedAction, 120 SdHoareTripleChecker+Valid, 1315 SdHoareTripleChecker+Invalid, 195 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 2 IncrementalHoareTripleChecker+Valid, 193 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.5s IncrementalHoareTripleChecker+Time [2025-03-17 00:10:51,761 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [120 Valid, 1315 Invalid, 195 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [2 Valid, 193 Invalid, 0 Unknown, 0 Unchecked, 0.5s Time] [2025-03-17 00:10:51,762 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 966 states. [2025-03-17 00:10:51,801 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 966 to 821. [2025-03-17 00:10:51,802 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 821 states, 584 states have (on average 1.5171232876712328) internal successors, (886), 590 states have internal predecessors, (886), 228 states have call successors, (228), 8 states have call predecessors, (228), 8 states have return successors, (228), 222 states have call predecessors, (228), 228 states have call successors, (228) [2025-03-17 00:10:51,806 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 821 states to 821 states and 1342 transitions. [2025-03-17 00:10:51,807 INFO L78 Accepts]: Start accepts. Automaton has 821 states and 1342 transitions. Word has length 491 [2025-03-17 00:10:51,808 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-17 00:10:51,808 INFO L471 AbstractCegarLoop]: Abstraction has 821 states and 1342 transitions. [2025-03-17 00:10:51,808 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 9 states, 9 states have (on average 10.444444444444445) internal successors, (94), 9 states have internal predecessors, (94), 1 states have call successors, (80), 1 states have call predecessors, (80), 1 states have return successors, (80), 1 states have call predecessors, (80), 1 states have call successors, (80) [2025-03-17 00:10:51,808 INFO L276 IsEmpty]: Start isEmpty. Operand 821 states and 1342 transitions. [2025-03-17 00:10:51,811 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 492 [2025-03-17 00:10:51,811 INFO L210 NwaCegarLoop]: Found error trace [2025-03-17 00:10:51,811 INFO L218 NwaCegarLoop]: trace histogram [80, 80, 80, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-03-17 00:10:51,811 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable5 [2025-03-17 00:10:51,811 INFO L396 AbstractCegarLoop]: === Iteration 7 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-03-17 00:10:51,812 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-17 00:10:51,812 INFO L85 PathProgramCache]: Analyzing trace with hash -1626161124, now seen corresponding path program 1 times [2025-03-17 00:10:51,812 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-17 00:10:51,812 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [473244180] [2025-03-17 00:10:51,812 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-17 00:10:51,812 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-17 00:10:51,828 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 491 statements into 1 equivalence classes. [2025-03-17 00:10:51,952 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 491 of 491 statements. [2025-03-17 00:10:51,952 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-17 00:10:51,952 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-17 00:10:52,851 INFO L134 CoverageAnalysis]: Checked inductivity of 12640 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 12640 trivial. 0 not checked. [2025-03-17 00:10:52,851 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-17 00:10:52,851 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [473244180] [2025-03-17 00:10:52,851 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [473244180] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-17 00:10:52,851 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-17 00:10:52,852 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [9] imperfect sequences [] total 9 [2025-03-17 00:10:52,852 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [572000514] [2025-03-17 00:10:52,852 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-17 00:10:52,852 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 9 states [2025-03-17 00:10:52,852 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-17 00:10:52,853 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2025-03-17 00:10:52,853 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=16, Invalid=56, Unknown=0, NotChecked=0, Total=72 [2025-03-17 00:10:52,853 INFO L87 Difference]: Start difference. First operand 821 states and 1342 transitions. Second operand has 9 states, 8 states have (on average 11.75) internal successors, (94), 9 states have internal predecessors, (94), 2 states have call successors, (80), 1 states have call predecessors, (80), 1 states have return successors, (80), 1 states have call predecessors, (80), 2 states have call successors, (80) [2025-03-17 00:10:54,267 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-17 00:10:54,267 INFO L93 Difference]: Finished difference Result 2515 states and 4048 transitions. [2025-03-17 00:10:54,267 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2025-03-17 00:10:54,267 INFO L78 Accepts]: Start accepts. Automaton has has 9 states, 8 states have (on average 11.75) internal successors, (94), 9 states have internal predecessors, (94), 2 states have call successors, (80), 1 states have call predecessors, (80), 1 states have return successors, (80), 1 states have call predecessors, (80), 2 states have call successors, (80) Word has length 491 [2025-03-17 00:10:54,268 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-17 00:10:54,277 INFO L225 Difference]: With dead ends: 2515 [2025-03-17 00:10:54,277 INFO L226 Difference]: Without dead ends: 1695 [2025-03-17 00:10:54,280 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 18 GetRequests, 4 SyntacticMatches, 0 SemanticMatches, 14 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 23 ImplicationChecksByTransitivity, 0.4s TimeCoverageRelationStatistics Valid=72, Invalid=168, Unknown=0, NotChecked=0, Total=240 [2025-03-17 00:10:54,281 INFO L435 NwaCegarLoop]: 339 mSDtfsCounter, 598 mSDsluCounter, 1712 mSDsCounter, 0 mSdLazyCounter, 828 mSolverCounterSat, 322 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.9s Time, 0 mProtectedPredicate, 0 mProtectedAction, 598 SdHoareTripleChecker+Valid, 2051 SdHoareTripleChecker+Invalid, 1150 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 322 IncrementalHoareTripleChecker+Valid, 828 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 1.1s IncrementalHoareTripleChecker+Time [2025-03-17 00:10:54,281 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [598 Valid, 2051 Invalid, 1150 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [322 Valid, 828 Invalid, 0 Unknown, 0 Unchecked, 1.1s Time] [2025-03-17 00:10:54,284 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1695 states. [2025-03-17 00:10:54,400 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1695 to 1141. [2025-03-17 00:10:54,402 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 1141 states, 823 states have (on average 1.5504252733900366) internal successors, (1276), 829 states have internal predecessors, (1276), 308 states have call successors, (308), 9 states have call predecessors, (308), 9 states have return successors, (308), 302 states have call predecessors, (308), 308 states have call successors, (308) [2025-03-17 00:10:54,408 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1141 states to 1141 states and 1892 transitions. [2025-03-17 00:10:54,410 INFO L78 Accepts]: Start accepts. Automaton has 1141 states and 1892 transitions. Word has length 491 [2025-03-17 00:10:54,411 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-17 00:10:54,411 INFO L471 AbstractCegarLoop]: Abstraction has 1141 states and 1892 transitions. [2025-03-17 00:10:54,411 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 9 states, 8 states have (on average 11.75) internal successors, (94), 9 states have internal predecessors, (94), 2 states have call successors, (80), 1 states have call predecessors, (80), 1 states have return successors, (80), 1 states have call predecessors, (80), 2 states have call successors, (80) [2025-03-17 00:10:54,411 INFO L276 IsEmpty]: Start isEmpty. Operand 1141 states and 1892 transitions. [2025-03-17 00:10:54,415 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 492 [2025-03-17 00:10:54,415 INFO L210 NwaCegarLoop]: Found error trace [2025-03-17 00:10:54,416 INFO L218 NwaCegarLoop]: trace histogram [80, 80, 80, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-03-17 00:10:54,416 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable6 [2025-03-17 00:10:54,416 INFO L396 AbstractCegarLoop]: === Iteration 8 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-03-17 00:10:54,416 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-17 00:10:54,417 INFO L85 PathProgramCache]: Analyzing trace with hash -2131719749, now seen corresponding path program 1 times [2025-03-17 00:10:54,417 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-17 00:10:54,417 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1124931570] [2025-03-17 00:10:54,417 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-17 00:10:54,417 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-17 00:10:54,439 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 491 statements into 1 equivalence classes. [2025-03-17 00:10:54,481 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 491 of 491 statements. [2025-03-17 00:10:54,481 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-17 00:10:54,481 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-17 00:10:55,132 INFO L134 CoverageAnalysis]: Checked inductivity of 12640 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 12640 trivial. 0 not checked. [2025-03-17 00:10:55,132 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-17 00:10:55,132 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1124931570] [2025-03-17 00:10:55,132 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1124931570] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-17 00:10:55,132 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-17 00:10:55,132 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2025-03-17 00:10:55,133 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [526123478] [2025-03-17 00:10:55,133 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-17 00:10:55,134 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 7 states [2025-03-17 00:10:55,134 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-17 00:10:55,134 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2025-03-17 00:10:55,134 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=12, Invalid=30, Unknown=0, NotChecked=0, Total=42 [2025-03-17 00:10:55,135 INFO L87 Difference]: Start difference. First operand 1141 states and 1892 transitions. Second operand has 7 states, 7 states have (on average 13.428571428571429) internal successors, (94), 7 states have internal predecessors, (94), 1 states have call successors, (80), 1 states have call predecessors, (80), 1 states have return successors, (80), 1 states have call predecessors, (80), 1 states have call successors, (80) [2025-03-17 00:10:55,928 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-17 00:10:55,928 INFO L93 Difference]: Finished difference Result 2167 states and 3534 transitions. [2025-03-17 00:10:55,929 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2025-03-17 00:10:55,929 INFO L78 Accepts]: Start accepts. Automaton has has 7 states, 7 states have (on average 13.428571428571429) internal successors, (94), 7 states have internal predecessors, (94), 1 states have call successors, (80), 1 states have call predecessors, (80), 1 states have return successors, (80), 1 states have call predecessors, (80), 1 states have call successors, (80) Word has length 491 [2025-03-17 00:10:55,930 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-17 00:10:55,937 INFO L225 Difference]: With dead ends: 2167 [2025-03-17 00:10:55,937 INFO L226 Difference]: Without dead ends: 1347 [2025-03-17 00:10:55,940 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 13 GetRequests, 4 SyntacticMatches, 0 SemanticMatches, 9 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 5 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=36, Invalid=74, Unknown=0, NotChecked=0, Total=110 [2025-03-17 00:10:55,940 INFO L435 NwaCegarLoop]: 343 mSDtfsCounter, 317 mSDsluCounter, 1217 mSDsCounter, 0 mSdLazyCounter, 578 mSolverCounterSat, 241 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.6s Time, 0 mProtectedPredicate, 0 mProtectedAction, 317 SdHoareTripleChecker+Valid, 1560 SdHoareTripleChecker+Invalid, 819 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 241 IncrementalHoareTripleChecker+Valid, 578 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.7s IncrementalHoareTripleChecker+Time [2025-03-17 00:10:55,941 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [317 Valid, 1560 Invalid, 819 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [241 Valid, 578 Invalid, 0 Unknown, 0 Unchecked, 0.7s Time] [2025-03-17 00:10:55,943 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1347 states. [2025-03-17 00:10:56,025 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1347 to 1141. [2025-03-17 00:10:56,027 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 1141 states, 823 states have (on average 1.5504252733900366) internal successors, (1276), 829 states have internal predecessors, (1276), 308 states have call successors, (308), 9 states have call predecessors, (308), 9 states have return successors, (308), 302 states have call predecessors, (308), 308 states have call successors, (308) [2025-03-17 00:10:56,030 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1141 states to 1141 states and 1892 transitions. [2025-03-17 00:10:56,032 INFO L78 Accepts]: Start accepts. Automaton has 1141 states and 1892 transitions. Word has length 491 [2025-03-17 00:10:56,034 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-17 00:10:56,034 INFO L471 AbstractCegarLoop]: Abstraction has 1141 states and 1892 transitions. [2025-03-17 00:10:56,034 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 7 states, 7 states have (on average 13.428571428571429) internal successors, (94), 7 states have internal predecessors, (94), 1 states have call successors, (80), 1 states have call predecessors, (80), 1 states have return successors, (80), 1 states have call predecessors, (80), 1 states have call successors, (80) [2025-03-17 00:10:56,034 INFO L276 IsEmpty]: Start isEmpty. Operand 1141 states and 1892 transitions. [2025-03-17 00:10:56,037 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 493 [2025-03-17 00:10:56,037 INFO L210 NwaCegarLoop]: Found error trace [2025-03-17 00:10:56,037 INFO L218 NwaCegarLoop]: trace histogram [80, 80, 80, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-03-17 00:10:56,037 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable7 [2025-03-17 00:10:56,037 INFO L396 AbstractCegarLoop]: === Iteration 9 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-03-17 00:10:56,038 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-17 00:10:56,038 INFO L85 PathProgramCache]: Analyzing trace with hash 937957390, now seen corresponding path program 1 times [2025-03-17 00:10:56,038 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-17 00:10:56,038 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [91628775] [2025-03-17 00:10:56,038 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-17 00:10:56,038 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-17 00:10:56,059 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 492 statements into 1 equivalence classes. [2025-03-17 00:10:56,153 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 492 of 492 statements. [2025-03-17 00:10:56,153 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-17 00:10:56,154 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-17 00:11:02,557 INFO L134 CoverageAnalysis]: Checked inductivity of 12640 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 12640 trivial. 0 not checked. [2025-03-17 00:11:02,558 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-17 00:11:02,558 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [91628775] [2025-03-17 00:11:02,558 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [91628775] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-17 00:11:02,558 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-17 00:11:02,558 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [9] imperfect sequences [] total 9 [2025-03-17 00:11:02,558 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [874098155] [2025-03-17 00:11:02,558 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-17 00:11:02,558 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 9 states [2025-03-17 00:11:02,558 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-17 00:11:02,559 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2025-03-17 00:11:02,559 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=25, Invalid=47, Unknown=0, NotChecked=0, Total=72 [2025-03-17 00:11:02,559 INFO L87 Difference]: Start difference. First operand 1141 states and 1892 transitions. Second operand has 9 states, 9 states have (on average 10.555555555555555) internal successors, (95), 9 states have internal predecessors, (95), 1 states have call successors, (80), 1 states have call predecessors, (80), 1 states have return successors, (80), 1 states have call predecessors, (80), 1 states have call successors, (80) [2025-03-17 00:11:03,139 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-17 00:11:03,139 INFO L93 Difference]: Finished difference Result 2449 states and 3941 transitions. [2025-03-17 00:11:03,140 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2025-03-17 00:11:03,140 INFO L78 Accepts]: Start accepts. Automaton has has 9 states, 9 states have (on average 10.555555555555555) internal successors, (95), 9 states have internal predecessors, (95), 1 states have call successors, (80), 1 states have call predecessors, (80), 1 states have return successors, (80), 1 states have call predecessors, (80), 1 states have call successors, (80) Word has length 492 [2025-03-17 00:11:03,141 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-17 00:11:03,148 INFO L225 Difference]: With dead ends: 2449 [2025-03-17 00:11:03,148 INFO L226 Difference]: Without dead ends: 1629 [2025-03-17 00:11:03,150 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 12 GetRequests, 4 SyntacticMatches, 0 SemanticMatches, 8 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 4 ImplicationChecksByTransitivity, 0.8s TimeCoverageRelationStatistics Valid=33, Invalid=57, Unknown=0, NotChecked=0, Total=90 [2025-03-17 00:11:03,151 INFO L435 NwaCegarLoop]: 349 mSDtfsCounter, 272 mSDsluCounter, 1023 mSDsCounter, 0 mSdLazyCounter, 222 mSolverCounterSat, 2 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.3s Time, 0 mProtectedPredicate, 0 mProtectedAction, 272 SdHoareTripleChecker+Valid, 1372 SdHoareTripleChecker+Invalid, 224 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 2 IncrementalHoareTripleChecker+Valid, 222 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.4s IncrementalHoareTripleChecker+Time [2025-03-17 00:11:03,151 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [272 Valid, 1372 Invalid, 224 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [2 Valid, 222 Invalid, 0 Unknown, 0 Unchecked, 0.4s Time] [2025-03-17 00:11:03,152 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1629 states. [2025-03-17 00:11:03,222 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1629 to 1205. [2025-03-17 00:11:03,224 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 1205 states, 887 states have (on average 1.5467869222096957) internal successors, (1372), 893 states have internal predecessors, (1372), 308 states have call successors, (308), 9 states have call predecessors, (308), 9 states have return successors, (308), 302 states have call predecessors, (308), 308 states have call successors, (308) [2025-03-17 00:11:03,226 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1205 states to 1205 states and 1988 transitions. [2025-03-17 00:11:03,228 INFO L78 Accepts]: Start accepts. Automaton has 1205 states and 1988 transitions. Word has length 492 [2025-03-17 00:11:03,229 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-17 00:11:03,229 INFO L471 AbstractCegarLoop]: Abstraction has 1205 states and 1988 transitions. [2025-03-17 00:11:03,229 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 9 states, 9 states have (on average 10.555555555555555) internal successors, (95), 9 states have internal predecessors, (95), 1 states have call successors, (80), 1 states have call predecessors, (80), 1 states have return successors, (80), 1 states have call predecessors, (80), 1 states have call successors, (80) [2025-03-17 00:11:03,229 INFO L276 IsEmpty]: Start isEmpty. Operand 1205 states and 1988 transitions. [2025-03-17 00:11:03,232 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 493 [2025-03-17 00:11:03,232 INFO L210 NwaCegarLoop]: Found error trace [2025-03-17 00:11:03,232 INFO L218 NwaCegarLoop]: trace histogram [80, 80, 80, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-03-17 00:11:03,232 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable8 [2025-03-17 00:11:03,232 INFO L396 AbstractCegarLoop]: === Iteration 10 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-03-17 00:11:03,233 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-17 00:11:03,233 INFO L85 PathProgramCache]: Analyzing trace with hash 1134470895, now seen corresponding path program 1 times [2025-03-17 00:11:03,233 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-17 00:11:03,233 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [839145218] [2025-03-17 00:11:03,233 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-17 00:11:03,233 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-17 00:11:03,248 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 492 statements into 1 equivalence classes. [2025-03-17 00:11:03,322 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 492 of 492 statements. [2025-03-17 00:11:03,323 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-17 00:11:03,323 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-17 00:11:09,555 INFO L134 CoverageAnalysis]: Checked inductivity of 12640 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 12640 trivial. 0 not checked. [2025-03-17 00:11:09,556 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-17 00:11:09,556 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [839145218] [2025-03-17 00:11:09,556 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [839145218] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-17 00:11:09,556 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-17 00:11:09,556 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [9] imperfect sequences [] total 9 [2025-03-17 00:11:09,556 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [119426481] [2025-03-17 00:11:09,556 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-17 00:11:09,557 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 9 states [2025-03-17 00:11:09,557 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-17 00:11:09,557 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2025-03-17 00:11:09,558 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=30, Invalid=42, Unknown=0, NotChecked=0, Total=72 [2025-03-17 00:11:09,558 INFO L87 Difference]: Start difference. First operand 1205 states and 1988 transitions. Second operand has 9 states, 9 states have (on average 10.555555555555555) internal successors, (95), 9 states have internal predecessors, (95), 1 states have call successors, (80), 1 states have call predecessors, (80), 1 states have return successors, (80), 1 states have call predecessors, (80), 1 states have call successors, (80) [2025-03-17 00:11:10,056 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-17 00:11:10,056 INFO L93 Difference]: Finished difference Result 2509 states and 4021 transitions. [2025-03-17 00:11:10,057 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2025-03-17 00:11:10,057 INFO L78 Accepts]: Start accepts. Automaton has has 9 states, 9 states have (on average 10.555555555555555) internal successors, (95), 9 states have internal predecessors, (95), 1 states have call successors, (80), 1 states have call predecessors, (80), 1 states have return successors, (80), 1 states have call predecessors, (80), 1 states have call successors, (80) Word has length 492 [2025-03-17 00:11:10,058 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-17 00:11:10,064 INFO L225 Difference]: With dead ends: 2509 [2025-03-17 00:11:10,064 INFO L226 Difference]: Without dead ends: 1637 [2025-03-17 00:11:10,067 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 11 GetRequests, 3 SyntacticMatches, 0 SemanticMatches, 8 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 5 ImplicationChecksByTransitivity, 0.7s TimeCoverageRelationStatistics Valid=39, Invalid=51, Unknown=0, NotChecked=0, Total=90 [2025-03-17 00:11:10,067 INFO L435 NwaCegarLoop]: 332 mSDtfsCounter, 197 mSDsluCounter, 1301 mSDsCounter, 0 mSdLazyCounter, 243 mSolverCounterSat, 2 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.3s Time, 0 mProtectedPredicate, 0 mProtectedAction, 197 SdHoareTripleChecker+Valid, 1633 SdHoareTripleChecker+Invalid, 245 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 2 IncrementalHoareTripleChecker+Valid, 243 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.4s IncrementalHoareTripleChecker+Time [2025-03-17 00:11:10,068 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [197 Valid, 1633 Invalid, 245 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [2 Valid, 243 Invalid, 0 Unknown, 0 Unchecked, 0.4s Time] [2025-03-17 00:11:10,069 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1637 states. [2025-03-17 00:11:10,139 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1637 to 1205. [2025-03-17 00:11:10,141 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 1205 states, 887 states have (on average 1.5467869222096957) internal successors, (1372), 893 states have internal predecessors, (1372), 308 states have call successors, (308), 9 states have call predecessors, (308), 9 states have return successors, (308), 302 states have call predecessors, (308), 308 states have call successors, (308) [2025-03-17 00:11:10,144 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1205 states to 1205 states and 1988 transitions. [2025-03-17 00:11:10,146 INFO L78 Accepts]: Start accepts. Automaton has 1205 states and 1988 transitions. Word has length 492 [2025-03-17 00:11:10,147 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-17 00:11:10,147 INFO L471 AbstractCegarLoop]: Abstraction has 1205 states and 1988 transitions. [2025-03-17 00:11:10,147 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 9 states, 9 states have (on average 10.555555555555555) internal successors, (95), 9 states have internal predecessors, (95), 1 states have call successors, (80), 1 states have call predecessors, (80), 1 states have return successors, (80), 1 states have call predecessors, (80), 1 states have call successors, (80) [2025-03-17 00:11:10,147 INFO L276 IsEmpty]: Start isEmpty. Operand 1205 states and 1988 transitions. [2025-03-17 00:11:10,150 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 493 [2025-03-17 00:11:10,150 INFO L210 NwaCegarLoop]: Found error trace [2025-03-17 00:11:10,150 INFO L218 NwaCegarLoop]: trace histogram [80, 80, 80, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-03-17 00:11:10,150 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable9 [2025-03-17 00:11:10,150 INFO L396 AbstractCegarLoop]: === Iteration 11 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-03-17 00:11:10,151 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-17 00:11:10,151 INFO L85 PathProgramCache]: Analyzing trace with hash -858993969, now seen corresponding path program 1 times [2025-03-17 00:11:10,151 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-17 00:11:10,151 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1685791752] [2025-03-17 00:11:10,151 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-17 00:11:10,151 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-17 00:11:10,167 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 492 statements into 1 equivalence classes. [2025-03-17 00:11:10,229 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 492 of 492 statements. [2025-03-17 00:11:10,230 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-17 00:11:10,230 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-17 00:11:13,547 INFO L134 CoverageAnalysis]: Checked inductivity of 12640 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 12640 trivial. 0 not checked. [2025-03-17 00:11:13,547 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-17 00:11:13,547 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1685791752] [2025-03-17 00:11:13,547 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1685791752] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-17 00:11:13,547 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-17 00:11:13,547 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [9] imperfect sequences [] total 9 [2025-03-17 00:11:13,547 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1018350100] [2025-03-17 00:11:13,548 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-17 00:11:13,548 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 9 states [2025-03-17 00:11:13,548 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-17 00:11:13,548 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2025-03-17 00:11:13,548 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=25, Invalid=47, Unknown=0, NotChecked=0, Total=72 [2025-03-17 00:11:13,549 INFO L87 Difference]: Start difference. First operand 1205 states and 1988 transitions. Second operand has 9 states, 9 states have (on average 10.555555555555555) internal successors, (95), 9 states have internal predecessors, (95), 1 states have call successors, (80), 1 states have call predecessors, (80), 1 states have return successors, (80), 1 states have call predecessors, (80), 1 states have call successors, (80) [2025-03-17 00:11:13,979 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-17 00:11:13,979 INFO L93 Difference]: Finished difference Result 2427 states and 3912 transitions. [2025-03-17 00:11:13,980 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2025-03-17 00:11:13,980 INFO L78 Accepts]: Start accepts. Automaton has has 9 states, 9 states have (on average 10.555555555555555) internal successors, (95), 9 states have internal predecessors, (95), 1 states have call successors, (80), 1 states have call predecessors, (80), 1 states have return successors, (80), 1 states have call predecessors, (80), 1 states have call successors, (80) Word has length 492 [2025-03-17 00:11:13,981 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-17 00:11:13,988 INFO L225 Difference]: With dead ends: 2427 [2025-03-17 00:11:13,988 INFO L226 Difference]: Without dead ends: 1555 [2025-03-17 00:11:13,990 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 12 GetRequests, 4 SyntacticMatches, 0 SemanticMatches, 8 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 4 ImplicationChecksByTransitivity, 0.4s TimeCoverageRelationStatistics Valid=33, Invalid=57, Unknown=0, NotChecked=0, Total=90 [2025-03-17 00:11:13,990 INFO L435 NwaCegarLoop]: 349 mSDtfsCounter, 187 mSDsluCounter, 1320 mSDsCounter, 0 mSdLazyCounter, 254 mSolverCounterSat, 3 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.3s Time, 0 mProtectedPredicate, 0 mProtectedAction, 187 SdHoareTripleChecker+Valid, 1669 SdHoareTripleChecker+Invalid, 257 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 3 IncrementalHoareTripleChecker+Valid, 254 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.3s IncrementalHoareTripleChecker+Time [2025-03-17 00:11:13,990 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [187 Valid, 1669 Invalid, 257 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [3 Valid, 254 Invalid, 0 Unknown, 0 Unchecked, 0.3s Time] [2025-03-17 00:11:13,991 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1555 states. [2025-03-17 00:11:14,060 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1555 to 1209. [2025-03-17 00:11:14,062 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 1209 states, 891 states have (on average 1.5488215488215489) internal successors, (1380), 897 states have internal predecessors, (1380), 308 states have call successors, (308), 9 states have call predecessors, (308), 9 states have return successors, (308), 302 states have call predecessors, (308), 308 states have call successors, (308) [2025-03-17 00:11:14,064 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1209 states to 1209 states and 1996 transitions. [2025-03-17 00:11:14,066 INFO L78 Accepts]: Start accepts. Automaton has 1209 states and 1996 transitions. Word has length 492 [2025-03-17 00:11:14,066 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-17 00:11:14,066 INFO L471 AbstractCegarLoop]: Abstraction has 1209 states and 1996 transitions. [2025-03-17 00:11:14,067 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 9 states, 9 states have (on average 10.555555555555555) internal successors, (95), 9 states have internal predecessors, (95), 1 states have call successors, (80), 1 states have call predecessors, (80), 1 states have return successors, (80), 1 states have call predecessors, (80), 1 states have call successors, (80) [2025-03-17 00:11:14,067 INFO L276 IsEmpty]: Start isEmpty. Operand 1209 states and 1996 transitions. [2025-03-17 00:11:14,070 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 493 [2025-03-17 00:11:14,070 INFO L210 NwaCegarLoop]: Found error trace [2025-03-17 00:11:14,070 INFO L218 NwaCegarLoop]: trace histogram [80, 80, 80, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-03-17 00:11:14,070 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable10 [2025-03-17 00:11:14,071 INFO L396 AbstractCegarLoop]: === Iteration 12 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-03-17 00:11:14,071 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-17 00:11:14,071 INFO L85 PathProgramCache]: Analyzing trace with hash -662480464, now seen corresponding path program 1 times [2025-03-17 00:11:14,071 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-17 00:11:14,072 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [476327797] [2025-03-17 00:11:14,072 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-17 00:11:14,072 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-17 00:11:14,097 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 492 statements into 1 equivalence classes. [2025-03-17 00:11:14,164 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 492 of 492 statements. [2025-03-17 00:11:14,164 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-17 00:11:14,164 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-17 00:11:18,950 INFO L134 CoverageAnalysis]: Checked inductivity of 12640 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 12640 trivial. 0 not checked. [2025-03-17 00:11:18,950 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-17 00:11:18,950 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [476327797] [2025-03-17 00:11:18,950 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [476327797] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-17 00:11:18,950 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-17 00:11:18,950 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [9] imperfect sequences [] total 9 [2025-03-17 00:11:18,950 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2000475467] [2025-03-17 00:11:18,950 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-17 00:11:18,951 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 9 states [2025-03-17 00:11:18,951 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-17 00:11:18,951 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2025-03-17 00:11:18,951 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=26, Invalid=46, Unknown=0, NotChecked=0, Total=72 [2025-03-17 00:11:18,952 INFO L87 Difference]: Start difference. First operand 1209 states and 1996 transitions. Second operand has 9 states, 9 states have (on average 10.555555555555555) internal successors, (95), 9 states have internal predecessors, (95), 1 states have call successors, (80), 1 states have call predecessors, (80), 1 states have return successors, (80), 1 states have call predecessors, (80), 1 states have call successors, (80) [2025-03-17 00:11:19,765 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-17 00:11:19,765 INFO L93 Difference]: Finished difference Result 2339 states and 3784 transitions. [2025-03-17 00:11:19,766 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2025-03-17 00:11:19,766 INFO L78 Accepts]: Start accepts. Automaton has has 9 states, 9 states have (on average 10.555555555555555) internal successors, (95), 9 states have internal predecessors, (95), 1 states have call successors, (80), 1 states have call predecessors, (80), 1 states have return successors, (80), 1 states have call predecessors, (80), 1 states have call successors, (80) Word has length 492 [2025-03-17 00:11:19,767 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-17 00:11:19,774 INFO L225 Difference]: With dead ends: 2339 [2025-03-17 00:11:19,774 INFO L226 Difference]: Without dead ends: 1463 [2025-03-17 00:11:19,776 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 15 GetRequests, 3 SyntacticMatches, 0 SemanticMatches, 12 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 10 ImplicationChecksByTransitivity, 0.8s TimeCoverageRelationStatistics Valid=71, Invalid=111, Unknown=0, NotChecked=0, Total=182 [2025-03-17 00:11:19,777 INFO L435 NwaCegarLoop]: 334 mSDtfsCounter, 240 mSDsluCounter, 1281 mSDsCounter, 0 mSdLazyCounter, 209 mSolverCounterSat, 3 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.4s Time, 0 mProtectedPredicate, 0 mProtectedAction, 240 SdHoareTripleChecker+Valid, 1615 SdHoareTripleChecker+Invalid, 212 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 3 IncrementalHoareTripleChecker+Valid, 209 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.4s IncrementalHoareTripleChecker+Time [2025-03-17 00:11:19,777 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [240 Valid, 1615 Invalid, 212 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [3 Valid, 209 Invalid, 0 Unknown, 0 Unchecked, 0.4s Time] [2025-03-17 00:11:19,778 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1463 states. [2025-03-17 00:11:19,875 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1463 to 1205. [2025-03-17 00:11:19,877 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 1205 states, 887 states have (on average 1.5467869222096957) internal successors, (1372), 893 states have internal predecessors, (1372), 308 states have call successors, (308), 9 states have call predecessors, (308), 9 states have return successors, (308), 302 states have call predecessors, (308), 308 states have call successors, (308) [2025-03-17 00:11:19,879 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1205 states to 1205 states and 1988 transitions. [2025-03-17 00:11:19,881 INFO L78 Accepts]: Start accepts. Automaton has 1205 states and 1988 transitions. Word has length 492 [2025-03-17 00:11:19,882 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-17 00:11:19,882 INFO L471 AbstractCegarLoop]: Abstraction has 1205 states and 1988 transitions. [2025-03-17 00:11:19,882 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 9 states, 9 states have (on average 10.555555555555555) internal successors, (95), 9 states have internal predecessors, (95), 1 states have call successors, (80), 1 states have call predecessors, (80), 1 states have return successors, (80), 1 states have call predecessors, (80), 1 states have call successors, (80) [2025-03-17 00:11:19,882 INFO L276 IsEmpty]: Start isEmpty. Operand 1205 states and 1988 transitions. [2025-03-17 00:11:19,885 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 493 [2025-03-17 00:11:19,885 INFO L210 NwaCegarLoop]: Found error trace [2025-03-17 00:11:19,885 INFO L218 NwaCegarLoop]: trace histogram [80, 80, 80, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-03-17 00:11:19,885 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable11 [2025-03-17 00:11:19,886 INFO L396 AbstractCegarLoop]: === Iteration 13 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-03-17 00:11:19,887 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-17 00:11:19,887 INFO L85 PathProgramCache]: Analyzing trace with hash -1849458097, now seen corresponding path program 1 times [2025-03-17 00:11:19,887 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-17 00:11:19,887 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [104433699] [2025-03-17 00:11:19,887 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-17 00:11:19,887 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-17 00:11:19,907 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 492 statements into 1 equivalence classes. [2025-03-17 00:11:19,972 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 492 of 492 statements. [2025-03-17 00:11:19,972 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-17 00:11:19,972 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-17 00:11:25,808 INFO L134 CoverageAnalysis]: Checked inductivity of 12640 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 12640 trivial. 0 not checked. [2025-03-17 00:11:25,808 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-17 00:11:25,808 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [104433699] [2025-03-17 00:11:25,808 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [104433699] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-17 00:11:25,808 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-17 00:11:25,808 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [13] imperfect sequences [] total 13 [2025-03-17 00:11:25,808 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1828546728] [2025-03-17 00:11:25,809 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-17 00:11:25,809 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 13 states [2025-03-17 00:11:25,809 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-17 00:11:25,809 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 13 interpolants. [2025-03-17 00:11:25,809 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=36, Invalid=120, Unknown=0, NotChecked=0, Total=156 [2025-03-17 00:11:25,810 INFO L87 Difference]: Start difference. First operand 1205 states and 1988 transitions. Second operand has 13 states, 13 states have (on average 7.3076923076923075) internal successors, (95), 13 states have internal predecessors, (95), 2 states have call successors, (80), 1 states have call predecessors, (80), 1 states have return successors, (80), 2 states have call predecessors, (80), 2 states have call successors, (80) [2025-03-17 00:11:27,855 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-17 00:11:27,855 INFO L93 Difference]: Finished difference Result 2675 states and 4262 transitions. [2025-03-17 00:11:27,856 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 12 states. [2025-03-17 00:11:27,856 INFO L78 Accepts]: Start accepts. Automaton has has 13 states, 13 states have (on average 7.3076923076923075) internal successors, (95), 13 states have internal predecessors, (95), 2 states have call successors, (80), 1 states have call predecessors, (80), 1 states have return successors, (80), 2 states have call predecessors, (80), 2 states have call successors, (80) Word has length 492 [2025-03-17 00:11:27,857 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-17 00:11:27,869 INFO L225 Difference]: With dead ends: 2675 [2025-03-17 00:11:27,869 INFO L226 Difference]: Without dead ends: 1803 [2025-03-17 00:11:27,871 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 25 GetRequests, 4 SyntacticMatches, 0 SemanticMatches, 21 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 57 ImplicationChecksByTransitivity, 0.9s TimeCoverageRelationStatistics Valid=137, Invalid=369, Unknown=0, NotChecked=0, Total=506 [2025-03-17 00:11:27,872 INFO L435 NwaCegarLoop]: 351 mSDtfsCounter, 685 mSDsluCounter, 1897 mSDsCounter, 0 mSdLazyCounter, 1209 mSolverCounterSat, 400 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 1.3s Time, 0 mProtectedPredicate, 0 mProtectedAction, 685 SdHoareTripleChecker+Valid, 2248 SdHoareTripleChecker+Invalid, 1609 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 400 IncrementalHoareTripleChecker+Valid, 1209 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 1.4s IncrementalHoareTripleChecker+Time [2025-03-17 00:11:27,872 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [685 Valid, 2248 Invalid, 1609 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [400 Valid, 1209 Invalid, 0 Unknown, 0 Unchecked, 1.4s Time] [2025-03-17 00:11:27,873 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1803 states. [2025-03-17 00:11:27,945 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1803 to 1221. [2025-03-17 00:11:27,950 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 1221 states, 903 states have (on average 1.5459579180509413) internal successors, (1396), 909 states have internal predecessors, (1396), 308 states have call successors, (308), 9 states have call predecessors, (308), 9 states have return successors, (308), 302 states have call predecessors, (308), 308 states have call successors, (308) [2025-03-17 00:11:27,953 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1221 states to 1221 states and 2012 transitions. [2025-03-17 00:11:27,956 INFO L78 Accepts]: Start accepts. Automaton has 1221 states and 2012 transitions. Word has length 492 [2025-03-17 00:11:27,956 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-17 00:11:27,956 INFO L471 AbstractCegarLoop]: Abstraction has 1221 states and 2012 transitions. [2025-03-17 00:11:27,957 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 13 states, 13 states have (on average 7.3076923076923075) internal successors, (95), 13 states have internal predecessors, (95), 2 states have call successors, (80), 1 states have call predecessors, (80), 1 states have return successors, (80), 2 states have call predecessors, (80), 2 states have call successors, (80) [2025-03-17 00:11:27,957 INFO L276 IsEmpty]: Start isEmpty. Operand 1221 states and 2012 transitions. [2025-03-17 00:11:27,959 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 493 [2025-03-17 00:11:27,959 INFO L210 NwaCegarLoop]: Found error trace [2025-03-17 00:11:27,959 INFO L218 NwaCegarLoop]: trace histogram [80, 80, 80, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-03-17 00:11:27,960 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable12 [2025-03-17 00:11:27,960 INFO L396 AbstractCegarLoop]: === Iteration 14 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-03-17 00:11:27,960 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-17 00:11:27,960 INFO L85 PathProgramCache]: Analyzing trace with hash -1652944592, now seen corresponding path program 1 times [2025-03-17 00:11:27,960 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-17 00:11:27,960 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1423759086] [2025-03-17 00:11:27,960 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-17 00:11:27,961 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-17 00:11:27,976 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 492 statements into 1 equivalence classes. [2025-03-17 00:11:28,011 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 492 of 492 statements. [2025-03-17 00:11:28,011 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-17 00:11:28,011 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-17 00:11:28,209 INFO L134 CoverageAnalysis]: Checked inductivity of 12640 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 12640 trivial. 0 not checked. [2025-03-17 00:11:28,210 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-17 00:11:28,210 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1423759086] [2025-03-17 00:11:28,210 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1423759086] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-17 00:11:28,210 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-17 00:11:28,210 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2025-03-17 00:11:28,210 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2075209878] [2025-03-17 00:11:28,210 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-17 00:11:28,211 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2025-03-17 00:11:28,211 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-17 00:11:28,211 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2025-03-17 00:11:28,211 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2025-03-17 00:11:28,211 INFO L87 Difference]: Start difference. First operand 1221 states and 2012 transitions. Second operand has 4 states, 4 states have (on average 23.75) internal successors, (95), 4 states have internal predecessors, (95), 1 states have call successors, (80), 1 states have call predecessors, (80), 1 states have return successors, (80), 1 states have call predecessors, (80), 1 states have call successors, (80) [2025-03-17 00:11:28,295 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-17 00:11:28,296 INFO L93 Difference]: Finished difference Result 2183 states and 3549 transitions. [2025-03-17 00:11:28,296 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2025-03-17 00:11:28,297 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 4 states have (on average 23.75) internal successors, (95), 4 states have internal predecessors, (95), 1 states have call successors, (80), 1 states have call predecessors, (80), 1 states have return successors, (80), 1 states have call predecessors, (80), 1 states have call successors, (80) Word has length 492 [2025-03-17 00:11:28,297 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-17 00:11:28,303 INFO L225 Difference]: With dead ends: 2183 [2025-03-17 00:11:28,303 INFO L226 Difference]: Without dead ends: 1311 [2025-03-17 00:11:28,305 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 6 GetRequests, 4 SyntacticMatches, 0 SemanticMatches, 2 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2025-03-17 00:11:28,305 INFO L435 NwaCegarLoop]: 364 mSDtfsCounter, 58 mSDsluCounter, 679 mSDsCounter, 0 mSdLazyCounter, 58 mSolverCounterSat, 3 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 58 SdHoareTripleChecker+Valid, 1043 SdHoareTripleChecker+Invalid, 61 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 3 IncrementalHoareTripleChecker+Valid, 58 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2025-03-17 00:11:28,305 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [58 Valid, 1043 Invalid, 61 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [3 Valid, 58 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2025-03-17 00:11:28,306 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1311 states. [2025-03-17 00:11:28,368 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1311 to 1161. [2025-03-17 00:11:28,370 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 1161 states, 858 states have (on average 1.5512820512820513) internal successors, (1331), 860 states have internal predecessors, (1331), 292 states have call successors, (292), 10 states have call predecessors, (292), 10 states have return successors, (292), 290 states have call predecessors, (292), 292 states have call successors, (292) [2025-03-17 00:11:28,372 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1161 states to 1161 states and 1915 transitions. [2025-03-17 00:11:28,375 INFO L78 Accepts]: Start accepts. Automaton has 1161 states and 1915 transitions. Word has length 492 [2025-03-17 00:11:28,375 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-17 00:11:28,375 INFO L471 AbstractCegarLoop]: Abstraction has 1161 states and 1915 transitions. [2025-03-17 00:11:28,375 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 23.75) internal successors, (95), 4 states have internal predecessors, (95), 1 states have call successors, (80), 1 states have call predecessors, (80), 1 states have return successors, (80), 1 states have call predecessors, (80), 1 states have call successors, (80) [2025-03-17 00:11:28,376 INFO L276 IsEmpty]: Start isEmpty. Operand 1161 states and 1915 transitions. [2025-03-17 00:11:28,378 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 493 [2025-03-17 00:11:28,378 INFO L210 NwaCegarLoop]: Found error trace [2025-03-17 00:11:28,378 INFO L218 NwaCegarLoop]: trace histogram [80, 80, 80, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-03-17 00:11:28,378 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable13 [2025-03-17 00:11:28,378 INFO L396 AbstractCegarLoop]: === Iteration 15 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-03-17 00:11:28,379 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-17 00:11:28,379 INFO L85 PathProgramCache]: Analyzing trace with hash 648557840, now seen corresponding path program 1 times [2025-03-17 00:11:28,379 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-17 00:11:28,379 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [956111755] [2025-03-17 00:11:28,379 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-17 00:11:28,379 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-17 00:11:28,394 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 492 statements into 1 equivalence classes. [2025-03-17 00:11:28,436 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 492 of 492 statements. [2025-03-17 00:11:28,436 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-17 00:11:28,436 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-17 00:11:35,353 INFO L134 CoverageAnalysis]: Checked inductivity of 12640 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 12640 trivial. 0 not checked. [2025-03-17 00:11:35,354 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-17 00:11:35,354 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [956111755] [2025-03-17 00:11:35,354 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [956111755] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-17 00:11:35,354 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-17 00:11:35,354 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [12] imperfect sequences [] total 12 [2025-03-17 00:11:35,354 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [536281437] [2025-03-17 00:11:35,356 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-17 00:11:35,356 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 12 states [2025-03-17 00:11:35,356 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-17 00:11:35,356 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 12 interpolants. [2025-03-17 00:11:35,357 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=44, Invalid=88, Unknown=0, NotChecked=0, Total=132 [2025-03-17 00:11:35,357 INFO L87 Difference]: Start difference. First operand 1161 states and 1915 transitions. Second operand has 12 states, 11 states have (on average 8.636363636363637) internal successors, (95), 12 states have internal predecessors, (95), 2 states have call successors, (80), 1 states have call predecessors, (80), 1 states have return successors, (80), 1 states have call predecessors, (80), 2 states have call successors, (80) [2025-03-17 00:11:36,849 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-17 00:11:36,849 INFO L93 Difference]: Finished difference Result 2189 states and 3550 transitions. [2025-03-17 00:11:36,849 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 11 states. [2025-03-17 00:11:36,850 INFO L78 Accepts]: Start accepts. Automaton has has 12 states, 11 states have (on average 8.636363636363637) internal successors, (95), 12 states have internal predecessors, (95), 2 states have call successors, (80), 1 states have call predecessors, (80), 1 states have return successors, (80), 1 states have call predecessors, (80), 2 states have call successors, (80) Word has length 492 [2025-03-17 00:11:36,850 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-17 00:11:36,858 INFO L225 Difference]: With dead ends: 2189 [2025-03-17 00:11:36,858 INFO L226 Difference]: Without dead ends: 1381 [2025-03-17 00:11:36,861 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 23 GetRequests, 5 SyntacticMatches, 0 SemanticMatches, 18 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 48 ImplicationChecksByTransitivity, 1.1s TimeCoverageRelationStatistics Valid=123, Invalid=257, Unknown=0, NotChecked=0, Total=380 [2025-03-17 00:11:36,862 INFO L435 NwaCegarLoop]: 352 mSDtfsCounter, 425 mSDsluCounter, 1996 mSDsCounter, 0 mSdLazyCounter, 918 mSolverCounterSat, 323 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.9s Time, 0 mProtectedPredicate, 0 mProtectedAction, 425 SdHoareTripleChecker+Valid, 2348 SdHoareTripleChecker+Invalid, 1241 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 323 IncrementalHoareTripleChecker+Valid, 918 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 1.0s IncrementalHoareTripleChecker+Time [2025-03-17 00:11:36,863 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [425 Valid, 2348 Invalid, 1241 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [323 Valid, 918 Invalid, 0 Unknown, 0 Unchecked, 1.0s Time] [2025-03-17 00:11:36,863 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1381 states. [2025-03-17 00:11:36,928 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1381 to 1153. [2025-03-17 00:11:36,930 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 1153 states, 850 states have (on average 1.556470588235294) internal successors, (1323), 852 states have internal predecessors, (1323), 292 states have call successors, (292), 10 states have call predecessors, (292), 10 states have return successors, (292), 290 states have call predecessors, (292), 292 states have call successors, (292) [2025-03-17 00:11:36,932 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1153 states to 1153 states and 1907 transitions. [2025-03-17 00:11:36,934 INFO L78 Accepts]: Start accepts. Automaton has 1153 states and 1907 transitions. Word has length 492 [2025-03-17 00:11:36,935 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-17 00:11:36,935 INFO L471 AbstractCegarLoop]: Abstraction has 1153 states and 1907 transitions. [2025-03-17 00:11:36,935 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 12 states, 11 states have (on average 8.636363636363637) internal successors, (95), 12 states have internal predecessors, (95), 2 states have call successors, (80), 1 states have call predecessors, (80), 1 states have return successors, (80), 1 states have call predecessors, (80), 2 states have call successors, (80) [2025-03-17 00:11:36,935 INFO L276 IsEmpty]: Start isEmpty. Operand 1153 states and 1907 transitions. [2025-03-17 00:11:36,938 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 494 [2025-03-17 00:11:36,938 INFO L210 NwaCegarLoop]: Found error trace [2025-03-17 00:11:36,938 INFO L218 NwaCegarLoop]: trace histogram [80, 80, 80, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-03-17 00:11:36,938 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable14 [2025-03-17 00:11:36,938 INFO L396 AbstractCegarLoop]: === Iteration 16 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-03-17 00:11:36,939 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-17 00:11:36,939 INFO L85 PathProgramCache]: Analyzing trace with hash 306414875, now seen corresponding path program 1 times [2025-03-17 00:11:36,939 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-17 00:11:36,939 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1005147758] [2025-03-17 00:11:36,939 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-17 00:11:36,939 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-17 00:11:36,956 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 493 statements into 1 equivalence classes. [2025-03-17 00:11:36,973 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 493 of 493 statements. [2025-03-17 00:11:36,973 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-17 00:11:36,973 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat