./Ultimate.py --spec ../sv-benchmarks/c/properties/unreach-call.prp --file ../sv-benchmarks/c/hardness-nfm22/hardness_operatoramount_amount250_file-20.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_operatoramount_amount250_file-20.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 7baede3f4b218899c5fa728f3d2f15c45a27c02194fa196820f87130200e77ba --- Real Ultimate output --- This is Ultimate 0.3.0-?-c00e63d-m [2025-02-06 02:14:47,641 INFO L188 SettingsManager]: Resetting all preferences to default values... [2025-02-06 02:14:47,699 INFO L114 SettingsManager]: Loading settings from /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/config/svcomp-Reach-32bit-Automizer_Default.epf [2025-02-06 02:14:47,707 WARN L101 SettingsManager]: Preference file contains the following unknown settings: [2025-02-06 02:14:47,707 WARN L103 SettingsManager]: * de.uni_freiburg.informatik.ultimate.core.Log level for class [2025-02-06 02:14:47,725 INFO L130 SettingsManager]: Preferences different from defaults after loading the file: [2025-02-06 02:14:47,725 INFO L151 SettingsManager]: Preferences of UltimateCore differ from their defaults: [2025-02-06 02:14:47,726 INFO L153 SettingsManager]: * Log level for class=de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher=ERROR; [2025-02-06 02:14:47,726 INFO L151 SettingsManager]: Preferences of Boogie Preprocessor differ from their defaults: [2025-02-06 02:14:47,726 INFO L153 SettingsManager]: * Use memory slicer=true [2025-02-06 02:14:47,726 INFO L151 SettingsManager]: Preferences of Boogie Procedure Inliner differ from their defaults: [2025-02-06 02:14:47,726 INFO L153 SettingsManager]: * Ignore calls to procedures called more than once=ONLY_FOR_SEQUENTIAL_PROGRAMS [2025-02-06 02:14:47,726 INFO L151 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2025-02-06 02:14:47,726 INFO L153 SettingsManager]: * Create parallel compositions if possible=false [2025-02-06 02:14:47,726 INFO L153 SettingsManager]: * Use SBE=true [2025-02-06 02:14:47,727 INFO L151 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2025-02-06 02:14:47,727 INFO L153 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2025-02-06 02:14:47,727 INFO L153 SettingsManager]: * sizeof long=4 [2025-02-06 02:14:47,727 INFO L153 SettingsManager]: * Overapproximate operations on floating types=true [2025-02-06 02:14:47,727 INFO L153 SettingsManager]: * sizeof POINTER=4 [2025-02-06 02:14:47,727 INFO L153 SettingsManager]: * Check division by zero=IGNORE [2025-02-06 02:14:47,727 INFO L153 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2025-02-06 02:14:47,727 INFO L153 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2025-02-06 02:14:47,727 INFO L153 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2025-02-06 02:14:47,727 INFO L153 SettingsManager]: * sizeof long double=12 [2025-02-06 02:14:47,727 INFO L153 SettingsManager]: * Check if freed pointer was valid=false [2025-02-06 02:14:47,728 INFO L153 SettingsManager]: * Behaviour of calls to undefined functions=OVERAPPROXIMATE_BEHAVIOUR [2025-02-06 02:14:47,728 INFO L153 SettingsManager]: * Use constant arrays=true [2025-02-06 02:14:47,728 INFO L151 SettingsManager]: Preferences of IcfgBuilder differ from their defaults: [2025-02-06 02:14:47,728 INFO L153 SettingsManager]: * Size of a code block=SequenceOfStatements [2025-02-06 02:14:47,728 INFO L153 SettingsManager]: * Only consider context switches at boundaries of atomic blocks=true [2025-02-06 02:14:47,728 INFO L153 SettingsManager]: * SMT solver=External_DefaultMode [2025-02-06 02:14:47,728 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2025-02-06 02:14:47,728 INFO L151 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2025-02-06 02:14:47,728 INFO L153 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2025-02-06 02:14:47,728 INFO L153 SettingsManager]: * Compute procedure contracts=false [2025-02-06 02:14:47,728 INFO L153 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopHeads [2025-02-06 02:14:47,728 INFO L153 SettingsManager]: * Trace refinement strategy=CAMEL [2025-02-06 02:14:47,728 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2025-02-06 02:14:47,728 INFO L153 SettingsManager]: * Apply one-shot large block encoding in concurrent analysis=false [2025-02-06 02:14:47,728 INFO L153 SettingsManager]: * Automaton type used in concurrency analysis=PETRI_NET [2025-02-06 02:14:47,728 INFO L153 SettingsManager]: * Order on configurations for Petri net unfoldings=DBO [2025-02-06 02:14:47,728 INFO L153 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode [2025-02-06 02:14:47,728 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 -> 7baede3f4b218899c5fa728f3d2f15c45a27c02194fa196820f87130200e77ba [2025-02-06 02:14:47,950 INFO L75 nceAwareModelManager]: Repository-Root is: /tmp [2025-02-06 02:14:47,955 INFO L261 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2025-02-06 02:14:47,957 INFO L217 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2025-02-06 02:14:47,958 INFO L270 PluginConnector]: Initializing CDTParser... [2025-02-06 02:14:47,958 INFO L274 PluginConnector]: CDTParser initialized [2025-02-06 02:14:47,959 INFO L431 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/../sv-benchmarks/c/hardness-nfm22/hardness_operatoramount_amount250_file-20.i [2025-02-06 02:14:49,067 INFO L533 CDTParser]: Created temporary CDT project at /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/data/d14ed03f9/d36f3ae4e117487fbd90bd958b2de1b2/FLAGe332f20c2 [2025-02-06 02:14:49,324 INFO L384 CDTParser]: Found 1 translation units. [2025-02-06 02:14:49,328 INFO L180 CDTParser]: Scanning /storage/repos/ultimate-jdk21/releaseScripts/default/sv-benchmarks/c/hardness-nfm22/hardness_operatoramount_amount250_file-20.i [2025-02-06 02:14:49,339 INFO L427 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/data/d14ed03f9/d36f3ae4e117487fbd90bd958b2de1b2/FLAGe332f20c2 [2025-02-06 02:14:49,626 INFO L435 CDTParser]: Successfully deleted /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/data/d14ed03f9/d36f3ae4e117487fbd90bd958b2de1b2 [2025-02-06 02:14:49,628 INFO L299 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2025-02-06 02:14:49,629 INFO L133 ToolchainWalker]: Walking toolchain with 6 elements. [2025-02-06 02:14:49,630 INFO L112 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2025-02-06 02:14:49,630 INFO L270 PluginConnector]: Initializing CACSL2BoogieTranslator... [2025-02-06 02:14:49,633 INFO L274 PluginConnector]: CACSL2BoogieTranslator initialized [2025-02-06 02:14:49,634 INFO L184 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 06.02 02:14:49" (1/1) ... [2025-02-06 02:14:49,634 INFO L204 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@61bc8c13 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 06.02 02:14:49, skipping insertion in model container [2025-02-06 02:14:49,634 INFO L184 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 06.02 02:14:49" (1/1) ... [2025-02-06 02:14:49,657 INFO L175 MainTranslator]: Built tables and reachable declarations [2025-02-06 02:14:49,755 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_operatoramount_amount250_file-20.i[916,929] [2025-02-06 02:14:49,847 INFO L210 PostProcessor]: Analyzing one entry point: main [2025-02-06 02:14:49,855 INFO L200 MainTranslator]: Completed pre-run [2025-02-06 02:14:49,862 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_operatoramount_amount250_file-20.i[916,929] [2025-02-06 02:14:49,927 INFO L210 PostProcessor]: Analyzing one entry point: main [2025-02-06 02:14:49,942 INFO L204 MainTranslator]: Completed translation [2025-02-06 02:14:49,943 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 06.02 02:14:49 WrapperNode [2025-02-06 02:14:49,943 INFO L131 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2025-02-06 02:14:49,944 INFO L112 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2025-02-06 02:14:49,945 INFO L270 PluginConnector]: Initializing Boogie Procedure Inliner... [2025-02-06 02:14:49,945 INFO L274 PluginConnector]: Boogie Procedure Inliner initialized [2025-02-06 02:14:49,949 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 06.02 02:14:49" (1/1) ... [2025-02-06 02:14:49,960 INFO L184 PluginConnector]: Executing the observer Inliner from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 06.02 02:14:49" (1/1) ... [2025-02-06 02:14:50,011 INFO L138 Inliner]: procedures = 26, calls = 62, calls flagged for inlining = 8, calls inlined = 8, statements flattened = 443 [2025-02-06 02:14:50,011 INFO L131 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2025-02-06 02:14:50,012 INFO L112 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2025-02-06 02:14:50,012 INFO L270 PluginConnector]: Initializing Boogie Preprocessor... [2025-02-06 02:14:50,012 INFO L274 PluginConnector]: Boogie Preprocessor initialized [2025-02-06 02:14:50,018 INFO L184 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 06.02 02:14:49" (1/1) ... [2025-02-06 02:14:50,018 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 06.02 02:14:49" (1/1) ... [2025-02-06 02:14:50,032 INFO L184 PluginConnector]: Executing the observer MemorySlicer from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 06.02 02:14:49" (1/1) ... [2025-02-06 02:14:50,069 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-06 02:14:50,069 INFO L184 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 06.02 02:14:49" (1/1) ... [2025-02-06 02:14:50,070 INFO L184 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 06.02 02:14:49" (1/1) ... [2025-02-06 02:14:50,089 INFO L184 PluginConnector]: Executing the observer ReplaceArrayAssignments from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 06.02 02:14:49" (1/1) ... [2025-02-06 02:14:50,092 INFO L184 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 06.02 02:14:49" (1/1) ... [2025-02-06 02:14:50,102 INFO L184 PluginConnector]: Executing the observer LTLStepAnnotator from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 06.02 02:14:49" (1/1) ... [2025-02-06 02:14:50,106 INFO L184 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 06.02 02:14:49" (1/1) ... [2025-02-06 02:14:50,114 INFO L131 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2025-02-06 02:14:50,115 INFO L112 PluginConnector]: ------------------------IcfgBuilder---------------------------- [2025-02-06 02:14:50,116 INFO L270 PluginConnector]: Initializing IcfgBuilder... [2025-02-06 02:14:50,116 INFO L274 PluginConnector]: IcfgBuilder initialized [2025-02-06 02:14:50,117 INFO L184 PluginConnector]: Executing the observer IcfgBuilderObserver from plugin IcfgBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 06.02 02:14:49" (1/1) ... [2025-02-06 02:14:50,120 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2025-02-06 02:14:50,132 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 [2025-02-06 02:14:50,145 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-06 02:14:50,148 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-06 02:14:50,166 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocInit [2025-02-06 02:14:50,167 INFO L130 BoogieDeclarations]: Found specification of procedure assume_abort_if_not [2025-02-06 02:14:50,167 INFO L138 BoogieDeclarations]: Found implementation of procedure assume_abort_if_not [2025-02-06 02:14:50,167 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int#0 [2025-02-06 02:14:50,167 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2025-02-06 02:14:50,167 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2025-02-06 02:14:50,249 INFO L257 CfgBuilder]: Building ICFG [2025-02-06 02:14:50,251 INFO L287 CfgBuilder]: Building CFG for each procedure with an implementation [2025-02-06 02:14:50,873 INFO L1309 $ProcedureCfgBuilder]: dead code at ProgramPoint L369: havoc property_#t~bitwise38#1;havoc property_#t~short39#1;havoc property_#t~bitwise40#1;havoc property_#t~short41#1;havoc property_#t~short42#1;havoc property_#t~ite44#1;havoc property_#t~bitwise43#1;havoc property_#t~short45#1; [2025-02-06 02:14:50,946 INFO L? ?]: Removed 59 outVars from TransFormulas that were not future-live. [2025-02-06 02:14:50,946 INFO L308 CfgBuilder]: Performing block encoding [2025-02-06 02:14:50,967 INFO L332 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2025-02-06 02:14:50,967 INFO L337 CfgBuilder]: Removed 0 assume(true) statements. [2025-02-06 02:14:50,967 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.icfgbuilder CFG 06.02 02:14:50 BoogieIcfgContainer [2025-02-06 02:14:50,967 INFO L131 PluginConnector]: ------------------------ END IcfgBuilder---------------------------- [2025-02-06 02:14:50,969 INFO L112 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2025-02-06 02:14:50,969 INFO L270 PluginConnector]: Initializing TraceAbstraction... [2025-02-06 02:14:50,972 INFO L274 PluginConnector]: TraceAbstraction initialized [2025-02-06 02:14:50,972 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 06.02 02:14:49" (1/3) ... [2025-02-06 02:14:50,973 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@78ae4db and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 06.02 02:14:50, skipping insertion in model container [2025-02-06 02:14:50,973 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 06.02 02:14:49" (2/3) ... [2025-02-06 02:14:50,973 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@78ae4db and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 06.02 02:14:50, skipping insertion in model container [2025-02-06 02:14:50,973 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.icfgbuilder CFG 06.02 02:14:50" (3/3) ... [2025-02-06 02:14:50,974 INFO L128 eAbstractionObserver]: Analyzing ICFG hardness_operatoramount_amount250_file-20.i [2025-02-06 02:14:50,984 INFO L216 ceAbstractionStarter]: Automizer settings: Hoare:LoopHeads NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2025-02-06 02:14:50,986 INFO L151 ceAbstractionStarter]: Applying trace abstraction to ICFG hardness_operatoramount_amount250_file-20.i that has 2 procedures, 189 locations, 1 initial locations, 1 loop locations, and 1 error locations. [2025-02-06 02:14:51,030 INFO L332 AbstractCegarLoop]: ======== Iteration 0 == of CEGAR loop == AllErrorsAtOnce ======== [2025-02-06 02:14:51,038 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;@41975986, mLbeIndependenceSettings=[IndependenceType=SEMANTIC, AbstractionType=NONE, UseConditional=false, UseSemiCommutativity=true, Solver=Z3, SolverTimeout=1000ms] [2025-02-06 02:14:51,039 INFO L334 AbstractCegarLoop]: Starting to check reachability of 1 error locations. [2025-02-06 02:14:51,042 INFO L276 IsEmpty]: Start isEmpty. Operand has 189 states, 137 states have (on average 1.489051094890511) internal successors, (204), 138 states have internal predecessors, (204), 49 states have call successors, (49), 1 states have call predecessors, (49), 1 states have return successors, (49), 49 states have call predecessors, (49), 49 states have call successors, (49) [2025-02-06 02:14:51,052 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 330 [2025-02-06 02:14:51,053 INFO L210 NwaCegarLoop]: Found error trace [2025-02-06 02:14:51,053 INFO L218 NwaCegarLoop]: trace histogram [49, 49, 49, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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-06 02:14:51,054 INFO L396 AbstractCegarLoop]: === Iteration 1 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-02-06 02:14:51,057 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-02-06 02:14:51,057 INFO L85 PathProgramCache]: Analyzing trace with hash -1179728659, now seen corresponding path program 1 times [2025-02-06 02:14:51,062 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-02-06 02:14:51,062 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1074387060] [2025-02-06 02:14:51,063 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-02-06 02:14:51,063 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-02-06 02:14:51,149 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 329 statements into 1 equivalence classes. [2025-02-06 02:14:51,182 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 329 of 329 statements. [2025-02-06 02:14:51,185 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-02-06 02:14:51,185 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-02-06 02:14:51,488 INFO L134 CoverageAnalysis]: Checked inductivity of 4704 backedges. 0 proven. 96 refuted. 0 times theorem prover too weak. 4608 trivial. 0 not checked. [2025-02-06 02:14:51,489 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-02-06 02:14:51,489 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1074387060] [2025-02-06 02:14:51,490 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1074387060] provided 0 perfect and 1 imperfect interpolant sequences [2025-02-06 02:14:51,490 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1064009659] [2025-02-06 02:14:51,490 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-02-06 02:14:51,490 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-02-06 02:14:51,490 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 [2025-02-06 02:14:51,492 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-06 02:14:51,500 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-06 02:14:51,623 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 329 statements into 1 equivalence classes. [2025-02-06 02:14:51,734 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 329 of 329 statements. [2025-02-06 02:14:51,734 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-02-06 02:14:51,734 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-02-06 02:14:51,739 INFO L256 TraceCheckSpWp]: Trace formula consists of 779 conjuncts, 1 conjuncts are in the unsatisfiable core [2025-02-06 02:14:51,753 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-02-06 02:14:51,792 INFO L134 CoverageAnalysis]: Checked inductivity of 4704 backedges. 96 proven. 0 refuted. 0 times theorem prover too weak. 4608 trivial. 0 not checked. [2025-02-06 02:14:51,792 INFO L308 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2025-02-06 02:14:51,792 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1064009659] provided 1 perfect and 0 imperfect interpolant sequences [2025-02-06 02:14:51,792 INFO L185 FreeRefinementEngine]: Found 1 perfect and 1 imperfect interpolant sequences. [2025-02-06 02:14:51,792 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [2] total 2 [2025-02-06 02:14:51,794 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [935472908] [2025-02-06 02:14:51,794 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-02-06 02:14:51,799 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 2 states [2025-02-06 02:14:51,799 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-02-06 02:14:51,813 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 2 interpolants. [2025-02-06 02:14:51,814 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=1, Invalid=1, Unknown=0, NotChecked=0, Total=2 [2025-02-06 02:14:51,817 INFO L87 Difference]: Start difference. First operand has 189 states, 137 states have (on average 1.489051094890511) internal successors, (204), 138 states have internal predecessors, (204), 49 states have call successors, (49), 1 states have call predecessors, (49), 1 states have return successors, (49), 49 states have call predecessors, (49), 49 states have call successors, (49) Second operand has 2 states, 2 states have (on average 44.5) internal successors, (89), 2 states have internal predecessors, (89), 2 states have call successors, (49), 2 states have call predecessors, (49), 1 states have return successors, (49), 1 states have call predecessors, (49), 2 states have call successors, (49) [2025-02-06 02:14:51,866 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-02-06 02:14:51,866 INFO L93 Difference]: Finished difference Result 371 states and 646 transitions. [2025-02-06 02:14:51,868 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 2 states. [2025-02-06 02:14:51,869 INFO L78 Accepts]: Start accepts. Automaton has has 2 states, 2 states have (on average 44.5) internal successors, (89), 2 states have internal predecessors, (89), 2 states have call successors, (49), 2 states have call predecessors, (49), 1 states have return successors, (49), 1 states have call predecessors, (49), 2 states have call successors, (49) Word has length 329 [2025-02-06 02:14:51,870 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-02-06 02:14:51,876 INFO L225 Difference]: With dead ends: 371 [2025-02-06 02:14:51,878 INFO L226 Difference]: Without dead ends: 185 [2025-02-06 02:14:51,882 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 330 GetRequests, 330 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-06 02:14:51,886 INFO L435 NwaCegarLoop]: 288 mSDtfsCounter, 0 mSDsluCounter, 0 mSDsCounter, 0 mSdLazyCounter, 6 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 0 SdHoareTripleChecker+Valid, 288 SdHoareTripleChecker+Invalid, 6 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 6 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2025-02-06 02:14:51,889 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [0 Valid, 288 Invalid, 6 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 6 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2025-02-06 02:14:51,899 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 185 states. [2025-02-06 02:14:51,922 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 185 to 185. [2025-02-06 02:14:51,923 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 185 states, 134 states have (on average 1.462686567164179) internal successors, (196), 134 states have internal predecessors, (196), 49 states have call successors, (49), 1 states have call predecessors, (49), 1 states have return successors, (49), 49 states have call predecessors, (49), 49 states have call successors, (49) [2025-02-06 02:14:51,927 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 185 states to 185 states and 294 transitions. [2025-02-06 02:14:51,928 INFO L78 Accepts]: Start accepts. Automaton has 185 states and 294 transitions. Word has length 329 [2025-02-06 02:14:51,929 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-02-06 02:14:51,929 INFO L471 AbstractCegarLoop]: Abstraction has 185 states and 294 transitions. [2025-02-06 02:14:51,929 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 2 states, 2 states have (on average 44.5) internal successors, (89), 2 states have internal predecessors, (89), 2 states have call successors, (49), 2 states have call predecessors, (49), 1 states have return successors, (49), 1 states have call predecessors, (49), 2 states have call successors, (49) [2025-02-06 02:14:51,929 INFO L276 IsEmpty]: Start isEmpty. Operand 185 states and 294 transitions. [2025-02-06 02:14:51,933 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 330 [2025-02-06 02:14:51,934 INFO L210 NwaCegarLoop]: Found error trace [2025-02-06 02:14:51,934 INFO L218 NwaCegarLoop]: trace histogram [49, 49, 49, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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-06 02:14:51,944 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (2)] Ended with exit code 0 [2025-02-06 02:14:52,134 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-06 02:14:52,135 INFO L396 AbstractCegarLoop]: === Iteration 2 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-02-06 02:14:52,135 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-02-06 02:14:52,136 INFO L85 PathProgramCache]: Analyzing trace with hash -933461228, now seen corresponding path program 1 times [2025-02-06 02:14:52,136 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-02-06 02:14:52,136 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [691188736] [2025-02-06 02:14:52,136 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-02-06 02:14:52,136 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-02-06 02:14:52,170 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 329 statements into 1 equivalence classes. [2025-02-06 02:14:52,257 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 329 of 329 statements. [2025-02-06 02:14:52,257 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-02-06 02:14:52,257 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-02-06 02:14:52,518 INFO L134 CoverageAnalysis]: Checked inductivity of 4704 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 4704 trivial. 0 not checked. [2025-02-06 02:14:52,520 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-02-06 02:14:52,521 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [691188736] [2025-02-06 02:14:52,521 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [691188736] provided 1 perfect and 0 imperfect interpolant sequences [2025-02-06 02:14:52,521 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-02-06 02:14:52,522 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2025-02-06 02:14:52,522 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1735503030] [2025-02-06 02:14:52,522 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-02-06 02:14:52,523 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2025-02-06 02:14:52,524 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-02-06 02:14:52,525 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2025-02-06 02:14:52,525 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-02-06 02:14:52,526 INFO L87 Difference]: Start difference. First operand 185 states and 294 transitions. Second operand has 3 states, 3 states have (on average 29.0) internal successors, (87), 3 states have internal predecessors, (87), 1 states have call successors, (49), 1 states have call predecessors, (49), 1 states have return successors, (49), 1 states have call predecessors, (49), 1 states have call successors, (49) [2025-02-06 02:14:52,627 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-02-06 02:14:52,628 INFO L93 Difference]: Finished difference Result 469 states and 745 transitions. [2025-02-06 02:14:52,629 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2025-02-06 02:14:52,630 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 29.0) internal successors, (87), 3 states have internal predecessors, (87), 1 states have call successors, (49), 1 states have call predecessors, (49), 1 states have return successors, (49), 1 states have call predecessors, (49), 1 states have call successors, (49) Word has length 329 [2025-02-06 02:14:52,631 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-02-06 02:14:52,636 INFO L225 Difference]: With dead ends: 469 [2025-02-06 02:14:52,636 INFO L226 Difference]: Without dead ends: 287 [2025-02-06 02:14:52,637 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-06 02:14:52,637 INFO L435 NwaCegarLoop]: 335 mSDtfsCounter, 160 mSDsluCounter, 264 mSDsCounter, 0 mSdLazyCounter, 35 mSolverCounterSat, 6 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 160 SdHoareTripleChecker+Valid, 599 SdHoareTripleChecker+Invalid, 41 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 6 IncrementalHoareTripleChecker+Valid, 35 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2025-02-06 02:14:52,637 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [160 Valid, 599 Invalid, 41 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [6 Valid, 35 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2025-02-06 02:14:52,638 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 287 states. [2025-02-06 02:14:52,666 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 287 to 284. [2025-02-06 02:14:52,668 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 284 states, 230 states have (on average 1.508695652173913) internal successors, (347), 231 states have internal predecessors, (347), 51 states have call successors, (51), 2 states have call predecessors, (51), 2 states have return successors, (51), 50 states have call predecessors, (51), 51 states have call successors, (51) [2025-02-06 02:14:52,671 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 284 states to 284 states and 449 transitions. [2025-02-06 02:14:52,673 INFO L78 Accepts]: Start accepts. Automaton has 284 states and 449 transitions. Word has length 329 [2025-02-06 02:14:52,674 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-02-06 02:14:52,675 INFO L471 AbstractCegarLoop]: Abstraction has 284 states and 449 transitions. [2025-02-06 02:14:52,675 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 29.0) internal successors, (87), 3 states have internal predecessors, (87), 1 states have call successors, (49), 1 states have call predecessors, (49), 1 states have return successors, (49), 1 states have call predecessors, (49), 1 states have call successors, (49) [2025-02-06 02:14:52,675 INFO L276 IsEmpty]: Start isEmpty. Operand 284 states and 449 transitions. [2025-02-06 02:14:52,680 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 330 [2025-02-06 02:14:52,681 INFO L210 NwaCegarLoop]: Found error trace [2025-02-06 02:14:52,681 INFO L218 NwaCegarLoop]: trace histogram [49, 49, 49, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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-06 02:14:52,681 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable1 [2025-02-06 02:14:52,682 INFO L396 AbstractCegarLoop]: === Iteration 3 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-02-06 02:14:52,682 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-02-06 02:14:52,682 INFO L85 PathProgramCache]: Analyzing trace with hash -941220587, now seen corresponding path program 1 times [2025-02-06 02:14:52,682 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-02-06 02:14:52,682 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1424268030] [2025-02-06 02:14:52,683 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-02-06 02:14:52,683 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-02-06 02:14:52,725 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 329 statements into 1 equivalence classes. [2025-02-06 02:14:52,781 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 329 of 329 statements. [2025-02-06 02:14:52,782 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-02-06 02:14:52,782 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-02-06 02:14:52,953 INFO L134 CoverageAnalysis]: Checked inductivity of 4704 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 4704 trivial. 0 not checked. [2025-02-06 02:14:52,953 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-02-06 02:14:52,954 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1424268030] [2025-02-06 02:14:52,954 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1424268030] provided 1 perfect and 0 imperfect interpolant sequences [2025-02-06 02:14:52,954 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-02-06 02:14:52,954 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2025-02-06 02:14:52,954 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [989404808] [2025-02-06 02:14:52,955 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-02-06 02:14:52,955 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2025-02-06 02:14:52,955 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-02-06 02:14:52,956 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2025-02-06 02:14:52,957 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-02-06 02:14:52,957 INFO L87 Difference]: Start difference. First operand 284 states and 449 transitions. Second operand has 3 states, 3 states have (on average 29.0) internal successors, (87), 3 states have internal predecessors, (87), 1 states have call successors, (49), 1 states have call predecessors, (49), 1 states have return successors, (49), 1 states have call predecessors, (49), 1 states have call successors, (49) [2025-02-06 02:14:53,059 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-02-06 02:14:53,059 INFO L93 Difference]: Finished difference Result 572 states and 900 transitions. [2025-02-06 02:14:53,059 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2025-02-06 02:14:53,060 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 29.0) internal successors, (87), 3 states have internal predecessors, (87), 1 states have call successors, (49), 1 states have call predecessors, (49), 1 states have return successors, (49), 1 states have call predecessors, (49), 1 states have call successors, (49) Word has length 329 [2025-02-06 02:14:53,061 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-02-06 02:14:53,062 INFO L225 Difference]: With dead ends: 572 [2025-02-06 02:14:53,063 INFO L226 Difference]: Without dead ends: 291 [2025-02-06 02:14:53,063 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-06 02:14:53,064 INFO L435 NwaCegarLoop]: 289 mSDtfsCounter, 137 mSDsluCounter, 268 mSDsCounter, 0 mSdLazyCounter, 37 mSolverCounterSat, 2 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 137 SdHoareTripleChecker+Valid, 557 SdHoareTripleChecker+Invalid, 39 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 2 IncrementalHoareTripleChecker+Valid, 37 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2025-02-06 02:14:53,064 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [137 Valid, 557 Invalid, 39 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [2 Valid, 37 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2025-02-06 02:14:53,065 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 291 states. [2025-02-06 02:14:53,077 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 291 to 235. [2025-02-06 02:14:53,078 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 235 states, 183 states have (on average 1.4863387978142077) internal successors, (272), 183 states have internal predecessors, (272), 49 states have call successors, (49), 2 states have call predecessors, (49), 2 states have return successors, (49), 49 states have call predecessors, (49), 49 states have call successors, (49) [2025-02-06 02:14:53,079 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 235 states to 235 states and 370 transitions. [2025-02-06 02:14:53,080 INFO L78 Accepts]: Start accepts. Automaton has 235 states and 370 transitions. Word has length 329 [2025-02-06 02:14:53,081 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-02-06 02:14:53,081 INFO L471 AbstractCegarLoop]: Abstraction has 235 states and 370 transitions. [2025-02-06 02:14:53,081 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 29.0) internal successors, (87), 3 states have internal predecessors, (87), 1 states have call successors, (49), 1 states have call predecessors, (49), 1 states have return successors, (49), 1 states have call predecessors, (49), 1 states have call successors, (49) [2025-02-06 02:14:53,081 INFO L276 IsEmpty]: Start isEmpty. Operand 235 states and 370 transitions. [2025-02-06 02:14:53,084 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 330 [2025-02-06 02:14:53,085 INFO L210 NwaCegarLoop]: Found error trace [2025-02-06 02:14:53,085 INFO L218 NwaCegarLoop]: trace histogram [49, 49, 49, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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-06 02:14:53,085 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable2 [2025-02-06 02:14:53,085 INFO L396 AbstractCegarLoop]: === Iteration 4 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-02-06 02:14:53,086 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-02-06 02:14:53,086 INFO L85 PathProgramCache]: Analyzing trace with hash 20393430, now seen corresponding path program 1 times [2025-02-06 02:14:53,086 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-02-06 02:14:53,086 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [899039296] [2025-02-06 02:14:53,086 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-02-06 02:14:53,086 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-02-06 02:14:53,126 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 329 statements into 1 equivalence classes. [2025-02-06 02:14:53,153 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 329 of 329 statements. [2025-02-06 02:14:53,155 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-02-06 02:14:53,155 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-02-06 02:14:53,258 INFO L134 CoverageAnalysis]: Checked inductivity of 4704 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 4704 trivial. 0 not checked. [2025-02-06 02:14:53,258 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-02-06 02:14:53,258 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [899039296] [2025-02-06 02:14:53,258 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [899039296] provided 1 perfect and 0 imperfect interpolant sequences [2025-02-06 02:14:53,258 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-02-06 02:14:53,259 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2025-02-06 02:14:53,259 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1178342625] [2025-02-06 02:14:53,259 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-02-06 02:14:53,260 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2025-02-06 02:14:53,260 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-02-06 02:14:53,261 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2025-02-06 02:14:53,261 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-02-06 02:14:53,261 INFO L87 Difference]: Start difference. First operand 235 states and 370 transitions. Second operand has 3 states, 3 states have (on average 29.0) internal successors, (87), 3 states have internal predecessors, (87), 1 states have call successors, (49), 1 states have call predecessors, (49), 1 states have return successors, (49), 1 states have call predecessors, (49), 1 states have call successors, (49) [2025-02-06 02:14:53,298 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-02-06 02:14:53,298 INFO L93 Difference]: Finished difference Result 469 states and 741 transitions. [2025-02-06 02:14:53,300 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2025-02-06 02:14:53,300 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 29.0) internal successors, (87), 3 states have internal predecessors, (87), 1 states have call successors, (49), 1 states have call predecessors, (49), 1 states have return successors, (49), 1 states have call predecessors, (49), 1 states have call successors, (49) Word has length 329 [2025-02-06 02:14:53,301 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-02-06 02:14:53,302 INFO L225 Difference]: With dead ends: 469 [2025-02-06 02:14:53,304 INFO L226 Difference]: Without dead ends: 237 [2025-02-06 02:14:53,305 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-06 02:14:53,305 INFO L435 NwaCegarLoop]: 287 mSDtfsCounter, 0 mSDsluCounter, 280 mSDsCounter, 0 mSdLazyCounter, 20 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 0 SdHoareTripleChecker+Valid, 567 SdHoareTripleChecker+Invalid, 20 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 20 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2025-02-06 02:14:53,306 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [0 Valid, 567 Invalid, 20 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 20 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2025-02-06 02:14:53,307 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 237 states. [2025-02-06 02:14:53,323 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 237 to 237. [2025-02-06 02:14:53,325 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 237 states, 185 states have (on average 1.481081081081081) internal successors, (274), 185 states have internal predecessors, (274), 49 states have call successors, (49), 2 states have call predecessors, (49), 2 states have return successors, (49), 49 states have call predecessors, (49), 49 states have call successors, (49) [2025-02-06 02:14:53,327 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 237 states to 237 states and 372 transitions. [2025-02-06 02:14:53,327 INFO L78 Accepts]: Start accepts. Automaton has 237 states and 372 transitions. Word has length 329 [2025-02-06 02:14:53,327 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-02-06 02:14:53,327 INFO L471 AbstractCegarLoop]: Abstraction has 237 states and 372 transitions. [2025-02-06 02:14:53,328 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 29.0) internal successors, (87), 3 states have internal predecessors, (87), 1 states have call successors, (49), 1 states have call predecessors, (49), 1 states have return successors, (49), 1 states have call predecessors, (49), 1 states have call successors, (49) [2025-02-06 02:14:53,328 INFO L276 IsEmpty]: Start isEmpty. Operand 237 states and 372 transitions. [2025-02-06 02:14:53,332 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 332 [2025-02-06 02:14:53,332 INFO L210 NwaCegarLoop]: Found error trace [2025-02-06 02:14:53,332 INFO L218 NwaCegarLoop]: trace histogram [49, 49, 49, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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-06 02:14:53,333 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable3 [2025-02-06 02:14:53,333 INFO L396 AbstractCegarLoop]: === Iteration 5 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-02-06 02:14:53,334 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-02-06 02:14:53,334 INFO L85 PathProgramCache]: Analyzing trace with hash 863048730, now seen corresponding path program 1 times [2025-02-06 02:14:53,334 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-02-06 02:14:53,334 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [479089144] [2025-02-06 02:14:53,334 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-02-06 02:14:53,334 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-02-06 02:14:53,359 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 331 statements into 1 equivalence classes. [2025-02-06 02:14:53,415 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 331 of 331 statements. [2025-02-06 02:14:53,415 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-02-06 02:14:53,415 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-02-06 02:14:53,655 INFO L134 CoverageAnalysis]: Checked inductivity of 4704 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 4704 trivial. 0 not checked. [2025-02-06 02:14:53,656 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-02-06 02:14:53,656 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [479089144] [2025-02-06 02:14:53,656 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [479089144] provided 1 perfect and 0 imperfect interpolant sequences [2025-02-06 02:14:53,656 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-02-06 02:14:53,656 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2025-02-06 02:14:53,657 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1396145485] [2025-02-06 02:14:53,657 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-02-06 02:14:53,657 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2025-02-06 02:14:53,657 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-02-06 02:14:53,658 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2025-02-06 02:14:53,658 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2025-02-06 02:14:53,658 INFO L87 Difference]: Start difference. First operand 237 states and 372 transitions. Second operand has 4 states, 4 states have (on average 22.25) internal successors, (89), 4 states have internal predecessors, (89), 1 states have call successors, (49), 1 states have call predecessors, (49), 1 states have return successors, (49), 1 states have call predecessors, (49), 1 states have call successors, (49) [2025-02-06 02:14:53,912 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-02-06 02:14:53,913 INFO L93 Difference]: Finished difference Result 656 states and 1029 transitions. [2025-02-06 02:14:53,913 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2025-02-06 02:14:53,913 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 4 states have (on average 22.25) internal successors, (89), 4 states have internal predecessors, (89), 1 states have call successors, (49), 1 states have call predecessors, (49), 1 states have return successors, (49), 1 states have call predecessors, (49), 1 states have call successors, (49) Word has length 331 [2025-02-06 02:14:53,917 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-02-06 02:14:53,920 INFO L225 Difference]: With dead ends: 656 [2025-02-06 02:14:53,922 INFO L226 Difference]: Without dead ends: 422 [2025-02-06 02:14:53,923 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-06 02:14:53,925 INFO L435 NwaCegarLoop]: 380 mSDtfsCounter, 185 mSDsluCounter, 536 mSDsCounter, 0 mSdLazyCounter, 185 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 185 SdHoareTripleChecker+Valid, 916 SdHoareTripleChecker+Invalid, 185 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 185 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.2s IncrementalHoareTripleChecker+Time [2025-02-06 02:14:53,925 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [185 Valid, 916 Invalid, 185 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 185 Invalid, 0 Unknown, 0 Unchecked, 0.2s Time] [2025-02-06 02:14:53,926 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 422 states. [2025-02-06 02:14:53,967 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 422 to 420. [2025-02-06 02:14:53,968 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 420 states, 317 states have (on average 1.4574132492113565) internal successors, (462), 317 states have internal predecessors, (462), 98 states have call successors, (98), 4 states have call predecessors, (98), 4 states have return successors, (98), 98 states have call predecessors, (98), 98 states have call successors, (98) [2025-02-06 02:14:53,970 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 420 states to 420 states and 658 transitions. [2025-02-06 02:14:53,972 INFO L78 Accepts]: Start accepts. Automaton has 420 states and 658 transitions. Word has length 331 [2025-02-06 02:14:53,974 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-02-06 02:14:53,974 INFO L471 AbstractCegarLoop]: Abstraction has 420 states and 658 transitions. [2025-02-06 02:14:53,974 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 22.25) internal successors, (89), 4 states have internal predecessors, (89), 1 states have call successors, (49), 1 states have call predecessors, (49), 1 states have return successors, (49), 1 states have call predecessors, (49), 1 states have call successors, (49) [2025-02-06 02:14:53,974 INFO L276 IsEmpty]: Start isEmpty. Operand 420 states and 658 transitions. [2025-02-06 02:14:53,977 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 333 [2025-02-06 02:14:53,978 INFO L210 NwaCegarLoop]: Found error trace [2025-02-06 02:14:53,979 INFO L218 NwaCegarLoop]: trace histogram [49, 49, 49, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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-06 02:14:53,979 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable4 [2025-02-06 02:14:53,980 INFO L396 AbstractCegarLoop]: === Iteration 6 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-02-06 02:14:53,981 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-02-06 02:14:53,981 INFO L85 PathProgramCache]: Analyzing trace with hash -1817873469, now seen corresponding path program 1 times [2025-02-06 02:14:53,982 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-02-06 02:14:53,983 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1548451805] [2025-02-06 02:14:53,983 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-02-06 02:14:53,983 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-02-06 02:14:54,017 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 332 statements into 1 equivalence classes. [2025-02-06 02:14:54,098 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 332 of 332 statements. [2025-02-06 02:14:54,098 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-02-06 02:14:54,098 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-02-06 02:14:55,951 INFO L134 CoverageAnalysis]: Checked inductivity of 4704 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 4704 trivial. 0 not checked. [2025-02-06 02:14:55,952 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-02-06 02:14:55,952 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1548451805] [2025-02-06 02:14:55,952 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1548451805] provided 1 perfect and 0 imperfect interpolant sequences [2025-02-06 02:14:55,952 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-02-06 02:14:55,952 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [8] imperfect sequences [] total 8 [2025-02-06 02:14:55,952 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [640115290] [2025-02-06 02:14:55,952 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-02-06 02:14:55,953 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 8 states [2025-02-06 02:14:55,953 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-02-06 02:14:55,954 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2025-02-06 02:14:55,954 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=17, Invalid=39, Unknown=0, NotChecked=0, Total=56 [2025-02-06 02:14:55,954 INFO L87 Difference]: Start difference. First operand 420 states and 658 transitions. Second operand has 8 states, 8 states have (on average 11.25) internal successors, (90), 8 states have internal predecessors, (90), 1 states have call successors, (49), 1 states have call predecessors, (49), 1 states have return successors, (49), 1 states have call predecessors, (49), 1 states have call successors, (49) [2025-02-06 02:14:57,955 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-02-06 02:14:57,956 INFO L93 Difference]: Finished difference Result 1445 states and 2239 transitions. [2025-02-06 02:14:57,956 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2025-02-06 02:14:57,957 INFO L78 Accepts]: Start accepts. Automaton has has 8 states, 8 states have (on average 11.25) internal successors, (90), 8 states have internal predecessors, (90), 1 states have call successors, (49), 1 states have call predecessors, (49), 1 states have return successors, (49), 1 states have call predecessors, (49), 1 states have call successors, (49) Word has length 332 [2025-02-06 02:14:57,957 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-02-06 02:14:57,964 INFO L225 Difference]: With dead ends: 1445 [2025-02-06 02:14:57,964 INFO L226 Difference]: Without dead ends: 1028 [2025-02-06 02:14:57,966 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 20 GetRequests, 10 SyntacticMatches, 0 SemanticMatches, 10 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 10 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=45, Invalid=87, Unknown=0, NotChecked=0, Total=132 [2025-02-06 02:14:57,966 INFO L435 NwaCegarLoop]: 654 mSDtfsCounter, 902 mSDsluCounter, 1404 mSDsCounter, 0 mSdLazyCounter, 1038 mSolverCounterSat, 273 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 1.5s Time, 0 mProtectedPredicate, 0 mProtectedAction, 902 SdHoareTripleChecker+Valid, 2058 SdHoareTripleChecker+Invalid, 1311 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 273 IncrementalHoareTripleChecker+Valid, 1038 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 1.7s IncrementalHoareTripleChecker+Time [2025-02-06 02:14:57,966 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [902 Valid, 2058 Invalid, 1311 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [273 Valid, 1038 Invalid, 0 Unknown, 0 Unchecked, 1.7s Time] [2025-02-06 02:14:57,968 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1028 states. [2025-02-06 02:14:58,032 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1028 to 690. [2025-02-06 02:14:58,034 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 690 states, 528 states have (on average 1.4431818181818181) internal successors, (762), 529 states have internal predecessors, (762), 153 states have call successors, (153), 8 states have call predecessors, (153), 8 states have return successors, (153), 152 states have call predecessors, (153), 153 states have call successors, (153) [2025-02-06 02:14:58,037 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 690 states to 690 states and 1068 transitions. [2025-02-06 02:14:58,038 INFO L78 Accepts]: Start accepts. Automaton has 690 states and 1068 transitions. Word has length 332 [2025-02-06 02:14:58,038 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-02-06 02:14:58,039 INFO L471 AbstractCegarLoop]: Abstraction has 690 states and 1068 transitions. [2025-02-06 02:14:58,039 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 8 states, 8 states have (on average 11.25) internal successors, (90), 8 states have internal predecessors, (90), 1 states have call successors, (49), 1 states have call predecessors, (49), 1 states have return successors, (49), 1 states have call predecessors, (49), 1 states have call successors, (49) [2025-02-06 02:14:58,039 INFO L276 IsEmpty]: Start isEmpty. Operand 690 states and 1068 transitions. [2025-02-06 02:14:58,041 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 333 [2025-02-06 02:14:58,041 INFO L210 NwaCegarLoop]: Found error trace [2025-02-06 02:14:58,042 INFO L218 NwaCegarLoop]: trace histogram [49, 49, 49, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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-06 02:14:58,042 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable5 [2025-02-06 02:14:58,042 INFO L396 AbstractCegarLoop]: === Iteration 7 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-02-06 02:14:58,042 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-02-06 02:14:58,042 INFO L85 PathProgramCache]: Analyzing trace with hash -157938338, now seen corresponding path program 1 times [2025-02-06 02:14:58,042 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-02-06 02:14:58,043 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [352215417] [2025-02-06 02:14:58,043 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-02-06 02:14:58,043 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-02-06 02:14:58,068 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 332 statements into 1 equivalence classes. [2025-02-06 02:14:58,115 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 332 of 332 statements. [2025-02-06 02:14:58,115 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-02-06 02:14:58,115 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-02-06 02:14:58,826 INFO L134 CoverageAnalysis]: Checked inductivity of 4704 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 4704 trivial. 0 not checked. [2025-02-06 02:14:58,826 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-02-06 02:14:58,826 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [352215417] [2025-02-06 02:14:58,827 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [352215417] provided 1 perfect and 0 imperfect interpolant sequences [2025-02-06 02:14:58,827 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-02-06 02:14:58,827 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2025-02-06 02:14:58,827 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1001823045] [2025-02-06 02:14:58,827 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-02-06 02:14:58,828 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2025-02-06 02:14:58,828 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-02-06 02:14:58,828 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2025-02-06 02:14:58,828 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=12, Invalid=18, Unknown=0, NotChecked=0, Total=30 [2025-02-06 02:14:58,829 INFO L87 Difference]: Start difference. First operand 690 states and 1068 transitions. Second operand has 6 states, 6 states have (on average 15.0) internal successors, (90), 6 states have internal predecessors, (90), 3 states have call successors, (49), 1 states have call predecessors, (49), 1 states have return successors, (49), 3 states have call predecessors, (49), 3 states have call successors, (49) [2025-02-06 02:14:59,378 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-02-06 02:14:59,379 INFO L93 Difference]: Finished difference Result 1768 states and 2726 transitions. [2025-02-06 02:14:59,380 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2025-02-06 02:14:59,380 INFO L78 Accepts]: Start accepts. Automaton has has 6 states, 6 states have (on average 15.0) internal successors, (90), 6 states have internal predecessors, (90), 3 states have call successors, (49), 1 states have call predecessors, (49), 1 states have return successors, (49), 3 states have call predecessors, (49), 3 states have call successors, (49) Word has length 332 [2025-02-06 02:14:59,381 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-02-06 02:14:59,389 INFO L225 Difference]: With dead ends: 1768 [2025-02-06 02:14:59,389 INFO L226 Difference]: Without dead ends: 1081 [2025-02-06 02:14:59,391 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 11 GetRequests, 6 SyntacticMatches, 0 SemanticMatches, 5 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 2 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=18, Invalid=24, Unknown=0, NotChecked=0, Total=42 [2025-02-06 02:14:59,392 INFO L435 NwaCegarLoop]: 391 mSDtfsCounter, 717 mSDsluCounter, 814 mSDsCounter, 0 mSdLazyCounter, 216 mSolverCounterSat, 104 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.4s Time, 0 mProtectedPredicate, 0 mProtectedAction, 717 SdHoareTripleChecker+Valid, 1205 SdHoareTripleChecker+Invalid, 320 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 104 IncrementalHoareTripleChecker+Valid, 216 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.5s IncrementalHoareTripleChecker+Time [2025-02-06 02:14:59,393 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [717 Valid, 1205 Invalid, 320 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [104 Valid, 216 Invalid, 0 Unknown, 0 Unchecked, 0.5s Time] [2025-02-06 02:14:59,394 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1081 states. [2025-02-06 02:14:59,452 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1081 to 1075. [2025-02-06 02:14:59,454 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 1075 states, 846 states have (on average 1.4479905437352245) internal successors, (1225), 849 states have internal predecessors, (1225), 214 states have call successors, (214), 14 states have call predecessors, (214), 14 states have return successors, (214), 211 states have call predecessors, (214), 214 states have call successors, (214) [2025-02-06 02:14:59,460 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1075 states to 1075 states and 1653 transitions. [2025-02-06 02:14:59,461 INFO L78 Accepts]: Start accepts. Automaton has 1075 states and 1653 transitions. Word has length 332 [2025-02-06 02:14:59,462 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-02-06 02:14:59,462 INFO L471 AbstractCegarLoop]: Abstraction has 1075 states and 1653 transitions. [2025-02-06 02:14:59,463 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 6 states have (on average 15.0) internal successors, (90), 6 states have internal predecessors, (90), 3 states have call successors, (49), 1 states have call predecessors, (49), 1 states have return successors, (49), 3 states have call predecessors, (49), 3 states have call successors, (49) [2025-02-06 02:14:59,463 INFO L276 IsEmpty]: Start isEmpty. Operand 1075 states and 1653 transitions. [2025-02-06 02:14:59,465 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 334 [2025-02-06 02:14:59,466 INFO L210 NwaCegarLoop]: Found error trace [2025-02-06 02:14:59,467 INFO L218 NwaCegarLoop]: trace histogram [49, 49, 49, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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-06 02:14:59,467 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable6 [2025-02-06 02:14:59,467 INFO L396 AbstractCegarLoop]: === Iteration 8 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-02-06 02:14:59,467 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-02-06 02:14:59,468 INFO L85 PathProgramCache]: Analyzing trace with hash 1088479228, now seen corresponding path program 1 times [2025-02-06 02:14:59,468 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-02-06 02:14:59,468 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [122245085] [2025-02-06 02:14:59,468 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-02-06 02:14:59,468 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-02-06 02:14:59,490 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 333 statements into 1 equivalence classes. [2025-02-06 02:14:59,564 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 333 of 333 statements. [2025-02-06 02:14:59,568 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-02-06 02:14:59,568 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-02-06 02:15:00,530 INFO L134 CoverageAnalysis]: Checked inductivity of 4704 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 4704 trivial. 0 not checked. [2025-02-06 02:15:00,530 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-02-06 02:15:00,530 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [122245085] [2025-02-06 02:15:00,530 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [122245085] provided 1 perfect and 0 imperfect interpolant sequences [2025-02-06 02:15:00,530 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-02-06 02:15:00,530 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2025-02-06 02:15:00,531 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [716631866] [2025-02-06 02:15:00,531 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-02-06 02:15:00,531 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2025-02-06 02:15:00,531 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-02-06 02:15:00,532 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2025-02-06 02:15:00,532 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=6, Invalid=6, Unknown=0, NotChecked=0, Total=12 [2025-02-06 02:15:00,532 INFO L87 Difference]: Start difference. First operand 1075 states and 1653 transitions. Second operand has 4 states, 4 states have (on average 22.75) internal successors, (91), 4 states have internal predecessors, (91), 1 states have call successors, (49), 1 states have call predecessors, (49), 1 states have return successors, (49), 1 states have call predecessors, (49), 1 states have call successors, (49) [2025-02-06 02:15:01,052 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-02-06 02:15:01,052 INFO L93 Difference]: Finished difference Result 2276 states and 3494 transitions. [2025-02-06 02:15:01,053 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2025-02-06 02:15:01,053 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 4 states have (on average 22.75) internal successors, (91), 4 states have internal predecessors, (91), 1 states have call successors, (49), 1 states have call predecessors, (49), 1 states have return successors, (49), 1 states have call predecessors, (49), 1 states have call successors, (49) Word has length 333 [2025-02-06 02:15:01,054 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-02-06 02:15:01,064 INFO L225 Difference]: With dead ends: 2276 [2025-02-06 02:15:01,064 INFO L226 Difference]: Without dead ends: 1772 [2025-02-06 02:15:01,066 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 9 GetRequests, 7 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-06 02:15:01,066 INFO L435 NwaCegarLoop]: 424 mSDtfsCounter, 597 mSDsluCounter, 419 mSDsCounter, 0 mSdLazyCounter, 164 mSolverCounterSat, 99 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.4s Time, 0 mProtectedPredicate, 0 mProtectedAction, 597 SdHoareTripleChecker+Valid, 843 SdHoareTripleChecker+Invalid, 263 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 99 IncrementalHoareTripleChecker+Valid, 164 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.4s IncrementalHoareTripleChecker+Time [2025-02-06 02:15:01,066 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [597 Valid, 843 Invalid, 263 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [99 Valid, 164 Invalid, 0 Unknown, 0 Unchecked, 0.4s Time] [2025-02-06 02:15:01,068 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1772 states. [2025-02-06 02:15:01,180 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1772 to 1195. [2025-02-06 02:15:01,183 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 1195 states, 966 states have (on average 1.4710144927536233) internal successors, (1421), 969 states have internal predecessors, (1421), 214 states have call successors, (214), 14 states have call predecessors, (214), 14 states have return successors, (214), 211 states have call predecessors, (214), 214 states have call successors, (214) [2025-02-06 02:15:01,189 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1195 states to 1195 states and 1849 transitions. [2025-02-06 02:15:01,191 INFO L78 Accepts]: Start accepts. Automaton has 1195 states and 1849 transitions. Word has length 333 [2025-02-06 02:15:01,192 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-02-06 02:15:01,192 INFO L471 AbstractCegarLoop]: Abstraction has 1195 states and 1849 transitions. [2025-02-06 02:15:01,192 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 22.75) internal successors, (91), 4 states have internal predecessors, (91), 1 states have call successors, (49), 1 states have call predecessors, (49), 1 states have return successors, (49), 1 states have call predecessors, (49), 1 states have call successors, (49) [2025-02-06 02:15:01,192 INFO L276 IsEmpty]: Start isEmpty. Operand 1195 states and 1849 transitions. [2025-02-06 02:15:01,197 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 334 [2025-02-06 02:15:01,197 INFO L210 NwaCegarLoop]: Found error trace [2025-02-06 02:15:01,198 INFO L218 NwaCegarLoop]: trace histogram [49, 49, 49, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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-06 02:15:01,198 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable7 [2025-02-06 02:15:01,199 INFO L396 AbstractCegarLoop]: === Iteration 9 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-02-06 02:15:01,199 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-02-06 02:15:01,199 INFO L85 PathProgramCache]: Analyzing trace with hash -1886853062, now seen corresponding path program 1 times [2025-02-06 02:15:01,199 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-02-06 02:15:01,200 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1113591475] [2025-02-06 02:15:01,200 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-02-06 02:15:01,200 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-02-06 02:15:01,225 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 333 statements into 1 equivalence classes. [2025-02-06 02:15:01,574 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 333 of 333 statements. [2025-02-06 02:15:01,574 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-02-06 02:15:01,574 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-02-06 02:15:03,571 INFO L134 CoverageAnalysis]: Checked inductivity of 4704 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 4704 trivial. 0 not checked. [2025-02-06 02:15:03,571 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-02-06 02:15:03,571 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1113591475] [2025-02-06 02:15:03,572 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1113591475] provided 1 perfect and 0 imperfect interpolant sequences [2025-02-06 02:15:03,572 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-02-06 02:15:03,572 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2025-02-06 02:15:03,572 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1082502631] [2025-02-06 02:15:03,572 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-02-06 02:15:03,572 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2025-02-06 02:15:03,572 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-02-06 02:15:03,573 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2025-02-06 02:15:03,573 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=9, Invalid=21, Unknown=0, NotChecked=0, Total=30 [2025-02-06 02:15:03,574 INFO L87 Difference]: Start difference. First operand 1195 states and 1849 transitions. Second operand has 6 states, 6 states have (on average 15.166666666666666) internal successors, (91), 6 states have internal predecessors, (91), 1 states have call successors, (49), 1 states have call predecessors, (49), 1 states have return successors, (49), 1 states have call predecessors, (49), 1 states have call successors, (49) [2025-02-06 02:15:04,303 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-02-06 02:15:04,303 INFO L93 Difference]: Finished difference Result 3134 states and 4825 transitions. [2025-02-06 02:15:04,304 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2025-02-06 02:15:04,304 INFO L78 Accepts]: Start accepts. Automaton has has 6 states, 6 states have (on average 15.166666666666666) internal successors, (91), 6 states have internal predecessors, (91), 1 states have call successors, (49), 1 states have call predecessors, (49), 1 states have return successors, (49), 1 states have call predecessors, (49), 1 states have call successors, (49) Word has length 333 [2025-02-06 02:15:04,304 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-02-06 02:15:04,314 INFO L225 Difference]: With dead ends: 3134 [2025-02-06 02:15:04,314 INFO L226 Difference]: Without dead ends: 1942 [2025-02-06 02:15:04,316 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 15 GetRequests, 7 SyntacticMatches, 0 SemanticMatches, 8 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 5 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=29, Invalid=61, Unknown=0, NotChecked=0, Total=90 [2025-02-06 02:15:04,317 INFO L435 NwaCegarLoop]: 285 mSDtfsCounter, 606 mSDsluCounter, 826 mSDsCounter, 0 mSdLazyCounter, 386 mSolverCounterSat, 183 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.5s Time, 0 mProtectedPredicate, 0 mProtectedAction, 606 SdHoareTripleChecker+Valid, 1111 SdHoareTripleChecker+Invalid, 569 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 183 IncrementalHoareTripleChecker+Valid, 386 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.5s IncrementalHoareTripleChecker+Time [2025-02-06 02:15:04,318 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [606 Valid, 1111 Invalid, 569 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [183 Valid, 386 Invalid, 0 Unknown, 0 Unchecked, 0.5s Time] [2025-02-06 02:15:04,320 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1942 states. [2025-02-06 02:15:04,404 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1942 to 1681. [2025-02-06 02:15:04,407 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 1681 states, 1365 states have (on average 1.4527472527472527) internal successors, (1983), 1372 states have internal predecessors, (1983), 291 states have call successors, (291), 24 states have call predecessors, (291), 24 states have return successors, (291), 284 states have call predecessors, (291), 291 states have call successors, (291) [2025-02-06 02:15:04,412 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1681 states to 1681 states and 2565 transitions. [2025-02-06 02:15:04,414 INFO L78 Accepts]: Start accepts. Automaton has 1681 states and 2565 transitions. Word has length 333 [2025-02-06 02:15:04,415 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-02-06 02:15:04,415 INFO L471 AbstractCegarLoop]: Abstraction has 1681 states and 2565 transitions. [2025-02-06 02:15:04,415 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 6 states have (on average 15.166666666666666) internal successors, (91), 6 states have internal predecessors, (91), 1 states have call successors, (49), 1 states have call predecessors, (49), 1 states have return successors, (49), 1 states have call predecessors, (49), 1 states have call successors, (49) [2025-02-06 02:15:04,415 INFO L276 IsEmpty]: Start isEmpty. Operand 1681 states and 2565 transitions. [2025-02-06 02:15:04,417 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 334 [2025-02-06 02:15:04,417 INFO L210 NwaCegarLoop]: Found error trace [2025-02-06 02:15:04,418 INFO L218 NwaCegarLoop]: trace histogram [49, 49, 49, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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-06 02:15:04,418 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable8 [2025-02-06 02:15:04,418 INFO L396 AbstractCegarLoop]: === Iteration 10 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-02-06 02:15:04,419 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-02-06 02:15:04,419 INFO L85 PathProgramCache]: Analyzing trace with hash -603758950, now seen corresponding path program 1 times [2025-02-06 02:15:04,419 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-02-06 02:15:04,419 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [646193648] [2025-02-06 02:15:04,419 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-02-06 02:15:04,419 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-02-06 02:15:04,438 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 333 statements into 1 equivalence classes. [2025-02-06 02:15:04,452 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 333 of 333 statements. [2025-02-06 02:15:04,453 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-02-06 02:15:04,453 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-02-06 02:15:04,509 INFO L134 CoverageAnalysis]: Checked inductivity of 4704 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 4704 trivial. 0 not checked. [2025-02-06 02:15:04,509 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-02-06 02:15:04,509 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [646193648] [2025-02-06 02:15:04,509 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [646193648] provided 1 perfect and 0 imperfect interpolant sequences [2025-02-06 02:15:04,509 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-02-06 02:15:04,509 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2025-02-06 02:15:04,509 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1143116182] [2025-02-06 02:15:04,509 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-02-06 02:15:04,510 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2025-02-06 02:15:04,510 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-02-06 02:15:04,510 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2025-02-06 02:15:04,510 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-02-06 02:15:04,510 INFO L87 Difference]: Start difference. First operand 1681 states and 2565 transitions. Second operand has 3 states, 3 states have (on average 30.333333333333332) internal successors, (91), 3 states have internal predecessors, (91), 1 states have call successors, (49), 1 states have call predecessors, (49), 1 states have return successors, (49), 1 states have call predecessors, (49), 1 states have call successors, (49) [2025-02-06 02:15:04,628 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-02-06 02:15:04,629 INFO L93 Difference]: Finished difference Result 4169 states and 6358 transitions. [2025-02-06 02:15:04,629 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2025-02-06 02:15:04,629 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 30.333333333333332) internal successors, (91), 3 states have internal predecessors, (91), 1 states have call successors, (49), 1 states have call predecessors, (49), 1 states have return successors, (49), 1 states have call predecessors, (49), 1 states have call successors, (49) Word has length 333 [2025-02-06 02:15:04,630 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-02-06 02:15:04,641 INFO L225 Difference]: With dead ends: 4169 [2025-02-06 02:15:04,641 INFO L226 Difference]: Without dead ends: 2612 [2025-02-06 02:15:04,644 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-06 02:15:04,645 INFO L435 NwaCegarLoop]: 311 mSDtfsCounter, 120 mSDsluCounter, 253 mSDsCounter, 0 mSdLazyCounter, 44 mSolverCounterSat, 10 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 120 SdHoareTripleChecker+Valid, 564 SdHoareTripleChecker+Invalid, 54 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 10 IncrementalHoareTripleChecker+Valid, 44 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2025-02-06 02:15:04,646 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [120 Valid, 564 Invalid, 54 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [10 Valid, 44 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2025-02-06 02:15:04,647 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 2612 states. [2025-02-06 02:15:04,734 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 2612 to 2533. [2025-02-06 02:15:04,738 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 2533 states, 2217 states have (on average 1.4682002706359947) internal successors, (3255), 2224 states have internal predecessors, (3255), 291 states have call successors, (291), 24 states have call predecessors, (291), 24 states have return successors, (291), 284 states have call predecessors, (291), 291 states have call successors, (291) [2025-02-06 02:15:04,744 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 2533 states to 2533 states and 3837 transitions. [2025-02-06 02:15:04,747 INFO L78 Accepts]: Start accepts. Automaton has 2533 states and 3837 transitions. Word has length 333 [2025-02-06 02:15:04,747 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-02-06 02:15:04,747 INFO L471 AbstractCegarLoop]: Abstraction has 2533 states and 3837 transitions. [2025-02-06 02:15:04,748 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 30.333333333333332) internal successors, (91), 3 states have internal predecessors, (91), 1 states have call successors, (49), 1 states have call predecessors, (49), 1 states have return successors, (49), 1 states have call predecessors, (49), 1 states have call successors, (49) [2025-02-06 02:15:04,748 INFO L276 IsEmpty]: Start isEmpty. Operand 2533 states and 3837 transitions. [2025-02-06 02:15:04,751 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 334 [2025-02-06 02:15:04,751 INFO L210 NwaCegarLoop]: Found error trace [2025-02-06 02:15:04,752 INFO L218 NwaCegarLoop]: trace histogram [49, 49, 49, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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-06 02:15:04,752 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable9 [2025-02-06 02:15:04,752 INFO L396 AbstractCegarLoop]: === Iteration 11 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-02-06 02:15:04,753 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-02-06 02:15:04,753 INFO L85 PathProgramCache]: Analyzing trace with hash 1121721947, now seen corresponding path program 1 times [2025-02-06 02:15:04,753 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-02-06 02:15:04,753 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1782460952] [2025-02-06 02:15:04,753 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-02-06 02:15:04,753 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-02-06 02:15:04,771 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 333 statements into 1 equivalence classes. [2025-02-06 02:15:04,785 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 333 of 333 statements. [2025-02-06 02:15:04,785 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-02-06 02:15:04,785 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-02-06 02:15:04,844 INFO L134 CoverageAnalysis]: Checked inductivity of 4704 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 4704 trivial. 0 not checked. [2025-02-06 02:15:04,844 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-02-06 02:15:04,844 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1782460952] [2025-02-06 02:15:04,844 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1782460952] provided 1 perfect and 0 imperfect interpolant sequences [2025-02-06 02:15:04,844 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-02-06 02:15:04,844 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2025-02-06 02:15:04,844 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1283368280] [2025-02-06 02:15:04,844 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-02-06 02:15:04,844 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2025-02-06 02:15:04,844 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-02-06 02:15:04,845 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2025-02-06 02:15:04,845 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-02-06 02:15:04,845 INFO L87 Difference]: Start difference. First operand 2533 states and 3837 transitions. Second operand has 3 states, 3 states have (on average 30.333333333333332) internal successors, (91), 3 states have internal predecessors, (91), 1 states have call successors, (49), 1 states have call predecessors, (49), 1 states have return successors, (49), 1 states have call predecessors, (49), 1 states have call successors, (49) [2025-02-06 02:15:04,980 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-02-06 02:15:04,980 INFO L93 Difference]: Finished difference Result 4882 states and 7393 transitions. [2025-02-06 02:15:04,980 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2025-02-06 02:15:04,981 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 30.333333333333332) internal successors, (91), 3 states have internal predecessors, (91), 1 states have call successors, (49), 1 states have call predecessors, (49), 1 states have return successors, (49), 1 states have call predecessors, (49), 1 states have call successors, (49) Word has length 333 [2025-02-06 02:15:04,981 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-02-06 02:15:04,991 INFO L225 Difference]: With dead ends: 4882 [2025-02-06 02:15:04,992 INFO L226 Difference]: Without dead ends: 2732 [2025-02-06 02:15:04,996 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-06 02:15:04,997 INFO L435 NwaCegarLoop]: 346 mSDtfsCounter, 99 mSDsluCounter, 258 mSDsCounter, 0 mSdLazyCounter, 44 mSolverCounterSat, 7 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 99 SdHoareTripleChecker+Valid, 604 SdHoareTripleChecker+Invalid, 51 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 7 IncrementalHoareTripleChecker+Valid, 44 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2025-02-06 02:15:04,997 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [99 Valid, 604 Invalid, 51 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [7 Valid, 44 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2025-02-06 02:15:04,999 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 2732 states. [2025-02-06 02:15:05,093 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 2732 to 2653. [2025-02-06 02:15:05,097 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 2653 states, 2337 states have (on average 1.4565682498930252) internal successors, (3404), 2344 states have internal predecessors, (3404), 291 states have call successors, (291), 24 states have call predecessors, (291), 24 states have return successors, (291), 284 states have call predecessors, (291), 291 states have call successors, (291) [2025-02-06 02:15:05,104 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 2653 states to 2653 states and 3986 transitions. [2025-02-06 02:15:05,106 INFO L78 Accepts]: Start accepts. Automaton has 2653 states and 3986 transitions. Word has length 333 [2025-02-06 02:15:05,107 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-02-06 02:15:05,107 INFO L471 AbstractCegarLoop]: Abstraction has 2653 states and 3986 transitions. [2025-02-06 02:15:05,108 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 30.333333333333332) internal successors, (91), 3 states have internal predecessors, (91), 1 states have call successors, (49), 1 states have call predecessors, (49), 1 states have return successors, (49), 1 states have call predecessors, (49), 1 states have call successors, (49) [2025-02-06 02:15:05,108 INFO L276 IsEmpty]: Start isEmpty. Operand 2653 states and 3986 transitions. [2025-02-06 02:15:05,111 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 334 [2025-02-06 02:15:05,111 INFO L210 NwaCegarLoop]: Found error trace [2025-02-06 02:15:05,112 INFO L218 NwaCegarLoop]: trace histogram [49, 49, 49, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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-06 02:15:05,112 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable10 [2025-02-06 02:15:05,112 INFO L396 AbstractCegarLoop]: === Iteration 12 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-02-06 02:15:05,112 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-02-06 02:15:05,113 INFO L85 PathProgramCache]: Analyzing trace with hash 1557047041, now seen corresponding path program 1 times [2025-02-06 02:15:05,113 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-02-06 02:15:05,113 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1175550633] [2025-02-06 02:15:05,113 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-02-06 02:15:05,113 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-02-06 02:15:05,131 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 333 statements into 1 equivalence classes. [2025-02-06 02:15:05,150 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 333 of 333 statements. [2025-02-06 02:15:05,150 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-02-06 02:15:05,150 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-02-06 02:15:05,252 INFO L134 CoverageAnalysis]: Checked inductivity of 4704 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 4704 trivial. 0 not checked. [2025-02-06 02:15:05,252 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-02-06 02:15:05,252 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1175550633] [2025-02-06 02:15:05,252 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1175550633] provided 1 perfect and 0 imperfect interpolant sequences [2025-02-06 02:15:05,252 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-02-06 02:15:05,252 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2025-02-06 02:15:05,252 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [908851846] [2025-02-06 02:15:05,253 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-02-06 02:15:05,253 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2025-02-06 02:15:05,253 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-02-06 02:15:05,253 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2025-02-06 02:15:05,253 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2025-02-06 02:15:05,254 INFO L87 Difference]: Start difference. First operand 2653 states and 3986 transitions. Second operand has 4 states, 4 states have (on average 22.75) internal successors, (91), 4 states have internal predecessors, (91), 1 states have call successors, (49), 1 states have call predecessors, (49), 1 states have return successors, (49), 1 states have call predecessors, (49), 1 states have call successors, (49) [2025-02-06 02:15:05,419 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-02-06 02:15:05,420 INFO L93 Difference]: Finished difference Result 4878 states and 7314 transitions. [2025-02-06 02:15:05,420 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2025-02-06 02:15:05,420 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 4 states have (on average 22.75) internal successors, (91), 4 states have internal predecessors, (91), 1 states have call successors, (49), 1 states have call predecessors, (49), 1 states have return successors, (49), 1 states have call predecessors, (49), 1 states have call successors, (49) Word has length 333 [2025-02-06 02:15:05,421 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-02-06 02:15:05,432 INFO L225 Difference]: With dead ends: 4878 [2025-02-06 02:15:05,432 INFO L226 Difference]: Without dead ends: 2714 [2025-02-06 02:15:05,436 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-06 02:15:05,438 INFO L435 NwaCegarLoop]: 375 mSDtfsCounter, 112 mSDsluCounter, 622 mSDsCounter, 0 mSdLazyCounter, 83 mSolverCounterSat, 2 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 112 SdHoareTripleChecker+Valid, 997 SdHoareTripleChecker+Invalid, 85 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 2 IncrementalHoareTripleChecker+Valid, 83 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2025-02-06 02:15:05,438 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [112 Valid, 997 Invalid, 85 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [2 Valid, 83 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2025-02-06 02:15:05,440 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 2714 states. [2025-02-06 02:15:05,532 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 2714 to 2635. [2025-02-06 02:15:05,536 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 2635 states, 2319 states have (on average 1.4523501509271237) internal successors, (3368), 2326 states have internal predecessors, (3368), 291 states have call successors, (291), 24 states have call predecessors, (291), 24 states have return successors, (291), 284 states have call predecessors, (291), 291 states have call successors, (291) [2025-02-06 02:15:05,544 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 2635 states to 2635 states and 3950 transitions. [2025-02-06 02:15:05,547 INFO L78 Accepts]: Start accepts. Automaton has 2635 states and 3950 transitions. Word has length 333 [2025-02-06 02:15:05,547 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-02-06 02:15:05,547 INFO L471 AbstractCegarLoop]: Abstraction has 2635 states and 3950 transitions. [2025-02-06 02:15:05,548 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 22.75) internal successors, (91), 4 states have internal predecessors, (91), 1 states have call successors, (49), 1 states have call predecessors, (49), 1 states have return successors, (49), 1 states have call predecessors, (49), 1 states have call successors, (49) [2025-02-06 02:15:05,548 INFO L276 IsEmpty]: Start isEmpty. Operand 2635 states and 3950 transitions. [2025-02-06 02:15:05,550 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 335 [2025-02-06 02:15:05,551 INFO L210 NwaCegarLoop]: Found error trace [2025-02-06 02:15:05,551 INFO L218 NwaCegarLoop]: trace histogram [49, 49, 49, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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-06 02:15:05,551 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable11 [2025-02-06 02:15:05,551 INFO L396 AbstractCegarLoop]: === Iteration 13 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-02-06 02:15:05,552 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-02-06 02:15:05,552 INFO L85 PathProgramCache]: Analyzing trace with hash -1984232671, now seen corresponding path program 1 times [2025-02-06 02:15:05,552 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-02-06 02:15:05,552 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1574581856] [2025-02-06 02:15:05,553 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-02-06 02:15:05,554 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-02-06 02:15:05,580 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 334 statements into 1 equivalence classes. [2025-02-06 02:15:05,810 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 334 of 334 statements. [2025-02-06 02:15:05,810 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-02-06 02:15:05,810 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-02-06 02:15:06,893 INFO L134 CoverageAnalysis]: Checked inductivity of 4704 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 4704 trivial. 0 not checked. [2025-02-06 02:15:06,893 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-02-06 02:15:06,893 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1574581856] [2025-02-06 02:15:06,893 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1574581856] provided 1 perfect and 0 imperfect interpolant sequences [2025-02-06 02:15:06,893 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-02-06 02:15:06,893 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [8] imperfect sequences [] total 8 [2025-02-06 02:15:06,893 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [410736333] [2025-02-06 02:15:06,894 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-02-06 02:15:06,894 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 8 states [2025-02-06 02:15:06,894 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-02-06 02:15:06,895 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2025-02-06 02:15:06,895 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=17, Invalid=39, Unknown=0, NotChecked=0, Total=56 [2025-02-06 02:15:06,895 INFO L87 Difference]: Start difference. First operand 2635 states and 3950 transitions. Second operand has 8 states, 8 states have (on average 11.5) internal successors, (92), 8 states have internal predecessors, (92), 1 states have call successors, (49), 1 states have call predecessors, (49), 1 states have return successors, (49), 1 states have call predecessors, (49), 1 states have call successors, (49) [2025-02-06 02:15:08,331 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-02-06 02:15:08,331 INFO L93 Difference]: Finished difference Result 6797 states and 10192 transitions. [2025-02-06 02:15:08,331 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2025-02-06 02:15:08,332 INFO L78 Accepts]: Start accepts. Automaton has has 8 states, 8 states have (on average 11.5) internal successors, (92), 8 states have internal predecessors, (92), 1 states have call successors, (49), 1 states have call predecessors, (49), 1 states have return successors, (49), 1 states have call predecessors, (49), 1 states have call successors, (49) Word has length 334 [2025-02-06 02:15:08,332 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-02-06 02:15:08,354 INFO L225 Difference]: With dead ends: 6797 [2025-02-06 02:15:08,355 INFO L226 Difference]: Without dead ends: 5782 [2025-02-06 02:15:08,360 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 16 GetRequests, 7 SyntacticMatches, 0 SemanticMatches, 9 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 8 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=41, Invalid=69, Unknown=0, NotChecked=0, Total=110 [2025-02-06 02:15:08,361 INFO L435 NwaCegarLoop]: 408 mSDtfsCounter, 775 mSDsluCounter, 1013 mSDsCounter, 0 mSdLazyCounter, 1000 mSolverCounterSat, 39 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.9s Time, 0 mProtectedPredicate, 0 mProtectedAction, 775 SdHoareTripleChecker+Valid, 1421 SdHoareTripleChecker+Invalid, 1039 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 39 IncrementalHoareTripleChecker+Valid, 1000 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 1.1s IncrementalHoareTripleChecker+Time [2025-02-06 02:15:08,361 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [775 Valid, 1421 Invalid, 1039 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [39 Valid, 1000 Invalid, 0 Unknown, 0 Unchecked, 1.1s Time] [2025-02-06 02:15:08,365 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 5782 states. [2025-02-06 02:15:08,583 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 5782 to 5026. [2025-02-06 02:15:08,596 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 5026 states, 4446 states have (on average 1.4507422402159245) internal successors, (6450), 4460 states have internal predecessors, (6450), 533 states have call successors, (533), 46 states have call predecessors, (533), 46 states have return successors, (533), 519 states have call predecessors, (533), 533 states have call successors, (533) [2025-02-06 02:15:08,609 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5026 states to 5026 states and 7516 transitions. [2025-02-06 02:15:08,612 INFO L78 Accepts]: Start accepts. Automaton has 5026 states and 7516 transitions. Word has length 334 [2025-02-06 02:15:08,613 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-02-06 02:15:08,613 INFO L471 AbstractCegarLoop]: Abstraction has 5026 states and 7516 transitions. [2025-02-06 02:15:08,613 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 8 states, 8 states have (on average 11.5) internal successors, (92), 8 states have internal predecessors, (92), 1 states have call successors, (49), 1 states have call predecessors, (49), 1 states have return successors, (49), 1 states have call predecessors, (49), 1 states have call successors, (49) [2025-02-06 02:15:08,613 INFO L276 IsEmpty]: Start isEmpty. Operand 5026 states and 7516 transitions. [2025-02-06 02:15:08,617 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 335 [2025-02-06 02:15:08,617 INFO L210 NwaCegarLoop]: Found error trace [2025-02-06 02:15:08,617 INFO L218 NwaCegarLoop]: trace histogram [49, 49, 49, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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-06 02:15:08,617 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable12 [2025-02-06 02:15:08,617 INFO L396 AbstractCegarLoop]: === Iteration 14 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-02-06 02:15:08,618 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-02-06 02:15:08,618 INFO L85 PathProgramCache]: Analyzing trace with hash 1800200448, now seen corresponding path program 1 times [2025-02-06 02:15:08,618 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-02-06 02:15:08,618 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [424693767] [2025-02-06 02:15:08,618 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-02-06 02:15:08,618 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-02-06 02:15:08,634 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 334 statements into 1 equivalence classes. [2025-02-06 02:15:09,471 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 334 of 334 statements. [2025-02-06 02:15:09,472 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-02-06 02:15:09,472 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-02-06 02:15:14,773 INFO L134 CoverageAnalysis]: Checked inductivity of 4704 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 4704 trivial. 0 not checked. [2025-02-06 02:15:14,773 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-02-06 02:15:14,773 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [424693767] [2025-02-06 02:15:14,773 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [424693767] provided 1 perfect and 0 imperfect interpolant sequences [2025-02-06 02:15:14,773 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-02-06 02:15:14,773 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [14] imperfect sequences [] total 14 [2025-02-06 02:15:14,773 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [8537576] [2025-02-06 02:15:14,774 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-02-06 02:15:14,774 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 14 states [2025-02-06 02:15:14,774 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-02-06 02:15:14,774 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 14 interpolants. [2025-02-06 02:15:14,775 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=31, Invalid=151, Unknown=0, NotChecked=0, Total=182 [2025-02-06 02:15:14,775 INFO L87 Difference]: Start difference. First operand 5026 states and 7516 transitions. Second operand has 14 states, 14 states have (on average 6.571428571428571) internal successors, (92), 14 states have internal predecessors, (92), 4 states have call successors, (49), 1 states have call predecessors, (49), 1 states have return successors, (49), 4 states have call predecessors, (49), 4 states have call successors, (49) [2025-02-06 02:15:19,396 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-02-06 02:15:19,396 INFO L93 Difference]: Finished difference Result 8923 states and 13413 transitions. [2025-02-06 02:15:19,397 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 11 states. [2025-02-06 02:15:19,397 INFO L78 Accepts]: Start accepts. Automaton has has 14 states, 14 states have (on average 6.571428571428571) internal successors, (92), 14 states have internal predecessors, (92), 4 states have call successors, (49), 1 states have call predecessors, (49), 1 states have return successors, (49), 4 states have call predecessors, (49), 4 states have call successors, (49) Word has length 334 [2025-02-06 02:15:19,398 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-02-06 02:15:19,423 INFO L225 Difference]: With dead ends: 8923 [2025-02-06 02:15:19,423 INFO L226 Difference]: Without dead ends: 7726 [2025-02-06 02:15:19,427 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 25 GetRequests, 5 SyntacticMatches, 0 SemanticMatches, 20 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 37 ImplicationChecksByTransitivity, 2.1s TimeCoverageRelationStatistics Valid=117, Invalid=345, Unknown=0, NotChecked=0, Total=462 [2025-02-06 02:15:19,428 INFO L435 NwaCegarLoop]: 309 mSDtfsCounter, 2106 mSDsluCounter, 1878 mSDsCounter, 0 mSdLazyCounter, 1644 mSolverCounterSat, 285 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 2.8s Time, 0 mProtectedPredicate, 0 mProtectedAction, 2106 SdHoareTripleChecker+Valid, 2187 SdHoareTripleChecker+Invalid, 1929 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 285 IncrementalHoareTripleChecker+Valid, 1644 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 3.1s IncrementalHoareTripleChecker+Time [2025-02-06 02:15:19,428 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [2106 Valid, 2187 Invalid, 1929 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [285 Valid, 1644 Invalid, 0 Unknown, 0 Unchecked, 3.1s Time] [2025-02-06 02:15:19,433 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 7726 states. [2025-02-06 02:15:19,654 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 7726 to 5365. [2025-02-06 02:15:19,659 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 5365 states, 4785 states have (on average 1.4549634273772205) internal successors, (6962), 4799 states have internal predecessors, (6962), 533 states have call successors, (533), 46 states have call predecessors, (533), 46 states have return successors, (533), 519 states have call predecessors, (533), 533 states have call successors, (533) [2025-02-06 02:15:19,669 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5365 states to 5365 states and 8028 transitions. [2025-02-06 02:15:19,672 INFO L78 Accepts]: Start accepts. Automaton has 5365 states and 8028 transitions. Word has length 334 [2025-02-06 02:15:19,672 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-02-06 02:15:19,672 INFO L471 AbstractCegarLoop]: Abstraction has 5365 states and 8028 transitions. [2025-02-06 02:15:19,673 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 14 states, 14 states have (on average 6.571428571428571) internal successors, (92), 14 states have internal predecessors, (92), 4 states have call successors, (49), 1 states have call predecessors, (49), 1 states have return successors, (49), 4 states have call predecessors, (49), 4 states have call successors, (49) [2025-02-06 02:15:19,673 INFO L276 IsEmpty]: Start isEmpty. Operand 5365 states and 8028 transitions. [2025-02-06 02:15:19,677 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 335 [2025-02-06 02:15:19,677 INFO L210 NwaCegarLoop]: Found error trace [2025-02-06 02:15:19,677 INFO L218 NwaCegarLoop]: trace histogram [49, 49, 49, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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-06 02:15:19,677 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable13 [2025-02-06 02:15:19,678 INFO L396 AbstractCegarLoop]: === Iteration 15 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-02-06 02:15:19,678 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-02-06 02:15:19,678 INFO L85 PathProgramCache]: Analyzing trace with hash -545744540, now seen corresponding path program 1 times [2025-02-06 02:15:19,678 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-02-06 02:15:19,678 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [225031024] [2025-02-06 02:15:19,678 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-02-06 02:15:19,679 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-02-06 02:15:19,697 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 334 statements into 1 equivalence classes. [2025-02-06 02:15:19,987 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 334 of 334 statements. [2025-02-06 02:15:19,988 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-02-06 02:15:19,988 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-02-06 02:15:24,604 INFO L134 CoverageAnalysis]: Checked inductivity of 4704 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 4704 trivial. 0 not checked. [2025-02-06 02:15:24,604 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-02-06 02:15:24,604 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [225031024] [2025-02-06 02:15:24,605 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [225031024] provided 1 perfect and 0 imperfect interpolant sequences [2025-02-06 02:15:24,605 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-02-06 02:15:24,605 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [12] imperfect sequences [] total 12 [2025-02-06 02:15:24,605 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2140392247] [2025-02-06 02:15:24,605 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-02-06 02:15:24,605 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 12 states [2025-02-06 02:15:24,605 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-02-06 02:15:24,606 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 12 interpolants. [2025-02-06 02:15:24,606 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=23, Invalid=109, Unknown=0, NotChecked=0, Total=132 [2025-02-06 02:15:24,606 INFO L87 Difference]: Start difference. First operand 5365 states and 8028 transitions. Second operand has 12 states, 12 states have (on average 7.666666666666667) internal successors, (92), 12 states have internal predecessors, (92), 2 states have call successors, (49), 1 states have call predecessors, (49), 1 states have return successors, (49), 2 states have call predecessors, (49), 2 states have call successors, (49) [2025-02-06 02:15:33,989 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 1.87s for a HTC check with result INVALID. Formula has sorts [Bool, Int], hasArrays=false, hasNonlinArith=true, quantifiers [] [2025-02-06 02:15:40,514 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-02-06 02:15:40,514 INFO L93 Difference]: Finished difference Result 18676 states and 27406 transitions. [2025-02-06 02:15:40,515 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 22 states. [2025-02-06 02:15:40,515 INFO L78 Accepts]: Start accepts. Automaton has has 12 states, 12 states have (on average 7.666666666666667) internal successors, (92), 12 states have internal predecessors, (92), 2 states have call successors, (49), 1 states have call predecessors, (49), 1 states have return successors, (49), 2 states have call predecessors, (49), 2 states have call successors, (49) Word has length 334 [2025-02-06 02:15:40,516 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-02-06 02:15:40,553 INFO L225 Difference]: With dead ends: 18676 [2025-02-06 02:15:40,553 INFO L226 Difference]: Without dead ends: 15453 [2025-02-06 02:15:40,563 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 47 GetRequests, 19 SyntacticMatches, 0 SemanticMatches, 28 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 164 ImplicationChecksByTransitivity, 5.4s TimeCoverageRelationStatistics Valid=231, Invalid=639, Unknown=0, NotChecked=0, Total=870 [2025-02-06 02:15:40,563 INFO L435 NwaCegarLoop]: 592 mSDtfsCounter, 1755 mSDsluCounter, 2893 mSDsCounter, 0 mSdLazyCounter, 2302 mSolverCounterSat, 342 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 10.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 1755 SdHoareTripleChecker+Valid, 3485 SdHoareTripleChecker+Invalid, 2644 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 342 IncrementalHoareTripleChecker+Valid, 2302 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 10.4s IncrementalHoareTripleChecker+Time [2025-02-06 02:15:40,564 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [1755 Valid, 3485 Invalid, 2644 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [342 Valid, 2302 Invalid, 0 Unknown, 0 Unchecked, 10.4s Time] [2025-02-06 02:15:40,574 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 15453 states. [2025-02-06 02:15:41,024 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 15453 to 10499. [2025-02-06 02:15:41,035 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 10499 states, 9627 states have (on average 1.4568401371143658) internal successors, (14025), 9662 states have internal predecessors, (14025), 776 states have call successors, (776), 95 states have call predecessors, (776), 95 states have return successors, (776), 741 states have call predecessors, (776), 776 states have call successors, (776) [2025-02-06 02:15:41,051 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 10499 states to 10499 states and 15577 transitions. [2025-02-06 02:15:41,055 INFO L78 Accepts]: Start accepts. Automaton has 10499 states and 15577 transitions. Word has length 334 [2025-02-06 02:15:41,055 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-02-06 02:15:41,055 INFO L471 AbstractCegarLoop]: Abstraction has 10499 states and 15577 transitions. [2025-02-06 02:15:41,055 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 12 states, 12 states have (on average 7.666666666666667) internal successors, (92), 12 states have internal predecessors, (92), 2 states have call successors, (49), 1 states have call predecessors, (49), 1 states have return successors, (49), 2 states have call predecessors, (49), 2 states have call successors, (49) [2025-02-06 02:15:41,055 INFO L276 IsEmpty]: Start isEmpty. Operand 10499 states and 15577 transitions. [2025-02-06 02:15:41,063 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 335 [2025-02-06 02:15:41,064 INFO L210 NwaCegarLoop]: Found error trace [2025-02-06 02:15:41,064 INFO L218 NwaCegarLoop]: trace histogram [49, 49, 49, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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-06 02:15:41,064 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable14 [2025-02-06 02:15:41,064 INFO L396 AbstractCegarLoop]: === Iteration 16 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-02-06 02:15:41,065 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-02-06 02:15:41,065 INFO L85 PathProgramCache]: Analyzing trace with hash -351428672, now seen corresponding path program 1 times [2025-02-06 02:15:41,065 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-02-06 02:15:41,065 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1778035270] [2025-02-06 02:15:41,065 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-02-06 02:15:41,066 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-02-06 02:15:41,084 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 334 statements into 1 equivalence classes. [2025-02-06 02:15:41,233 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 334 of 334 statements. [2025-02-06 02:15:41,233 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-02-06 02:15:41,233 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-02-06 02:15:41,664 INFO L134 CoverageAnalysis]: Checked inductivity of 4704 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 4704 trivial. 0 not checked. [2025-02-06 02:15:41,664 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-02-06 02:15:41,664 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1778035270] [2025-02-06 02:15:41,664 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1778035270] provided 1 perfect and 0 imperfect interpolant sequences [2025-02-06 02:15:41,664 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-02-06 02:15:41,665 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2025-02-06 02:15:41,665 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1831180542] [2025-02-06 02:15:41,665 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-02-06 02:15:41,665 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 7 states [2025-02-06 02:15:41,665 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-02-06 02:15:41,666 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2025-02-06 02:15:41,666 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=12, Invalid=30, Unknown=0, NotChecked=0, Total=42 [2025-02-06 02:15:41,666 INFO L87 Difference]: Start difference. First operand 10499 states and 15577 transitions. Second operand has 7 states, 7 states have (on average 13.142857142857142) internal successors, (92), 7 states have internal predecessors, (92), 2 states have call successors, (49), 1 states have call predecessors, (49), 1 states have return successors, (49), 2 states have call predecessors, (49), 2 states have call successors, (49) [2025-02-06 02:15:42,298 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-02-06 02:15:42,299 INFO L93 Difference]: Finished difference Result 17124 states and 25569 transitions. [2025-02-06 02:15:42,300 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2025-02-06 02:15:42,300 INFO L78 Accepts]: Start accepts. Automaton has has 7 states, 7 states have (on average 13.142857142857142) internal successors, (92), 7 states have internal predecessors, (92), 2 states have call successors, (49), 1 states have call predecessors, (49), 1 states have return successors, (49), 2 states have call predecessors, (49), 2 states have call successors, (49) Word has length 334 [2025-02-06 02:15:42,300 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-02-06 02:15:42,323 INFO L225 Difference]: With dead ends: 17124 [2025-02-06 02:15:42,323 INFO L226 Difference]: Without dead ends: 10524 [2025-02-06 02:15:42,335 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 12 GetRequests, 4 SyntacticMatches, 0 SemanticMatches, 8 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 3 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=33, Invalid=57, Unknown=0, NotChecked=0, Total=90 [2025-02-06 02:15:42,335 INFO L435 NwaCegarLoop]: 338 mSDtfsCounter, 669 mSDsluCounter, 1140 mSDsCounter, 0 mSdLazyCounter, 348 mSolverCounterSat, 61 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 669 SdHoareTripleChecker+Valid, 1478 SdHoareTripleChecker+Invalid, 409 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 61 IncrementalHoareTripleChecker+Valid, 348 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.3s IncrementalHoareTripleChecker+Time [2025-02-06 02:15:42,335 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [669 Valid, 1478 Invalid, 409 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [61 Valid, 348 Invalid, 0 Unknown, 0 Unchecked, 0.3s Time] [2025-02-06 02:15:42,342 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 10524 states. [2025-02-06 02:15:42,818 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 10524 to 10513. [2025-02-06 02:15:42,834 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 10513 states, 9641 states have (on average 1.456176745150918) internal successors, (14039), 9676 states have internal predecessors, (14039), 776 states have call successors, (776), 95 states have call predecessors, (776), 95 states have return successors, (776), 741 states have call predecessors, (776), 776 states have call successors, (776) [2025-02-06 02:15:42,850 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 10513 states to 10513 states and 15591 transitions. [2025-02-06 02:15:42,854 INFO L78 Accepts]: Start accepts. Automaton has 10513 states and 15591 transitions. Word has length 334 [2025-02-06 02:15:42,855 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-02-06 02:15:42,855 INFO L471 AbstractCegarLoop]: Abstraction has 10513 states and 15591 transitions. [2025-02-06 02:15:42,855 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 7 states, 7 states have (on average 13.142857142857142) internal successors, (92), 7 states have internal predecessors, (92), 2 states have call successors, (49), 1 states have call predecessors, (49), 1 states have return successors, (49), 2 states have call predecessors, (49), 2 states have call successors, (49) [2025-02-06 02:15:42,855 INFO L276 IsEmpty]: Start isEmpty. Operand 10513 states and 15591 transitions. [2025-02-06 02:15:42,864 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 335 [2025-02-06 02:15:42,864 INFO L210 NwaCegarLoop]: Found error trace [2025-02-06 02:15:42,864 INFO L218 NwaCegarLoop]: trace histogram [49, 49, 49, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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-06 02:15:42,864 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable15 [2025-02-06 02:15:42,864 INFO L396 AbstractCegarLoop]: === Iteration 17 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-02-06 02:15:42,865 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-02-06 02:15:42,865 INFO L85 PathProgramCache]: Analyzing trace with hash -861962849, now seen corresponding path program 1 times [2025-02-06 02:15:42,865 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-02-06 02:15:42,865 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2018247275] [2025-02-06 02:15:42,865 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-02-06 02:15:42,865 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-02-06 02:15:42,881 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 334 statements into 1 equivalence classes. [2025-02-06 02:15:43,336 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 334 of 334 statements. [2025-02-06 02:15:43,336 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-02-06 02:15:43,336 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-02-06 02:15:46,072 INFO L134 CoverageAnalysis]: Checked inductivity of 4704 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 4704 trivial. 0 not checked. [2025-02-06 02:15:46,072 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-02-06 02:15:46,072 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2018247275] [2025-02-06 02:15:46,072 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [2018247275] provided 1 perfect and 0 imperfect interpolant sequences [2025-02-06 02:15:46,072 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-02-06 02:15:46,073 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [13] imperfect sequences [] total 13 [2025-02-06 02:15:46,073 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [618132691] [2025-02-06 02:15:46,073 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-02-06 02:15:46,073 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 13 states [2025-02-06 02:15:46,073 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-02-06 02:15:46,073 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 13 interpolants. [2025-02-06 02:15:46,073 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=37, Invalid=119, Unknown=0, NotChecked=0, Total=156 [2025-02-06 02:15:46,074 INFO L87 Difference]: Start difference. First operand 10513 states and 15591 transitions. Second operand has 13 states, 13 states have (on average 7.076923076923077) internal successors, (92), 13 states have internal predecessors, (92), 1 states have call successors, (49), 1 states have call predecessors, (49), 1 states have return successors, (49), 1 states have call predecessors, (49), 1 states have call successors, (49) [2025-02-06 02:15:50,910 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-02-06 02:15:50,910 INFO L93 Difference]: Finished difference Result 30007 states and 44547 transitions. [2025-02-06 02:15:50,911 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 22 states. [2025-02-06 02:15:50,911 INFO L78 Accepts]: Start accepts. Automaton has has 13 states, 13 states have (on average 7.076923076923077) internal successors, (92), 13 states have internal predecessors, (92), 1 states have call successors, (49), 1 states have call predecessors, (49), 1 states have return successors, (49), 1 states have call predecessors, (49), 1 states have call successors, (49) Word has length 334 [2025-02-06 02:15:50,912 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-02-06 02:15:50,951 INFO L225 Difference]: With dead ends: 30007 [2025-02-06 02:15:50,951 INFO L226 Difference]: Without dead ends: 22182 [2025-02-06 02:15:50,972 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 29 GetRequests, 4 SyntacticMatches, 0 SemanticMatches, 25 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 122 ImplicationChecksByTransitivity, 1.1s TimeCoverageRelationStatistics Valid=160, Invalid=542, Unknown=0, NotChecked=0, Total=702 [2025-02-06 02:15:50,973 INFO L435 NwaCegarLoop]: 357 mSDtfsCounter, 1884 mSDsluCounter, 2197 mSDsCounter, 0 mSdLazyCounter, 1835 mSolverCounterSat, 151 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 3.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 1884 SdHoareTripleChecker+Valid, 2554 SdHoareTripleChecker+Invalid, 1986 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 151 IncrementalHoareTripleChecker+Valid, 1835 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 3.6s IncrementalHoareTripleChecker+Time [2025-02-06 02:15:50,973 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [1884 Valid, 2554 Invalid, 1986 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [151 Valid, 1835 Invalid, 0 Unknown, 0 Unchecked, 3.6s Time] [2025-02-06 02:15:50,990 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 22182 states. [2025-02-06 02:15:51,576 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 22182 to 11948. [2025-02-06 02:15:51,589 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 11948 states, 11076 states have (on average 1.4687612856626941) internal successors, (16268), 11111 states have internal predecessors, (16268), 776 states have call successors, (776), 95 states have call predecessors, (776), 95 states have return successors, (776), 741 states have call predecessors, (776), 776 states have call successors, (776) [2025-02-06 02:15:51,605 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 11948 states to 11948 states and 17820 transitions. [2025-02-06 02:15:51,610 INFO L78 Accepts]: Start accepts. Automaton has 11948 states and 17820 transitions. Word has length 334 [2025-02-06 02:15:51,611 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-02-06 02:15:51,611 INFO L471 AbstractCegarLoop]: Abstraction has 11948 states and 17820 transitions. [2025-02-06 02:15:51,611 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 13 states, 13 states have (on average 7.076923076923077) internal successors, (92), 13 states have internal predecessors, (92), 1 states have call successors, (49), 1 states have call predecessors, (49), 1 states have return successors, (49), 1 states have call predecessors, (49), 1 states have call successors, (49) [2025-02-06 02:15:51,611 INFO L276 IsEmpty]: Start isEmpty. Operand 11948 states and 17820 transitions. [2025-02-06 02:15:51,620 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 335 [2025-02-06 02:15:51,620 INFO L210 NwaCegarLoop]: Found error trace [2025-02-06 02:15:51,620 INFO L218 NwaCegarLoop]: trace histogram [49, 49, 49, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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-06 02:15:51,620 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable16 [2025-02-06 02:15:51,620 INFO L396 AbstractCegarLoop]: === Iteration 18 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-02-06 02:15:51,621 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-02-06 02:15:51,621 INFO L85 PathProgramCache]: Analyzing trace with hash -740091894, now seen corresponding path program 1 times [2025-02-06 02:15:51,621 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-02-06 02:15:51,621 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [858285135] [2025-02-06 02:15:51,621 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-02-06 02:15:51,621 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-02-06 02:15:51,638 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 334 statements into 1 equivalence classes. [2025-02-06 02:15:51,913 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 334 of 334 statements. [2025-02-06 02:15:51,913 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-02-06 02:15:51,913 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-02-06 02:15:53,600 INFO L134 CoverageAnalysis]: Checked inductivity of 4704 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 4704 trivial. 0 not checked. [2025-02-06 02:15:53,601 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-02-06 02:15:53,601 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [858285135] [2025-02-06 02:15:53,601 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [858285135] provided 1 perfect and 0 imperfect interpolant sequences [2025-02-06 02:15:53,601 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-02-06 02:15:53,601 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [10] imperfect sequences [] total 10 [2025-02-06 02:15:53,601 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1698727371] [2025-02-06 02:15:53,601 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-02-06 02:15:53,601 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 10 states [2025-02-06 02:15:53,601 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-02-06 02:15:53,602 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 10 interpolants. [2025-02-06 02:15:53,602 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=19, Invalid=71, Unknown=0, NotChecked=0, Total=90 [2025-02-06 02:15:53,602 INFO L87 Difference]: Start difference. First operand 11948 states and 17820 transitions. Second operand has 10 states, 10 states have (on average 9.2) internal successors, (92), 10 states have internal predecessors, (92), 2 states have call successors, (49), 1 states have call predecessors, (49), 1 states have return successors, (49), 2 states have call predecessors, (49), 2 states have call successors, (49) [2025-02-06 02:15:56,321 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-02-06 02:15:56,322 INFO L93 Difference]: Finished difference Result 24105 states and 35801 transitions. [2025-02-06 02:15:56,322 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 15 states. [2025-02-06 02:15:56,322 INFO L78 Accepts]: Start accepts. Automaton has has 10 states, 10 states have (on average 9.2) internal successors, (92), 10 states have internal predecessors, (92), 2 states have call successors, (49), 1 states have call predecessors, (49), 1 states have return successors, (49), 2 states have call predecessors, (49), 2 states have call successors, (49) Word has length 334 [2025-02-06 02:15:56,323 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-02-06 02:15:56,354 INFO L225 Difference]: With dead ends: 24105 [2025-02-06 02:15:56,355 INFO L226 Difference]: Without dead ends: 15679 [2025-02-06 02:15:56,371 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 30 GetRequests, 11 SyntacticMatches, 0 SemanticMatches, 19 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 67 ImplicationChecksByTransitivity, 0.5s TimeCoverageRelationStatistics Valid=122, Invalid=298, Unknown=0, NotChecked=0, Total=420 [2025-02-06 02:15:56,372 INFO L435 NwaCegarLoop]: 568 mSDtfsCounter, 1371 mSDsluCounter, 2458 mSDsCounter, 0 mSdLazyCounter, 1371 mSolverCounterSat, 292 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 1.3s Time, 0 mProtectedPredicate, 0 mProtectedAction, 1371 SdHoareTripleChecker+Valid, 3026 SdHoareTripleChecker+Invalid, 1663 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 292 IncrementalHoareTripleChecker+Valid, 1371 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 1.5s IncrementalHoareTripleChecker+Time [2025-02-06 02:15:56,372 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [1371 Valid, 3026 Invalid, 1663 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [292 Valid, 1371 Invalid, 0 Unknown, 0 Unchecked, 1.5s Time] [2025-02-06 02:15:56,382 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 15679 states. [2025-02-06 02:15:56,903 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 15679 to 11532. [2025-02-06 02:15:56,914 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 11532 states, 10660 states have (on average 1.4688555347091932) internal successors, (15658), 10695 states have internal predecessors, (15658), 776 states have call successors, (776), 95 states have call predecessors, (776), 95 states have return successors, (776), 741 states have call predecessors, (776), 776 states have call successors, (776) [2025-02-06 02:15:56,931 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 11532 states to 11532 states and 17210 transitions. [2025-02-06 02:15:56,936 INFO L78 Accepts]: Start accepts. Automaton has 11532 states and 17210 transitions. Word has length 334 [2025-02-06 02:15:56,937 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-02-06 02:15:56,937 INFO L471 AbstractCegarLoop]: Abstraction has 11532 states and 17210 transitions. [2025-02-06 02:15:56,937 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 10 states, 10 states have (on average 9.2) internal successors, (92), 10 states have internal predecessors, (92), 2 states have call successors, (49), 1 states have call predecessors, (49), 1 states have return successors, (49), 2 states have call predecessors, (49), 2 states have call successors, (49) [2025-02-06 02:15:56,937 INFO L276 IsEmpty]: Start isEmpty. Operand 11532 states and 17210 transitions. [2025-02-06 02:15:56,944 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 335 [2025-02-06 02:15:56,944 INFO L210 NwaCegarLoop]: Found error trace [2025-02-06 02:15:56,945 INFO L218 NwaCegarLoop]: trace histogram [49, 49, 49, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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-06 02:15:56,945 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable17 [2025-02-06 02:15:56,945 INFO L396 AbstractCegarLoop]: === Iteration 19 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-02-06 02:15:56,945 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-02-06 02:15:56,945 INFO L85 PathProgramCache]: Analyzing trace with hash -553503899, now seen corresponding path program 1 times [2025-02-06 02:15:56,945 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-02-06 02:15:56,945 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1929612764] [2025-02-06 02:15:56,946 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-02-06 02:15:56,946 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-02-06 02:15:56,964 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 334 statements into 1 equivalence classes. [2025-02-06 02:15:57,005 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 334 of 334 statements. [2025-02-06 02:15:57,005 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-02-06 02:15:57,005 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-02-06 02:15:57,261 INFO L134 CoverageAnalysis]: Checked inductivity of 4704 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 4704 trivial. 0 not checked. [2025-02-06 02:15:57,261 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-02-06 02:15:57,262 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1929612764] [2025-02-06 02:15:57,262 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1929612764] provided 1 perfect and 0 imperfect interpolant sequences [2025-02-06 02:15:57,262 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-02-06 02:15:57,262 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2025-02-06 02:15:57,262 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1029091703] [2025-02-06 02:15:57,262 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-02-06 02:15:57,263 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2025-02-06 02:15:57,263 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-02-06 02:15:57,263 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2025-02-06 02:15:57,263 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2025-02-06 02:15:57,263 INFO L87 Difference]: Start difference. First operand 11532 states and 17210 transitions. Second operand has 5 states, 5 states have (on average 18.4) internal successors, (92), 5 states have internal predecessors, (92), 1 states have call successors, (49), 1 states have call predecessors, (49), 1 states have return successors, (49), 1 states have call predecessors, (49), 1 states have call successors, (49) [2025-02-06 02:15:57,838 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-02-06 02:15:57,838 INFO L93 Difference]: Finished difference Result 23290 states and 34805 transitions. [2025-02-06 02:15:57,839 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2025-02-06 02:15:57,839 INFO L78 Accepts]: Start accepts. Automaton has has 5 states, 5 states have (on average 18.4) internal successors, (92), 5 states have internal predecessors, (92), 1 states have call successors, (49), 1 states have call predecessors, (49), 1 states have return successors, (49), 1 states have call predecessors, (49), 1 states have call successors, (49) Word has length 334 [2025-02-06 02:15:57,839 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-02-06 02:15:57,866 INFO L225 Difference]: With dead ends: 23290 [2025-02-06 02:15:57,867 INFO L226 Difference]: Without dead ends: 12852 [2025-02-06 02:15:57,883 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 9 GetRequests, 4 SyntacticMatches, 0 SemanticMatches, 5 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=17, Invalid=25, Unknown=0, NotChecked=0, Total=42 [2025-02-06 02:15:57,884 INFO L435 NwaCegarLoop]: 284 mSDtfsCounter, 204 mSDsluCounter, 739 mSDsCounter, 0 mSdLazyCounter, 147 mSolverCounterSat, 148 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 204 SdHoareTripleChecker+Valid, 1023 SdHoareTripleChecker+Invalid, 295 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 148 IncrementalHoareTripleChecker+Valid, 147 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.2s IncrementalHoareTripleChecker+Time [2025-02-06 02:15:57,884 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [204 Valid, 1023 Invalid, 295 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [148 Valid, 147 Invalid, 0 Unknown, 0 Unchecked, 0.2s Time] [2025-02-06 02:15:57,892 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 12852 states. [2025-02-06 02:15:58,397 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 12852 to 11076. [2025-02-06 02:15:58,407 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 11076 states, 10214 states have (on average 1.4686704523203447) internal successors, (15001), 10247 states have internal predecessors, (15001), 768 states have call successors, (768), 93 states have call predecessors, (768), 93 states have return successors, (768), 735 states have call predecessors, (768), 768 states have call successors, (768) [2025-02-06 02:15:58,421 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 11076 states to 11076 states and 16537 transitions. [2025-02-06 02:15:58,425 INFO L78 Accepts]: Start accepts. Automaton has 11076 states and 16537 transitions. Word has length 334 [2025-02-06 02:15:58,426 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-02-06 02:15:58,426 INFO L471 AbstractCegarLoop]: Abstraction has 11076 states and 16537 transitions. [2025-02-06 02:15:58,426 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 18.4) internal successors, (92), 5 states have internal predecessors, (92), 1 states have call successors, (49), 1 states have call predecessors, (49), 1 states have return successors, (49), 1 states have call predecessors, (49), 1 states have call successors, (49) [2025-02-06 02:15:58,426 INFO L276 IsEmpty]: Start isEmpty. Operand 11076 states and 16537 transitions. [2025-02-06 02:15:58,431 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 335 [2025-02-06 02:15:58,432 INFO L210 NwaCegarLoop]: Found error trace [2025-02-06 02:15:58,432 INFO L218 NwaCegarLoop]: trace histogram [49, 49, 49, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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-06 02:15:58,432 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable18 [2025-02-06 02:15:58,432 INFO L396 AbstractCegarLoop]: === Iteration 20 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-02-06 02:15:58,432 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-02-06 02:15:58,433 INFO L85 PathProgramCache]: Analyzing trace with hash -1361576255, now seen corresponding path program 1 times [2025-02-06 02:15:58,433 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-02-06 02:15:58,433 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [20454397] [2025-02-06 02:15:58,433 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-02-06 02:15:58,433 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-02-06 02:15:58,450 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 334 statements into 1 equivalence classes. [2025-02-06 02:15:58,465 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 334 of 334 statements. [2025-02-06 02:15:58,466 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-02-06 02:15:58,466 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-02-06 02:15:58,601 INFO L134 CoverageAnalysis]: Checked inductivity of 4704 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 4704 trivial. 0 not checked. [2025-02-06 02:15:58,601 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-02-06 02:15:58,601 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [20454397] [2025-02-06 02:15:58,601 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [20454397] provided 1 perfect and 0 imperfect interpolant sequences [2025-02-06 02:15:58,601 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-02-06 02:15:58,601 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2025-02-06 02:15:58,602 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1352160059] [2025-02-06 02:15:58,602 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-02-06 02:15:58,602 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2025-02-06 02:15:58,602 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-02-06 02:15:58,602 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2025-02-06 02:15:58,602 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2025-02-06 02:15:58,602 INFO L87 Difference]: Start difference. First operand 11076 states and 16537 transitions. Second operand has 4 states, 4 states have (on average 23.0) internal successors, (92), 4 states have internal predecessors, (92), 1 states have call successors, (49), 1 states have call predecessors, (49), 1 states have return successors, (49), 1 states have call predecessors, (49), 1 states have call successors, (49) [2025-02-06 02:15:59,314 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-02-06 02:15:59,314 INFO L93 Difference]: Finished difference Result 20513 states and 30816 transitions. [2025-02-06 02:15:59,314 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2025-02-06 02:15:59,315 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 4 states have (on average 23.0) internal successors, (92), 4 states have internal predecessors, (92), 1 states have call successors, (49), 1 states have call predecessors, (49), 1 states have return successors, (49), 1 states have call predecessors, (49), 1 states have call successors, (49) Word has length 334 [2025-02-06 02:15:59,315 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-02-06 02:15:59,343 INFO L225 Difference]: With dead ends: 20513 [2025-02-06 02:15:59,343 INFO L226 Difference]: Without dead ends: 14994 [2025-02-06 02:15:59,354 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-06 02:15:59,354 INFO L435 NwaCegarLoop]: 413 mSDtfsCounter, 305 mSDsluCounter, 550 mSDsCounter, 0 mSdLazyCounter, 58 mSolverCounterSat, 149 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.3s Time, 0 mProtectedPredicate, 0 mProtectedAction, 305 SdHoareTripleChecker+Valid, 963 SdHoareTripleChecker+Invalid, 207 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 149 IncrementalHoareTripleChecker+Valid, 58 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.3s IncrementalHoareTripleChecker+Time [2025-02-06 02:15:59,354 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [305 Valid, 963 Invalid, 207 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [149 Valid, 58 Invalid, 0 Unknown, 0 Unchecked, 0.3s Time] [2025-02-06 02:15:59,363 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 14994 states. [2025-02-06 02:15:59,991 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 14994 to 14968. [2025-02-06 02:16:00,006 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 14968 states, 13712 states have (on average 1.462514585764294) internal successors, (20054), 13758 states have internal predecessors, (20054), 1124 states have call successors, (1124), 131 states have call predecessors, (1124), 131 states have return successors, (1124), 1078 states have call predecessors, (1124), 1124 states have call successors, (1124) [2025-02-06 02:16:00,031 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 14968 states to 14968 states and 22302 transitions. [2025-02-06 02:16:00,037 INFO L78 Accepts]: Start accepts. Automaton has 14968 states and 22302 transitions. Word has length 334 [2025-02-06 02:16:00,037 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-02-06 02:16:00,037 INFO L471 AbstractCegarLoop]: Abstraction has 14968 states and 22302 transitions. [2025-02-06 02:16:00,037 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 23.0) internal successors, (92), 4 states have internal predecessors, (92), 1 states have call successors, (49), 1 states have call predecessors, (49), 1 states have return successors, (49), 1 states have call predecessors, (49), 1 states have call successors, (49) [2025-02-06 02:16:00,037 INFO L276 IsEmpty]: Start isEmpty. Operand 14968 states and 22302 transitions. [2025-02-06 02:16:00,045 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 335 [2025-02-06 02:16:00,045 INFO L210 NwaCegarLoop]: Found error trace [2025-02-06 02:16:00,046 INFO L218 NwaCegarLoop]: trace histogram [49, 49, 49, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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-06 02:16:00,046 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable19 [2025-02-06 02:16:00,046 INFO L396 AbstractCegarLoop]: === Iteration 21 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-02-06 02:16:00,046 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-02-06 02:16:00,047 INFO L85 PathProgramCache]: Analyzing trace with hash -677766042, now seen corresponding path program 1 times [2025-02-06 02:16:00,047 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-02-06 02:16:00,047 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1205361807] [2025-02-06 02:16:00,047 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-02-06 02:16:00,047 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-02-06 02:16:00,063 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 334 statements into 1 equivalence classes. [2025-02-06 02:16:00,250 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 334 of 334 statements. [2025-02-06 02:16:00,251 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-02-06 02:16:00,251 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat