./Ultimate.py --spec ../sv-benchmarks/c/properties/unreach-call.prp --file ../sv-benchmarks/c/hardness-nfm22/hardness_fillercode_fillercodesize_ps-cn-250_file-58.i --full-output --architecture 32bit -------------------------------------------------------------------------------- Checking for ERROR reachability Using default analysis Version 798a7b37 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-58.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 59e2360cc163a0d2384c49f36d50ca727f3204f5fadd596107d45f50dd73df19 --- Real Ultimate output --- This is Ultimate 0.3.0-?-798a7b3-m [2025-03-03 19:48:57,757 INFO L188 SettingsManager]: Resetting all preferences to default values... [2025-03-03 19:48:57,806 INFO L114 SettingsManager]: Loading settings from /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/config/svcomp-Reach-32bit-Automizer_Default.epf [2025-03-03 19:48:57,810 WARN L101 SettingsManager]: Preference file contains the following unknown settings: [2025-03-03 19:48:57,811 WARN L103 SettingsManager]: * de.uni_freiburg.informatik.ultimate.core.Log level for class [2025-03-03 19:48:57,832 INFO L130 SettingsManager]: Preferences different from defaults after loading the file: [2025-03-03 19:48:57,832 INFO L151 SettingsManager]: Preferences of UltimateCore differ from their defaults: [2025-03-03 19:48:57,833 INFO L153 SettingsManager]: * Log level for class=de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher=ERROR; [2025-03-03 19:48:57,833 INFO L151 SettingsManager]: Preferences of Boogie Preprocessor differ from their defaults: [2025-03-03 19:48:57,833 INFO L153 SettingsManager]: * Use memory slicer=true [2025-03-03 19:48:57,833 INFO L151 SettingsManager]: Preferences of Boogie Procedure Inliner differ from their defaults: [2025-03-03 19:48:57,834 INFO L153 SettingsManager]: * Ignore calls to procedures called more than once=ONLY_FOR_SEQUENTIAL_PROGRAMS [2025-03-03 19:48:57,834 INFO L151 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2025-03-03 19:48:57,834 INFO L153 SettingsManager]: * Create parallel compositions if possible=false [2025-03-03 19:48:57,835 INFO L153 SettingsManager]: * Use SBE=true [2025-03-03 19:48:57,835 INFO L151 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2025-03-03 19:48:57,835 INFO L153 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2025-03-03 19:48:57,835 INFO L153 SettingsManager]: * sizeof long=4 [2025-03-03 19:48:57,835 INFO L153 SettingsManager]: * Overapproximate operations on floating types=true [2025-03-03 19:48:57,835 INFO L153 SettingsManager]: * sizeof POINTER=4 [2025-03-03 19:48:57,835 INFO L153 SettingsManager]: * Check division by zero=IGNORE [2025-03-03 19:48:57,835 INFO L153 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2025-03-03 19:48:57,836 INFO L153 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2025-03-03 19:48:57,836 INFO L153 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2025-03-03 19:48:57,836 INFO L153 SettingsManager]: * sizeof long double=12 [2025-03-03 19:48:57,836 INFO L153 SettingsManager]: * Check if freed pointer was valid=false [2025-03-03 19:48:57,836 INFO L153 SettingsManager]: * Behaviour of calls to undefined functions=OVERAPPROXIMATE_BEHAVIOUR [2025-03-03 19:48:57,836 INFO L153 SettingsManager]: * Use constant arrays=true [2025-03-03 19:48:57,836 INFO L151 SettingsManager]: Preferences of IcfgBuilder differ from their defaults: [2025-03-03 19:48:57,836 INFO L153 SettingsManager]: * Size of a code block=SequenceOfStatements [2025-03-03 19:48:57,836 INFO L153 SettingsManager]: * Only consider context switches at boundaries of atomic blocks=true [2025-03-03 19:48:57,836 INFO L153 SettingsManager]: * SMT solver=External_DefaultMode [2025-03-03 19:48:57,836 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2025-03-03 19:48:57,836 INFO L151 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2025-03-03 19:48:57,836 INFO L153 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2025-03-03 19:48:57,836 INFO L153 SettingsManager]: * Compute procedure contracts=false [2025-03-03 19:48:57,836 INFO L153 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopHeads [2025-03-03 19:48:57,836 INFO L153 SettingsManager]: * Trace refinement strategy=CAMEL [2025-03-03 19:48:57,836 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2025-03-03 19:48:57,836 INFO L153 SettingsManager]: * Apply one-shot large block encoding in concurrent analysis=false [2025-03-03 19:48:57,836 INFO L153 SettingsManager]: * Automaton type used in concurrency analysis=PETRI_NET [2025-03-03 19:48:57,836 INFO L153 SettingsManager]: * Order on configurations for Petri net unfoldings=DBO [2025-03-03 19:48:57,836 INFO L153 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode [2025-03-03 19:48:57,836 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 -> 59e2360cc163a0d2384c49f36d50ca727f3204f5fadd596107d45f50dd73df19 [2025-03-03 19:48:58,073 INFO L75 nceAwareModelManager]: Repository-Root is: /tmp [2025-03-03 19:48:58,082 INFO L261 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2025-03-03 19:48:58,084 INFO L217 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2025-03-03 19:48:58,085 INFO L270 PluginConnector]: Initializing CDTParser... [2025-03-03 19:48:58,085 INFO L274 PluginConnector]: CDTParser initialized [2025-03-03 19:48:58,086 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-58.i [2025-03-03 19:48:59,281 INFO L533 CDTParser]: Created temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/ab3a64a8c/9296945e5ef0468db229bd5ae909e749/FLAGe22610841 [2025-03-03 19:48:59,571 INFO L384 CDTParser]: Found 1 translation units. [2025-03-03 19:48:59,572 INFO L180 CDTParser]: Scanning /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/hardness-nfm22/hardness_fillercode_fillercodesize_ps-cn-250_file-58.i [2025-03-03 19:48:59,584 INFO L427 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/ab3a64a8c/9296945e5ef0468db229bd5ae909e749/FLAGe22610841 [2025-03-03 19:48:59,850 INFO L435 CDTParser]: Successfully deleted /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/ab3a64a8c/9296945e5ef0468db229bd5ae909e749 [2025-03-03 19:48:59,851 INFO L299 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2025-03-03 19:48:59,853 INFO L133 ToolchainWalker]: Walking toolchain with 6 elements. [2025-03-03 19:48:59,853 INFO L112 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2025-03-03 19:48:59,854 INFO L270 PluginConnector]: Initializing CACSL2BoogieTranslator... [2025-03-03 19:48:59,856 INFO L274 PluginConnector]: CACSL2BoogieTranslator initialized [2025-03-03 19:48:59,857 INFO L184 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 03.03 07:48:59" (1/1) ... [2025-03-03 19:48:59,858 INFO L204 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@25cd34f6 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 03.03 07:48:59, skipping insertion in model container [2025-03-03 19:48:59,858 INFO L184 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 03.03 07:48:59" (1/1) ... [2025-03-03 19:48:59,876 INFO L175 MainTranslator]: Built tables and reachable declarations [2025-03-03 19:48:59,980 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-58.i[916,929] [2025-03-03 19:49:00,066 INFO L210 PostProcessor]: Analyzing one entry point: main [2025-03-03 19:49:00,076 INFO L200 MainTranslator]: Completed pre-run [2025-03-03 19:49:00,085 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-58.i[916,929] [2025-03-03 19:49:00,139 INFO L210 PostProcessor]: Analyzing one entry point: main [2025-03-03 19:49:00,154 INFO L204 MainTranslator]: Completed translation [2025-03-03 19:49:00,155 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 03.03 07:49:00 WrapperNode [2025-03-03 19:49:00,155 INFO L131 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2025-03-03 19:49:00,157 INFO L112 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2025-03-03 19:49:00,157 INFO L270 PluginConnector]: Initializing Boogie Procedure Inliner... [2025-03-03 19:49:00,157 INFO L274 PluginConnector]: Boogie Procedure Inliner initialized [2025-03-03 19:49:00,161 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 03.03 07:49:00" (1/1) ... [2025-03-03 19:49:00,175 INFO L184 PluginConnector]: Executing the observer Inliner from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 03.03 07:49:00" (1/1) ... [2025-03-03 19:49:00,207 INFO L138 Inliner]: procedures = 26, calls = 87, calls flagged for inlining = 8, calls inlined = 8, statements flattened = 542 [2025-03-03 19:49:00,207 INFO L131 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2025-03-03 19:49:00,208 INFO L112 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2025-03-03 19:49:00,208 INFO L270 PluginConnector]: Initializing Boogie Preprocessor... [2025-03-03 19:49:00,208 INFO L274 PluginConnector]: Boogie Preprocessor initialized [2025-03-03 19:49:00,215 INFO L184 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 03.03 07:49:00" (1/1) ... [2025-03-03 19:49:00,216 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 03.03 07:49:00" (1/1) ... [2025-03-03 19:49:00,220 INFO L184 PluginConnector]: Executing the observer MemorySlicer from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 03.03 07:49:00" (1/1) ... [2025-03-03 19:49:00,242 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-03 19:49:00,242 INFO L184 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 03.03 07:49:00" (1/1) ... [2025-03-03 19:49:00,242 INFO L184 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 03.03 07:49:00" (1/1) ... [2025-03-03 19:49:00,260 INFO L184 PluginConnector]: Executing the observer ReplaceArrayAssignments from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 03.03 07:49:00" (1/1) ... [2025-03-03 19:49:00,265 INFO L184 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 03.03 07:49:00" (1/1) ... [2025-03-03 19:49:00,267 INFO L184 PluginConnector]: Executing the observer LTLStepAnnotator from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 03.03 07:49:00" (1/1) ... [2025-03-03 19:49:00,270 INFO L184 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 03.03 07:49:00" (1/1) ... [2025-03-03 19:49:00,275 INFO L131 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2025-03-03 19:49:00,275 INFO L112 PluginConnector]: ------------------------IcfgBuilder---------------------------- [2025-03-03 19:49:00,275 INFO L270 PluginConnector]: Initializing IcfgBuilder... [2025-03-03 19:49:00,276 INFO L274 PluginConnector]: IcfgBuilder initialized [2025-03-03 19:49:00,276 INFO L184 PluginConnector]: Executing the observer IcfgBuilderObserver from plugin IcfgBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 03.03 07:49:00" (1/1) ... [2025-03-03 19:49:00,283 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2025-03-03 19:49:00,292 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2025-03-03 19:49:00,304 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-03 19:49:00,307 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-03 19:49:00,325 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocInit [2025-03-03 19:49:00,325 INFO L130 BoogieDeclarations]: Found specification of procedure assume_abort_if_not [2025-03-03 19:49:00,325 INFO L138 BoogieDeclarations]: Found implementation of procedure assume_abort_if_not [2025-03-03 19:49:00,325 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int#0 [2025-03-03 19:49:00,325 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2025-03-03 19:49:00,325 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2025-03-03 19:49:00,418 INFO L256 CfgBuilder]: Building ICFG [2025-03-03 19:49:00,419 INFO L286 CfgBuilder]: Building CFG for each procedure with an implementation [2025-03-03 19:49:01,116 INFO L? ?]: Removed 21 outVars from TransFormulas that were not future-live. [2025-03-03 19:49:01,116 INFO L307 CfgBuilder]: Performing block encoding [2025-03-03 19:49:01,138 INFO L331 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2025-03-03 19:49:01,140 INFO L336 CfgBuilder]: Removed 0 assume(true) statements. [2025-03-03 19:49:01,140 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.icfgbuilder CFG 03.03 07:49:01 BoogieIcfgContainer [2025-03-03 19:49:01,141 INFO L131 PluginConnector]: ------------------------ END IcfgBuilder---------------------------- [2025-03-03 19:49:01,142 INFO L112 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2025-03-03 19:49:01,142 INFO L270 PluginConnector]: Initializing TraceAbstraction... [2025-03-03 19:49:01,145 INFO L274 PluginConnector]: TraceAbstraction initialized [2025-03-03 19:49:01,145 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 03.03 07:48:59" (1/3) ... [2025-03-03 19:49:01,146 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@1414b806 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 03.03 07:49:01, skipping insertion in model container [2025-03-03 19:49:01,146 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 03.03 07:49:00" (2/3) ... [2025-03-03 19:49:01,146 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@1414b806 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 03.03 07:49:01, skipping insertion in model container [2025-03-03 19:49:01,146 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.icfgbuilder CFG 03.03 07:49:01" (3/3) ... [2025-03-03 19:49:01,147 INFO L128 eAbstractionObserver]: Analyzing ICFG hardness_fillercode_fillercodesize_ps-cn-250_file-58.i [2025-03-03 19:49:01,156 INFO L216 ceAbstractionStarter]: Automizer settings: Hoare:LoopHeads NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2025-03-03 19:49:01,159 INFO L151 ceAbstractionStarter]: Applying trace abstraction to ICFG hardness_fillercode_fillercodesize_ps-cn-250_file-58.i that has 2 procedures, 227 locations, 1 initial locations, 1 loop locations, and 1 error locations. [2025-03-03 19:49:01,209 INFO L332 AbstractCegarLoop]: ======== Iteration 0 == of CEGAR loop == AllErrorsAtOnce ======== [2025-03-03 19:49:01,219 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;@2b4b295a, mLbeIndependenceSettings=[IndependenceType=SEMANTIC, AbstractionType=NONE, UseConditional=false, UseSemiCommutativity=true, Solver=Z3, SolverTimeout=1000ms] [2025-03-03 19:49:01,219 INFO L334 AbstractCegarLoop]: Starting to check reachability of 1 error locations. [2025-03-03 19:49:01,224 INFO L276 IsEmpty]: Start isEmpty. Operand has 227 states, 150 states have (on average 1.54) internal successors, (231), 151 states have internal predecessors, (231), 74 states have call successors, (74), 1 states have call predecessors, (74), 1 states have return successors, (74), 74 states have call predecessors, (74), 74 states have call successors, (74) [2025-03-03 19:49:01,246 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 469 [2025-03-03 19:49:01,246 INFO L210 NwaCegarLoop]: Found error trace [2025-03-03 19:49:01,247 INFO L218 NwaCegarLoop]: trace histogram [74, 74, 74, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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-03 19:49:01,247 INFO L396 AbstractCegarLoop]: === Iteration 1 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-03-03 19:49:01,250 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-03 19:49:01,251 INFO L85 PathProgramCache]: Analyzing trace with hash -1228085091, now seen corresponding path program 1 times [2025-03-03 19:49:01,256 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-03 19:49:01,256 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [524402196] [2025-03-03 19:49:01,257 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-03 19:49:01,257 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-03 19:49:01,357 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 468 statements into 1 equivalence classes. [2025-03-03 19:49:01,392 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 468 of 468 statements. [2025-03-03 19:49:01,397 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-03 19:49:01,397 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-03 19:49:01,741 INFO L134 CoverageAnalysis]: Checked inductivity of 10804 backedges. 0 proven. 146 refuted. 0 times theorem prover too weak. 10658 trivial. 0 not checked. [2025-03-03 19:49:01,741 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-03 19:49:01,742 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [524402196] [2025-03-03 19:49:01,743 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [524402196] provided 0 perfect and 1 imperfect interpolant sequences [2025-03-03 19:49:01,743 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [326421428] [2025-03-03 19:49:01,743 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-03 19:49:01,744 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-03-03 19:49:01,744 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2025-03-03 19:49:01,746 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-03 19:49:01,748 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-03 19:49:01,887 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 468 statements into 1 equivalence classes. [2025-03-03 19:49:02,020 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 468 of 468 statements. [2025-03-03 19:49:02,021 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-03 19:49:02,021 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-03 19:49:02,025 INFO L256 TraceCheckSpWp]: Trace formula consists of 1058 conjuncts, 1 conjuncts are in the unsatisfiable core [2025-03-03 19:49:02,039 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-03-03 19:49:02,094 INFO L134 CoverageAnalysis]: Checked inductivity of 10804 backedges. 146 proven. 0 refuted. 0 times theorem prover too weak. 10658 trivial. 0 not checked. [2025-03-03 19:49:02,094 INFO L308 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2025-03-03 19:49:02,094 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [326421428] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-03 19:49:02,094 INFO L185 FreeRefinementEngine]: Found 1 perfect and 1 imperfect interpolant sequences. [2025-03-03 19:49:02,095 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [2] total 2 [2025-03-03 19:49:02,096 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1655438168] [2025-03-03 19:49:02,096 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-03 19:49:02,102 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 2 states [2025-03-03 19:49:02,103 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-03 19:49:02,117 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 2 interpolants. [2025-03-03 19:49:02,118 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=1, Invalid=1, Unknown=0, NotChecked=0, Total=2 [2025-03-03 19:49:02,120 INFO L87 Difference]: Start difference. First operand has 227 states, 150 states have (on average 1.54) internal successors, (231), 151 states have internal predecessors, (231), 74 states have call successors, (74), 1 states have call predecessors, (74), 1 states have return successors, (74), 74 states have call predecessors, (74), 74 states have call successors, (74) Second operand has 2 states, 2 states have (on average 51.5) internal successors, (103), 2 states have internal predecessors, (103), 2 states have call successors, (74), 2 states have call predecessors, (74), 1 states have return successors, (74), 1 states have call predecessors, (74), 2 states have call successors, (74) [2025-03-03 19:49:02,179 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-03 19:49:02,179 INFO L93 Difference]: Finished difference Result 448 states and 827 transitions. [2025-03-03 19:49:02,180 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 2 states. [2025-03-03 19:49:02,181 INFO L78 Accepts]: Start accepts. Automaton has has 2 states, 2 states have (on average 51.5) internal successors, (103), 2 states have internal predecessors, (103), 2 states have call successors, (74), 2 states have call predecessors, (74), 1 states have return successors, (74), 1 states have call predecessors, (74), 2 states have call successors, (74) Word has length 468 [2025-03-03 19:49:02,182 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-03 19:49:02,189 INFO L225 Difference]: With dead ends: 448 [2025-03-03 19:49:02,189 INFO L226 Difference]: Without dead ends: 224 [2025-03-03 19:49:02,192 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 469 GetRequests, 469 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-03 19:49:02,195 INFO L435 NwaCegarLoop]: 363 mSDtfsCounter, 0 mSDsluCounter, 0 mSDsCounter, 0 mSdLazyCounter, 10 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 0 SdHoareTripleChecker+Valid, 363 SdHoareTripleChecker+Invalid, 10 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 10 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2025-03-03 19:49:02,195 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [0 Valid, 363 Invalid, 10 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 10 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2025-03-03 19:49:02,205 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 224 states. [2025-03-03 19:49:02,235 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 224 to 224. [2025-03-03 19:49:02,237 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 224 states, 148 states have (on average 1.5202702702702702) internal successors, (225), 148 states have internal predecessors, (225), 74 states have call successors, (74), 1 states have call predecessors, (74), 1 states have return successors, (74), 74 states have call predecessors, (74), 74 states have call successors, (74) [2025-03-03 19:49:02,241 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 224 states to 224 states and 373 transitions. [2025-03-03 19:49:02,242 INFO L78 Accepts]: Start accepts. Automaton has 224 states and 373 transitions. Word has length 468 [2025-03-03 19:49:02,243 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-03 19:49:02,243 INFO L471 AbstractCegarLoop]: Abstraction has 224 states and 373 transitions. [2025-03-03 19:49:02,243 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 2 states, 2 states have (on average 51.5) internal successors, (103), 2 states have internal predecessors, (103), 2 states have call successors, (74), 2 states have call predecessors, (74), 1 states have return successors, (74), 1 states have call predecessors, (74), 2 states have call successors, (74) [2025-03-03 19:49:02,243 INFO L276 IsEmpty]: Start isEmpty. Operand 224 states and 373 transitions. [2025-03-03 19:49:02,254 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 469 [2025-03-03 19:49:02,254 INFO L210 NwaCegarLoop]: Found error trace [2025-03-03 19:49:02,254 INFO L218 NwaCegarLoop]: trace histogram [74, 74, 74, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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-03 19:49:02,261 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (2)] Ended with exit code 0 [2025-03-03 19:49:02,455 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-03 19:49:02,455 INFO L396 AbstractCegarLoop]: === Iteration 2 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-03-03 19:49:02,456 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-03 19:49:02,457 INFO L85 PathProgramCache]: Analyzing trace with hash 485409635, now seen corresponding path program 1 times [2025-03-03 19:49:02,457 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-03 19:49:02,457 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [308537907] [2025-03-03 19:49:02,457 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-03 19:49:02,457 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-03 19:49:02,485 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 468 statements into 1 equivalence classes. [2025-03-03 19:49:02,554 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 468 of 468 statements. [2025-03-03 19:49:02,554 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-03 19:49:02,554 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-03 19:49:02,904 INFO L134 CoverageAnalysis]: Checked inductivity of 10804 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 10804 trivial. 0 not checked. [2025-03-03 19:49:02,906 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-03 19:49:02,906 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [308537907] [2025-03-03 19:49:02,906 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [308537907] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-03 19:49:02,906 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-03 19:49:02,906 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2025-03-03 19:49:02,907 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1246013569] [2025-03-03 19:49:02,907 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-03 19:49:02,908 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2025-03-03 19:49:02,909 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-03 19:49:02,910 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2025-03-03 19:49:02,911 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-03-03 19:49:02,911 INFO L87 Difference]: Start difference. First operand 224 states and 373 transitions. Second operand has 3 states, 3 states have (on average 33.666666666666664) internal successors, (101), 3 states have internal predecessors, (101), 1 states have call successors, (74), 1 states have call predecessors, (74), 1 states have return successors, (74), 1 states have call predecessors, (74), 1 states have call successors, (74) [2025-03-03 19:49:03,046 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-03 19:49:03,046 INFO L93 Difference]: Finished difference Result 639 states and 1066 transitions. [2025-03-03 19:49:03,047 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2025-03-03 19:49:03,048 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 33.666666666666664) internal successors, (101), 3 states have internal predecessors, (101), 1 states have call successors, (74), 1 states have call predecessors, (74), 1 states have return successors, (74), 1 states have call predecessors, (74), 1 states have call successors, (74) Word has length 468 [2025-03-03 19:49:03,049 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-03 19:49:03,055 INFO L225 Difference]: With dead ends: 639 [2025-03-03 19:49:03,058 INFO L226 Difference]: Without dead ends: 418 [2025-03-03 19:49:03,060 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-03 19:49:03,063 INFO L435 NwaCegarLoop]: 346 mSDtfsCounter, 325 mSDsluCounter, 326 mSDsCounter, 0 mSdLazyCounter, 62 mSolverCounterSat, 2 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 325 SdHoareTripleChecker+Valid, 672 SdHoareTripleChecker+Invalid, 64 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 2 IncrementalHoareTripleChecker+Valid, 62 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2025-03-03 19:49:03,063 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [325 Valid, 672 Invalid, 64 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [2 Valid, 62 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2025-03-03 19:49:03,064 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 418 states. [2025-03-03 19:49:03,120 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 418 to 227. [2025-03-03 19:49:03,121 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 227 states, 151 states have (on average 1.5231788079470199) internal successors, (230), 151 states have internal predecessors, (230), 74 states have call successors, (74), 1 states have call predecessors, (74), 1 states have return successors, (74), 74 states have call predecessors, (74), 74 states have call successors, (74) [2025-03-03 19:49:03,122 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 227 states to 227 states and 378 transitions. [2025-03-03 19:49:03,122 INFO L78 Accepts]: Start accepts. Automaton has 227 states and 378 transitions. Word has length 468 [2025-03-03 19:49:03,125 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-03 19:49:03,126 INFO L471 AbstractCegarLoop]: Abstraction has 227 states and 378 transitions. [2025-03-03 19:49:03,126 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 33.666666666666664) internal successors, (101), 3 states have internal predecessors, (101), 1 states have call successors, (74), 1 states have call predecessors, (74), 1 states have return successors, (74), 1 states have call predecessors, (74), 1 states have call successors, (74) [2025-03-03 19:49:03,126 INFO L276 IsEmpty]: Start isEmpty. Operand 227 states and 378 transitions. [2025-03-03 19:49:03,131 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 469 [2025-03-03 19:49:03,131 INFO L210 NwaCegarLoop]: Found error trace [2025-03-03 19:49:03,132 INFO L218 NwaCegarLoop]: trace histogram [74, 74, 74, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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-03 19:49:03,132 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable1 [2025-03-03 19:49:03,132 INFO L396 AbstractCegarLoop]: === Iteration 3 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-03-03 19:49:03,133 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-03 19:49:03,133 INFO L85 PathProgramCache]: Analyzing trace with hash 101102048, now seen corresponding path program 1 times [2025-03-03 19:49:03,133 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-03 19:49:03,134 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1486519525] [2025-03-03 19:49:03,135 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-03 19:49:03,135 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-03 19:49:03,166 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 468 statements into 1 equivalence classes. [2025-03-03 19:49:03,211 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 468 of 468 statements. [2025-03-03 19:49:03,211 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-03 19:49:03,212 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-03 19:49:03,476 INFO L134 CoverageAnalysis]: Checked inductivity of 10804 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 10804 trivial. 0 not checked. [2025-03-03 19:49:03,476 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-03 19:49:03,477 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1486519525] [2025-03-03 19:49:03,479 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1486519525] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-03 19:49:03,479 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-03 19:49:03,479 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2025-03-03 19:49:03,479 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [985059850] [2025-03-03 19:49:03,479 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-03 19:49:03,480 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2025-03-03 19:49:03,481 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-03 19:49:03,481 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2025-03-03 19:49:03,482 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-03-03 19:49:03,482 INFO L87 Difference]: Start difference. First operand 227 states and 378 transitions. Second operand has 3 states, 3 states have (on average 33.666666666666664) internal successors, (101), 3 states have internal predecessors, (101), 1 states have call successors, (74), 1 states have call predecessors, (74), 1 states have return successors, (74), 1 states have call predecessors, (74), 1 states have call successors, (74) [2025-03-03 19:49:03,586 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-03 19:49:03,586 INFO L93 Difference]: Finished difference Result 673 states and 1124 transitions. [2025-03-03 19:49:03,587 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2025-03-03 19:49:03,587 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 33.666666666666664) internal successors, (101), 3 states have internal predecessors, (101), 1 states have call successors, (74), 1 states have call predecessors, (74), 1 states have return successors, (74), 1 states have call predecessors, (74), 1 states have call successors, (74) Word has length 468 [2025-03-03 19:49:03,590 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-03 19:49:03,596 INFO L225 Difference]: With dead ends: 673 [2025-03-03 19:49:03,598 INFO L226 Difference]: Without dead ends: 449 [2025-03-03 19:49:03,599 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-03 19:49:03,600 INFO L435 NwaCegarLoop]: 617 mSDtfsCounter, 357 mSDsluCounter, 349 mSDsCounter, 0 mSdLazyCounter, 45 mSolverCounterSat, 7 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 357 SdHoareTripleChecker+Valid, 966 SdHoareTripleChecker+Invalid, 52 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 7 IncrementalHoareTripleChecker+Valid, 45 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2025-03-03 19:49:03,600 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [357 Valid, 966 Invalid, 52 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [7 Valid, 45 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2025-03-03 19:49:03,601 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 449 states. [2025-03-03 19:49:03,669 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 449 to 447. [2025-03-03 19:49:03,672 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 447 states, 296 states have (on average 1.510135135135135) internal successors, (447), 296 states have internal predecessors, (447), 148 states have call successors, (148), 2 states have call predecessors, (148), 2 states have return successors, (148), 148 states have call predecessors, (148), 148 states have call successors, (148) [2025-03-03 19:49:03,678 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 447 states to 447 states and 743 transitions. [2025-03-03 19:49:03,678 INFO L78 Accepts]: Start accepts. Automaton has 447 states and 743 transitions. Word has length 468 [2025-03-03 19:49:03,679 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-03 19:49:03,679 INFO L471 AbstractCegarLoop]: Abstraction has 447 states and 743 transitions. [2025-03-03 19:49:03,679 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 33.666666666666664) internal successors, (101), 3 states have internal predecessors, (101), 1 states have call successors, (74), 1 states have call predecessors, (74), 1 states have return successors, (74), 1 states have call predecessors, (74), 1 states have call successors, (74) [2025-03-03 19:49:03,680 INFO L276 IsEmpty]: Start isEmpty. Operand 447 states and 743 transitions. [2025-03-03 19:49:03,687 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 469 [2025-03-03 19:49:03,687 INFO L210 NwaCegarLoop]: Found error trace [2025-03-03 19:49:03,688 INFO L218 NwaCegarLoop]: trace histogram [74, 74, 74, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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-03 19:49:03,688 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable2 [2025-03-03 19:49:03,688 INFO L396 AbstractCegarLoop]: === Iteration 4 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-03-03 19:49:03,688 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-03 19:49:03,689 INFO L85 PathProgramCache]: Analyzing trace with hash 1784177506, now seen corresponding path program 1 times [2025-03-03 19:49:03,689 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-03 19:49:03,689 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1631221232] [2025-03-03 19:49:03,689 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-03 19:49:03,689 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-03 19:49:03,727 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 468 statements into 1 equivalence classes. [2025-03-03 19:49:03,771 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 468 of 468 statements. [2025-03-03 19:49:03,771 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-03 19:49:03,771 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-03 19:49:04,039 INFO L134 CoverageAnalysis]: Checked inductivity of 10804 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 10804 trivial. 0 not checked. [2025-03-03 19:49:04,039 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-03 19:49:04,039 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1631221232] [2025-03-03 19:49:04,040 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1631221232] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-03 19:49:04,040 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-03 19:49:04,040 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2025-03-03 19:49:04,040 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1404367450] [2025-03-03 19:49:04,041 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-03 19:49:04,041 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2025-03-03 19:49:04,041 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-03 19:49:04,042 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2025-03-03 19:49:04,042 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2025-03-03 19:49:04,042 INFO L87 Difference]: Start difference. First operand 447 states and 743 transitions. Second operand has 4 states, 4 states have (on average 25.25) internal successors, (101), 4 states have internal predecessors, (101), 2 states have call successors, (74), 1 states have call predecessors, (74), 1 states have return successors, (74), 2 states have call predecessors, (74), 2 states have call successors, (74) [2025-03-03 19:49:04,134 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-03 19:49:04,134 INFO L93 Difference]: Finished difference Result 891 states and 1483 transitions. [2025-03-03 19:49:04,135 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2025-03-03 19:49:04,135 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 4 states have (on average 25.25) internal successors, (101), 4 states have internal predecessors, (101), 2 states have call successors, (74), 1 states have call predecessors, (74), 1 states have return successors, (74), 2 states have call predecessors, (74), 2 states have call successors, (74) Word has length 468 [2025-03-03 19:49:04,137 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-03 19:49:04,142 INFO L225 Difference]: With dead ends: 891 [2025-03-03 19:49:04,142 INFO L226 Difference]: Without dead ends: 447 [2025-03-03 19:49:04,144 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 5 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=9, Invalid=11, Unknown=0, NotChecked=0, Total=20 [2025-03-03 19:49:04,144 INFO L435 NwaCegarLoop]: 348 mSDtfsCounter, 323 mSDsluCounter, 344 mSDsCounter, 0 mSdLazyCounter, 50 mSolverCounterSat, 2 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 323 SdHoareTripleChecker+Valid, 692 SdHoareTripleChecker+Invalid, 52 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 2 IncrementalHoareTripleChecker+Valid, 50 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2025-03-03 19:49:04,144 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [323 Valid, 692 Invalid, 52 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [2 Valid, 50 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2025-03-03 19:49:04,145 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 447 states. [2025-03-03 19:49:04,200 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 447 to 447. [2025-03-03 19:49:04,201 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 447 states, 296 states have (on average 1.5033783783783783) internal successors, (445), 296 states have internal predecessors, (445), 148 states have call successors, (148), 2 states have call predecessors, (148), 2 states have return successors, (148), 148 states have call predecessors, (148), 148 states have call successors, (148) [2025-03-03 19:49:04,204 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 447 states to 447 states and 741 transitions. [2025-03-03 19:49:04,206 INFO L78 Accepts]: Start accepts. Automaton has 447 states and 741 transitions. Word has length 468 [2025-03-03 19:49:04,208 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-03 19:49:04,208 INFO L471 AbstractCegarLoop]: Abstraction has 447 states and 741 transitions. [2025-03-03 19:49:04,208 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 25.25) internal successors, (101), 4 states have internal predecessors, (101), 2 states have call successors, (74), 1 states have call predecessors, (74), 1 states have return successors, (74), 2 states have call predecessors, (74), 2 states have call successors, (74) [2025-03-03 19:49:04,208 INFO L276 IsEmpty]: Start isEmpty. Operand 447 states and 741 transitions. [2025-03-03 19:49:04,215 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 469 [2025-03-03 19:49:04,215 INFO L210 NwaCegarLoop]: Found error trace [2025-03-03 19:49:04,216 INFO L218 NwaCegarLoop]: trace histogram [74, 74, 74, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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-03 19:49:04,217 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable3 [2025-03-03 19:49:04,217 INFO L396 AbstractCegarLoop]: === Iteration 5 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-03-03 19:49:04,218 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-03 19:49:04,218 INFO L85 PathProgramCache]: Analyzing trace with hash -1266025309, now seen corresponding path program 1 times [2025-03-03 19:49:04,218 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-03 19:49:04,218 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [10637391] [2025-03-03 19:49:04,218 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-03 19:49:04,218 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-03 19:49:04,242 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 468 statements into 1 equivalence classes. [2025-03-03 19:49:04,279 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 468 of 468 statements. [2025-03-03 19:49:04,279 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-03 19:49:04,280 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-03 19:49:04,791 INFO L134 CoverageAnalysis]: Checked inductivity of 10804 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 10804 trivial. 0 not checked. [2025-03-03 19:49:04,792 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-03 19:49:04,792 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [10637391] [2025-03-03 19:49:04,792 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [10637391] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-03 19:49:04,792 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-03 19:49:04,792 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2025-03-03 19:49:04,792 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1470873086] [2025-03-03 19:49:04,792 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-03 19:49:04,792 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2025-03-03 19:49:04,792 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-03 19:49:04,793 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2025-03-03 19:49:04,793 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=6, Invalid=6, Unknown=0, NotChecked=0, Total=12 [2025-03-03 19:49:04,793 INFO L87 Difference]: Start difference. First operand 447 states and 741 transitions. Second operand has 4 states, 4 states have (on average 25.25) internal successors, (101), 4 states have internal predecessors, (101), 1 states have call successors, (74), 1 states have call predecessors, (74), 1 states have return successors, (74), 1 states have call predecessors, (74), 1 states have call successors, (74) [2025-03-03 19:49:05,045 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-03 19:49:05,046 INFO L93 Difference]: Finished difference Result 1255 states and 2088 transitions. [2025-03-03 19:49:05,046 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2025-03-03 19:49:05,047 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 4 states have (on average 25.25) internal successors, (101), 4 states have internal predecessors, (101), 1 states have call successors, (74), 1 states have call predecessors, (74), 1 states have return successors, (74), 1 states have call predecessors, (74), 1 states have call successors, (74) Word has length 468 [2025-03-03 19:49:05,047 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-03 19:49:05,053 INFO L225 Difference]: With dead ends: 1255 [2025-03-03 19:49:05,053 INFO L226 Difference]: Without dead ends: 771 [2025-03-03 19:49:05,055 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 7 GetRequests, 5 SyntacticMatches, 0 SemanticMatches, 2 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=6, Invalid=6, Unknown=0, NotChecked=0, Total=12 [2025-03-03 19:49:05,056 INFO L435 NwaCegarLoop]: 567 mSDtfsCounter, 503 mSDsluCounter, 501 mSDsCounter, 0 mSdLazyCounter, 137 mSolverCounterSat, 7 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 503 SdHoareTripleChecker+Valid, 1068 SdHoareTripleChecker+Invalid, 144 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 7 IncrementalHoareTripleChecker+Valid, 137 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.2s IncrementalHoareTripleChecker+Time [2025-03-03 19:49:05,056 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [503 Valid, 1068 Invalid, 144 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [7 Valid, 137 Invalid, 0 Unknown, 0 Unchecked, 0.2s Time] [2025-03-03 19:49:05,059 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 771 states. [2025-03-03 19:49:05,147 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 771 to 765. [2025-03-03 19:49:05,153 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 765 states, 560 states have (on average 1.5589285714285714) internal successors, (873), 562 states have internal predecessors, (873), 200 states have call successors, (200), 4 states have call predecessors, (200), 4 states have return successors, (200), 198 states have call predecessors, (200), 200 states have call successors, (200) [2025-03-03 19:49:05,156 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 765 states to 765 states and 1273 transitions. [2025-03-03 19:49:05,159 INFO L78 Accepts]: Start accepts. Automaton has 765 states and 1273 transitions. Word has length 468 [2025-03-03 19:49:05,161 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-03 19:49:05,161 INFO L471 AbstractCegarLoop]: Abstraction has 765 states and 1273 transitions. [2025-03-03 19:49:05,162 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 25.25) internal successors, (101), 4 states have internal predecessors, (101), 1 states have call successors, (74), 1 states have call predecessors, (74), 1 states have return successors, (74), 1 states have call predecessors, (74), 1 states have call successors, (74) [2025-03-03 19:49:05,162 INFO L276 IsEmpty]: Start isEmpty. Operand 765 states and 1273 transitions. [2025-03-03 19:49:05,167 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 469 [2025-03-03 19:49:05,168 INFO L210 NwaCegarLoop]: Found error trace [2025-03-03 19:49:05,168 INFO L218 NwaCegarLoop]: trace histogram [74, 74, 74, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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-03 19:49:05,168 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable4 [2025-03-03 19:49:05,169 INFO L396 AbstractCegarLoop]: === Iteration 6 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-03-03 19:49:05,170 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-03 19:49:05,170 INFO L85 PathProgramCache]: Analyzing trace with hash -1915389663, now seen corresponding path program 1 times [2025-03-03 19:49:05,170 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-03 19:49:05,171 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [331664837] [2025-03-03 19:49:05,171 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-03 19:49:05,171 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-03 19:49:05,191 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 468 statements into 1 equivalence classes. [2025-03-03 19:49:05,224 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 468 of 468 statements. [2025-03-03 19:49:05,225 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-03 19:49:05,225 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-03 19:49:05,480 INFO L134 CoverageAnalysis]: Checked inductivity of 10804 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 10804 trivial. 0 not checked. [2025-03-03 19:49:05,480 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-03 19:49:05,480 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [331664837] [2025-03-03 19:49:05,480 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [331664837] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-03 19:49:05,480 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-03 19:49:05,481 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2025-03-03 19:49:05,481 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [311112558] [2025-03-03 19:49:05,481 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-03 19:49:05,481 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2025-03-03 19:49:05,481 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-03 19:49:05,482 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2025-03-03 19:49:05,482 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2025-03-03 19:49:05,482 INFO L87 Difference]: Start difference. First operand 765 states and 1273 transitions. Second operand has 4 states, 4 states have (on average 25.25) internal successors, (101), 4 states have internal predecessors, (101), 1 states have call successors, (74), 1 states have call predecessors, (74), 1 states have return successors, (74), 1 states have call predecessors, (74), 1 states have call successors, (74) [2025-03-03 19:49:05,683 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-03 19:49:05,684 INFO L93 Difference]: Finished difference Result 2301 states and 3833 transitions. [2025-03-03 19:49:05,684 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2025-03-03 19:49:05,684 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 4 states have (on average 25.25) internal successors, (101), 4 states have internal predecessors, (101), 1 states have call successors, (74), 1 states have call predecessors, (74), 1 states have return successors, (74), 1 states have call predecessors, (74), 1 states have call successors, (74) Word has length 468 [2025-03-03 19:49:05,685 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-03 19:49:05,694 INFO L225 Difference]: With dead ends: 2301 [2025-03-03 19:49:05,694 INFO L226 Difference]: Without dead ends: 1539 [2025-03-03 19:49:05,697 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 5 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=9, Invalid=11, Unknown=0, NotChecked=0, Total=20 [2025-03-03 19:49:05,697 INFO L435 NwaCegarLoop]: 409 mSDtfsCounter, 234 mSDsluCounter, 736 mSDsCounter, 0 mSdLazyCounter, 110 mSolverCounterSat, 1 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 234 SdHoareTripleChecker+Valid, 1145 SdHoareTripleChecker+Invalid, 111 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 1 IncrementalHoareTripleChecker+Valid, 110 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2025-03-03 19:49:05,697 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [234 Valid, 1145 Invalid, 111 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [1 Valid, 110 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2025-03-03 19:49:05,699 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1539 states. [2025-03-03 19:49:05,833 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1539 to 1529. [2025-03-03 19:49:05,838 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 1529 states, 1120 states have (on average 1.5553571428571429) internal successors, (1742), 1124 states have internal predecessors, (1742), 400 states have call successors, (400), 8 states have call predecessors, (400), 8 states have return successors, (400), 396 states have call predecessors, (400), 400 states have call successors, (400) [2025-03-03 19:49:05,846 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1529 states to 1529 states and 2542 transitions. [2025-03-03 19:49:05,848 INFO L78 Accepts]: Start accepts. Automaton has 1529 states and 2542 transitions. Word has length 468 [2025-03-03 19:49:05,849 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-03 19:49:05,849 INFO L471 AbstractCegarLoop]: Abstraction has 1529 states and 2542 transitions. [2025-03-03 19:49:05,849 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 25.25) internal successors, (101), 4 states have internal predecessors, (101), 1 states have call successors, (74), 1 states have call predecessors, (74), 1 states have return successors, (74), 1 states have call predecessors, (74), 1 states have call successors, (74) [2025-03-03 19:49:05,849 INFO L276 IsEmpty]: Start isEmpty. Operand 1529 states and 2542 transitions. [2025-03-03 19:49:05,857 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 469 [2025-03-03 19:49:05,857 INFO L210 NwaCegarLoop]: Found error trace [2025-03-03 19:49:05,858 INFO L218 NwaCegarLoop]: trace histogram [74, 74, 74, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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-03 19:49:05,858 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable5 [2025-03-03 19:49:05,858 INFO L396 AbstractCegarLoop]: === Iteration 7 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-03-03 19:49:05,858 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-03 19:49:05,859 INFO L85 PathProgramCache]: Analyzing trace with hash -13029055, now seen corresponding path program 1 times [2025-03-03 19:49:05,859 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-03 19:49:05,859 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1651937517] [2025-03-03 19:49:05,859 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-03 19:49:05,859 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-03 19:49:05,882 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 468 statements into 1 equivalence classes. [2025-03-03 19:49:05,939 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 468 of 468 statements. [2025-03-03 19:49:05,939 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-03 19:49:05,939 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-03 19:49:06,534 INFO L134 CoverageAnalysis]: Checked inductivity of 10804 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 10804 trivial. 0 not checked. [2025-03-03 19:49:06,534 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-03 19:49:06,534 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1651937517] [2025-03-03 19:49:06,534 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1651937517] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-03 19:49:06,534 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-03 19:49:06,534 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2025-03-03 19:49:06,535 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [137628897] [2025-03-03 19:49:06,535 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-03 19:49:06,535 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2025-03-03 19:49:06,535 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-03 19:49:06,536 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2025-03-03 19:49:06,536 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2025-03-03 19:49:06,536 INFO L87 Difference]: Start difference. First operand 1529 states and 2542 transitions. Second operand has 5 states, 5 states have (on average 20.2) internal successors, (101), 5 states have internal predecessors, (101), 2 states have call successors, (74), 1 states have call predecessors, (74), 1 states have return successors, (74), 2 states have call predecessors, (74), 2 states have call successors, (74) [2025-03-03 19:49:07,419 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-03 19:49:07,419 INFO L93 Difference]: Finished difference Result 2900 states and 4828 transitions. [2025-03-03 19:49:07,419 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2025-03-03 19:49:07,420 INFO L78 Accepts]: Start accepts. Automaton has has 5 states, 5 states have (on average 20.2) internal successors, (101), 5 states have internal predecessors, (101), 2 states have call successors, (74), 1 states have call predecessors, (74), 1 states have return successors, (74), 2 states have call predecessors, (74), 2 states have call successors, (74) Word has length 468 [2025-03-03 19:49:07,420 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-03 19:49:07,431 INFO L225 Difference]: With dead ends: 2900 [2025-03-03 19:49:07,432 INFO L226 Difference]: Without dead ends: 2138 [2025-03-03 19:49:07,435 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 9 GetRequests, 4 SyntacticMatches, 0 SemanticMatches, 5 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=17, Invalid=25, Unknown=0, NotChecked=0, Total=42 [2025-03-03 19:49:07,436 INFO L435 NwaCegarLoop]: 539 mSDtfsCounter, 474 mSDsluCounter, 477 mSDsCounter, 0 mSdLazyCounter, 603 mSolverCounterSat, 72 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.6s Time, 0 mProtectedPredicate, 0 mProtectedAction, 474 SdHoareTripleChecker+Valid, 1016 SdHoareTripleChecker+Invalid, 675 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 72 IncrementalHoareTripleChecker+Valid, 603 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.7s IncrementalHoareTripleChecker+Time [2025-03-03 19:49:07,437 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [474 Valid, 1016 Invalid, 675 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [72 Valid, 603 Invalid, 0 Unknown, 0 Unchecked, 0.7s Time] [2025-03-03 19:49:07,438 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 2138 states. [2025-03-03 19:49:07,609 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 2138 to 2126. [2025-03-03 19:49:07,613 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 2126 states, 1591 states have (on average 1.5656819610307982) internal successors, (2491), 1599 states have internal predecessors, (2491), 522 states have call successors, (522), 12 states have call predecessors, (522), 12 states have return successors, (522), 514 states have call predecessors, (522), 522 states have call successors, (522) [2025-03-03 19:49:07,623 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 2126 states to 2126 states and 3535 transitions. [2025-03-03 19:49:07,626 INFO L78 Accepts]: Start accepts. Automaton has 2126 states and 3535 transitions. Word has length 468 [2025-03-03 19:49:07,626 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-03 19:49:07,627 INFO L471 AbstractCegarLoop]: Abstraction has 2126 states and 3535 transitions. [2025-03-03 19:49:07,627 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 20.2) internal successors, (101), 5 states have internal predecessors, (101), 2 states have call successors, (74), 1 states have call predecessors, (74), 1 states have return successors, (74), 2 states have call predecessors, (74), 2 states have call successors, (74) [2025-03-03 19:49:07,627 INFO L276 IsEmpty]: Start isEmpty. Operand 2126 states and 3535 transitions. [2025-03-03 19:49:07,649 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 470 [2025-03-03 19:49:07,650 INFO L210 NwaCegarLoop]: Found error trace [2025-03-03 19:49:07,650 INFO L218 NwaCegarLoop]: trace histogram [74, 74, 74, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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-03 19:49:07,650 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable6 [2025-03-03 19:49:07,650 INFO L396 AbstractCegarLoop]: === Iteration 8 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-03-03 19:49:07,650 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-03 19:49:07,651 INFO L85 PathProgramCache]: Analyzing trace with hash 1188100306, now seen corresponding path program 1 times [2025-03-03 19:49:07,651 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-03 19:49:07,651 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1000351778] [2025-03-03 19:49:07,651 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-03 19:49:07,651 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-03 19:49:07,670 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 469 statements into 1 equivalence classes. [2025-03-03 19:49:07,780 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 469 of 469 statements. [2025-03-03 19:49:07,781 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-03 19:49:07,781 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-03 19:49:07,987 INFO L134 CoverageAnalysis]: Checked inductivity of 10804 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 10804 trivial. 0 not checked. [2025-03-03 19:49:07,988 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-03 19:49:07,988 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1000351778] [2025-03-03 19:49:07,988 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1000351778] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-03 19:49:07,988 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-03 19:49:07,988 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2025-03-03 19:49:07,988 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [90181106] [2025-03-03 19:49:07,989 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-03 19:49:07,989 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2025-03-03 19:49:07,989 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-03 19:49:07,990 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2025-03-03 19:49:07,990 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2025-03-03 19:49:07,990 INFO L87 Difference]: Start difference. First operand 2126 states and 3535 transitions. Second operand has 4 states, 4 states have (on average 25.5) internal successors, (102), 4 states have internal predecessors, (102), 1 states have call successors, (74), 1 states have call predecessors, (74), 1 states have return successors, (74), 1 states have call predecessors, (74), 1 states have call successors, (74) [2025-03-03 19:49:08,750 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-03 19:49:08,750 INFO L93 Difference]: Finished difference Result 4787 states and 7952 transitions. [2025-03-03 19:49:08,751 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2025-03-03 19:49:08,751 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 4 states have (on average 25.5) internal successors, (102), 4 states have internal predecessors, (102), 1 states have call successors, (74), 1 states have call predecessors, (74), 1 states have return successors, (74), 1 states have call predecessors, (74), 1 states have call successors, (74) Word has length 469 [2025-03-03 19:49:08,752 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-03 19:49:08,767 INFO L225 Difference]: With dead ends: 4787 [2025-03-03 19:49:08,767 INFO L226 Difference]: Without dead ends: 2664 [2025-03-03 19:49:08,774 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 7 GetRequests, 4 SyntacticMatches, 0 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=9, Invalid=11, Unknown=0, NotChecked=0, Total=20 [2025-03-03 19:49:08,775 INFO L435 NwaCegarLoop]: 591 mSDtfsCounter, 538 mSDsluCounter, 602 mSDsCounter, 0 mSdLazyCounter, 283 mSolverCounterSat, 149 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.5s Time, 0 mProtectedPredicate, 0 mProtectedAction, 538 SdHoareTripleChecker+Valid, 1193 SdHoareTripleChecker+Invalid, 432 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 149 IncrementalHoareTripleChecker+Valid, 283 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.6s IncrementalHoareTripleChecker+Time [2025-03-03 19:49:08,775 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [538 Valid, 1193 Invalid, 432 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [149 Valid, 283 Invalid, 0 Unknown, 0 Unchecked, 0.6s Time] [2025-03-03 19:49:08,778 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 2664 states. [2025-03-03 19:49:08,938 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 2664 to 2168. [2025-03-03 19:49:08,942 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 2168 states, 1633 states have (on average 1.5646050214329454) internal successors, (2555), 1641 states have internal predecessors, (2555), 522 states have call successors, (522), 12 states have call predecessors, (522), 12 states have return successors, (522), 514 states have call predecessors, (522), 522 states have call successors, (522) [2025-03-03 19:49:08,950 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 2168 states to 2168 states and 3599 transitions. [2025-03-03 19:49:08,953 INFO L78 Accepts]: Start accepts. Automaton has 2168 states and 3599 transitions. Word has length 469 [2025-03-03 19:49:08,954 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-03 19:49:08,954 INFO L471 AbstractCegarLoop]: Abstraction has 2168 states and 3599 transitions. [2025-03-03 19:49:08,954 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 25.5) internal successors, (102), 4 states have internal predecessors, (102), 1 states have call successors, (74), 1 states have call predecessors, (74), 1 states have return successors, (74), 1 states have call predecessors, (74), 1 states have call successors, (74) [2025-03-03 19:49:08,955 INFO L276 IsEmpty]: Start isEmpty. Operand 2168 states and 3599 transitions. [2025-03-03 19:49:08,958 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 470 [2025-03-03 19:49:08,958 INFO L210 NwaCegarLoop]: Found error trace [2025-03-03 19:49:08,959 INFO L218 NwaCegarLoop]: trace histogram [74, 74, 74, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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-03 19:49:08,959 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable7 [2025-03-03 19:49:08,959 INFO L396 AbstractCegarLoop]: === Iteration 9 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-03-03 19:49:08,959 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-03 19:49:08,960 INFO L85 PathProgramCache]: Analyzing trace with hash 163406385, now seen corresponding path program 1 times [2025-03-03 19:49:08,960 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-03 19:49:08,960 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [352311089] [2025-03-03 19:49:08,960 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-03 19:49:08,960 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-03 19:49:08,979 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 469 statements into 1 equivalence classes. [2025-03-03 19:49:09,081 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 469 of 469 statements. [2025-03-03 19:49:09,084 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-03 19:49:09,085 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-03 19:49:10,438 INFO L134 CoverageAnalysis]: Checked inductivity of 10804 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 10804 trivial. 0 not checked. [2025-03-03 19:49:10,438 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-03 19:49:10,438 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [352311089] [2025-03-03 19:49:10,438 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [352311089] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-03 19:49:10,439 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-03 19:49:10,439 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [10] imperfect sequences [] total 10 [2025-03-03 19:49:10,439 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1839068245] [2025-03-03 19:49:10,439 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-03 19:49:10,439 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 10 states [2025-03-03 19:49:10,439 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-03 19:49:10,440 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 10 interpolants. [2025-03-03 19:49:10,440 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=23, Invalid=67, Unknown=0, NotChecked=0, Total=90 [2025-03-03 19:49:10,440 INFO L87 Difference]: Start difference. First operand 2168 states and 3599 transitions. Second operand has 10 states, 10 states have (on average 10.2) internal successors, (102), 10 states have internal predecessors, (102), 2 states have call successors, (74), 1 states have call predecessors, (74), 1 states have return successors, (74), 2 states have call predecessors, (74), 2 states have call successors, (74) [2025-03-03 19:49:12,910 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-03 19:49:12,911 INFO L93 Difference]: Finished difference Result 5192 states and 8596 transitions. [2025-03-03 19:49:12,911 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2025-03-03 19:49:12,911 INFO L78 Accepts]: Start accepts. Automaton has has 10 states, 10 states have (on average 10.2) internal successors, (102), 10 states have internal predecessors, (102), 2 states have call successors, (74), 1 states have call predecessors, (74), 1 states have return successors, (74), 2 states have call predecessors, (74), 2 states have call successors, (74) Word has length 469 [2025-03-03 19:49:12,912 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-03 19:49:12,927 INFO L225 Difference]: With dead ends: 5192 [2025-03-03 19:49:12,928 INFO L226 Difference]: Without dead ends: 3027 [2025-03-03 19:49:12,934 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 20 GetRequests, 7 SyntacticMatches, 0 SemanticMatches, 13 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 14 ImplicationChecksByTransitivity, 0.3s TimeCoverageRelationStatistics Valid=65, Invalid=145, Unknown=0, NotChecked=0, Total=210 [2025-03-03 19:49:12,935 INFO L435 NwaCegarLoop]: 482 mSDtfsCounter, 1330 mSDsluCounter, 2517 mSDsCounter, 0 mSdLazyCounter, 1747 mSolverCounterSat, 755 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 1.8s Time, 0 mProtectedPredicate, 0 mProtectedAction, 1330 SdHoareTripleChecker+Valid, 2999 SdHoareTripleChecker+Invalid, 2502 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 755 IncrementalHoareTripleChecker+Valid, 1747 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 2.1s IncrementalHoareTripleChecker+Time [2025-03-03 19:49:12,936 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [1330 Valid, 2999 Invalid, 2502 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [755 Valid, 1747 Invalid, 0 Unknown, 0 Unchecked, 2.1s Time] [2025-03-03 19:49:12,939 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 3027 states. [2025-03-03 19:49:13,094 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 3027 to 2623. [2025-03-03 19:49:13,098 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 2623 states, 1989 states have (on average 1.567621920563097) internal successors, (3118), 2000 states have internal predecessors, (3118), 618 states have call successors, (618), 15 states have call predecessors, (618), 15 states have return successors, (618), 607 states have call predecessors, (618), 618 states have call successors, (618) [2025-03-03 19:49:13,106 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 2623 states to 2623 states and 4354 transitions. [2025-03-03 19:49:13,109 INFO L78 Accepts]: Start accepts. Automaton has 2623 states and 4354 transitions. Word has length 469 [2025-03-03 19:49:13,111 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-03 19:49:13,111 INFO L471 AbstractCegarLoop]: Abstraction has 2623 states and 4354 transitions. [2025-03-03 19:49:13,111 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 10 states, 10 states have (on average 10.2) internal successors, (102), 10 states have internal predecessors, (102), 2 states have call successors, (74), 1 states have call predecessors, (74), 1 states have return successors, (74), 2 states have call predecessors, (74), 2 states have call successors, (74) [2025-03-03 19:49:13,111 INFO L276 IsEmpty]: Start isEmpty. Operand 2623 states and 4354 transitions. [2025-03-03 19:49:13,115 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 470 [2025-03-03 19:49:13,115 INFO L210 NwaCegarLoop]: Found error trace [2025-03-03 19:49:13,115 INFO L218 NwaCegarLoop]: trace histogram [74, 74, 74, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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-03 19:49:13,116 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable8 [2025-03-03 19:49:13,116 INFO L396 AbstractCegarLoop]: === Iteration 10 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-03-03 19:49:13,116 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-03 19:49:13,116 INFO L85 PathProgramCache]: Analyzing trace with hash 31737010, now seen corresponding path program 1 times [2025-03-03 19:49:13,116 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-03 19:49:13,116 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [822294842] [2025-03-03 19:49:13,116 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-03 19:49:13,116 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-03 19:49:13,134 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 469 statements into 1 equivalence classes. [2025-03-03 19:49:13,183 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 469 of 469 statements. [2025-03-03 19:49:13,185 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-03 19:49:13,186 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-03 19:49:13,567 INFO L134 CoverageAnalysis]: Checked inductivity of 10804 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 10804 trivial. 0 not checked. [2025-03-03 19:49:13,568 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-03 19:49:13,568 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [822294842] [2025-03-03 19:49:13,568 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [822294842] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-03 19:49:13,568 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-03 19:49:13,568 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2025-03-03 19:49:13,568 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1526805983] [2025-03-03 19:49:13,568 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-03 19:49:13,569 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2025-03-03 19:49:13,569 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-03 19:49:13,570 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2025-03-03 19:49:13,570 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2025-03-03 19:49:13,570 INFO L87 Difference]: Start difference. First operand 2623 states and 4354 transitions. Second operand has 5 states, 5 states have (on average 20.4) internal successors, (102), 5 states have internal predecessors, (102), 2 states have call successors, (74), 1 states have call predecessors, (74), 1 states have return successors, (74), 2 states have call predecessors, (74), 2 states have call successors, (74) [2025-03-03 19:49:14,360 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-03 19:49:14,361 INFO L93 Difference]: Finished difference Result 3994 states and 6632 transitions. [2025-03-03 19:49:14,361 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2025-03-03 19:49:14,361 INFO L78 Accepts]: Start accepts. Automaton has has 5 states, 5 states have (on average 20.4) internal successors, (102), 5 states have internal predecessors, (102), 2 states have call successors, (74), 1 states have call predecessors, (74), 1 states have return successors, (74), 2 states have call predecessors, (74), 2 states have call successors, (74) Word has length 469 [2025-03-03 19:49:14,362 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-03 19:49:14,373 INFO L225 Difference]: With dead ends: 3994 [2025-03-03 19:49:14,374 INFO L226 Difference]: Without dead ends: 2635 [2025-03-03 19:49:14,377 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 9 GetRequests, 4 SyntacticMatches, 0 SemanticMatches, 5 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=17, Invalid=25, Unknown=0, NotChecked=0, Total=42 [2025-03-03 19:49:14,378 INFO L435 NwaCegarLoop]: 538 mSDtfsCounter, 476 mSDsluCounter, 477 mSDsCounter, 0 mSdLazyCounter, 599 mSolverCounterSat, 71 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.5s Time, 0 mProtectedPredicate, 0 mProtectedAction, 476 SdHoareTripleChecker+Valid, 1015 SdHoareTripleChecker+Invalid, 670 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 71 IncrementalHoareTripleChecker+Valid, 599 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.6s IncrementalHoareTripleChecker+Time [2025-03-03 19:49:14,378 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [476 Valid, 1015 Invalid, 670 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [71 Valid, 599 Invalid, 0 Unknown, 0 Unchecked, 0.6s Time] [2025-03-03 19:49:14,380 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 2635 states. [2025-03-03 19:49:14,521 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 2635 to 2627. [2025-03-03 19:49:14,529 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 2627 states, 1993 states have (on average 1.5664826894129453) internal successors, (3122), 2004 states have internal predecessors, (3122), 618 states have call successors, (618), 15 states have call predecessors, (618), 15 states have return successors, (618), 607 states have call predecessors, (618), 618 states have call successors, (618) [2025-03-03 19:49:14,538 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 2627 states to 2627 states and 4358 transitions. [2025-03-03 19:49:14,542 INFO L78 Accepts]: Start accepts. Automaton has 2627 states and 4358 transitions. Word has length 469 [2025-03-03 19:49:14,543 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-03 19:49:14,543 INFO L471 AbstractCegarLoop]: Abstraction has 2627 states and 4358 transitions. [2025-03-03 19:49:14,543 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 20.4) internal successors, (102), 5 states have internal predecessors, (102), 2 states have call successors, (74), 1 states have call predecessors, (74), 1 states have return successors, (74), 2 states have call predecessors, (74), 2 states have call successors, (74) [2025-03-03 19:49:14,543 INFO L276 IsEmpty]: Start isEmpty. Operand 2627 states and 4358 transitions. [2025-03-03 19:49:14,547 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 470 [2025-03-03 19:49:14,547 INFO L210 NwaCegarLoop]: Found error trace [2025-03-03 19:49:14,547 INFO L218 NwaCegarLoop]: trace histogram [74, 74, 74, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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-03 19:49:14,547 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable9 [2025-03-03 19:49:14,547 INFO L396 AbstractCegarLoop]: === Iteration 11 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-03-03 19:49:14,548 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-03 19:49:14,548 INFO L85 PathProgramCache]: Analyzing trace with hash 901743441, now seen corresponding path program 1 times [2025-03-03 19:49:14,548 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-03 19:49:14,548 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1346043153] [2025-03-03 19:49:14,548 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-03 19:49:14,549 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-03 19:49:14,566 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 469 statements into 1 equivalence classes. [2025-03-03 19:49:14,585 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 469 of 469 statements. [2025-03-03 19:49:14,585 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-03 19:49:14,585 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-03 19:49:14,756 INFO L134 CoverageAnalysis]: Checked inductivity of 10804 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 10804 trivial. 0 not checked. [2025-03-03 19:49:14,756 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-03 19:49:14,756 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1346043153] [2025-03-03 19:49:14,756 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1346043153] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-03 19:49:14,756 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-03 19:49:14,756 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2025-03-03 19:49:14,756 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1446594919] [2025-03-03 19:49:14,756 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-03 19:49:14,757 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2025-03-03 19:49:14,757 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-03 19:49:14,757 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2025-03-03 19:49:14,757 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-03-03 19:49:14,758 INFO L87 Difference]: Start difference. First operand 2627 states and 4358 transitions. Second operand has 3 states, 3 states have (on average 34.0) internal successors, (102), 3 states have internal predecessors, (102), 1 states have call successors, (74), 1 states have call predecessors, (74), 1 states have return successors, (74), 1 states have call predecessors, (74), 1 states have call successors, (74) [2025-03-03 19:49:14,906 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-03 19:49:14,907 INFO L93 Difference]: Finished difference Result 6021 states and 10004 transitions. [2025-03-03 19:49:14,907 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2025-03-03 19:49:14,907 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 34.0) internal successors, (102), 3 states have internal predecessors, (102), 1 states have call successors, (74), 1 states have call predecessors, (74), 1 states have return successors, (74), 1 states have call predecessors, (74), 1 states have call successors, (74) Word has length 469 [2025-03-03 19:49:14,908 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-03 19:49:14,925 INFO L225 Difference]: With dead ends: 6021 [2025-03-03 19:49:14,926 INFO L226 Difference]: Without dead ends: 3397 [2025-03-03 19:49:14,933 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 5 GetRequests, 4 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-03-03 19:49:14,934 INFO L435 NwaCegarLoop]: 514 mSDtfsCounter, 233 mSDsluCounter, 346 mSDsCounter, 0 mSdLazyCounter, 51 mSolverCounterSat, 3 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 233 SdHoareTripleChecker+Valid, 860 SdHoareTripleChecker+Invalid, 54 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 3 IncrementalHoareTripleChecker+Valid, 51 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2025-03-03 19:49:14,935 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [233 Valid, 860 Invalid, 54 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [3 Valid, 51 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2025-03-03 19:49:14,937 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 3397 states. [2025-03-03 19:49:15,177 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 3397 to 3391. [2025-03-03 19:49:15,192 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 3391 states, 2535 states have (on average 1.5597633136094675) internal successors, (3954), 2548 states have internal predecessors, (3954), 836 states have call successors, (836), 19 states have call predecessors, (836), 19 states have return successors, (836), 823 states have call predecessors, (836), 836 states have call successors, (836) [2025-03-03 19:49:15,203 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3391 states to 3391 states and 5626 transitions. [2025-03-03 19:49:15,208 INFO L78 Accepts]: Start accepts. Automaton has 3391 states and 5626 transitions. Word has length 469 [2025-03-03 19:49:15,209 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-03 19:49:15,209 INFO L471 AbstractCegarLoop]: Abstraction has 3391 states and 5626 transitions. [2025-03-03 19:49:15,209 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 34.0) internal successors, (102), 3 states have internal predecessors, (102), 1 states have call successors, (74), 1 states have call predecessors, (74), 1 states have return successors, (74), 1 states have call predecessors, (74), 1 states have call successors, (74) [2025-03-03 19:49:15,210 INFO L276 IsEmpty]: Start isEmpty. Operand 3391 states and 5626 transitions. [2025-03-03 19:49:15,213 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 471 [2025-03-03 19:49:15,213 INFO L210 NwaCegarLoop]: Found error trace [2025-03-03 19:49:15,213 INFO L218 NwaCegarLoop]: trace histogram [74, 74, 74, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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-03 19:49:15,213 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable10 [2025-03-03 19:49:15,213 INFO L396 AbstractCegarLoop]: === Iteration 12 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-03-03 19:49:15,214 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-03 19:49:15,214 INFO L85 PathProgramCache]: Analyzing trace with hash -1061965602, now seen corresponding path program 1 times [2025-03-03 19:49:15,214 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-03 19:49:15,214 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [592247929] [2025-03-03 19:49:15,214 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-03 19:49:15,214 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-03 19:49:15,232 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 470 statements into 1 equivalence classes. [2025-03-03 19:49:15,296 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 470 of 470 statements. [2025-03-03 19:49:15,296 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-03 19:49:15,297 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-03 19:49:15,608 INFO L134 CoverageAnalysis]: Checked inductivity of 10804 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 10804 trivial. 0 not checked. [2025-03-03 19:49:15,609 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-03 19:49:15,609 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [592247929] [2025-03-03 19:49:15,609 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [592247929] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-03 19:49:15,609 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-03 19:49:15,609 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2025-03-03 19:49:15,609 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1505184787] [2025-03-03 19:49:15,609 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-03 19:49:15,610 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2025-03-03 19:49:15,610 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-03 19:49:15,610 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2025-03-03 19:49:15,610 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=9, Invalid=11, Unknown=0, NotChecked=0, Total=20 [2025-03-03 19:49:15,610 INFO L87 Difference]: Start difference. First operand 3391 states and 5626 transitions. Second operand has 5 states, 5 states have (on average 20.6) internal successors, (103), 5 states have internal predecessors, (103), 1 states have call successors, (74), 1 states have call predecessors, (74), 1 states have return successors, (74), 1 states have call predecessors, (74), 1 states have call successors, (74) [2025-03-03 19:49:16,540 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-03 19:49:16,541 INFO L93 Difference]: Finished difference Result 8074 states and 13366 transitions. [2025-03-03 19:49:16,541 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2025-03-03 19:49:16,542 INFO L78 Accepts]: Start accepts. Automaton has has 5 states, 5 states have (on average 20.6) internal successors, (103), 5 states have internal predecessors, (103), 1 states have call successors, (74), 1 states have call predecessors, (74), 1 states have return successors, (74), 1 states have call predecessors, (74), 1 states have call successors, (74) Word has length 470 [2025-03-03 19:49:16,542 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-03 19:49:16,592 INFO L225 Difference]: With dead ends: 8074 [2025-03-03 19:49:16,592 INFO L226 Difference]: Without dead ends: 6336 [2025-03-03 19:49:16,603 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 8 GetRequests, 4 SyntacticMatches, 0 SemanticMatches, 4 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=14, Invalid=16, Unknown=0, NotChecked=0, Total=30 [2025-03-03 19:49:16,604 INFO L435 NwaCegarLoop]: 638 mSDtfsCounter, 611 mSDsluCounter, 871 mSDsCounter, 0 mSdLazyCounter, 269 mSolverCounterSat, 151 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.4s Time, 0 mProtectedPredicate, 0 mProtectedAction, 611 SdHoareTripleChecker+Valid, 1509 SdHoareTripleChecker+Invalid, 420 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 151 IncrementalHoareTripleChecker+Valid, 269 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.5s IncrementalHoareTripleChecker+Time [2025-03-03 19:49:16,604 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [611 Valid, 1509 Invalid, 420 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [151 Valid, 269 Invalid, 0 Unknown, 0 Unchecked, 0.5s Time] [2025-03-03 19:49:16,610 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 6336 states. [2025-03-03 19:49:16,945 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 6336 to 3755. [2025-03-03 19:49:16,954 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 3755 states, 2779 states have (on average 1.5509175962576467) internal successors, (4310), 2792 states have internal predecessors, (4310), 953 states have call successors, (953), 22 states have call predecessors, (953), 22 states have return successors, (953), 940 states have call predecessors, (953), 953 states have call successors, (953) [2025-03-03 19:49:16,965 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3755 states to 3755 states and 6216 transitions. [2025-03-03 19:49:16,970 INFO L78 Accepts]: Start accepts. Automaton has 3755 states and 6216 transitions. Word has length 470 [2025-03-03 19:49:16,970 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-03 19:49:16,970 INFO L471 AbstractCegarLoop]: Abstraction has 3755 states and 6216 transitions. [2025-03-03 19:49:16,971 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 20.6) internal successors, (103), 5 states have internal predecessors, (103), 1 states have call successors, (74), 1 states have call predecessors, (74), 1 states have return successors, (74), 1 states have call predecessors, (74), 1 states have call successors, (74) [2025-03-03 19:49:16,971 INFO L276 IsEmpty]: Start isEmpty. Operand 3755 states and 6216 transitions. [2025-03-03 19:49:16,974 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 471 [2025-03-03 19:49:16,974 INFO L210 NwaCegarLoop]: Found error trace [2025-03-03 19:49:16,974 INFO L218 NwaCegarLoop]: trace histogram [74, 74, 74, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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-03 19:49:16,974 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable11 [2025-03-03 19:49:16,975 INFO L396 AbstractCegarLoop]: === Iteration 13 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-03-03 19:49:16,975 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-03 19:49:16,975 INFO L85 PathProgramCache]: Analyzing trace with hash -1126354654, now seen corresponding path program 1 times [2025-03-03 19:49:16,975 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-03 19:49:16,975 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [107032467] [2025-03-03 19:49:16,975 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-03 19:49:16,975 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-03 19:49:16,992 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 470 statements into 1 equivalence classes. [2025-03-03 19:49:17,046 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 470 of 470 statements. [2025-03-03 19:49:17,047 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-03 19:49:17,047 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-03 19:49:17,637 INFO L134 CoverageAnalysis]: Checked inductivity of 10804 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 10804 trivial. 0 not checked. [2025-03-03 19:49:17,638 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-03 19:49:17,638 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [107032467] [2025-03-03 19:49:17,638 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [107032467] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-03 19:49:17,638 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-03 19:49:17,638 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2025-03-03 19:49:17,638 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [420380641] [2025-03-03 19:49:17,638 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-03 19:49:17,638 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 7 states [2025-03-03 19:49:17,638 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-03 19:49:17,639 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2025-03-03 19:49:17,639 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=15, Invalid=27, Unknown=0, NotChecked=0, Total=42 [2025-03-03 19:49:17,640 INFO L87 Difference]: Start difference. First operand 3755 states and 6216 transitions. Second operand has 7 states, 7 states have (on average 14.714285714285714) internal successors, (103), 7 states have internal predecessors, (103), 2 states have call successors, (74), 1 states have call predecessors, (74), 1 states have return successors, (74), 2 states have call predecessors, (74), 2 states have call successors, (74) [2025-03-03 19:49:19,087 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-03 19:49:19,087 INFO L93 Difference]: Finished difference Result 11259 states and 18645 transitions. [2025-03-03 19:49:19,088 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2025-03-03 19:49:19,088 INFO L78 Accepts]: Start accepts. Automaton has has 7 states, 7 states have (on average 14.714285714285714) internal successors, (103), 7 states have internal predecessors, (103), 2 states have call successors, (74), 1 states have call predecessors, (74), 1 states have return successors, (74), 2 states have call predecessors, (74), 2 states have call successors, (74) Word has length 470 [2025-03-03 19:49:19,089 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-03 19:49:19,118 INFO L225 Difference]: With dead ends: 11259 [2025-03-03 19:49:19,119 INFO L226 Difference]: Without dead ends: 7962 [2025-03-03 19:49:19,130 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 12 GetRequests, 4 SyntacticMatches, 0 SemanticMatches, 8 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=36, Invalid=54, Unknown=0, NotChecked=0, Total=90 [2025-03-03 19:49:19,131 INFO L435 NwaCegarLoop]: 562 mSDtfsCounter, 903 mSDsluCounter, 1048 mSDsCounter, 0 mSdLazyCounter, 1135 mSolverCounterSat, 130 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.9s Time, 0 mProtectedPredicate, 0 mProtectedAction, 903 SdHoareTripleChecker+Valid, 1610 SdHoareTripleChecker+Invalid, 1265 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 130 IncrementalHoareTripleChecker+Valid, 1135 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 1.0s IncrementalHoareTripleChecker+Time [2025-03-03 19:49:19,131 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [903 Valid, 1610 Invalid, 1265 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [130 Valid, 1135 Invalid, 0 Unknown, 0 Unchecked, 1.0s Time] [2025-03-03 19:49:19,137 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 7962 states. [2025-03-03 19:49:19,728 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 7962 to 7905. [2025-03-03 19:49:19,743 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 7905 states, 6090 states have (on average 1.5701149425287357) internal successors, (9562), 6130 states have internal predecessors, (9562), 1760 states have call successors, (1760), 54 states have call predecessors, (1760), 54 states have return successors, (1760), 1720 states have call predecessors, (1760), 1760 states have call successors, (1760) [2025-03-03 19:49:19,763 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 7905 states to 7905 states and 13082 transitions. [2025-03-03 19:49:19,768 INFO L78 Accepts]: Start accepts. Automaton has 7905 states and 13082 transitions. Word has length 470 [2025-03-03 19:49:19,769 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-03 19:49:19,769 INFO L471 AbstractCegarLoop]: Abstraction has 7905 states and 13082 transitions. [2025-03-03 19:49:19,770 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 7 states, 7 states have (on average 14.714285714285714) internal successors, (103), 7 states have internal predecessors, (103), 2 states have call successors, (74), 1 states have call predecessors, (74), 1 states have return successors, (74), 2 states have call predecessors, (74), 2 states have call successors, (74) [2025-03-03 19:49:19,770 INFO L276 IsEmpty]: Start isEmpty. Operand 7905 states and 13082 transitions. [2025-03-03 19:49:19,776 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 471 [2025-03-03 19:49:19,777 INFO L210 NwaCegarLoop]: Found error trace [2025-03-03 19:49:19,777 INFO L218 NwaCegarLoop]: trace histogram [74, 74, 74, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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-03 19:49:19,777 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable12 [2025-03-03 19:49:19,777 INFO L396 AbstractCegarLoop]: === Iteration 14 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-03-03 19:49:19,777 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-03 19:49:19,778 INFO L85 PathProgramCache]: Analyzing trace with hash -1758605557, now seen corresponding path program 1 times [2025-03-03 19:49:19,778 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-03 19:49:19,778 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2127636119] [2025-03-03 19:49:19,778 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-03 19:49:19,778 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-03 19:49:19,793 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 470 statements into 1 equivalence classes. [2025-03-03 19:49:19,812 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 470 of 470 statements. [2025-03-03 19:49:19,813 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-03 19:49:19,813 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-03 19:49:19,995 INFO L134 CoverageAnalysis]: Checked inductivity of 10804 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 10804 trivial. 0 not checked. [2025-03-03 19:49:19,995 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-03 19:49:19,995 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2127636119] [2025-03-03 19:49:19,995 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [2127636119] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-03 19:49:19,995 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-03 19:49:19,995 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2025-03-03 19:49:19,995 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1675110010] [2025-03-03 19:49:19,995 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-03 19:49:19,996 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2025-03-03 19:49:19,996 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-03 19:49:19,996 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2025-03-03 19:49:19,996 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-03-03 19:49:19,997 INFO L87 Difference]: Start difference. First operand 7905 states and 13082 transitions. Second operand has 3 states, 3 states have (on average 34.333333333333336) internal successors, (103), 3 states have internal predecessors, (103), 1 states have call successors, (74), 1 states have call predecessors, (74), 1 states have return successors, (74), 1 states have call predecessors, (74), 1 states have call successors, (74) [2025-03-03 19:49:20,738 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-03 19:49:20,738 INFO L93 Difference]: Finished difference Result 23709 states and 39240 transitions. [2025-03-03 19:49:20,739 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2025-03-03 19:49:20,739 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 34.333333333333336) internal successors, (103), 3 states have internal predecessors, (103), 1 states have call successors, (74), 1 states have call predecessors, (74), 1 states have return successors, (74), 1 states have call predecessors, (74), 1 states have call successors, (74) Word has length 470 [2025-03-03 19:49:20,739 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-03 19:49:20,796 INFO L225 Difference]: With dead ends: 23709 [2025-03-03 19:49:20,796 INFO L226 Difference]: Without dead ends: 15807 [2025-03-03 19:49:20,820 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-03 19:49:20,821 INFO L435 NwaCegarLoop]: 361 mSDtfsCounter, 232 mSDsluCounter, 354 mSDsCounter, 0 mSdLazyCounter, 26 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 232 SdHoareTripleChecker+Valid, 715 SdHoareTripleChecker+Invalid, 26 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 26 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2025-03-03 19:49:20,821 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [232 Valid, 715 Invalid, 26 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 26 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2025-03-03 19:49:20,832 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 15807 states. [2025-03-03 19:49:22,037 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 15807 to 15772. [2025-03-03 19:49:22,057 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 15772 states, 12143 states have (on average 1.5664168656839332) internal successors, (19021), 12223 states have internal predecessors, (19021), 3520 states have call successors, (3520), 108 states have call predecessors, (3520), 108 states have return successors, (3520), 3440 states have call predecessors, (3520), 3520 states have call successors, (3520) [2025-03-03 19:49:22,110 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 15772 states to 15772 states and 26061 transitions. [2025-03-03 19:49:22,123 INFO L78 Accepts]: Start accepts. Automaton has 15772 states and 26061 transitions. Word has length 470 [2025-03-03 19:49:22,123 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-03 19:49:22,123 INFO L471 AbstractCegarLoop]: Abstraction has 15772 states and 26061 transitions. [2025-03-03 19:49:22,124 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 34.333333333333336) internal successors, (103), 3 states have internal predecessors, (103), 1 states have call successors, (74), 1 states have call predecessors, (74), 1 states have return successors, (74), 1 states have call predecessors, (74), 1 states have call successors, (74) [2025-03-03 19:49:22,124 INFO L276 IsEmpty]: Start isEmpty. Operand 15772 states and 26061 transitions. [2025-03-03 19:49:22,137 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 471 [2025-03-03 19:49:22,137 INFO L210 NwaCegarLoop]: Found error trace [2025-03-03 19:49:22,142 INFO L218 NwaCegarLoop]: trace histogram [74, 74, 74, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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-03 19:49:22,142 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable13 [2025-03-03 19:49:22,142 INFO L396 AbstractCegarLoop]: === Iteration 15 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-03-03 19:49:22,142 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-03 19:49:22,142 INFO L85 PathProgramCache]: Analyzing trace with hash -125801558, now seen corresponding path program 1 times [2025-03-03 19:49:22,142 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-03 19:49:22,142 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [327011082] [2025-03-03 19:49:22,142 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-03 19:49:22,143 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-03 19:49:22,164 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 470 statements into 1 equivalence classes. [2025-03-03 19:49:22,257 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 470 of 470 statements. [2025-03-03 19:49:22,258 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-03 19:49:22,258 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-03 19:49:23,240 INFO L134 CoverageAnalysis]: Checked inductivity of 10804 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 10804 trivial. 0 not checked. [2025-03-03 19:49:23,241 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-03 19:49:23,241 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [327011082] [2025-03-03 19:49:23,241 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [327011082] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-03 19:49:23,241 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-03 19:49:23,241 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2025-03-03 19:49:23,242 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1766835589] [2025-03-03 19:49:23,242 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-03 19:49:23,243 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2025-03-03 19:49:23,243 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-03 19:49:23,243 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2025-03-03 19:49:23,243 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2025-03-03 19:49:23,244 INFO L87 Difference]: Start difference. First operand 15772 states and 26061 transitions. Second operand has 4 states, 4 states have (on average 25.75) internal successors, (103), 4 states have internal predecessors, (103), 1 states have call successors, (74), 1 states have call predecessors, (74), 1 states have return successors, (74), 1 states have call predecessors, (74), 1 states have call successors, (74) [2025-03-03 19:49:24,739 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-03 19:49:24,740 INFO L93 Difference]: Finished difference Result 31435 states and 51901 transitions. [2025-03-03 19:49:24,740 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2025-03-03 19:49:24,741 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 4 states have (on average 25.75) internal successors, (103), 4 states have internal predecessors, (103), 1 states have call successors, (74), 1 states have call predecessors, (74), 1 states have return successors, (74), 1 states have call predecessors, (74), 1 states have call successors, (74) Word has length 470 [2025-03-03 19:49:24,741 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-03 19:49:24,809 INFO L225 Difference]: With dead ends: 31435 [2025-03-03 19:49:24,809 INFO L226 Difference]: Without dead ends: 15666 [2025-03-03 19:49:24,848 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 10 GetRequests, 7 SyntacticMatches, 0 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=9, Invalid=11, Unknown=0, NotChecked=0, Total=20 [2025-03-03 19:49:24,849 INFO L435 NwaCegarLoop]: 454 mSDtfsCounter, 525 mSDsluCounter, 510 mSDsCounter, 0 mSdLazyCounter, 282 mSolverCounterSat, 79 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.5s Time, 0 mProtectedPredicate, 0 mProtectedAction, 525 SdHoareTripleChecker+Valid, 964 SdHoareTripleChecker+Invalid, 361 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 79 IncrementalHoareTripleChecker+Valid, 282 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.6s IncrementalHoareTripleChecker+Time [2025-03-03 19:49:24,849 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [525 Valid, 964 Invalid, 361 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [79 Valid, 282 Invalid, 0 Unknown, 0 Unchecked, 0.6s Time] [2025-03-03 19:49:24,864 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 15666 states. [2025-03-03 19:49:25,827 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 15666 to 15652. [2025-03-03 19:49:25,850 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 15652 states, 12017 states have (on average 1.5603728051926438) internal successors, (18751), 12097 states have internal predecessors, (18751), 3520 states have call successors, (3520), 114 states have call predecessors, (3520), 114 states have return successors, (3520), 3440 states have call predecessors, (3520), 3520 states have call successors, (3520) [2025-03-03 19:49:25,889 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 15652 states to 15652 states and 25791 transitions. [2025-03-03 19:49:25,918 INFO L78 Accepts]: Start accepts. Automaton has 15652 states and 25791 transitions. Word has length 470 [2025-03-03 19:49:25,918 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-03 19:49:25,918 INFO L471 AbstractCegarLoop]: Abstraction has 15652 states and 25791 transitions. [2025-03-03 19:49:25,919 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 25.75) internal successors, (103), 4 states have internal predecessors, (103), 1 states have call successors, (74), 1 states have call predecessors, (74), 1 states have return successors, (74), 1 states have call predecessors, (74), 1 states have call successors, (74) [2025-03-03 19:49:25,919 INFO L276 IsEmpty]: Start isEmpty. Operand 15652 states and 25791 transitions. [2025-03-03 19:49:25,925 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 471 [2025-03-03 19:49:25,926 INFO L210 NwaCegarLoop]: Found error trace [2025-03-03 19:49:25,926 INFO L218 NwaCegarLoop]: trace histogram [74, 74, 74, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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-03 19:49:25,926 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable14 [2025-03-03 19:49:25,926 INFO L396 AbstractCegarLoop]: === Iteration 16 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-03-03 19:49:25,926 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-03 19:49:25,927 INFO L85 PathProgramCache]: Analyzing trace with hash -1826542037, now seen corresponding path program 1 times [2025-03-03 19:49:25,927 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-03 19:49:25,927 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2069468471] [2025-03-03 19:49:25,927 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-03 19:49:25,927 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-03 19:49:25,944 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 470 statements into 1 equivalence classes. [2025-03-03 19:49:26,012 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 470 of 470 statements. [2025-03-03 19:49:26,012 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-03 19:49:26,012 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-03 19:49:28,470 INFO L134 CoverageAnalysis]: Checked inductivity of 10804 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 10804 trivial. 0 not checked. [2025-03-03 19:49:28,470 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-03 19:49:28,471 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2069468471] [2025-03-03 19:49:28,471 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [2069468471] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-03 19:49:28,471 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-03 19:49:28,471 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [12] imperfect sequences [] total 12 [2025-03-03 19:49:28,471 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1780961457] [2025-03-03 19:49:28,471 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-03 19:49:28,471 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 12 states [2025-03-03 19:49:28,472 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-03 19:49:28,473 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 12 interpolants. [2025-03-03 19:49:28,473 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=24, Invalid=108, Unknown=0, NotChecked=0, Total=132 [2025-03-03 19:49:28,473 INFO L87 Difference]: Start difference. First operand 15652 states and 25791 transitions. Second operand has 12 states, 12 states have (on average 8.583333333333334) internal successors, (103), 12 states have internal predecessors, (103), 4 states have call successors, (74), 1 states have call predecessors, (74), 1 states have return successors, (74), 4 states have call predecessors, (74), 4 states have call successors, (74) [2025-03-03 19:49:39,771 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-03 19:49:39,771 INFO L93 Difference]: Finished difference Result 70449 states and 114771 transitions. [2025-03-03 19:49:39,771 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 18 states. [2025-03-03 19:49:39,772 INFO L78 Accepts]: Start accepts. Automaton has has 12 states, 12 states have (on average 8.583333333333334) internal successors, (103), 12 states have internal predecessors, (103), 4 states have call successors, (74), 1 states have call predecessors, (74), 1 states have return successors, (74), 4 states have call predecessors, (74), 4 states have call successors, (74) Word has length 470 [2025-03-03 19:49:39,776 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-03 19:49:39,979 INFO L225 Difference]: With dead ends: 70449 [2025-03-03 19:49:39,980 INFO L226 Difference]: Without dead ends: 54800 [2025-03-03 19:49:40,023 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 47 GetRequests, 21 SyntacticMatches, 0 SemanticMatches, 26 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 107 ImplicationChecksByTransitivity, 1.2s TimeCoverageRelationStatistics Valid=245, Invalid=511, Unknown=0, NotChecked=0, Total=756 [2025-03-03 19:49:40,024 INFO L435 NwaCegarLoop]: 497 mSDtfsCounter, 3310 mSDsluCounter, 2867 mSDsCounter, 0 mSdLazyCounter, 2264 mSolverCounterSat, 1894 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 3.8s Time, 0 mProtectedPredicate, 0 mProtectedAction, 3310 SdHoareTripleChecker+Valid, 3364 SdHoareTripleChecker+Invalid, 4158 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 1894 IncrementalHoareTripleChecker+Valid, 2264 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 4.4s IncrementalHoareTripleChecker+Time [2025-03-03 19:49:40,024 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [3310 Valid, 3364 Invalid, 4158 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [1894 Valid, 2264 Invalid, 0 Unknown, 0 Unchecked, 4.4s Time] [2025-03-03 19:49:40,059 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 54800 states. [2025-03-03 19:49:43,268 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 54800 to 21783. [2025-03-03 19:49:43,288 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 21783 states, 17180 states have (on average 1.5679860302677533) internal successors, (26938), 17296 states have internal predecessors, (26938), 4420 states have call successors, (4420), 182 states have call predecessors, (4420), 182 states have return successors, (4420), 4304 states have call predecessors, (4420), 4420 states have call successors, (4420) [2025-03-03 19:49:43,335 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 21783 states to 21783 states and 35778 transitions. [2025-03-03 19:49:43,373 INFO L78 Accepts]: Start accepts. Automaton has 21783 states and 35778 transitions. Word has length 470 [2025-03-03 19:49:43,374 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-03 19:49:43,374 INFO L471 AbstractCegarLoop]: Abstraction has 21783 states and 35778 transitions. [2025-03-03 19:49:43,374 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 12 states, 12 states have (on average 8.583333333333334) internal successors, (103), 12 states have internal predecessors, (103), 4 states have call successors, (74), 1 states have call predecessors, (74), 1 states have return successors, (74), 4 states have call predecessors, (74), 4 states have call successors, (74) [2025-03-03 19:49:43,374 INFO L276 IsEmpty]: Start isEmpty. Operand 21783 states and 35778 transitions. [2025-03-03 19:49:43,382 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 471 [2025-03-03 19:49:43,382 INFO L210 NwaCegarLoop]: Found error trace [2025-03-03 19:49:43,383 INFO L218 NwaCegarLoop]: trace histogram [74, 74, 74, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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-03 19:49:43,383 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable15 [2025-03-03 19:49:43,383 INFO L396 AbstractCegarLoop]: === Iteration 17 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-03-03 19:49:43,383 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-03 19:49:43,384 INFO L85 PathProgramCache]: Analyzing trace with hash 1443731338, now seen corresponding path program 1 times [2025-03-03 19:49:43,384 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-03 19:49:43,384 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2138795799] [2025-03-03 19:49:43,384 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-03 19:49:43,384 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-03 19:49:43,400 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 470 statements into 1 equivalence classes. [2025-03-03 19:49:43,463 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 470 of 470 statements. [2025-03-03 19:49:43,464 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-03 19:49:43,464 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-03 19:49:43,815 INFO L134 CoverageAnalysis]: Checked inductivity of 10804 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 10804 trivial. 0 not checked. [2025-03-03 19:49:43,815 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-03 19:49:43,815 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2138795799] [2025-03-03 19:49:43,815 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [2138795799] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-03 19:49:43,815 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-03 19:49:43,815 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2025-03-03 19:49:43,815 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1602645086] [2025-03-03 19:49:43,816 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-03 19:49:43,816 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2025-03-03 19:49:43,816 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-03 19:49:43,817 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2025-03-03 19:49:43,817 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2025-03-03 19:49:43,818 INFO L87 Difference]: Start difference. First operand 21783 states and 35778 transitions. Second operand has 5 states, 5 states have (on average 20.6) internal successors, (103), 5 states have internal predecessors, (103), 2 states have call successors, (74), 1 states have call predecessors, (74), 1 states have return successors, (74), 2 states have call predecessors, (74), 2 states have call successors, (74) [2025-03-03 19:49:46,333 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-03 19:49:46,334 INFO L93 Difference]: Finished difference Result 43244 states and 71046 transitions. [2025-03-03 19:49:46,334 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2025-03-03 19:49:46,335 INFO L78 Accepts]: Start accepts. Automaton has has 5 states, 5 states have (on average 20.6) internal successors, (103), 5 states have internal predecessors, (103), 2 states have call successors, (74), 1 states have call predecessors, (74), 1 states have return successors, (74), 2 states have call predecessors, (74), 2 states have call successors, (74) Word has length 470 [2025-03-03 19:49:46,335 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-03 19:49:46,414 INFO L225 Difference]: With dead ends: 43244 [2025-03-03 19:49:46,414 INFO L226 Difference]: Without dead ends: 21464 [2025-03-03 19:49:46,453 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 8 GetRequests, 3 SyntacticMatches, 0 SemanticMatches, 5 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=17, Invalid=25, Unknown=0, NotChecked=0, Total=42 [2025-03-03 19:49:46,454 INFO L435 NwaCegarLoop]: 330 mSDtfsCounter, 317 mSDsluCounter, 650 mSDsCounter, 0 mSdLazyCounter, 134 mSolverCounterSat, 2 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 317 SdHoareTripleChecker+Valid, 980 SdHoareTripleChecker+Invalid, 136 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 2 IncrementalHoareTripleChecker+Valid, 134 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2025-03-03 19:49:46,454 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [317 Valid, 980 Invalid, 136 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [2 Valid, 134 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2025-03-03 19:49:46,467 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 21464 states. [2025-03-03 19:49:49,058 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 21464 to 21176. [2025-03-03 19:49:49,077 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 21176 states, 16573 states have (on average 1.560550292644663) internal successors, (25863), 16689 states have internal predecessors, (25863), 4420 states have call successors, (4420), 182 states have call predecessors, (4420), 182 states have return successors, (4420), 4304 states have call predecessors, (4420), 4420 states have call successors, (4420) [2025-03-03 19:49:49,120 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 21176 states to 21176 states and 34703 transitions. [2025-03-03 19:49:49,139 INFO L78 Accepts]: Start accepts. Automaton has 21176 states and 34703 transitions. Word has length 470 [2025-03-03 19:49:49,140 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-03 19:49:49,140 INFO L471 AbstractCegarLoop]: Abstraction has 21176 states and 34703 transitions. [2025-03-03 19:49:49,140 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 20.6) internal successors, (103), 5 states have internal predecessors, (103), 2 states have call successors, (74), 1 states have call predecessors, (74), 1 states have return successors, (74), 2 states have call predecessors, (74), 2 states have call successors, (74) [2025-03-03 19:49:49,140 INFO L276 IsEmpty]: Start isEmpty. Operand 21176 states and 34703 transitions. [2025-03-03 19:49:49,148 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 471 [2025-03-03 19:49:49,148 INFO L210 NwaCegarLoop]: Found error trace [2025-03-03 19:49:49,148 INFO L218 NwaCegarLoop]: trace histogram [74, 74, 74, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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-03 19:49:49,148 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable16 [2025-03-03 19:49:49,148 INFO L396 AbstractCegarLoop]: === Iteration 18 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-03-03 19:49:49,149 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-03 19:49:49,149 INFO L85 PathProgramCache]: Analyzing trace with hash -948121334, now seen corresponding path program 1 times [2025-03-03 19:49:49,149 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-03 19:49:49,149 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1686777613] [2025-03-03 19:49:49,149 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-03 19:49:49,149 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-03 19:49:49,167 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 470 statements into 1 equivalence classes. [2025-03-03 19:49:49,244 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 470 of 470 statements. [2025-03-03 19:49:49,244 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-03 19:49:49,244 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat