./Ultimate.py --spec ../sv-benchmarks/c/properties/unreach-call.prp --file ../sv-benchmarks/c/hardness-nfm22/hardness_fillercode_fillercodesize_ps-cn-250_file-34.i --full-output --architecture 32bit -------------------------------------------------------------------------------- Checking for ERROR reachability Using default analysis Version c00e63dc Calling Ultimate with: /root/.sdkman/candidates/java/21.0.5-tem/bin/java -Dosgi.configuration.area=/storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/data/config -Xmx15G -Xms4m -jar /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/plugins/org.eclipse.equinox.launcher_1.6.800.v20240513-1750.jar -data @noDefault -ultimatedata /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/data -tc /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/config/AutomizerReach.xml -i ../sv-benchmarks/c/hardness-nfm22/hardness_fillercode_fillercodesize_ps-cn-250_file-34.i -s /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/config/svcomp-Reach-32bit-Automizer_Default.epf --cacsl2boogietranslator.entry.function main --witnessprinter.witness.directory /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux --witnessprinter.witness.filename witness --witnessprinter.write.witness.besides.input.file false --witnessprinter.graph.data.specification CHECK( init(main()), LTL(G ! call(reach_error())) ) --witnessprinter.graph.data.producer Automizer --witnessprinter.graph.data.architecture 32bit --witnessprinter.graph.data.programhash 44b378d526031e337ca9dca8ceafd0969cff3babd6a41cd4484561488d3936f8 --- Real Ultimate output --- This is Ultimate 0.3.0-?-c00e63d-m [2025-02-05 21:34:35,705 INFO L188 SettingsManager]: Resetting all preferences to default values... [2025-02-05 21:34:35,764 INFO L114 SettingsManager]: Loading settings from /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/config/svcomp-Reach-32bit-Automizer_Default.epf [2025-02-05 21:34:35,767 WARN L101 SettingsManager]: Preference file contains the following unknown settings: [2025-02-05 21:34:35,768 WARN L103 SettingsManager]: * de.uni_freiburg.informatik.ultimate.core.Log level for class [2025-02-05 21:34:35,786 INFO L130 SettingsManager]: Preferences different from defaults after loading the file: [2025-02-05 21:34:35,787 INFO L151 SettingsManager]: Preferences of UltimateCore differ from their defaults: [2025-02-05 21:34:35,787 INFO L153 SettingsManager]: * Log level for class=de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher=ERROR; [2025-02-05 21:34:35,787 INFO L151 SettingsManager]: Preferences of Boogie Preprocessor differ from their defaults: [2025-02-05 21:34:35,787 INFO L153 SettingsManager]: * Use memory slicer=true [2025-02-05 21:34:35,787 INFO L151 SettingsManager]: Preferences of Boogie Procedure Inliner differ from their defaults: [2025-02-05 21:34:35,787 INFO L153 SettingsManager]: * Ignore calls to procedures called more than once=ONLY_FOR_SEQUENTIAL_PROGRAMS [2025-02-05 21:34:35,787 INFO L151 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2025-02-05 21:34:35,788 INFO L153 SettingsManager]: * Create parallel compositions if possible=false [2025-02-05 21:34:35,788 INFO L153 SettingsManager]: * Use SBE=true [2025-02-05 21:34:35,788 INFO L151 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2025-02-05 21:34:35,788 INFO L153 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2025-02-05 21:34:35,788 INFO L153 SettingsManager]: * sizeof long=4 [2025-02-05 21:34:35,788 INFO L153 SettingsManager]: * Overapproximate operations on floating types=true [2025-02-05 21:34:35,788 INFO L153 SettingsManager]: * sizeof POINTER=4 [2025-02-05 21:34:35,788 INFO L153 SettingsManager]: * Check division by zero=IGNORE [2025-02-05 21:34:35,788 INFO L153 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2025-02-05 21:34:35,788 INFO L153 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2025-02-05 21:34:35,788 INFO L153 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2025-02-05 21:34:35,789 INFO L153 SettingsManager]: * sizeof long double=12 [2025-02-05 21:34:35,789 INFO L153 SettingsManager]: * Check if freed pointer was valid=false [2025-02-05 21:34:35,789 INFO L153 SettingsManager]: * Behaviour of calls to undefined functions=OVERAPPROXIMATE_BEHAVIOUR [2025-02-05 21:34:35,789 INFO L153 SettingsManager]: * Use constant arrays=true [2025-02-05 21:34:35,789 INFO L151 SettingsManager]: Preferences of IcfgBuilder differ from their defaults: [2025-02-05 21:34:35,789 INFO L153 SettingsManager]: * Size of a code block=SequenceOfStatements [2025-02-05 21:34:35,789 INFO L153 SettingsManager]: * Only consider context switches at boundaries of atomic blocks=true [2025-02-05 21:34:35,789 INFO L153 SettingsManager]: * SMT solver=External_DefaultMode [2025-02-05 21:34:35,789 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2025-02-05 21:34:35,789 INFO L151 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2025-02-05 21:34:35,789 INFO L153 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2025-02-05 21:34:35,790 INFO L153 SettingsManager]: * Compute procedure contracts=false [2025-02-05 21:34:35,790 INFO L153 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopHeads [2025-02-05 21:34:35,790 INFO L153 SettingsManager]: * Trace refinement strategy=CAMEL [2025-02-05 21:34:35,790 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2025-02-05 21:34:35,790 INFO L153 SettingsManager]: * Apply one-shot large block encoding in concurrent analysis=false [2025-02-05 21:34:35,790 INFO L153 SettingsManager]: * Automaton type used in concurrency analysis=PETRI_NET [2025-02-05 21:34:35,790 INFO L153 SettingsManager]: * Order on configurations for Petri net unfoldings=DBO [2025-02-05 21:34:35,790 INFO L153 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode [2025-02-05 21:34:35,790 INFO L153 SettingsManager]: * Looper check in Petri net analysis=SEMANTIC Applying setting for plugin de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator: Entry function -> main Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Witness directory -> /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Witness filename -> witness Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Write witness besides input file -> false Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Graph data specification -> CHECK( init(main()), LTL(G ! call(reach_error())) ) Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Graph data producer -> Automizer Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Graph data architecture -> 32bit Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Graph data programhash -> 44b378d526031e337ca9dca8ceafd0969cff3babd6a41cd4484561488d3936f8 [2025-02-05 21:34:36,021 INFO L75 nceAwareModelManager]: Repository-Root is: /tmp [2025-02-05 21:34:36,030 INFO L261 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2025-02-05 21:34:36,033 INFO L217 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2025-02-05 21:34:36,035 INFO L270 PluginConnector]: Initializing CDTParser... [2025-02-05 21:34:36,035 INFO L274 PluginConnector]: CDTParser initialized [2025-02-05 21:34:36,036 INFO L431 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/../sv-benchmarks/c/hardness-nfm22/hardness_fillercode_fillercodesize_ps-cn-250_file-34.i [2025-02-05 21:34:37,248 INFO L533 CDTParser]: Created temporary CDT project at /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/data/2c4c0460f/3499b2d614a34cc79909aaeb85903b7d/FLAGfe6de5e8f [2025-02-05 21:34:37,561 INFO L384 CDTParser]: Found 1 translation units. [2025-02-05 21:34:37,561 INFO L180 CDTParser]: Scanning /storage/repos/ultimate-jdk21/releaseScripts/default/sv-benchmarks/c/hardness-nfm22/hardness_fillercode_fillercodesize_ps-cn-250_file-34.i [2025-02-05 21:34:37,575 INFO L427 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/data/2c4c0460f/3499b2d614a34cc79909aaeb85903b7d/FLAGfe6de5e8f [2025-02-05 21:34:37,604 INFO L435 CDTParser]: Successfully deleted /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/data/2c4c0460f/3499b2d614a34cc79909aaeb85903b7d [2025-02-05 21:34:37,606 INFO L299 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2025-02-05 21:34:37,608 INFO L133 ToolchainWalker]: Walking toolchain with 6 elements. [2025-02-05 21:34:37,610 INFO L112 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2025-02-05 21:34:37,610 INFO L270 PluginConnector]: Initializing CACSL2BoogieTranslator... [2025-02-05 21:34:37,614 INFO L274 PluginConnector]: CACSL2BoogieTranslator initialized [2025-02-05 21:34:37,615 INFO L184 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 05.02 09:34:37" (1/1) ... [2025-02-05 21:34:37,616 INFO L204 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@12dbfce0 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 05.02 09:34:37, skipping insertion in model container [2025-02-05 21:34:37,617 INFO L184 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 05.02 09:34:37" (1/1) ... [2025-02-05 21:34:37,645 INFO L175 MainTranslator]: Built tables and reachable declarations [2025-02-05 21:34:37,751 WARN L250 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate-jdk21/releaseScripts/default/sv-benchmarks/c/hardness-nfm22/hardness_fillercode_fillercodesize_ps-cn-250_file-34.i[916,929] [2025-02-05 21:34:37,877 INFO L210 PostProcessor]: Analyzing one entry point: main [2025-02-05 21:34:37,890 INFO L200 MainTranslator]: Completed pre-run [2025-02-05 21:34:37,898 WARN L250 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate-jdk21/releaseScripts/default/sv-benchmarks/c/hardness-nfm22/hardness_fillercode_fillercodesize_ps-cn-250_file-34.i[916,929] [2025-02-05 21:34:37,946 INFO L210 PostProcessor]: Analyzing one entry point: main [2025-02-05 21:34:37,964 INFO L204 MainTranslator]: Completed translation [2025-02-05 21:34:37,965 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 05.02 09:34:37 WrapperNode [2025-02-05 21:34:37,965 INFO L131 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2025-02-05 21:34:37,966 INFO L112 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2025-02-05 21:34:37,966 INFO L270 PluginConnector]: Initializing Boogie Procedure Inliner... [2025-02-05 21:34:37,966 INFO L274 PluginConnector]: Boogie Procedure Inliner initialized [2025-02-05 21:34:37,970 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 05.02 09:34:37" (1/1) ... [2025-02-05 21:34:37,994 INFO L184 PluginConnector]: Executing the observer Inliner from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 05.02 09:34:37" (1/1) ... [2025-02-05 21:34:38,058 INFO L138 Inliner]: procedures = 26, calls = 84, calls flagged for inlining = 8, calls inlined = 8, statements flattened = 544 [2025-02-05 21:34:38,059 INFO L131 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2025-02-05 21:34:38,060 INFO L112 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2025-02-05 21:34:38,060 INFO L270 PluginConnector]: Initializing Boogie Preprocessor... [2025-02-05 21:34:38,060 INFO L274 PluginConnector]: Boogie Preprocessor initialized [2025-02-05 21:34:38,067 INFO L184 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 05.02 09:34:37" (1/1) ... [2025-02-05 21:34:38,067 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 05.02 09:34:37" (1/1) ... [2025-02-05 21:34:38,074 INFO L184 PluginConnector]: Executing the observer MemorySlicer from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 05.02 09:34:37" (1/1) ... [2025-02-05 21:34:38,107 INFO L175 MemorySlicer]: Split 2 memory accesses to 1 slices as follows [2]. 100 percent of accesses are in the largest equivalence class. The 2 initializations are split as follows [2]. The 0 writes are split as follows [0]. [2025-02-05 21:34:38,107 INFO L184 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 05.02 09:34:37" (1/1) ... [2025-02-05 21:34:38,107 INFO L184 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 05.02 09:34:37" (1/1) ... [2025-02-05 21:34:38,126 INFO L184 PluginConnector]: Executing the observer ReplaceArrayAssignments from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 05.02 09:34:37" (1/1) ... [2025-02-05 21:34:38,136 INFO L184 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 05.02 09:34:37" (1/1) ... [2025-02-05 21:34:38,145 INFO L184 PluginConnector]: Executing the observer LTLStepAnnotator from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 05.02 09:34:37" (1/1) ... [2025-02-05 21:34:38,148 INFO L184 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 05.02 09:34:37" (1/1) ... [2025-02-05 21:34:38,162 INFO L131 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2025-02-05 21:34:38,164 INFO L112 PluginConnector]: ------------------------IcfgBuilder---------------------------- [2025-02-05 21:34:38,164 INFO L270 PluginConnector]: Initializing IcfgBuilder... [2025-02-05 21:34:38,164 INFO L274 PluginConnector]: IcfgBuilder initialized [2025-02-05 21:34:38,165 INFO L184 PluginConnector]: Executing the observer IcfgBuilderObserver from plugin IcfgBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 05.02 09:34:37" (1/1) ... [2025-02-05 21:34:38,169 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2025-02-05 21:34:38,181 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 [2025-02-05 21:34:38,195 INFO L229 MonitoredProcess]: Starting monitored process 1 with /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 (exit command is (exit), workingDir is null) [2025-02-05 21:34:38,202 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 (1)] Waiting until timeout for monitored process [2025-02-05 21:34:38,222 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocInit [2025-02-05 21:34:38,222 INFO L130 BoogieDeclarations]: Found specification of procedure assume_abort_if_not [2025-02-05 21:34:38,222 INFO L138 BoogieDeclarations]: Found implementation of procedure assume_abort_if_not [2025-02-05 21:34:38,223 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int#0 [2025-02-05 21:34:38,223 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2025-02-05 21:34:38,223 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2025-02-05 21:34:38,308 INFO L257 CfgBuilder]: Building ICFG [2025-02-05 21:34:38,309 INFO L287 CfgBuilder]: Building CFG for each procedure with an implementation [2025-02-05 21:34:38,948 INFO L1309 $ProcedureCfgBuilder]: dead code at ProgramPoint L443: havoc property_#t~bitwise51#1;havoc property_#t~ite53#1;havoc property_#t~bitwise52#1;havoc property_#t~short54#1; [2025-02-05 21:34:39,042 INFO L? ?]: Removed 32 outVars from TransFormulas that were not future-live. [2025-02-05 21:34:39,044 INFO L308 CfgBuilder]: Performing block encoding [2025-02-05 21:34:39,073 INFO L332 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2025-02-05 21:34:39,076 INFO L337 CfgBuilder]: Removed 1 assume(true) statements. [2025-02-05 21:34:39,076 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.icfgbuilder CFG 05.02 09:34:39 BoogieIcfgContainer [2025-02-05 21:34:39,076 INFO L131 PluginConnector]: ------------------------ END IcfgBuilder---------------------------- [2025-02-05 21:34:39,078 INFO L112 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2025-02-05 21:34:39,078 INFO L270 PluginConnector]: Initializing TraceAbstraction... [2025-02-05 21:34:39,081 INFO L274 PluginConnector]: TraceAbstraction initialized [2025-02-05 21:34:39,081 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 05.02 09:34:37" (1/3) ... [2025-02-05 21:34:39,082 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@71b82cbf and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 05.02 09:34:39, skipping insertion in model container [2025-02-05 21:34:39,082 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 05.02 09:34:37" (2/3) ... [2025-02-05 21:34:39,082 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@71b82cbf and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 05.02 09:34:39, skipping insertion in model container [2025-02-05 21:34:39,082 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.icfgbuilder CFG 05.02 09:34:39" (3/3) ... [2025-02-05 21:34:39,083 INFO L128 eAbstractionObserver]: Analyzing ICFG hardness_fillercode_fillercodesize_ps-cn-250_file-34.i [2025-02-05 21:34:39,094 INFO L216 ceAbstractionStarter]: Automizer settings: Hoare:LoopHeads NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2025-02-05 21:34:39,096 INFO L151 ceAbstractionStarter]: Applying trace abstraction to ICFG hardness_fillercode_fillercodesize_ps-cn-250_file-34.i that has 2 procedures, 232 locations, 1 initial locations, 1 loop locations, and 1 error locations. [2025-02-05 21:34:39,142 INFO L332 AbstractCegarLoop]: ======== Iteration 0 == of CEGAR loop == AllErrorsAtOnce ======== [2025-02-05 21:34:39,151 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;@20cf40b2, mLbeIndependenceSettings=[IndependenceType=SEMANTIC, AbstractionType=NONE, UseConditional=false, UseSemiCommutativity=true, Solver=Z3, SolverTimeout=1000ms] [2025-02-05 21:34:39,152 INFO L334 AbstractCegarLoop]: Starting to check reachability of 1 error locations. [2025-02-05 21:34:39,157 INFO L276 IsEmpty]: Start isEmpty. Operand has 232 states, 158 states have (on average 1.5569620253164558) internal successors, (246), 159 states have internal predecessors, (246), 71 states have call successors, (71), 1 states have call predecessors, (71), 1 states have return successors, (71), 71 states have call predecessors, (71), 71 states have call successors, (71) [2025-02-05 21:34:39,180 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 446 [2025-02-05 21:34:39,181 INFO L210 NwaCegarLoop]: Found error trace [2025-02-05 21:34:39,182 INFO L218 NwaCegarLoop]: trace histogram [71, 71, 71, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-02-05 21:34:39,182 INFO L396 AbstractCegarLoop]: === Iteration 1 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-02-05 21:34:39,186 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-02-05 21:34:39,187 INFO L85 PathProgramCache]: Analyzing trace with hash 284600418, now seen corresponding path program 1 times [2025-02-05 21:34:39,192 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-02-05 21:34:39,193 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1950010294] [2025-02-05 21:34:39,193 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-02-05 21:34:39,194 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-02-05 21:34:39,293 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 445 statements into 1 equivalence classes. [2025-02-05 21:34:39,316 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 445 of 445 statements. [2025-02-05 21:34:39,317 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-02-05 21:34:39,317 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-02-05 21:34:39,617 INFO L134 CoverageAnalysis]: Checked inductivity of 9940 backedges. 0 proven. 140 refuted. 0 times theorem prover too weak. 9800 trivial. 0 not checked. [2025-02-05 21:34:39,617 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-02-05 21:34:39,618 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1950010294] [2025-02-05 21:34:39,618 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1950010294] provided 0 perfect and 1 imperfect interpolant sequences [2025-02-05 21:34:39,619 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1315445577] [2025-02-05 21:34:39,619 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-02-05 21:34:39,619 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-02-05 21:34:39,619 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 [2025-02-05 21:34:39,625 INFO L229 MonitoredProcess]: Starting monitored process 2 with /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2025-02-05 21:34:39,629 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (2)] Waiting until timeout for monitored process [2025-02-05 21:34:39,743 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 445 statements into 1 equivalence classes. [2025-02-05 21:34:39,880 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 445 of 445 statements. [2025-02-05 21:34:39,880 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-02-05 21:34:39,880 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-02-05 21:34:39,884 INFO L256 TraceCheckSpWp]: Trace formula consists of 1004 conjuncts, 1 conjuncts are in the unsatisfiable core [2025-02-05 21:34:39,897 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-02-05 21:34:39,942 INFO L134 CoverageAnalysis]: Checked inductivity of 9940 backedges. 140 proven. 0 refuted. 0 times theorem prover too weak. 9800 trivial. 0 not checked. [2025-02-05 21:34:39,942 INFO L308 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2025-02-05 21:34:39,942 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1315445577] provided 1 perfect and 0 imperfect interpolant sequences [2025-02-05 21:34:39,942 INFO L185 FreeRefinementEngine]: Found 1 perfect and 1 imperfect interpolant sequences. [2025-02-05 21:34:39,942 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [2] total 2 [2025-02-05 21:34:39,944 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1983427765] [2025-02-05 21:34:39,944 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-02-05 21:34:39,947 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 2 states [2025-02-05 21:34:39,947 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-02-05 21:34:39,966 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 2 interpolants. [2025-02-05 21:34:39,966 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=1, Invalid=1, Unknown=0, NotChecked=0, Total=2 [2025-02-05 21:34:39,968 INFO L87 Difference]: Start difference. First operand has 232 states, 158 states have (on average 1.5569620253164558) internal successors, (246), 159 states have internal predecessors, (246), 71 states have call successors, (71), 1 states have call predecessors, (71), 1 states have return successors, (71), 71 states have call predecessors, (71), 71 states have call successors, (71) Second operand has 2 states, 2 states have (on average 47.5) internal successors, (95), 2 states have internal predecessors, (95), 2 states have call successors, (71), 2 states have call predecessors, (71), 1 states have return successors, (71), 1 states have call predecessors, (71), 2 states have call successors, (71) [2025-02-05 21:34:40,013 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-02-05 21:34:40,014 INFO L93 Difference]: Finished difference Result 458 states and 842 transitions. [2025-02-05 21:34:40,015 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 2 states. [2025-02-05 21:34:40,016 INFO L78 Accepts]: Start accepts. Automaton has has 2 states, 2 states have (on average 47.5) internal successors, (95), 2 states have internal predecessors, (95), 2 states have call successors, (71), 2 states have call predecessors, (71), 1 states have return successors, (71), 1 states have call predecessors, (71), 2 states have call successors, (71) Word has length 445 [2025-02-05 21:34:40,016 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-02-05 21:34:40,022 INFO L225 Difference]: With dead ends: 458 [2025-02-05 21:34:40,022 INFO L226 Difference]: Without dead ends: 229 [2025-02-05 21:34:40,026 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 446 GetRequests, 446 SyntacticMatches, 0 SemanticMatches, 0 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=1, Invalid=1, Unknown=0, NotChecked=0, Total=2 [2025-02-05 21:34:40,028 INFO L435 NwaCegarLoop]: 372 mSDtfsCounter, 0 mSDsluCounter, 0 mSDsCounter, 0 mSdLazyCounter, 10 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 0 SdHoareTripleChecker+Valid, 372 SdHoareTripleChecker+Invalid, 10 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 10 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2025-02-05 21:34:40,028 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [0 Valid, 372 Invalid, 10 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 10 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2025-02-05 21:34:40,043 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 229 states. [2025-02-05 21:34:40,068 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 229 to 229. [2025-02-05 21:34:40,069 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 229 states, 156 states have (on average 1.5384615384615385) internal successors, (240), 156 states have internal predecessors, (240), 71 states have call successors, (71), 1 states have call predecessors, (71), 1 states have return successors, (71), 71 states have call predecessors, (71), 71 states have call successors, (71) [2025-02-05 21:34:40,073 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 229 states to 229 states and 382 transitions. [2025-02-05 21:34:40,074 INFO L78 Accepts]: Start accepts. Automaton has 229 states and 382 transitions. Word has length 445 [2025-02-05 21:34:40,075 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-02-05 21:34:40,075 INFO L471 AbstractCegarLoop]: Abstraction has 229 states and 382 transitions. [2025-02-05 21:34:40,075 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 2 states, 2 states have (on average 47.5) internal successors, (95), 2 states have internal predecessors, (95), 2 states have call successors, (71), 2 states have call predecessors, (71), 1 states have return successors, (71), 1 states have call predecessors, (71), 2 states have call successors, (71) [2025-02-05 21:34:40,075 INFO L276 IsEmpty]: Start isEmpty. Operand 229 states and 382 transitions. [2025-02-05 21:34:40,085 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 446 [2025-02-05 21:34:40,085 INFO L210 NwaCegarLoop]: Found error trace [2025-02-05 21:34:40,085 INFO L218 NwaCegarLoop]: trace histogram [71, 71, 71, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-02-05 21:34:40,097 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (2)] Ended with exit code 0 [2025-02-05 21:34:40,286 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 2 /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable0 [2025-02-05 21:34:40,287 INFO L396 AbstractCegarLoop]: === Iteration 2 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-02-05 21:34:40,288 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-02-05 21:34:40,288 INFO L85 PathProgramCache]: Analyzing trace with hash 1617855841, now seen corresponding path program 1 times [2025-02-05 21:34:40,288 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-02-05 21:34:40,288 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1727262350] [2025-02-05 21:34:40,288 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-02-05 21:34:40,288 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-02-05 21:34:40,309 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 445 statements into 1 equivalence classes. [2025-02-05 21:34:40,364 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 445 of 445 statements. [2025-02-05 21:34:40,364 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-02-05 21:34:40,364 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-02-05 21:34:40,590 INFO L134 CoverageAnalysis]: Checked inductivity of 9940 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 9940 trivial. 0 not checked. [2025-02-05 21:34:40,590 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-02-05 21:34:40,590 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1727262350] [2025-02-05 21:34:40,590 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1727262350] provided 1 perfect and 0 imperfect interpolant sequences [2025-02-05 21:34:40,590 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-02-05 21:34:40,590 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2025-02-05 21:34:40,590 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1568888046] [2025-02-05 21:34:40,591 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-02-05 21:34:40,593 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2025-02-05 21:34:40,593 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-02-05 21:34:40,594 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2025-02-05 21:34:40,594 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-02-05 21:34:40,595 INFO L87 Difference]: Start difference. First operand 229 states and 382 transitions. Second operand has 3 states, 3 states have (on average 31.0) internal successors, (93), 3 states have internal predecessors, (93), 1 states have call successors, (71), 1 states have call predecessors, (71), 1 states have return successors, (71), 1 states have call predecessors, (71), 1 states have call successors, (71) [2025-02-05 21:34:40,680 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-02-05 21:34:40,682 INFO L93 Difference]: Finished difference Result 597 states and 999 transitions. [2025-02-05 21:34:40,682 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2025-02-05 21:34:40,683 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 31.0) internal successors, (93), 3 states have internal predecessors, (93), 1 states have call successors, (71), 1 states have call predecessors, (71), 1 states have return successors, (71), 1 states have call predecessors, (71), 1 states have call successors, (71) Word has length 445 [2025-02-05 21:34:40,684 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-02-05 21:34:40,689 INFO L225 Difference]: With dead ends: 597 [2025-02-05 21:34:40,689 INFO L226 Difference]: Without dead ends: 371 [2025-02-05 21:34:40,690 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 3 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-02-05 21:34:40,691 INFO L435 NwaCegarLoop]: 437 mSDtfsCounter, 235 mSDsluCounter, 357 mSDsCounter, 0 mSdLazyCounter, 33 mSolverCounterSat, 4 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 235 SdHoareTripleChecker+Valid, 794 SdHoareTripleChecker+Invalid, 37 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 4 IncrementalHoareTripleChecker+Valid, 33 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2025-02-05 21:34:40,691 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [235 Valid, 794 Invalid, 37 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [4 Valid, 33 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2025-02-05 21:34:40,692 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 371 states. [2025-02-05 21:34:40,730 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 371 to 368. [2025-02-05 21:34:40,732 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 368 states, 275 states have (on average 1.5854545454545454) internal successors, (436), 276 states have internal predecessors, (436), 90 states have call successors, (90), 2 states have call predecessors, (90), 2 states have return successors, (90), 89 states have call predecessors, (90), 90 states have call successors, (90) [2025-02-05 21:34:40,734 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 368 states to 368 states and 616 transitions. [2025-02-05 21:34:40,736 INFO L78 Accepts]: Start accepts. Automaton has 368 states and 616 transitions. Word has length 445 [2025-02-05 21:34:40,737 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-02-05 21:34:40,737 INFO L471 AbstractCegarLoop]: Abstraction has 368 states and 616 transitions. [2025-02-05 21:34:40,737 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 31.0) internal successors, (93), 3 states have internal predecessors, (93), 1 states have call successors, (71), 1 states have call predecessors, (71), 1 states have return successors, (71), 1 states have call predecessors, (71), 1 states have call successors, (71) [2025-02-05 21:34:40,739 INFO L276 IsEmpty]: Start isEmpty. Operand 368 states and 616 transitions. [2025-02-05 21:34:40,743 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 446 [2025-02-05 21:34:40,743 INFO L210 NwaCegarLoop]: Found error trace [2025-02-05 21:34:40,743 INFO L218 NwaCegarLoop]: trace histogram [71, 71, 71, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-02-05 21:34:40,743 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable1 [2025-02-05 21:34:40,744 INFO L396 AbstractCegarLoop]: === Iteration 3 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-02-05 21:34:40,744 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-02-05 21:34:40,744 INFO L85 PathProgramCache]: Analyzing trace with hash -1215531456, now seen corresponding path program 1 times [2025-02-05 21:34:40,745 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-02-05 21:34:40,746 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1667510561] [2025-02-05 21:34:40,747 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-02-05 21:34:40,747 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-02-05 21:34:40,771 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 445 statements into 1 equivalence classes. [2025-02-05 21:34:40,829 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 445 of 445 statements. [2025-02-05 21:34:40,829 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-02-05 21:34:40,829 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-02-05 21:34:41,075 INFO L134 CoverageAnalysis]: Checked inductivity of 9940 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 9940 trivial. 0 not checked. [2025-02-05 21:34:41,076 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-02-05 21:34:41,078 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1667510561] [2025-02-05 21:34:41,078 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1667510561] provided 1 perfect and 0 imperfect interpolant sequences [2025-02-05 21:34:41,078 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-02-05 21:34:41,078 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2025-02-05 21:34:41,078 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [320390252] [2025-02-05 21:34:41,078 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-02-05 21:34:41,080 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2025-02-05 21:34:41,080 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-02-05 21:34:41,081 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2025-02-05 21:34:41,081 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-02-05 21:34:41,081 INFO L87 Difference]: Start difference. First operand 368 states and 616 transitions. Second operand has 3 states, 3 states have (on average 31.0) internal successors, (93), 3 states have internal predecessors, (93), 1 states have call successors, (71), 1 states have call predecessors, (71), 1 states have return successors, (71), 1 states have call predecessors, (71), 1 states have call successors, (71) [2025-02-05 21:34:41,155 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-02-05 21:34:41,155 INFO L93 Difference]: Finished difference Result 987 states and 1655 transitions. [2025-02-05 21:34:41,155 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2025-02-05 21:34:41,156 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 31.0) internal successors, (93), 3 states have internal predecessors, (93), 1 states have call successors, (71), 1 states have call predecessors, (71), 1 states have return successors, (71), 1 states have call predecessors, (71), 1 states have call successors, (71) Word has length 445 [2025-02-05 21:34:41,156 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-02-05 21:34:41,160 INFO L225 Difference]: With dead ends: 987 [2025-02-05 21:34:41,160 INFO L226 Difference]: Without dead ends: 622 [2025-02-05 21:34:41,161 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 3 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-02-05 21:34:41,161 INFO L435 NwaCegarLoop]: 427 mSDtfsCounter, 217 mSDsluCounter, 357 mSDsCounter, 0 mSdLazyCounter, 35 mSolverCounterSat, 6 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 217 SdHoareTripleChecker+Valid, 784 SdHoareTripleChecker+Invalid, 41 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 6 IncrementalHoareTripleChecker+Valid, 35 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2025-02-05 21:34:41,161 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [217 Valid, 784 Invalid, 41 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [6 Valid, 35 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2025-02-05 21:34:41,162 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 622 states. [2025-02-05 21:34:41,205 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 622 to 618. [2025-02-05 21:34:41,209 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 618 states, 493 states have (on average 1.6044624746450304) internal successors, (791), 496 states have internal predecessors, (791), 120 states have call successors, (120), 4 states have call predecessors, (120), 4 states have return successors, (120), 117 states have call predecessors, (120), 120 states have call successors, (120) [2025-02-05 21:34:41,212 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 618 states to 618 states and 1031 transitions. [2025-02-05 21:34:41,213 INFO L78 Accepts]: Start accepts. Automaton has 618 states and 1031 transitions. Word has length 445 [2025-02-05 21:34:41,214 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-02-05 21:34:41,214 INFO L471 AbstractCegarLoop]: Abstraction has 618 states and 1031 transitions. [2025-02-05 21:34:41,214 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 31.0) internal successors, (93), 3 states have internal predecessors, (93), 1 states have call successors, (71), 1 states have call predecessors, (71), 1 states have return successors, (71), 1 states have call predecessors, (71), 1 states have call successors, (71) [2025-02-05 21:34:41,214 INFO L276 IsEmpty]: Start isEmpty. Operand 618 states and 1031 transitions. [2025-02-05 21:34:41,218 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 446 [2025-02-05 21:34:41,218 INFO L210 NwaCegarLoop]: Found error trace [2025-02-05 21:34:41,218 INFO L218 NwaCegarLoop]: trace histogram [71, 71, 71, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-02-05 21:34:41,218 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable2 [2025-02-05 21:34:41,219 INFO L396 AbstractCegarLoop]: === Iteration 4 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-02-05 21:34:41,219 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-02-05 21:34:41,219 INFO L85 PathProgramCache]: Analyzing trace with hash 417272543, now seen corresponding path program 1 times [2025-02-05 21:34:41,219 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-02-05 21:34:41,219 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [855360749] [2025-02-05 21:34:41,219 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-02-05 21:34:41,220 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-02-05 21:34:41,250 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 445 statements into 1 equivalence classes. [2025-02-05 21:34:41,307 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 445 of 445 statements. [2025-02-05 21:34:41,307 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-02-05 21:34:41,307 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-02-05 21:34:41,585 INFO L134 CoverageAnalysis]: Checked inductivity of 9940 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 9940 trivial. 0 not checked. [2025-02-05 21:34:41,588 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-02-05 21:34:41,588 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [855360749] [2025-02-05 21:34:41,588 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [855360749] provided 1 perfect and 0 imperfect interpolant sequences [2025-02-05 21:34:41,588 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-02-05 21:34:41,588 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2025-02-05 21:34:41,588 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1719873772] [2025-02-05 21:34:41,588 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-02-05 21:34:41,589 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2025-02-05 21:34:41,589 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-02-05 21:34:41,589 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2025-02-05 21:34:41,590 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=6, Invalid=6, Unknown=0, NotChecked=0, Total=12 [2025-02-05 21:34:41,591 INFO L87 Difference]: Start difference. First operand 618 states and 1031 transitions. Second operand has 4 states, 4 states have (on average 23.25) internal successors, (93), 4 states have internal predecessors, (93), 1 states have call successors, (71), 1 states have call predecessors, (71), 1 states have return successors, (71), 1 states have call predecessors, (71), 1 states have call successors, (71) [2025-02-05 21:34:41,857 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-02-05 21:34:41,860 INFO L93 Difference]: Finished difference Result 1408 states and 2336 transitions. [2025-02-05 21:34:41,861 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2025-02-05 21:34:41,861 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 4 states have (on average 23.25) internal successors, (93), 4 states have internal predecessors, (93), 1 states have call successors, (71), 1 states have call predecessors, (71), 1 states have return successors, (71), 1 states have call predecessors, (71), 1 states have call successors, (71) Word has length 445 [2025-02-05 21:34:41,862 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-02-05 21:34:41,869 INFO L225 Difference]: With dead ends: 1408 [2025-02-05 21:34:41,872 INFO L226 Difference]: Without dead ends: 793 [2025-02-05 21:34:41,874 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 4 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 2 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=6, Invalid=6, Unknown=0, NotChecked=0, Total=12 [2025-02-05 21:34:41,875 INFO L435 NwaCegarLoop]: 572 mSDtfsCounter, 367 mSDsluCounter, 534 mSDsCounter, 0 mSdLazyCounter, 95 mSolverCounterSat, 5 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 367 SdHoareTripleChecker+Valid, 1106 SdHoareTripleChecker+Invalid, 100 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 5 IncrementalHoareTripleChecker+Valid, 95 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.2s IncrementalHoareTripleChecker+Time [2025-02-05 21:34:41,875 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [367 Valid, 1106 Invalid, 100 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [5 Valid, 95 Invalid, 0 Unknown, 0 Unchecked, 0.2s Time] [2025-02-05 21:34:41,876 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 793 states. [2025-02-05 21:34:41,920 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 793 to 620. [2025-02-05 21:34:41,922 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 620 states, 495 states have (on average 1.6020202020202021) internal successors, (793), 498 states have internal predecessors, (793), 120 states have call successors, (120), 4 states have call predecessors, (120), 4 states have return successors, (120), 117 states have call predecessors, (120), 120 states have call successors, (120) [2025-02-05 21:34:41,924 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 620 states to 620 states and 1033 transitions. [2025-02-05 21:34:41,925 INFO L78 Accepts]: Start accepts. Automaton has 620 states and 1033 transitions. Word has length 445 [2025-02-05 21:34:41,926 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-02-05 21:34:41,926 INFO L471 AbstractCegarLoop]: Abstraction has 620 states and 1033 transitions. [2025-02-05 21:34:41,926 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 23.25) internal successors, (93), 4 states have internal predecessors, (93), 1 states have call successors, (71), 1 states have call predecessors, (71), 1 states have return successors, (71), 1 states have call predecessors, (71), 1 states have call successors, (71) [2025-02-05 21:34:41,926 INFO L276 IsEmpty]: Start isEmpty. Operand 620 states and 1033 transitions. [2025-02-05 21:34:41,930 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 446 [2025-02-05 21:34:41,930 INFO L210 NwaCegarLoop]: Found error trace [2025-02-05 21:34:41,931 INFO L218 NwaCegarLoop]: trace histogram [71, 71, 71, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-02-05 21:34:41,931 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable3 [2025-02-05 21:34:41,931 INFO L396 AbstractCegarLoop]: === Iteration 5 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-02-05 21:34:41,931 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-02-05 21:34:41,931 INFO L85 PathProgramCache]: Analyzing trace with hash 1533985595, now seen corresponding path program 1 times [2025-02-05 21:34:41,931 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-02-05 21:34:41,931 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [894917708] [2025-02-05 21:34:41,932 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-02-05 21:34:41,932 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-02-05 21:34:41,951 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 445 statements into 1 equivalence classes. [2025-02-05 21:34:42,005 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 445 of 445 statements. [2025-02-05 21:34:42,006 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-02-05 21:34:42,006 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-02-05 21:34:42,371 INFO L134 CoverageAnalysis]: Checked inductivity of 9940 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 9940 trivial. 0 not checked. [2025-02-05 21:34:42,375 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-02-05 21:34:42,375 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [894917708] [2025-02-05 21:34:42,375 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [894917708] provided 1 perfect and 0 imperfect interpolant sequences [2025-02-05 21:34:42,375 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-02-05 21:34:42,375 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2025-02-05 21:34:42,375 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2073634190] [2025-02-05 21:34:42,376 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-02-05 21:34:42,376 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2025-02-05 21:34:42,376 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-02-05 21:34:42,377 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2025-02-05 21:34:42,377 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2025-02-05 21:34:42,377 INFO L87 Difference]: Start difference. First operand 620 states and 1033 transitions. Second operand has 4 states, 4 states have (on average 23.25) internal successors, (93), 4 states have internal predecessors, (93), 1 states have call successors, (71), 1 states have call predecessors, (71), 1 states have return successors, (71), 1 states have call predecessors, (71), 1 states have call successors, (71) [2025-02-05 21:34:42,734 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-02-05 21:34:42,734 INFO L93 Difference]: Finished difference Result 1968 states and 3270 transitions. [2025-02-05 21:34:42,734 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2025-02-05 21:34:42,734 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 4 states have (on average 23.25) internal successors, (93), 4 states have internal predecessors, (93), 1 states have call successors, (71), 1 states have call predecessors, (71), 1 states have return successors, (71), 1 states have call predecessors, (71), 1 states have call successors, (71) Word has length 445 [2025-02-05 21:34:42,735 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-02-05 21:34:42,741 INFO L225 Difference]: With dead ends: 1968 [2025-02-05 21:34:42,741 INFO L226 Difference]: Without dead ends: 1351 [2025-02-05 21:34:42,743 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 7 GetRequests, 4 SyntacticMatches, 0 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=9, Invalid=11, Unknown=0, NotChecked=0, Total=20 [2025-02-05 21:34:42,743 INFO L435 NwaCegarLoop]: 405 mSDtfsCounter, 398 mSDsluCounter, 727 mSDsCounter, 0 mSdLazyCounter, 50 mSolverCounterSat, 215 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 398 SdHoareTripleChecker+Valid, 1132 SdHoareTripleChecker+Invalid, 265 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 215 IncrementalHoareTripleChecker+Valid, 50 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.3s IncrementalHoareTripleChecker+Time [2025-02-05 21:34:42,744 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [398 Valid, 1132 Invalid, 265 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [215 Valid, 50 Invalid, 0 Unknown, 0 Unchecked, 0.3s Time] [2025-02-05 21:34:42,745 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1351 states. [2025-02-05 21:34:42,840 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1351 to 1243. [2025-02-05 21:34:42,842 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 1243 states, 994 states have (on average 1.595573440643863) internal successors, (1586), 1000 states have internal predecessors, (1586), 240 states have call successors, (240), 8 states have call predecessors, (240), 8 states have return successors, (240), 234 states have call predecessors, (240), 240 states have call successors, (240) [2025-02-05 21:34:42,846 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1243 states to 1243 states and 2066 transitions. [2025-02-05 21:34:42,847 INFO L78 Accepts]: Start accepts. Automaton has 1243 states and 2066 transitions. Word has length 445 [2025-02-05 21:34:42,848 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-02-05 21:34:42,848 INFO L471 AbstractCegarLoop]: Abstraction has 1243 states and 2066 transitions. [2025-02-05 21:34:42,848 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 23.25) internal successors, (93), 4 states have internal predecessors, (93), 1 states have call successors, (71), 1 states have call predecessors, (71), 1 states have return successors, (71), 1 states have call predecessors, (71), 1 states have call successors, (71) [2025-02-05 21:34:42,848 INFO L276 IsEmpty]: Start isEmpty. Operand 1243 states and 2066 transitions. [2025-02-05 21:34:42,852 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 447 [2025-02-05 21:34:42,852 INFO L210 NwaCegarLoop]: Found error trace [2025-02-05 21:34:42,853 INFO L218 NwaCegarLoop]: trace histogram [71, 71, 71, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-02-05 21:34:42,853 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable4 [2025-02-05 21:34:42,853 INFO L396 AbstractCegarLoop]: === Iteration 6 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-02-05 21:34:42,853 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-02-05 21:34:42,853 INFO L85 PathProgramCache]: Analyzing trace with hash -547920892, now seen corresponding path program 1 times [2025-02-05 21:34:42,854 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-02-05 21:34:42,854 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1795711777] [2025-02-05 21:34:42,854 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-02-05 21:34:42,854 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-02-05 21:34:42,872 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 446 statements into 1 equivalence classes. [2025-02-05 21:34:42,905 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 446 of 446 statements. [2025-02-05 21:34:42,905 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-02-05 21:34:42,906 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-02-05 21:34:43,158 INFO L134 CoverageAnalysis]: Checked inductivity of 9940 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 9940 trivial. 0 not checked. [2025-02-05 21:34:43,159 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-02-05 21:34:43,159 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1795711777] [2025-02-05 21:34:43,159 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1795711777] provided 1 perfect and 0 imperfect interpolant sequences [2025-02-05 21:34:43,159 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-02-05 21:34:43,159 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2025-02-05 21:34:43,159 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1692901193] [2025-02-05 21:34:43,159 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-02-05 21:34:43,160 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2025-02-05 21:34:43,160 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-02-05 21:34:43,160 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2025-02-05 21:34:43,160 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2025-02-05 21:34:43,160 INFO L87 Difference]: Start difference. First operand 1243 states and 2066 transitions. Second operand has 5 states, 5 states have (on average 18.8) internal successors, (94), 5 states have internal predecessors, (94), 1 states have call successors, (71), 1 states have call predecessors, (71), 1 states have return successors, (71), 1 states have call predecessors, (71), 1 states have call successors, (71) [2025-02-05 21:34:43,691 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-02-05 21:34:43,692 INFO L93 Difference]: Finished difference Result 3700 states and 6145 transitions. [2025-02-05 21:34:43,692 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2025-02-05 21:34:43,692 INFO L78 Accepts]: Start accepts. Automaton has has 5 states, 5 states have (on average 18.8) internal successors, (94), 5 states have internal predecessors, (94), 1 states have call successors, (71), 1 states have call predecessors, (71), 1 states have return successors, (71), 1 states have call predecessors, (71), 1 states have call successors, (71) Word has length 446 [2025-02-05 21:34:43,694 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-02-05 21:34:43,705 INFO L225 Difference]: With dead ends: 3700 [2025-02-05 21:34:43,705 INFO L226 Difference]: Without dead ends: 2460 [2025-02-05 21:34:43,708 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-02-05 21:34:43,709 INFO L435 NwaCegarLoop]: 718 mSDtfsCounter, 461 mSDsluCounter, 809 mSDsCounter, 0 mSdLazyCounter, 385 mSolverCounterSat, 143 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.3s Time, 0 mProtectedPredicate, 0 mProtectedAction, 461 SdHoareTripleChecker+Valid, 1527 SdHoareTripleChecker+Invalid, 528 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 143 IncrementalHoareTripleChecker+Valid, 385 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.4s IncrementalHoareTripleChecker+Time [2025-02-05 21:34:43,710 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [461 Valid, 1527 Invalid, 528 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [143 Valid, 385 Invalid, 0 Unknown, 0 Unchecked, 0.4s Time] [2025-02-05 21:34:43,711 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 2460 states. [2025-02-05 21:34:43,799 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 2460 to 1259. [2025-02-05 21:34:43,801 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 1259 states, 1010 states have (on average 1.5861386138613862) internal successors, (1602), 1016 states have internal predecessors, (1602), 240 states have call successors, (240), 8 states have call predecessors, (240), 8 states have return successors, (240), 234 states have call predecessors, (240), 240 states have call successors, (240) [2025-02-05 21:34:43,806 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1259 states to 1259 states and 2082 transitions. [2025-02-05 21:34:43,807 INFO L78 Accepts]: Start accepts. Automaton has 1259 states and 2082 transitions. Word has length 446 [2025-02-05 21:34:43,808 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-02-05 21:34:43,808 INFO L471 AbstractCegarLoop]: Abstraction has 1259 states and 2082 transitions. [2025-02-05 21:34:43,808 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 18.8) internal successors, (94), 5 states have internal predecessors, (94), 1 states have call successors, (71), 1 states have call predecessors, (71), 1 states have return successors, (71), 1 states have call predecessors, (71), 1 states have call successors, (71) [2025-02-05 21:34:43,808 INFO L276 IsEmpty]: Start isEmpty. Operand 1259 states and 2082 transitions. [2025-02-05 21:34:43,812 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 448 [2025-02-05 21:34:43,812 INFO L210 NwaCegarLoop]: Found error trace [2025-02-05 21:34:43,812 INFO L218 NwaCegarLoop]: trace histogram [71, 71, 71, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-02-05 21:34:43,812 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable5 [2025-02-05 21:34:43,812 INFO L396 AbstractCegarLoop]: === Iteration 7 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-02-05 21:34:43,813 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-02-05 21:34:43,813 INFO L85 PathProgramCache]: Analyzing trace with hash 256456183, now seen corresponding path program 1 times [2025-02-05 21:34:43,813 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-02-05 21:34:43,813 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [786744332] [2025-02-05 21:34:43,813 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-02-05 21:34:43,813 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-02-05 21:34:43,830 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 447 statements into 1 equivalence classes. [2025-02-05 21:34:43,886 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 447 of 447 statements. [2025-02-05 21:34:43,887 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-02-05 21:34:43,887 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-02-05 21:34:44,250 INFO L134 CoverageAnalysis]: Checked inductivity of 9940 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 9940 trivial. 0 not checked. [2025-02-05 21:34:44,251 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-02-05 21:34:44,251 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [786744332] [2025-02-05 21:34:44,251 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [786744332] provided 1 perfect and 0 imperfect interpolant sequences [2025-02-05 21:34:44,251 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-02-05 21:34:44,251 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2025-02-05 21:34:44,251 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [100026339] [2025-02-05 21:34:44,251 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-02-05 21:34:44,251 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2025-02-05 21:34:44,251 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-02-05 21:34:44,252 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2025-02-05 21:34:44,252 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-02-05 21:34:44,252 INFO L87 Difference]: Start difference. First operand 1259 states and 2082 transitions. Second operand has 3 states, 3 states have (on average 31.666666666666668) internal successors, (95), 3 states have internal predecessors, (95), 2 states have call successors, (71), 1 states have call predecessors, (71), 1 states have return successors, (71), 2 states have call predecessors, (71), 2 states have call successors, (71) [2025-02-05 21:34:44,361 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-02-05 21:34:44,361 INFO L93 Difference]: Finished difference Result 2515 states and 4161 transitions. [2025-02-05 21:34:44,362 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2025-02-05 21:34:44,362 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 31.666666666666668) internal successors, (95), 3 states have internal predecessors, (95), 2 states have call successors, (71), 1 states have call predecessors, (71), 1 states have return successors, (71), 2 states have call predecessors, (71), 2 states have call successors, (71) Word has length 447 [2025-02-05 21:34:44,362 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-02-05 21:34:44,376 INFO L225 Difference]: With dead ends: 2515 [2025-02-05 21:34:44,376 INFO L226 Difference]: Without dead ends: 1259 [2025-02-05 21:34:44,383 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 3 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-02-05 21:34:44,383 INFO L435 NwaCegarLoop]: 362 mSDtfsCounter, 321 mSDsluCounter, 0 mSDsCounter, 0 mSdLazyCounter, 19 mSolverCounterSat, 1 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 321 SdHoareTripleChecker+Valid, 362 SdHoareTripleChecker+Invalid, 20 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 1 IncrementalHoareTripleChecker+Valid, 19 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2025-02-05 21:34:44,383 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [321 Valid, 362 Invalid, 20 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [1 Valid, 19 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2025-02-05 21:34:44,384 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1259 states. [2025-02-05 21:34:44,460 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1259 to 1259. [2025-02-05 21:34:44,462 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 1259 states, 1010 states have (on average 1.5782178217821783) internal successors, (1594), 1016 states have internal predecessors, (1594), 240 states have call successors, (240), 8 states have call predecessors, (240), 8 states have return successors, (240), 234 states have call predecessors, (240), 240 states have call successors, (240) [2025-02-05 21:34:44,466 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1259 states to 1259 states and 2074 transitions. [2025-02-05 21:34:44,467 INFO L78 Accepts]: Start accepts. Automaton has 1259 states and 2074 transitions. Word has length 447 [2025-02-05 21:34:44,468 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-02-05 21:34:44,468 INFO L471 AbstractCegarLoop]: Abstraction has 1259 states and 2074 transitions. [2025-02-05 21:34:44,468 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 31.666666666666668) internal successors, (95), 3 states have internal predecessors, (95), 2 states have call successors, (71), 1 states have call predecessors, (71), 1 states have return successors, (71), 2 states have call predecessors, (71), 2 states have call successors, (71) [2025-02-05 21:34:44,468 INFO L276 IsEmpty]: Start isEmpty. Operand 1259 states and 2074 transitions. [2025-02-05 21:34:44,470 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 448 [2025-02-05 21:34:44,470 INFO L210 NwaCegarLoop]: Found error trace [2025-02-05 21:34:44,471 INFO L218 NwaCegarLoop]: trace histogram [71, 71, 71, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-02-05 21:34:44,471 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable6 [2025-02-05 21:34:44,471 INFO L396 AbstractCegarLoop]: === Iteration 8 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-02-05 21:34:44,471 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-02-05 21:34:44,471 INFO L85 PathProgramCache]: Analyzing trace with hash 267772310, now seen corresponding path program 1 times [2025-02-05 21:34:44,471 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-02-05 21:34:44,471 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1026670958] [2025-02-05 21:34:44,472 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-02-05 21:34:44,472 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-02-05 21:34:44,488 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 447 statements into 1 equivalence classes. [2025-02-05 21:34:44,626 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 447 of 447 statements. [2025-02-05 21:34:44,626 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-02-05 21:34:44,626 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-02-05 21:34:45,141 INFO L134 CoverageAnalysis]: Checked inductivity of 9940 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 9940 trivial. 0 not checked. [2025-02-05 21:34:45,141 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-02-05 21:34:45,141 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1026670958] [2025-02-05 21:34:45,142 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1026670958] provided 1 perfect and 0 imperfect interpolant sequences [2025-02-05 21:34:45,142 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-02-05 21:34:45,142 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2025-02-05 21:34:45,142 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [526924342] [2025-02-05 21:34:45,142 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-02-05 21:34:45,142 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2025-02-05 21:34:45,142 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-02-05 21:34:45,143 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2025-02-05 21:34:45,143 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2025-02-05 21:34:45,143 INFO L87 Difference]: Start difference. First operand 1259 states and 2074 transitions. Second operand has 4 states, 4 states have (on average 23.75) internal successors, (95), 4 states have internal predecessors, (95), 1 states have call successors, (71), 1 states have call predecessors, (71), 1 states have return successors, (71), 1 states have call predecessors, (71), 1 states have call successors, (71) [2025-02-05 21:34:45,626 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-02-05 21:34:45,626 INFO L93 Difference]: Finished difference Result 3176 states and 5221 transitions. [2025-02-05 21:34:45,627 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2025-02-05 21:34:45,627 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 4 states have (on average 23.75) internal successors, (95), 4 states have internal predecessors, (95), 1 states have call successors, (71), 1 states have call predecessors, (71), 1 states have return successors, (71), 1 states have call predecessors, (71), 1 states have call successors, (71) Word has length 447 [2025-02-05 21:34:45,628 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-02-05 21:34:45,635 INFO L225 Difference]: With dead ends: 3176 [2025-02-05 21:34:45,636 INFO L226 Difference]: Without dead ends: 1920 [2025-02-05 21:34:45,639 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 7 GetRequests, 4 SyntacticMatches, 0 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=9, Invalid=11, Unknown=0, NotChecked=0, Total=20 [2025-02-05 21:34:45,639 INFO L435 NwaCegarLoop]: 354 mSDtfsCounter, 349 mSDsluCounter, 696 mSDsCounter, 0 mSdLazyCounter, 87 mSolverCounterSat, 214 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.3s Time, 0 mProtectedPredicate, 0 mProtectedAction, 349 SdHoareTripleChecker+Valid, 1050 SdHoareTripleChecker+Invalid, 301 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 214 IncrementalHoareTripleChecker+Valid, 87 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.4s IncrementalHoareTripleChecker+Time [2025-02-05 21:34:45,639 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [349 Valid, 1050 Invalid, 301 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [214 Valid, 87 Invalid, 0 Unknown, 0 Unchecked, 0.4s Time] [2025-02-05 21:34:45,641 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1920 states. [2025-02-05 21:34:45,787 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1920 to 1702. [2025-02-05 21:34:45,790 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 1702 states, 1381 states have (on average 1.5923244026068066) internal successors, (2199), 1387 states have internal predecessors, (2199), 311 states have call successors, (311), 9 states have call predecessors, (311), 9 states have return successors, (311), 305 states have call predecessors, (311), 311 states have call successors, (311) [2025-02-05 21:34:45,801 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1702 states to 1702 states and 2821 transitions. [2025-02-05 21:34:45,803 INFO L78 Accepts]: Start accepts. Automaton has 1702 states and 2821 transitions. Word has length 447 [2025-02-05 21:34:45,803 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-02-05 21:34:45,803 INFO L471 AbstractCegarLoop]: Abstraction has 1702 states and 2821 transitions. [2025-02-05 21:34:45,804 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 23.75) internal successors, (95), 4 states have internal predecessors, (95), 1 states have call successors, (71), 1 states have call predecessors, (71), 1 states have return successors, (71), 1 states have call predecessors, (71), 1 states have call successors, (71) [2025-02-05 21:34:45,804 INFO L276 IsEmpty]: Start isEmpty. Operand 1702 states and 2821 transitions. [2025-02-05 21:34:45,807 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 448 [2025-02-05 21:34:45,808 INFO L210 NwaCegarLoop]: Found error trace [2025-02-05 21:34:45,808 INFO L218 NwaCegarLoop]: trace histogram [71, 71, 71, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-02-05 21:34:45,808 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable7 [2025-02-05 21:34:45,808 INFO L396 AbstractCegarLoop]: === Iteration 9 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-02-05 21:34:45,809 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-02-05 21:34:45,809 INFO L85 PathProgramCache]: Analyzing trace with hash 773330935, now seen corresponding path program 1 times [2025-02-05 21:34:45,809 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-02-05 21:34:45,809 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1835329726] [2025-02-05 21:34:45,809 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-02-05 21:34:45,809 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-02-05 21:34:45,832 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 447 statements into 1 equivalence classes. [2025-02-05 21:34:45,928 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 447 of 447 statements. [2025-02-05 21:34:45,928 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-02-05 21:34:45,928 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-02-05 21:34:47,859 INFO L134 CoverageAnalysis]: Checked inductivity of 9940 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 9940 trivial. 0 not checked. [2025-02-05 21:34:47,860 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-02-05 21:34:47,860 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1835329726] [2025-02-05 21:34:47,860 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1835329726] provided 1 perfect and 0 imperfect interpolant sequences [2025-02-05 21:34:47,860 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-02-05 21:34:47,860 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2025-02-05 21:34:47,860 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1600970640] [2025-02-05 21:34:47,860 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-02-05 21:34:47,861 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2025-02-05 21:34:47,861 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-02-05 21:34:47,861 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2025-02-05 21:34:47,861 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=10, Invalid=20, Unknown=0, NotChecked=0, Total=30 [2025-02-05 21:34:47,861 INFO L87 Difference]: Start difference. First operand 1702 states and 2821 transitions. Second operand has 6 states, 6 states have (on average 15.833333333333334) internal successors, (95), 6 states have internal predecessors, (95), 1 states have call successors, (71), 1 states have call predecessors, (71), 1 states have return successors, (71), 1 states have call predecessors, (71), 1 states have call successors, (71) [2025-02-05 21:34:48,552 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-02-05 21:34:48,552 INFO L93 Difference]: Finished difference Result 3208 states and 5261 transitions. [2025-02-05 21:34:48,553 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2025-02-05 21:34:48,553 INFO L78 Accepts]: Start accepts. Automaton has has 6 states, 6 states have (on average 15.833333333333334) internal successors, (95), 6 states have internal predecessors, (95), 1 states have call successors, (71), 1 states have call predecessors, (71), 1 states have return successors, (71), 1 states have call predecessors, (71), 1 states have call successors, (71) Word has length 447 [2025-02-05 21:34:48,554 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-02-05 21:34:48,562 INFO L225 Difference]: With dead ends: 3208 [2025-02-05 21:34:48,562 INFO L226 Difference]: Without dead ends: 1952 [2025-02-05 21:34:48,565 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 13 GetRequests, 4 SyntacticMatches, 1 SemanticMatches, 8 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 6 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=31, Invalid=59, Unknown=0, NotChecked=0, Total=90 [2025-02-05 21:34:48,568 INFO L435 NwaCegarLoop]: 347 mSDtfsCounter, 415 mSDsluCounter, 920 mSDsCounter, 0 mSdLazyCounter, 288 mSolverCounterSat, 214 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.4s Time, 0 mProtectedPredicate, 0 mProtectedAction, 415 SdHoareTripleChecker+Valid, 1267 SdHoareTripleChecker+Invalid, 502 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 214 IncrementalHoareTripleChecker+Valid, 288 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.5s IncrementalHoareTripleChecker+Time [2025-02-05 21:34:48,569 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [415 Valid, 1267 Invalid, 502 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [214 Valid, 288 Invalid, 0 Unknown, 0 Unchecked, 0.5s Time] [2025-02-05 21:34:48,570 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1952 states. [2025-02-05 21:34:48,671 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1952 to 1726. [2025-02-05 21:34:48,673 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 1726 states, 1405 states have (on average 1.587900355871886) internal successors, (2231), 1411 states have internal predecessors, (2231), 311 states have call successors, (311), 9 states have call predecessors, (311), 9 states have return successors, (311), 305 states have call predecessors, (311), 311 states have call successors, (311) [2025-02-05 21:34:48,678 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1726 states to 1726 states and 2853 transitions. [2025-02-05 21:34:48,680 INFO L78 Accepts]: Start accepts. Automaton has 1726 states and 2853 transitions. Word has length 447 [2025-02-05 21:34:48,681 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-02-05 21:34:48,681 INFO L471 AbstractCegarLoop]: Abstraction has 1726 states and 2853 transitions. [2025-02-05 21:34:48,681 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 6 states have (on average 15.833333333333334) internal successors, (95), 6 states have internal predecessors, (95), 1 states have call successors, (71), 1 states have call predecessors, (71), 1 states have return successors, (71), 1 states have call predecessors, (71), 1 states have call successors, (71) [2025-02-05 21:34:48,681 INFO L276 IsEmpty]: Start isEmpty. Operand 1726 states and 2853 transitions. [2025-02-05 21:34:48,684 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 448 [2025-02-05 21:34:48,684 INFO L210 NwaCegarLoop]: Found error trace [2025-02-05 21:34:48,684 INFO L218 NwaCegarLoop]: trace histogram [71, 71, 71, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-02-05 21:34:48,684 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable8 [2025-02-05 21:34:48,684 INFO L396 AbstractCegarLoop]: === Iteration 10 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-02-05 21:34:48,685 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-02-05 21:34:48,685 INFO L85 PathProgramCache]: Analyzing trace with hash -776243758, now seen corresponding path program 1 times [2025-02-05 21:34:48,685 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-02-05 21:34:48,685 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [175569752] [2025-02-05 21:34:48,685 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-02-05 21:34:48,685 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-02-05 21:34:48,701 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 447 statements into 1 equivalence classes. [2025-02-05 21:34:48,890 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 447 of 447 statements. [2025-02-05 21:34:48,891 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-02-05 21:34:48,891 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-02-05 21:34:52,264 INFO L134 CoverageAnalysis]: Checked inductivity of 9940 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 9940 trivial. 0 not checked. [2025-02-05 21:34:52,264 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-02-05 21:34:52,264 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [175569752] [2025-02-05 21:34:52,264 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [175569752] provided 1 perfect and 0 imperfect interpolant sequences [2025-02-05 21:34:52,264 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-02-05 21:34:52,264 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [12] imperfect sequences [] total 12 [2025-02-05 21:34:52,264 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [132090061] [2025-02-05 21:34:52,265 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-02-05 21:34:52,265 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 12 states [2025-02-05 21:34:52,265 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-02-05 21:34:52,266 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 12 interpolants. [2025-02-05 21:34:52,266 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=34, Invalid=98, Unknown=0, NotChecked=0, Total=132 [2025-02-05 21:34:52,266 INFO L87 Difference]: Start difference. First operand 1726 states and 2853 transitions. Second operand has 12 states, 12 states have (on average 7.916666666666667) internal successors, (95), 12 states have internal predecessors, (95), 1 states have call successors, (71), 1 states have call predecessors, (71), 1 states have return successors, (71), 1 states have call predecessors, (71), 1 states have call successors, (71) [2025-02-05 21:34:57,226 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-02-05 21:34:57,226 INFO L93 Difference]: Finished difference Result 5072 states and 8170 transitions. [2025-02-05 21:34:57,227 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 20 states. [2025-02-05 21:34:57,227 INFO L78 Accepts]: Start accepts. Automaton has has 12 states, 12 states have (on average 7.916666666666667) internal successors, (95), 12 states have internal predecessors, (95), 1 states have call successors, (71), 1 states have call predecessors, (71), 1 states have return successors, (71), 1 states have call predecessors, (71), 1 states have call successors, (71) Word has length 447 [2025-02-05 21:34:57,227 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-02-05 21:34:57,240 INFO L225 Difference]: With dead ends: 5072 [2025-02-05 21:34:57,240 INFO L226 Difference]: Without dead ends: 3816 [2025-02-05 21:34:57,244 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 25 GetRequests, 3 SyntacticMatches, 0 SemanticMatches, 22 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 90 ImplicationChecksByTransitivity, 3.2s TimeCoverageRelationStatistics Valid=168, Invalid=384, Unknown=0, NotChecked=0, Total=552 [2025-02-05 21:34:57,244 INFO L435 NwaCegarLoop]: 368 mSDtfsCounter, 949 mSDsluCounter, 1759 mSDsCounter, 0 mSdLazyCounter, 1270 mSolverCounterSat, 81 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 2.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 949 SdHoareTripleChecker+Valid, 2127 SdHoareTripleChecker+Invalid, 1351 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 81 IncrementalHoareTripleChecker+Valid, 1270 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 2.5s IncrementalHoareTripleChecker+Time [2025-02-05 21:34:57,244 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [949 Valid, 2127 Invalid, 1351 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [81 Valid, 1270 Invalid, 0 Unknown, 0 Unchecked, 2.5s Time] [2025-02-05 21:34:57,246 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 3816 states. [2025-02-05 21:34:57,403 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 3816 to 3076. [2025-02-05 21:34:57,407 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 3076 states, 2499 states have (on average 1.5706282513005203) internal successors, (3925), 2511 states have internal predecessors, (3925), 551 states have call successors, (551), 25 states have call predecessors, (551), 25 states have return successors, (551), 539 states have call predecessors, (551), 551 states have call successors, (551) [2025-02-05 21:34:57,412 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3076 states to 3076 states and 5027 transitions. [2025-02-05 21:34:57,415 INFO L78 Accepts]: Start accepts. Automaton has 3076 states and 5027 transitions. Word has length 447 [2025-02-05 21:34:57,415 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-02-05 21:34:57,415 INFO L471 AbstractCegarLoop]: Abstraction has 3076 states and 5027 transitions. [2025-02-05 21:34:57,416 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 12 states, 12 states have (on average 7.916666666666667) internal successors, (95), 12 states have internal predecessors, (95), 1 states have call successors, (71), 1 states have call predecessors, (71), 1 states have return successors, (71), 1 states have call predecessors, (71), 1 states have call successors, (71) [2025-02-05 21:34:57,416 INFO L276 IsEmpty]: Start isEmpty. Operand 3076 states and 5027 transitions. [2025-02-05 21:34:57,418 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 448 [2025-02-05 21:34:57,418 INFO L210 NwaCegarLoop]: Found error trace [2025-02-05 21:34:57,418 INFO L218 NwaCegarLoop]: trace histogram [71, 71, 71, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-02-05 21:34:57,418 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable9 [2025-02-05 21:34:57,419 INFO L396 AbstractCegarLoop]: === Iteration 11 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-02-05 21:34:57,419 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-02-05 21:34:57,419 INFO L85 PathProgramCache]: Analyzing trace with hash 111259923, now seen corresponding path program 1 times [2025-02-05 21:34:57,419 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-02-05 21:34:57,419 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [355161118] [2025-02-05 21:34:57,420 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-02-05 21:34:57,420 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-02-05 21:34:57,434 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 447 statements into 1 equivalence classes. [2025-02-05 21:34:57,522 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 447 of 447 statements. [2025-02-05 21:34:57,522 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-02-05 21:34:57,522 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-02-05 21:34:59,435 INFO L134 CoverageAnalysis]: Checked inductivity of 9940 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 9940 trivial. 0 not checked. [2025-02-05 21:34:59,436 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-02-05 21:34:59,436 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [355161118] [2025-02-05 21:34:59,436 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [355161118] provided 1 perfect and 0 imperfect interpolant sequences [2025-02-05 21:34:59,436 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-02-05 21:34:59,436 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [9] imperfect sequences [] total 9 [2025-02-05 21:34:59,436 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [395930801] [2025-02-05 21:34:59,436 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-02-05 21:34:59,436 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 9 states [2025-02-05 21:34:59,437 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-02-05 21:34:59,437 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2025-02-05 21:34:59,437 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=16, Invalid=56, Unknown=0, NotChecked=0, Total=72 [2025-02-05 21:34:59,437 INFO L87 Difference]: Start difference. First operand 3076 states and 5027 transitions. Second operand has 9 states, 9 states have (on average 10.555555555555555) internal successors, (95), 9 states have internal predecessors, (95), 1 states have call successors, (71), 1 states have call predecessors, (71), 1 states have return successors, (71), 1 states have call predecessors, (71), 1 states have call successors, (71) [2025-02-05 21:35:01,466 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-02-05 21:35:01,466 INFO L93 Difference]: Finished difference Result 6788 states and 10839 transitions. [2025-02-05 21:35:01,469 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2025-02-05 21:35:01,470 INFO L78 Accepts]: Start accepts. Automaton has has 9 states, 9 states have (on average 10.555555555555555) internal successors, (95), 9 states have internal predecessors, (95), 1 states have call successors, (71), 1 states have call predecessors, (71), 1 states have return successors, (71), 1 states have call predecessors, (71), 1 states have call successors, (71) Word has length 447 [2025-02-05 21:35:01,470 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-02-05 21:35:01,486 INFO L225 Difference]: With dead ends: 6788 [2025-02-05 21:35:01,487 INFO L226 Difference]: Without dead ends: 4182 [2025-02-05 21:35:01,494 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 18 GetRequests, 5 SyntacticMatches, 0 SemanticMatches, 13 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 18 ImplicationChecksByTransitivity, 0.7s TimeCoverageRelationStatistics Valid=58, Invalid=152, Unknown=0, NotChecked=0, Total=210 [2025-02-05 21:35:01,495 INFO L435 NwaCegarLoop]: 338 mSDtfsCounter, 568 mSDsluCounter, 1666 mSDsCounter, 0 mSdLazyCounter, 1062 mSolverCounterSat, 222 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 1.3s Time, 0 mProtectedPredicate, 0 mProtectedAction, 568 SdHoareTripleChecker+Valid, 2004 SdHoareTripleChecker+Invalid, 1284 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 222 IncrementalHoareTripleChecker+Valid, 1062 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 1.5s IncrementalHoareTripleChecker+Time [2025-02-05 21:35:01,495 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [568 Valid, 2004 Invalid, 1284 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [222 Valid, 1062 Invalid, 0 Unknown, 0 Unchecked, 1.5s Time] [2025-02-05 21:35:01,498 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 4182 states. [2025-02-05 21:35:01,670 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 4182 to 3288. [2025-02-05 21:35:01,678 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 3288 states, 2711 states have (on average 1.5525636296569532) internal successors, (4209), 2723 states have internal predecessors, (4209), 551 states have call successors, (551), 25 states have call predecessors, (551), 25 states have return successors, (551), 539 states have call predecessors, (551), 551 states have call successors, (551) [2025-02-05 21:35:01,686 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3288 states to 3288 states and 5311 transitions. [2025-02-05 21:35:01,690 INFO L78 Accepts]: Start accepts. Automaton has 3288 states and 5311 transitions. Word has length 447 [2025-02-05 21:35:01,690 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-02-05 21:35:01,691 INFO L471 AbstractCegarLoop]: Abstraction has 3288 states and 5311 transitions. [2025-02-05 21:35:01,691 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 9 states, 9 states have (on average 10.555555555555555) internal successors, (95), 9 states have internal predecessors, (95), 1 states have call successors, (71), 1 states have call predecessors, (71), 1 states have return successors, (71), 1 states have call predecessors, (71), 1 states have call successors, (71) [2025-02-05 21:35:01,691 INFO L276 IsEmpty]: Start isEmpty. Operand 3288 states and 5311 transitions. [2025-02-05 21:35:01,694 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 448 [2025-02-05 21:35:01,694 INFO L210 NwaCegarLoop]: Found error trace [2025-02-05 21:35:01,694 INFO L218 NwaCegarLoop]: trace histogram [71, 71, 71, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-02-05 21:35:01,694 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable10 [2025-02-05 21:35:01,694 INFO L396 AbstractCegarLoop]: === Iteration 12 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-02-05 21:35:01,695 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-02-05 21:35:01,695 INFO L85 PathProgramCache]: Analyzing trace with hash 1711269075, now seen corresponding path program 1 times [2025-02-05 21:35:01,695 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-02-05 21:35:01,695 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2113244493] [2025-02-05 21:35:01,695 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-02-05 21:35:01,695 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-02-05 21:35:01,712 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 447 statements into 1 equivalence classes. [2025-02-05 21:35:01,813 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 447 of 447 statements. [2025-02-05 21:35:01,813 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-02-05 21:35:01,813 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-02-05 21:35:03,845 INFO L134 CoverageAnalysis]: Checked inductivity of 9940 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 9940 trivial. 0 not checked. [2025-02-05 21:35:03,846 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-02-05 21:35:03,846 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2113244493] [2025-02-05 21:35:03,846 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [2113244493] provided 1 perfect and 0 imperfect interpolant sequences [2025-02-05 21:35:03,846 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-02-05 21:35:03,846 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [9] imperfect sequences [] total 9 [2025-02-05 21:35:03,846 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [311016469] [2025-02-05 21:35:03,846 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-02-05 21:35:03,847 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 9 states [2025-02-05 21:35:03,847 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-02-05 21:35:03,847 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2025-02-05 21:35:03,847 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=16, Invalid=56, Unknown=0, NotChecked=0, Total=72 [2025-02-05 21:35:03,848 INFO L87 Difference]: Start difference. First operand 3288 states and 5311 transitions. Second operand has 9 states, 9 states have (on average 10.555555555555555) internal successors, (95), 9 states have internal predecessors, (95), 1 states have call successors, (71), 1 states have call predecessors, (71), 1 states have return successors, (71), 1 states have call predecessors, (71), 1 states have call successors, (71) [2025-02-05 21:35:05,393 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-02-05 21:35:05,393 INFO L93 Difference]: Finished difference Result 7092 states and 11187 transitions. [2025-02-05 21:35:05,394 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2025-02-05 21:35:05,394 INFO L78 Accepts]: Start accepts. Automaton has has 9 states, 9 states have (on average 10.555555555555555) internal successors, (95), 9 states have internal predecessors, (95), 1 states have call successors, (71), 1 states have call predecessors, (71), 1 states have return successors, (71), 1 states have call predecessors, (71), 1 states have call successors, (71) Word has length 447 [2025-02-05 21:35:05,394 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-02-05 21:35:05,419 INFO L225 Difference]: With dead ends: 7092 [2025-02-05 21:35:05,425 INFO L226 Difference]: Without dead ends: 4282 [2025-02-05 21:35:05,433 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 17 GetRequests, 4 SyntacticMatches, 0 SemanticMatches, 13 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 18 ImplicationChecksByTransitivity, 0.7s TimeCoverageRelationStatistics Valid=58, Invalid=152, Unknown=0, NotChecked=0, Total=210 [2025-02-05 21:35:05,433 INFO L435 NwaCegarLoop]: 342 mSDtfsCounter, 543 mSDsluCounter, 1474 mSDsCounter, 0 mSdLazyCounter, 869 mSolverCounterSat, 222 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.9s Time, 0 mProtectedPredicate, 0 mProtectedAction, 543 SdHoareTripleChecker+Valid, 1816 SdHoareTripleChecker+Invalid, 1091 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 222 IncrementalHoareTripleChecker+Valid, 869 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 1.0s IncrementalHoareTripleChecker+Time [2025-02-05 21:35:05,433 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [543 Valid, 1816 Invalid, 1091 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [222 Valid, 869 Invalid, 0 Unknown, 0 Unchecked, 1.0s Time] [2025-02-05 21:35:05,441 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 4282 states. [2025-02-05 21:35:05,628 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 4282 to 3788. [2025-02-05 21:35:05,634 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 3788 states, 3211 states have (on average 1.5213329180940518) internal successors, (4885), 3223 states have internal predecessors, (4885), 551 states have call successors, (551), 25 states have call predecessors, (551), 25 states have return successors, (551), 539 states have call predecessors, (551), 551 states have call successors, (551) [2025-02-05 21:35:05,643 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3788 states to 3788 states and 5987 transitions. [2025-02-05 21:35:05,649 INFO L78 Accepts]: Start accepts. Automaton has 3788 states and 5987 transitions. Word has length 447 [2025-02-05 21:35:05,649 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-02-05 21:35:05,649 INFO L471 AbstractCegarLoop]: Abstraction has 3788 states and 5987 transitions. [2025-02-05 21:35:05,650 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 9 states, 9 states have (on average 10.555555555555555) internal successors, (95), 9 states have internal predecessors, (95), 1 states have call successors, (71), 1 states have call predecessors, (71), 1 states have return successors, (71), 1 states have call predecessors, (71), 1 states have call successors, (71) [2025-02-05 21:35:05,650 INFO L276 IsEmpty]: Start isEmpty. Operand 3788 states and 5987 transitions. [2025-02-05 21:35:05,654 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 449 [2025-02-05 21:35:05,654 INFO L210 NwaCegarLoop]: Found error trace [2025-02-05 21:35:05,654 INFO L218 NwaCegarLoop]: trace histogram [71, 71, 71, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-02-05 21:35:05,654 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable11 [2025-02-05 21:35:05,654 INFO L396 AbstractCegarLoop]: === Iteration 13 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-02-05 21:35:05,655 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-02-05 21:35:05,655 INFO L85 PathProgramCache]: Analyzing trace with hash 2117658016, now seen corresponding path program 1 times [2025-02-05 21:35:05,655 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-02-05 21:35:05,655 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [306500835] [2025-02-05 21:35:05,656 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-02-05 21:35:05,656 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-02-05 21:35:05,670 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 448 statements into 1 equivalence classes. [2025-02-05 21:35:05,747 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 448 of 448 statements. [2025-02-05 21:35:05,748 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-02-05 21:35:05,748 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-02-05 21:35:07,820 INFO L134 CoverageAnalysis]: Checked inductivity of 9940 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 9940 trivial. 0 not checked. [2025-02-05 21:35:07,821 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-02-05 21:35:07,821 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [306500835] [2025-02-05 21:35:07,821 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [306500835] provided 1 perfect and 0 imperfect interpolant sequences [2025-02-05 21:35:07,821 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-02-05 21:35:07,821 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [9] imperfect sequences [] total 9 [2025-02-05 21:35:07,821 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [533221023] [2025-02-05 21:35:07,821 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-02-05 21:35:07,821 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 9 states [2025-02-05 21:35:07,821 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-02-05 21:35:07,822 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2025-02-05 21:35:07,822 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=26, Invalid=46, Unknown=0, NotChecked=0, Total=72 [2025-02-05 21:35:07,822 INFO L87 Difference]: Start difference. First operand 3788 states and 5987 transitions. Second operand has 9 states, 9 states have (on average 10.666666666666666) internal successors, (96), 9 states have internal predecessors, (96), 1 states have call successors, (71), 1 states have call predecessors, (71), 1 states have return successors, (71), 1 states have call predecessors, (71), 1 states have call successors, (71) [2025-02-05 21:35:09,335 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-02-05 21:35:09,335 INFO L93 Difference]: Finished difference Result 5894 states and 9251 transitions. [2025-02-05 21:35:09,336 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 14 states. [2025-02-05 21:35:09,336 INFO L78 Accepts]: Start accepts. Automaton has has 9 states, 9 states have (on average 10.666666666666666) internal successors, (96), 9 states have internal predecessors, (96), 1 states have call successors, (71), 1 states have call predecessors, (71), 1 states have return successors, (71), 1 states have call predecessors, (71), 1 states have call successors, (71) Word has length 448 [2025-02-05 21:35:09,336 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-02-05 21:35:09,371 INFO L225 Difference]: With dead ends: 5894 [2025-02-05 21:35:09,371 INFO L226 Difference]: Without dead ends: 4638 [2025-02-05 21:35:09,373 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 15 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 13 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 13 ImplicationChecksByTransitivity, 1.4s TimeCoverageRelationStatistics Valid=80, Invalid=130, Unknown=0, NotChecked=0, Total=210 [2025-02-05 21:35:09,374 INFO L435 NwaCegarLoop]: 384 mSDtfsCounter, 270 mSDsluCounter, 1407 mSDsCounter, 0 mSdLazyCounter, 365 mSolverCounterSat, 3 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.6s Time, 0 mProtectedPredicate, 0 mProtectedAction, 270 SdHoareTripleChecker+Valid, 1791 SdHoareTripleChecker+Invalid, 368 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 3 IncrementalHoareTripleChecker+Valid, 365 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.7s IncrementalHoareTripleChecker+Time [2025-02-05 21:35:09,374 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [270 Valid, 1791 Invalid, 368 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [3 Valid, 365 Invalid, 0 Unknown, 0 Unchecked, 0.7s Time] [2025-02-05 21:35:09,377 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 4638 states. [2025-02-05 21:35:09,543 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 4638 to 3740. [2025-02-05 21:35:09,547 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 3740 states, 3155 states have (on average 1.5153724247226625) internal successors, (4781), 3167 states have internal predecessors, (4781), 551 states have call successors, (551), 33 states have call predecessors, (551), 33 states have return successors, (551), 539 states have call predecessors, (551), 551 states have call successors, (551) [2025-02-05 21:35:09,552 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3740 states to 3740 states and 5883 transitions. [2025-02-05 21:35:09,555 INFO L78 Accepts]: Start accepts. Automaton has 3740 states and 5883 transitions. Word has length 448 [2025-02-05 21:35:09,555 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-02-05 21:35:09,555 INFO L471 AbstractCegarLoop]: Abstraction has 3740 states and 5883 transitions. [2025-02-05 21:35:09,555 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 9 states, 9 states have (on average 10.666666666666666) internal successors, (96), 9 states have internal predecessors, (96), 1 states have call successors, (71), 1 states have call predecessors, (71), 1 states have return successors, (71), 1 states have call predecessors, (71), 1 states have call successors, (71) [2025-02-05 21:35:09,556 INFO L276 IsEmpty]: Start isEmpty. Operand 3740 states and 5883 transitions. [2025-02-05 21:35:09,558 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 449 [2025-02-05 21:35:09,558 INFO L210 NwaCegarLoop]: Found error trace [2025-02-05 21:35:09,559 INFO L218 NwaCegarLoop]: trace histogram [71, 71, 71, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-02-05 21:35:09,559 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable12 [2025-02-05 21:35:09,559 INFO L396 AbstractCegarLoop]: === Iteration 14 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-02-05 21:35:09,559 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-02-05 21:35:09,559 INFO L85 PathProgramCache]: Analyzing trace with hash 779457339, now seen corresponding path program 1 times [2025-02-05 21:35:09,559 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-02-05 21:35:09,559 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [98699488] [2025-02-05 21:35:09,559 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-02-05 21:35:09,560 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-02-05 21:35:09,576 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 448 statements into 1 equivalence classes. [2025-02-05 21:35:09,661 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 448 of 448 statements. [2025-02-05 21:35:09,661 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-02-05 21:35:09,661 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-02-05 21:35:16,094 INFO L134 CoverageAnalysis]: Checked inductivity of 9940 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 9940 trivial. 0 not checked. [2025-02-05 21:35:16,094 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-02-05 21:35:16,095 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [98699488] [2025-02-05 21:35:16,095 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [98699488] provided 1 perfect and 0 imperfect interpolant sequences [2025-02-05 21:35:16,095 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-02-05 21:35:16,095 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [14] imperfect sequences [] total 14 [2025-02-05 21:35:16,095 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1680704482] [2025-02-05 21:35:16,095 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-02-05 21:35:16,096 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 14 states [2025-02-05 21:35:16,096 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-02-05 21:35:16,096 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 14 interpolants. [2025-02-05 21:35:16,096 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=32, Invalid=150, Unknown=0, NotChecked=0, Total=182 [2025-02-05 21:35:16,097 INFO L87 Difference]: Start difference. First operand 3740 states and 5883 transitions. Second operand has 14 states, 14 states have (on average 6.857142857142857) internal successors, (96), 14 states have internal predecessors, (96), 1 states have call successors, (71), 1 states have call predecessors, (71), 1 states have return successors, (71), 1 states have call predecessors, (71), 1 states have call successors, (71) [2025-02-05 21:35:18,385 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-02-05 21:35:18,385 INFO L93 Difference]: Finished difference Result 7290 states and 11356 transitions. [2025-02-05 21:35:18,385 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 15 states. [2025-02-05 21:35:18,386 INFO L78 Accepts]: Start accepts. Automaton has has 14 states, 14 states have (on average 6.857142857142857) internal successors, (96), 14 states have internal predecessors, (96), 1 states have call successors, (71), 1 states have call predecessors, (71), 1 states have return successors, (71), 1 states have call predecessors, (71), 1 states have call successors, (71) Word has length 448 [2025-02-05 21:35:18,386 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-02-05 21:35:18,395 INFO L225 Difference]: With dead ends: 7290 [2025-02-05 21:35:18,395 INFO L226 Difference]: Without dead ends: 4160 [2025-02-05 21:35:18,399 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 28 GetRequests, 5 SyntacticMatches, 0 SemanticMatches, 23 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 75 ImplicationChecksByTransitivity, 1.7s TimeCoverageRelationStatistics Valid=140, Invalid=460, Unknown=0, NotChecked=0, Total=600 [2025-02-05 21:35:18,399 INFO L435 NwaCegarLoop]: 385 mSDtfsCounter, 563 mSDsluCounter, 2326 mSDsCounter, 0 mSdLazyCounter, 1567 mSolverCounterSat, 232 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 1.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 563 SdHoareTripleChecker+Valid, 2711 SdHoareTripleChecker+Invalid, 1799 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 232 IncrementalHoareTripleChecker+Valid, 1567 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 1.4s IncrementalHoareTripleChecker+Time [2025-02-05 21:35:18,399 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [563 Valid, 2711 Invalid, 1799 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [232 Valid, 1567 Invalid, 0 Unknown, 0 Unchecked, 1.4s Time] [2025-02-05 21:35:18,401 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 4160 states. [2025-02-05 21:35:18,542 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 4160 to 3784. [2025-02-05 21:35:18,546 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 3784 states, 3199 states have (on average 1.5107846201938107) internal successors, (4833), 3211 states have internal predecessors, (4833), 551 states have call successors, (551), 33 states have call predecessors, (551), 33 states have return successors, (551), 539 states have call predecessors, (551), 551 states have call successors, (551) [2025-02-05 21:35:18,552 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3784 states to 3784 states and 5935 transitions. [2025-02-05 21:35:18,555 INFO L78 Accepts]: Start accepts. Automaton has 3784 states and 5935 transitions. Word has length 448 [2025-02-05 21:35:18,555 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-02-05 21:35:18,555 INFO L471 AbstractCegarLoop]: Abstraction has 3784 states and 5935 transitions. [2025-02-05 21:35:18,556 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 14 states, 14 states have (on average 6.857142857142857) internal successors, (96), 14 states have internal predecessors, (96), 1 states have call successors, (71), 1 states have call predecessors, (71), 1 states have return successors, (71), 1 states have call predecessors, (71), 1 states have call successors, (71) [2025-02-05 21:35:18,556 INFO L276 IsEmpty]: Start isEmpty. Operand 3784 states and 5935 transitions. [2025-02-05 21:35:18,559 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 450 [2025-02-05 21:35:18,559 INFO L210 NwaCegarLoop]: Found error trace [2025-02-05 21:35:18,560 INFO L218 NwaCegarLoop]: trace histogram [71, 71, 71, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-02-05 21:35:18,560 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable13 [2025-02-05 21:35:18,560 INFO L396 AbstractCegarLoop]: === Iteration 15 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-02-05 21:35:18,560 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-02-05 21:35:18,560 INFO L85 PathProgramCache]: Analyzing trace with hash -264550986, now seen corresponding path program 1 times [2025-02-05 21:35:18,561 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-02-05 21:35:18,561 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [80497098] [2025-02-05 21:35:18,561 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-02-05 21:35:18,561 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-02-05 21:35:18,575 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 449 statements into 1 equivalence classes. [2025-02-05 21:35:18,671 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 449 of 449 statements. [2025-02-05 21:35:18,672 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-02-05 21:35:18,672 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-02-05 21:35:21,529 INFO L134 CoverageAnalysis]: Checked inductivity of 9940 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 9940 trivial. 0 not checked. [2025-02-05 21:35:21,530 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-02-05 21:35:21,530 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [80497098] [2025-02-05 21:35:21,530 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [80497098] provided 1 perfect and 0 imperfect interpolant sequences [2025-02-05 21:35:21,531 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-02-05 21:35:21,531 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [10] imperfect sequences [] total 10 [2025-02-05 21:35:21,531 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [867344467] [2025-02-05 21:35:21,531 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-02-05 21:35:21,532 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 10 states [2025-02-05 21:35:21,532 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-02-05 21:35:21,532 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 10 interpolants. [2025-02-05 21:35:21,532 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=29, Invalid=61, Unknown=0, NotChecked=0, Total=90 [2025-02-05 21:35:21,532 INFO L87 Difference]: Start difference. First operand 3784 states and 5935 transitions. Second operand has 10 states, 10 states have (on average 9.7) internal successors, (97), 10 states have internal predecessors, (97), 1 states have call successors, (71), 1 states have call predecessors, (71), 1 states have return successors, (71), 1 states have call predecessors, (71), 1 states have call successors, (71) [2025-02-05 21:35:23,389 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-02-05 21:35:23,390 INFO L93 Difference]: Finished difference Result 6410 states and 9935 transitions. [2025-02-05 21:35:23,390 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 16 states. [2025-02-05 21:35:23,390 INFO L78 Accepts]: Start accepts. Automaton has has 10 states, 10 states have (on average 9.7) internal successors, (97), 10 states have internal predecessors, (97), 1 states have call successors, (71), 1 states have call predecessors, (71), 1 states have return successors, (71), 1 states have call predecessors, (71), 1 states have call successors, (71) Word has length 449 [2025-02-05 21:35:23,391 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-02-05 21:35:23,414 INFO L225 Difference]: With dead ends: 6410 [2025-02-05 21:35:23,417 INFO L226 Difference]: Without dead ends: 5090 [2025-02-05 21:35:23,425 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 18 GetRequests, 3 SyntacticMatches, 0 SemanticMatches, 15 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 28 ImplicationChecksByTransitivity, 1.7s TimeCoverageRelationStatistics Valid=85, Invalid=187, Unknown=0, NotChecked=0, Total=272 [2025-02-05 21:35:23,426 INFO L435 NwaCegarLoop]: 372 mSDtfsCounter, 233 mSDsluCounter, 2691 mSDsCounter, 0 mSdLazyCounter, 514 mSolverCounterSat, 3 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.9s Time, 0 mProtectedPredicate, 0 mProtectedAction, 233 SdHoareTripleChecker+Valid, 3063 SdHoareTripleChecker+Invalid, 517 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 3 IncrementalHoareTripleChecker+Valid, 514 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.9s IncrementalHoareTripleChecker+Time [2025-02-05 21:35:23,427 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [233 Valid, 3063 Invalid, 517 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [3 Valid, 514 Invalid, 0 Unknown, 0 Unchecked, 0.9s Time] [2025-02-05 21:35:23,434 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 5090 states. [2025-02-05 21:35:23,593 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 5090 to 2402. [2025-02-05 21:35:23,595 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 2402 states, 2073 states have (on average 1.5065123010130246) internal successors, (3123), 2079 states have internal predecessors, (3123), 311 states have call successors, (311), 17 states have call predecessors, (311), 17 states have return successors, (311), 305 states have call predecessors, (311), 311 states have call successors, (311) [2025-02-05 21:35:23,598 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 2402 states to 2402 states and 3745 transitions. [2025-02-05 21:35:23,600 INFO L78 Accepts]: Start accepts. Automaton has 2402 states and 3745 transitions. Word has length 449 [2025-02-05 21:35:23,601 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-02-05 21:35:23,601 INFO L471 AbstractCegarLoop]: Abstraction has 2402 states and 3745 transitions. [2025-02-05 21:35:23,601 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 10 states, 10 states have (on average 9.7) internal successors, (97), 10 states have internal predecessors, (97), 1 states have call successors, (71), 1 states have call predecessors, (71), 1 states have return successors, (71), 1 states have call predecessors, (71), 1 states have call successors, (71) [2025-02-05 21:35:23,601 INFO L276 IsEmpty]: Start isEmpty. Operand 2402 states and 3745 transitions. [2025-02-05 21:35:23,604 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 450 [2025-02-05 21:35:23,604 INFO L210 NwaCegarLoop]: Found error trace [2025-02-05 21:35:23,604 INFO L218 NwaCegarLoop]: trace histogram [71, 71, 71, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-02-05 21:35:23,604 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable14 [2025-02-05 21:35:23,604 INFO L396 AbstractCegarLoop]: === Iteration 16 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-02-05 21:35:23,605 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-02-05 21:35:23,605 INFO L85 PathProgramCache]: Analyzing trace with hash -996502539, now seen corresponding path program 1 times [2025-02-05 21:35:23,605 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-02-05 21:35:23,605 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1593739134] [2025-02-05 21:35:23,605 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-02-05 21:35:23,605 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-02-05 21:35:23,628 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 449 statements into 1 equivalence classes. [2025-02-05 21:35:23,687 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 449 of 449 statements. [2025-02-05 21:35:23,687 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-02-05 21:35:23,687 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-02-05 21:35:26,858 INFO L134 CoverageAnalysis]: Checked inductivity of 9940 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 9940 trivial. 0 not checked. [2025-02-05 21:35:26,858 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-02-05 21:35:26,859 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1593739134] [2025-02-05 21:35:26,859 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1593739134] provided 1 perfect and 0 imperfect interpolant sequences [2025-02-05 21:35:26,859 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-02-05 21:35:26,859 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [12] imperfect sequences [] total 12 [2025-02-05 21:35:26,859 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [558268659] [2025-02-05 21:35:26,859 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-02-05 21:35:26,859 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 12 states [2025-02-05 21:35:26,859 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-02-05 21:35:26,860 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 12 interpolants. [2025-02-05 21:35:26,860 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=29, Invalid=103, Unknown=0, NotChecked=0, Total=132 [2025-02-05 21:35:26,860 INFO L87 Difference]: Start difference. First operand 2402 states and 3745 transitions. Second operand has 12 states, 12 states have (on average 8.083333333333334) internal successors, (97), 12 states have internal predecessors, (97), 1 states have call successors, (71), 1 states have call predecessors, (71), 1 states have return successors, (71), 1 states have call predecessors, (71), 1 states have call successors, (71) [2025-02-05 21:35:32,236 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-02-05 21:35:32,236 INFO L93 Difference]: Finished difference Result 4738 states and 7310 transitions. [2025-02-05 21:35:32,236 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 20 states. [2025-02-05 21:35:32,236 INFO L78 Accepts]: Start accepts. Automaton has has 12 states, 12 states have (on average 8.083333333333334) internal successors, (97), 12 states have internal predecessors, (97), 1 states have call successors, (71), 1 states have call predecessors, (71), 1 states have return successors, (71), 1 states have call predecessors, (71), 1 states have call successors, (71) Word has length 449 [2025-02-05 21:35:32,237 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-02-05 21:35:32,244 INFO L225 Difference]: With dead ends: 4738 [2025-02-05 21:35:32,244 INFO L226 Difference]: Without dead ends: 3394 [2025-02-05 21:35:32,246 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 27 GetRequests, 3 SyntacticMatches, 0 SemanticMatches, 24 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 113 ImplicationChecksByTransitivity, 4.1s TimeCoverageRelationStatistics Valid=176, Invalid=474, Unknown=0, NotChecked=0, Total=650 [2025-02-05 21:35:32,247 INFO L435 NwaCegarLoop]: 380 mSDtfsCounter, 646 mSDsluCounter, 1014 mSDsCounter, 0 mSdLazyCounter, 846 mSolverCounterSat, 13 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 2.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 646 SdHoareTripleChecker+Valid, 1394 SdHoareTripleChecker+Invalid, 859 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 13 IncrementalHoareTripleChecker+Valid, 846 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 2.2s IncrementalHoareTripleChecker+Time [2025-02-05 21:35:32,247 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [646 Valid, 1394 Invalid, 859 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [13 Valid, 846 Invalid, 0 Unknown, 0 Unchecked, 2.2s Time] [2025-02-05 21:35:32,248 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 3394 states. [2025-02-05 21:35:32,368 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 3394 to 2514. [2025-02-05 21:35:32,370 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 2514 states, 2185 states have (on average 1.5025171624713958) internal successors, (3283), 2191 states have internal predecessors, (3283), 311 states have call successors, (311), 17 states have call predecessors, (311), 17 states have return successors, (311), 305 states have call predecessors, (311), 311 states have call successors, (311) [2025-02-05 21:35:32,373 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 2514 states to 2514 states and 3905 transitions. [2025-02-05 21:35:32,374 INFO L78 Accepts]: Start accepts. Automaton has 2514 states and 3905 transitions. Word has length 449 [2025-02-05 21:35:32,375 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-02-05 21:35:32,375 INFO L471 AbstractCegarLoop]: Abstraction has 2514 states and 3905 transitions. [2025-02-05 21:35:32,375 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 12 states, 12 states have (on average 8.083333333333334) internal successors, (97), 12 states have internal predecessors, (97), 1 states have call successors, (71), 1 states have call predecessors, (71), 1 states have return successors, (71), 1 states have call predecessors, (71), 1 states have call successors, (71) [2025-02-05 21:35:32,375 INFO L276 IsEmpty]: Start isEmpty. Operand 2514 states and 3905 transitions. [2025-02-05 21:35:32,377 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 450 [2025-02-05 21:35:32,377 INFO L210 NwaCegarLoop]: Found error trace [2025-02-05 21:35:32,378 INFO L218 NwaCegarLoop]: trace histogram [71, 71, 71, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-02-05 21:35:32,378 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable15 [2025-02-05 21:35:32,378 INFO L396 AbstractCegarLoop]: === Iteration 17 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-02-05 21:35:32,378 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-02-05 21:35:32,378 INFO L85 PathProgramCache]: Analyzing trace with hash 603506613, now seen corresponding path program 1 times [2025-02-05 21:35:32,379 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-02-05 21:35:32,379 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1817801418] [2025-02-05 21:35:32,379 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-02-05 21:35:32,379 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-02-05 21:35:32,391 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 449 statements into 1 equivalence classes. [2025-02-05 21:35:32,445 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 449 of 449 statements. [2025-02-05 21:35:32,446 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-02-05 21:35:32,446 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-02-05 21:35:36,898 INFO L134 CoverageAnalysis]: Checked inductivity of 9940 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 9940 trivial. 0 not checked. [2025-02-05 21:35:36,899 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-02-05 21:35:36,899 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1817801418] [2025-02-05 21:35:36,899 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1817801418] provided 1 perfect and 0 imperfect interpolant sequences [2025-02-05 21:35:36,899 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-02-05 21:35:36,899 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [13] imperfect sequences [] total 13 [2025-02-05 21:35:36,899 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [590858365] [2025-02-05 21:35:36,899 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-02-05 21:35:36,900 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 13 states [2025-02-05 21:35:36,900 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-02-05 21:35:36,904 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 13 interpolants. [2025-02-05 21:35:36,905 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=25, Invalid=131, Unknown=0, NotChecked=0, Total=156 [2025-02-05 21:35:36,905 INFO L87 Difference]: Start difference. First operand 2514 states and 3905 transitions. Second operand has 13 states, 13 states have (on average 7.461538461538462) internal successors, (97), 13 states have internal predecessors, (97), 1 states have call successors, (71), 1 states have call predecessors, (71), 1 states have return successors, (71), 1 states have call predecessors, (71), 1 states have call successors, (71) [2025-02-05 21:35:43,360 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-02-05 21:35:43,360 INFO L93 Difference]: Finished difference Result 5302 states and 8076 transitions. [2025-02-05 21:35:43,360 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 14 states. [2025-02-05 21:35:43,361 INFO L78 Accepts]: Start accepts. Automaton has has 13 states, 13 states have (on average 7.461538461538462) internal successors, (97), 13 states have internal predecessors, (97), 1 states have call successors, (71), 1 states have call predecessors, (71), 1 states have return successors, (71), 1 states have call predecessors, (71), 1 states have call successors, (71) Word has length 449 [2025-02-05 21:35:43,361 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-02-05 21:35:43,368 INFO L225 Difference]: With dead ends: 5302 [2025-02-05 21:35:43,369 INFO L226 Difference]: Without dead ends: 3586 [2025-02-05 21:35:43,371 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 27 GetRequests, 5 SyntacticMatches, 1 SemanticMatches, 21 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 47 ImplicationChecksByTransitivity, 3.9s TimeCoverageRelationStatistics Valid=120, Invalid=386, Unknown=0, NotChecked=0, Total=506 [2025-02-05 21:35:43,372 INFO L435 NwaCegarLoop]: 338 mSDtfsCounter, 717 mSDsluCounter, 2438 mSDsCounter, 0 mSdLazyCounter, 2048 mSolverCounterSat, 234 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 3.5s Time, 0 mProtectedPredicate, 0 mProtectedAction, 717 SdHoareTripleChecker+Valid, 2776 SdHoareTripleChecker+Invalid, 2282 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 234 IncrementalHoareTripleChecker+Valid, 2048 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 3.8s IncrementalHoareTripleChecker+Time [2025-02-05 21:35:43,372 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [717 Valid, 2776 Invalid, 2282 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [234 Valid, 2048 Invalid, 0 Unknown, 0 Unchecked, 3.8s Time] [2025-02-05 21:35:43,374 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 3586 states. [2025-02-05 21:35:43,486 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 3586 to 2658. [2025-02-05 21:35:43,489 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 2658 states, 2329 states have (on average 1.4920566766852728) internal successors, (3475), 2335 states have internal predecessors, (3475), 311 states have call successors, (311), 17 states have call predecessors, (311), 17 states have return successors, (311), 305 states have call predecessors, (311), 311 states have call successors, (311) [2025-02-05 21:35:43,492 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 2658 states to 2658 states and 4097 transitions. [2025-02-05 21:35:43,494 INFO L78 Accepts]: Start accepts. Automaton has 2658 states and 4097 transitions. Word has length 449 [2025-02-05 21:35:43,494 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-02-05 21:35:43,494 INFO L471 AbstractCegarLoop]: Abstraction has 2658 states and 4097 transitions. [2025-02-05 21:35:43,494 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 13 states, 13 states have (on average 7.461538461538462) internal successors, (97), 13 states have internal predecessors, (97), 1 states have call successors, (71), 1 states have call predecessors, (71), 1 states have return successors, (71), 1 states have call predecessors, (71), 1 states have call successors, (71) [2025-02-05 21:35:43,495 INFO L276 IsEmpty]: Start isEmpty. Operand 2658 states and 4097 transitions. [2025-02-05 21:35:43,497 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 450 [2025-02-05 21:35:43,497 INFO L210 NwaCegarLoop]: Found error trace [2025-02-05 21:35:43,497 INFO L218 NwaCegarLoop]: trace histogram [71, 71, 71, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-02-05 21:35:43,498 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable16 [2025-02-05 21:35:43,498 INFO L396 AbstractCegarLoop]: === Iteration 18 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-02-05 21:35:43,499 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-02-05 21:35:43,499 INFO L85 PathProgramCache]: Analyzing trace with hash 1491010294, now seen corresponding path program 1 times [2025-02-05 21:35:43,499 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-02-05 21:35:43,499 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1250408949] [2025-02-05 21:35:43,499 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-02-05 21:35:43,499 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-02-05 21:35:43,512 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 449 statements into 1 equivalence classes. [2025-02-05 21:35:43,572 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 449 of 449 statements. [2025-02-05 21:35:43,573 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-02-05 21:35:43,573 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-02-05 21:35:50,086 INFO L134 CoverageAnalysis]: Checked inductivity of 9940 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 9940 trivial. 0 not checked. [2025-02-05 21:35:50,086 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-02-05 21:35:50,086 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1250408949] [2025-02-05 21:35:50,086 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1250408949] provided 1 perfect and 0 imperfect interpolant sequences [2025-02-05 21:35:50,086 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-02-05 21:35:50,086 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [17] imperfect sequences [] total 17 [2025-02-05 21:35:50,086 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [272861845] [2025-02-05 21:35:50,087 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-02-05 21:35:50,087 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 17 states [2025-02-05 21:35:50,087 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-02-05 21:35:50,087 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 17 interpolants. [2025-02-05 21:35:50,088 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=38, Invalid=234, Unknown=0, NotChecked=0, Total=272 [2025-02-05 21:35:50,088 INFO L87 Difference]: Start difference. First operand 2658 states and 4097 transitions. Second operand has 17 states, 17 states have (on average 5.705882352941177) internal successors, (97), 17 states have internal predecessors, (97), 2 states have call successors, (71), 1 states have call predecessors, (71), 1 states have return successors, (71), 2 states have call predecessors, (71), 2 states have call successors, (71) [2025-02-05 21:35:55,934 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-02-05 21:35:55,934 INFO L93 Difference]: Finished difference Result 4794 states and 7248 transitions. [2025-02-05 21:35:55,935 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 17 states. [2025-02-05 21:35:55,935 INFO L78 Accepts]: Start accepts. Automaton has has 17 states, 17 states have (on average 5.705882352941177) internal successors, (97), 17 states have internal predecessors, (97), 2 states have call successors, (71), 1 states have call predecessors, (71), 1 states have return successors, (71), 2 states have call predecessors, (71), 2 states have call successors, (71) Word has length 449 [2025-02-05 21:35:55,935 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-02-05 21:35:55,942 INFO L225 Difference]: With dead ends: 4794 [2025-02-05 21:35:55,942 INFO L226 Difference]: Without dead ends: 3386 [2025-02-05 21:35:55,945 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 34 GetRequests, 5 SyntacticMatches, 0 SemanticMatches, 29 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 125 ImplicationChecksByTransitivity, 4.3s TimeCoverageRelationStatistics Valid=216, Invalid=714, Unknown=0, NotChecked=0, Total=930 [2025-02-05 21:35:55,946 INFO L435 NwaCegarLoop]: 345 mSDtfsCounter, 962 mSDsluCounter, 2559 mSDsCounter, 0 mSdLazyCounter, 1998 mSolverCounterSat, 363 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 2.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 962 SdHoareTripleChecker+Valid, 2904 SdHoareTripleChecker+Invalid, 2361 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 363 IncrementalHoareTripleChecker+Valid, 1998 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 2.4s IncrementalHoareTripleChecker+Time [2025-02-05 21:35:55,946 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [962 Valid, 2904 Invalid, 2361 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [363 Valid, 1998 Invalid, 0 Unknown, 0 Unchecked, 2.4s Time] [2025-02-05 21:35:55,947 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 3386 states. [2025-02-05 21:35:56,065 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 3386 to 2690. [2025-02-05 21:35:56,067 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 2690 states, 2361 states have (on average 1.4853875476493013) internal successors, (3507), 2367 states have internal predecessors, (3507), 311 states have call successors, (311), 17 states have call predecessors, (311), 17 states have return successors, (311), 305 states have call predecessors, (311), 311 states have call successors, (311) [2025-02-05 21:35:56,070 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 2690 states to 2690 states and 4129 transitions. [2025-02-05 21:35:56,072 INFO L78 Accepts]: Start accepts. Automaton has 2690 states and 4129 transitions. Word has length 449 [2025-02-05 21:35:56,072 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-02-05 21:35:56,072 INFO L471 AbstractCegarLoop]: Abstraction has 2690 states and 4129 transitions. [2025-02-05 21:35:56,073 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 17 states, 17 states have (on average 5.705882352941177) internal successors, (97), 17 states have internal predecessors, (97), 2 states have call successors, (71), 1 states have call predecessors, (71), 1 states have return successors, (71), 2 states have call predecessors, (71), 2 states have call successors, (71) [2025-02-05 21:35:56,073 INFO L276 IsEmpty]: Start isEmpty. Operand 2690 states and 4129 transitions. [2025-02-05 21:35:56,075 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 451 [2025-02-05 21:35:56,075 INFO L210 NwaCegarLoop]: Found error trace [2025-02-05 21:35:56,075 INFO L218 NwaCegarLoop]: trace histogram [71, 71, 71, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-02-05 21:35:56,075 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable17 [2025-02-05 21:35:56,076 INFO L396 AbstractCegarLoop]: === Iteration 19 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-02-05 21:35:56,076 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-02-05 21:35:56,076 INFO L85 PathProgramCache]: Analyzing trace with hash -1395202851, now seen corresponding path program 1 times [2025-02-05 21:35:56,076 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-02-05 21:35:56,076 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1185115673] [2025-02-05 21:35:56,076 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-02-05 21:35:56,076 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-02-05 21:35:56,091 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 450 statements into 1 equivalence classes. [2025-02-05 21:35:56,177 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 450 of 450 statements. [2025-02-05 21:35:56,177 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-02-05 21:35:56,177 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat