./Ultimate.py --spec ../sv-benchmarks/c/properties/unreach-call.prp --file ../sv-benchmarks/c/hardness-nfm22/hardness_fillercode_fillercodestructure_filler-pe-cn_file-81.i --full-output --architecture 32bit -------------------------------------------------------------------------------- Checking for ERROR reachability Using default analysis Version e2fb8bed Calling Ultimate with: /root/.sdkman/candidates/java/21.0.5-tem/bin/java -Dosgi.configuration.area=/storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/config -Xmx15G -Xms4m -jar /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/plugins/org.eclipse.equinox.launcher_1.6.800.v20240513-1750.jar -data @noDefault -ultimatedata /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data -tc /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/config/AutomizerReach.xml -i ../sv-benchmarks/c/hardness-nfm22/hardness_fillercode_fillercodestructure_filler-pe-cn_file-81.i -s /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/config/svcomp-Reach-32bit-Automizer_Default.epf --cacsl2boogietranslator.entry.function main --witnessprinter.witness.directory /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux --witnessprinter.witness.filename witness --witnessprinter.write.witness.besides.input.file false --witnessprinter.graph.data.specification CHECK( init(main()), LTL(G ! call(reach_error())) ) --witnessprinter.graph.data.producer Automizer --witnessprinter.graph.data.architecture 32bit --witnessprinter.graph.data.programhash f21456a779194f7e287a67040f0a4e45ea1ac95220541a0a40827a16bb32aae0 --- Real Ultimate output --- This is Ultimate 0.3.0-?-e2fb8be-m [2025-03-08 11:56:52,889 INFO L188 SettingsManager]: Resetting all preferences to default values... [2025-03-08 11:56:52,947 INFO L114 SettingsManager]: Loading settings from /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/config/svcomp-Reach-32bit-Automizer_Default.epf [2025-03-08 11:56:52,951 WARN L101 SettingsManager]: Preference file contains the following unknown settings: [2025-03-08 11:56:52,953 WARN L103 SettingsManager]: * de.uni_freiburg.informatik.ultimate.core.Log level for class [2025-03-08 11:56:52,968 INFO L130 SettingsManager]: Preferences different from defaults after loading the file: [2025-03-08 11:56:52,969 INFO L151 SettingsManager]: Preferences of UltimateCore differ from their defaults: [2025-03-08 11:56:52,969 INFO L153 SettingsManager]: * Log level for class=de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher=ERROR; [2025-03-08 11:56:52,969 INFO L151 SettingsManager]: Preferences of Boogie Preprocessor differ from their defaults: [2025-03-08 11:56:52,969 INFO L153 SettingsManager]: * Use memory slicer=true [2025-03-08 11:56:52,969 INFO L151 SettingsManager]: Preferences of Boogie Procedure Inliner differ from their defaults: [2025-03-08 11:56:52,969 INFO L153 SettingsManager]: * Ignore calls to procedures called more than once=ONLY_FOR_SEQUENTIAL_PROGRAMS [2025-03-08 11:56:52,969 INFO L151 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2025-03-08 11:56:52,969 INFO L153 SettingsManager]: * Create parallel compositions if possible=false [2025-03-08 11:56:52,970 INFO L153 SettingsManager]: * Use SBE=true [2025-03-08 11:56:52,970 INFO L151 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2025-03-08 11:56:52,970 INFO L153 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2025-03-08 11:56:52,970 INFO L153 SettingsManager]: * sizeof long=4 [2025-03-08 11:56:52,970 INFO L153 SettingsManager]: * Overapproximate operations on floating types=true [2025-03-08 11:56:52,970 INFO L153 SettingsManager]: * sizeof POINTER=4 [2025-03-08 11:56:52,970 INFO L153 SettingsManager]: * Check division by zero=IGNORE [2025-03-08 11:56:52,970 INFO L153 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2025-03-08 11:56:52,970 INFO L153 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2025-03-08 11:56:52,970 INFO L153 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2025-03-08 11:56:52,971 INFO L153 SettingsManager]: * sizeof long double=12 [2025-03-08 11:56:52,971 INFO L153 SettingsManager]: * Check if freed pointer was valid=false [2025-03-08 11:56:52,971 INFO L153 SettingsManager]: * Behaviour of calls to undefined functions=OVERAPPROXIMATE_BEHAVIOUR [2025-03-08 11:56:52,971 INFO L153 SettingsManager]: * Use constant arrays=true [2025-03-08 11:56:52,971 INFO L151 SettingsManager]: Preferences of IcfgBuilder differ from their defaults: [2025-03-08 11:56:52,971 INFO L153 SettingsManager]: * Size of a code block=SequenceOfStatements [2025-03-08 11:56:52,971 INFO L153 SettingsManager]: * Only consider context switches at boundaries of atomic blocks=true [2025-03-08 11:56:52,971 INFO L153 SettingsManager]: * SMT solver=External_DefaultMode [2025-03-08 11:56:52,971 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2025-03-08 11:56:52,971 INFO L151 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2025-03-08 11:56:52,971 INFO L153 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2025-03-08 11:56:52,972 INFO L153 SettingsManager]: * Compute procedure contracts=false [2025-03-08 11:56:52,972 INFO L153 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopHeads [2025-03-08 11:56:52,972 INFO L153 SettingsManager]: * Trace refinement strategy=CAMEL [2025-03-08 11:56:52,972 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2025-03-08 11:56:52,972 INFO L153 SettingsManager]: * Apply one-shot large block encoding in concurrent analysis=false [2025-03-08 11:56:52,972 INFO L153 SettingsManager]: * Automaton type used in concurrency analysis=PETRI_NET [2025-03-08 11:56:52,972 INFO L153 SettingsManager]: * Order on configurations for Petri net unfoldings=DBO [2025-03-08 11:56:52,972 INFO L153 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode [2025-03-08 11:56:52,972 INFO L153 SettingsManager]: * Looper check in Petri net analysis=SEMANTIC Applying setting for plugin de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator: Entry function -> main Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Witness directory -> /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Witness filename -> witness Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Write witness besides input file -> false Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Graph data specification -> CHECK( init(main()), LTL(G ! call(reach_error())) ) Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Graph data producer -> Automizer Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Graph data architecture -> 32bit Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Graph data programhash -> f21456a779194f7e287a67040f0a4e45ea1ac95220541a0a40827a16bb32aae0 [2025-03-08 11:56:53,213 INFO L75 nceAwareModelManager]: Repository-Root is: /tmp [2025-03-08 11:56:53,221 INFO L261 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2025-03-08 11:56:53,223 INFO L217 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2025-03-08 11:56:53,224 INFO L270 PluginConnector]: Initializing CDTParser... [2025-03-08 11:56:53,224 INFO L274 PluginConnector]: CDTParser initialized [2025-03-08 11:56:53,225 INFO L431 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/../sv-benchmarks/c/hardness-nfm22/hardness_fillercode_fillercodestructure_filler-pe-cn_file-81.i [2025-03-08 11:56:54,405 INFO L533 CDTParser]: Created temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/ad5d22f08/e38fa1a9ac7145cd94d28d62abcb8950/FLAG17469ef6c [2025-03-08 11:56:54,677 INFO L384 CDTParser]: Found 1 translation units. [2025-03-08 11:56:54,679 INFO L180 CDTParser]: Scanning /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/hardness-nfm22/hardness_fillercode_fillercodestructure_filler-pe-cn_file-81.i [2025-03-08 11:56:54,687 INFO L427 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/ad5d22f08/e38fa1a9ac7145cd94d28d62abcb8950/FLAG17469ef6c [2025-03-08 11:56:54,983 INFO L435 CDTParser]: Successfully deleted /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/ad5d22f08/e38fa1a9ac7145cd94d28d62abcb8950 [2025-03-08 11:56:54,985 INFO L299 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2025-03-08 11:56:54,986 INFO L133 ToolchainWalker]: Walking toolchain with 6 elements. [2025-03-08 11:56:54,987 INFO L112 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2025-03-08 11:56:54,987 INFO L270 PluginConnector]: Initializing CACSL2BoogieTranslator... [2025-03-08 11:56:54,990 INFO L274 PluginConnector]: CACSL2BoogieTranslator initialized [2025-03-08 11:56:54,990 INFO L184 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 08.03 11:56:54" (1/1) ... [2025-03-08 11:56:54,991 INFO L204 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@6be4bec9 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.03 11:56:54, skipping insertion in model container [2025-03-08 11:56:54,991 INFO L184 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 08.03 11:56:54" (1/1) ... [2025-03-08 11:56:55,016 INFO L175 MainTranslator]: Built tables and reachable declarations [2025-03-08 11:56:55,113 WARN L250 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/hardness-nfm22/hardness_fillercode_fillercodestructure_filler-pe-cn_file-81.i[919,932] [2025-03-08 11:56:55,166 INFO L210 PostProcessor]: Analyzing one entry point: main [2025-03-08 11:56:55,176 INFO L200 MainTranslator]: Completed pre-run [2025-03-08 11:56:55,183 WARN L250 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/hardness-nfm22/hardness_fillercode_fillercodestructure_filler-pe-cn_file-81.i[919,932] [2025-03-08 11:56:55,210 INFO L210 PostProcessor]: Analyzing one entry point: main [2025-03-08 11:56:55,226 INFO L204 MainTranslator]: Completed translation [2025-03-08 11:56:55,227 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.03 11:56:55 WrapperNode [2025-03-08 11:56:55,228 INFO L131 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2025-03-08 11:56:55,229 INFO L112 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2025-03-08 11:56:55,229 INFO L270 PluginConnector]: Initializing Boogie Procedure Inliner... [2025-03-08 11:56:55,229 INFO L274 PluginConnector]: Boogie Procedure Inliner initialized [2025-03-08 11:56:55,234 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.03 11:56:55" (1/1) ... [2025-03-08 11:56:55,242 INFO L184 PluginConnector]: Executing the observer Inliner from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.03 11:56:55" (1/1) ... [2025-03-08 11:56:55,282 INFO L138 Inliner]: procedures = 26, calls = 63, calls flagged for inlining = 8, calls inlined = 8, statements flattened = 305 [2025-03-08 11:56:55,282 INFO L131 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2025-03-08 11:56:55,283 INFO L112 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2025-03-08 11:56:55,283 INFO L270 PluginConnector]: Initializing Boogie Preprocessor... [2025-03-08 11:56:55,283 INFO L274 PluginConnector]: Boogie Preprocessor initialized [2025-03-08 11:56:55,289 INFO L184 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.03 11:56:55" (1/1) ... [2025-03-08 11:56:55,289 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.03 11:56:55" (1/1) ... [2025-03-08 11:56:55,295 INFO L184 PluginConnector]: Executing the observer MemorySlicer from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.03 11:56:55" (1/1) ... [2025-03-08 11:56:55,315 INFO L175 MemorySlicer]: Split 2 memory accesses to 1 slices as follows [2]. 100 percent of accesses are in the largest equivalence class. The 2 initializations are split as follows [2]. The 0 writes are split as follows [0]. [2025-03-08 11:56:55,316 INFO L184 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.03 11:56:55" (1/1) ... [2025-03-08 11:56:55,316 INFO L184 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.03 11:56:55" (1/1) ... [2025-03-08 11:56:55,330 INFO L184 PluginConnector]: Executing the observer ReplaceArrayAssignments from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.03 11:56:55" (1/1) ... [2025-03-08 11:56:55,333 INFO L184 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.03 11:56:55" (1/1) ... [2025-03-08 11:56:55,335 INFO L184 PluginConnector]: Executing the observer LTLStepAnnotator from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.03 11:56:55" (1/1) ... [2025-03-08 11:56:55,339 INFO L184 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.03 11:56:55" (1/1) ... [2025-03-08 11:56:55,345 INFO L131 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2025-03-08 11:56:55,346 INFO L112 PluginConnector]: ------------------------IcfgBuilder---------------------------- [2025-03-08 11:56:55,347 INFO L270 PluginConnector]: Initializing IcfgBuilder... [2025-03-08 11:56:55,347 INFO L274 PluginConnector]: IcfgBuilder initialized [2025-03-08 11:56:55,347 INFO L184 PluginConnector]: Executing the observer IcfgBuilderObserver from plugin IcfgBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.03 11:56:55" (1/1) ... [2025-03-08 11:56:55,351 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2025-03-08 11:56:55,360 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2025-03-08 11:56:55,370 INFO L229 MonitoredProcess]: Starting monitored process 1 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 (exit command is (exit), workingDir is null) [2025-03-08 11:56:55,372 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 (1)] Waiting until timeout for monitored process [2025-03-08 11:56:55,387 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocInit [2025-03-08 11:56:55,388 INFO L130 BoogieDeclarations]: Found specification of procedure assume_abort_if_not [2025-03-08 11:56:55,388 INFO L138 BoogieDeclarations]: Found implementation of procedure assume_abort_if_not [2025-03-08 11:56:55,388 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int#0 [2025-03-08 11:56:55,388 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2025-03-08 11:56:55,388 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2025-03-08 11:56:55,449 INFO L256 CfgBuilder]: Building ICFG [2025-03-08 11:56:55,451 INFO L286 CfgBuilder]: Building CFG for each procedure with an implementation [2025-03-08 11:56:55,865 INFO L1307 $ProcedureCfgBuilder]: dead code at ProgramPoint L224: havoc property_#t~bitwise34#1;havoc property_#t~short35#1; [2025-03-08 11:56:55,903 INFO L? ?]: Removed 16 outVars from TransFormulas that were not future-live. [2025-03-08 11:56:55,903 INFO L307 CfgBuilder]: Performing block encoding [2025-03-08 11:56:55,920 INFO L331 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2025-03-08 11:56:55,921 INFO L336 CfgBuilder]: Removed 0 assume(true) statements. [2025-03-08 11:56:55,921 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.icfgbuilder CFG 08.03 11:56:55 BoogieIcfgContainer [2025-03-08 11:56:55,922 INFO L131 PluginConnector]: ------------------------ END IcfgBuilder---------------------------- [2025-03-08 11:56:55,923 INFO L112 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2025-03-08 11:56:55,924 INFO L270 PluginConnector]: Initializing TraceAbstraction... [2025-03-08 11:56:55,927 INFO L274 PluginConnector]: TraceAbstraction initialized [2025-03-08 11:56:55,927 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 08.03 11:56:54" (1/3) ... [2025-03-08 11:56:55,928 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@79c46f9f and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 08.03 11:56:55, skipping insertion in model container [2025-03-08 11:56:55,928 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.03 11:56:55" (2/3) ... [2025-03-08 11:56:55,928 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@79c46f9f and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 08.03 11:56:55, skipping insertion in model container [2025-03-08 11:56:55,929 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.icfgbuilder CFG 08.03 11:56:55" (3/3) ... [2025-03-08 11:56:55,929 INFO L128 eAbstractionObserver]: Analyzing ICFG hardness_fillercode_fillercodestructure_filler-pe-cn_file-81.i [2025-03-08 11:56:55,939 INFO L216 ceAbstractionStarter]: Automizer settings: Hoare:LoopHeads NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2025-03-08 11:56:55,942 INFO L151 ceAbstractionStarter]: Applying trace abstraction to ICFG hardness_fillercode_fillercodestructure_filler-pe-cn_file-81.i that has 2 procedures, 133 locations, 1 initial locations, 1 loop locations, and 1 error locations. [2025-03-08 11:56:56,005 INFO L332 AbstractCegarLoop]: ======== Iteration 0 == of CEGAR loop == AllErrorsAtOnce ======== [2025-03-08 11:56:56,012 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;@7918d656, mLbeIndependenceSettings=[IndependenceType=SEMANTIC, AbstractionType=NONE, UseConditional=false, UseSemiCommutativity=true, Solver=Z3, SolverTimeout=1000ms] [2025-03-08 11:56:56,012 INFO L334 AbstractCegarLoop]: Starting to check reachability of 1 error locations. [2025-03-08 11:56:56,016 INFO L276 IsEmpty]: Start isEmpty. Operand has 133 states, 80 states have (on average 1.4125) internal successors, (113), 81 states have internal predecessors, (113), 50 states have call successors, (50), 1 states have call predecessors, (50), 1 states have return successors, (50), 50 states have call predecessors, (50), 50 states have call successors, (50) [2025-03-08 11:56:56,026 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 307 [2025-03-08 11:56:56,026 INFO L210 NwaCegarLoop]: Found error trace [2025-03-08 11:56:56,027 INFO L218 NwaCegarLoop]: trace histogram [50, 50, 50, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-03-08 11:56:56,027 INFO L396 AbstractCegarLoop]: === Iteration 1 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-03-08 11:56:56,030 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-08 11:56:56,031 INFO L85 PathProgramCache]: Analyzing trace with hash -527471935, now seen corresponding path program 1 times [2025-03-08 11:56:56,036 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-08 11:56:56,036 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [202803463] [2025-03-08 11:56:56,036 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-08 11:56:56,037 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-08 11:56:56,117 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 306 statements into 1 equivalence classes. [2025-03-08 11:56:56,137 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 306 of 306 statements. [2025-03-08 11:56:56,137 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-08 11:56:56,137 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-08 11:56:56,360 INFO L134 CoverageAnalysis]: Checked inductivity of 4900 backedges. 0 proven. 98 refuted. 0 times theorem prover too weak. 4802 trivial. 0 not checked. [2025-03-08 11:56:56,360 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-08 11:56:56,362 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [202803463] [2025-03-08 11:56:56,363 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [202803463] provided 0 perfect and 1 imperfect interpolant sequences [2025-03-08 11:56:56,363 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1622154957] [2025-03-08 11:56:56,363 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-08 11:56:56,363 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-03-08 11:56:56,363 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2025-03-08 11:56:56,365 INFO L229 MonitoredProcess]: Starting monitored process 2 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2025-03-08 11:56:56,368 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (2)] Waiting until timeout for monitored process [2025-03-08 11:56:56,474 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 306 statements into 1 equivalence classes. [2025-03-08 11:56:56,580 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 306 of 306 statements. [2025-03-08 11:56:56,581 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-08 11:56:56,581 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-08 11:56:56,584 INFO L256 TraceCheckSpWp]: Trace formula consists of 681 conjuncts, 1 conjuncts are in the unsatisfiable core [2025-03-08 11:56:56,598 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-03-08 11:56:56,637 INFO L134 CoverageAnalysis]: Checked inductivity of 4900 backedges. 98 proven. 0 refuted. 0 times theorem prover too weak. 4802 trivial. 0 not checked. [2025-03-08 11:56:56,638 INFO L308 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2025-03-08 11:56:56,638 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1622154957] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-08 11:56:56,638 INFO L185 FreeRefinementEngine]: Found 1 perfect and 1 imperfect interpolant sequences. [2025-03-08 11:56:56,638 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [2] total 2 [2025-03-08 11:56:56,640 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [552252108] [2025-03-08 11:56:56,640 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-08 11:56:56,645 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 2 states [2025-03-08 11:56:56,645 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-08 11:56:56,657 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 2 interpolants. [2025-03-08 11:56:56,658 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=1, Invalid=1, Unknown=0, NotChecked=0, Total=2 [2025-03-08 11:56:56,659 INFO L87 Difference]: Start difference. First operand has 133 states, 80 states have (on average 1.4125) internal successors, (113), 81 states have internal predecessors, (113), 50 states have call successors, (50), 1 states have call predecessors, (50), 1 states have return successors, (50), 50 states have call predecessors, (50), 50 states have call successors, (50) Second operand has 2 states, 2 states have (on average 30.5) internal successors, (61), 2 states have internal predecessors, (61), 2 states have call successors, (50), 2 states have call predecessors, (50), 1 states have return successors, (50), 1 states have call predecessors, (50), 2 states have call successors, (50) [2025-03-08 11:56:56,718 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-08 11:56:56,719 INFO L93 Difference]: Finished difference Result 260 states and 471 transitions. [2025-03-08 11:56:56,720 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 2 states. [2025-03-08 11:56:56,721 INFO L78 Accepts]: Start accepts. Automaton has has 2 states, 2 states have (on average 30.5) internal successors, (61), 2 states have internal predecessors, (61), 2 states have call successors, (50), 2 states have call predecessors, (50), 1 states have return successors, (50), 1 states have call predecessors, (50), 2 states have call successors, (50) Word has length 306 [2025-03-08 11:56:56,721 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-08 11:56:56,726 INFO L225 Difference]: With dead ends: 260 [2025-03-08 11:56:56,726 INFO L226 Difference]: Without dead ends: 130 [2025-03-08 11:56:56,729 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 307 GetRequests, 307 SyntacticMatches, 0 SemanticMatches, 0 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=1, Invalid=1, Unknown=0, NotChecked=0, Total=2 [2025-03-08 11:56:56,732 INFO L435 NwaCegarLoop]: 204 mSDtfsCounter, 0 mSDsluCounter, 0 mSDsCounter, 0 mSdLazyCounter, 4 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 0 SdHoareTripleChecker+Valid, 204 SdHoareTripleChecker+Invalid, 4 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 4 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2025-03-08 11:56:56,733 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [0 Valid, 204 Invalid, 4 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 4 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2025-03-08 11:56:56,748 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 130 states. [2025-03-08 11:56:56,770 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 130 to 130. [2025-03-08 11:56:56,773 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 130 states, 78 states have (on average 1.3846153846153846) internal successors, (108), 78 states have internal predecessors, (108), 50 states have call successors, (50), 1 states have call predecessors, (50), 1 states have return successors, (50), 50 states have call predecessors, (50), 50 states have call successors, (50) [2025-03-08 11:56:56,780 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 130 states to 130 states and 208 transitions. [2025-03-08 11:56:56,784 INFO L78 Accepts]: Start accepts. Automaton has 130 states and 208 transitions. Word has length 306 [2025-03-08 11:56:56,784 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-08 11:56:56,784 INFO L471 AbstractCegarLoop]: Abstraction has 130 states and 208 transitions. [2025-03-08 11:56:56,784 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 2 states, 2 states have (on average 30.5) internal successors, (61), 2 states have internal predecessors, (61), 2 states have call successors, (50), 2 states have call predecessors, (50), 1 states have return successors, (50), 1 states have call predecessors, (50), 2 states have call successors, (50) [2025-03-08 11:56:56,786 INFO L276 IsEmpty]: Start isEmpty. Operand 130 states and 208 transitions. [2025-03-08 11:56:56,792 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 307 [2025-03-08 11:56:56,792 INFO L210 NwaCegarLoop]: Found error trace [2025-03-08 11:56:56,792 INFO L218 NwaCegarLoop]: trace histogram [50, 50, 50, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-03-08 11:56:56,801 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (2)] Forceful destruction successful, exit code 0 [2025-03-08 11:56:56,993 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 2 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable0 [2025-03-08 11:56:56,993 INFO L396 AbstractCegarLoop]: === Iteration 2 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-03-08 11:56:56,994 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-08 11:56:56,994 INFO L85 PathProgramCache]: Analyzing trace with hash -94822755, now seen corresponding path program 1 times [2025-03-08 11:56:56,994 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-08 11:56:56,994 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1685947172] [2025-03-08 11:56:56,994 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-08 11:56:56,994 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-08 11:56:57,018 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 306 statements into 1 equivalence classes. [2025-03-08 11:56:57,202 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 306 of 306 statements. [2025-03-08 11:56:57,202 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-08 11:56:57,203 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-08 11:56:58,600 INFO L134 CoverageAnalysis]: Checked inductivity of 4900 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 4900 trivial. 0 not checked. [2025-03-08 11:56:58,600 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-08 11:56:58,600 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1685947172] [2025-03-08 11:56:58,600 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1685947172] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-08 11:56:58,600 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-08 11:56:58,600 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2025-03-08 11:56:58,600 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1459146022] [2025-03-08 11:56:58,600 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-08 11:56:58,601 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2025-03-08 11:56:58,601 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-08 11:56:58,604 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2025-03-08 11:56:58,604 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2025-03-08 11:56:58,604 INFO L87 Difference]: Start difference. First operand 130 states and 208 transitions. Second operand has 5 states, 5 states have (on average 11.8) internal successors, (59), 5 states have internal predecessors, (59), 1 states have call successors, (50), 1 states have call predecessors, (50), 1 states have return successors, (50), 1 states have call predecessors, (50), 1 states have call successors, (50) [2025-03-08 11:56:59,405 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-08 11:56:59,405 INFO L93 Difference]: Finished difference Result 443 states and 692 transitions. [2025-03-08 11:56:59,407 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2025-03-08 11:56:59,407 INFO L78 Accepts]: Start accepts. Automaton has has 5 states, 5 states have (on average 11.8) internal successors, (59), 5 states have internal predecessors, (59), 1 states have call successors, (50), 1 states have call predecessors, (50), 1 states have return successors, (50), 1 states have call predecessors, (50), 1 states have call successors, (50) Word has length 306 [2025-03-08 11:56:59,408 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-08 11:56:59,415 INFO L225 Difference]: With dead ends: 443 [2025-03-08 11:56:59,415 INFO L226 Difference]: Without dead ends: 316 [2025-03-08 11:56:59,416 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 15 GetRequests, 7 SyntacticMatches, 2 SemanticMatches, 6 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 3 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=22, Invalid=34, Unknown=0, NotChecked=0, Total=56 [2025-03-08 11:56:59,416 INFO L435 NwaCegarLoop]: 205 mSDtfsCounter, 315 mSDsluCounter, 407 mSDsCounter, 0 mSdLazyCounter, 279 mSolverCounterSat, 265 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.5s Time, 0 mProtectedPredicate, 0 mProtectedAction, 315 SdHoareTripleChecker+Valid, 612 SdHoareTripleChecker+Invalid, 544 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 265 IncrementalHoareTripleChecker+Valid, 279 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.6s IncrementalHoareTripleChecker+Time [2025-03-08 11:56:59,417 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [315 Valid, 612 Invalid, 544 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [265 Valid, 279 Invalid, 0 Unknown, 0 Unchecked, 0.6s Time] [2025-03-08 11:56:59,417 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 316 states. [2025-03-08 11:56:59,456 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 316 to 137. [2025-03-08 11:56:59,459 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 137 states, 84 states have (on average 1.380952380952381) internal successors, (116), 84 states have internal predecessors, (116), 50 states have call successors, (50), 2 states have call predecessors, (50), 2 states have return successors, (50), 50 states have call predecessors, (50), 50 states have call successors, (50) [2025-03-08 11:56:59,472 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 137 states to 137 states and 216 transitions. [2025-03-08 11:56:59,473 INFO L78 Accepts]: Start accepts. Automaton has 137 states and 216 transitions. Word has length 306 [2025-03-08 11:56:59,474 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-08 11:56:59,474 INFO L471 AbstractCegarLoop]: Abstraction has 137 states and 216 transitions. [2025-03-08 11:56:59,474 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 11.8) internal successors, (59), 5 states have internal predecessors, (59), 1 states have call successors, (50), 1 states have call predecessors, (50), 1 states have return successors, (50), 1 states have call predecessors, (50), 1 states have call successors, (50) [2025-03-08 11:56:59,474 INFO L276 IsEmpty]: Start isEmpty. Operand 137 states and 216 transitions. [2025-03-08 11:56:59,477 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 308 [2025-03-08 11:56:59,477 INFO L210 NwaCegarLoop]: Found error trace [2025-03-08 11:56:59,477 INFO L218 NwaCegarLoop]: trace histogram [50, 50, 50, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-03-08 11:56:59,477 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable1 [2025-03-08 11:56:59,477 INFO L396 AbstractCegarLoop]: === Iteration 3 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-03-08 11:56:59,478 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-08 11:56:59,478 INFO L85 PathProgramCache]: Analyzing trace with hash 1609084940, now seen corresponding path program 1 times [2025-03-08 11:56:59,478 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-08 11:56:59,478 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2028746694] [2025-03-08 11:56:59,478 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-08 11:56:59,478 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-08 11:56:59,496 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 307 statements into 1 equivalence classes. [2025-03-08 11:56:59,600 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 307 of 307 statements. [2025-03-08 11:56:59,600 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-08 11:56:59,600 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-08 11:57:06,681 INFO L134 CoverageAnalysis]: Checked inductivity of 4900 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 4900 trivial. 0 not checked. [2025-03-08 11:57:06,681 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-08 11:57:06,681 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2028746694] [2025-03-08 11:57:06,682 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [2028746694] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-08 11:57:06,682 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-08 11:57:06,682 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [11] imperfect sequences [] total 11 [2025-03-08 11:57:06,682 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [266206651] [2025-03-08 11:57:06,682 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-08 11:57:06,683 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 11 states [2025-03-08 11:57:06,683 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-08 11:57:06,684 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 11 interpolants. [2025-03-08 11:57:06,684 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=25, Invalid=85, Unknown=0, NotChecked=0, Total=110 [2025-03-08 11:57:06,685 INFO L87 Difference]: Start difference. First operand 137 states and 216 transitions. Second operand has 11 states, 11 states have (on average 5.454545454545454) internal successors, (60), 11 states have internal predecessors, (60), 1 states have call successors, (50), 1 states have call predecessors, (50), 1 states have return successors, (50), 1 states have call predecessors, (50), 1 states have call successors, (50) [2025-03-08 11:57:09,649 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-08 11:57:09,650 INFO L93 Difference]: Finished difference Result 623 states and 995 transitions. [2025-03-08 11:57:09,650 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 12 states. [2025-03-08 11:57:09,650 INFO L78 Accepts]: Start accepts. Automaton has has 11 states, 11 states have (on average 5.454545454545454) internal successors, (60), 11 states have internal predecessors, (60), 1 states have call successors, (50), 1 states have call predecessors, (50), 1 states have return successors, (50), 1 states have call predecessors, (50), 1 states have call successors, (50) Word has length 307 [2025-03-08 11:57:09,651 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-08 11:57:09,653 INFO L225 Difference]: With dead ends: 623 [2025-03-08 11:57:09,653 INFO L226 Difference]: Without dead ends: 489 [2025-03-08 11:57:09,654 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 23 GetRequests, 4 SyntacticMatches, 0 SemanticMatches, 19 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 54 ImplicationChecksByTransitivity, 1.9s TimeCoverageRelationStatistics Valid=116, Invalid=304, Unknown=0, NotChecked=0, Total=420 [2025-03-08 11:57:09,656 INFO L435 NwaCegarLoop]: 184 mSDtfsCounter, 1503 mSDsluCounter, 959 mSDsCounter, 0 mSdLazyCounter, 673 mSolverCounterSat, 152 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 1.4s Time, 0 mProtectedPredicate, 0 mProtectedAction, 1503 SdHoareTripleChecker+Valid, 1143 SdHoareTripleChecker+Invalid, 825 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 152 IncrementalHoareTripleChecker+Valid, 673 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 1.6s IncrementalHoareTripleChecker+Time [2025-03-08 11:57:09,656 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [1503 Valid, 1143 Invalid, 825 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [152 Valid, 673 Invalid, 0 Unknown, 0 Unchecked, 1.6s Time] [2025-03-08 11:57:09,657 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 489 states. [2025-03-08 11:57:09,692 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 489 to 260. [2025-03-08 11:57:09,693 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 260 states, 155 states have (on average 1.3741935483870968) internal successors, (213), 155 states have internal predecessors, (213), 100 states have call successors, (100), 4 states have call predecessors, (100), 4 states have return successors, (100), 100 states have call predecessors, (100), 100 states have call successors, (100) [2025-03-08 11:57:09,695 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 260 states to 260 states and 413 transitions. [2025-03-08 11:57:09,696 INFO L78 Accepts]: Start accepts. Automaton has 260 states and 413 transitions. Word has length 307 [2025-03-08 11:57:09,698 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-08 11:57:09,698 INFO L471 AbstractCegarLoop]: Abstraction has 260 states and 413 transitions. [2025-03-08 11:57:09,698 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 11 states, 11 states have (on average 5.454545454545454) internal successors, (60), 11 states have internal predecessors, (60), 1 states have call successors, (50), 1 states have call predecessors, (50), 1 states have return successors, (50), 1 states have call predecessors, (50), 1 states have call successors, (50) [2025-03-08 11:57:09,698 INFO L276 IsEmpty]: Start isEmpty. Operand 260 states and 413 transitions. [2025-03-08 11:57:09,701 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 308 [2025-03-08 11:57:09,701 INFO L210 NwaCegarLoop]: Found error trace [2025-03-08 11:57:09,702 INFO L218 NwaCegarLoop]: trace histogram [50, 50, 50, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-03-08 11:57:09,703 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable2 [2025-03-08 11:57:09,703 INFO L396 AbstractCegarLoop]: === Iteration 4 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-03-08 11:57:09,703 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-08 11:57:09,704 INFO L85 PathProgramCache]: Analyzing trace with hash 1200260715, now seen corresponding path program 1 times [2025-03-08 11:57:09,704 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-08 11:57:09,704 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [779061815] [2025-03-08 11:57:09,704 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-08 11:57:09,704 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-08 11:57:09,716 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 307 statements into 1 equivalence classes. [2025-03-08 11:57:09,747 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 307 of 307 statements. [2025-03-08 11:57:09,747 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-08 11:57:09,748 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-08 11:57:09,921 INFO L134 CoverageAnalysis]: Checked inductivity of 4900 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 4900 trivial. 0 not checked. [2025-03-08 11:57:09,921 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-08 11:57:09,921 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [779061815] [2025-03-08 11:57:09,921 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [779061815] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-08 11:57:09,921 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-08 11:57:09,921 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2025-03-08 11:57:09,922 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [861892522] [2025-03-08 11:57:09,922 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-08 11:57:09,923 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2025-03-08 11:57:09,923 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-08 11:57:09,924 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2025-03-08 11:57:09,924 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2025-03-08 11:57:09,924 INFO L87 Difference]: Start difference. First operand 260 states and 413 transitions. Second operand has 4 states, 4 states have (on average 15.0) internal successors, (60), 4 states have internal predecessors, (60), 1 states have call successors, (50), 1 states have call predecessors, (50), 1 states have return successors, (50), 1 states have call predecessors, (50), 1 states have call successors, (50) [2025-03-08 11:57:10,004 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-08 11:57:10,005 INFO L93 Difference]: Finished difference Result 451 states and 715 transitions. [2025-03-08 11:57:10,006 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2025-03-08 11:57:10,006 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 4 states have (on average 15.0) internal successors, (60), 4 states have internal predecessors, (60), 1 states have call successors, (50), 1 states have call predecessors, (50), 1 states have return successors, (50), 1 states have call predecessors, (50), 1 states have call successors, (50) Word has length 307 [2025-03-08 11:57:10,007 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-08 11:57:10,011 INFO L225 Difference]: With dead ends: 451 [2025-03-08 11:57:10,012 INFO L226 Difference]: Without dead ends: 317 [2025-03-08 11:57:10,012 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 5 GetRequests, 3 SyntacticMatches, 0 SemanticMatches, 2 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2025-03-08 11:57:10,014 INFO L435 NwaCegarLoop]: 213 mSDtfsCounter, 77 mSDsluCounter, 390 mSDsCounter, 0 mSdLazyCounter, 48 mSolverCounterSat, 3 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 77 SdHoareTripleChecker+Valid, 603 SdHoareTripleChecker+Invalid, 51 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 3 IncrementalHoareTripleChecker+Valid, 48 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2025-03-08 11:57:10,015 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [77 Valid, 603 Invalid, 51 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [3 Valid, 48 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2025-03-08 11:57:10,015 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 317 states. [2025-03-08 11:57:10,053 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 317 to 314. [2025-03-08 11:57:10,054 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 314 states, 204 states have (on average 1.4166666666666667) internal successors, (289), 205 states have internal predecessors, (289), 104 states have call successors, (104), 5 states have call predecessors, (104), 5 states have return successors, (104), 103 states have call predecessors, (104), 104 states have call successors, (104) [2025-03-08 11:57:10,056 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 314 states to 314 states and 497 transitions. [2025-03-08 11:57:10,057 INFO L78 Accepts]: Start accepts. Automaton has 314 states and 497 transitions. Word has length 307 [2025-03-08 11:57:10,059 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-08 11:57:10,059 INFO L471 AbstractCegarLoop]: Abstraction has 314 states and 497 transitions. [2025-03-08 11:57:10,059 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 15.0) internal successors, (60), 4 states have internal predecessors, (60), 1 states have call successors, (50), 1 states have call predecessors, (50), 1 states have return successors, (50), 1 states have call predecessors, (50), 1 states have call successors, (50) [2025-03-08 11:57:10,060 INFO L276 IsEmpty]: Start isEmpty. Operand 314 states and 497 transitions. [2025-03-08 11:57:10,062 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 308 [2025-03-08 11:57:10,062 INFO L210 NwaCegarLoop]: Found error trace [2025-03-08 11:57:10,062 INFO L218 NwaCegarLoop]: trace histogram [50, 50, 50, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-03-08 11:57:10,063 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable3 [2025-03-08 11:57:10,063 INFO L396 AbstractCegarLoop]: === Iteration 5 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-03-08 11:57:10,063 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-08 11:57:10,063 INFO L85 PathProgramCache]: Analyzing trace with hash 1820435853, now seen corresponding path program 1 times [2025-03-08 11:57:10,063 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-08 11:57:10,063 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1736602501] [2025-03-08 11:57:10,063 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-08 11:57:10,064 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-08 11:57:10,080 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 307 statements into 1 equivalence classes. [2025-03-08 11:57:10,173 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 307 of 307 statements. [2025-03-08 11:57:10,173 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-08 11:57:10,173 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-08 11:57:21,188 INFO L134 CoverageAnalysis]: Checked inductivity of 4900 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 4900 trivial. 0 not checked. [2025-03-08 11:57:21,189 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-08 11:57:21,189 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1736602501] [2025-03-08 11:57:21,189 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1736602501] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-08 11:57:21,189 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-08 11:57:21,189 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [12] imperfect sequences [] total 12 [2025-03-08 11:57:21,189 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2102554685] [2025-03-08 11:57:21,189 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-08 11:57:21,189 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 12 states [2025-03-08 11:57:21,190 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-08 11:57:21,190 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 12 interpolants. [2025-03-08 11:57:21,190 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=28, Invalid=104, Unknown=0, NotChecked=0, Total=132 [2025-03-08 11:57:21,190 INFO L87 Difference]: Start difference. First operand 314 states and 497 transitions. Second operand has 12 states, 12 states have (on average 5.0) internal successors, (60), 12 states have internal predecessors, (60), 1 states have call successors, (50), 1 states have call predecessors, (50), 1 states have return successors, (50), 1 states have call predecessors, (50), 1 states have call successors, (50) [2025-03-08 11:57:24,306 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-08 11:57:24,306 INFO L93 Difference]: Finished difference Result 718 states and 1141 transitions. [2025-03-08 11:57:24,306 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 13 states. [2025-03-08 11:57:24,307 INFO L78 Accepts]: Start accepts. Automaton has has 12 states, 12 states have (on average 5.0) internal successors, (60), 12 states have internal predecessors, (60), 1 states have call successors, (50), 1 states have call predecessors, (50), 1 states have return successors, (50), 1 states have call predecessors, (50), 1 states have call successors, (50) Word has length 307 [2025-03-08 11:57:24,310 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-08 11:57:24,313 INFO L225 Difference]: With dead ends: 718 [2025-03-08 11:57:24,314 INFO L226 Difference]: Without dead ends: 530 [2025-03-08 11:57:24,315 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 26 GetRequests, 5 SyntacticMatches, 0 SemanticMatches, 21 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 72 ImplicationChecksByTransitivity, 3.0s TimeCoverageRelationStatistics Valid=129, Invalid=377, Unknown=0, NotChecked=0, Total=506 [2025-03-08 11:57:24,315 INFO L435 NwaCegarLoop]: 185 mSDtfsCounter, 898 mSDsluCounter, 964 mSDsCounter, 0 mSdLazyCounter, 679 mSolverCounterSat, 152 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.9s Time, 0 mProtectedPredicate, 0 mProtectedAction, 898 SdHoareTripleChecker+Valid, 1149 SdHoareTripleChecker+Invalid, 831 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 152 IncrementalHoareTripleChecker+Valid, 679 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 1.0s IncrementalHoareTripleChecker+Time [2025-03-08 11:57:24,315 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [898 Valid, 1149 Invalid, 831 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [152 Valid, 679 Invalid, 0 Unknown, 0 Unchecked, 1.0s Time] [2025-03-08 11:57:24,316 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 530 states. [2025-03-08 11:57:24,347 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 530 to 314. [2025-03-08 11:57:24,347 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 314 states, 204 states have (on average 1.4166666666666667) internal successors, (289), 205 states have internal predecessors, (289), 104 states have call successors, (104), 5 states have call predecessors, (104), 5 states have return successors, (104), 103 states have call predecessors, (104), 104 states have call successors, (104) [2025-03-08 11:57:24,349 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 314 states to 314 states and 497 transitions. [2025-03-08 11:57:24,349 INFO L78 Accepts]: Start accepts. Automaton has 314 states and 497 transitions. Word has length 307 [2025-03-08 11:57:24,350 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-08 11:57:24,350 INFO L471 AbstractCegarLoop]: Abstraction has 314 states and 497 transitions. [2025-03-08 11:57:24,350 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 12 states, 12 states have (on average 5.0) internal successors, (60), 12 states have internal predecessors, (60), 1 states have call successors, (50), 1 states have call predecessors, (50), 1 states have return successors, (50), 1 states have call predecessors, (50), 1 states have call successors, (50) [2025-03-08 11:57:24,350 INFO L276 IsEmpty]: Start isEmpty. Operand 314 states and 497 transitions. [2025-03-08 11:57:24,352 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 308 [2025-03-08 11:57:24,353 INFO L210 NwaCegarLoop]: Found error trace [2025-03-08 11:57:24,353 INFO L218 NwaCegarLoop]: trace histogram [50, 50, 50, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-03-08 11:57:24,353 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable4 [2025-03-08 11:57:24,353 INFO L396 AbstractCegarLoop]: === Iteration 6 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-03-08 11:57:24,353 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-08 11:57:24,354 INFO L85 PathProgramCache]: Analyzing trace with hash -428971349, now seen corresponding path program 1 times [2025-03-08 11:57:24,354 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-08 11:57:24,354 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [16380776] [2025-03-08 11:57:24,354 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-08 11:57:24,354 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-08 11:57:24,367 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 307 statements into 1 equivalence classes. [2025-03-08 11:57:24,396 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 307 of 307 statements. [2025-03-08 11:57:24,396 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-08 11:57:24,397 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-08 11:57:25,616 INFO L134 CoverageAnalysis]: Checked inductivity of 4900 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 4900 trivial. 0 not checked. [2025-03-08 11:57:25,616 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-08 11:57:25,616 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [16380776] [2025-03-08 11:57:25,617 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [16380776] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-08 11:57:25,617 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-08 11:57:25,617 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [8] imperfect sequences [] total 8 [2025-03-08 11:57:25,617 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [976204377] [2025-03-08 11:57:25,617 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-08 11:57:25,618 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 8 states [2025-03-08 11:57:25,618 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-08 11:57:25,618 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2025-03-08 11:57:25,618 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=14, Invalid=42, Unknown=0, NotChecked=0, Total=56 [2025-03-08 11:57:25,619 INFO L87 Difference]: Start difference. First operand 314 states and 497 transitions. Second operand has 8 states, 8 states have (on average 7.5) internal successors, (60), 8 states have internal predecessors, (60), 1 states have call successors, (50), 1 states have call predecessors, (50), 1 states have return successors, (50), 1 states have call predecessors, (50), 1 states have call successors, (50) [2025-03-08 11:57:26,451 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-08 11:57:26,451 INFO L93 Difference]: Finished difference Result 761 states and 1218 transitions. [2025-03-08 11:57:26,451 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2025-03-08 11:57:26,451 INFO L78 Accepts]: Start accepts. Automaton has has 8 states, 8 states have (on average 7.5) internal successors, (60), 8 states have internal predecessors, (60), 1 states have call successors, (50), 1 states have call predecessors, (50), 1 states have return successors, (50), 1 states have call predecessors, (50), 1 states have call successors, (50) Word has length 307 [2025-03-08 11:57:26,452 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-08 11:57:26,455 INFO L225 Difference]: With dead ends: 761 [2025-03-08 11:57:26,455 INFO L226 Difference]: Without dead ends: 573 [2025-03-08 11:57:26,456 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 17 GetRequests, 5 SyntacticMatches, 0 SemanticMatches, 12 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 15 ImplicationChecksByTransitivity, 0.4s TimeCoverageRelationStatistics Valid=53, Invalid=129, Unknown=0, NotChecked=0, Total=182 [2025-03-08 11:57:26,456 INFO L435 NwaCegarLoop]: 190 mSDtfsCounter, 634 mSDsluCounter, 689 mSDsCounter, 0 mSdLazyCounter, 465 mSolverCounterSat, 154 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.5s Time, 0 mProtectedPredicate, 0 mProtectedAction, 634 SdHoareTripleChecker+Valid, 879 SdHoareTripleChecker+Invalid, 619 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 154 IncrementalHoareTripleChecker+Valid, 465 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.6s IncrementalHoareTripleChecker+Time [2025-03-08 11:57:26,456 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [634 Valid, 879 Invalid, 619 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [154 Valid, 465 Invalid, 0 Unknown, 0 Unchecked, 0.6s Time] [2025-03-08 11:57:26,457 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 573 states. [2025-03-08 11:57:26,480 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 573 to 318. [2025-03-08 11:57:26,481 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 318 states, 208 states have (on average 1.4134615384615385) internal successors, (294), 209 states have internal predecessors, (294), 104 states have call successors, (104), 5 states have call predecessors, (104), 5 states have return successors, (104), 103 states have call predecessors, (104), 104 states have call successors, (104) [2025-03-08 11:57:26,483 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 318 states to 318 states and 502 transitions. [2025-03-08 11:57:26,483 INFO L78 Accepts]: Start accepts. Automaton has 318 states and 502 transitions. Word has length 307 [2025-03-08 11:57:26,484 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-08 11:57:26,484 INFO L471 AbstractCegarLoop]: Abstraction has 318 states and 502 transitions. [2025-03-08 11:57:26,484 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 8 states, 8 states have (on average 7.5) internal successors, (60), 8 states have internal predecessors, (60), 1 states have call successors, (50), 1 states have call predecessors, (50), 1 states have return successors, (50), 1 states have call predecessors, (50), 1 states have call successors, (50) [2025-03-08 11:57:26,484 INFO L276 IsEmpty]: Start isEmpty. Operand 318 states and 502 transitions. [2025-03-08 11:57:26,485 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 308 [2025-03-08 11:57:26,485 INFO L210 NwaCegarLoop]: Found error trace [2025-03-08 11:57:26,485 INFO L218 NwaCegarLoop]: trace histogram [50, 50, 50, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-03-08 11:57:26,485 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable5 [2025-03-08 11:57:26,486 INFO L396 AbstractCegarLoop]: === Iteration 7 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-03-08 11:57:26,486 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-08 11:57:26,486 INFO L85 PathProgramCache]: Analyzing trace with hash 1542078187, now seen corresponding path program 1 times [2025-03-08 11:57:26,486 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-08 11:57:26,486 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1232568016] [2025-03-08 11:57:26,486 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-08 11:57:26,486 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-08 11:57:26,498 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 307 statements into 1 equivalence classes. [2025-03-08 11:57:26,581 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 307 of 307 statements. [2025-03-08 11:57:26,581 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-08 11:57:26,581 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-08 11:57:31,425 INFO L134 CoverageAnalysis]: Checked inductivity of 4900 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 4900 trivial. 0 not checked. [2025-03-08 11:57:31,425 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-08 11:57:31,425 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1232568016] [2025-03-08 11:57:31,425 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1232568016] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-08 11:57:31,425 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-08 11:57:31,425 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [9] imperfect sequences [] total 9 [2025-03-08 11:57:31,425 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1329903005] [2025-03-08 11:57:31,425 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-08 11:57:31,426 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 9 states [2025-03-08 11:57:31,426 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-08 11:57:31,426 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2025-03-08 11:57:31,426 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=26, Invalid=46, Unknown=0, NotChecked=0, Total=72 [2025-03-08 11:57:31,426 INFO L87 Difference]: Start difference. First operand 318 states and 502 transitions. Second operand has 9 states, 9 states have (on average 6.666666666666667) internal successors, (60), 9 states have internal predecessors, (60), 1 states have call successors, (50), 1 states have call predecessors, (50), 1 states have return successors, (50), 1 states have call predecessors, (50), 1 states have call successors, (50) [2025-03-08 11:57:32,574 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-08 11:57:32,574 INFO L93 Difference]: Finished difference Result 663 states and 1051 transitions. [2025-03-08 11:57:32,575 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2025-03-08 11:57:32,575 INFO L78 Accepts]: Start accepts. Automaton has has 9 states, 9 states have (on average 6.666666666666667) internal successors, (60), 9 states have internal predecessors, (60), 1 states have call successors, (50), 1 states have call predecessors, (50), 1 states have return successors, (50), 1 states have call predecessors, (50), 1 states have call successors, (50) Word has length 307 [2025-03-08 11:57:32,575 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-08 11:57:32,578 INFO L225 Difference]: With dead ends: 663 [2025-03-08 11:57:32,578 INFO L226 Difference]: Without dead ends: 475 [2025-03-08 11:57:32,579 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 15 GetRequests, 3 SyntacticMatches, 0 SemanticMatches, 12 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 10 ImplicationChecksByTransitivity, 1.4s TimeCoverageRelationStatistics Valid=71, Invalid=111, Unknown=0, NotChecked=0, Total=182 [2025-03-08 11:57:32,581 INFO L435 NwaCegarLoop]: 187 mSDtfsCounter, 641 mSDsluCounter, 574 mSDsCounter, 0 mSdLazyCounter, 152 mSolverCounterSat, 1 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.3s Time, 0 mProtectedPredicate, 0 mProtectedAction, 641 SdHoareTripleChecker+Valid, 761 SdHoareTripleChecker+Invalid, 153 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 1 IncrementalHoareTripleChecker+Valid, 152 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.4s IncrementalHoareTripleChecker+Time [2025-03-08 11:57:32,581 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [641 Valid, 761 Invalid, 153 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [1 Valid, 152 Invalid, 0 Unknown, 0 Unchecked, 0.4s Time] [2025-03-08 11:57:32,582 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 475 states. [2025-03-08 11:57:32,609 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 475 to 319. [2025-03-08 11:57:32,610 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 319 states, 209 states have (on average 1.4162679425837321) internal successors, (296), 210 states have internal predecessors, (296), 104 states have call successors, (104), 5 states have call predecessors, (104), 5 states have return successors, (104), 103 states have call predecessors, (104), 104 states have call successors, (104) [2025-03-08 11:57:32,612 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 319 states to 319 states and 504 transitions. [2025-03-08 11:57:32,613 INFO L78 Accepts]: Start accepts. Automaton has 319 states and 504 transitions. Word has length 307 [2025-03-08 11:57:32,613 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-08 11:57:32,613 INFO L471 AbstractCegarLoop]: Abstraction has 319 states and 504 transitions. [2025-03-08 11:57:32,613 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 9 states, 9 states have (on average 6.666666666666667) internal successors, (60), 9 states have internal predecessors, (60), 1 states have call successors, (50), 1 states have call predecessors, (50), 1 states have return successors, (50), 1 states have call predecessors, (50), 1 states have call successors, (50) [2025-03-08 11:57:32,614 INFO L276 IsEmpty]: Start isEmpty. Operand 319 states and 504 transitions. [2025-03-08 11:57:32,615 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 308 [2025-03-08 11:57:32,616 INFO L210 NwaCegarLoop]: Found error trace [2025-03-08 11:57:32,616 INFO L218 NwaCegarLoop]: trace histogram [50, 50, 50, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-03-08 11:57:32,616 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable6 [2025-03-08 11:57:32,616 INFO L396 AbstractCegarLoop]: === Iteration 8 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-03-08 11:57:32,617 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-08 11:57:32,617 INFO L85 PathProgramCache]: Analyzing trace with hash 1753429100, now seen corresponding path program 1 times [2025-03-08 11:57:32,617 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-08 11:57:32,617 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [609250203] [2025-03-08 11:57:32,617 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-08 11:57:32,617 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-08 11:57:32,627 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 307 statements into 1 equivalence classes. [2025-03-08 11:57:32,672 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 307 of 307 statements. [2025-03-08 11:57:32,673 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-08 11:57:32,673 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-08 11:57:40,509 INFO L134 CoverageAnalysis]: Checked inductivity of 4900 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 4900 trivial. 0 not checked. [2025-03-08 11:57:40,509 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-08 11:57:40,510 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [609250203] [2025-03-08 11:57:40,510 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [609250203] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-08 11:57:40,510 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-08 11:57:40,510 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [12] imperfect sequences [] total 12 [2025-03-08 11:57:40,510 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1704215488] [2025-03-08 11:57:40,510 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-08 11:57:40,510 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 12 states [2025-03-08 11:57:40,510 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-08 11:57:40,510 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 12 interpolants. [2025-03-08 11:57:40,511 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=46, Invalid=86, Unknown=0, NotChecked=0, Total=132 [2025-03-08 11:57:40,511 INFO L87 Difference]: Start difference. First operand 319 states and 504 transitions. Second operand has 12 states, 12 states have (on average 5.0) internal successors, (60), 12 states have internal predecessors, (60), 1 states have call successors, (50), 1 states have call predecessors, (50), 1 states have return successors, (50), 1 states have call predecessors, (50), 1 states have call successors, (50) [2025-03-08 11:57:41,688 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-08 11:57:41,689 INFO L93 Difference]: Finished difference Result 742 states and 1184 transitions. [2025-03-08 11:57:41,689 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 12 states. [2025-03-08 11:57:41,689 INFO L78 Accepts]: Start accepts. Automaton has has 12 states, 12 states have (on average 5.0) internal successors, (60), 12 states have internal predecessors, (60), 1 states have call successors, (50), 1 states have call predecessors, (50), 1 states have return successors, (50), 1 states have call predecessors, (50), 1 states have call successors, (50) Word has length 307 [2025-03-08 11:57:41,690 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-08 11:57:41,693 INFO L225 Difference]: With dead ends: 742 [2025-03-08 11:57:41,693 INFO L226 Difference]: Without dead ends: 522 [2025-03-08 11:57:41,694 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 18 GetRequests, 4 SyntacticMatches, 0 SemanticMatches, 14 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 25 ImplicationChecksByTransitivity, 1.5s TimeCoverageRelationStatistics Valid=74, Invalid=166, Unknown=0, NotChecked=0, Total=240 [2025-03-08 11:57:41,695 INFO L435 NwaCegarLoop]: 184 mSDtfsCounter, 359 mSDsluCounter, 821 mSDsCounter, 0 mSdLazyCounter, 541 mSolverCounterSat, 153 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.9s Time, 0 mProtectedPredicate, 0 mProtectedAction, 359 SdHoareTripleChecker+Valid, 1005 SdHoareTripleChecker+Invalid, 694 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 153 IncrementalHoareTripleChecker+Valid, 541 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.9s IncrementalHoareTripleChecker+Time [2025-03-08 11:57:41,695 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [359 Valid, 1005 Invalid, 694 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [153 Valid, 541 Invalid, 0 Unknown, 0 Unchecked, 0.9s Time] [2025-03-08 11:57:41,696 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 522 states. [2025-03-08 11:57:41,726 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 522 to 321. [2025-03-08 11:57:41,726 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 321 states, 211 states have (on average 1.4170616113744077) internal successors, (299), 212 states have internal predecessors, (299), 104 states have call successors, (104), 5 states have call predecessors, (104), 5 states have return successors, (104), 103 states have call predecessors, (104), 104 states have call successors, (104) [2025-03-08 11:57:41,729 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 321 states to 321 states and 507 transitions. [2025-03-08 11:57:41,729 INFO L78 Accepts]: Start accepts. Automaton has 321 states and 507 transitions. Word has length 307 [2025-03-08 11:57:41,730 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-08 11:57:41,730 INFO L471 AbstractCegarLoop]: Abstraction has 321 states and 507 transitions. [2025-03-08 11:57:41,730 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 12 states, 12 states have (on average 5.0) internal successors, (60), 12 states have internal predecessors, (60), 1 states have call successors, (50), 1 states have call predecessors, (50), 1 states have return successors, (50), 1 states have call predecessors, (50), 1 states have call successors, (50) [2025-03-08 11:57:41,730 INFO L276 IsEmpty]: Start isEmpty. Operand 321 states and 507 transitions. [2025-03-08 11:57:41,732 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 308 [2025-03-08 11:57:41,732 INFO L210 NwaCegarLoop]: Found error trace [2025-03-08 11:57:41,733 INFO L218 NwaCegarLoop]: trace histogram [50, 50, 50, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-03-08 11:57:41,733 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable7 [2025-03-08 11:57:41,733 INFO L396 AbstractCegarLoop]: === Iteration 9 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-03-08 11:57:41,733 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-08 11:57:41,733 INFO L85 PathProgramCache]: Analyzing trace with hash -495978102, now seen corresponding path program 1 times [2025-03-08 11:57:41,733 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-08 11:57:41,733 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [192832334] [2025-03-08 11:57:41,733 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-08 11:57:41,733 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-08 11:57:41,745 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 307 statements into 1 equivalence classes. [2025-03-08 11:57:41,762 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 307 of 307 statements. [2025-03-08 11:57:41,762 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-08 11:57:41,763 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-08 11:57:42,143 INFO L134 CoverageAnalysis]: Checked inductivity of 4900 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 4900 trivial. 0 not checked. [2025-03-08 11:57:42,143 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-08 11:57:42,143 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [192832334] [2025-03-08 11:57:42,143 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [192832334] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-08 11:57:42,143 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-08 11:57:42,143 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2025-03-08 11:57:42,143 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [255645154] [2025-03-08 11:57:42,143 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-08 11:57:42,143 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 7 states [2025-03-08 11:57:42,143 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-08 11:57:42,144 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2025-03-08 11:57:42,144 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=12, Invalid=30, Unknown=0, NotChecked=0, Total=42 [2025-03-08 11:57:42,144 INFO L87 Difference]: Start difference. First operand 321 states and 507 transitions. Second operand has 7 states, 7 states have (on average 8.571428571428571) internal successors, (60), 7 states have internal predecessors, (60), 1 states have call successors, (50), 1 states have call predecessors, (50), 1 states have return successors, (50), 1 states have call predecessors, (50), 1 states have call successors, (50) [2025-03-08 11:57:42,572 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-08 11:57:42,572 INFO L93 Difference]: Finished difference Result 656 states and 1048 transitions. [2025-03-08 11:57:42,572 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2025-03-08 11:57:42,573 INFO L78 Accepts]: Start accepts. Automaton has has 7 states, 7 states have (on average 8.571428571428571) internal successors, (60), 7 states have internal predecessors, (60), 1 states have call successors, (50), 1 states have call predecessors, (50), 1 states have return successors, (50), 1 states have call predecessors, (50), 1 states have call successors, (50) Word has length 307 [2025-03-08 11:57:42,573 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-08 11:57:42,575 INFO L225 Difference]: With dead ends: 656 [2025-03-08 11:57:42,575 INFO L226 Difference]: Without dead ends: 436 [2025-03-08 11:57:42,576 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 13 GetRequests, 4 SyntacticMatches, 0 SemanticMatches, 9 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 5 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=36, Invalid=74, Unknown=0, NotChecked=0, Total=110 [2025-03-08 11:57:42,576 INFO L435 NwaCegarLoop]: 196 mSDtfsCounter, 255 mSDsluCounter, 566 mSDsCounter, 0 mSdLazyCounter, 275 mSolverCounterSat, 151 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.3s Time, 0 mProtectedPredicate, 0 mProtectedAction, 255 SdHoareTripleChecker+Valid, 762 SdHoareTripleChecker+Invalid, 426 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 151 IncrementalHoareTripleChecker+Valid, 275 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.3s IncrementalHoareTripleChecker+Time [2025-03-08 11:57:42,577 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [255 Valid, 762 Invalid, 426 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [151 Valid, 275 Invalid, 0 Unknown, 0 Unchecked, 0.3s Time] [2025-03-08 11:57:42,577 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 436 states. [2025-03-08 11:57:42,602 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 436 to 319. [2025-03-08 11:57:42,602 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 319 states, 209 states have (on average 1.4162679425837321) internal successors, (296), 210 states have internal predecessors, (296), 104 states have call successors, (104), 5 states have call predecessors, (104), 5 states have return successors, (104), 103 states have call predecessors, (104), 104 states have call successors, (104) [2025-03-08 11:57:42,604 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 319 states to 319 states and 504 transitions. [2025-03-08 11:57:42,604 INFO L78 Accepts]: Start accepts. Automaton has 319 states and 504 transitions. Word has length 307 [2025-03-08 11:57:42,605 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-08 11:57:42,605 INFO L471 AbstractCegarLoop]: Abstraction has 319 states and 504 transitions. [2025-03-08 11:57:42,605 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 7 states, 7 states have (on average 8.571428571428571) internal successors, (60), 7 states have internal predecessors, (60), 1 states have call successors, (50), 1 states have call predecessors, (50), 1 states have return successors, (50), 1 states have call predecessors, (50), 1 states have call successors, (50) [2025-03-08 11:57:42,605 INFO L276 IsEmpty]: Start isEmpty. Operand 319 states and 504 transitions. [2025-03-08 11:57:42,606 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 309 [2025-03-08 11:57:42,606 INFO L210 NwaCegarLoop]: Found error trace [2025-03-08 11:57:42,606 INFO L218 NwaCegarLoop]: trace histogram [50, 50, 50, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-03-08 11:57:42,607 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable8 [2025-03-08 11:57:42,607 INFO L396 AbstractCegarLoop]: === Iteration 10 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-03-08 11:57:42,607 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-08 11:57:42,607 INFO L85 PathProgramCache]: Analyzing trace with hash 1215377800, now seen corresponding path program 1 times [2025-03-08 11:57:42,607 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-08 11:57:42,607 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [380072233] [2025-03-08 11:57:42,607 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-08 11:57:42,608 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-08 11:57:42,616 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 308 statements into 1 equivalence classes. [2025-03-08 11:57:42,665 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 308 of 308 statements. [2025-03-08 11:57:42,665 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-08 11:57:42,665 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-08 11:57:46,316 INFO L134 CoverageAnalysis]: Checked inductivity of 4900 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 4900 trivial. 0 not checked. [2025-03-08 11:57:46,316 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-08 11:57:46,316 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [380072233] [2025-03-08 11:57:46,317 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [380072233] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-08 11:57:46,317 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-08 11:57:46,317 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [13] imperfect sequences [] total 13 [2025-03-08 11:57:46,317 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [925735099] [2025-03-08 11:57:46,317 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-08 11:57:46,317 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 13 states [2025-03-08 11:57:46,317 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-08 11:57:46,317 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 13 interpolants. [2025-03-08 11:57:46,317 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=31, Invalid=125, Unknown=0, NotChecked=0, Total=156 [2025-03-08 11:57:46,318 INFO L87 Difference]: Start difference. First operand 319 states and 504 transitions. Second operand has 13 states, 13 states have (on average 4.6923076923076925) internal successors, (61), 13 states have internal predecessors, (61), 2 states have call successors, (50), 1 states have call predecessors, (50), 1 states have return successors, (50), 1 states have call predecessors, (50), 2 states have call successors, (50) [2025-03-08 11:57:47,923 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-08 11:57:47,924 INFO L93 Difference]: Finished difference Result 1002 states and 1612 transitions. [2025-03-08 11:57:47,924 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 13 states. [2025-03-08 11:57:47,924 INFO L78 Accepts]: Start accepts. Automaton has has 13 states, 13 states have (on average 4.6923076923076925) internal successors, (61), 13 states have internal predecessors, (61), 2 states have call successors, (50), 1 states have call predecessors, (50), 1 states have return successors, (50), 1 states have call predecessors, (50), 2 states have call successors, (50) Word has length 308 [2025-03-08 11:57:47,925 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-08 11:57:47,928 INFO L225 Difference]: With dead ends: 1002 [2025-03-08 11:57:47,929 INFO L226 Difference]: Without dead ends: 782 [2025-03-08 11:57:47,929 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 25 GetRequests, 3 SyntacticMatches, 0 SemanticMatches, 22 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 80 ImplicationChecksByTransitivity, 0.9s TimeCoverageRelationStatistics Valid=143, Invalid=409, Unknown=0, NotChecked=0, Total=552 [2025-03-08 11:57:47,930 INFO L435 NwaCegarLoop]: 187 mSDtfsCounter, 977 mSDsluCounter, 1319 mSDsCounter, 0 mSdLazyCounter, 933 mSolverCounterSat, 202 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.9s Time, 0 mProtectedPredicate, 0 mProtectedAction, 977 SdHoareTripleChecker+Valid, 1506 SdHoareTripleChecker+Invalid, 1135 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 202 IncrementalHoareTripleChecker+Valid, 933 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 1.0s IncrementalHoareTripleChecker+Time [2025-03-08 11:57:47,930 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [977 Valid, 1506 Invalid, 1135 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [202 Valid, 933 Invalid, 0 Unknown, 0 Unchecked, 1.0s Time] [2025-03-08 11:57:47,931 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 782 states. [2025-03-08 11:57:47,959 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 782 to 324. [2025-03-08 11:57:47,961 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 324 states, 214 states have (on average 1.4205607476635513) internal successors, (304), 215 states have internal predecessors, (304), 104 states have call successors, (104), 5 states have call predecessors, (104), 5 states have return successors, (104), 103 states have call predecessors, (104), 104 states have call successors, (104) [2025-03-08 11:57:47,962 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 324 states to 324 states and 512 transitions. [2025-03-08 11:57:47,963 INFO L78 Accepts]: Start accepts. Automaton has 324 states and 512 transitions. Word has length 308 [2025-03-08 11:57:47,963 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-08 11:57:47,964 INFO L471 AbstractCegarLoop]: Abstraction has 324 states and 512 transitions. [2025-03-08 11:57:47,964 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 13 states, 13 states have (on average 4.6923076923076925) internal successors, (61), 13 states have internal predecessors, (61), 2 states have call successors, (50), 1 states have call predecessors, (50), 1 states have return successors, (50), 1 states have call predecessors, (50), 2 states have call successors, (50) [2025-03-08 11:57:47,964 INFO L276 IsEmpty]: Start isEmpty. Operand 324 states and 512 transitions. [2025-03-08 11:57:47,966 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 309 [2025-03-08 11:57:47,966 INFO L210 NwaCegarLoop]: Found error trace [2025-03-08 11:57:47,966 INFO L218 NwaCegarLoop]: trace histogram [50, 50, 50, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-03-08 11:57:47,966 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable9 [2025-03-08 11:57:47,967 INFO L396 AbstractCegarLoop]: === Iteration 11 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-03-08 11:57:47,967 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-08 11:57:47,967 INFO L85 PathProgramCache]: Analyzing trace with hash 806553575, now seen corresponding path program 1 times [2025-03-08 11:57:47,967 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-08 11:57:47,967 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [232470338] [2025-03-08 11:57:47,967 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-08 11:57:47,967 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-08 11:57:47,977 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 308 statements into 1 equivalence classes. [2025-03-08 11:57:48,014 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 308 of 308 statements. [2025-03-08 11:57:48,014 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-08 11:57:48,014 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-08 11:57:51,659 INFO L134 CoverageAnalysis]: Checked inductivity of 4900 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 4900 trivial. 0 not checked. [2025-03-08 11:57:51,659 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-08 11:57:51,659 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [232470338] [2025-03-08 11:57:51,659 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [232470338] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-08 11:57:51,659 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-08 11:57:51,659 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [11] imperfect sequences [] total 11 [2025-03-08 11:57:51,660 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1504518830] [2025-03-08 11:57:51,660 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-08 11:57:51,660 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 11 states [2025-03-08 11:57:51,660 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-08 11:57:51,661 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 11 interpolants. [2025-03-08 11:57:51,661 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=30, Invalid=80, Unknown=0, NotChecked=0, Total=110 [2025-03-08 11:57:51,661 INFO L87 Difference]: Start difference. First operand 324 states and 512 transitions. Second operand has 11 states, 11 states have (on average 5.545454545454546) internal successors, (61), 11 states have internal predecessors, (61), 1 states have call successors, (50), 1 states have call predecessors, (50), 1 states have return successors, (50), 1 states have call predecessors, (50), 1 states have call successors, (50) [2025-03-08 11:57:53,273 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-08 11:57:53,274 INFO L93 Difference]: Finished difference Result 854 states and 1370 transitions. [2025-03-08 11:57:53,274 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 12 states. [2025-03-08 11:57:53,274 INFO L78 Accepts]: Start accepts. Automaton has has 11 states, 11 states have (on average 5.545454545454546) internal successors, (61), 11 states have internal predecessors, (61), 1 states have call successors, (50), 1 states have call predecessors, (50), 1 states have return successors, (50), 1 states have call predecessors, (50), 1 states have call successors, (50) Word has length 308 [2025-03-08 11:57:53,275 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-08 11:57:53,277 INFO L225 Difference]: With dead ends: 854 [2025-03-08 11:57:53,278 INFO L226 Difference]: Without dead ends: 634 [2025-03-08 11:57:53,278 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 23 GetRequests, 6 SyntacticMatches, 0 SemanticMatches, 17 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 36 ImplicationChecksByTransitivity, 1.2s TimeCoverageRelationStatistics Valid=94, Invalid=248, Unknown=0, NotChecked=0, Total=342 [2025-03-08 11:57:53,280 INFO L435 NwaCegarLoop]: 276 mSDtfsCounter, 618 mSDsluCounter, 1079 mSDsCounter, 0 mSdLazyCounter, 670 mSolverCounterSat, 153 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.7s Time, 0 mProtectedPredicate, 0 mProtectedAction, 618 SdHoareTripleChecker+Valid, 1355 SdHoareTripleChecker+Invalid, 823 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 153 IncrementalHoareTripleChecker+Valid, 670 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.8s IncrementalHoareTripleChecker+Time [2025-03-08 11:57:53,280 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [618 Valid, 1355 Invalid, 823 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [153 Valid, 670 Invalid, 0 Unknown, 0 Unchecked, 0.8s Time] [2025-03-08 11:57:53,281 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 634 states. [2025-03-08 11:57:53,308 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 634 to 358. [2025-03-08 11:57:53,309 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 358 states, 248 states have (on average 1.4556451612903225) internal successors, (361), 249 states have internal predecessors, (361), 104 states have call successors, (104), 5 states have call predecessors, (104), 5 states have return successors, (104), 103 states have call predecessors, (104), 104 states have call successors, (104) [2025-03-08 11:57:53,310 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 358 states to 358 states and 569 transitions. [2025-03-08 11:57:53,311 INFO L78 Accepts]: Start accepts. Automaton has 358 states and 569 transitions. Word has length 308 [2025-03-08 11:57:53,311 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-08 11:57:53,311 INFO L471 AbstractCegarLoop]: Abstraction has 358 states and 569 transitions. [2025-03-08 11:57:53,312 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 11 states, 11 states have (on average 5.545454545454546) internal successors, (61), 11 states have internal predecessors, (61), 1 states have call successors, (50), 1 states have call predecessors, (50), 1 states have return successors, (50), 1 states have call predecessors, (50), 1 states have call successors, (50) [2025-03-08 11:57:53,312 INFO L276 IsEmpty]: Start isEmpty. Operand 358 states and 569 transitions. [2025-03-08 11:57:53,313 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 309 [2025-03-08 11:57:53,313 INFO L210 NwaCegarLoop]: Found error trace [2025-03-08 11:57:53,313 INFO L218 NwaCegarLoop]: trace histogram [50, 50, 50, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-03-08 11:57:53,314 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable10 [2025-03-08 11:57:53,314 INFO L396 AbstractCegarLoop]: === Iteration 12 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-03-08 11:57:53,314 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-08 11:57:53,314 INFO L85 PathProgramCache]: Analyzing trace with hash 1426728713, now seen corresponding path program 1 times [2025-03-08 11:57:53,314 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-08 11:57:53,314 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1211141781] [2025-03-08 11:57:53,314 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-08 11:57:53,314 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-08 11:57:53,325 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 308 statements into 1 equivalence classes. [2025-03-08 11:57:53,367 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 308 of 308 statements. [2025-03-08 11:57:53,367 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-08 11:57:53,368 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-08 11:57:58,576 INFO L134 CoverageAnalysis]: Checked inductivity of 4900 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 4900 trivial. 0 not checked. [2025-03-08 11:57:58,576 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-08 11:57:58,576 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1211141781] [2025-03-08 11:57:58,576 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1211141781] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-08 11:57:58,577 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-08 11:57:58,577 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [13] imperfect sequences [] total 13 [2025-03-08 11:57:58,577 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [638719749] [2025-03-08 11:57:58,577 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-08 11:57:58,577 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 13 states [2025-03-08 11:57:58,577 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-08 11:57:58,578 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 13 interpolants. [2025-03-08 11:57:58,578 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=30, Invalid=126, Unknown=0, NotChecked=0, Total=156 [2025-03-08 11:57:58,578 INFO L87 Difference]: Start difference. First operand 358 states and 569 transitions. Second operand has 13 states, 13 states have (on average 4.6923076923076925) internal successors, (61), 13 states have internal predecessors, (61), 1 states have call successors, (50), 1 states have call predecessors, (50), 1 states have return successors, (50), 1 states have call predecessors, (50), 1 states have call successors, (50) [2025-03-08 11:58:02,345 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-08 11:58:02,346 INFO L93 Difference]: Finished difference Result 1004 states and 1611 transitions. [2025-03-08 11:58:02,346 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 22 states. [2025-03-08 11:58:02,346 INFO L78 Accepts]: Start accepts. Automaton has has 13 states, 13 states have (on average 4.6923076923076925) internal successors, (61), 13 states have internal predecessors, (61), 1 states have call successors, (50), 1 states have call predecessors, (50), 1 states have return successors, (50), 1 states have call predecessors, (50), 1 states have call successors, (50) Word has length 308 [2025-03-08 11:58:02,347 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-08 11:58:02,349 INFO L225 Difference]: With dead ends: 1004 [2025-03-08 11:58:02,349 INFO L226 Difference]: Without dead ends: 784 [2025-03-08 11:58:02,351 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 36 GetRequests, 5 SyntacticMatches, 0 SemanticMatches, 31 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 191 ImplicationChecksByTransitivity, 3.0s TimeCoverageRelationStatistics Valid=232, Invalid=824, Unknown=0, NotChecked=0, Total=1056 [2025-03-08 11:58:02,351 INFO L435 NwaCegarLoop]: 223 mSDtfsCounter, 982 mSDsluCounter, 1152 mSDsCounter, 0 mSdLazyCounter, 855 mSolverCounterSat, 153 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 1.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 982 SdHoareTripleChecker+Valid, 1375 SdHoareTripleChecker+Invalid, 1008 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 153 IncrementalHoareTripleChecker+Valid, 855 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 1.2s IncrementalHoareTripleChecker+Time [2025-03-08 11:58:02,351 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [982 Valid, 1375 Invalid, 1008 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [153 Valid, 855 Invalid, 0 Unknown, 0 Unchecked, 1.2s Time] [2025-03-08 11:58:02,352 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 784 states. [2025-03-08 11:58:02,381 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 784 to 359. [2025-03-08 11:58:02,382 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 359 states, 249 states have (on average 1.4578313253012047) internal successors, (363), 250 states have internal predecessors, (363), 104 states have call successors, (104), 5 states have call predecessors, (104), 5 states have return successors, (104), 103 states have call predecessors, (104), 104 states have call successors, (104) [2025-03-08 11:58:02,383 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 359 states to 359 states and 571 transitions. [2025-03-08 11:58:02,384 INFO L78 Accepts]: Start accepts. Automaton has 359 states and 571 transitions. Word has length 308 [2025-03-08 11:58:02,385 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-08 11:58:02,385 INFO L471 AbstractCegarLoop]: Abstraction has 359 states and 571 transitions. [2025-03-08 11:58:02,385 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 13 states, 13 states have (on average 4.6923076923076925) internal successors, (61), 13 states have internal predecessors, (61), 1 states have call successors, (50), 1 states have call predecessors, (50), 1 states have return successors, (50), 1 states have call predecessors, (50), 1 states have call successors, (50) [2025-03-08 11:58:02,385 INFO L276 IsEmpty]: Start isEmpty. Operand 359 states and 571 transitions. [2025-03-08 11:58:02,386 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 309 [2025-03-08 11:58:02,386 INFO L210 NwaCegarLoop]: Found error trace [2025-03-08 11:58:02,386 INFO L218 NwaCegarLoop]: trace histogram [50, 50, 50, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-03-08 11:58:02,386 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable11 [2025-03-08 11:58:02,386 INFO L396 AbstractCegarLoop]: === Iteration 13 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-03-08 11:58:02,387 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-08 11:58:02,387 INFO L85 PathProgramCache]: Analyzing trace with hash 1017904488, now seen corresponding path program 1 times [2025-03-08 11:58:02,387 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-08 11:58:02,387 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1324579990] [2025-03-08 11:58:02,388 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-08 11:58:02,388 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-08 11:58:02,397 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 308 statements into 1 equivalence classes. [2025-03-08 11:58:02,430 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 308 of 308 statements. [2025-03-08 11:58:02,431 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-08 11:58:02,431 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-08 11:58:06,904 INFO L134 CoverageAnalysis]: Checked inductivity of 4900 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 4900 trivial. 0 not checked. [2025-03-08 11:58:06,904 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-08 11:58:06,904 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1324579990] [2025-03-08 11:58:06,904 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1324579990] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-08 11:58:06,904 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-08 11:58:06,905 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [12] imperfect sequences [] total 12 [2025-03-08 11:58:06,905 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1874483250] [2025-03-08 11:58:06,905 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-08 11:58:06,905 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 12 states [2025-03-08 11:58:06,905 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-08 11:58:06,905 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 12 interpolants. [2025-03-08 11:58:06,905 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=28, Invalid=104, Unknown=0, NotChecked=0, Total=132 [2025-03-08 11:58:06,906 INFO L87 Difference]: Start difference. First operand 359 states and 571 transitions. Second operand has 12 states, 12 states have (on average 5.083333333333333) internal successors, (61), 12 states have internal predecessors, (61), 2 states have call successors, (50), 1 states have call predecessors, (50), 1 states have return successors, (50), 1 states have call predecessors, (50), 2 states have call successors, (50) [2025-03-08 11:58:08,530 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-08 11:58:08,530 INFO L93 Difference]: Finished difference Result 885 states and 1422 transitions. [2025-03-08 11:58:08,531 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 12 states. [2025-03-08 11:58:08,531 INFO L78 Accepts]: Start accepts. Automaton has has 12 states, 12 states have (on average 5.083333333333333) internal successors, (61), 12 states have internal predecessors, (61), 2 states have call successors, (50), 1 states have call predecessors, (50), 1 states have return successors, (50), 1 states have call predecessors, (50), 2 states have call successors, (50) Word has length 308 [2025-03-08 11:58:08,531 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-08 11:58:08,535 INFO L225 Difference]: With dead ends: 885 [2025-03-08 11:58:08,535 INFO L226 Difference]: Without dead ends: 665 [2025-03-08 11:58:08,536 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 24 GetRequests, 4 SyntacticMatches, 1 SemanticMatches, 19 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 46 ImplicationChecksByTransitivity, 1.1s TimeCoverageRelationStatistics Valid=106, Invalid=314, Unknown=0, NotChecked=0, Total=420 [2025-03-08 11:58:08,536 INFO L435 NwaCegarLoop]: 276 mSDtfsCounter, 890 mSDsluCounter, 1080 mSDsCounter, 0 mSdLazyCounter, 673 mSolverCounterSat, 254 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.7s Time, 0 mProtectedPredicate, 0 mProtectedAction, 890 SdHoareTripleChecker+Valid, 1356 SdHoareTripleChecker+Invalid, 927 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 254 IncrementalHoareTripleChecker+Valid, 673 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.8s IncrementalHoareTripleChecker+Time [2025-03-08 11:58:08,537 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [890 Valid, 1356 Invalid, 927 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [254 Valid, 673 Invalid, 0 Unknown, 0 Unchecked, 0.8s Time] [2025-03-08 11:58:08,537 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 665 states. [2025-03-08 11:58:08,566 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 665 to 358. [2025-03-08 11:58:08,567 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 358 states, 248 states have (on average 1.4556451612903225) internal successors, (361), 249 states have internal predecessors, (361), 104 states have call successors, (104), 5 states have call predecessors, (104), 5 states have return successors, (104), 103 states have call predecessors, (104), 104 states have call successors, (104) [2025-03-08 11:58:08,569 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 358 states to 358 states and 569 transitions. [2025-03-08 11:58:08,570 INFO L78 Accepts]: Start accepts. Automaton has 358 states and 569 transitions. Word has length 308 [2025-03-08 11:58:08,571 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-08 11:58:08,571 INFO L471 AbstractCegarLoop]: Abstraction has 358 states and 569 transitions. [2025-03-08 11:58:08,571 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 12 states, 12 states have (on average 5.083333333333333) internal successors, (61), 12 states have internal predecessors, (61), 2 states have call successors, (50), 1 states have call predecessors, (50), 1 states have return successors, (50), 1 states have call predecessors, (50), 2 states have call successors, (50) [2025-03-08 11:58:08,571 INFO L276 IsEmpty]: Start isEmpty. Operand 358 states and 569 transitions. [2025-03-08 11:58:08,572 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 309 [2025-03-08 11:58:08,572 INFO L210 NwaCegarLoop]: Found error trace [2025-03-08 11:58:08,573 INFO L218 NwaCegarLoop]: trace histogram [50, 50, 50, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-03-08 11:58:08,573 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable12 [2025-03-08 11:58:08,573 INFO L396 AbstractCegarLoop]: === Iteration 14 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-03-08 11:58:08,573 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-08 11:58:08,573 INFO L85 PathProgramCache]: Analyzing trace with hash 1148371047, now seen corresponding path program 1 times [2025-03-08 11:58:08,573 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-08 11:58:08,573 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [876887729] [2025-03-08 11:58:08,574 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-08 11:58:08,574 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-08 11:58:08,583 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 308 statements into 1 equivalence classes. [2025-03-08 11:58:08,624 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 308 of 308 statements. [2025-03-08 11:58:08,624 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-08 11:58:08,624 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-08 11:58:14,417 INFO L134 CoverageAnalysis]: Checked inductivity of 4900 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 4900 trivial. 0 not checked. [2025-03-08 11:58:14,417 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-08 11:58:14,417 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [876887729] [2025-03-08 11:58:14,417 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [876887729] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-08 11:58:14,417 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-08 11:58:14,417 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [12] imperfect sequences [] total 12 [2025-03-08 11:58:14,417 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [828682838] [2025-03-08 11:58:14,417 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-08 11:58:14,418 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 12 states [2025-03-08 11:58:14,418 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-08 11:58:14,419 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 12 interpolants. [2025-03-08 11:58:14,419 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=34, Invalid=98, Unknown=0, NotChecked=0, Total=132 [2025-03-08 11:58:14,419 INFO L87 Difference]: Start difference. First operand 358 states and 569 transitions. Second operand has 12 states, 12 states have (on average 5.083333333333333) internal successors, (61), 12 states have internal predecessors, (61), 1 states have call successors, (50), 1 states have call predecessors, (50), 1 states have return successors, (50), 1 states have call predecessors, (50), 1 states have call successors, (50) [2025-03-08 11:58:15,864 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-08 11:58:15,864 INFO L93 Difference]: Finished difference Result 886 states and 1422 transitions. [2025-03-08 11:58:15,864 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 12 states. [2025-03-08 11:58:15,865 INFO L78 Accepts]: Start accepts. Automaton has has 12 states, 12 states have (on average 5.083333333333333) internal successors, (61), 12 states have internal predecessors, (61), 1 states have call successors, (50), 1 states have call predecessors, (50), 1 states have return successors, (50), 1 states have call predecessors, (50), 1 states have call successors, (50) Word has length 308 [2025-03-08 11:58:15,865 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-08 11:58:15,868 INFO L225 Difference]: With dead ends: 886 [2025-03-08 11:58:15,868 INFO L226 Difference]: Without dead ends: 666 [2025-03-08 11:58:15,868 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 24 GetRequests, 5 SyntacticMatches, 0 SemanticMatches, 19 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 49 ImplicationChecksByTransitivity, 1.0s TimeCoverageRelationStatistics Valid=113, Invalid=307, Unknown=0, NotChecked=0, Total=420 [2025-03-08 11:58:15,869 INFO L435 NwaCegarLoop]: 181 mSDtfsCounter, 658 mSDsluCounter, 917 mSDsCounter, 0 mSdLazyCounter, 717 mSolverCounterSat, 153 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.8s Time, 0 mProtectedPredicate, 0 mProtectedAction, 658 SdHoareTripleChecker+Valid, 1098 SdHoareTripleChecker+Invalid, 870 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 153 IncrementalHoareTripleChecker+Valid, 717 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.9s IncrementalHoareTripleChecker+Time [2025-03-08 11:58:15,869 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [658 Valid, 1098 Invalid, 870 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [153 Valid, 717 Invalid, 0 Unknown, 0 Unchecked, 0.9s Time] [2025-03-08 11:58:15,870 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 666 states. [2025-03-08 11:58:15,900 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 666 to 357. [2025-03-08 11:58:15,901 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 357 states, 247 states have (on average 1.4534412955465588) internal successors, (359), 248 states have internal predecessors, (359), 104 states have call successors, (104), 5 states have call predecessors, (104), 5 states have return successors, (104), 103 states have call predecessors, (104), 104 states have call successors, (104) [2025-03-08 11:58:15,902 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 357 states to 357 states and 567 transitions. [2025-03-08 11:58:15,903 INFO L78 Accepts]: Start accepts. Automaton has 357 states and 567 transitions. Word has length 308 [2025-03-08 11:58:15,903 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-08 11:58:15,903 INFO L471 AbstractCegarLoop]: Abstraction has 357 states and 567 transitions. [2025-03-08 11:58:15,904 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 12 states, 12 states have (on average 5.083333333333333) internal successors, (61), 12 states have internal predecessors, (61), 1 states have call successors, (50), 1 states have call predecessors, (50), 1 states have return successors, (50), 1 states have call predecessors, (50), 1 states have call successors, (50) [2025-03-08 11:58:15,904 INFO L276 IsEmpty]: Start isEmpty. Operand 357 states and 567 transitions. [2025-03-08 11:58:15,905 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 309 [2025-03-08 11:58:15,905 INFO L210 NwaCegarLoop]: Found error trace [2025-03-08 11:58:15,905 INFO L218 NwaCegarLoop]: trace histogram [50, 50, 50, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-03-08 11:58:15,905 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable13 [2025-03-08 11:58:15,905 INFO L396 AbstractCegarLoop]: === Iteration 15 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-03-08 11:58:15,906 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-08 11:58:15,906 INFO L85 PathProgramCache]: Analyzing trace with hash 1359721960, now seen corresponding path program 1 times [2025-03-08 11:58:15,906 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-08 11:58:15,906 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1204387724] [2025-03-08 11:58:15,906 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-08 11:58:15,906 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-08 11:58:15,916 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 308 statements into 1 equivalence classes. [2025-03-08 11:58:15,954 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 308 of 308 statements. [2025-03-08 11:58:15,954 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-08 11:58:15,954 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat