./Ultimate.py --spec ../sv-benchmarks/c/properties/unreach-call.prp --file ../sv-benchmarks/c/hardness-nfm22/hardness_fillercode_fillercodesize_ps-cn-500_file-21.i --full-output --architecture 32bit -------------------------------------------------------------------------------- Checking for ERROR reachability Using default analysis Version c00e63dc Calling Ultimate with: /root/.sdkman/candidates/java/21.0.5-tem/bin/java -Dosgi.configuration.area=/storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/data/config -Xmx15G -Xms4m -jar /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/plugins/org.eclipse.equinox.launcher_1.6.800.v20240513-1750.jar -data @noDefault -ultimatedata /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/data -tc /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/config/AutomizerReach.xml -i ../sv-benchmarks/c/hardness-nfm22/hardness_fillercode_fillercodesize_ps-cn-500_file-21.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 4e26c4f9f4bd36e827f5cc020962f05d0934fda94760f725a49c7754f36caf1f --- Real Ultimate output --- This is Ultimate 0.3.0-?-c00e63d-m [2025-02-05 21:55:58,075 INFO L188 SettingsManager]: Resetting all preferences to default values... [2025-02-05 21:55:58,133 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:55:58,140 WARN L101 SettingsManager]: Preference file contains the following unknown settings: [2025-02-05 21:55:58,140 WARN L103 SettingsManager]: * de.uni_freiburg.informatik.ultimate.core.Log level for class [2025-02-05 21:55:58,157 INFO L130 SettingsManager]: Preferences different from defaults after loading the file: [2025-02-05 21:55:58,157 INFO L151 SettingsManager]: Preferences of UltimateCore differ from their defaults: [2025-02-05 21:55:58,157 INFO L153 SettingsManager]: * Log level for class=de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher=ERROR; [2025-02-05 21:55:58,158 INFO L151 SettingsManager]: Preferences of Boogie Preprocessor differ from their defaults: [2025-02-05 21:55:58,158 INFO L153 SettingsManager]: * Use memory slicer=true [2025-02-05 21:55:58,158 INFO L151 SettingsManager]: Preferences of Boogie Procedure Inliner differ from their defaults: [2025-02-05 21:55:58,158 INFO L153 SettingsManager]: * Ignore calls to procedures called more than once=ONLY_FOR_SEQUENTIAL_PROGRAMS [2025-02-05 21:55:58,158 INFO L151 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2025-02-05 21:55:58,158 INFO L153 SettingsManager]: * Create parallel compositions if possible=false [2025-02-05 21:55:58,158 INFO L153 SettingsManager]: * Use SBE=true [2025-02-05 21:55:58,159 INFO L151 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2025-02-05 21:55:58,159 INFO L153 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2025-02-05 21:55:58,159 INFO L153 SettingsManager]: * sizeof long=4 [2025-02-05 21:55:58,159 INFO L153 SettingsManager]: * Overapproximate operations on floating types=true [2025-02-05 21:55:58,159 INFO L153 SettingsManager]: * sizeof POINTER=4 [2025-02-05 21:55:58,159 INFO L153 SettingsManager]: * Check division by zero=IGNORE [2025-02-05 21:55:58,159 INFO L153 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2025-02-05 21:55:58,159 INFO L153 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2025-02-05 21:55:58,159 INFO L153 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2025-02-05 21:55:58,159 INFO L153 SettingsManager]: * sizeof long double=12 [2025-02-05 21:55:58,160 INFO L153 SettingsManager]: * Check if freed pointer was valid=false [2025-02-05 21:55:58,160 INFO L153 SettingsManager]: * Behaviour of calls to undefined functions=OVERAPPROXIMATE_BEHAVIOUR [2025-02-05 21:55:58,160 INFO L153 SettingsManager]: * Use constant arrays=true [2025-02-05 21:55:58,160 INFO L151 SettingsManager]: Preferences of IcfgBuilder differ from their defaults: [2025-02-05 21:55:58,160 INFO L153 SettingsManager]: * Size of a code block=SequenceOfStatements [2025-02-05 21:55:58,160 INFO L153 SettingsManager]: * Only consider context switches at boundaries of atomic blocks=true [2025-02-05 21:55:58,160 INFO L153 SettingsManager]: * SMT solver=External_DefaultMode [2025-02-05 21:55:58,160 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2025-02-05 21:55:58,160 INFO L151 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2025-02-05 21:55:58,160 INFO L153 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2025-02-05 21:55:58,161 INFO L153 SettingsManager]: * Compute procedure contracts=false [2025-02-05 21:55:58,161 INFO L153 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopHeads [2025-02-05 21:55:58,161 INFO L153 SettingsManager]: * Trace refinement strategy=CAMEL [2025-02-05 21:55:58,161 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2025-02-05 21:55:58,161 INFO L153 SettingsManager]: * Apply one-shot large block encoding in concurrent analysis=false [2025-02-05 21:55:58,161 INFO L153 SettingsManager]: * Automaton type used in concurrency analysis=PETRI_NET [2025-02-05 21:55:58,161 INFO L153 SettingsManager]: * Order on configurations for Petri net unfoldings=DBO [2025-02-05 21:55:58,161 INFO L153 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode [2025-02-05 21:55:58,161 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 -> 4e26c4f9f4bd36e827f5cc020962f05d0934fda94760f725a49c7754f36caf1f [2025-02-05 21:55:58,407 INFO L75 nceAwareModelManager]: Repository-Root is: /tmp [2025-02-05 21:55:58,414 INFO L261 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2025-02-05 21:55:58,415 INFO L217 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2025-02-05 21:55:58,416 INFO L270 PluginConnector]: Initializing CDTParser... [2025-02-05 21:55:58,416 INFO L274 PluginConnector]: CDTParser initialized [2025-02-05 21:55:58,417 INFO L431 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/../sv-benchmarks/c/hardness-nfm22/hardness_fillercode_fillercodesize_ps-cn-500_file-21.i [2025-02-05 21:55:59,530 INFO L533 CDTParser]: Created temporary CDT project at /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/data/b69218533/981bab0f13954ec4847f53631e614113/FLAG1e2298a15 [2025-02-05 21:55:59,833 INFO L384 CDTParser]: Found 1 translation units. [2025-02-05 21:55:59,834 INFO L180 CDTParser]: Scanning /storage/repos/ultimate-jdk21/releaseScripts/default/sv-benchmarks/c/hardness-nfm22/hardness_fillercode_fillercodesize_ps-cn-500_file-21.i [2025-02-05 21:55:59,851 INFO L427 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/data/b69218533/981bab0f13954ec4847f53631e614113/FLAG1e2298a15 [2025-02-05 21:56:00,100 INFO L435 CDTParser]: Successfully deleted /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/data/b69218533/981bab0f13954ec4847f53631e614113 [2025-02-05 21:56:00,101 INFO L299 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2025-02-05 21:56:00,102 INFO L133 ToolchainWalker]: Walking toolchain with 6 elements. [2025-02-05 21:56:00,103 INFO L112 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2025-02-05 21:56:00,103 INFO L270 PluginConnector]: Initializing CACSL2BoogieTranslator... [2025-02-05 21:56:00,106 INFO L274 PluginConnector]: CACSL2BoogieTranslator initialized [2025-02-05 21:56:00,107 INFO L184 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 05.02 09:56:00" (1/1) ... [2025-02-05 21:56:00,107 INFO L204 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@710c540f and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 05.02 09:56:00, skipping insertion in model container [2025-02-05 21:56:00,107 INFO L184 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 05.02 09:56:00" (1/1) ... [2025-02-05 21:56:00,135 INFO L175 MainTranslator]: Built tables and reachable declarations [2025-02-05 21:56:00,242 WARN L250 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate-jdk21/releaseScripts/default/sv-benchmarks/c/hardness-nfm22/hardness_fillercode_fillercodesize_ps-cn-500_file-21.i[916,929] [2025-02-05 21:56:00,404 INFO L210 PostProcessor]: Analyzing one entry point: main [2025-02-05 21:56:00,418 INFO L200 MainTranslator]: Completed pre-run [2025-02-05 21:56:00,426 WARN L250 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate-jdk21/releaseScripts/default/sv-benchmarks/c/hardness-nfm22/hardness_fillercode_fillercodesize_ps-cn-500_file-21.i[916,929] [2025-02-05 21:56:00,490 INFO L210 PostProcessor]: Analyzing one entry point: main [2025-02-05 21:56:00,510 INFO L204 MainTranslator]: Completed translation [2025-02-05 21:56:00,511 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 05.02 09:56:00 WrapperNode [2025-02-05 21:56:00,511 INFO L131 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2025-02-05 21:56:00,511 INFO L112 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2025-02-05 21:56:00,511 INFO L270 PluginConnector]: Initializing Boogie Procedure Inliner... [2025-02-05 21:56:00,512 INFO L274 PluginConnector]: Boogie Procedure Inliner initialized [2025-02-05 21:56:00,516 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:56:00" (1/1) ... [2025-02-05 21:56:00,535 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:56:00" (1/1) ... [2025-02-05 21:56:00,596 INFO L138 Inliner]: procedures = 26, calls = 117, calls flagged for inlining = 8, calls inlined = 8, statements flattened = 848 [2025-02-05 21:56:00,597 INFO L131 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2025-02-05 21:56:00,597 INFO L112 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2025-02-05 21:56:00,598 INFO L270 PluginConnector]: Initializing Boogie Preprocessor... [2025-02-05 21:56:00,598 INFO L274 PluginConnector]: Boogie Preprocessor initialized [2025-02-05 21:56:00,605 INFO L184 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 05.02 09:56:00" (1/1) ... [2025-02-05 21:56:00,605 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 05.02 09:56:00" (1/1) ... [2025-02-05 21:56:00,616 INFO L184 PluginConnector]: Executing the observer MemorySlicer from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 05.02 09:56:00" (1/1) ... [2025-02-05 21:56:00,655 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:56:00,655 INFO L184 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 05.02 09:56:00" (1/1) ... [2025-02-05 21:56:00,655 INFO L184 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 05.02 09:56:00" (1/1) ... [2025-02-05 21:56:00,679 INFO L184 PluginConnector]: Executing the observer ReplaceArrayAssignments from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 05.02 09:56:00" (1/1) ... [2025-02-05 21:56:00,688 INFO L184 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 05.02 09:56:00" (1/1) ... [2025-02-05 21:56:00,698 INFO L184 PluginConnector]: Executing the observer LTLStepAnnotator from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 05.02 09:56:00" (1/1) ... [2025-02-05 21:56:00,702 INFO L184 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 05.02 09:56:00" (1/1) ... [2025-02-05 21:56:00,716 INFO L131 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2025-02-05 21:56:00,718 INFO L112 PluginConnector]: ------------------------IcfgBuilder---------------------------- [2025-02-05 21:56:00,718 INFO L270 PluginConnector]: Initializing IcfgBuilder... [2025-02-05 21:56:00,718 INFO L274 PluginConnector]: IcfgBuilder initialized [2025-02-05 21:56:00,719 INFO L184 PluginConnector]: Executing the observer IcfgBuilderObserver from plugin IcfgBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 05.02 09:56:00" (1/1) ... [2025-02-05 21:56:00,723 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2025-02-05 21:56:00,733 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 [2025-02-05 21:56:00,746 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:56:00,751 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:56:00,764 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocInit [2025-02-05 21:56:00,764 INFO L130 BoogieDeclarations]: Found specification of procedure assume_abort_if_not [2025-02-05 21:56:00,764 INFO L138 BoogieDeclarations]: Found implementation of procedure assume_abort_if_not [2025-02-05 21:56:00,764 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int#0 [2025-02-05 21:56:00,764 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2025-02-05 21:56:00,764 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2025-02-05 21:56:00,877 INFO L257 CfgBuilder]: Building ICFG [2025-02-05 21:56:00,878 INFO L287 CfgBuilder]: Building CFG for each procedure with an implementation [2025-02-05 21:56:01,683 INFO L1309 $ProcedureCfgBuilder]: dead code at ProgramPoint L699: havoc property_#t~ite79#1;havoc property_#t~bitwise78#1;havoc property_#t~short80#1; [2025-02-05 21:56:01,880 INFO L? ?]: Removed 21 outVars from TransFormulas that were not future-live. [2025-02-05 21:56:01,881 INFO L308 CfgBuilder]: Performing block encoding [2025-02-05 21:56:01,917 INFO L332 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2025-02-05 21:56:01,917 INFO L337 CfgBuilder]: Removed 0 assume(true) statements. [2025-02-05 21:56:01,917 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.icfgbuilder CFG 05.02 09:56:01 BoogieIcfgContainer [2025-02-05 21:56:01,917 INFO L131 PluginConnector]: ------------------------ END IcfgBuilder---------------------------- [2025-02-05 21:56:01,923 INFO L112 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2025-02-05 21:56:01,923 INFO L270 PluginConnector]: Initializing TraceAbstraction... [2025-02-05 21:56:01,926 INFO L274 PluginConnector]: TraceAbstraction initialized [2025-02-05 21:56:01,926 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 05.02 09:56:00" (1/3) ... [2025-02-05 21:56:01,927 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@25374731 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 05.02 09:56:01, skipping insertion in model container [2025-02-05 21:56:01,927 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 05.02 09:56:00" (2/3) ... [2025-02-05 21:56:01,927 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@25374731 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 05.02 09:56:01, skipping insertion in model container [2025-02-05 21:56:01,927 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.icfgbuilder CFG 05.02 09:56:01" (3/3) ... [2025-02-05 21:56:01,928 INFO L128 eAbstractionObserver]: Analyzing ICFG hardness_fillercode_fillercodesize_ps-cn-500_file-21.i [2025-02-05 21:56:01,940 INFO L216 ceAbstractionStarter]: Automizer settings: Hoare:LoopHeads NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2025-02-05 21:56:01,943 INFO L151 ceAbstractionStarter]: Applying trace abstraction to ICFG hardness_fillercode_fillercodesize_ps-cn-500_file-21.i that has 2 procedures, 346 locations, 1 initial locations, 1 loop locations, and 1 error locations. [2025-02-05 21:56:02,006 INFO L332 AbstractCegarLoop]: ======== Iteration 0 == of CEGAR loop == AllErrorsAtOnce ======== [2025-02-05 21:56:02,016 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;@4d7338c0, mLbeIndependenceSettings=[IndependenceType=SEMANTIC, AbstractionType=NONE, UseConditional=false, UseSemiCommutativity=true, Solver=Z3, SolverTimeout=1000ms] [2025-02-05 21:56:02,016 INFO L334 AbstractCegarLoop]: Starting to check reachability of 1 error locations. [2025-02-05 21:56:02,021 INFO L276 IsEmpty]: Start isEmpty. Operand has 346 states, 239 states have (on average 1.598326359832636) internal successors, (382), 240 states have internal predecessors, (382), 104 states have call successors, (104), 1 states have call predecessors, (104), 1 states have return successors, (104), 104 states have call predecessors, (104), 104 states have call successors, (104) [2025-02-05 21:56:02,054 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 670 [2025-02-05 21:56:02,055 INFO L210 NwaCegarLoop]: Found error trace [2025-02-05 21:56:02,056 INFO L218 NwaCegarLoop]: trace histogram [104, 104, 104, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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:56:02,057 INFO L396 AbstractCegarLoop]: === Iteration 1 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-02-05 21:56:02,062 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-02-05 21:56:02,062 INFO L85 PathProgramCache]: Analyzing trace with hash -2018403777, now seen corresponding path program 1 times [2025-02-05 21:56:02,067 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-02-05 21:56:02,068 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1434097173] [2025-02-05 21:56:02,069 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-02-05 21:56:02,069 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-02-05 21:56:02,185 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 669 statements into 1 equivalence classes. [2025-02-05 21:56:02,225 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 669 of 669 statements. [2025-02-05 21:56:02,225 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-02-05 21:56:02,225 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-02-05 21:56:02,622 INFO L134 CoverageAnalysis]: Checked inductivity of 21424 backedges. 0 proven. 206 refuted. 0 times theorem prover too weak. 21218 trivial. 0 not checked. [2025-02-05 21:56:02,623 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-02-05 21:56:02,624 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1434097173] [2025-02-05 21:56:02,624 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1434097173] provided 0 perfect and 1 imperfect interpolant sequences [2025-02-05 21:56:02,624 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1753939105] [2025-02-05 21:56:02,624 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-02-05 21:56:02,625 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-02-05 21:56:02,625 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 [2025-02-05 21:56:02,627 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:56:02,630 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:56:02,788 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 669 statements into 1 equivalence classes. [2025-02-05 21:56:02,984 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 669 of 669 statements. [2025-02-05 21:56:02,985 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-02-05 21:56:02,985 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-02-05 21:56:02,992 INFO L256 TraceCheckSpWp]: Trace formula consists of 1539 conjuncts, 1 conjuncts are in the unsatisfiable core [2025-02-05 21:56:03,017 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-02-05 21:56:03,073 INFO L134 CoverageAnalysis]: Checked inductivity of 21424 backedges. 206 proven. 0 refuted. 0 times theorem prover too weak. 21218 trivial. 0 not checked. [2025-02-05 21:56:03,074 INFO L308 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2025-02-05 21:56:03,074 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1753939105] provided 1 perfect and 0 imperfect interpolant sequences [2025-02-05 21:56:03,074 INFO L185 FreeRefinementEngine]: Found 1 perfect and 1 imperfect interpolant sequences. [2025-02-05 21:56:03,074 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [2] total 2 [2025-02-05 21:56:03,076 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1796104694] [2025-02-05 21:56:03,077 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-02-05 21:56:03,082 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 2 states [2025-02-05 21:56:03,082 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-02-05 21:56:03,099 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 2 interpolants. [2025-02-05 21:56:03,099 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=1, Invalid=1, Unknown=0, NotChecked=0, Total=2 [2025-02-05 21:56:03,102 INFO L87 Difference]: Start difference. First operand has 346 states, 239 states have (on average 1.598326359832636) internal successors, (382), 240 states have internal predecessors, (382), 104 states have call successors, (104), 1 states have call predecessors, (104), 1 states have return successors, (104), 104 states have call predecessors, (104), 104 states have call successors, (104) Second operand has 2 states, 2 states have (on average 77.0) internal successors, (154), 2 states have internal predecessors, (154), 2 states have call successors, (104), 2 states have call predecessors, (104), 1 states have return successors, (104), 1 states have call predecessors, (104), 2 states have call successors, (104) [2025-02-05 21:56:03,189 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-02-05 21:56:03,190 INFO L93 Difference]: Finished difference Result 686 states and 1279 transitions. [2025-02-05 21:56:03,191 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 2 states. [2025-02-05 21:56:03,192 INFO L78 Accepts]: Start accepts. Automaton has has 2 states, 2 states have (on average 77.0) internal successors, (154), 2 states have internal predecessors, (154), 2 states have call successors, (104), 2 states have call predecessors, (104), 1 states have return successors, (104), 1 states have call predecessors, (104), 2 states have call successors, (104) Word has length 669 [2025-02-05 21:56:03,193 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-02-05 21:56:03,200 INFO L225 Difference]: With dead ends: 686 [2025-02-05 21:56:03,200 INFO L226 Difference]: Without dead ends: 343 [2025-02-05 21:56:03,205 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 670 GetRequests, 670 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:56:03,208 INFO L435 NwaCegarLoop]: 569 mSDtfsCounter, 0 mSDsluCounter, 0 mSDsCounter, 0 mSdLazyCounter, 16 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 0 SdHoareTripleChecker+Valid, 569 SdHoareTripleChecker+Invalid, 16 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 16 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2025-02-05 21:56:03,209 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [0 Valid, 569 Invalid, 16 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 16 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2025-02-05 21:56:03,221 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 343 states. [2025-02-05 21:56:03,278 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 343 to 343. [2025-02-05 21:56:03,280 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 343 states, 237 states have (on average 1.590717299578059) internal successors, (377), 237 states have internal predecessors, (377), 104 states have call successors, (104), 1 states have call predecessors, (104), 1 states have return successors, (104), 104 states have call predecessors, (104), 104 states have call successors, (104) [2025-02-05 21:56:03,289 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 343 states to 343 states and 585 transitions. [2025-02-05 21:56:03,292 INFO L78 Accepts]: Start accepts. Automaton has 343 states and 585 transitions. Word has length 669 [2025-02-05 21:56:03,292 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-02-05 21:56:03,292 INFO L471 AbstractCegarLoop]: Abstraction has 343 states and 585 transitions. [2025-02-05 21:56:03,294 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 2 states, 2 states have (on average 77.0) internal successors, (154), 2 states have internal predecessors, (154), 2 states have call successors, (104), 2 states have call predecessors, (104), 1 states have return successors, (104), 1 states have call predecessors, (104), 2 states have call successors, (104) [2025-02-05 21:56:03,294 INFO L276 IsEmpty]: Start isEmpty. Operand 343 states and 585 transitions. [2025-02-05 21:56:03,321 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 670 [2025-02-05 21:56:03,321 INFO L210 NwaCegarLoop]: Found error trace [2025-02-05 21:56:03,321 INFO L218 NwaCegarLoop]: trace histogram [104, 104, 104, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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:56:03,331 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (2)] Forceful destruction successful, exit code 0 [2025-02-05 21:56:03,522 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:56:03,522 INFO L396 AbstractCegarLoop]: === Iteration 2 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-02-05 21:56:03,523 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-02-05 21:56:03,523 INFO L85 PathProgramCache]: Analyzing trace with hash 2143652005, now seen corresponding path program 1 times [2025-02-05 21:56:03,523 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-02-05 21:56:03,523 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1193685612] [2025-02-05 21:56:03,523 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-02-05 21:56:03,523 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-02-05 21:56:03,569 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 669 statements into 1 equivalence classes. [2025-02-05 21:56:03,633 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 669 of 669 statements. [2025-02-05 21:56:03,637 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-02-05 21:56:03,638 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-02-05 21:56:04,449 INFO L134 CoverageAnalysis]: Checked inductivity of 21424 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 21424 trivial. 0 not checked. [2025-02-05 21:56:04,449 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-02-05 21:56:04,449 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1193685612] [2025-02-05 21:56:04,449 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1193685612] provided 1 perfect and 0 imperfect interpolant sequences [2025-02-05 21:56:04,449 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-02-05 21:56:04,449 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2025-02-05 21:56:04,450 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [447951817] [2025-02-05 21:56:04,450 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-02-05 21:56:04,451 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2025-02-05 21:56:04,451 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-02-05 21:56:04,452 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2025-02-05 21:56:04,452 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=6, Invalid=6, Unknown=0, NotChecked=0, Total=12 [2025-02-05 21:56:04,452 INFO L87 Difference]: Start difference. First operand 343 states and 585 transitions. Second operand has 4 states, 4 states have (on average 38.0) internal successors, (152), 4 states have internal predecessors, (152), 2 states have call successors, (104), 1 states have call predecessors, (104), 1 states have return successors, (104), 2 states have call predecessors, (104), 2 states have call successors, (104) [2025-02-05 21:56:04,742 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-02-05 21:56:04,742 INFO L93 Difference]: Finished difference Result 1022 states and 1747 transitions. [2025-02-05 21:56:04,742 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2025-02-05 21:56:04,743 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 4 states have (on average 38.0) internal successors, (152), 4 states have internal predecessors, (152), 2 states have call successors, (104), 1 states have call predecessors, (104), 1 states have return successors, (104), 2 states have call predecessors, (104), 2 states have call successors, (104) Word has length 669 [2025-02-05 21:56:04,744 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-02-05 21:56:04,748 INFO L225 Difference]: With dead ends: 1022 [2025-02-05 21:56:04,749 INFO L226 Difference]: Without dead ends: 682 [2025-02-05 21:56:04,750 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:56:04,750 INFO L435 NwaCegarLoop]: 790 mSDtfsCounter, 772 mSDsluCounter, 539 mSDsCounter, 0 mSdLazyCounter, 113 mSolverCounterSat, 106 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 772 SdHoareTripleChecker+Valid, 1329 SdHoareTripleChecker+Invalid, 219 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 106 IncrementalHoareTripleChecker+Valid, 113 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.2s IncrementalHoareTripleChecker+Time [2025-02-05 21:56:04,750 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [772 Valid, 1329 Invalid, 219 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [106 Valid, 113 Invalid, 0 Unknown, 0 Unchecked, 0.2s Time] [2025-02-05 21:56:04,753 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 682 states. [2025-02-05 21:56:04,835 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 682 to 680. [2025-02-05 21:56:04,836 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 680 states, 469 states have (on average 1.5906183368869935) internal successors, (746), 469 states have internal predecessors, (746), 208 states have call successors, (208), 2 states have call predecessors, (208), 2 states have return successors, (208), 208 states have call predecessors, (208), 208 states have call successors, (208) [2025-02-05 21:56:04,843 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 680 states to 680 states and 1162 transitions. [2025-02-05 21:56:04,844 INFO L78 Accepts]: Start accepts. Automaton has 680 states and 1162 transitions. Word has length 669 [2025-02-05 21:56:04,847 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-02-05 21:56:04,847 INFO L471 AbstractCegarLoop]: Abstraction has 680 states and 1162 transitions. [2025-02-05 21:56:04,847 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 38.0) internal successors, (152), 4 states have internal predecessors, (152), 2 states have call successors, (104), 1 states have call predecessors, (104), 1 states have return successors, (104), 2 states have call predecessors, (104), 2 states have call successors, (104) [2025-02-05 21:56:04,848 INFO L276 IsEmpty]: Start isEmpty. Operand 680 states and 1162 transitions. [2025-02-05 21:56:04,859 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 671 [2025-02-05 21:56:04,860 INFO L210 NwaCegarLoop]: Found error trace [2025-02-05 21:56:04,860 INFO L218 NwaCegarLoop]: trace histogram [104, 104, 104, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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:56:04,860 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable1 [2025-02-05 21:56:04,860 INFO L396 AbstractCegarLoop]: === Iteration 3 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-02-05 21:56:04,861 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-02-05 21:56:04,861 INFO L85 PathProgramCache]: Analyzing trace with hash -1321022318, now seen corresponding path program 1 times [2025-02-05 21:56:04,862 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-02-05 21:56:04,862 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [128727211] [2025-02-05 21:56:04,863 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-02-05 21:56:04,863 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-02-05 21:56:04,901 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 670 statements into 1 equivalence classes. [2025-02-05 21:56:04,946 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 670 of 670 statements. [2025-02-05 21:56:04,947 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-02-05 21:56:04,947 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-02-05 21:56:05,106 INFO L134 CoverageAnalysis]: Checked inductivity of 21424 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 21424 trivial. 0 not checked. [2025-02-05 21:56:05,107 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-02-05 21:56:05,107 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [128727211] [2025-02-05 21:56:05,107 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [128727211] provided 1 perfect and 0 imperfect interpolant sequences [2025-02-05 21:56:05,107 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-02-05 21:56:05,107 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2025-02-05 21:56:05,107 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1054988071] [2025-02-05 21:56:05,107 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-02-05 21:56:05,108 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2025-02-05 21:56:05,108 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-02-05 21:56:05,109 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2025-02-05 21:56:05,109 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-02-05 21:56:05,109 INFO L87 Difference]: Start difference. First operand 680 states and 1162 transitions. Second operand has 3 states, 3 states have (on average 51.0) internal successors, (153), 3 states have internal predecessors, (153), 1 states have call successors, (104), 1 states have call predecessors, (104), 1 states have return successors, (104), 1 states have call predecessors, (104), 1 states have call successors, (104) [2025-02-05 21:56:05,232 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-02-05 21:56:05,232 INFO L93 Difference]: Finished difference Result 2030 states and 3472 transitions. [2025-02-05 21:56:05,232 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2025-02-05 21:56:05,233 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 51.0) internal successors, (153), 3 states have internal predecessors, (153), 1 states have call successors, (104), 1 states have call predecessors, (104), 1 states have return successors, (104), 1 states have call predecessors, (104), 1 states have call successors, (104) Word has length 670 [2025-02-05 21:56:05,234 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-02-05 21:56:05,246 INFO L225 Difference]: With dead ends: 2030 [2025-02-05 21:56:05,247 INFO L226 Difference]: Without dead ends: 1353 [2025-02-05 21:56:05,249 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:56:05,251 INFO L435 NwaCegarLoop]: 1099 mSDtfsCounter, 571 mSDsluCounter, 554 mSDsCounter, 0 mSdLazyCounter, 61 mSolverCounterSat, 4 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 571 SdHoareTripleChecker+Valid, 1653 SdHoareTripleChecker+Invalid, 65 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 4 IncrementalHoareTripleChecker+Valid, 61 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2025-02-05 21:56:05,251 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [571 Valid, 1653 Invalid, 65 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [4 Valid, 61 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2025-02-05 21:56:05,253 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1353 states. [2025-02-05 21:56:05,350 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1353 to 1351. [2025-02-05 21:56:05,355 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 1351 states, 930 states have (on average 1.5849462365591398) internal successors, (1474), 930 states have internal predecessors, (1474), 416 states have call successors, (416), 4 states have call predecessors, (416), 4 states have return successors, (416), 416 states have call predecessors, (416), 416 states have call successors, (416) [2025-02-05 21:56:05,362 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1351 states to 1351 states and 2306 transitions. [2025-02-05 21:56:05,364 INFO L78 Accepts]: Start accepts. Automaton has 1351 states and 2306 transitions. Word has length 670 [2025-02-05 21:56:05,365 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-02-05 21:56:05,365 INFO L471 AbstractCegarLoop]: Abstraction has 1351 states and 2306 transitions. [2025-02-05 21:56:05,365 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 51.0) internal successors, (153), 3 states have internal predecessors, (153), 1 states have call successors, (104), 1 states have call predecessors, (104), 1 states have return successors, (104), 1 states have call predecessors, (104), 1 states have call successors, (104) [2025-02-05 21:56:05,365 INFO L276 IsEmpty]: Start isEmpty. Operand 1351 states and 2306 transitions. [2025-02-05 21:56:05,372 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 671 [2025-02-05 21:56:05,373 INFO L210 NwaCegarLoop]: Found error trace [2025-02-05 21:56:05,373 INFO L218 NwaCegarLoop]: trace histogram [104, 104, 104, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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:56:05,373 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable2 [2025-02-05 21:56:05,373 INFO L396 AbstractCegarLoop]: === Iteration 4 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-02-05 21:56:05,374 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-02-05 21:56:05,374 INFO L85 PathProgramCache]: Analyzing trace with hash -212207119, now seen corresponding path program 1 times [2025-02-05 21:56:05,374 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-02-05 21:56:05,374 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1935107794] [2025-02-05 21:56:05,374 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-02-05 21:56:05,374 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-02-05 21:56:05,422 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 670 statements into 1 equivalence classes. [2025-02-05 21:56:05,458 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 670 of 670 statements. [2025-02-05 21:56:05,458 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-02-05 21:56:05,459 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-02-05 21:56:05,647 INFO L134 CoverageAnalysis]: Checked inductivity of 21424 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 21424 trivial. 0 not checked. [2025-02-05 21:56:05,647 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-02-05 21:56:05,647 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1935107794] [2025-02-05 21:56:05,647 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1935107794] provided 1 perfect and 0 imperfect interpolant sequences [2025-02-05 21:56:05,647 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-02-05 21:56:05,648 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2025-02-05 21:56:05,648 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [555071913] [2025-02-05 21:56:05,648 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-02-05 21:56:05,648 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2025-02-05 21:56:05,648 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-02-05 21:56:05,649 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2025-02-05 21:56:05,649 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-02-05 21:56:05,649 INFO L87 Difference]: Start difference. First operand 1351 states and 2306 transitions. Second operand has 3 states, 3 states have (on average 51.0) internal successors, (153), 3 states have internal predecessors, (153), 1 states have call successors, (104), 1 states have call predecessors, (104), 1 states have return successors, (104), 1 states have call predecessors, (104), 1 states have call successors, (104) [2025-02-05 21:56:05,795 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-02-05 21:56:05,795 INFO L93 Difference]: Finished difference Result 3395 states and 5819 transitions. [2025-02-05 21:56:05,795 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2025-02-05 21:56:05,796 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 51.0) internal successors, (153), 3 states have internal predecessors, (153), 1 states have call successors, (104), 1 states have call predecessors, (104), 1 states have return successors, (104), 1 states have call predecessors, (104), 1 states have call successors, (104) Word has length 670 [2025-02-05 21:56:05,796 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-02-05 21:56:05,806 INFO L225 Difference]: With dead ends: 3395 [2025-02-05 21:56:05,806 INFO L226 Difference]: Without dead ends: 2047 [2025-02-05 21:56:05,810 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:56:05,811 INFO L435 NwaCegarLoop]: 825 mSDtfsCounter, 337 mSDsluCounter, 554 mSDsCounter, 0 mSdLazyCounter, 57 mSolverCounterSat, 4 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 337 SdHoareTripleChecker+Valid, 1379 SdHoareTripleChecker+Invalid, 61 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 4 IncrementalHoareTripleChecker+Valid, 57 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2025-02-05 21:56:05,811 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [337 Valid, 1379 Invalid, 61 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [4 Valid, 57 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2025-02-05 21:56:05,812 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 2047 states. [2025-02-05 21:56:05,969 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 2047 to 2016. [2025-02-05 21:56:05,972 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 2016 states, 1503 states have (on average 1.6307385229540918) internal successors, (2451), 1507 states have internal predecessors, (2451), 504 states have call successors, (504), 8 states have call predecessors, (504), 8 states have return successors, (504), 500 states have call predecessors, (504), 504 states have call successors, (504) [2025-02-05 21:56:05,982 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 2016 states to 2016 states and 3459 transitions. [2025-02-05 21:56:05,984 INFO L78 Accepts]: Start accepts. Automaton has 2016 states and 3459 transitions. Word has length 670 [2025-02-05 21:56:05,985 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-02-05 21:56:05,985 INFO L471 AbstractCegarLoop]: Abstraction has 2016 states and 3459 transitions. [2025-02-05 21:56:05,985 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 51.0) internal successors, (153), 3 states have internal predecessors, (153), 1 states have call successors, (104), 1 states have call predecessors, (104), 1 states have return successors, (104), 1 states have call predecessors, (104), 1 states have call successors, (104) [2025-02-05 21:56:05,985 INFO L276 IsEmpty]: Start isEmpty. Operand 2016 states and 3459 transitions. [2025-02-05 21:56:05,990 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 671 [2025-02-05 21:56:05,990 INFO L210 NwaCegarLoop]: Found error trace [2025-02-05 21:56:05,990 INFO L218 NwaCegarLoop]: trace histogram [104, 104, 104, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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:56:05,990 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable3 [2025-02-05 21:56:05,990 INFO L396 AbstractCegarLoop]: === Iteration 5 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-02-05 21:56:05,991 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-02-05 21:56:05,991 INFO L85 PathProgramCache]: Analyzing trace with hash -41073601, now seen corresponding path program 1 times [2025-02-05 21:56:05,991 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-02-05 21:56:05,991 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1505135351] [2025-02-05 21:56:05,991 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-02-05 21:56:05,991 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-02-05 21:56:06,024 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 670 statements into 1 equivalence classes. [2025-02-05 21:56:06,062 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 670 of 670 statements. [2025-02-05 21:56:06,062 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-02-05 21:56:06,062 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-02-05 21:56:06,295 INFO L134 CoverageAnalysis]: Checked inductivity of 21424 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 21424 trivial. 0 not checked. [2025-02-05 21:56:06,295 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-02-05 21:56:06,295 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1505135351] [2025-02-05 21:56:06,295 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1505135351] provided 1 perfect and 0 imperfect interpolant sequences [2025-02-05 21:56:06,295 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-02-05 21:56:06,295 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2025-02-05 21:56:06,295 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1960391197] [2025-02-05 21:56:06,296 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-02-05 21:56:06,297 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2025-02-05 21:56:06,298 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-02-05 21:56:06,298 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2025-02-05 21:56:06,298 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2025-02-05 21:56:06,298 INFO L87 Difference]: Start difference. First operand 2016 states and 3459 transitions. Second operand has 4 states, 4 states have (on average 38.25) internal successors, (153), 4 states have internal predecessors, (153), 1 states have call successors, (104), 1 states have call predecessors, (104), 1 states have return successors, (104), 1 states have call predecessors, (104), 1 states have call successors, (104) [2025-02-05 21:56:06,678 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-02-05 21:56:06,678 INFO L93 Difference]: Finished difference Result 4732 states and 8125 transitions. [2025-02-05 21:56:06,678 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2025-02-05 21:56:06,679 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 4 states have (on average 38.25) internal successors, (153), 4 states have internal predecessors, (153), 1 states have call successors, (104), 1 states have call predecessors, (104), 1 states have return successors, (104), 1 states have call predecessors, (104), 1 states have call successors, (104) Word has length 670 [2025-02-05 21:56:06,681 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-02-05 21:56:06,697 INFO L225 Difference]: With dead ends: 4732 [2025-02-05 21:56:06,697 INFO L226 Difference]: Without dead ends: 2719 [2025-02-05 21:56:06,702 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 6 GetRequests, 3 SyntacticMatches, 0 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=9, Invalid=11, Unknown=0, NotChecked=0, Total=20 [2025-02-05 21:56:06,703 INFO L435 NwaCegarLoop]: 723 mSDtfsCounter, 965 mSDsluCounter, 1322 mSDsCounter, 0 mSdLazyCounter, 163 mSolverCounterSat, 72 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 965 SdHoareTripleChecker+Valid, 2045 SdHoareTripleChecker+Invalid, 235 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 72 IncrementalHoareTripleChecker+Valid, 163 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.3s IncrementalHoareTripleChecker+Time [2025-02-05 21:56:06,703 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [965 Valid, 2045 Invalid, 235 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [72 Valid, 163 Invalid, 0 Unknown, 0 Unchecked, 0.3s Time] [2025-02-05 21:56:06,706 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 2719 states. [2025-02-05 21:56:06,879 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 2719 to 2712. [2025-02-05 21:56:06,884 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 2712 states, 2079 states have (on average 1.6459836459836459) internal successors, (3422), 2087 states have internal predecessors, (3422), 620 states have call successors, (620), 12 states have call predecessors, (620), 12 states have return successors, (620), 612 states have call predecessors, (620), 620 states have call successors, (620) [2025-02-05 21:56:06,902 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 2712 states to 2712 states and 4662 transitions. [2025-02-05 21:56:06,905 INFO L78 Accepts]: Start accepts. Automaton has 2712 states and 4662 transitions. Word has length 670 [2025-02-05 21:56:06,906 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-02-05 21:56:06,906 INFO L471 AbstractCegarLoop]: Abstraction has 2712 states and 4662 transitions. [2025-02-05 21:56:06,906 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 38.25) internal successors, (153), 4 states have internal predecessors, (153), 1 states have call successors, (104), 1 states have call predecessors, (104), 1 states have return successors, (104), 1 states have call predecessors, (104), 1 states have call successors, (104) [2025-02-05 21:56:06,906 INFO L276 IsEmpty]: Start isEmpty. Operand 2712 states and 4662 transitions. [2025-02-05 21:56:06,913 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 671 [2025-02-05 21:56:06,913 INFO L210 NwaCegarLoop]: Found error trace [2025-02-05 21:56:06,914 INFO L218 NwaCegarLoop]: trace histogram [104, 104, 104, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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:56:06,915 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable4 [2025-02-05 21:56:06,916 INFO L396 AbstractCegarLoop]: === Iteration 6 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-02-05 21:56:06,917 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-02-05 21:56:06,917 INFO L85 PathProgramCache]: Analyzing trace with hash 79046272, now seen corresponding path program 1 times [2025-02-05 21:56:06,917 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-02-05 21:56:06,917 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1233515236] [2025-02-05 21:56:06,917 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-02-05 21:56:06,917 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-02-05 21:56:06,949 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 670 statements into 1 equivalence classes. [2025-02-05 21:56:06,980 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 670 of 670 statements. [2025-02-05 21:56:06,980 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-02-05 21:56:06,980 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-02-05 21:56:07,157 INFO L134 CoverageAnalysis]: Checked inductivity of 21424 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 21424 trivial. 0 not checked. [2025-02-05 21:56:07,157 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-02-05 21:56:07,157 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1233515236] [2025-02-05 21:56:07,157 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1233515236] provided 1 perfect and 0 imperfect interpolant sequences [2025-02-05 21:56:07,157 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-02-05 21:56:07,157 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2025-02-05 21:56:07,157 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [705282477] [2025-02-05 21:56:07,157 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-02-05 21:56:07,158 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2025-02-05 21:56:07,158 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-02-05 21:56:07,159 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2025-02-05 21:56:07,159 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-02-05 21:56:07,159 INFO L87 Difference]: Start difference. First operand 2712 states and 4662 transitions. Second operand has 3 states, 3 states have (on average 51.0) internal successors, (153), 3 states have internal predecessors, (153), 1 states have call successors, (104), 1 states have call predecessors, (104), 1 states have return successors, (104), 1 states have call predecessors, (104), 1 states have call successors, (104) [2025-02-05 21:56:07,432 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-02-05 21:56:07,432 INFO L93 Difference]: Finished difference Result 8130 states and 13980 transitions. [2025-02-05 21:56:07,432 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2025-02-05 21:56:07,433 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 51.0) internal successors, (153), 3 states have internal predecessors, (153), 1 states have call successors, (104), 1 states have call predecessors, (104), 1 states have return successors, (104), 1 states have call predecessors, (104), 1 states have call successors, (104) Word has length 670 [2025-02-05 21:56:07,434 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-02-05 21:56:07,468 INFO L225 Difference]: With dead ends: 8130 [2025-02-05 21:56:07,468 INFO L226 Difference]: Without dead ends: 5421 [2025-02-05 21:56:07,479 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:56:07,481 INFO L435 NwaCegarLoop]: 609 mSDtfsCounter, 564 mSDsluCounter, 555 mSDsCounter, 0 mSdLazyCounter, 48 mSolverCounterSat, 5 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 564 SdHoareTripleChecker+Valid, 1164 SdHoareTripleChecker+Invalid, 53 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 5 IncrementalHoareTripleChecker+Valid, 48 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2025-02-05 21:56:07,481 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [564 Valid, 1164 Invalid, 53 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [5 Valid, 48 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2025-02-05 21:56:07,486 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 5421 states. [2025-02-05 21:56:07,896 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 5421 to 5419. [2025-02-05 21:56:07,910 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 5419 states, 4154 states have (on average 1.6417910447761195) internal successors, (6820), 4170 states have internal predecessors, (6820), 1240 states have call successors, (1240), 24 states have call predecessors, (1240), 24 states have return successors, (1240), 1224 states have call predecessors, (1240), 1240 states have call successors, (1240) [2025-02-05 21:56:07,932 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5419 states to 5419 states and 9300 transitions. [2025-02-05 21:56:07,937 INFO L78 Accepts]: Start accepts. Automaton has 5419 states and 9300 transitions. Word has length 670 [2025-02-05 21:56:07,938 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-02-05 21:56:07,938 INFO L471 AbstractCegarLoop]: Abstraction has 5419 states and 9300 transitions. [2025-02-05 21:56:07,938 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 51.0) internal successors, (153), 3 states have internal predecessors, (153), 1 states have call successors, (104), 1 states have call predecessors, (104), 1 states have return successors, (104), 1 states have call predecessors, (104), 1 states have call successors, (104) [2025-02-05 21:56:07,938 INFO L276 IsEmpty]: Start isEmpty. Operand 5419 states and 9300 transitions. [2025-02-05 21:56:07,945 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 671 [2025-02-05 21:56:07,945 INFO L210 NwaCegarLoop]: Found error trace [2025-02-05 21:56:07,946 INFO L218 NwaCegarLoop]: trace histogram [104, 104, 104, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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:56:07,946 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable5 [2025-02-05 21:56:07,946 INFO L396 AbstractCegarLoop]: === Iteration 7 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-02-05 21:56:07,947 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-02-05 21:56:07,947 INFO L85 PathProgramCache]: Analyzing trace with hash -945647649, now seen corresponding path program 1 times [2025-02-05 21:56:07,947 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-02-05 21:56:07,947 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [53215480] [2025-02-05 21:56:07,947 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-02-05 21:56:07,947 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-02-05 21:56:07,974 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 670 statements into 1 equivalence classes. [2025-02-05 21:56:08,004 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 670 of 670 statements. [2025-02-05 21:56:08,004 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-02-05 21:56:08,005 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-02-05 21:56:08,326 INFO L134 CoverageAnalysis]: Checked inductivity of 21424 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 21424 trivial. 0 not checked. [2025-02-05 21:56:08,326 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-02-05 21:56:08,326 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [53215480] [2025-02-05 21:56:08,326 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [53215480] provided 1 perfect and 0 imperfect interpolant sequences [2025-02-05 21:56:08,326 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-02-05 21:56:08,326 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2025-02-05 21:56:08,326 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [147459970] [2025-02-05 21:56:08,326 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-02-05 21:56:08,327 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2025-02-05 21:56:08,327 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-02-05 21:56:08,327 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2025-02-05 21:56:08,327 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-02-05 21:56:08,331 INFO L87 Difference]: Start difference. First operand 5419 states and 9300 transitions. Second operand has 3 states, 3 states have (on average 51.0) internal successors, (153), 3 states have internal predecessors, (153), 1 states have call successors, (104), 1 states have call predecessors, (104), 1 states have return successors, (104), 1 states have call predecessors, (104), 1 states have call successors, (104) [2025-02-05 21:56:08,826 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-02-05 21:56:08,826 INFO L93 Difference]: Finished difference Result 14131 states and 24248 transitions. [2025-02-05 21:56:08,827 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2025-02-05 21:56:08,832 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 51.0) internal successors, (153), 3 states have internal predecessors, (153), 1 states have call successors, (104), 1 states have call predecessors, (104), 1 states have return successors, (104), 1 states have call predecessors, (104), 1 states have call successors, (104) Word has length 670 [2025-02-05 21:56:08,837 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-02-05 21:56:08,882 INFO L225 Difference]: With dead ends: 14131 [2025-02-05 21:56:08,883 INFO L226 Difference]: Without dead ends: 8715 [2025-02-05 21:56:08,894 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:56:08,894 INFO L435 NwaCegarLoop]: 711 mSDtfsCounter, 359 mSDsluCounter, 532 mSDsCounter, 0 mSdLazyCounter, 100 mSolverCounterSat, 2 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 359 SdHoareTripleChecker+Valid, 1243 SdHoareTripleChecker+Invalid, 102 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 2 IncrementalHoareTripleChecker+Valid, 100 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2025-02-05 21:56:08,895 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [359 Valid, 1243 Invalid, 102 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [2 Valid, 100 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2025-02-05 21:56:08,902 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 8715 states. [2025-02-05 21:56:09,493 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 8715 to 8711. [2025-02-05 21:56:09,508 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 8711 states, 6694 states have (on average 1.6402748730206156) internal successors, (10980), 6722 states have internal predecessors, (10980), 1976 states have call successors, (1976), 40 states have call predecessors, (1976), 40 states have return successors, (1976), 1948 states have call predecessors, (1976), 1976 states have call successors, (1976) [2025-02-05 21:56:09,549 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 8711 states to 8711 states and 14932 transitions. [2025-02-05 21:56:09,562 INFO L78 Accepts]: Start accepts. Automaton has 8711 states and 14932 transitions. Word has length 670 [2025-02-05 21:56:09,563 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-02-05 21:56:09,564 INFO L471 AbstractCegarLoop]: Abstraction has 8711 states and 14932 transitions. [2025-02-05 21:56:09,564 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 51.0) internal successors, (153), 3 states have internal predecessors, (153), 1 states have call successors, (104), 1 states have call predecessors, (104), 1 states have return successors, (104), 1 states have call predecessors, (104), 1 states have call successors, (104) [2025-02-05 21:56:09,564 INFO L276 IsEmpty]: Start isEmpty. Operand 8711 states and 14932 transitions. [2025-02-05 21:56:09,577 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 672 [2025-02-05 21:56:09,577 INFO L210 NwaCegarLoop]: Found error trace [2025-02-05 21:56:09,577 INFO L218 NwaCegarLoop]: trace histogram [104, 104, 104, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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:56:09,578 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable6 [2025-02-05 21:56:09,578 INFO L396 AbstractCegarLoop]: === Iteration 8 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-02-05 21:56:09,578 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-02-05 21:56:09,578 INFO L85 PathProgramCache]: Analyzing trace with hash 799063646, now seen corresponding path program 1 times [2025-02-05 21:56:09,579 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-02-05 21:56:09,579 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2141003889] [2025-02-05 21:56:09,579 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-02-05 21:56:09,579 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-02-05 21:56:09,616 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 671 statements into 1 equivalence classes. [2025-02-05 21:56:09,652 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 671 of 671 statements. [2025-02-05 21:56:09,653 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-02-05 21:56:09,653 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-02-05 21:56:09,808 INFO L134 CoverageAnalysis]: Checked inductivity of 21424 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 21424 trivial. 0 not checked. [2025-02-05 21:56:09,808 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-02-05 21:56:09,808 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2141003889] [2025-02-05 21:56:09,809 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [2141003889] provided 1 perfect and 0 imperfect interpolant sequences [2025-02-05 21:56:09,809 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-02-05 21:56:09,809 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2025-02-05 21:56:09,809 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1078649418] [2025-02-05 21:56:09,809 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-02-05 21:56:09,810 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2025-02-05 21:56:09,810 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-02-05 21:56:09,810 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2025-02-05 21:56:09,810 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-02-05 21:56:09,811 INFO L87 Difference]: Start difference. First operand 8711 states and 14932 transitions. Second operand has 3 states, 3 states have (on average 51.333333333333336) internal successors, (154), 3 states have internal predecessors, (154), 1 states have call successors, (104), 1 states have call predecessors, (104), 1 states have return successors, (104), 1 states have call predecessors, (104), 1 states have call successors, (104) [2025-02-05 21:56:10,097 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-02-05 21:56:10,098 INFO L93 Difference]: Finished difference Result 13079 states and 22435 transitions. [2025-02-05 21:56:10,099 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2025-02-05 21:56:10,099 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 51.333333333333336) internal successors, (154), 3 states have internal predecessors, (154), 1 states have call successors, (104), 1 states have call predecessors, (104), 1 states have return successors, (104), 1 states have call predecessors, (104), 1 states have call successors, (104) Word has length 671 [2025-02-05 21:56:10,100 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-02-05 21:56:10,130 INFO L225 Difference]: With dead ends: 13079 [2025-02-05 21:56:10,131 INFO L226 Difference]: Without dead ends: 4371 [2025-02-05 21:56:10,154 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:56:10,154 INFO L435 NwaCegarLoop]: 555 mSDtfsCounter, 555 mSDsluCounter, 0 mSDsCounter, 0 mSdLazyCounter, 22 mSolverCounterSat, 4 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 555 SdHoareTripleChecker+Valid, 555 SdHoareTripleChecker+Invalid, 26 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 4 IncrementalHoareTripleChecker+Valid, 22 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2025-02-05 21:56:10,155 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [555 Valid, 555 Invalid, 26 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [4 Valid, 22 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2025-02-05 21:56:10,159 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 4371 states. [2025-02-05 21:56:10,424 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 4371 to 4371. [2025-02-05 21:56:10,429 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 4371 states, 3362 states have (on average 1.6347412254610352) internal successors, (5496), 3376 states have internal predecessors, (5496), 988 states have call successors, (988), 20 states have call predecessors, (988), 20 states have return successors, (988), 974 states have call predecessors, (988), 988 states have call successors, (988) [2025-02-05 21:56:10,445 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4371 states to 4371 states and 7472 transitions. [2025-02-05 21:56:10,450 INFO L78 Accepts]: Start accepts. Automaton has 4371 states and 7472 transitions. Word has length 671 [2025-02-05 21:56:10,451 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-02-05 21:56:10,451 INFO L471 AbstractCegarLoop]: Abstraction has 4371 states and 7472 transitions. [2025-02-05 21:56:10,451 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 51.333333333333336) internal successors, (154), 3 states have internal predecessors, (154), 1 states have call successors, (104), 1 states have call predecessors, (104), 1 states have return successors, (104), 1 states have call predecessors, (104), 1 states have call successors, (104) [2025-02-05 21:56:10,451 INFO L276 IsEmpty]: Start isEmpty. Operand 4371 states and 7472 transitions. [2025-02-05 21:56:10,457 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 672 [2025-02-05 21:56:10,457 INFO L210 NwaCegarLoop]: Found error trace [2025-02-05 21:56:10,458 INFO L218 NwaCegarLoop]: trace histogram [104, 104, 104, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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:56:10,458 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable7 [2025-02-05 21:56:10,458 INFO L396 AbstractCegarLoop]: === Iteration 9 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-02-05 21:56:10,458 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-02-05 21:56:10,459 INFO L85 PathProgramCache]: Analyzing trace with hash 1429522271, now seen corresponding path program 1 times [2025-02-05 21:56:10,459 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-02-05 21:56:10,459 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1750496713] [2025-02-05 21:56:10,459 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-02-05 21:56:10,459 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-02-05 21:56:10,487 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 671 statements into 1 equivalence classes. [2025-02-05 21:56:10,516 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 671 of 671 statements. [2025-02-05 21:56:10,517 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-02-05 21:56:10,517 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-02-05 21:56:10,641 INFO L134 CoverageAnalysis]: Checked inductivity of 21424 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 21424 trivial. 0 not checked. [2025-02-05 21:56:10,641 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-02-05 21:56:10,641 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1750496713] [2025-02-05 21:56:10,642 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1750496713] provided 1 perfect and 0 imperfect interpolant sequences [2025-02-05 21:56:10,642 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-02-05 21:56:10,642 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2025-02-05 21:56:10,642 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1178315684] [2025-02-05 21:56:10,642 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-02-05 21:56:10,643 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2025-02-05 21:56:10,643 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-02-05 21:56:10,643 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2025-02-05 21:56:10,643 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-02-05 21:56:10,644 INFO L87 Difference]: Start difference. First operand 4371 states and 7472 transitions. Second operand has 3 states, 3 states have (on average 51.333333333333336) internal successors, (154), 3 states have internal predecessors, (154), 1 states have call successors, (104), 1 states have call predecessors, (104), 1 states have return successors, (104), 1 states have call predecessors, (104), 1 states have call successors, (104) [2025-02-05 21:56:11,033 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-02-05 21:56:11,033 INFO L93 Difference]: Finished difference Result 13007 states and 22230 transitions. [2025-02-05 21:56:11,034 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2025-02-05 21:56:11,034 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 51.333333333333336) internal successors, (154), 3 states have internal predecessors, (154), 1 states have call successors, (104), 1 states have call predecessors, (104), 1 states have return successors, (104), 1 states have call predecessors, (104), 1 states have call successors, (104) Word has length 671 [2025-02-05 21:56:11,035 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-02-05 21:56:11,068 INFO L225 Difference]: With dead ends: 13007 [2025-02-05 21:56:11,068 INFO L226 Difference]: Without dead ends: 8639 [2025-02-05 21:56:11,087 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:56:11,090 INFO L435 NwaCegarLoop]: 613 mSDtfsCounter, 540 mSDsluCounter, 550 mSDsCounter, 0 mSdLazyCounter, 42 mSolverCounterSat, 5 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 540 SdHoareTripleChecker+Valid, 1163 SdHoareTripleChecker+Invalid, 47 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 5 IncrementalHoareTripleChecker+Valid, 42 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2025-02-05 21:56:11,090 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [540 Valid, 1163 Invalid, 47 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [5 Valid, 42 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2025-02-05 21:56:11,098 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 8639 states. [2025-02-05 21:56:11,566 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 8639 to 8637. [2025-02-05 21:56:11,579 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 8637 states, 6620 states have (on average 1.6235649546827795) internal successors, (10748), 6648 states have internal predecessors, (10748), 1976 states have call successors, (1976), 40 states have call predecessors, (1976), 40 states have return successors, (1976), 1948 states have call predecessors, (1976), 1976 states have call successors, (1976) [2025-02-05 21:56:11,609 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 8637 states to 8637 states and 14700 transitions. [2025-02-05 21:56:11,617 INFO L78 Accepts]: Start accepts. Automaton has 8637 states and 14700 transitions. Word has length 671 [2025-02-05 21:56:11,618 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-02-05 21:56:11,618 INFO L471 AbstractCegarLoop]: Abstraction has 8637 states and 14700 transitions. [2025-02-05 21:56:11,618 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 51.333333333333336) internal successors, (154), 3 states have internal predecessors, (154), 1 states have call successors, (104), 1 states have call predecessors, (104), 1 states have return successors, (104), 1 states have call predecessors, (104), 1 states have call successors, (104) [2025-02-05 21:56:11,619 INFO L276 IsEmpty]: Start isEmpty. Operand 8637 states and 14700 transitions. [2025-02-05 21:56:11,628 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 672 [2025-02-05 21:56:11,628 INFO L210 NwaCegarLoop]: Found error trace [2025-02-05 21:56:11,628 INFO L218 NwaCegarLoop]: trace histogram [104, 104, 104, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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:56:11,628 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable8 [2025-02-05 21:56:11,629 INFO L396 AbstractCegarLoop]: === Iteration 10 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-02-05 21:56:11,629 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-02-05 21:56:11,629 INFO L85 PathProgramCache]: Analyzing trace with hash 765961501, now seen corresponding path program 1 times [2025-02-05 21:56:11,629 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-02-05 21:56:11,629 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1953518293] [2025-02-05 21:56:11,629 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-02-05 21:56:11,629 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-02-05 21:56:11,658 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 671 statements into 1 equivalence classes. [2025-02-05 21:56:11,688 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 671 of 671 statements. [2025-02-05 21:56:11,688 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-02-05 21:56:11,688 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-02-05 21:56:11,935 INFO L134 CoverageAnalysis]: Checked inductivity of 21424 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 21424 trivial. 0 not checked. [2025-02-05 21:56:11,935 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-02-05 21:56:11,935 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1953518293] [2025-02-05 21:56:11,935 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1953518293] provided 1 perfect and 0 imperfect interpolant sequences [2025-02-05 21:56:11,935 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-02-05 21:56:11,935 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2025-02-05 21:56:11,936 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1592916265] [2025-02-05 21:56:11,936 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-02-05 21:56:11,936 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2025-02-05 21:56:11,936 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-02-05 21:56:11,937 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2025-02-05 21:56:11,937 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2025-02-05 21:56:11,937 INFO L87 Difference]: Start difference. First operand 8637 states and 14700 transitions. Second operand has 4 states, 4 states have (on average 38.5) internal successors, (154), 4 states have internal predecessors, (154), 1 states have call successors, (104), 1 states have call predecessors, (104), 1 states have return successors, (104), 1 states have call predecessors, (104), 1 states have call successors, (104) [2025-02-05 21:56:12,217 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-02-05 21:56:12,217 INFO L93 Difference]: Finished difference Result 17271 states and 29397 transitions. [2025-02-05 21:56:12,218 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2025-02-05 21:56:12,218 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 4 states have (on average 38.5) internal successors, (154), 4 states have internal predecessors, (154), 1 states have call successors, (104), 1 states have call predecessors, (104), 1 states have return successors, (104), 1 states have call predecessors, (104), 1 states have call successors, (104) Word has length 671 [2025-02-05 21:56:12,219 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-02-05 21:56:12,261 INFO L225 Difference]: With dead ends: 17271 [2025-02-05 21:56:12,262 INFO L226 Difference]: Without dead ends: 8637 [2025-02-05 21:56:12,293 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 5 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=9, Invalid=11, Unknown=0, NotChecked=0, Total=20 [2025-02-05 21:56:12,294 INFO L435 NwaCegarLoop]: 553 mSDtfsCounter, 567 mSDsluCounter, 548 mSDsCounter, 0 mSdLazyCounter, 50 mSolverCounterSat, 2 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 567 SdHoareTripleChecker+Valid, 1101 SdHoareTripleChecker+Invalid, 52 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 2 IncrementalHoareTripleChecker+Valid, 50 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2025-02-05 21:56:12,294 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [567 Valid, 1101 Invalid, 52 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [2 Valid, 50 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2025-02-05 21:56:12,302 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 8637 states. [2025-02-05 21:56:12,890 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 8637 to 8637. [2025-02-05 21:56:12,901 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 8637 states, 6620 states have (on average 1.6199395770392748) internal successors, (10724), 6648 states have internal predecessors, (10724), 1976 states have call successors, (1976), 40 states have call predecessors, (1976), 40 states have return successors, (1976), 1948 states have call predecessors, (1976), 1976 states have call successors, (1976) [2025-02-05 21:56:12,934 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 8637 states to 8637 states and 14676 transitions. [2025-02-05 21:56:12,944 INFO L78 Accepts]: Start accepts. Automaton has 8637 states and 14676 transitions. Word has length 671 [2025-02-05 21:56:12,945 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-02-05 21:56:12,945 INFO L471 AbstractCegarLoop]: Abstraction has 8637 states and 14676 transitions. [2025-02-05 21:56:12,945 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 38.5) internal successors, (154), 4 states have internal predecessors, (154), 1 states have call successors, (104), 1 states have call predecessors, (104), 1 states have return successors, (104), 1 states have call predecessors, (104), 1 states have call successors, (104) [2025-02-05 21:56:12,946 INFO L276 IsEmpty]: Start isEmpty. Operand 8637 states and 14676 transitions. [2025-02-05 21:56:12,956 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 674 [2025-02-05 21:56:12,956 INFO L210 NwaCegarLoop]: Found error trace [2025-02-05 21:56:12,957 INFO L218 NwaCegarLoop]: trace histogram [104, 104, 104, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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:56:12,957 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable9 [2025-02-05 21:56:12,957 INFO L396 AbstractCegarLoop]: === Iteration 11 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-02-05 21:56:12,958 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-02-05 21:56:12,958 INFO L85 PathProgramCache]: Analyzing trace with hash -1401623555, now seen corresponding path program 1 times [2025-02-05 21:56:12,958 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-02-05 21:56:12,958 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [132691089] [2025-02-05 21:56:12,958 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-02-05 21:56:12,958 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-02-05 21:56:12,992 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 673 statements into 1 equivalence classes. [2025-02-05 21:56:13,058 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 673 of 673 statements. [2025-02-05 21:56:13,058 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-02-05 21:56:13,058 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-02-05 21:56:13,354 INFO L134 CoverageAnalysis]: Checked inductivity of 21424 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 21424 trivial. 0 not checked. [2025-02-05 21:56:13,354 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-02-05 21:56:13,354 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [132691089] [2025-02-05 21:56:13,354 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [132691089] provided 1 perfect and 0 imperfect interpolant sequences [2025-02-05 21:56:13,354 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-02-05 21:56:13,355 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2025-02-05 21:56:13,355 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [970152473] [2025-02-05 21:56:13,355 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-02-05 21:56:13,355 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2025-02-05 21:56:13,355 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-02-05 21:56:13,356 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2025-02-05 21:56:13,356 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-02-05 21:56:13,356 INFO L87 Difference]: Start difference. First operand 8637 states and 14676 transitions. Second operand has 3 states, 3 states have (on average 52.0) internal successors, (156), 3 states have internal predecessors, (156), 1 states have call successors, (104), 1 states have call predecessors, (104), 1 states have return successors, (104), 1 states have call predecessors, (104), 1 states have call successors, (104) [2025-02-05 21:56:13,859 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-02-05 21:56:13,859 INFO L93 Difference]: Finished difference Result 22457 states and 37678 transitions. [2025-02-05 21:56:13,860 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2025-02-05 21:56:13,860 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 52.0) internal successors, (156), 3 states have internal predecessors, (156), 1 states have call successors, (104), 1 states have call predecessors, (104), 1 states have return successors, (104), 1 states have call predecessors, (104), 1 states have call successors, (104) Word has length 673 [2025-02-05 21:56:13,861 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-02-05 21:56:13,920 INFO L225 Difference]: With dead ends: 22457 [2025-02-05 21:56:13,921 INFO L226 Difference]: Without dead ends: 13823 [2025-02-05 21:56:13,945 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 4 GetRequests, 3 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-02-05 21:56:13,947 INFO L435 NwaCegarLoop]: 595 mSDtfsCounter, 392 mSDsluCounter, 546 mSDsCounter, 0 mSdLazyCounter, 42 mSolverCounterSat, 2 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 392 SdHoareTripleChecker+Valid, 1141 SdHoareTripleChecker+Invalid, 44 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 2 IncrementalHoareTripleChecker+Valid, 42 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2025-02-05 21:56:13,947 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [392 Valid, 1141 Invalid, 44 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [2 Valid, 42 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2025-02-05 21:56:13,960 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 13823 states. [2025-02-05 21:56:14,728 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 13823 to 8677. [2025-02-05 21:56:14,740 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 8677 states, 6660 states have (on average 1.6162162162162161) internal successors, (10764), 6688 states have internal predecessors, (10764), 1976 states have call successors, (1976), 40 states have call predecessors, (1976), 40 states have return successors, (1976), 1948 states have call predecessors, (1976), 1976 states have call successors, (1976) [2025-02-05 21:56:14,765 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 8677 states to 8677 states and 14716 transitions. [2025-02-05 21:56:14,777 INFO L78 Accepts]: Start accepts. Automaton has 8677 states and 14716 transitions. Word has length 673 [2025-02-05 21:56:14,778 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-02-05 21:56:14,778 INFO L471 AbstractCegarLoop]: Abstraction has 8677 states and 14716 transitions. [2025-02-05 21:56:14,779 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 52.0) internal successors, (156), 3 states have internal predecessors, (156), 1 states have call successors, (104), 1 states have call predecessors, (104), 1 states have return successors, (104), 1 states have call predecessors, (104), 1 states have call successors, (104) [2025-02-05 21:56:14,779 INFO L276 IsEmpty]: Start isEmpty. Operand 8677 states and 14716 transitions. [2025-02-05 21:56:14,787 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 674 [2025-02-05 21:56:14,787 INFO L210 NwaCegarLoop]: Found error trace [2025-02-05 21:56:14,788 INFO L218 NwaCegarLoop]: trace histogram [104, 104, 104, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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:56:14,788 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable10 [2025-02-05 21:56:14,789 INFO L396 AbstractCegarLoop]: === Iteration 12 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-02-05 21:56:14,789 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-02-05 21:56:14,790 INFO L85 PathProgramCache]: Analyzing trace with hash 2048871870, now seen corresponding path program 1 times [2025-02-05 21:56:14,790 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-02-05 21:56:14,790 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [508839481] [2025-02-05 21:56:14,790 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-02-05 21:56:14,790 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-02-05 21:56:14,817 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 673 statements into 1 equivalence classes. [2025-02-05 21:56:14,861 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 673 of 673 statements. [2025-02-05 21:56:14,861 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-02-05 21:56:14,861 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-02-05 21:56:15,129 INFO L134 CoverageAnalysis]: Checked inductivity of 21424 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 21424 trivial. 0 not checked. [2025-02-05 21:56:15,129 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-02-05 21:56:15,129 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [508839481] [2025-02-05 21:56:15,129 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [508839481] provided 1 perfect and 0 imperfect interpolant sequences [2025-02-05 21:56:15,129 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-02-05 21:56:15,130 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2025-02-05 21:56:15,130 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1498121629] [2025-02-05 21:56:15,130 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-02-05 21:56:15,131 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2025-02-05 21:56:15,131 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-02-05 21:56:15,131 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2025-02-05 21:56:15,132 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2025-02-05 21:56:15,132 INFO L87 Difference]: Start difference. First operand 8677 states and 14716 transitions. Second operand has 4 states, 4 states have (on average 39.0) internal successors, (156), 4 states have internal predecessors, (156), 1 states have call successors, (104), 1 states have call predecessors, (104), 1 states have return successors, (104), 1 states have call predecessors, (104), 1 states have call successors, (104) [2025-02-05 21:56:15,930 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-02-05 21:56:15,930 INFO L93 Difference]: Finished difference Result 13995 states and 23747 transitions. [2025-02-05 21:56:15,998 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2025-02-05 21:56:15,999 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 4 states have (on average 39.0) internal successors, (156), 4 states have internal predecessors, (156), 1 states have call successors, (104), 1 states have call predecessors, (104), 1 states have return successors, (104), 1 states have call predecessors, (104), 1 states have call successors, (104) Word has length 673 [2025-02-05 21:56:16,000 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-02-05 21:56:16,037 INFO L225 Difference]: With dead ends: 13995 [2025-02-05 21:56:16,037 INFO L226 Difference]: Without dead ends: 11841 [2025-02-05 21:56:16,043 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:56:16,043 INFO L435 NwaCegarLoop]: 689 mSDtfsCounter, 819 mSDsluCounter, 1006 mSDsCounter, 0 mSdLazyCounter, 348 mSolverCounterSat, 144 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.4s Time, 0 mProtectedPredicate, 0 mProtectedAction, 819 SdHoareTripleChecker+Valid, 1695 SdHoareTripleChecker+Invalid, 492 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 144 IncrementalHoareTripleChecker+Valid, 348 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.5s IncrementalHoareTripleChecker+Time [2025-02-05 21:56:16,043 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [819 Valid, 1695 Invalid, 492 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [144 Valid, 348 Invalid, 0 Unknown, 0 Unchecked, 0.5s Time] [2025-02-05 21:56:16,052 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 11841 states. [2025-02-05 21:56:16,571 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 11841 to 11821. [2025-02-05 21:56:16,588 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 11821 states, 9304 states have (on average 1.6276870163370594) internal successors, (15144), 9348 states have internal predecessors, (15144), 2456 states have call successors, (2456), 60 states have call predecessors, (2456), 60 states have return successors, (2456), 2412 states have call predecessors, (2456), 2456 states have call successors, (2456) [2025-02-05 21:56:16,620 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 11821 states to 11821 states and 20056 transitions. [2025-02-05 21:56:16,633 INFO L78 Accepts]: Start accepts. Automaton has 11821 states and 20056 transitions. Word has length 673 [2025-02-05 21:56:16,634 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-02-05 21:56:16,634 INFO L471 AbstractCegarLoop]: Abstraction has 11821 states and 20056 transitions. [2025-02-05 21:56:16,634 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 39.0) internal successors, (156), 4 states have internal predecessors, (156), 1 states have call successors, (104), 1 states have call predecessors, (104), 1 states have return successors, (104), 1 states have call predecessors, (104), 1 states have call successors, (104) [2025-02-05 21:56:16,635 INFO L276 IsEmpty]: Start isEmpty. Operand 11821 states and 20056 transitions. [2025-02-05 21:56:16,644 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 674 [2025-02-05 21:56:16,644 INFO L210 NwaCegarLoop]: Found error trace [2025-02-05 21:56:16,644 INFO L218 NwaCegarLoop]: trace histogram [104, 104, 104, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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:56:16,644 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable11 [2025-02-05 21:56:16,644 INFO L396 AbstractCegarLoop]: === Iteration 13 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-02-05 21:56:16,645 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-02-05 21:56:16,645 INFO L85 PathProgramCache]: Analyzing trace with hash -1775521475, now seen corresponding path program 1 times [2025-02-05 21:56:16,645 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-02-05 21:56:16,645 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [326162471] [2025-02-05 21:56:16,646 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-02-05 21:56:16,646 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-02-05 21:56:16,669 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 673 statements into 1 equivalence classes. [2025-02-05 21:56:16,712 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 673 of 673 statements. [2025-02-05 21:56:16,712 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-02-05 21:56:16,712 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-02-05 21:56:17,183 INFO L134 CoverageAnalysis]: Checked inductivity of 21424 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 21424 trivial. 0 not checked. [2025-02-05 21:56:17,184 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-02-05 21:56:17,184 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [326162471] [2025-02-05 21:56:17,184 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [326162471] provided 1 perfect and 0 imperfect interpolant sequences [2025-02-05 21:56:17,184 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-02-05 21:56:17,184 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2025-02-05 21:56:17,184 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [320714159] [2025-02-05 21:56:17,184 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-02-05 21:56:17,185 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2025-02-05 21:56:17,185 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-02-05 21:56:17,186 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2025-02-05 21:56:17,187 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=14, Invalid=16, Unknown=0, NotChecked=0, Total=30 [2025-02-05 21:56:17,187 INFO L87 Difference]: Start difference. First operand 11821 states and 20056 transitions. Second operand has 6 states, 6 states have (on average 26.0) internal successors, (156), 6 states have internal predecessors, (156), 1 states have call successors, (104), 1 states have call predecessors, (104), 1 states have return successors, (104), 1 states have call predecessors, (104), 1 states have call successors, (104) [2025-02-05 21:56:18,841 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-02-05 21:56:18,841 INFO L93 Difference]: Finished difference Result 25451 states and 43130 transitions. [2025-02-05 21:56:18,842 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2025-02-05 21:56:18,842 INFO L78 Accepts]: Start accepts. Automaton has has 6 states, 6 states have (on average 26.0) internal successors, (156), 6 states have internal predecessors, (156), 1 states have call successors, (104), 1 states have call predecessors, (104), 1 states have return successors, (104), 1 states have call predecessors, (104), 1 states have call successors, (104) Word has length 673 [2025-02-05 21:56:18,843 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-02-05 21:56:18,899 INFO L225 Difference]: With dead ends: 25451 [2025-02-05 21:56:18,899 INFO L226 Difference]: Without dead ends: 13633 [2025-02-05 21:56:18,924 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 8 GetRequests, 3 SyntacticMatches, 0 SemanticMatches, 5 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=20, Invalid=22, Unknown=0, NotChecked=0, Total=42 [2025-02-05 21:56:18,925 INFO L435 NwaCegarLoop]: 918 mSDtfsCounter, 1868 mSDsluCounter, 941 mSDsCounter, 0 mSdLazyCounter, 884 mSolverCounterSat, 107 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.8s Time, 0 mProtectedPredicate, 0 mProtectedAction, 1868 SdHoareTripleChecker+Valid, 1859 SdHoareTripleChecker+Invalid, 991 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 107 IncrementalHoareTripleChecker+Valid, 884 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.9s IncrementalHoareTripleChecker+Time [2025-02-05 21:56:18,925 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [1868 Valid, 1859 Invalid, 991 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [107 Valid, 884 Invalid, 0 Unknown, 0 Unchecked, 0.9s Time] [2025-02-05 21:56:18,934 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 13633 states. [2025-02-05 21:56:19,569 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 13633 to 13615. [2025-02-05 21:56:19,586 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 13615 states, 10762 states have (on average 1.6244192529269652) internal successors, (17482), 10818 states have internal predecessors, (17482), 2768 states have call successors, (2768), 84 states have call predecessors, (2768), 84 states have return successors, (2768), 2712 states have call predecessors, (2768), 2768 states have call successors, (2768) [2025-02-05 21:56:19,613 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 13615 states to 13615 states and 23018 transitions. [2025-02-05 21:56:19,626 INFO L78 Accepts]: Start accepts. Automaton has 13615 states and 23018 transitions. Word has length 673 [2025-02-05 21:56:19,629 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-02-05 21:56:19,629 INFO L471 AbstractCegarLoop]: Abstraction has 13615 states and 23018 transitions. [2025-02-05 21:56:19,629 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 6 states have (on average 26.0) internal successors, (156), 6 states have internal predecessors, (156), 1 states have call successors, (104), 1 states have call predecessors, (104), 1 states have return successors, (104), 1 states have call predecessors, (104), 1 states have call successors, (104) [2025-02-05 21:56:19,629 INFO L276 IsEmpty]: Start isEmpty. Operand 13615 states and 23018 transitions. [2025-02-05 21:56:19,640 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 674 [2025-02-05 21:56:19,640 INFO L210 NwaCegarLoop]: Found error trace [2025-02-05 21:56:19,641 INFO L218 NwaCegarLoop]: trace histogram [104, 104, 104, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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:56:19,641 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable12 [2025-02-05 21:56:19,642 INFO L396 AbstractCegarLoop]: === Iteration 14 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-02-05 21:56:19,642 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-02-05 21:56:19,642 INFO L85 PathProgramCache]: Analyzing trace with hash -1462716451, now seen corresponding path program 1 times [2025-02-05 21:56:19,642 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-02-05 21:56:19,642 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1354104477] [2025-02-05 21:56:19,643 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-02-05 21:56:19,643 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-02-05 21:56:19,671 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 673 statements into 1 equivalence classes. [2025-02-05 21:56:19,706 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 673 of 673 statements. [2025-02-05 21:56:19,710 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-02-05 21:56:19,711 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-02-05 21:56:20,559 INFO L134 CoverageAnalysis]: Checked inductivity of 21424 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 21424 trivial. 0 not checked. [2025-02-05 21:56:20,559 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-02-05 21:56:20,561 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1354104477] [2025-02-05 21:56:20,561 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1354104477] provided 1 perfect and 0 imperfect interpolant sequences [2025-02-05 21:56:20,561 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-02-05 21:56:20,561 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [13] imperfect sequences [] total 13 [2025-02-05 21:56:20,561 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1563230138] [2025-02-05 21:56:20,561 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-02-05 21:56:20,562 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 13 states [2025-02-05 21:56:20,562 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-02-05 21:56:20,562 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 13 interpolants. [2025-02-05 21:56:20,563 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=28, Invalid=128, Unknown=0, NotChecked=0, Total=156 [2025-02-05 21:56:20,563 INFO L87 Difference]: Start difference. First operand 13615 states and 23018 transitions. Second operand has 13 states, 13 states have (on average 12.0) internal successors, (156), 13 states have internal predecessors, (156), 2 states have call successors, (104), 1 states have call predecessors, (104), 1 states have return successors, (104), 2 states have call predecessors, (104), 2 states have call successors, (104) [2025-02-05 21:56:25,229 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-02-05 21:56:25,229 INFO L93 Difference]: Finished difference Result 43309 states and 72755 transitions. [2025-02-05 21:56:25,229 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 22 states. [2025-02-05 21:56:25,230 INFO L78 Accepts]: Start accepts. Automaton has has 13 states, 13 states have (on average 12.0) internal successors, (156), 13 states have internal predecessors, (156), 2 states have call successors, (104), 1 states have call predecessors, (104), 1 states have return successors, (104), 2 states have call predecessors, (104), 2 states have call successors, (104) Word has length 673 [2025-02-05 21:56:25,230 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-02-05 21:56:25,321 INFO L225 Difference]: With dead ends: 43309 [2025-02-05 21:56:25,321 INFO L226 Difference]: Without dead ends: 29697 [2025-02-05 21:56:25,344 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 43 GetRequests, 13 SyntacticMatches, 0 SemanticMatches, 30 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 127 ImplicationChecksByTransitivity, 0.4s TimeCoverageRelationStatistics Valid=267, Invalid=725, Unknown=0, NotChecked=0, Total=992 [2025-02-05 21:56:25,345 INFO L435 NwaCegarLoop]: 653 mSDtfsCounter, 4036 mSDsluCounter, 5313 mSDsCounter, 0 mSdLazyCounter, 4617 mSolverCounterSat, 866 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 2.7s Time, 0 mProtectedPredicate, 0 mProtectedAction, 4036 SdHoareTripleChecker+Valid, 5966 SdHoareTripleChecker+Invalid, 5483 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 866 IncrementalHoareTripleChecker+Valid, 4617 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 3.2s IncrementalHoareTripleChecker+Time [2025-02-05 21:56:25,345 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [4036 Valid, 5966 Invalid, 5483 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [866 Valid, 4617 Invalid, 0 Unknown, 0 Unchecked, 3.2s Time] [2025-02-05 21:56:25,361 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 29697 states. [2025-02-05 21:56:26,811 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 29697 to 22087. [2025-02-05 21:56:26,836 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 22087 states, 17576 states have (on average 1.6207897132453346) internal successors, (28487), 17674 states have internal predecessors, (28487), 4368 states have call successors, (4368), 142 states have call predecessors, (4368), 142 states have return successors, (4368), 4270 states have call predecessors, (4368), 4368 states have call successors, (4368) [2025-02-05 21:56:26,877 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 22087 states to 22087 states and 37223 transitions. [2025-02-05 21:56:26,890 INFO L78 Accepts]: Start accepts. Automaton has 22087 states and 37223 transitions. Word has length 673 [2025-02-05 21:56:26,891 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-02-05 21:56:26,891 INFO L471 AbstractCegarLoop]: Abstraction has 22087 states and 37223 transitions. [2025-02-05 21:56:26,891 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 13 states, 13 states have (on average 12.0) internal successors, (156), 13 states have internal predecessors, (156), 2 states have call successors, (104), 1 states have call predecessors, (104), 1 states have return successors, (104), 2 states have call predecessors, (104), 2 states have call successors, (104) [2025-02-05 21:56:26,892 INFO L276 IsEmpty]: Start isEmpty. Operand 22087 states and 37223 transitions. [2025-02-05 21:56:26,902 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 674 [2025-02-05 21:56:26,902 INFO L210 NwaCegarLoop]: Found error trace [2025-02-05 21:56:26,902 INFO L218 NwaCegarLoop]: trace histogram [104, 104, 104, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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:56:26,903 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable13 [2025-02-05 21:56:26,903 INFO L396 AbstractCegarLoop]: === Iteration 15 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-02-05 21:56:26,903 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-02-05 21:56:26,903 INFO L85 PathProgramCache]: Analyzing trace with hash 287020093, now seen corresponding path program 1 times [2025-02-05 21:56:26,903 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-02-05 21:56:26,903 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1093785881] [2025-02-05 21:56:26,904 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-02-05 21:56:26,904 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-02-05 21:56:26,934 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 673 statements into 1 equivalence classes. [2025-02-05 21:56:26,968 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 673 of 673 statements. [2025-02-05 21:56:26,969 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-02-05 21:56:26,969 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-02-05 21:56:27,621 INFO L134 CoverageAnalysis]: Checked inductivity of 21424 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 21424 trivial. 0 not checked. [2025-02-05 21:56:27,621 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-02-05 21:56:27,621 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1093785881] [2025-02-05 21:56:27,621 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1093785881] provided 1 perfect and 0 imperfect interpolant sequences [2025-02-05 21:56:27,621 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-02-05 21:56:27,621 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [9] imperfect sequences [] total 9 [2025-02-05 21:56:27,621 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1545148113] [2025-02-05 21:56:27,621 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-02-05 21:56:27,622 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 9 states [2025-02-05 21:56:27,622 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-02-05 21:56:27,622 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2025-02-05 21:56:27,622 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=26, Invalid=46, Unknown=0, NotChecked=0, Total=72 [2025-02-05 21:56:27,622 INFO L87 Difference]: Start difference. First operand 22087 states and 37223 transitions. Second operand has 9 states, 9 states have (on average 17.333333333333332) internal successors, (156), 9 states have internal predecessors, (156), 1 states have call successors, (104), 1 states have call predecessors, (104), 1 states have return successors, (104), 1 states have call predecessors, (104), 1 states have call successors, (104) [2025-02-05 21:56:30,383 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-02-05 21:56:30,383 INFO L93 Difference]: Finished difference Result 42621 states and 71564 transitions. [2025-02-05 21:56:30,384 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2025-02-05 21:56:30,385 INFO L78 Accepts]: Start accepts. Automaton has has 9 states, 9 states have (on average 17.333333333333332) internal successors, (156), 9 states have internal predecessors, (156), 1 states have call successors, (104), 1 states have call predecessors, (104), 1 states have return successors, (104), 1 states have call predecessors, (104), 1 states have call successors, (104) Word has length 673 [2025-02-05 21:56:30,386 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-02-05 21:56:30,491 INFO L225 Difference]: With dead ends: 42621 [2025-02-05 21:56:30,491 INFO L226 Difference]: Without dead ends: 29747 [2025-02-05 21:56:30,526 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 13 GetRequests, 4 SyntacticMatches, 0 SemanticMatches, 9 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=38, Invalid=72, Unknown=0, NotChecked=0, Total=110 [2025-02-05 21:56:30,526 INFO L435 NwaCegarLoop]: 1108 mSDtfsCounter, 1413 mSDsluCounter, 2519 mSDsCounter, 0 mSdLazyCounter, 2032 mSolverCounterSat, 54 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 1.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 1413 SdHoareTripleChecker+Valid, 3627 SdHoareTripleChecker+Invalid, 2086 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 54 IncrementalHoareTripleChecker+Valid, 2032 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 1.4s IncrementalHoareTripleChecker+Time [2025-02-05 21:56:30,527 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [1413 Valid, 3627 Invalid, 2086 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [54 Valid, 2032 Invalid, 0 Unknown, 0 Unchecked, 1.4s Time] [2025-02-05 21:56:30,544 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 29747 states. [2025-02-05 21:56:31,733 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 29747 to 22301. [2025-02-05 21:56:31,762 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 22301 states, 17790 states have (on average 1.6163575042158516) internal successors, (28755), 17888 states have internal predecessors, (28755), 4368 states have call successors, (4368), 142 states have call predecessors, (4368), 142 states have return successors, (4368), 4270 states have call predecessors, (4368), 4368 states have call successors, (4368) [2025-02-05 21:56:31,817 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 22301 states to 22301 states and 37491 transitions. [2025-02-05 21:56:31,840 INFO L78 Accepts]: Start accepts. Automaton has 22301 states and 37491 transitions. Word has length 673 [2025-02-05 21:56:31,841 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-02-05 21:56:31,841 INFO L471 AbstractCegarLoop]: Abstraction has 22301 states and 37491 transitions. [2025-02-05 21:56:31,841 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 9 states, 9 states have (on average 17.333333333333332) internal successors, (156), 9 states have internal predecessors, (156), 1 states have call successors, (104), 1 states have call predecessors, (104), 1 states have return successors, (104), 1 states have call predecessors, (104), 1 states have call successors, (104) [2025-02-05 21:56:31,841 INFO L276 IsEmpty]: Start isEmpty. Operand 22301 states and 37491 transitions. [2025-02-05 21:56:31,851 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 674 [2025-02-05 21:56:31,851 INFO L210 NwaCegarLoop]: Found error trace [2025-02-05 21:56:31,852 INFO L218 NwaCegarLoop]: trace histogram [104, 104, 104, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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:56:31,852 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable14 [2025-02-05 21:56:31,852 INFO L396 AbstractCegarLoop]: === Iteration 16 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-02-05 21:56:31,853 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-02-05 21:56:31,853 INFO L85 PathProgramCache]: Analyzing trace with hash 1623008606, now seen corresponding path program 1 times [2025-02-05 21:56:31,853 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-02-05 21:56:31,853 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [884861576] [2025-02-05 21:56:31,853 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-02-05 21:56:31,853 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-02-05 21:56:31,877 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 673 statements into 1 equivalence classes. [2025-02-05 21:56:31,920 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 673 of 673 statements. [2025-02-05 21:56:31,920 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-02-05 21:56:31,920 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-02-05 21:56:32,313 INFO L134 CoverageAnalysis]: Checked inductivity of 21424 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 21424 trivial. 0 not checked. [2025-02-05 21:56:32,314 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-02-05 21:56:32,314 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [884861576] [2025-02-05 21:56:32,314 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [884861576] provided 1 perfect and 0 imperfect interpolant sequences [2025-02-05 21:56:32,314 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-02-05 21:56:32,314 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2025-02-05 21:56:32,314 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [100643630] [2025-02-05 21:56:32,314 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-02-05 21:56:32,315 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 7 states [2025-02-05 21:56:32,315 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-02-05 21:56:32,315 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2025-02-05 21:56:32,315 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=12, Invalid=30, Unknown=0, NotChecked=0, Total=42 [2025-02-05 21:56:32,316 INFO L87 Difference]: Start difference. First operand 22301 states and 37491 transitions. Second operand has 7 states, 7 states have (on average 22.285714285714285) internal successors, (156), 7 states have internal predecessors, (156), 1 states have call successors, (104), 1 states have call predecessors, (104), 1 states have return successors, (104), 1 states have call predecessors, (104), 1 states have call successors, (104) [2025-02-05 21:56:34,331 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-02-05 21:56:34,331 INFO L93 Difference]: Finished difference Result 38141 states and 63927 transitions. [2025-02-05 21:56:34,332 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 11 states. [2025-02-05 21:56:34,332 INFO L78 Accepts]: Start accepts. Automaton has has 7 states, 7 states have (on average 22.285714285714285) internal successors, (156), 7 states have internal predecessors, (156), 1 states have call successors, (104), 1 states have call predecessors, (104), 1 states have return successors, (104), 1 states have call predecessors, (104), 1 states have call successors, (104) Word has length 673 [2025-02-05 21:56:34,332 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-02-05 21:56:34,414 INFO L225 Difference]: With dead ends: 38141 [2025-02-05 21:56:34,414 INFO L226 Difference]: Without dead ends: 25053 [2025-02-05 21:56:34,445 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 18 GetRequests, 6 SyntacticMatches, 0 SemanticMatches, 12 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 15 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=64, Invalid=118, Unknown=0, NotChecked=0, Total=182 [2025-02-05 21:56:34,446 INFO L435 NwaCegarLoop]: 674 mSDtfsCounter, 1948 mSDsluCounter, 2379 mSDsCounter, 0 mSdLazyCounter, 1654 mSolverCounterSat, 304 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.9s Time, 0 mProtectedPredicate, 0 mProtectedAction, 1948 SdHoareTripleChecker+Valid, 3053 SdHoareTripleChecker+Invalid, 1958 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 304 IncrementalHoareTripleChecker+Valid, 1654 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 1.1s IncrementalHoareTripleChecker+Time [2025-02-05 21:56:34,446 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [1948 Valid, 3053 Invalid, 1958 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [304 Valid, 1654 Invalid, 0 Unknown, 0 Unchecked, 1.1s Time] [2025-02-05 21:56:34,461 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 25053 states. [2025-02-05 21:56:35,615 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 25053 to 23073. [2025-02-05 21:56:35,638 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 23073 states, 18398 states have (on average 1.6152299162952495) internal successors, (29717), 18500 states have internal predecessors, (29717), 4520 states have call successors, (4520), 154 states have call predecessors, (4520), 154 states have return successors, (4520), 4418 states have call predecessors, (4520), 4520 states have call successors, (4520) [2025-02-05 21:56:35,687 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 23073 states to 23073 states and 38757 transitions. [2025-02-05 21:56:35,706 INFO L78 Accepts]: Start accepts. Automaton has 23073 states and 38757 transitions. Word has length 673 [2025-02-05 21:56:35,707 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-02-05 21:56:35,707 INFO L471 AbstractCegarLoop]: Abstraction has 23073 states and 38757 transitions. [2025-02-05 21:56:35,707 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 7 states, 7 states have (on average 22.285714285714285) internal successors, (156), 7 states have internal predecessors, (156), 1 states have call successors, (104), 1 states have call predecessors, (104), 1 states have return successors, (104), 1 states have call predecessors, (104), 1 states have call successors, (104) [2025-02-05 21:56:35,708 INFO L276 IsEmpty]: Start isEmpty. Operand 23073 states and 38757 transitions. [2025-02-05 21:56:35,717 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 674 [2025-02-05 21:56:35,718 INFO L210 NwaCegarLoop]: Found error trace [2025-02-05 21:56:35,718 INFO L218 NwaCegarLoop]: trace histogram [104, 104, 104, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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:56:35,718 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable15 [2025-02-05 21:56:35,718 INFO L396 AbstractCegarLoop]: === Iteration 17 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-02-05 21:56:35,719 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-02-05 21:56:35,719 INFO L85 PathProgramCache]: Analyzing trace with hash -922222146, now seen corresponding path program 1 times [2025-02-05 21:56:35,719 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-02-05 21:56:35,719 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1378669256] [2025-02-05 21:56:35,719 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-02-05 21:56:35,719 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-02-05 21:56:35,742 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 673 statements into 1 equivalence classes. [2025-02-05 21:56:35,768 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 673 of 673 statements. [2025-02-05 21:56:35,769 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-02-05 21:56:35,769 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-02-05 21:56:36,192 INFO L134 CoverageAnalysis]: Checked inductivity of 21424 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 21424 trivial. 0 not checked. [2025-02-05 21:56:36,192 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-02-05 21:56:36,193 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1378669256] [2025-02-05 21:56:36,193 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1378669256] provided 1 perfect and 0 imperfect interpolant sequences [2025-02-05 21:56:36,193 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-02-05 21:56:36,193 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2025-02-05 21:56:36,193 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1738961806] [2025-02-05 21:56:36,193 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-02-05 21:56:36,193 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2025-02-05 21:56:36,194 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-02-05 21:56:36,194 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2025-02-05 21:56:36,195 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=6, Invalid=6, Unknown=0, NotChecked=0, Total=12 [2025-02-05 21:56:36,195 INFO L87 Difference]: Start difference. First operand 23073 states and 38757 transitions. Second operand has 4 states, 4 states have (on average 39.0) internal successors, (156), 4 states have internal predecessors, (156), 1 states have call successors, (104), 1 states have call predecessors, (104), 1 states have return successors, (104), 1 states have call predecessors, (104), 1 states have call successors, (104) [2025-02-05 21:56:39,148 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-02-05 21:56:39,148 INFO L93 Difference]: Finished difference Result 72487 states and 120896 transitions. [2025-02-05 21:56:39,148 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2025-02-05 21:56:39,148 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 4 states have (on average 39.0) internal successors, (156), 4 states have internal predecessors, (156), 1 states have call successors, (104), 1 states have call predecessors, (104), 1 states have return successors, (104), 1 states have call predecessors, (104), 1 states have call successors, (104) Word has length 673 [2025-02-05 21:56:39,149 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-02-05 21:56:39,295 INFO L225 Difference]: With dead ends: 72487 [2025-02-05 21:56:39,295 INFO L226 Difference]: Without dead ends: 49081 [2025-02-05 21:56:39,338 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 6 GetRequests, 4 SyntacticMatches, 0 SemanticMatches, 2 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=6, Invalid=6, Unknown=0, NotChecked=0, Total=12 [2025-02-05 21:56:39,339 INFO L435 NwaCegarLoop]: 815 mSDtfsCounter, 690 mSDsluCounter, 953 mSDsCounter, 0 mSdLazyCounter, 242 mSolverCounterSat, 6 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 690 SdHoareTripleChecker+Valid, 1768 SdHoareTripleChecker+Invalid, 248 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 6 IncrementalHoareTripleChecker+Valid, 242 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.3s IncrementalHoareTripleChecker+Time [2025-02-05 21:56:39,340 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [690 Valid, 1768 Invalid, 248 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [6 Valid, 242 Invalid, 0 Unknown, 0 Unchecked, 0.3s Time] [2025-02-05 21:56:39,370 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 49081 states. [2025-02-05 21:56:41,555 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 49081 to 41603. [2025-02-05 21:56:41,597 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 41603 states, 33006 states have (on average 1.6107374416772708) internal successors, (53164), 33226 states have internal predecessors, (53164), 8288 states have call successors, (8288), 308 states have call predecessors, (8288), 308 states have return successors, (8288), 8068 states have call predecessors, (8288), 8288 states have call successors, (8288) [2025-02-05 21:56:41,688 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 41603 states to 41603 states and 69740 transitions. [2025-02-05 21:56:41,724 INFO L78 Accepts]: Start accepts. Automaton has 41603 states and 69740 transitions. Word has length 673 [2025-02-05 21:56:41,724 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-02-05 21:56:41,724 INFO L471 AbstractCegarLoop]: Abstraction has 41603 states and 69740 transitions. [2025-02-05 21:56:41,724 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 39.0) internal successors, (156), 4 states have internal predecessors, (156), 1 states have call successors, (104), 1 states have call predecessors, (104), 1 states have return successors, (104), 1 states have call predecessors, (104), 1 states have call successors, (104) [2025-02-05 21:56:41,724 INFO L276 IsEmpty]: Start isEmpty. Operand 41603 states and 69740 transitions. [2025-02-05 21:56:41,738 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 674 [2025-02-05 21:56:41,738 INFO L210 NwaCegarLoop]: Found error trace [2025-02-05 21:56:41,738 INFO L218 NwaCegarLoop]: trace histogram [104, 104, 104, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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:56:41,739 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable16 [2025-02-05 21:56:41,739 INFO L396 AbstractCegarLoop]: === Iteration 18 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-02-05 21:56:41,739 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-02-05 21:56:41,739 INFO L85 PathProgramCache]: Analyzing trace with hash -1597305762, now seen corresponding path program 1 times [2025-02-05 21:56:41,739 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-02-05 21:56:41,739 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [85009734] [2025-02-05 21:56:41,739 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-02-05 21:56:41,739 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-02-05 21:56:41,870 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 673 statements into 1 equivalence classes. [2025-02-05 21:56:41,918 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 673 of 673 statements. [2025-02-05 21:56:41,918 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-02-05 21:56:41,918 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-02-05 21:56:42,340 INFO L134 CoverageAnalysis]: Checked inductivity of 21424 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 21424 trivial. 0 not checked. [2025-02-05 21:56:42,343 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-02-05 21:56:42,344 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [85009734] [2025-02-05 21:56:42,344 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [85009734] provided 1 perfect and 0 imperfect interpolant sequences [2025-02-05 21:56:42,344 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-02-05 21:56:42,344 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2025-02-05 21:56:42,344 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [375052749] [2025-02-05 21:56:42,344 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-02-05 21:56:42,344 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2025-02-05 21:56:42,344 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-02-05 21:56:42,345 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2025-02-05 21:56:42,345 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-02-05 21:56:42,345 INFO L87 Difference]: Start difference. First operand 41603 states and 69740 transitions. Second operand has 3 states, 3 states have (on average 52.0) internal successors, (156), 3 states have internal predecessors, (156), 1 states have call successors, (104), 1 states have call predecessors, (104), 1 states have return successors, (104), 1 states have call predecessors, (104), 1 states have call successors, (104) [2025-02-05 21:56:44,228 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-02-05 21:56:44,228 INFO L93 Difference]: Finished difference Result 83203 states and 139477 transitions. [2025-02-05 21:56:44,229 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2025-02-05 21:56:44,229 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 52.0) internal successors, (156), 3 states have internal predecessors, (156), 1 states have call successors, (104), 1 states have call predecessors, (104), 1 states have return successors, (104), 1 states have call predecessors, (104), 1 states have call successors, (104) Word has length 673 [2025-02-05 21:56:44,229 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-02-05 21:56:44,351 INFO L225 Difference]: With dead ends: 83203 [2025-02-05 21:56:44,351 INFO L226 Difference]: Without dead ends: 41603 [2025-02-05 21:56:44,411 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 4 GetRequests, 3 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-02-05 21:56:44,411 INFO L435 NwaCegarLoop]: 553 mSDtfsCounter, 534 mSDsluCounter, 0 mSDsCounter, 0 mSdLazyCounter, 20 mSolverCounterSat, 2 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 534 SdHoareTripleChecker+Valid, 553 SdHoareTripleChecker+Invalid, 22 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 2 IncrementalHoareTripleChecker+Valid, 20 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2025-02-05 21:56:44,411 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [534 Valid, 553 Invalid, 22 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [2 Valid, 20 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2025-02-05 21:56:44,431 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 41603 states. [2025-02-05 21:56:46,964 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 41603 to 41603. [2025-02-05 21:56:47,000 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 41603 states, 33006 states have (on average 1.5960734411925104) internal successors, (52680), 33226 states have internal predecessors, (52680), 8288 states have call successors, (8288), 308 states have call predecessors, (8288), 308 states have return successors, (8288), 8068 states have call predecessors, (8288), 8288 states have call successors, (8288) [2025-02-05 21:56:47,085 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 41603 states to 41603 states and 69256 transitions. [2025-02-05 21:56:47,121 INFO L78 Accepts]: Start accepts. Automaton has 41603 states and 69256 transitions. Word has length 673 [2025-02-05 21:56:47,121 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-02-05 21:56:47,122 INFO L471 AbstractCegarLoop]: Abstraction has 41603 states and 69256 transitions. [2025-02-05 21:56:47,122 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 52.0) internal successors, (156), 3 states have internal predecessors, (156), 1 states have call successors, (104), 1 states have call predecessors, (104), 1 states have return successors, (104), 1 states have call predecessors, (104), 1 states have call successors, (104) [2025-02-05 21:56:47,122 INFO L276 IsEmpty]: Start isEmpty. Operand 41603 states and 69256 transitions. [2025-02-05 21:56:47,134 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 674 [2025-02-05 21:56:47,134 INFO L210 NwaCegarLoop]: Found error trace [2025-02-05 21:56:47,134 INFO L218 NwaCegarLoop]: trace histogram [104, 104, 104, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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:56:47,134 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable17 [2025-02-05 21:56:47,134 INFO L396 AbstractCegarLoop]: === Iteration 19 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-02-05 21:56:47,135 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-02-05 21:56:47,135 INFO L85 PathProgramCache]: Analyzing trace with hash -228468034, now seen corresponding path program 1 times [2025-02-05 21:56:47,135 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-02-05 21:56:47,135 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1194764086] [2025-02-05 21:56:47,135 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-02-05 21:56:47,135 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-02-05 21:56:47,155 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 673 statements into 1 equivalence classes. [2025-02-05 21:56:47,185 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 673 of 673 statements. [2025-02-05 21:56:47,186 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-02-05 21:56:47,186 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-02-05 21:56:47,389 INFO L134 CoverageAnalysis]: Checked inductivity of 21424 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 21424 trivial. 0 not checked. [2025-02-05 21:56:47,389 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-02-05 21:56:47,389 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1194764086] [2025-02-05 21:56:47,389 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1194764086] provided 1 perfect and 0 imperfect interpolant sequences [2025-02-05 21:56:47,389 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-02-05 21:56:47,389 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2025-02-05 21:56:47,389 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1180688124] [2025-02-05 21:56:47,389 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-02-05 21:56:47,390 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2025-02-05 21:56:47,390 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-02-05 21:56:47,391 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2025-02-05 21:56:47,391 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=8, Invalid=12, Unknown=0, NotChecked=0, Total=20 [2025-02-05 21:56:47,391 INFO L87 Difference]: Start difference. First operand 41603 states and 69256 transitions. Second operand has 5 states, 5 states have (on average 31.2) internal successors, (156), 5 states have internal predecessors, (156), 1 states have call successors, (104), 1 states have call predecessors, (104), 1 states have return successors, (104), 1 states have call predecessors, (104), 1 states have call successors, (104) [2025-02-05 21:56:55,480 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-02-05 21:56:55,482 INFO L93 Difference]: Finished difference Result 206121 states and 341907 transitions. [2025-02-05 21:56:55,482 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2025-02-05 21:56:55,482 INFO L78 Accepts]: Start accepts. Automaton has has 5 states, 5 states have (on average 31.2) internal successors, (156), 5 states have internal predecessors, (156), 1 states have call successors, (104), 1 states have call predecessors, (104), 1 states have return successors, (104), 1 states have call predecessors, (104), 1 states have call successors, (104) Word has length 673 [2025-02-05 21:56:55,483 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-02-05 21:56:55,854 INFO L225 Difference]: With dead ends: 206121 [2025-02-05 21:56:55,854 INFO L226 Difference]: Without dead ends: 164521 [2025-02-05 21:56:55,947 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 9 GetRequests, 4 SyntacticMatches, 0 SemanticMatches, 5 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=18, Invalid=24, Unknown=0, NotChecked=0, Total=42 [2025-02-05 21:56:55,947 INFO L435 NwaCegarLoop]: 836 mSDtfsCounter, 1299 mSDsluCounter, 1829 mSDsCounter, 0 mSdLazyCounter, 589 mSolverCounterSat, 233 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.4s Time, 0 mProtectedPredicate, 0 mProtectedAction, 1299 SdHoareTripleChecker+Valid, 2665 SdHoareTripleChecker+Invalid, 822 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 233 IncrementalHoareTripleChecker+Valid, 589 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.5s IncrementalHoareTripleChecker+Time [2025-02-05 21:56:55,947 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [1299 Valid, 2665 Invalid, 822 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [233 Valid, 589 Invalid, 0 Unknown, 0 Unchecked, 0.5s Time] [2025-02-05 21:56:56,043 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 164521 states. [2025-02-05 21:57:00,993 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 164521 to 95649. [2025-02-05 21:57:01,068 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 95649 states, 81828 states have (on average 1.6634403871535415) internal successors, (136116), 82244 states have internal predecessors, (136116), 13248 states have call successors, (13248), 572 states have call predecessors, (13248), 572 states have return successors, (13248), 12832 states have call predecessors, (13248), 13248 states have call successors, (13248) [2025-02-05 21:57:01,319 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 95649 states to 95649 states and 162612 transitions. [2025-02-05 21:57:01,414 INFO L78 Accepts]: Start accepts. Automaton has 95649 states and 162612 transitions. Word has length 673 [2025-02-05 21:57:01,415 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-02-05 21:57:01,415 INFO L471 AbstractCegarLoop]: Abstraction has 95649 states and 162612 transitions. [2025-02-05 21:57:01,415 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 31.2) internal successors, (156), 5 states have internal predecessors, (156), 1 states have call successors, (104), 1 states have call predecessors, (104), 1 states have return successors, (104), 1 states have call predecessors, (104), 1 states have call successors, (104) [2025-02-05 21:57:01,415 INFO L276 IsEmpty]: Start isEmpty. Operand 95649 states and 162612 transitions. [2025-02-05 21:57:01,452 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 675 [2025-02-05 21:57:01,452 INFO L210 NwaCegarLoop]: Found error trace [2025-02-05 21:57:01,452 INFO L218 NwaCegarLoop]: trace histogram [104, 104, 104, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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:57:01,452 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable18 [2025-02-05 21:57:01,452 INFO L396 AbstractCegarLoop]: === Iteration 20 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-02-05 21:57:01,453 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-02-05 21:57:01,453 INFO L85 PathProgramCache]: Analyzing trace with hash 2075952010, now seen corresponding path program 1 times [2025-02-05 21:57:01,453 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-02-05 21:57:01,453 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1826264395] [2025-02-05 21:57:01,453 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-02-05 21:57:01,453 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-02-05 21:57:01,479 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 674 statements into 1 equivalence classes. [2025-02-05 21:57:01,525 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 674 of 674 statements. [2025-02-05 21:57:01,526 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-02-05 21:57:01,526 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-02-05 21:57:01,983 INFO L134 CoverageAnalysis]: Checked inductivity of 21424 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 21424 trivial. 0 not checked. [2025-02-05 21:57:01,983 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-02-05 21:57:01,983 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1826264395] [2025-02-05 21:57:01,983 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1826264395] provided 1 perfect and 0 imperfect interpolant sequences [2025-02-05 21:57:01,983 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-02-05 21:57:01,983 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2025-02-05 21:57:01,983 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1619223006] [2025-02-05 21:57:01,983 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-02-05 21:57:01,984 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2025-02-05 21:57:01,984 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-02-05 21:57:01,984 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2025-02-05 21:57:01,984 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-02-05 21:57:01,984 INFO L87 Difference]: Start difference. First operand 95649 states and 162612 transitions. Second operand has 3 states, 3 states have (on average 52.333333333333336) internal successors, (157), 3 states have internal predecessors, (157), 1 states have call successors, (104), 1 states have call predecessors, (104), 1 states have return successors, (104), 1 states have call predecessors, (104), 1 states have call successors, (104) [2025-02-05 21:57:06,033 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-02-05 21:57:06,033 INFO L93 Difference]: Finished difference Result 191727 states and 326085 transitions. [2025-02-05 21:57:06,034 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2025-02-05 21:57:06,034 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 52.333333333333336) internal successors, (157), 3 states have internal predecessors, (157), 1 states have call successors, (104), 1 states have call predecessors, (104), 1 states have return successors, (104), 1 states have call predecessors, (104), 1 states have call successors, (104) Word has length 674 [2025-02-05 21:57:06,034 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-02-05 21:57:06,290 INFO L225 Difference]: With dead ends: 191727 [2025-02-05 21:57:06,291 INFO L226 Difference]: Without dead ends: 96081 [2025-02-05 21:57:06,405 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 5 GetRequests, 4 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-02-05 21:57:06,406 INFO L435 NwaCegarLoop]: 556 mSDtfsCounter, 0 mSDsluCounter, 537 mSDsCounter, 0 mSdLazyCounter, 52 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 0 SdHoareTripleChecker+Valid, 1093 SdHoareTripleChecker+Invalid, 52 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 52 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2025-02-05 21:57:06,406 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [0 Valid, 1093 Invalid, 52 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 52 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2025-02-05 21:57:06,463 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 96081 states. [2025-02-05 21:57:10,206 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 96081 to 96081. [2025-02-05 21:57:10,288 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 96081 states, 82260 states have (on average 1.6599562363238511) internal successors, (136548), 82676 states have internal predecessors, (136548), 13248 states have call successors, (13248), 572 states have call predecessors, (13248), 572 states have return successors, (13248), 12832 states have call predecessors, (13248), 13248 states have call successors, (13248) [2025-02-05 21:57:10,473 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 96081 states to 96081 states and 163044 transitions. [2025-02-05 21:57:10,544 INFO L78 Accepts]: Start accepts. Automaton has 96081 states and 163044 transitions. Word has length 674 [2025-02-05 21:57:10,545 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-02-05 21:57:10,545 INFO L471 AbstractCegarLoop]: Abstraction has 96081 states and 163044 transitions. [2025-02-05 21:57:10,545 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 52.333333333333336) internal successors, (157), 3 states have internal predecessors, (157), 1 states have call successors, (104), 1 states have call predecessors, (104), 1 states have return successors, (104), 1 states have call predecessors, (104), 1 states have call successors, (104) [2025-02-05 21:57:10,545 INFO L276 IsEmpty]: Start isEmpty. Operand 96081 states and 163044 transitions. [2025-02-05 21:57:10,577 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 675 [2025-02-05 21:57:10,578 INFO L210 NwaCegarLoop]: Found error trace [2025-02-05 21:57:10,578 INFO L218 NwaCegarLoop]: trace histogram [104, 104, 104, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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:57:10,578 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable19 [2025-02-05 21:57:10,578 INFO L396 AbstractCegarLoop]: === Iteration 21 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-02-05 21:57:10,579 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-02-05 21:57:10,579 INFO L85 PathProgramCache]: Analyzing trace with hash -1193523287, now seen corresponding path program 1 times [2025-02-05 21:57:10,579 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-02-05 21:57:10,579 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [734925988] [2025-02-05 21:57:10,579 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-02-05 21:57:10,579 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-02-05 21:57:10,597 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 674 statements into 1 equivalence classes. [2025-02-05 21:57:10,624 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 674 of 674 statements. [2025-02-05 21:57:10,625 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-02-05 21:57:10,625 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-02-05 21:57:11,072 INFO L134 CoverageAnalysis]: Checked inductivity of 21424 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 21424 trivial. 0 not checked. [2025-02-05 21:57:11,072 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-02-05 21:57:11,072 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [734925988] [2025-02-05 21:57:11,072 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [734925988] provided 1 perfect and 0 imperfect interpolant sequences [2025-02-05 21:57:11,072 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-02-05 21:57:11,072 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2025-02-05 21:57:11,072 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [239233255] [2025-02-05 21:57:11,072 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-02-05 21:57:11,073 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2025-02-05 21:57:11,073 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-02-05 21:57:11,073 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2025-02-05 21:57:11,073 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-02-05 21:57:11,074 INFO L87 Difference]: Start difference. First operand 96081 states and 163044 transitions. Second operand has 3 states, 3 states have (on average 52.333333333333336) internal successors, (157), 3 states have internal predecessors, (157), 1 states have call successors, (104), 1 states have call predecessors, (104), 1 states have return successors, (104), 1 states have call predecessors, (104), 1 states have call successors, (104)