./Ultimate.py --spec ../sv-benchmarks/c/properties/unreach-call.prp --file ../sv-benchmarks/c/hardness-nfm22/hardness_fillercode_fillercodesize_ps-cn-500_file-25.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-500_file-25.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 ec10ea9e3b5ae44205b1577b4332bbdea7d48266e807778645f0ab1e80c264b0 --- Real Ultimate output --- This is Ultimate 0.3.0-?-798a7b3-m [2025-03-03 20:06:24,691 INFO L188 SettingsManager]: Resetting all preferences to default values... [2025-03-03 20:06:24,745 INFO L114 SettingsManager]: Loading settings from /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/config/svcomp-Reach-32bit-Automizer_Default.epf [2025-03-03 20:06:24,751 WARN L101 SettingsManager]: Preference file contains the following unknown settings: [2025-03-03 20:06:24,754 WARN L103 SettingsManager]: * de.uni_freiburg.informatik.ultimate.core.Log level for class [2025-03-03 20:06:24,773 INFO L130 SettingsManager]: Preferences different from defaults after loading the file: [2025-03-03 20:06:24,774 INFO L151 SettingsManager]: Preferences of UltimateCore differ from their defaults: [2025-03-03 20:06:24,774 INFO L153 SettingsManager]: * Log level for class=de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher=ERROR; [2025-03-03 20:06:24,775 INFO L151 SettingsManager]: Preferences of Boogie Preprocessor differ from their defaults: [2025-03-03 20:06:24,775 INFO L153 SettingsManager]: * Use memory slicer=true [2025-03-03 20:06:24,776 INFO L151 SettingsManager]: Preferences of Boogie Procedure Inliner differ from their defaults: [2025-03-03 20:06:24,776 INFO L153 SettingsManager]: * Ignore calls to procedures called more than once=ONLY_FOR_SEQUENTIAL_PROGRAMS [2025-03-03 20:06:24,776 INFO L151 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2025-03-03 20:06:24,776 INFO L153 SettingsManager]: * Create parallel compositions if possible=false [2025-03-03 20:06:24,776 INFO L153 SettingsManager]: * Use SBE=true [2025-03-03 20:06:24,776 INFO L151 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2025-03-03 20:06:24,776 INFO L153 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2025-03-03 20:06:24,776 INFO L153 SettingsManager]: * sizeof long=4 [2025-03-03 20:06:24,776 INFO L153 SettingsManager]: * Overapproximate operations on floating types=true [2025-03-03 20:06:24,776 INFO L153 SettingsManager]: * sizeof POINTER=4 [2025-03-03 20:06:24,776 INFO L153 SettingsManager]: * Check division by zero=IGNORE [2025-03-03 20:06:24,776 INFO L153 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2025-03-03 20:06:24,776 INFO L153 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2025-03-03 20:06:24,776 INFO L153 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2025-03-03 20:06:24,776 INFO L153 SettingsManager]: * sizeof long double=12 [2025-03-03 20:06:24,777 INFO L153 SettingsManager]: * Check if freed pointer was valid=false [2025-03-03 20:06:24,777 INFO L153 SettingsManager]: * Behaviour of calls to undefined functions=OVERAPPROXIMATE_BEHAVIOUR [2025-03-03 20:06:24,777 INFO L153 SettingsManager]: * Use constant arrays=true [2025-03-03 20:06:24,777 INFO L151 SettingsManager]: Preferences of IcfgBuilder differ from their defaults: [2025-03-03 20:06:24,777 INFO L153 SettingsManager]: * Size of a code block=SequenceOfStatements [2025-03-03 20:06:24,777 INFO L153 SettingsManager]: * Only consider context switches at boundaries of atomic blocks=true [2025-03-03 20:06:24,777 INFO L153 SettingsManager]: * SMT solver=External_DefaultMode [2025-03-03 20:06:24,777 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2025-03-03 20:06:24,777 INFO L151 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2025-03-03 20:06:24,777 INFO L153 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2025-03-03 20:06:24,777 INFO L153 SettingsManager]: * Compute procedure contracts=false [2025-03-03 20:06:24,777 INFO L153 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopHeads [2025-03-03 20:06:24,777 INFO L153 SettingsManager]: * Trace refinement strategy=CAMEL [2025-03-03 20:06:24,777 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2025-03-03 20:06:24,777 INFO L153 SettingsManager]: * Apply one-shot large block encoding in concurrent analysis=false [2025-03-03 20:06:24,777 INFO L153 SettingsManager]: * Automaton type used in concurrency analysis=PETRI_NET [2025-03-03 20:06:24,777 INFO L153 SettingsManager]: * Order on configurations for Petri net unfoldings=DBO [2025-03-03 20:06:24,777 INFO L153 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode [2025-03-03 20:06:24,777 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 -> ec10ea9e3b5ae44205b1577b4332bbdea7d48266e807778645f0ab1e80c264b0 [2025-03-03 20:06:24,994 INFO L75 nceAwareModelManager]: Repository-Root is: /tmp [2025-03-03 20:06:25,003 INFO L261 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2025-03-03 20:06:25,005 INFO L217 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2025-03-03 20:06:25,006 INFO L270 PluginConnector]: Initializing CDTParser... [2025-03-03 20:06:25,006 INFO L274 PluginConnector]: CDTParser initialized [2025-03-03 20:06:25,008 INFO L431 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/../sv-benchmarks/c/hardness-nfm22/hardness_fillercode_fillercodesize_ps-cn-500_file-25.i [2025-03-03 20:06:26,116 INFO L533 CDTParser]: Created temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/d3659d2e9/ffe9f59a49cb4554b89bd947d128b166/FLAGba88aa700 [2025-03-03 20:06:26,428 INFO L384 CDTParser]: Found 1 translation units. [2025-03-03 20:06:26,429 INFO L180 CDTParser]: Scanning /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/hardness-nfm22/hardness_fillercode_fillercodesize_ps-cn-500_file-25.i [2025-03-03 20:06:26,443 INFO L427 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/d3659d2e9/ffe9f59a49cb4554b89bd947d128b166/FLAGba88aa700 [2025-03-03 20:06:26,687 INFO L435 CDTParser]: Successfully deleted /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/d3659d2e9/ffe9f59a49cb4554b89bd947d128b166 [2025-03-03 20:06:26,689 INFO L299 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2025-03-03 20:06:26,690 INFO L133 ToolchainWalker]: Walking toolchain with 6 elements. [2025-03-03 20:06:26,691 INFO L112 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2025-03-03 20:06:26,691 INFO L270 PluginConnector]: Initializing CACSL2BoogieTranslator... [2025-03-03 20:06:26,694 INFO L274 PluginConnector]: CACSL2BoogieTranslator initialized [2025-03-03 20:06:26,694 INFO L184 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 03.03 08:06:26" (1/1) ... [2025-03-03 20:06:26,695 INFO L204 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@5069a45a and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 03.03 08:06:26, skipping insertion in model container [2025-03-03 20:06:26,695 INFO L184 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 03.03 08:06:26" (1/1) ... [2025-03-03 20:06:26,728 INFO L175 MainTranslator]: Built tables and reachable declarations [2025-03-03 20:06:26,819 WARN L250 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/hardness-nfm22/hardness_fillercode_fillercodesize_ps-cn-500_file-25.i[916,929] [2025-03-03 20:06:26,932 INFO L210 PostProcessor]: Analyzing one entry point: main [2025-03-03 20:06:26,947 INFO L200 MainTranslator]: Completed pre-run [2025-03-03 20:06:26,954 WARN L250 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/hardness-nfm22/hardness_fillercode_fillercodesize_ps-cn-500_file-25.i[916,929] [2025-03-03 20:06:27,030 INFO L210 PostProcessor]: Analyzing one entry point: main [2025-03-03 20:06:27,050 INFO L204 MainTranslator]: Completed translation [2025-03-03 20:06:27,050 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 03.03 08:06:27 WrapperNode [2025-03-03 20:06:27,050 INFO L131 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2025-03-03 20:06:27,051 INFO L112 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2025-03-03 20:06:27,051 INFO L270 PluginConnector]: Initializing Boogie Procedure Inliner... [2025-03-03 20:06:27,051 INFO L274 PluginConnector]: Boogie Procedure Inliner initialized [2025-03-03 20:06:27,055 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 03.03 08:06:27" (1/1) ... [2025-03-03 20:06:27,072 INFO L184 PluginConnector]: Executing the observer Inliner from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 03.03 08:06:27" (1/1) ... [2025-03-03 20:06:27,123 INFO L138 Inliner]: procedures = 26, calls = 120, calls flagged for inlining = 8, calls inlined = 8, statements flattened = 918 [2025-03-03 20:06:27,124 INFO L131 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2025-03-03 20:06:27,124 INFO L112 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2025-03-03 20:06:27,124 INFO L270 PluginConnector]: Initializing Boogie Preprocessor... [2025-03-03 20:06:27,124 INFO L274 PluginConnector]: Boogie Preprocessor initialized [2025-03-03 20:06:27,131 INFO L184 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 03.03 08:06:27" (1/1) ... [2025-03-03 20:06:27,132 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 03.03 08:06:27" (1/1) ... [2025-03-03 20:06:27,141 INFO L184 PluginConnector]: Executing the observer MemorySlicer from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 03.03 08:06:27" (1/1) ... [2025-03-03 20:06:27,169 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 20:06:27,169 INFO L184 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 03.03 08:06:27" (1/1) ... [2025-03-03 20:06:27,169 INFO L184 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 03.03 08:06:27" (1/1) ... [2025-03-03 20:06:27,188 INFO L184 PluginConnector]: Executing the observer ReplaceArrayAssignments from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 03.03 08:06:27" (1/1) ... [2025-03-03 20:06:27,190 INFO L184 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 03.03 08:06:27" (1/1) ... [2025-03-03 20:06:27,193 INFO L184 PluginConnector]: Executing the observer LTLStepAnnotator from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 03.03 08:06:27" (1/1) ... [2025-03-03 20:06:27,196 INFO L184 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 03.03 08:06:27" (1/1) ... [2025-03-03 20:06:27,201 INFO L131 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2025-03-03 20:06:27,202 INFO L112 PluginConnector]: ------------------------IcfgBuilder---------------------------- [2025-03-03 20:06:27,203 INFO L270 PluginConnector]: Initializing IcfgBuilder... [2025-03-03 20:06:27,203 INFO L274 PluginConnector]: IcfgBuilder initialized [2025-03-03 20:06:27,207 INFO L184 PluginConnector]: Executing the observer IcfgBuilderObserver from plugin IcfgBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 03.03 08:06:27" (1/1) ... [2025-03-03 20:06:27,210 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2025-03-03 20:06:27,220 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2025-03-03 20:06:27,234 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 20:06:27,238 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 20:06:27,255 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocInit [2025-03-03 20:06:27,255 INFO L130 BoogieDeclarations]: Found specification of procedure assume_abort_if_not [2025-03-03 20:06:27,255 INFO L138 BoogieDeclarations]: Found implementation of procedure assume_abort_if_not [2025-03-03 20:06:27,255 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int#0 [2025-03-03 20:06:27,255 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2025-03-03 20:06:27,255 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2025-03-03 20:06:27,382 INFO L256 CfgBuilder]: Building ICFG [2025-03-03 20:06:27,384 INFO L286 CfgBuilder]: Building CFG for each procedure with an implementation [2025-03-03 20:06:28,437 INFO L? ?]: Removed 35 outVars from TransFormulas that were not future-live. [2025-03-03 20:06:28,437 INFO L307 CfgBuilder]: Performing block encoding [2025-03-03 20:06:28,464 INFO L331 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2025-03-03 20:06:28,467 INFO L336 CfgBuilder]: Removed 1 assume(true) statements. [2025-03-03 20:06:28,467 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.icfgbuilder CFG 03.03 08:06:28 BoogieIcfgContainer [2025-03-03 20:06:28,467 INFO L131 PluginConnector]: ------------------------ END IcfgBuilder---------------------------- [2025-03-03 20:06:28,469 INFO L112 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2025-03-03 20:06:28,469 INFO L270 PluginConnector]: Initializing TraceAbstraction... [2025-03-03 20:06:28,472 INFO L274 PluginConnector]: TraceAbstraction initialized [2025-03-03 20:06:28,472 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 03.03 08:06:26" (1/3) ... [2025-03-03 20:06:28,472 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@5f69b13 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 03.03 08:06:28, skipping insertion in model container [2025-03-03 20:06:28,473 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 03.03 08:06:27" (2/3) ... [2025-03-03 20:06:28,473 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@5f69b13 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 03.03 08:06:28, skipping insertion in model container [2025-03-03 20:06:28,473 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.icfgbuilder CFG 03.03 08:06:28" (3/3) ... [2025-03-03 20:06:28,474 INFO L128 eAbstractionObserver]: Analyzing ICFG hardness_fillercode_fillercodesize_ps-cn-500_file-25.i [2025-03-03 20:06:28,486 INFO L216 ceAbstractionStarter]: Automizer settings: Hoare:LoopHeads NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2025-03-03 20:06:28,489 INFO L151 ceAbstractionStarter]: Applying trace abstraction to ICFG hardness_fillercode_fillercodesize_ps-cn-500_file-25.i that has 2 procedures, 368 locations, 1 initial locations, 1 loop locations, and 1 error locations. [2025-03-03 20:06:28,547 INFO L332 AbstractCegarLoop]: ======== Iteration 0 == of CEGAR loop == AllErrorsAtOnce ======== [2025-03-03 20:06:28,557 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;@651a9932, mLbeIndependenceSettings=[IndependenceType=SEMANTIC, AbstractionType=NONE, UseConditional=false, UseSemiCommutativity=true, Solver=Z3, SolverTimeout=1000ms] [2025-03-03 20:06:28,558 INFO L334 AbstractCegarLoop]: Starting to check reachability of 1 error locations. [2025-03-03 20:06:28,562 INFO L276 IsEmpty]: Start isEmpty. Operand has 368 states, 258 states have (on average 1.5968992248062015) internal successors, (412), 259 states have internal predecessors, (412), 107 states have call successors, (107), 1 states have call predecessors, (107), 1 states have return successors, (107), 107 states have call predecessors, (107), 107 states have call successors, (107) [2025-03-03 20:06:28,592 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 697 [2025-03-03 20:06:28,592 INFO L210 NwaCegarLoop]: Found error trace [2025-03-03 20:06:28,593 INFO L218 NwaCegarLoop]: trace histogram [107, 107, 107, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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 20:06:28,593 INFO L396 AbstractCegarLoop]: === Iteration 1 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-03-03 20:06:28,597 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-03 20:06:28,597 INFO L85 PathProgramCache]: Analyzing trace with hash -1513315904, now seen corresponding path program 1 times [2025-03-03 20:06:28,602 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-03 20:06:28,603 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1648093260] [2025-03-03 20:06:28,603 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-03 20:06:28,603 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-03 20:06:28,709 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 696 statements into 1 equivalence classes. [2025-03-03 20:06:28,769 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 696 of 696 statements. [2025-03-03 20:06:28,770 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-03 20:06:28,770 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-03 20:06:29,207 INFO L134 CoverageAnalysis]: Checked inductivity of 22684 backedges. 0 proven. 212 refuted. 0 times theorem prover too weak. 22472 trivial. 0 not checked. [2025-03-03 20:06:29,208 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-03 20:06:29,208 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1648093260] [2025-03-03 20:06:29,209 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1648093260] provided 0 perfect and 1 imperfect interpolant sequences [2025-03-03 20:06:29,210 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1951863486] [2025-03-03 20:06:29,210 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-03 20:06:29,211 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-03-03 20:06:29,211 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2025-03-03 20:06:29,213 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 20:06:29,215 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 20:06:29,394 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 696 statements into 1 equivalence classes. [2025-03-03 20:06:29,595 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 696 of 696 statements. [2025-03-03 20:06:29,595 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-03 20:06:29,596 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-03 20:06:29,603 INFO L256 TraceCheckSpWp]: Trace formula consists of 1615 conjuncts, 1 conjuncts are in the unsatisfiable core [2025-03-03 20:06:29,626 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-03-03 20:06:29,698 INFO L134 CoverageAnalysis]: Checked inductivity of 22684 backedges. 212 proven. 0 refuted. 0 times theorem prover too weak. 22472 trivial. 0 not checked. [2025-03-03 20:06:29,702 INFO L308 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2025-03-03 20:06:29,703 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1951863486] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-03 20:06:29,703 INFO L185 FreeRefinementEngine]: Found 1 perfect and 1 imperfect interpolant sequences. [2025-03-03 20:06:29,703 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [2] total 2 [2025-03-03 20:06:29,705 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1526371182] [2025-03-03 20:06:29,708 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-03 20:06:29,714 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 2 states [2025-03-03 20:06:29,714 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-03 20:06:29,730 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 2 interpolants. [2025-03-03 20:06:29,730 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=1, Invalid=1, Unknown=0, NotChecked=0, Total=2 [2025-03-03 20:06:29,735 INFO L87 Difference]: Start difference. First operand has 368 states, 258 states have (on average 1.5968992248062015) internal successors, (412), 259 states have internal predecessors, (412), 107 states have call successors, (107), 1 states have call predecessors, (107), 1 states have return successors, (107), 107 states have call predecessors, (107), 107 states have call successors, (107) Second operand has 2 states, 2 states have (on average 83.0) internal successors, (166), 2 states have internal predecessors, (166), 2 states have call successors, (107), 2 states have call predecessors, (107), 1 states have return successors, (107), 1 states have call predecessors, (107), 2 states have call successors, (107) [2025-03-03 20:06:29,833 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-03 20:06:29,833 INFO L93 Difference]: Finished difference Result 730 states and 1354 transitions. [2025-03-03 20:06:29,834 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 2 states. [2025-03-03 20:06:29,835 INFO L78 Accepts]: Start accepts. Automaton has has 2 states, 2 states have (on average 83.0) internal successors, (166), 2 states have internal predecessors, (166), 2 states have call successors, (107), 2 states have call predecessors, (107), 1 states have return successors, (107), 1 states have call predecessors, (107), 2 states have call successors, (107) Word has length 696 [2025-03-03 20:06:29,836 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-03 20:06:29,842 INFO L225 Difference]: With dead ends: 730 [2025-03-03 20:06:29,842 INFO L226 Difference]: Without dead ends: 365 [2025-03-03 20:06:29,847 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 697 GetRequests, 697 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 20:06:29,850 INFO L435 NwaCegarLoop]: 597 mSDtfsCounter, 0 mSDsluCounter, 0 mSDsCounter, 0 mSdLazyCounter, 22 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 0 SdHoareTripleChecker+Valid, 597 SdHoareTripleChecker+Invalid, 22 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 22 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2025-03-03 20:06:29,850 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [0 Valid, 597 Invalid, 22 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 22 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2025-03-03 20:06:29,864 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 365 states. [2025-03-03 20:06:29,913 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 365 to 365. [2025-03-03 20:06:29,915 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 365 states, 256 states have (on average 1.58203125) internal successors, (405), 256 states have internal predecessors, (405), 107 states have call successors, (107), 1 states have call predecessors, (107), 1 states have return successors, (107), 107 states have call predecessors, (107), 107 states have call successors, (107) [2025-03-03 20:06:29,921 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 365 states to 365 states and 619 transitions. [2025-03-03 20:06:29,923 INFO L78 Accepts]: Start accepts. Automaton has 365 states and 619 transitions. Word has length 696 [2025-03-03 20:06:29,923 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-03 20:06:29,923 INFO L471 AbstractCegarLoop]: Abstraction has 365 states and 619 transitions. [2025-03-03 20:06:29,924 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 2 states, 2 states have (on average 83.0) internal successors, (166), 2 states have internal predecessors, (166), 2 states have call successors, (107), 2 states have call predecessors, (107), 1 states have return successors, (107), 1 states have call predecessors, (107), 2 states have call successors, (107) [2025-03-03 20:06:29,924 INFO L276 IsEmpty]: Start isEmpty. Operand 365 states and 619 transitions. [2025-03-03 20:06:29,937 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 699 [2025-03-03 20:06:29,938 INFO L210 NwaCegarLoop]: Found error trace [2025-03-03 20:06:29,938 INFO L218 NwaCegarLoop]: trace histogram [107, 107, 107, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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 20:06:29,947 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (2)] Forceful destruction successful, exit code 0 [2025-03-03 20:06:30,142 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 20:06:30,142 INFO L396 AbstractCegarLoop]: === Iteration 2 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-03-03 20:06:30,144 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-03 20:06:30,144 INFO L85 PathProgramCache]: Analyzing trace with hash 820445046, now seen corresponding path program 1 times [2025-03-03 20:06:30,144 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-03 20:06:30,144 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [849556076] [2025-03-03 20:06:30,144 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-03 20:06:30,144 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-03 20:06:30,194 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 698 statements into 1 equivalence classes. [2025-03-03 20:06:30,299 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 698 of 698 statements. [2025-03-03 20:06:30,299 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-03 20:06:30,299 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-03 20:06:30,923 INFO L134 CoverageAnalysis]: Checked inductivity of 22684 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 22684 trivial. 0 not checked. [2025-03-03 20:06:30,923 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-03 20:06:30,923 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [849556076] [2025-03-03 20:06:30,923 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [849556076] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-03 20:06:30,924 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-03 20:06:30,924 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2025-03-03 20:06:30,924 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [212677873] [2025-03-03 20:06:30,924 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-03 20:06:30,925 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2025-03-03 20:06:30,925 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-03 20:06:30,926 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2025-03-03 20:06:30,926 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-03-03 20:06:30,926 INFO L87 Difference]: Start difference. First operand 365 states and 619 transitions. Second operand has 3 states, 3 states have (on average 55.333333333333336) internal successors, (166), 3 states have internal predecessors, (166), 1 states have call successors, (107), 1 states have call predecessors, (107), 1 states have return successors, (107), 1 states have call predecessors, (107), 1 states have call successors, (107) [2025-03-03 20:06:31,048 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-03 20:06:31,048 INFO L93 Difference]: Finished difference Result 941 states and 1606 transitions. [2025-03-03 20:06:31,049 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2025-03-03 20:06:31,049 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 55.333333333333336) internal successors, (166), 3 states have internal predecessors, (166), 1 states have call successors, (107), 1 states have call predecessors, (107), 1 states have return successors, (107), 1 states have call predecessors, (107), 1 states have call successors, (107) Word has length 698 [2025-03-03 20:06:31,052 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-03 20:06:31,058 INFO L225 Difference]: With dead ends: 941 [2025-03-03 20:06:31,058 INFO L226 Difference]: Without dead ends: 579 [2025-03-03 20:06:31,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 20:06:31,060 INFO L435 NwaCegarLoop]: 671 mSDtfsCounter, 363 mSDsluCounter, 570 mSDsCounter, 0 mSdLazyCounter, 73 mSolverCounterSat, 14 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 363 SdHoareTripleChecker+Valid, 1241 SdHoareTripleChecker+Invalid, 87 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 14 IncrementalHoareTripleChecker+Valid, 73 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2025-03-03 20:06:31,061 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [363 Valid, 1241 Invalid, 87 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [14 Valid, 73 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2025-03-03 20:06:31,062 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 579 states. [2025-03-03 20:06:31,112 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 579 to 576. [2025-03-03 20:06:31,115 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 576 states, 454 states have (on average 1.6365638766519823) internal successors, (743), 455 states have internal predecessors, (743), 119 states have call successors, (119), 2 states have call predecessors, (119), 2 states have return successors, (119), 118 states have call predecessors, (119), 119 states have call successors, (119) [2025-03-03 20:06:31,117 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 576 states to 576 states and 981 transitions. [2025-03-03 20:06:31,120 INFO L78 Accepts]: Start accepts. Automaton has 576 states and 981 transitions. Word has length 698 [2025-03-03 20:06:31,122 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-03 20:06:31,122 INFO L471 AbstractCegarLoop]: Abstraction has 576 states and 981 transitions. [2025-03-03 20:06:31,123 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 55.333333333333336) internal successors, (166), 3 states have internal predecessors, (166), 1 states have call successors, (107), 1 states have call predecessors, (107), 1 states have return successors, (107), 1 states have call predecessors, (107), 1 states have call successors, (107) [2025-03-03 20:06:31,123 INFO L276 IsEmpty]: Start isEmpty. Operand 576 states and 981 transitions. [2025-03-03 20:06:31,127 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 699 [2025-03-03 20:06:31,128 INFO L210 NwaCegarLoop]: Found error trace [2025-03-03 20:06:31,128 INFO L218 NwaCegarLoop]: trace histogram [107, 107, 107, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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 20:06:31,128 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable1 [2025-03-03 20:06:31,128 INFO L396 AbstractCegarLoop]: === Iteration 3 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-03-03 20:06:31,129 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-03 20:06:31,129 INFO L85 PathProgramCache]: Analyzing trace with hash 1335965495, now seen corresponding path program 1 times [2025-03-03 20:06:31,129 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-03 20:06:31,129 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [938501175] [2025-03-03 20:06:31,130 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-03 20:06:31,130 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-03 20:06:31,167 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 698 statements into 1 equivalence classes. [2025-03-03 20:06:31,232 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 698 of 698 statements. [2025-03-03 20:06:31,236 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-03 20:06:31,237 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-03 20:06:31,532 INFO L134 CoverageAnalysis]: Checked inductivity of 22684 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 22684 trivial. 0 not checked. [2025-03-03 20:06:31,533 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-03 20:06:31,533 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [938501175] [2025-03-03 20:06:31,534 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [938501175] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-03 20:06:31,534 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-03 20:06:31,534 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2025-03-03 20:06:31,534 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [508045504] [2025-03-03 20:06:31,534 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-03 20:06:31,535 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2025-03-03 20:06:31,535 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-03 20:06:31,536 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2025-03-03 20:06:31,536 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-03-03 20:06:31,537 INFO L87 Difference]: Start difference. First operand 576 states and 981 transitions. Second operand has 3 states, 3 states have (on average 55.333333333333336) internal successors, (166), 3 states have internal predecessors, (166), 1 states have call successors, (107), 1 states have call predecessors, (107), 1 states have return successors, (107), 1 states have call predecessors, (107), 1 states have call successors, (107) [2025-03-03 20:06:31,643 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-03 20:06:31,644 INFO L93 Difference]: Finished difference Result 1722 states and 2937 transitions. [2025-03-03 20:06:31,644 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2025-03-03 20:06:31,645 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 55.333333333333336) internal successors, (166), 3 states have internal predecessors, (166), 1 states have call successors, (107), 1 states have call predecessors, (107), 1 states have return successors, (107), 1 states have call predecessors, (107), 1 states have call successors, (107) Word has length 698 [2025-03-03 20:06:31,645 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-03 20:06:31,654 INFO L225 Difference]: With dead ends: 1722 [2025-03-03 20:06:31,654 INFO L226 Difference]: Without dead ends: 1149 [2025-03-03 20:06:31,656 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 20:06:31,656 INFO L435 NwaCegarLoop]: 590 mSDtfsCounter, 430 mSDsluCounter, 583 mSDsCounter, 0 mSdLazyCounter, 62 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 430 SdHoareTripleChecker+Valid, 1173 SdHoareTripleChecker+Invalid, 62 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 62 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2025-03-03 20:06:31,656 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [430 Valid, 1173 Invalid, 62 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 62 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2025-03-03 20:06:31,658 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1149 states. [2025-03-03 20:06:31,750 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1149 to 1143. [2025-03-03 20:06:31,752 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 1143 states, 900 states have (on average 1.6355555555555557) internal successors, (1472), 902 states have internal predecessors, (1472), 238 states have call successors, (238), 4 states have call predecessors, (238), 4 states have return successors, (238), 236 states have call predecessors, (238), 238 states have call successors, (238) [2025-03-03 20:06:31,757 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1143 states to 1143 states and 1948 transitions. [2025-03-03 20:06:31,758 INFO L78 Accepts]: Start accepts. Automaton has 1143 states and 1948 transitions. Word has length 698 [2025-03-03 20:06:31,759 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-03 20:06:31,760 INFO L471 AbstractCegarLoop]: Abstraction has 1143 states and 1948 transitions. [2025-03-03 20:06:31,760 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 55.333333333333336) internal successors, (166), 3 states have internal predecessors, (166), 1 states have call successors, (107), 1 states have call predecessors, (107), 1 states have return successors, (107), 1 states have call predecessors, (107), 1 states have call successors, (107) [2025-03-03 20:06:31,760 INFO L276 IsEmpty]: Start isEmpty. Operand 1143 states and 1948 transitions. [2025-03-03 20:06:31,765 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 699 [2025-03-03 20:06:31,766 INFO L210 NwaCegarLoop]: Found error trace [2025-03-03 20:06:31,766 INFO L218 NwaCegarLoop]: trace histogram [107, 107, 107, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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 20:06:31,766 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable2 [2025-03-03 20:06:31,766 INFO L396 AbstractCegarLoop]: === Iteration 4 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-03-03 20:06:31,767 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-03 20:06:31,767 INFO L85 PathProgramCache]: Analyzing trace with hash 126723256, now seen corresponding path program 1 times [2025-03-03 20:06:31,767 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-03 20:06:31,767 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1334246771] [2025-03-03 20:06:31,767 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-03 20:06:31,767 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-03 20:06:31,801 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 698 statements into 1 equivalence classes. [2025-03-03 20:06:31,838 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 698 of 698 statements. [2025-03-03 20:06:31,839 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-03 20:06:31,840 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-03 20:06:32,008 INFO L134 CoverageAnalysis]: Checked inductivity of 22684 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 22684 trivial. 0 not checked. [2025-03-03 20:06:32,009 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-03 20:06:32,009 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1334246771] [2025-03-03 20:06:32,009 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1334246771] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-03 20:06:32,009 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-03 20:06:32,009 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2025-03-03 20:06:32,009 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1897760257] [2025-03-03 20:06:32,009 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-03 20:06:32,010 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2025-03-03 20:06:32,010 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-03 20:06:32,011 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2025-03-03 20:06:32,011 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-03-03 20:06:32,012 INFO L87 Difference]: Start difference. First operand 1143 states and 1948 transitions. Second operand has 3 states, 3 states have (on average 55.333333333333336) internal successors, (166), 3 states have internal predecessors, (166), 1 states have call successors, (107), 1 states have call predecessors, (107), 1 states have return successors, (107), 1 states have call predecessors, (107), 1 states have call successors, (107) [2025-03-03 20:06:32,123 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-03 20:06:32,123 INFO L93 Difference]: Finished difference Result 2295 states and 3902 transitions. [2025-03-03 20:06:32,124 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2025-03-03 20:06:32,124 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 55.333333333333336) internal successors, (166), 3 states have internal predecessors, (166), 1 states have call successors, (107), 1 states have call predecessors, (107), 1 states have return successors, (107), 1 states have call predecessors, (107), 1 states have call successors, (107) Word has length 698 [2025-03-03 20:06:32,125 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-03 20:06:32,130 INFO L225 Difference]: With dead ends: 2295 [2025-03-03 20:06:32,131 INFO L226 Difference]: Without dead ends: 1155 [2025-03-03 20:06:32,150 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 20:06:32,152 INFO L435 NwaCegarLoop]: 687 mSDtfsCounter, 334 mSDsluCounter, 574 mSDsCounter, 0 mSdLazyCounter, 72 mSolverCounterSat, 6 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 334 SdHoareTripleChecker+Valid, 1261 SdHoareTripleChecker+Invalid, 78 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 6 IncrementalHoareTripleChecker+Valid, 72 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2025-03-03 20:06:32,152 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [334 Valid, 1261 Invalid, 78 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [6 Valid, 72 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2025-03-03 20:06:32,153 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1155 states. [2025-03-03 20:06:32,207 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1155 to 1053. [2025-03-03 20:06:32,209 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 1053 states, 834 states have (on average 1.6330935251798562) internal successors, (1362), 834 states have internal predecessors, (1362), 214 states have call successors, (214), 4 states have call predecessors, (214), 4 states have return successors, (214), 214 states have call predecessors, (214), 214 states have call successors, (214) [2025-03-03 20:06:32,214 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1053 states to 1053 states and 1790 transitions. [2025-03-03 20:06:32,215 INFO L78 Accepts]: Start accepts. Automaton has 1053 states and 1790 transitions. Word has length 698 [2025-03-03 20:06:32,216 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-03 20:06:32,216 INFO L471 AbstractCegarLoop]: Abstraction has 1053 states and 1790 transitions. [2025-03-03 20:06:32,216 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 55.333333333333336) internal successors, (166), 3 states have internal predecessors, (166), 1 states have call successors, (107), 1 states have call predecessors, (107), 1 states have return successors, (107), 1 states have call predecessors, (107), 1 states have call successors, (107) [2025-03-03 20:06:32,216 INFO L276 IsEmpty]: Start isEmpty. Operand 1053 states and 1790 transitions. [2025-03-03 20:06:32,223 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 700 [2025-03-03 20:06:32,223 INFO L210 NwaCegarLoop]: Found error trace [2025-03-03 20:06:32,224 INFO L218 NwaCegarLoop]: trace histogram [107, 107, 107, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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 20:06:32,224 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable3 [2025-03-03 20:06:32,224 INFO L396 AbstractCegarLoop]: === Iteration 5 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-03-03 20:06:32,224 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-03 20:06:32,225 INFO L85 PathProgramCache]: Analyzing trace with hash 493880033, now seen corresponding path program 1 times [2025-03-03 20:06:32,225 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-03 20:06:32,225 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1764968628] [2025-03-03 20:06:32,225 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-03 20:06:32,225 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-03 20:06:32,264 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 699 statements into 1 equivalence classes. [2025-03-03 20:06:32,304 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 699 of 699 statements. [2025-03-03 20:06:32,304 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-03 20:06:32,304 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-03 20:06:32,606 INFO L134 CoverageAnalysis]: Checked inductivity of 22684 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 22684 trivial. 0 not checked. [2025-03-03 20:06:32,607 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-03 20:06:32,607 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1764968628] [2025-03-03 20:06:32,607 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1764968628] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-03 20:06:32,607 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-03 20:06:32,607 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2025-03-03 20:06:32,607 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1935737356] [2025-03-03 20:06:32,607 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-03 20:06:32,609 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2025-03-03 20:06:32,609 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-03 20:06:32,609 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2025-03-03 20:06:32,610 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-03-03 20:06:32,610 INFO L87 Difference]: Start difference. First operand 1053 states and 1790 transitions. Second operand has 3 states, 3 states have (on average 55.666666666666664) internal successors, (167), 3 states have internal predecessors, (167), 1 states have call successors, (107), 1 states have call predecessors, (107), 1 states have return successors, (107), 1 states have call predecessors, (107), 1 states have call successors, (107) [2025-03-03 20:06:32,729 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-03 20:06:32,729 INFO L93 Difference]: Finished difference Result 2631 states and 4474 transitions. [2025-03-03 20:06:32,730 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2025-03-03 20:06:32,731 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 55.666666666666664) internal successors, (167), 3 states have internal predecessors, (167), 1 states have call successors, (107), 1 states have call predecessors, (107), 1 states have return successors, (107), 1 states have call predecessors, (107), 1 states have call successors, (107) Word has length 699 [2025-03-03 20:06:32,732 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-03 20:06:32,741 INFO L225 Difference]: With dead ends: 2631 [2025-03-03 20:06:32,742 INFO L226 Difference]: Without dead ends: 1581 [2025-03-03 20:06:32,745 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 20:06:32,745 INFO L435 NwaCegarLoop]: 742 mSDtfsCounter, 398 mSDsluCounter, 581 mSDsCounter, 0 mSdLazyCounter, 72 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 398 SdHoareTripleChecker+Valid, 1323 SdHoareTripleChecker+Invalid, 72 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 72 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2025-03-03 20:06:32,746 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [398 Valid, 1323 Invalid, 72 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 72 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2025-03-03 20:06:32,747 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1581 states. [2025-03-03 20:06:32,825 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1581 to 1575. [2025-03-03 20:06:32,828 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 1575 states, 1247 states have (on average 1.6311146752205292) internal successors, (2034), 1247 states have internal predecessors, (2034), 321 states have call successors, (321), 6 states have call predecessors, (321), 6 states have return successors, (321), 321 states have call predecessors, (321), 321 states have call successors, (321) [2025-03-03 20:06:32,835 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1575 states to 1575 states and 2676 transitions. [2025-03-03 20:06:32,837 INFO L78 Accepts]: Start accepts. Automaton has 1575 states and 2676 transitions. Word has length 699 [2025-03-03 20:06:32,838 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-03 20:06:32,838 INFO L471 AbstractCegarLoop]: Abstraction has 1575 states and 2676 transitions. [2025-03-03 20:06:32,838 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 55.666666666666664) internal successors, (167), 3 states have internal predecessors, (167), 1 states have call successors, (107), 1 states have call predecessors, (107), 1 states have return successors, (107), 1 states have call predecessors, (107), 1 states have call successors, (107) [2025-03-03 20:06:32,838 INFO L276 IsEmpty]: Start isEmpty. Operand 1575 states and 2676 transitions. [2025-03-03 20:06:32,843 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 701 [2025-03-03 20:06:32,844 INFO L210 NwaCegarLoop]: Found error trace [2025-03-03 20:06:32,844 INFO L218 NwaCegarLoop]: trace histogram [107, 107, 107, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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 20:06:32,844 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable4 [2025-03-03 20:06:32,844 INFO L396 AbstractCegarLoop]: === Iteration 6 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-03-03 20:06:32,845 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-03 20:06:32,845 INFO L85 PathProgramCache]: Analyzing trace with hash -2006253369, now seen corresponding path program 1 times [2025-03-03 20:06:32,845 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-03 20:06:32,845 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2135577778] [2025-03-03 20:06:32,845 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-03 20:06:32,845 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-03 20:06:32,877 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 700 statements into 1 equivalence classes. [2025-03-03 20:06:32,966 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 700 of 700 statements. [2025-03-03 20:06:32,966 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-03 20:06:32,967 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-03 20:06:33,593 INFO L134 CoverageAnalysis]: Checked inductivity of 22684 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 22684 trivial. 0 not checked. [2025-03-03 20:06:33,593 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-03 20:06:33,593 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2135577778] [2025-03-03 20:06:33,593 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [2135577778] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-03 20:06:33,593 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-03 20:06:33,594 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2025-03-03 20:06:33,594 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1845417907] [2025-03-03 20:06:33,594 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-03 20:06:33,594 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2025-03-03 20:06:33,594 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-03 20:06:33,595 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2025-03-03 20:06:33,595 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=9, Invalid=11, Unknown=0, NotChecked=0, Total=20 [2025-03-03 20:06:33,596 INFO L87 Difference]: Start difference. First operand 1575 states and 2676 transitions. Second operand has 5 states, 5 states have (on average 33.6) internal successors, (168), 5 states have internal predecessors, (168), 1 states have call successors, (107), 1 states have call predecessors, (107), 1 states have return successors, (107), 1 states have call predecessors, (107), 1 states have call successors, (107) [2025-03-03 20:06:34,028 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-03 20:06:34,028 INFO L93 Difference]: Finished difference Result 4250 states and 7240 transitions. [2025-03-03 20:06:34,029 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2025-03-03 20:06:34,029 INFO L78 Accepts]: Start accepts. Automaton has has 5 states, 5 states have (on average 33.6) internal successors, (168), 5 states have internal predecessors, (168), 1 states have call successors, (107), 1 states have call predecessors, (107), 1 states have return successors, (107), 1 states have call predecessors, (107), 1 states have call successors, (107) Word has length 700 [2025-03-03 20:06:34,030 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-03 20:06:34,042 INFO L225 Difference]: With dead ends: 4250 [2025-03-03 20:06:34,042 INFO L226 Difference]: Without dead ends: 2678 [2025-03-03 20:06:34,047 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 20:06:34,048 INFO L435 NwaCegarLoop]: 749 mSDtfsCounter, 334 mSDsluCounter, 1477 mSDsCounter, 0 mSdLazyCounter, 381 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.3s Time, 0 mProtectedPredicate, 0 mProtectedAction, 334 SdHoareTripleChecker+Valid, 2226 SdHoareTripleChecker+Invalid, 381 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 381 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.3s IncrementalHoareTripleChecker+Time [2025-03-03 20:06:34,048 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [334 Valid, 2226 Invalid, 381 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 381 Invalid, 0 Unknown, 0 Unchecked, 0.3s Time] [2025-03-03 20:06:34,051 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 2678 states. [2025-03-03 20:06:34,205 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 2678 to 2673. [2025-03-03 20:06:34,209 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 2673 states, 2240 states have (on average 1.659375) internal successors, (3717), 2243 states have internal predecessors, (3717), 420 states have call successors, (420), 12 states have call predecessors, (420), 12 states have return successors, (420), 417 states have call predecessors, (420), 420 states have call successors, (420) [2025-03-03 20:06:34,220 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 2673 states to 2673 states and 4557 transitions. [2025-03-03 20:06:34,223 INFO L78 Accepts]: Start accepts. Automaton has 2673 states and 4557 transitions. Word has length 700 [2025-03-03 20:06:34,224 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-03 20:06:34,224 INFO L471 AbstractCegarLoop]: Abstraction has 2673 states and 4557 transitions. [2025-03-03 20:06:34,224 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 33.6) internal successors, (168), 5 states have internal predecessors, (168), 1 states have call successors, (107), 1 states have call predecessors, (107), 1 states have return successors, (107), 1 states have call predecessors, (107), 1 states have call successors, (107) [2025-03-03 20:06:34,224 INFO L276 IsEmpty]: Start isEmpty. Operand 2673 states and 4557 transitions. [2025-03-03 20:06:34,234 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 701 [2025-03-03 20:06:34,234 INFO L210 NwaCegarLoop]: Found error trace [2025-03-03 20:06:34,235 INFO L218 NwaCegarLoop]: trace histogram [107, 107, 107, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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 20:06:34,235 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable5 [2025-03-03 20:06:34,235 INFO L396 AbstractCegarLoop]: === Iteration 7 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-03-03 20:06:34,235 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-03 20:06:34,236 INFO L85 PathProgramCache]: Analyzing trace with hash -1035962362, now seen corresponding path program 1 times [2025-03-03 20:06:34,236 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-03 20:06:34,236 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1415459987] [2025-03-03 20:06:34,236 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-03 20:06:34,236 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-03 20:06:34,275 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 700 statements into 1 equivalence classes. [2025-03-03 20:06:34,342 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 700 of 700 statements. [2025-03-03 20:06:34,342 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-03 20:06:34,342 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-03 20:06:34,583 INFO L134 CoverageAnalysis]: Checked inductivity of 22684 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 22684 trivial. 0 not checked. [2025-03-03 20:06:34,583 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-03 20:06:34,583 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1415459987] [2025-03-03 20:06:34,583 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1415459987] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-03 20:06:34,583 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-03 20:06:34,583 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2025-03-03 20:06:34,583 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1469882611] [2025-03-03 20:06:34,583 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-03 20:06:34,584 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2025-03-03 20:06:34,584 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-03 20:06:34,584 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2025-03-03 20:06:34,584 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-03-03 20:06:34,585 INFO L87 Difference]: Start difference. First operand 2673 states and 4557 transitions. Second operand has 3 states, 3 states have (on average 56.0) internal successors, (168), 3 states have internal predecessors, (168), 1 states have call successors, (107), 1 states have call predecessors, (107), 1 states have return successors, (107), 1 states have call predecessors, (107), 1 states have call successors, (107) [2025-03-03 20:06:34,680 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-03 20:06:34,681 INFO L93 Difference]: Finished difference Result 5355 states and 9135 transitions. [2025-03-03 20:06:34,681 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2025-03-03 20:06:34,682 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 56.0) internal successors, (168), 3 states have internal predecessors, (168), 1 states have call successors, (107), 1 states have call predecessors, (107), 1 states have return successors, (107), 1 states have call predecessors, (107), 1 states have call successors, (107) Word has length 700 [2025-03-03 20:06:34,683 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-03 20:06:34,694 INFO L225 Difference]: With dead ends: 5355 [2025-03-03 20:06:34,694 INFO L226 Difference]: Without dead ends: 2685 [2025-03-03 20:06:34,700 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 20:06:34,701 INFO L435 NwaCegarLoop]: 596 mSDtfsCounter, 0 mSDsluCounter, 592 mSDsCounter, 0 mSdLazyCounter, 49 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 0 SdHoareTripleChecker+Valid, 1188 SdHoareTripleChecker+Invalid, 49 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 49 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2025-03-03 20:06:34,701 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [0 Valid, 1188 Invalid, 49 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 49 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2025-03-03 20:06:34,704 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 2685 states. [2025-03-03 20:06:34,819 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 2685 to 2685. [2025-03-03 20:06:34,824 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 2685 states, 2252 states have (on average 1.6558614564831262) internal successors, (3729), 2255 states have internal predecessors, (3729), 420 states have call successors, (420), 12 states have call predecessors, (420), 12 states have return successors, (420), 417 states have call predecessors, (420), 420 states have call successors, (420) [2025-03-03 20:06:34,833 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 2685 states to 2685 states and 4569 transitions. [2025-03-03 20:06:34,835 INFO L78 Accepts]: Start accepts. Automaton has 2685 states and 4569 transitions. Word has length 700 [2025-03-03 20:06:34,836 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-03 20:06:34,836 INFO L471 AbstractCegarLoop]: Abstraction has 2685 states and 4569 transitions. [2025-03-03 20:06:34,836 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 56.0) internal successors, (168), 3 states have internal predecessors, (168), 1 states have call successors, (107), 1 states have call predecessors, (107), 1 states have return successors, (107), 1 states have call predecessors, (107), 1 states have call successors, (107) [2025-03-03 20:06:34,836 INFO L276 IsEmpty]: Start isEmpty. Operand 2685 states and 4569 transitions. [2025-03-03 20:06:34,842 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 701 [2025-03-03 20:06:34,842 INFO L210 NwaCegarLoop]: Found error trace [2025-03-03 20:06:34,842 INFO L218 NwaCegarLoop]: trace histogram [107, 107, 107, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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 20:06:34,843 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable6 [2025-03-03 20:06:34,843 INFO L396 AbstractCegarLoop]: === Iteration 8 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-03-03 20:06:34,843 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-03 20:06:34,843 INFO L85 PathProgramCache]: Analyzing trace with hash 39069703, now seen corresponding path program 1 times [2025-03-03 20:06:34,843 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-03 20:06:34,844 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [339185308] [2025-03-03 20:06:34,844 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-03 20:06:34,844 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-03 20:06:34,873 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 700 statements into 1 equivalence classes. [2025-03-03 20:06:34,912 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 700 of 700 statements. [2025-03-03 20:06:34,913 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-03 20:06:34,913 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-03 20:06:35,246 INFO L134 CoverageAnalysis]: Checked inductivity of 22684 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 22684 trivial. 0 not checked. [2025-03-03 20:06:35,247 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-03 20:06:35,247 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [339185308] [2025-03-03 20:06:35,247 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [339185308] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-03 20:06:35,247 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-03 20:06:35,247 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2025-03-03 20:06:35,247 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1620167217] [2025-03-03 20:06:35,247 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-03 20:06:35,248 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2025-03-03 20:06:35,248 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-03 20:06:35,249 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2025-03-03 20:06:35,249 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-03-03 20:06:35,249 INFO L87 Difference]: Start difference. First operand 2685 states and 4569 transitions. Second operand has 3 states, 3 states have (on average 56.0) internal successors, (168), 3 states have internal predecessors, (168), 1 states have call successors, (107), 1 states have call predecessors, (107), 1 states have return successors, (107), 1 states have call predecessors, (107), 1 states have call successors, (107) [2025-03-03 20:06:35,408 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-03 20:06:35,408 INFO L93 Difference]: Finished difference Result 8049 states and 13701 transitions. [2025-03-03 20:06:35,409 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2025-03-03 20:06:35,409 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 56.0) internal successors, (168), 3 states have internal predecessors, (168), 1 states have call successors, (107), 1 states have call predecessors, (107), 1 states have return successors, (107), 1 states have call predecessors, (107), 1 states have call successors, (107) Word has length 700 [2025-03-03 20:06:35,410 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-03 20:06:35,433 INFO L225 Difference]: With dead ends: 8049 [2025-03-03 20:06:35,433 INFO L226 Difference]: Without dead ends: 5367 [2025-03-03 20:06:35,443 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 4 GetRequests, 3 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-03-03 20:06:35,443 INFO L435 NwaCegarLoop]: 899 mSDtfsCounter, 597 mSDsluCounter, 590 mSDsCounter, 0 mSdLazyCounter, 54 mSolverCounterSat, 1 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 597 SdHoareTripleChecker+Valid, 1489 SdHoareTripleChecker+Invalid, 55 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 1 IncrementalHoareTripleChecker+Valid, 54 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2025-03-03 20:06:35,444 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [597 Valid, 1489 Invalid, 55 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [1 Valid, 54 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2025-03-03 20:06:35,448 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 5367 states. [2025-03-03 20:06:35,643 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 5367 to 3141. [2025-03-03 20:06:35,648 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 3141 states, 2708 states have (on average 1.6754062038404727) internal successors, (4537), 2711 states have internal predecessors, (4537), 420 states have call successors, (420), 12 states have call predecessors, (420), 12 states have return successors, (420), 417 states have call predecessors, (420), 420 states have call successors, (420) [2025-03-03 20:06:35,656 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3141 states to 3141 states and 5377 transitions. [2025-03-03 20:06:35,660 INFO L78 Accepts]: Start accepts. Automaton has 3141 states and 5377 transitions. Word has length 700 [2025-03-03 20:06:35,661 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-03 20:06:35,661 INFO L471 AbstractCegarLoop]: Abstraction has 3141 states and 5377 transitions. [2025-03-03 20:06:35,662 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 56.0) internal successors, (168), 3 states have internal predecessors, (168), 1 states have call successors, (107), 1 states have call predecessors, (107), 1 states have return successors, (107), 1 states have call predecessors, (107), 1 states have call successors, (107) [2025-03-03 20:06:35,662 INFO L276 IsEmpty]: Start isEmpty. Operand 3141 states and 5377 transitions. [2025-03-03 20:06:35,668 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 701 [2025-03-03 20:06:35,669 INFO L210 NwaCegarLoop]: Found error trace [2025-03-03 20:06:35,669 INFO L218 NwaCegarLoop]: trace histogram [107, 107, 107, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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 20:06:35,669 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable7 [2025-03-03 20:06:35,669 INFO L396 AbstractCegarLoop]: === Iteration 9 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-03-03 20:06:35,670 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-03 20:06:35,670 INFO L85 PathProgramCache]: Analyzing trace with hash 1412815429, now seen corresponding path program 1 times [2025-03-03 20:06:35,670 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-03 20:06:35,670 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1581332151] [2025-03-03 20:06:35,670 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-03 20:06:35,670 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-03 20:06:35,700 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 700 statements into 1 equivalence classes. [2025-03-03 20:06:35,736 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 700 of 700 statements. [2025-03-03 20:06:35,736 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-03 20:06:35,736 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-03 20:06:36,057 INFO L134 CoverageAnalysis]: Checked inductivity of 22684 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 22684 trivial. 0 not checked. [2025-03-03 20:06:36,057 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-03 20:06:36,058 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1581332151] [2025-03-03 20:06:36,058 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1581332151] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-03 20:06:36,058 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-03 20:06:36,058 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2025-03-03 20:06:36,058 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1447620551] [2025-03-03 20:06:36,058 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-03 20:06:36,059 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2025-03-03 20:06:36,059 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-03 20:06:36,059 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2025-03-03 20:06:36,059 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-03-03 20:06:36,060 INFO L87 Difference]: Start difference. First operand 3141 states and 5377 transitions. Second operand has 3 states, 3 states have (on average 56.0) internal successors, (168), 3 states have internal predecessors, (168), 1 states have call successors, (107), 1 states have call predecessors, (107), 1 states have return successors, (107), 1 states have call predecessors, (107), 1 states have call successors, (107) [2025-03-03 20:06:36,219 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-03 20:06:36,219 INFO L93 Difference]: Finished difference Result 9417 states and 16125 transitions. [2025-03-03 20:06:36,220 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2025-03-03 20:06:36,220 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 56.0) internal successors, (168), 3 states have internal predecessors, (168), 1 states have call successors, (107), 1 states have call predecessors, (107), 1 states have return successors, (107), 1 states have call predecessors, (107), 1 states have call successors, (107) Word has length 700 [2025-03-03 20:06:36,221 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-03 20:06:36,254 INFO L225 Difference]: With dead ends: 9417 [2025-03-03 20:06:36,255 INFO L226 Difference]: Without dead ends: 6279 [2025-03-03 20:06:36,265 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 20:06:36,266 INFO L435 NwaCegarLoop]: 596 mSDtfsCounter, 362 mSDsluCounter, 591 mSDsCounter, 0 mSdLazyCounter, 48 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 362 SdHoareTripleChecker+Valid, 1187 SdHoareTripleChecker+Invalid, 48 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 48 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2025-03-03 20:06:36,267 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [362 Valid, 1187 Invalid, 48 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 48 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2025-03-03 20:06:36,272 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 6279 states. [2025-03-03 20:06:36,636 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 6279 to 6277. [2025-03-03 20:06:36,644 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 6277 states, 5412 states have (on average 1.6747967479674797) internal successors, (9064), 5418 states have internal predecessors, (9064), 840 states have call successors, (840), 24 states have call predecessors, (840), 24 states have return successors, (840), 834 states have call predecessors, (840), 840 states have call successors, (840) [2025-03-03 20:06:36,667 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 6277 states to 6277 states and 10744 transitions. [2025-03-03 20:06:36,671 INFO L78 Accepts]: Start accepts. Automaton has 6277 states and 10744 transitions. Word has length 700 [2025-03-03 20:06:36,672 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-03 20:06:36,672 INFO L471 AbstractCegarLoop]: Abstraction has 6277 states and 10744 transitions. [2025-03-03 20:06:36,673 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 56.0) internal successors, (168), 3 states have internal predecessors, (168), 1 states have call successors, (107), 1 states have call predecessors, (107), 1 states have return successors, (107), 1 states have call predecessors, (107), 1 states have call successors, (107) [2025-03-03 20:06:36,673 INFO L276 IsEmpty]: Start isEmpty. Operand 6277 states and 10744 transitions. [2025-03-03 20:06:36,682 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 701 [2025-03-03 20:06:36,683 INFO L210 NwaCegarLoop]: Found error trace [2025-03-03 20:06:36,683 INFO L218 NwaCegarLoop]: trace histogram [107, 107, 107, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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 20:06:36,683 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable8 [2025-03-03 20:06:36,683 INFO L396 AbstractCegarLoop]: === Iteration 10 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-03-03 20:06:36,684 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-03 20:06:36,684 INFO L85 PathProgramCache]: Analyzing trace with hash -1528842170, now seen corresponding path program 1 times [2025-03-03 20:06:36,684 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-03 20:06:36,684 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [376831114] [2025-03-03 20:06:36,684 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-03 20:06:36,684 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-03 20:06:36,716 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 700 statements into 1 equivalence classes. [2025-03-03 20:06:36,927 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 700 of 700 statements. [2025-03-03 20:06:36,927 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-03 20:06:36,928 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-03 20:06:37,277 INFO L134 CoverageAnalysis]: Checked inductivity of 22684 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 22684 trivial. 0 not checked. [2025-03-03 20:06:37,277 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-03 20:06:37,277 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [376831114] [2025-03-03 20:06:37,278 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [376831114] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-03 20:06:37,278 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-03 20:06:37,278 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2025-03-03 20:06:37,278 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1199039710] [2025-03-03 20:06:37,278 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-03 20:06:37,278 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2025-03-03 20:06:37,279 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-03 20:06:37,279 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2025-03-03 20:06:37,279 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-03-03 20:06:37,279 INFO L87 Difference]: Start difference. First operand 6277 states and 10744 transitions. Second operand has 3 states, 3 states have (on average 56.0) internal successors, (168), 3 states have internal predecessors, (168), 1 states have call successors, (107), 1 states have call predecessors, (107), 1 states have return successors, (107), 1 states have call predecessors, (107), 1 states have call successors, (107) [2025-03-03 20:06:37,647 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-03 20:06:37,648 INFO L93 Difference]: Finished difference Result 9061 states and 15352 transitions. [2025-03-03 20:06:37,648 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2025-03-03 20:06:37,648 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 56.0) internal successors, (168), 3 states have internal predecessors, (168), 1 states have call successors, (107), 1 states have call predecessors, (107), 1 states have return successors, (107), 1 states have call predecessors, (107), 1 states have call successors, (107) Word has length 700 [2025-03-03 20:06:37,649 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-03 20:06:37,677 INFO L225 Difference]: With dead ends: 9061 [2025-03-03 20:06:37,677 INFO L226 Difference]: Without dead ends: 6963 [2025-03-03 20:06:37,686 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 5 GetRequests, 3 SyntacticMatches, 1 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 20:06:37,686 INFO L435 NwaCegarLoop]: 821 mSDtfsCounter, 364 mSDsluCounter, 528 mSDsCounter, 0 mSdLazyCounter, 176 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 364 SdHoareTripleChecker+Valid, 1349 SdHoareTripleChecker+Invalid, 176 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 176 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.2s IncrementalHoareTripleChecker+Time [2025-03-03 20:06:37,687 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [364 Valid, 1349 Invalid, 176 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 176 Invalid, 0 Unknown, 0 Unchecked, 0.2s Time] [2025-03-03 20:06:37,692 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 6963 states. [2025-03-03 20:06:37,994 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 6963 to 6949. [2025-03-03 20:06:38,003 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 6949 states, 5892 states have (on average 1.6490156143923964) internal successors, (9716), 5910 states have internal predecessors, (9716), 1008 states have call successors, (1008), 48 states have call predecessors, (1008), 48 states have return successors, (1008), 990 states have call predecessors, (1008), 1008 states have call successors, (1008) [2025-03-03 20:06:38,022 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 6949 states to 6949 states and 11732 transitions. [2025-03-03 20:06:38,028 INFO L78 Accepts]: Start accepts. Automaton has 6949 states and 11732 transitions. Word has length 700 [2025-03-03 20:06:38,030 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-03 20:06:38,031 INFO L471 AbstractCegarLoop]: Abstraction has 6949 states and 11732 transitions. [2025-03-03 20:06:38,031 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 56.0) internal successors, (168), 3 states have internal predecessors, (168), 1 states have call successors, (107), 1 states have call predecessors, (107), 1 states have return successors, (107), 1 states have call predecessors, (107), 1 states have call successors, (107) [2025-03-03 20:06:38,031 INFO L276 IsEmpty]: Start isEmpty. Operand 6949 states and 11732 transitions. [2025-03-03 20:06:38,061 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 701 [2025-03-03 20:06:38,061 INFO L210 NwaCegarLoop]: Found error trace [2025-03-03 20:06:38,062 INFO L218 NwaCegarLoop]: trace histogram [107, 107, 107, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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 20:06:38,062 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable9 [2025-03-03 20:06:38,062 INFO L396 AbstractCegarLoop]: === Iteration 11 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-03-03 20:06:38,063 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-03 20:06:38,063 INFO L85 PathProgramCache]: Analyzing trace with hash 1498715218, now seen corresponding path program 1 times [2025-03-03 20:06:38,063 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-03 20:06:38,063 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1675945005] [2025-03-03 20:06:38,063 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-03 20:06:38,063 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-03 20:06:38,095 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 700 statements into 1 equivalence classes. [2025-03-03 20:06:38,153 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 700 of 700 statements. [2025-03-03 20:06:38,153 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-03 20:06:38,154 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-03 20:06:38,783 INFO L134 CoverageAnalysis]: Checked inductivity of 22684 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 22684 trivial. 0 not checked. [2025-03-03 20:06:38,783 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-03 20:06:38,783 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1675945005] [2025-03-03 20:06:38,783 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1675945005] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-03 20:06:38,783 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-03 20:06:38,783 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2025-03-03 20:06:38,784 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1433618606] [2025-03-03 20:06:38,784 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-03 20:06:38,784 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2025-03-03 20:06:38,784 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-03 20:06:38,785 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2025-03-03 20:06:38,785 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2025-03-03 20:06:38,785 INFO L87 Difference]: Start difference. First operand 6949 states and 11732 transitions. Second operand has 5 states, 5 states have (on average 33.6) internal successors, (168), 5 states have internal predecessors, (168), 1 states have call successors, (107), 1 states have call predecessors, (107), 1 states have return successors, (107), 1 states have call predecessors, (107), 1 states have call successors, (107) [2025-03-03 20:06:40,029 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-03 20:06:40,029 INFO L93 Difference]: Finished difference Result 14691 states and 24710 transitions. [2025-03-03 20:06:40,029 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2025-03-03 20:06:40,030 INFO L78 Accepts]: Start accepts. Automaton has has 5 states, 5 states have (on average 33.6) internal successors, (168), 5 states have internal predecessors, (168), 1 states have call successors, (107), 1 states have call predecessors, (107), 1 states have return successors, (107), 1 states have call predecessors, (107), 1 states have call successors, (107) Word has length 700 [2025-03-03 20:06:40,031 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-03 20:06:40,060 INFO L225 Difference]: With dead ends: 14691 [2025-03-03 20:06:40,061 INFO L226 Difference]: Without dead ends: 10057 [2025-03-03 20:06:40,076 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 11 GetRequests, 5 SyntacticMatches, 1 SemanticMatches, 5 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=17, Invalid=25, Unknown=0, NotChecked=0, Total=42 [2025-03-03 20:06:40,076 INFO L435 NwaCegarLoop]: 839 mSDtfsCounter, 1238 mSDsluCounter, 2316 mSDsCounter, 0 mSdLazyCounter, 547 mSolverCounterSat, 325 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.7s Time, 0 mProtectedPredicate, 0 mProtectedAction, 1238 SdHoareTripleChecker+Valid, 3155 SdHoareTripleChecker+Invalid, 872 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 325 IncrementalHoareTripleChecker+Valid, 547 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.9s IncrementalHoareTripleChecker+Time [2025-03-03 20:06:40,076 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [1238 Valid, 3155 Invalid, 872 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [325 Valid, 547 Invalid, 0 Unknown, 0 Unchecked, 0.9s Time] [2025-03-03 20:06:40,085 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 10057 states. [2025-03-03 20:06:40,595 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 10057 to 9090. [2025-03-03 20:06:40,610 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 9090 states, 7755 states have (on average 1.6483558994197292) internal successors, (12783), 7782 states have internal predecessors, (12783), 1268 states have call successors, (1268), 66 states have call predecessors, (1268), 66 states have return successors, (1268), 1241 states have call predecessors, (1268), 1268 states have call successors, (1268) [2025-03-03 20:06:40,640 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 9090 states to 9090 states and 15319 transitions. [2025-03-03 20:06:40,646 INFO L78 Accepts]: Start accepts. Automaton has 9090 states and 15319 transitions. Word has length 700 [2025-03-03 20:06:40,647 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-03 20:06:40,647 INFO L471 AbstractCegarLoop]: Abstraction has 9090 states and 15319 transitions. [2025-03-03 20:06:40,647 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 33.6) internal successors, (168), 5 states have internal predecessors, (168), 1 states have call successors, (107), 1 states have call predecessors, (107), 1 states have return successors, (107), 1 states have call predecessors, (107), 1 states have call successors, (107) [2025-03-03 20:06:40,647 INFO L276 IsEmpty]: Start isEmpty. Operand 9090 states and 15319 transitions. [2025-03-03 20:06:40,659 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 701 [2025-03-03 20:06:40,659 INFO L210 NwaCegarLoop]: Found error trace [2025-03-03 20:06:40,659 INFO L218 NwaCegarLoop]: trace histogram [107, 107, 107, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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 20:06:40,660 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable10 [2025-03-03 20:06:40,661 INFO L396 AbstractCegarLoop]: === Iteration 12 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-03-03 20:06:40,661 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-03 20:06:40,662 INFO L85 PathProgramCache]: Analyzing trace with hash -1866364310, now seen corresponding path program 1 times [2025-03-03 20:06:40,662 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-03 20:06:40,662 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [362210248] [2025-03-03 20:06:40,662 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-03 20:06:40,662 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-03 20:06:40,699 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 700 statements into 1 equivalence classes. [2025-03-03 20:06:40,874 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 700 of 700 statements. [2025-03-03 20:06:40,874 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-03 20:06:40,875 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-03 20:06:41,472 INFO L134 CoverageAnalysis]: Checked inductivity of 22684 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 22684 trivial. 0 not checked. [2025-03-03 20:06:41,472 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-03 20:06:41,472 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [362210248] [2025-03-03 20:06:41,472 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [362210248] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-03 20:06:41,472 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-03 20:06:41,473 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2025-03-03 20:06:41,473 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1362977346] [2025-03-03 20:06:41,473 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-03 20:06:41,473 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 7 states [2025-03-03 20:06:41,473 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-03 20:06:41,474 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2025-03-03 20:06:41,474 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=14, Invalid=28, Unknown=0, NotChecked=0, Total=42 [2025-03-03 20:06:41,474 INFO L87 Difference]: Start difference. First operand 9090 states and 15319 transitions. Second operand has 7 states, 7 states have (on average 24.0) internal successors, (168), 7 states have internal predecessors, (168), 2 states have call successors, (107), 1 states have call predecessors, (107), 1 states have return successors, (107), 2 states have call predecessors, (107), 2 states have call successors, (107) [2025-03-03 20:06:43,139 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-03 20:06:43,140 INFO L93 Difference]: Finished difference Result 29528 states and 49289 transitions. [2025-03-03 20:06:43,141 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2025-03-03 20:06:43,141 INFO L78 Accepts]: Start accepts. Automaton has has 7 states, 7 states have (on average 24.0) internal successors, (168), 7 states have internal predecessors, (168), 2 states have call successors, (107), 1 states have call predecessors, (107), 1 states have return successors, (107), 2 states have call predecessors, (107), 2 states have call successors, (107) Word has length 700 [2025-03-03 20:06:43,142 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-03 20:06:43,203 INFO L225 Difference]: With dead ends: 29528 [2025-03-03 20:06:43,204 INFO L226 Difference]: Without dead ends: 20522 [2025-03-03 20:06:43,236 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 11 GetRequests, 4 SyntacticMatches, 0 SemanticMatches, 7 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 5 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=28, Invalid=44, Unknown=0, NotChecked=0, Total=72 [2025-03-03 20:06:43,237 INFO L435 NwaCegarLoop]: 573 mSDtfsCounter, 2127 mSDsluCounter, 2102 mSDsCounter, 0 mSdLazyCounter, 502 mSolverCounterSat, 650 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.8s Time, 0 mProtectedPredicate, 0 mProtectedAction, 2127 SdHoareTripleChecker+Valid, 2675 SdHoareTripleChecker+Invalid, 1152 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 650 IncrementalHoareTripleChecker+Valid, 502 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 1.0s IncrementalHoareTripleChecker+Time [2025-03-03 20:06:43,237 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [2127 Valid, 2675 Invalid, 1152 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [650 Valid, 502 Invalid, 0 Unknown, 0 Unchecked, 1.0s Time] [2025-03-03 20:06:43,260 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 20522 states. [2025-03-03 20:06:44,121 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 20522 to 20504. [2025-03-03 20:06:44,152 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 20504 states, 16531 states have (on average 1.6033512794144336) internal successors, (26505), 16616 states have internal predecessors, (26505), 3778 states have call successors, (3778), 194 states have call predecessors, (3778), 194 states have return successors, (3778), 3693 states have call predecessors, (3778), 3778 states have call successors, (3778) [2025-03-03 20:06:44,199 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 20504 states to 20504 states and 34061 transitions. [2025-03-03 20:06:44,215 INFO L78 Accepts]: Start accepts. Automaton has 20504 states and 34061 transitions. Word has length 700 [2025-03-03 20:06:44,216 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-03 20:06:44,216 INFO L471 AbstractCegarLoop]: Abstraction has 20504 states and 34061 transitions. [2025-03-03 20:06:44,216 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 7 states, 7 states have (on average 24.0) internal successors, (168), 7 states have internal predecessors, (168), 2 states have call successors, (107), 1 states have call predecessors, (107), 1 states have return successors, (107), 2 states have call predecessors, (107), 2 states have call successors, (107) [2025-03-03 20:06:44,216 INFO L276 IsEmpty]: Start isEmpty. Operand 20504 states and 34061 transitions. [2025-03-03 20:06:44,291 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 701 [2025-03-03 20:06:44,291 INFO L210 NwaCegarLoop]: Found error trace [2025-03-03 20:06:44,292 INFO L218 NwaCegarLoop]: trace histogram [107, 107, 107, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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 20:06:44,292 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable11 [2025-03-03 20:06:44,292 INFO L396 AbstractCegarLoop]: === Iteration 13 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-03-03 20:06:44,292 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-03 20:06:44,292 INFO L85 PathProgramCache]: Analyzing trace with hash -840872311, now seen corresponding path program 1 times [2025-03-03 20:06:44,292 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-03 20:06:44,293 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [832430199] [2025-03-03 20:06:44,293 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-03 20:06:44,293 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-03 20:06:44,327 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 700 statements into 1 equivalence classes. [2025-03-03 20:06:44,499 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 700 of 700 statements. [2025-03-03 20:06:44,499 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-03 20:06:44,499 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-03 20:06:45,532 INFO L134 CoverageAnalysis]: Checked inductivity of 22684 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 22684 trivial. 0 not checked. [2025-03-03 20:06:45,533 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-03 20:06:45,533 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [832430199] [2025-03-03 20:06:45,533 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [832430199] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-03 20:06:45,533 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-03 20:06:45,533 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2025-03-03 20:06:45,533 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2004416438] [2025-03-03 20:06:45,533 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-03 20:06:45,534 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 7 states [2025-03-03 20:06:45,534 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-03 20:06:45,534 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2025-03-03 20:06:45,534 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=13, Invalid=29, Unknown=0, NotChecked=0, Total=42 [2025-03-03 20:06:45,535 INFO L87 Difference]: Start difference. First operand 20504 states and 34061 transitions. Second operand has 7 states, 7 states have (on average 24.0) internal successors, (168), 7 states have internal predecessors, (168), 2 states have call successors, (107), 1 states have call predecessors, (107), 1 states have return successors, (107), 2 states have call predecessors, (107), 2 states have call successors, (107) [2025-03-03 20:06:47,394 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-03 20:06:47,394 INFO L93 Difference]: Finished difference Result 29251 states and 48602 transitions. [2025-03-03 20:06:47,395 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2025-03-03 20:06:47,395 INFO L78 Accepts]: Start accepts. Automaton has has 7 states, 7 states have (on average 24.0) internal successors, (168), 7 states have internal predecessors, (168), 2 states have call successors, (107), 1 states have call predecessors, (107), 1 states have return successors, (107), 2 states have call predecessors, (107), 2 states have call successors, (107) Word has length 700 [2025-03-03 20:06:47,397 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-03 20:06:47,487 INFO L225 Difference]: With dead ends: 29251 [2025-03-03 20:06:47,488 INFO L226 Difference]: Without dead ends: 24039 [2025-03-03 20:06:47,624 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 14 GetRequests, 7 SyntacticMatches, 0 SemanticMatches, 7 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 4 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=26, Invalid=46, Unknown=0, NotChecked=0, Total=72 [2025-03-03 20:06:47,625 INFO L435 NwaCegarLoop]: 883 mSDtfsCounter, 1361 mSDsluCounter, 3151 mSDsCounter, 0 mSdLazyCounter, 1055 mSolverCounterSat, 354 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 1.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 1361 SdHoareTripleChecker+Valid, 4034 SdHoareTripleChecker+Invalid, 1409 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 354 IncrementalHoareTripleChecker+Valid, 1055 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 1.2s IncrementalHoareTripleChecker+Time [2025-03-03 20:06:47,625 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [1361 Valid, 4034 Invalid, 1409 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [354 Valid, 1055 Invalid, 0 Unknown, 0 Unchecked, 1.2s Time] [2025-03-03 20:06:47,634 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 24039 states. [2025-03-03 20:06:48,555 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 24039 to 22920. [2025-03-03 20:06:48,581 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 22920 states, 18615 states have (on average 1.6077894171367177) internal successors, (29929), 18708 states have internal predecessors, (29929), 4094 states have call successors, (4094), 210 states have call predecessors, (4094), 210 states have return successors, (4094), 4001 states have call predecessors, (4094), 4094 states have call successors, (4094) [2025-03-03 20:06:48,623 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 22920 states to 22920 states and 38117 transitions. [2025-03-03 20:06:48,634 INFO L78 Accepts]: Start accepts. Automaton has 22920 states and 38117 transitions. Word has length 700 [2025-03-03 20:06:48,635 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-03 20:06:48,635 INFO L471 AbstractCegarLoop]: Abstraction has 22920 states and 38117 transitions. [2025-03-03 20:06:48,635 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 7 states, 7 states have (on average 24.0) internal successors, (168), 7 states have internal predecessors, (168), 2 states have call successors, (107), 1 states have call predecessors, (107), 1 states have return successors, (107), 2 states have call predecessors, (107), 2 states have call successors, (107) [2025-03-03 20:06:48,635 INFO L276 IsEmpty]: Start isEmpty. Operand 22920 states and 38117 transitions. [2025-03-03 20:06:48,647 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 701 [2025-03-03 20:06:48,647 INFO L210 NwaCegarLoop]: Found error trace [2025-03-03 20:06:48,648 INFO L218 NwaCegarLoop]: trace histogram [107, 107, 107, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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 20:06:48,648 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable12 [2025-03-03 20:06:48,648 INFO L396 AbstractCegarLoop]: === Iteration 14 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-03-03 20:06:48,649 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-03 20:06:48,649 INFO L85 PathProgramCache]: Analyzing trace with hash 327323944, now seen corresponding path program 1 times [2025-03-03 20:06:48,649 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-03 20:06:48,649 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1046676533] [2025-03-03 20:06:48,649 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-03 20:06:48,649 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-03 20:06:48,673 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 700 statements into 1 equivalence classes. [2025-03-03 20:06:48,692 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 700 of 700 statements. [2025-03-03 20:06:48,692 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-03 20:06:48,692 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-03 20:06:48,854 INFO L134 CoverageAnalysis]: Checked inductivity of 22684 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 22684 trivial. 0 not checked. [2025-03-03 20:06:48,854 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-03 20:06:48,855 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1046676533] [2025-03-03 20:06:48,855 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1046676533] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-03 20:06:48,855 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-03 20:06:48,855 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2025-03-03 20:06:48,856 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1206988805] [2025-03-03 20:06:48,856 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-03 20:06:48,857 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2025-03-03 20:06:48,857 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-03 20:06:48,857 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2025-03-03 20:06:48,858 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2025-03-03 20:06:48,858 INFO L87 Difference]: Start difference. First operand 22920 states and 38117 transitions. Second operand has 4 states, 4 states have (on average 42.0) internal successors, (168), 4 states have internal predecessors, (168), 1 states have call successors, (107), 1 states have call predecessors, (107), 1 states have return successors, (107), 1 states have call predecessors, (107), 1 states have call successors, (107) [2025-03-03 20:06:50,851 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-03 20:06:50,852 INFO L93 Difference]: Finished difference Result 44040 states and 73404 transitions. [2025-03-03 20:06:50,852 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2025-03-03 20:06:50,852 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 4 states have (on average 42.0) internal successors, (168), 4 states have internal predecessors, (168), 1 states have call successors, (107), 1 states have call predecessors, (107), 1 states have return successors, (107), 1 states have call predecessors, (107), 1 states have call successors, (107) Word has length 700 [2025-03-03 20:06:50,853 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-03 20:06:50,996 INFO L225 Difference]: With dead ends: 44040 [2025-03-03 20:06:50,996 INFO L226 Difference]: Without dead ends: 36412 [2025-03-03 20:06:51,033 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 6 GetRequests, 3 SyntacticMatches, 0 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=9, Invalid=11, Unknown=0, NotChecked=0, Total=20 [2025-03-03 20:06:51,035 INFO L435 NwaCegarLoop]: 797 mSDtfsCounter, 965 mSDsluCounter, 1193 mSDsCounter, 0 mSdLazyCounter, 321 mSolverCounterSat, 322 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.5s Time, 0 mProtectedPredicate, 0 mProtectedAction, 965 SdHoareTripleChecker+Valid, 1990 SdHoareTripleChecker+Invalid, 643 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 322 IncrementalHoareTripleChecker+Valid, 321 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.6s IncrementalHoareTripleChecker+Time [2025-03-03 20:06:51,035 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [965 Valid, 1990 Invalid, 643 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [322 Valid, 321 Invalid, 0 Unknown, 0 Unchecked, 0.6s Time] [2025-03-03 20:06:51,062 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 36412 states. [2025-03-03 20:06:52,661 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 36412 to 36396. [2025-03-03 20:06:52,703 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 36396 states, 29667 states have (on average 1.611184143998382) internal successors, (47799), 29808 states have internal predecessors, (47799), 6402 states have call successors, (6402), 326 states have call predecessors, (6402), 326 states have return successors, (6402), 6261 states have call predecessors, (6402), 6402 states have call successors, (6402) [2025-03-03 20:06:52,827 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 36396 states to 36396 states and 60603 transitions. [2025-03-03 20:06:52,849 INFO L78 Accepts]: Start accepts. Automaton has 36396 states and 60603 transitions. Word has length 700 [2025-03-03 20:06:52,850 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-03 20:06:52,850 INFO L471 AbstractCegarLoop]: Abstraction has 36396 states and 60603 transitions. [2025-03-03 20:06:52,850 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 42.0) internal successors, (168), 4 states have internal predecessors, (168), 1 states have call successors, (107), 1 states have call predecessors, (107), 1 states have return successors, (107), 1 states have call predecessors, (107), 1 states have call successors, (107) [2025-03-03 20:06:52,850 INFO L276 IsEmpty]: Start isEmpty. Operand 36396 states and 60603 transitions. [2025-03-03 20:06:52,864 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 702 [2025-03-03 20:06:52,864 INFO L210 NwaCegarLoop]: Found error trace [2025-03-03 20:06:52,865 INFO L218 NwaCegarLoop]: trace histogram [107, 107, 107, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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 20:06:52,865 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable13 [2025-03-03 20:06:52,865 INFO L396 AbstractCegarLoop]: === Iteration 15 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-03-03 20:06:52,865 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-03 20:06:52,866 INFO L85 PathProgramCache]: Analyzing trace with hash -1993139844, now seen corresponding path program 1 times [2025-03-03 20:06:52,866 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-03 20:06:52,866 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2050120800] [2025-03-03 20:06:52,866 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-03 20:06:52,866 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-03 20:06:52,894 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 701 statements into 1 equivalence classes. [2025-03-03 20:06:53,019 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 701 of 701 statements. [2025-03-03 20:06:53,019 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-03 20:06:53,019 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-03 20:06:54,250 INFO L134 CoverageAnalysis]: Checked inductivity of 22684 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 22684 trivial. 0 not checked. [2025-03-03 20:06:54,251 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-03 20:06:54,251 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2050120800] [2025-03-03 20:06:54,251 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [2050120800] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-03 20:06:54,251 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-03 20:06:54,251 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [9] imperfect sequences [] total 9 [2025-03-03 20:06:54,253 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [257512432] [2025-03-03 20:06:54,253 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-03 20:06:54,253 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 9 states [2025-03-03 20:06:54,253 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-03 20:06:54,254 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2025-03-03 20:06:54,254 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=18, Invalid=54, Unknown=0, NotChecked=0, Total=72 [2025-03-03 20:06:54,255 INFO L87 Difference]: Start difference. First operand 36396 states and 60603 transitions. Second operand has 9 states, 9 states have (on average 18.77777777777778) internal successors, (169), 9 states have internal predecessors, (169), 1 states have call successors, (107), 1 states have call predecessors, (107), 1 states have return successors, (107), 1 states have call predecessors, (107), 1 states have call successors, (107) [2025-03-03 20:06:57,531 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-03 20:06:57,531 INFO L93 Difference]: Finished difference Result 75946 states and 126050 transitions. [2025-03-03 20:06:57,532 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2025-03-03 20:06:57,532 INFO L78 Accepts]: Start accepts. Automaton has has 9 states, 9 states have (on average 18.77777777777778) internal successors, (169), 9 states have internal predecessors, (169), 1 states have call successors, (107), 1 states have call predecessors, (107), 1 states have return successors, (107), 1 states have call predecessors, (107), 1 states have call successors, (107) Word has length 701 [2025-03-03 20:06:57,532 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-03 20:06:57,691 INFO L225 Difference]: With dead ends: 75946 [2025-03-03 20:06:57,691 INFO L226 Difference]: Without dead ends: 57694 [2025-03-03 20:06:57,737 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 22 GetRequests, 9 SyntacticMatches, 0 SemanticMatches, 13 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 8 ImplicationChecksByTransitivity, 0.4s TimeCoverageRelationStatistics Valid=72, Invalid=138, Unknown=0, NotChecked=0, Total=210 [2025-03-03 20:06:57,737 INFO L435 NwaCegarLoop]: 814 mSDtfsCounter, 4549 mSDsluCounter, 3729 mSDsCounter, 0 mSdLazyCounter, 988 mSolverCounterSat, 369 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 1.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 4549 SdHoareTripleChecker+Valid, 4543 SdHoareTripleChecker+Invalid, 1357 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 369 IncrementalHoareTripleChecker+Valid, 988 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 1.2s IncrementalHoareTripleChecker+Time [2025-03-03 20:06:57,738 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [4549 Valid, 4543 Invalid, 1357 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [369 Valid, 988 Invalid, 0 Unknown, 0 Unchecked, 1.2s Time] [2025-03-03 20:06:57,775 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 57694 states. [2025-03-03 20:07:00,066 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 57694 to 36832. [2025-03-03 20:07:00,104 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 36832 states, 30103 states have (on average 1.6118991462644918) internal successors, (48523), 30244 states have internal predecessors, (48523), 6402 states have call successors, (6402), 326 states have call predecessors, (6402), 326 states have return successors, (6402), 6261 states have call predecessors, (6402), 6402 states have call successors, (6402) [2025-03-03 20:07:00,201 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 36832 states to 36832 states and 61327 transitions. [2025-03-03 20:07:00,229 INFO L78 Accepts]: Start accepts. Automaton has 36832 states and 61327 transitions. Word has length 701 [2025-03-03 20:07:00,230 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-03 20:07:00,230 INFO L471 AbstractCegarLoop]: Abstraction has 36832 states and 61327 transitions. [2025-03-03 20:07:00,230 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 9 states, 9 states have (on average 18.77777777777778) internal successors, (169), 9 states have internal predecessors, (169), 1 states have call successors, (107), 1 states have call predecessors, (107), 1 states have return successors, (107), 1 states have call predecessors, (107), 1 states have call successors, (107) [2025-03-03 20:07:00,230 INFO L276 IsEmpty]: Start isEmpty. Operand 36832 states and 61327 transitions. [2025-03-03 20:07:00,249 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 702 [2025-03-03 20:07:00,249 INFO L210 NwaCegarLoop]: Found error trace [2025-03-03 20:07:00,249 INFO L218 NwaCegarLoop]: trace histogram [107, 107, 107, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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 20:07:00,250 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable14 [2025-03-03 20:07:00,250 INFO L396 AbstractCegarLoop]: === Iteration 16 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-03-03 20:07:00,250 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-03 20:07:00,251 INFO L85 PathProgramCache]: Analyzing trace with hash -138794307, now seen corresponding path program 1 times [2025-03-03 20:07:00,251 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-03 20:07:00,251 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [900369600] [2025-03-03 20:07:00,251 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-03 20:07:00,251 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-03 20:07:00,397 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 701 statements into 1 equivalence classes. [2025-03-03 20:07:00,537 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 701 of 701 statements. [2025-03-03 20:07:00,538 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-03 20:07:00,538 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-03 20:07:01,680 INFO L134 CoverageAnalysis]: Checked inductivity of 22684 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 22684 trivial. 0 not checked. [2025-03-03 20:07:01,681 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-03 20:07:01,681 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [900369600] [2025-03-03 20:07:01,681 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [900369600] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-03 20:07:01,681 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-03 20:07:01,681 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2025-03-03 20:07:01,681 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1209045861] [2025-03-03 20:07:01,681 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-03 20:07:01,682 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 7 states [2025-03-03 20:07:01,682 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-03 20:07:01,682 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2025-03-03 20:07:01,682 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=13, Invalid=29, Unknown=0, NotChecked=0, Total=42 [2025-03-03 20:07:01,683 INFO L87 Difference]: Start difference. First operand 36832 states and 61327 transitions. Second operand has 7 states, 7 states have (on average 24.142857142857142) internal successors, (169), 7 states have internal predecessors, (169), 2 states have call successors, (107), 1 states have call predecessors, (107), 1 states have return successors, (107), 2 states have call predecessors, (107), 2 states have call successors, (107) [2025-03-03 20:07:06,041 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-03 20:07:06,041 INFO L93 Difference]: Finished difference Result 105629 states and 175596 transitions. [2025-03-03 20:07:06,041 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2025-03-03 20:07:06,042 INFO L78 Accepts]: Start accepts. Automaton has has 7 states, 7 states have (on average 24.142857142857142) internal successors, (169), 7 states have internal predecessors, (169), 2 states have call successors, (107), 1 states have call predecessors, (107), 1 states have return successors, (107), 2 states have call predecessors, (107), 2 states have call successors, (107) Word has length 701 [2025-03-03 20:07:06,042 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-03 20:07:06,266 INFO L225 Difference]: With dead ends: 105629 [2025-03-03 20:07:06,266 INFO L226 Difference]: Without dead ends: 68881 [2025-03-03 20:07:06,359 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 12 GetRequests, 5 SyntacticMatches, 0 SemanticMatches, 7 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 3 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=26, Invalid=46, Unknown=0, NotChecked=0, Total=72 [2025-03-03 20:07:06,360 INFO L435 NwaCegarLoop]: 1001 mSDtfsCounter, 1739 mSDsluCounter, 2205 mSDsCounter, 0 mSdLazyCounter, 867 mSolverCounterSat, 469 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 1.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 1739 SdHoareTripleChecker+Valid, 3206 SdHoareTripleChecker+Invalid, 1336 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 469 IncrementalHoareTripleChecker+Valid, 867 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 1.2s IncrementalHoareTripleChecker+Time [2025-03-03 20:07:06,360 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [1739 Valid, 3206 Invalid, 1336 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [469 Valid, 867 Invalid, 0 Unknown, 0 Unchecked, 1.2s Time] [2025-03-03 20:07:06,409 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 68881 states. [2025-03-03 20:07:10,649 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 68881 to 67484. [2025-03-03 20:07:10,711 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 67484 states, 54628 states have (on average 1.6022918649776672) internal successors, (87530), 54917 states have internal predecessors, (87530), 12203 states have call successors, (12203), 652 states have call predecessors, (12203), 652 states have return successors, (12203), 11914 states have call predecessors, (12203), 12203 states have call successors, (12203) [2025-03-03 20:07:10,854 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 67484 states to 67484 states and 111936 transitions. [2025-03-03 20:07:10,895 INFO L78 Accepts]: Start accepts. Automaton has 67484 states and 111936 transitions. Word has length 701 [2025-03-03 20:07:10,895 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-03 20:07:10,896 INFO L471 AbstractCegarLoop]: Abstraction has 67484 states and 111936 transitions. [2025-03-03 20:07:10,896 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 7 states, 7 states have (on average 24.142857142857142) internal successors, (169), 7 states have internal predecessors, (169), 2 states have call successors, (107), 1 states have call predecessors, (107), 1 states have return successors, (107), 2 states have call predecessors, (107), 2 states have call successors, (107) [2025-03-03 20:07:10,896 INFO L276 IsEmpty]: Start isEmpty. Operand 67484 states and 111936 transitions. [2025-03-03 20:07:10,918 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 702 [2025-03-03 20:07:10,918 INFO L210 NwaCegarLoop]: Found error trace [2025-03-03 20:07:10,918 INFO L218 NwaCegarLoop]: trace histogram [107, 107, 107, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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 20:07:10,919 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable15 [2025-03-03 20:07:10,919 INFO L396 AbstractCegarLoop]: === Iteration 17 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-03-03 20:07:10,919 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-03 20:07:10,919 INFO L85 PathProgramCache]: Analyzing trace with hash -1322141604, now seen corresponding path program 1 times [2025-03-03 20:07:10,919 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-03 20:07:10,919 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2061498447] [2025-03-03 20:07:10,919 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-03 20:07:10,919 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-03 20:07:10,944 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 701 statements into 1 equivalence classes. [2025-03-03 20:07:11,069 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 701 of 701 statements. [2025-03-03 20:07:11,069 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-03 20:07:11,069 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-03 20:07:11,602 INFO L134 CoverageAnalysis]: Checked inductivity of 22684 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 22684 trivial. 0 not checked. [2025-03-03 20:07:11,602 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-03 20:07:11,602 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2061498447] [2025-03-03 20:07:11,602 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [2061498447] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-03 20:07:11,603 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-03 20:07:11,603 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2025-03-03 20:07:11,603 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [906663895] [2025-03-03 20:07:11,603 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-03 20:07:11,604 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2025-03-03 20:07:11,604 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-03 20:07:11,605 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2025-03-03 20:07:11,605 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2025-03-03 20:07:11,605 INFO L87 Difference]: Start difference. First operand 67484 states and 111936 transitions. Second operand has 5 states, 5 states have (on average 33.8) internal successors, (169), 5 states have internal predecessors, (169), 1 states have call successors, (107), 1 states have call predecessors, (107), 1 states have return successors, (107), 1 states have call predecessors, (107), 1 states have call successors, (107) [2025-03-03 20:07:16,057 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-03 20:07:16,058 INFO L93 Difference]: Finished difference Result 134462 states and 222943 transitions. [2025-03-03 20:07:16,058 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2025-03-03 20:07:16,059 INFO L78 Accepts]: Start accepts. Automaton has has 5 states, 5 states have (on average 33.8) internal successors, (169), 5 states have internal predecessors, (169), 1 states have call successors, (107), 1 states have call predecessors, (107), 1 states have return successors, (107), 1 states have call predecessors, (107), 1 states have call successors, (107) Word has length 701 [2025-03-03 20:07:16,059 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-03 20:07:16,272 INFO L225 Difference]: With dead ends: 134462 [2025-03-03 20:07:16,272 INFO L226 Difference]: Without dead ends: 67164 [2025-03-03 20:07:16,392 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 20:07:16,392 INFO L435 NwaCegarLoop]: 581 mSDtfsCounter, 647 mSDsluCounter, 580 mSDsCounter, 0 mSdLazyCounter, 66 mSolverCounterSat, 325 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 647 SdHoareTripleChecker+Valid, 1161 SdHoareTripleChecker+Invalid, 391 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 325 IncrementalHoareTripleChecker+Valid, 66 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.3s IncrementalHoareTripleChecker+Time [2025-03-03 20:07:16,392 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [647 Valid, 1161 Invalid, 391 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [325 Valid, 66 Invalid, 0 Unknown, 0 Unchecked, 0.3s Time] [2025-03-03 20:07:16,436 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 67164 states. [2025-03-03 20:07:20,668 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 67164 to 67164. [2025-03-03 20:07:20,729 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 67164 states, 54308 states have (on average 1.582271488546807) internal successors, (85930), 54597 states have internal predecessors, (85930), 12203 states have call successors, (12203), 652 states have call predecessors, (12203), 652 states have return successors, (12203), 11914 states have call predecessors, (12203), 12203 states have call successors, (12203) [2025-03-03 20:07:20,918 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 67164 states to 67164 states and 110336 transitions. [2025-03-03 20:07:20,978 INFO L78 Accepts]: Start accepts. Automaton has 67164 states and 110336 transitions. Word has length 701 [2025-03-03 20:07:20,979 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-03 20:07:20,979 INFO L471 AbstractCegarLoop]: Abstraction has 67164 states and 110336 transitions. [2025-03-03 20:07:20,979 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 33.8) internal successors, (169), 5 states have internal predecessors, (169), 1 states have call successors, (107), 1 states have call predecessors, (107), 1 states have return successors, (107), 1 states have call predecessors, (107), 1 states have call successors, (107) [2025-03-03 20:07:20,979 INFO L276 IsEmpty]: Start isEmpty. Operand 67164 states and 110336 transitions. [2025-03-03 20:07:21,004 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 703 [2025-03-03 20:07:21,004 INFO L210 NwaCegarLoop]: Found error trace [2025-03-03 20:07:21,005 INFO L218 NwaCegarLoop]: trace histogram [107, 107, 107, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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 20:07:21,005 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable16 [2025-03-03 20:07:21,005 INFO L396 AbstractCegarLoop]: === Iteration 18 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-03-03 20:07:21,006 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-03 20:07:21,006 INFO L85 PathProgramCache]: Analyzing trace with hash -1747453465, now seen corresponding path program 1 times [2025-03-03 20:07:21,006 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-03 20:07:21,006 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1026870242] [2025-03-03 20:07:21,006 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-03 20:07:21,006 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-03 20:07:21,043 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 702 statements into 1 equivalence classes. [2025-03-03 20:07:21,259 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 702 of 702 statements. [2025-03-03 20:07:21,259 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-03 20:07:21,259 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-03 20:07:21,662 INFO L134 CoverageAnalysis]: Checked inductivity of 22684 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 22684 trivial. 0 not checked. [2025-03-03 20:07:21,663 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-03 20:07:21,663 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1026870242] [2025-03-03 20:07:21,663 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1026870242] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-03 20:07:21,663 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-03 20:07:21,663 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2025-03-03 20:07:21,663 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1105075344] [2025-03-03 20:07:21,663 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-03 20:07:21,664 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2025-03-03 20:07:21,664 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-03 20:07:21,665 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2025-03-03 20:07:21,665 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2025-03-03 20:07:21,665 INFO L87 Difference]: Start difference. First operand 67164 states and 110336 transitions. Second operand has 4 states, 4 states have (on average 42.5) internal successors, (170), 4 states have internal predecessors, (170), 1 states have call successors, (107), 1 states have call predecessors, (107), 1 states have return successors, (107), 1 states have call predecessors, (107), 1 states have call successors, (107) [2025-03-03 20:07:27,243 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-03 20:07:27,243 INFO L93 Difference]: Finished difference Result 132044 states and 216197 transitions. [2025-03-03 20:07:27,244 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2025-03-03 20:07:27,244 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 4 states have (on average 42.5) internal successors, (170), 4 states have internal predecessors, (170), 1 states have call successors, (107), 1 states have call predecessors, (107), 1 states have return successors, (107), 1 states have call predecessors, (107), 1 states have call successors, (107) Word has length 702 [2025-03-03 20:07:27,244 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-03 20:07:27,567 INFO L225 Difference]: With dead ends: 132044 [2025-03-03 20:07:27,567 INFO L226 Difference]: Without dead ends: 98226 [2025-03-03 20:07:27,665 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 20:07:27,666 INFO L435 NwaCegarLoop]: 799 mSDtfsCounter, 395 mSDsluCounter, 1222 mSDsCounter, 0 mSdLazyCounter, 334 mSolverCounterSat, 1 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 395 SdHoareTripleChecker+Valid, 2021 SdHoareTripleChecker+Invalid, 335 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 1 IncrementalHoareTripleChecker+Valid, 334 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.2s IncrementalHoareTripleChecker+Time [2025-03-03 20:07:27,667 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [395 Valid, 2021 Invalid, 335 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [1 Valid, 334 Invalid, 0 Unknown, 0 Unchecked, 0.2s Time] [2025-03-03 20:07:27,737 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 98226 states. [2025-03-03 20:07:33,376 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 98226 to 98176. [2025-03-03 20:07:33,463 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 98176 states, 80087 states have (on average 1.5825664589758637) internal successors, (126743), 80568 states have internal predecessors, (126743), 17051 states have call successors, (17051), 1037 states have call predecessors, (17051), 1037 states have return successors, (17051), 16570 states have call predecessors, (17051), 17051 states have call successors, (17051) [2025-03-03 20:07:33,664 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 98176 states to 98176 states and 160845 transitions. [2025-03-03 20:07:33,732 INFO L78 Accepts]: Start accepts. Automaton has 98176 states and 160845 transitions. Word has length 702 [2025-03-03 20:07:33,733 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-03 20:07:33,733 INFO L471 AbstractCegarLoop]: Abstraction has 98176 states and 160845 transitions. [2025-03-03 20:07:33,733 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 42.5) internal successors, (170), 4 states have internal predecessors, (170), 1 states have call successors, (107), 1 states have call predecessors, (107), 1 states have return successors, (107), 1 states have call predecessors, (107), 1 states have call successors, (107) [2025-03-03 20:07:33,733 INFO L276 IsEmpty]: Start isEmpty. Operand 98176 states and 160845 transitions. [2025-03-03 20:07:33,759 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 703 [2025-03-03 20:07:33,759 INFO L210 NwaCegarLoop]: Found error trace [2025-03-03 20:07:33,759 INFO L218 NwaCegarLoop]: trace histogram [107, 107, 107, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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 20:07:33,760 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable17 [2025-03-03 20:07:33,760 INFO L396 AbstractCegarLoop]: === Iteration 19 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-03-03 20:07:33,760 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-03 20:07:33,760 INFO L85 PathProgramCache]: Analyzing trace with hash 34046470, now seen corresponding path program 1 times [2025-03-03 20:07:33,760 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-03 20:07:33,760 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1104475411] [2025-03-03 20:07:33,760 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-03 20:07:33,760 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-03 20:07:33,785 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 702 statements into 1 equivalence classes. [2025-03-03 20:07:33,967 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 702 of 702 statements. [2025-03-03 20:07:33,967 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-03 20:07:33,967 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-03 20:07:34,655 INFO L134 CoverageAnalysis]: Checked inductivity of 22684 backedges. 231 proven. 87 refuted. 0 times theorem prover too weak. 22366 trivial. 0 not checked. [2025-03-03 20:07:34,656 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-03 20:07:34,656 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1104475411] [2025-03-03 20:07:34,656 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1104475411] provided 0 perfect and 1 imperfect interpolant sequences [2025-03-03 20:07:34,656 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1992730151] [2025-03-03 20:07:34,656 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-03 20:07:34,656 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-03-03 20:07:34,656 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2025-03-03 20:07:34,661 INFO L229 MonitoredProcess]: Starting monitored process 3 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2025-03-03 20:07:34,662 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (3)] Waiting until timeout for monitored process [2025-03-03 20:07:34,839 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 702 statements into 1 equivalence classes. [2025-03-03 20:07:34,981 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 702 of 702 statements. [2025-03-03 20:07:34,982 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-03 20:07:34,982 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-03 20:07:34,988 INFO L256 TraceCheckSpWp]: Trace formula consists of 1628 conjuncts, 6 conjuncts are in the unsatisfiable core [2025-03-03 20:07:34,995 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-03-03 20:07:35,230 INFO L134 CoverageAnalysis]: Checked inductivity of 22684 backedges. 5748 proven. 45 refuted. 0 times theorem prover too weak. 16891 trivial. 0 not checked. [2025-03-03 20:07:35,231 INFO L312 TraceCheckSpWp]: Computing backward predicates... [2025-03-03 20:07:35,670 INFO L134 CoverageAnalysis]: Checked inductivity of 22684 backedges. 273 proven. 45 refuted. 0 times theorem prover too weak. 22366 trivial. 0 not checked. [2025-03-03 20:07:35,671 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1992730151] provided 0 perfect and 2 imperfect interpolant sequences [2025-03-03 20:07:35,671 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2025-03-03 20:07:35,671 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [5, 5, 5] total 8 [2025-03-03 20:07:35,672 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [906364471] [2025-03-03 20:07:35,672 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2025-03-03 20:07:35,673 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 8 states [2025-03-03 20:07:35,673 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-03 20:07:35,673 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2025-03-03 20:07:35,673 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=19, Invalid=37, Unknown=0, NotChecked=0, Total=56 [2025-03-03 20:07:35,674 INFO L87 Difference]: Start difference. First operand 98176 states and 160845 transitions. Second operand has 8 states, 8 states have (on average 35.0) internal successors, (280), 8 states have internal predecessors, (280), 3 states have call successors, (151), 2 states have call predecessors, (151), 4 states have return successors, (153), 3 states have call predecessors, (153), 3 states have call successors, (153)