./Ultimate.py --spec ../sv-benchmarks/c/properties/unreach-call.prp --file ../sv-benchmarks/c/hardness-nfm22/hardness_codestructure_dependencies_file-81.i --full-output --architecture 32bit -------------------------------------------------------------------------------- Checking for ERROR reachability Using default analysis Version c00e63dc Calling Ultimate with: /root/.sdkman/candidates/java/21.0.5-tem/bin/java -Dosgi.configuration.area=/storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/data/config -Xmx15G -Xms4m -jar /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/plugins/org.eclipse.equinox.launcher_1.6.800.v20240513-1750.jar -data @noDefault -ultimatedata /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/data -tc /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/config/AutomizerReach.xml -i ../sv-benchmarks/c/hardness-nfm22/hardness_codestructure_dependencies_file-81.i -s /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/config/svcomp-Reach-32bit-Automizer_Default.epf --cacsl2boogietranslator.entry.function main --witnessprinter.witness.directory /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux --witnessprinter.witness.filename witness --witnessprinter.write.witness.besides.input.file false --witnessprinter.graph.data.specification CHECK( init(main()), LTL(G ! call(reach_error())) ) --witnessprinter.graph.data.producer Automizer --witnessprinter.graph.data.architecture 32bit --witnessprinter.graph.data.programhash 1035d962e39280c92969b9f7066ecadbc22a9f715d97d0ee182811f942c88e9b --- Real Ultimate output --- This is Ultimate 0.3.0-?-c00e63d-m [2025-02-05 20:26:19,248 INFO L188 SettingsManager]: Resetting all preferences to default values... [2025-02-05 20:26:19,284 INFO L114 SettingsManager]: Loading settings from /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/config/svcomp-Reach-32bit-Automizer_Default.epf [2025-02-05 20:26:19,288 WARN L101 SettingsManager]: Preference file contains the following unknown settings: [2025-02-05 20:26:19,288 WARN L103 SettingsManager]: * de.uni_freiburg.informatik.ultimate.core.Log level for class [2025-02-05 20:26:19,302 INFO L130 SettingsManager]: Preferences different from defaults after loading the file: [2025-02-05 20:26:19,302 INFO L151 SettingsManager]: Preferences of UltimateCore differ from their defaults: [2025-02-05 20:26:19,302 INFO L153 SettingsManager]: * Log level for class=de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher=ERROR; [2025-02-05 20:26:19,303 INFO L151 SettingsManager]: Preferences of Boogie Preprocessor differ from their defaults: [2025-02-05 20:26:19,303 INFO L153 SettingsManager]: * Use memory slicer=true [2025-02-05 20:26:19,303 INFO L151 SettingsManager]: Preferences of Boogie Procedure Inliner differ from their defaults: [2025-02-05 20:26:19,303 INFO L153 SettingsManager]: * Ignore calls to procedures called more than once=ONLY_FOR_SEQUENTIAL_PROGRAMS [2025-02-05 20:26:19,303 INFO L151 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2025-02-05 20:26:19,303 INFO L153 SettingsManager]: * Create parallel compositions if possible=false [2025-02-05 20:26:19,303 INFO L153 SettingsManager]: * Use SBE=true [2025-02-05 20:26:19,304 INFO L151 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2025-02-05 20:26:19,304 INFO L153 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2025-02-05 20:26:19,304 INFO L153 SettingsManager]: * sizeof long=4 [2025-02-05 20:26:19,304 INFO L153 SettingsManager]: * Overapproximate operations on floating types=true [2025-02-05 20:26:19,304 INFO L153 SettingsManager]: * sizeof POINTER=4 [2025-02-05 20:26:19,304 INFO L153 SettingsManager]: * Check division by zero=IGNORE [2025-02-05 20:26:19,304 INFO L153 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2025-02-05 20:26:19,304 INFO L153 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2025-02-05 20:26:19,304 INFO L153 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2025-02-05 20:26:19,304 INFO L153 SettingsManager]: * sizeof long double=12 [2025-02-05 20:26:19,304 INFO L153 SettingsManager]: * Check if freed pointer was valid=false [2025-02-05 20:26:19,305 INFO L153 SettingsManager]: * Behaviour of calls to undefined functions=OVERAPPROXIMATE_BEHAVIOUR [2025-02-05 20:26:19,305 INFO L153 SettingsManager]: * Use constant arrays=true [2025-02-05 20:26:19,305 INFO L151 SettingsManager]: Preferences of IcfgBuilder differ from their defaults: [2025-02-05 20:26:19,305 INFO L153 SettingsManager]: * Size of a code block=SequenceOfStatements [2025-02-05 20:26:19,305 INFO L153 SettingsManager]: * Only consider context switches at boundaries of atomic blocks=true [2025-02-05 20:26:19,305 INFO L153 SettingsManager]: * SMT solver=External_DefaultMode [2025-02-05 20:26:19,305 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2025-02-05 20:26:19,305 INFO L151 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2025-02-05 20:26:19,305 INFO L153 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2025-02-05 20:26:19,305 INFO L153 SettingsManager]: * Compute procedure contracts=false [2025-02-05 20:26:19,305 INFO L153 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopHeads [2025-02-05 20:26:19,306 INFO L153 SettingsManager]: * Trace refinement strategy=CAMEL [2025-02-05 20:26:19,306 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2025-02-05 20:26:19,306 INFO L153 SettingsManager]: * Apply one-shot large block encoding in concurrent analysis=false [2025-02-05 20:26:19,306 INFO L153 SettingsManager]: * Automaton type used in concurrency analysis=PETRI_NET [2025-02-05 20:26:19,306 INFO L153 SettingsManager]: * Order on configurations for Petri net unfoldings=DBO [2025-02-05 20:26:19,306 INFO L153 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode [2025-02-05 20:26:19,306 INFO L153 SettingsManager]: * Looper check in Petri net analysis=SEMANTIC Applying setting for plugin de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator: Entry function -> main Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Witness directory -> /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Witness filename -> witness Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Write witness besides input file -> false Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Graph data specification -> CHECK( init(main()), LTL(G ! call(reach_error())) ) Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Graph data producer -> Automizer Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Graph data architecture -> 32bit Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Graph data programhash -> 1035d962e39280c92969b9f7066ecadbc22a9f715d97d0ee182811f942c88e9b [2025-02-05 20:26:19,542 INFO L75 nceAwareModelManager]: Repository-Root is: /tmp [2025-02-05 20:26:19,549 INFO L261 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2025-02-05 20:26:19,551 INFO L217 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2025-02-05 20:26:19,552 INFO L270 PluginConnector]: Initializing CDTParser... [2025-02-05 20:26:19,552 INFO L274 PluginConnector]: CDTParser initialized [2025-02-05 20:26:19,553 INFO L431 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/../sv-benchmarks/c/hardness-nfm22/hardness_codestructure_dependencies_file-81.i [2025-02-05 20:26:20,719 INFO L533 CDTParser]: Created temporary CDT project at /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/data/16c5247da/682f1d12e6e448488bab8401e89f9628/FLAGf128a31d1 [2025-02-05 20:26:20,966 INFO L384 CDTParser]: Found 1 translation units. [2025-02-05 20:26:20,967 INFO L180 CDTParser]: Scanning /storage/repos/ultimate-jdk21/releaseScripts/default/sv-benchmarks/c/hardness-nfm22/hardness_codestructure_dependencies_file-81.i [2025-02-05 20:26:20,977 INFO L427 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/data/16c5247da/682f1d12e6e448488bab8401e89f9628/FLAGf128a31d1 [2025-02-05 20:26:21,298 INFO L435 CDTParser]: Successfully deleted /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/data/16c5247da/682f1d12e6e448488bab8401e89f9628 [2025-02-05 20:26:21,299 INFO L299 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2025-02-05 20:26:21,300 INFO L133 ToolchainWalker]: Walking toolchain with 6 elements. [2025-02-05 20:26:21,302 INFO L112 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2025-02-05 20:26:21,305 INFO L270 PluginConnector]: Initializing CACSL2BoogieTranslator... [2025-02-05 20:26:21,308 INFO L274 PluginConnector]: CACSL2BoogieTranslator initialized [2025-02-05 20:26:21,308 INFO L184 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 05.02 08:26:21" (1/1) ... [2025-02-05 20:26:21,308 INFO L204 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@bcac649 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 05.02 08:26:21, skipping insertion in model container [2025-02-05 20:26:21,309 INFO L184 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 05.02 08:26:21" (1/1) ... [2025-02-05 20:26:21,322 INFO L175 MainTranslator]: Built tables and reachable declarations [2025-02-05 20:26:21,416 WARN L250 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate-jdk21/releaseScripts/default/sv-benchmarks/c/hardness-nfm22/hardness_codestructure_dependencies_file-81.i[919,932] [2025-02-05 20:26:21,470 INFO L210 PostProcessor]: Analyzing one entry point: main [2025-02-05 20:26:21,486 INFO L200 MainTranslator]: Completed pre-run [2025-02-05 20:26:21,496 WARN L250 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate-jdk21/releaseScripts/default/sv-benchmarks/c/hardness-nfm22/hardness_codestructure_dependencies_file-81.i[919,932] [2025-02-05 20:26:21,523 INFO L210 PostProcessor]: Analyzing one entry point: main [2025-02-05 20:26:21,540 INFO L204 MainTranslator]: Completed translation [2025-02-05 20:26:21,541 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 05.02 08:26:21 WrapperNode [2025-02-05 20:26:21,541 INFO L131 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2025-02-05 20:26:21,541 INFO L112 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2025-02-05 20:26:21,542 INFO L270 PluginConnector]: Initializing Boogie Procedure Inliner... [2025-02-05 20:26:21,542 INFO L274 PluginConnector]: Boogie Procedure Inliner initialized [2025-02-05 20:26:21,545 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 05.02 08:26:21" (1/1) ... [2025-02-05 20:26:21,552 INFO L184 PluginConnector]: Executing the observer Inliner from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 05.02 08:26:21" (1/1) ... [2025-02-05 20:26:21,579 INFO L138 Inliner]: procedures = 26, calls = 39, calls flagged for inlining = 8, calls inlined = 8, statements flattened = 173 [2025-02-05 20:26:21,580 INFO L131 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2025-02-05 20:26:21,580 INFO L112 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2025-02-05 20:26:21,581 INFO L270 PluginConnector]: Initializing Boogie Preprocessor... [2025-02-05 20:26:21,581 INFO L274 PluginConnector]: Boogie Preprocessor initialized [2025-02-05 20:26:21,587 INFO L184 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 05.02 08:26:21" (1/1) ... [2025-02-05 20:26:21,588 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 05.02 08:26:21" (1/1) ... [2025-02-05 20:26:21,595 INFO L184 PluginConnector]: Executing the observer MemorySlicer from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 05.02 08:26:21" (1/1) ... [2025-02-05 20:26:21,617 INFO L175 MemorySlicer]: Split 2 memory accesses to 1 slices as follows [2]. 100 percent of accesses are in the largest equivalence class. The 2 initializations are split as follows [2]. The 0 writes are split as follows [0]. [2025-02-05 20:26:21,620 INFO L184 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 05.02 08:26:21" (1/1) ... [2025-02-05 20:26:21,621 INFO L184 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 05.02 08:26:21" (1/1) ... [2025-02-05 20:26:21,631 INFO L184 PluginConnector]: Executing the observer ReplaceArrayAssignments from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 05.02 08:26:21" (1/1) ... [2025-02-05 20:26:21,636 INFO L184 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 05.02 08:26:21" (1/1) ... [2025-02-05 20:26:21,640 INFO L184 PluginConnector]: Executing the observer LTLStepAnnotator from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 05.02 08:26:21" (1/1) ... [2025-02-05 20:26:21,642 INFO L184 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 05.02 08:26:21" (1/1) ... [2025-02-05 20:26:21,647 INFO L131 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2025-02-05 20:26:21,648 INFO L112 PluginConnector]: ------------------------IcfgBuilder---------------------------- [2025-02-05 20:26:21,648 INFO L270 PluginConnector]: Initializing IcfgBuilder... [2025-02-05 20:26:21,648 INFO L274 PluginConnector]: IcfgBuilder initialized [2025-02-05 20:26:21,649 INFO L184 PluginConnector]: Executing the observer IcfgBuilderObserver from plugin IcfgBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 05.02 08:26:21" (1/1) ... [2025-02-05 20:26:21,653 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2025-02-05 20:26:21,662 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 [2025-02-05 20:26:21,673 INFO L229 MonitoredProcess]: Starting monitored process 1 with /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 (exit command is (exit), workingDir is null) [2025-02-05 20:26:21,676 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 (1)] Waiting until timeout for monitored process [2025-02-05 20:26:21,692 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocInit [2025-02-05 20:26:21,692 INFO L130 BoogieDeclarations]: Found specification of procedure assume_abort_if_not [2025-02-05 20:26:21,692 INFO L138 BoogieDeclarations]: Found implementation of procedure assume_abort_if_not [2025-02-05 20:26:21,693 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int#0 [2025-02-05 20:26:21,693 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2025-02-05 20:26:21,693 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2025-02-05 20:26:21,740 INFO L257 CfgBuilder]: Building ICFG [2025-02-05 20:26:21,742 INFO L287 CfgBuilder]: Building CFG for each procedure with an implementation [2025-02-05 20:26:21,997 INFO L1309 $ProcedureCfgBuilder]: dead code at ProgramPoint L131: havoc property_#t~bitwise18#1;havoc property_#t~short19#1; [2025-02-05 20:26:22,023 INFO L? ?]: Removed 10 outVars from TransFormulas that were not future-live. [2025-02-05 20:26:22,023 INFO L308 CfgBuilder]: Performing block encoding [2025-02-05 20:26:22,041 INFO L332 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2025-02-05 20:26:22,042 INFO L337 CfgBuilder]: Removed 0 assume(true) statements. [2025-02-05 20:26:22,042 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.icfgbuilder CFG 05.02 08:26:22 BoogieIcfgContainer [2025-02-05 20:26:22,042 INFO L131 PluginConnector]: ------------------------ END IcfgBuilder---------------------------- [2025-02-05 20:26:22,044 INFO L112 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2025-02-05 20:26:22,044 INFO L270 PluginConnector]: Initializing TraceAbstraction... [2025-02-05 20:26:22,047 INFO L274 PluginConnector]: TraceAbstraction initialized [2025-02-05 20:26:22,048 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 05.02 08:26:21" (1/3) ... [2025-02-05 20:26:22,049 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@25a5f711 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 05.02 08:26:22, skipping insertion in model container [2025-02-05 20:26:22,049 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 05.02 08:26:21" (2/3) ... [2025-02-05 20:26:22,049 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@25a5f711 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 05.02 08:26:22, skipping insertion in model container [2025-02-05 20:26:22,050 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.icfgbuilder CFG 05.02 08:26:22" (3/3) ... [2025-02-05 20:26:22,050 INFO L128 eAbstractionObserver]: Analyzing ICFG hardness_codestructure_dependencies_file-81.i [2025-02-05 20:26:22,062 INFO L216 ceAbstractionStarter]: Automizer settings: Hoare:LoopHeads NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2025-02-05 20:26:22,064 INFO L151 ceAbstractionStarter]: Applying trace abstraction to ICFG hardness_codestructure_dependencies_file-81.i that has 2 procedures, 75 locations, 1 initial locations, 1 loop locations, and 1 error locations. [2025-02-05 20:26:22,103 INFO L332 AbstractCegarLoop]: ======== Iteration 0 == of CEGAR loop == AllErrorsAtOnce ======== [2025-02-05 20:26:22,112 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;@5efd78a4, mLbeIndependenceSettings=[IndependenceType=SEMANTIC, AbstractionType=NONE, UseConditional=false, UseSemiCommutativity=true, Solver=Z3, SolverTimeout=1000ms] [2025-02-05 20:26:22,112 INFO L334 AbstractCegarLoop]: Starting to check reachability of 1 error locations. [2025-02-05 20:26:22,115 INFO L276 IsEmpty]: Start isEmpty. Operand has 75 states, 46 states have (on average 1.3695652173913044) internal successors, (63), 47 states have internal predecessors, (63), 26 states have call successors, (26), 1 states have call predecessors, (26), 1 states have return successors, (26), 26 states have call predecessors, (26), 26 states have call successors, (26) [2025-02-05 20:26:22,125 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 163 [2025-02-05 20:26:22,125 INFO L210 NwaCegarLoop]: Found error trace [2025-02-05 20:26:22,126 INFO L218 NwaCegarLoop]: trace histogram [26, 26, 26, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-02-05 20:26:22,126 INFO L396 AbstractCegarLoop]: === Iteration 1 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-02-05 20:26:22,129 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-02-05 20:26:22,130 INFO L85 PathProgramCache]: Analyzing trace with hash 1238574176, now seen corresponding path program 1 times [2025-02-05 20:26:22,135 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-02-05 20:26:22,136 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1305558936] [2025-02-05 20:26:22,136 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-02-05 20:26:22,136 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-02-05 20:26:22,195 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 162 statements into 1 equivalence classes. [2025-02-05 20:26:22,228 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 162 of 162 statements. [2025-02-05 20:26:22,229 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-02-05 20:26:22,229 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-02-05 20:26:22,419 INFO L134 CoverageAnalysis]: Checked inductivity of 1300 backedges. 0 proven. 50 refuted. 0 times theorem prover too weak. 1250 trivial. 0 not checked. [2025-02-05 20:26:22,420 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-02-05 20:26:22,420 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1305558936] [2025-02-05 20:26:22,421 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1305558936] provided 0 perfect and 1 imperfect interpolant sequences [2025-02-05 20:26:22,422 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [544797502] [2025-02-05 20:26:22,422 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-02-05 20:26:22,422 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-02-05 20:26:22,422 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 [2025-02-05 20:26:22,427 INFO L229 MonitoredProcess]: Starting monitored process 2 with /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2025-02-05 20:26:22,432 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (2)] Waiting until timeout for monitored process [2025-02-05 20:26:22,515 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 162 statements into 1 equivalence classes. [2025-02-05 20:26:22,579 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 162 of 162 statements. [2025-02-05 20:26:22,580 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-02-05 20:26:22,580 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-02-05 20:26:22,582 INFO L256 TraceCheckSpWp]: Trace formula consists of 379 conjuncts, 1 conjuncts are in the unsatisfiable core [2025-02-05 20:26:22,588 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-02-05 20:26:22,608 INFO L134 CoverageAnalysis]: Checked inductivity of 1300 backedges. 50 proven. 0 refuted. 0 times theorem prover too weak. 1250 trivial. 0 not checked. [2025-02-05 20:26:22,608 INFO L308 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2025-02-05 20:26:22,609 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [544797502] provided 1 perfect and 0 imperfect interpolant sequences [2025-02-05 20:26:22,609 INFO L185 FreeRefinementEngine]: Found 1 perfect and 1 imperfect interpolant sequences. [2025-02-05 20:26:22,609 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [2] total 2 [2025-02-05 20:26:22,611 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [493706295] [2025-02-05 20:26:22,611 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-02-05 20:26:22,614 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 2 states [2025-02-05 20:26:22,614 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-02-05 20:26:22,626 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 2 interpolants. [2025-02-05 20:26:22,626 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=1, Invalid=1, Unknown=0, NotChecked=0, Total=2 [2025-02-05 20:26:22,628 INFO L87 Difference]: Start difference. First operand has 75 states, 46 states have (on average 1.3695652173913044) internal successors, (63), 47 states have internal predecessors, (63), 26 states have call successors, (26), 1 states have call predecessors, (26), 1 states have return successors, (26), 26 states have call predecessors, (26), 26 states have call successors, (26) Second operand has 2 states, 2 states have (on average 18.5) internal successors, (37), 2 states have internal predecessors, (37), 2 states have call successors, (26), 2 states have call predecessors, (26), 1 states have return successors, (26), 1 states have call predecessors, (26), 2 states have call successors, (26) [2025-02-05 20:26:22,663 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-02-05 20:26:22,663 INFO L93 Difference]: Finished difference Result 144 states and 251 transitions. [2025-02-05 20:26:22,665 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 2 states. [2025-02-05 20:26:22,670 INFO L78 Accepts]: Start accepts. Automaton has has 2 states, 2 states have (on average 18.5) internal successors, (37), 2 states have internal predecessors, (37), 2 states have call successors, (26), 2 states have call predecessors, (26), 1 states have return successors, (26), 1 states have call predecessors, (26), 2 states have call successors, (26) Word has length 162 [2025-02-05 20:26:22,670 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-02-05 20:26:22,674 INFO L225 Difference]: With dead ends: 144 [2025-02-05 20:26:22,677 INFO L226 Difference]: Without dead ends: 72 [2025-02-05 20:26:22,685 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 163 GetRequests, 163 SyntacticMatches, 0 SemanticMatches, 0 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=1, Invalid=1, Unknown=0, NotChecked=0, Total=2 [2025-02-05 20:26:22,687 INFO L435 NwaCegarLoop]: 108 mSDtfsCounter, 0 mSDsluCounter, 0 mSDsCounter, 0 mSdLazyCounter, 2 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 0 SdHoareTripleChecker+Valid, 108 SdHoareTripleChecker+Invalid, 2 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 2 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2025-02-05 20:26:22,687 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [0 Valid, 108 Invalid, 2 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 2 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2025-02-05 20:26:22,700 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 72 states. [2025-02-05 20:26:22,716 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 72 to 72. [2025-02-05 20:26:22,717 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 72 states, 44 states have (on average 1.3181818181818181) internal successors, (58), 44 states have internal predecessors, (58), 26 states have call successors, (26), 1 states have call predecessors, (26), 1 states have return successors, (26), 26 states have call predecessors, (26), 26 states have call successors, (26) [2025-02-05 20:26:22,720 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 72 states to 72 states and 110 transitions. [2025-02-05 20:26:22,721 INFO L78 Accepts]: Start accepts. Automaton has 72 states and 110 transitions. Word has length 162 [2025-02-05 20:26:22,722 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-02-05 20:26:22,722 INFO L471 AbstractCegarLoop]: Abstraction has 72 states and 110 transitions. [2025-02-05 20:26:22,722 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 2 states, 2 states have (on average 18.5) internal successors, (37), 2 states have internal predecessors, (37), 2 states have call successors, (26), 2 states have call predecessors, (26), 1 states have return successors, (26), 1 states have call predecessors, (26), 2 states have call successors, (26) [2025-02-05 20:26:22,722 INFO L276 IsEmpty]: Start isEmpty. Operand 72 states and 110 transitions. [2025-02-05 20:26:22,724 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 163 [2025-02-05 20:26:22,724 INFO L210 NwaCegarLoop]: Found error trace [2025-02-05 20:26:22,724 INFO L218 NwaCegarLoop]: trace histogram [26, 26, 26, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-02-05 20:26:22,732 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (2)] Ended with exit code 0 [2025-02-05 20:26:22,925 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 2 /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable0 [2025-02-05 20:26:22,926 INFO L396 AbstractCegarLoop]: === Iteration 2 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-02-05 20:26:22,926 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-02-05 20:26:22,926 INFO L85 PathProgramCache]: Analyzing trace with hash 558483392, now seen corresponding path program 1 times [2025-02-05 20:26:22,926 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-02-05 20:26:22,927 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1817659386] [2025-02-05 20:26:22,927 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-02-05 20:26:22,927 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-02-05 20:26:22,939 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 162 statements into 1 equivalence classes. [2025-02-05 20:26:23,145 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 162 of 162 statements. [2025-02-05 20:26:23,146 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-02-05 20:26:23,146 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-02-05 20:26:30,083 INFO L134 CoverageAnalysis]: Checked inductivity of 1300 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 1300 trivial. 0 not checked. [2025-02-05 20:26:30,084 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-02-05 20:26:30,084 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1817659386] [2025-02-05 20:26:30,084 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1817659386] provided 1 perfect and 0 imperfect interpolant sequences [2025-02-05 20:26:30,084 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-02-05 20:26:30,084 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [9] imperfect sequences [] total 9 [2025-02-05 20:26:30,084 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [495543380] [2025-02-05 20:26:30,084 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-02-05 20:26:30,085 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 9 states [2025-02-05 20:26:30,085 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-02-05 20:26:30,086 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2025-02-05 20:26:30,086 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=30, Invalid=42, Unknown=0, NotChecked=0, Total=72 [2025-02-05 20:26:30,086 INFO L87 Difference]: Start difference. First operand 72 states and 110 transitions. Second operand has 9 states, 9 states have (on average 3.888888888888889) internal successors, (35), 9 states have internal predecessors, (35), 1 states have call successors, (26), 1 states have call predecessors, (26), 1 states have return successors, (26), 1 states have call predecessors, (26), 1 states have call successors, (26) [2025-02-05 20:26:30,544 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-02-05 20:26:30,544 INFO L93 Difference]: Finished difference Result 185 states and 280 transitions. [2025-02-05 20:26:30,547 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2025-02-05 20:26:30,548 INFO L78 Accepts]: Start accepts. Automaton has has 9 states, 9 states have (on average 3.888888888888889) internal successors, (35), 9 states have internal predecessors, (35), 1 states have call successors, (26), 1 states have call predecessors, (26), 1 states have return successors, (26), 1 states have call predecessors, (26), 1 states have call successors, (26) Word has length 162 [2025-02-05 20:26:30,549 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-02-05 20:26:30,550 INFO L225 Difference]: With dead ends: 185 [2025-02-05 20:26:30,550 INFO L226 Difference]: Without dead ends: 116 [2025-02-05 20:26:30,551 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 11 GetRequests, 3 SyntacticMatches, 0 SemanticMatches, 8 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 5 ImplicationChecksByTransitivity, 0.5s TimeCoverageRelationStatistics Valid=39, Invalid=51, Unknown=0, NotChecked=0, Total=90 [2025-02-05 20:26:30,551 INFO L435 NwaCegarLoop]: 91 mSDtfsCounter, 143 mSDsluCounter, 241 mSDsCounter, 0 mSdLazyCounter, 160 mSolverCounterSat, 6 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.3s Time, 0 mProtectedPredicate, 0 mProtectedAction, 143 SdHoareTripleChecker+Valid, 332 SdHoareTripleChecker+Invalid, 166 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 6 IncrementalHoareTripleChecker+Valid, 160 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.3s IncrementalHoareTripleChecker+Time [2025-02-05 20:26:30,554 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [143 Valid, 332 Invalid, 166 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [6 Valid, 160 Invalid, 0 Unknown, 0 Unchecked, 0.3s Time] [2025-02-05 20:26:30,554 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 116 states. [2025-02-05 20:26:30,570 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 116 to 91. [2025-02-05 20:26:30,571 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 91 states, 63 states have (on average 1.3650793650793651) internal successors, (86), 63 states have internal predecessors, (86), 26 states have call successors, (26), 1 states have call predecessors, (26), 1 states have return successors, (26), 26 states have call predecessors, (26), 26 states have call successors, (26) [2025-02-05 20:26:30,572 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 91 states to 91 states and 138 transitions. [2025-02-05 20:26:30,572 INFO L78 Accepts]: Start accepts. Automaton has 91 states and 138 transitions. Word has length 162 [2025-02-05 20:26:30,573 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-02-05 20:26:30,573 INFO L471 AbstractCegarLoop]: Abstraction has 91 states and 138 transitions. [2025-02-05 20:26:30,573 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 9 states, 9 states have (on average 3.888888888888889) internal successors, (35), 9 states have internal predecessors, (35), 1 states have call successors, (26), 1 states have call predecessors, (26), 1 states have return successors, (26), 1 states have call predecessors, (26), 1 states have call successors, (26) [2025-02-05 20:26:30,573 INFO L276 IsEmpty]: Start isEmpty. Operand 91 states and 138 transitions. [2025-02-05 20:26:30,575 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 163 [2025-02-05 20:26:30,575 INFO L210 NwaCegarLoop]: Found error trace [2025-02-05 20:26:30,575 INFO L218 NwaCegarLoop]: trace histogram [26, 26, 26, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-02-05 20:26:30,575 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable1 [2025-02-05 20:26:30,575 INFO L396 AbstractCegarLoop]: === Iteration 3 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-02-05 20:26:30,576 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-02-05 20:26:30,576 INFO L85 PathProgramCache]: Analyzing trace with hash -1238467967, now seen corresponding path program 1 times [2025-02-05 20:26:30,576 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-02-05 20:26:30,576 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1463802110] [2025-02-05 20:26:30,576 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-02-05 20:26:30,576 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-02-05 20:26:30,583 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 162 statements into 1 equivalence classes. [2025-02-05 20:26:30,620 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 162 of 162 statements. [2025-02-05 20:26:30,621 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-02-05 20:26:30,621 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-02-05 20:26:34,635 INFO L134 CoverageAnalysis]: Checked inductivity of 1300 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 1300 trivial. 0 not checked. [2025-02-05 20:26:34,635 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-02-05 20:26:34,635 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1463802110] [2025-02-05 20:26:34,636 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1463802110] provided 1 perfect and 0 imperfect interpolant sequences [2025-02-05 20:26:34,636 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-02-05 20:26:34,636 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [11] imperfect sequences [] total 11 [2025-02-05 20:26:34,637 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [929604451] [2025-02-05 20:26:34,637 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-02-05 20:26:34,637 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 11 states [2025-02-05 20:26:34,637 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-02-05 20:26:34,639 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 11 interpolants. [2025-02-05 20:26:34,639 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=25, Invalid=85, Unknown=0, NotChecked=0, Total=110 [2025-02-05 20:26:34,639 INFO L87 Difference]: Start difference. First operand 91 states and 138 transitions. Second operand has 11 states, 11 states have (on average 3.1818181818181817) internal successors, (35), 11 states have internal predecessors, (35), 1 states have call successors, (26), 1 states have call predecessors, (26), 1 states have return successors, (26), 1 states have call predecessors, (26), 1 states have call successors, (26) [2025-02-05 20:26:35,751 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-02-05 20:26:35,751 INFO L93 Difference]: Finished difference Result 312 states and 467 transitions. [2025-02-05 20:26:35,751 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 12 states. [2025-02-05 20:26:35,752 INFO L78 Accepts]: Start accepts. Automaton has has 11 states, 11 states have (on average 3.1818181818181817) internal successors, (35), 11 states have internal predecessors, (35), 1 states have call successors, (26), 1 states have call predecessors, (26), 1 states have return successors, (26), 1 states have call predecessors, (26), 1 states have call successors, (26) Word has length 162 [2025-02-05 20:26:35,752 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-02-05 20:26:35,753 INFO L225 Difference]: With dead ends: 312 [2025-02-05 20:26:35,755 INFO L226 Difference]: Without dead ends: 224 [2025-02-05 20:26:35,756 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 23 GetRequests, 4 SyntacticMatches, 0 SemanticMatches, 19 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 55 ImplicationChecksByTransitivity, 1.0s TimeCoverageRelationStatistics Valid=116, Invalid=304, Unknown=0, NotChecked=0, Total=420 [2025-02-05 20:26:35,756 INFO L435 NwaCegarLoop]: 90 mSDtfsCounter, 302 mSDsluCounter, 398 mSDsCounter, 0 mSdLazyCounter, 421 mSolverCounterSat, 81 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.4s Time, 0 mProtectedPredicate, 0 mProtectedAction, 302 SdHoareTripleChecker+Valid, 488 SdHoareTripleChecker+Invalid, 502 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 81 IncrementalHoareTripleChecker+Valid, 421 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.5s IncrementalHoareTripleChecker+Time [2025-02-05 20:26:35,756 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [302 Valid, 488 Invalid, 502 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [81 Valid, 421 Invalid, 0 Unknown, 0 Unchecked, 0.5s Time] [2025-02-05 20:26:35,757 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 224 states. [2025-02-05 20:26:35,772 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 224 to 140. [2025-02-05 20:26:35,773 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 140 states, 85 states have (on average 1.3176470588235294) internal successors, (112), 85 states have internal predecessors, (112), 52 states have call successors, (52), 2 states have call predecessors, (52), 2 states have return successors, (52), 52 states have call predecessors, (52), 52 states have call successors, (52) [2025-02-05 20:26:35,774 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 140 states to 140 states and 216 transitions. [2025-02-05 20:26:35,774 INFO L78 Accepts]: Start accepts. Automaton has 140 states and 216 transitions. Word has length 162 [2025-02-05 20:26:35,775 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-02-05 20:26:35,775 INFO L471 AbstractCegarLoop]: Abstraction has 140 states and 216 transitions. [2025-02-05 20:26:35,775 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 11 states, 11 states have (on average 3.1818181818181817) internal successors, (35), 11 states have internal predecessors, (35), 1 states have call successors, (26), 1 states have call predecessors, (26), 1 states have return successors, (26), 1 states have call predecessors, (26), 1 states have call successors, (26) [2025-02-05 20:26:35,775 INFO L276 IsEmpty]: Start isEmpty. Operand 140 states and 216 transitions. [2025-02-05 20:26:35,776 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 163 [2025-02-05 20:26:35,776 INFO L210 NwaCegarLoop]: Found error trace [2025-02-05 20:26:35,776 INFO L218 NwaCegarLoop]: trace histogram [26, 26, 26, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-02-05 20:26:35,776 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable2 [2025-02-05 20:26:35,777 INFO L396 AbstractCegarLoop]: === Iteration 4 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-02-05 20:26:35,777 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-02-05 20:26:35,777 INFO L85 PathProgramCache]: Analyzing trace with hash -1531870974, now seen corresponding path program 1 times [2025-02-05 20:26:35,777 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-02-05 20:26:35,777 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [557854994] [2025-02-05 20:26:35,777 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-02-05 20:26:35,777 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-02-05 20:26:35,783 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 162 statements into 1 equivalence classes. [2025-02-05 20:26:35,827 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 162 of 162 statements. [2025-02-05 20:26:35,829 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-02-05 20:26:35,829 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-02-05 20:26:39,715 INFO L134 CoverageAnalysis]: Checked inductivity of 1300 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 1300 trivial. 0 not checked. [2025-02-05 20:26:39,715 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-02-05 20:26:39,715 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [557854994] [2025-02-05 20:26:39,715 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [557854994] provided 1 perfect and 0 imperfect interpolant sequences [2025-02-05 20:26:39,715 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-02-05 20:26:39,715 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [9] imperfect sequences [] total 9 [2025-02-05 20:26:39,716 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1928196761] [2025-02-05 20:26:39,716 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-02-05 20:26:39,717 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 9 states [2025-02-05 20:26:39,717 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-02-05 20:26:39,717 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2025-02-05 20:26:39,721 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=30, Invalid=42, Unknown=0, NotChecked=0, Total=72 [2025-02-05 20:26:39,722 INFO L87 Difference]: Start difference. First operand 140 states and 216 transitions. Second operand has 9 states, 9 states have (on average 3.888888888888889) internal successors, (35), 9 states have internal predecessors, (35), 1 states have call successors, (26), 1 states have call predecessors, (26), 1 states have return successors, (26), 1 states have call predecessors, (26), 1 states have call successors, (26) [2025-02-05 20:26:40,131 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-02-05 20:26:40,133 INFO L93 Difference]: Finished difference Result 272 states and 409 transitions. [2025-02-05 20:26:40,134 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2025-02-05 20:26:40,134 INFO L78 Accepts]: Start accepts. Automaton has has 9 states, 9 states have (on average 3.888888888888889) internal successors, (35), 9 states have internal predecessors, (35), 1 states have call successors, (26), 1 states have call predecessors, (26), 1 states have return successors, (26), 1 states have call predecessors, (26), 1 states have call successors, (26) Word has length 162 [2025-02-05 20:26:40,134 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-02-05 20:26:40,135 INFO L225 Difference]: With dead ends: 272 [2025-02-05 20:26:40,135 INFO L226 Difference]: Without dead ends: 184 [2025-02-05 20:26:40,136 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 11 GetRequests, 3 SyntacticMatches, 0 SemanticMatches, 8 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 5 ImplicationChecksByTransitivity, 0.5s TimeCoverageRelationStatistics Valid=39, Invalid=51, Unknown=0, NotChecked=0, Total=90 [2025-02-05 20:26:40,136 INFO L435 NwaCegarLoop]: 91 mSDtfsCounter, 115 mSDsluCounter, 289 mSDsCounter, 0 mSdLazyCounter, 186 mSolverCounterSat, 2 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.3s Time, 0 mProtectedPredicate, 0 mProtectedAction, 115 SdHoareTripleChecker+Valid, 380 SdHoareTripleChecker+Invalid, 188 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 2 IncrementalHoareTripleChecker+Valid, 186 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.3s IncrementalHoareTripleChecker+Time [2025-02-05 20:26:40,136 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [115 Valid, 380 Invalid, 188 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [2 Valid, 186 Invalid, 0 Unknown, 0 Unchecked, 0.3s Time] [2025-02-05 20:26:40,137 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 184 states. [2025-02-05 20:26:40,158 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 184 to 140. [2025-02-05 20:26:40,159 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 140 states, 85 states have (on average 1.3176470588235294) internal successors, (112), 85 states have internal predecessors, (112), 52 states have call successors, (52), 2 states have call predecessors, (52), 2 states have return successors, (52), 52 states have call predecessors, (52), 52 states have call successors, (52) [2025-02-05 20:26:40,161 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 140 states to 140 states and 216 transitions. [2025-02-05 20:26:40,162 INFO L78 Accepts]: Start accepts. Automaton has 140 states and 216 transitions. Word has length 162 [2025-02-05 20:26:40,162 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-02-05 20:26:40,162 INFO L471 AbstractCegarLoop]: Abstraction has 140 states and 216 transitions. [2025-02-05 20:26:40,162 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 9 states, 9 states have (on average 3.888888888888889) internal successors, (35), 9 states have internal predecessors, (35), 1 states have call successors, (26), 1 states have call predecessors, (26), 1 states have return successors, (26), 1 states have call predecessors, (26), 1 states have call successors, (26) [2025-02-05 20:26:40,163 INFO L276 IsEmpty]: Start isEmpty. Operand 140 states and 216 transitions. [2025-02-05 20:26:40,164 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 163 [2025-02-05 20:26:40,166 INFO L210 NwaCegarLoop]: Found error trace [2025-02-05 20:26:40,167 INFO L218 NwaCegarLoop]: trace histogram [26, 26, 26, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-02-05 20:26:40,167 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable3 [2025-02-05 20:26:40,167 INFO L396 AbstractCegarLoop]: === Iteration 5 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-02-05 20:26:40,167 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-02-05 20:26:40,167 INFO L85 PathProgramCache]: Analyzing trace with hash -1402788255, now seen corresponding path program 1 times [2025-02-05 20:26:40,167 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-02-05 20:26:40,167 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2082201723] [2025-02-05 20:26:40,167 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-02-05 20:26:40,167 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-02-05 20:26:40,174 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 162 statements into 1 equivalence classes. [2025-02-05 20:26:40,203 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 162 of 162 statements. [2025-02-05 20:26:40,204 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-02-05 20:26:40,204 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-02-05 20:26:40,474 INFO L134 CoverageAnalysis]: Checked inductivity of 1300 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 1300 trivial. 0 not checked. [2025-02-05 20:26:40,474 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-02-05 20:26:40,474 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2082201723] [2025-02-05 20:26:40,474 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [2082201723] provided 1 perfect and 0 imperfect interpolant sequences [2025-02-05 20:26:40,474 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-02-05 20:26:40,474 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2025-02-05 20:26:40,474 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [628727813] [2025-02-05 20:26:40,475 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-02-05 20:26:40,475 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2025-02-05 20:26:40,475 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-02-05 20:26:40,476 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2025-02-05 20:26:40,476 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=10, Invalid=20, Unknown=0, NotChecked=0, Total=30 [2025-02-05 20:26:40,477 INFO L87 Difference]: Start difference. First operand 140 states and 216 transitions. Second operand has 6 states, 6 states have (on average 5.833333333333333) internal successors, (35), 6 states have internal predecessors, (35), 1 states have call successors, (26), 1 states have call predecessors, (26), 1 states have return successors, (26), 1 states have call predecessors, (26), 1 states have call successors, (26) [2025-02-05 20:26:40,731 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-02-05 20:26:40,731 INFO L93 Difference]: Finished difference Result 264 states and 405 transitions. [2025-02-05 20:26:40,731 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2025-02-05 20:26:40,731 INFO L78 Accepts]: Start accepts. Automaton has has 6 states, 6 states have (on average 5.833333333333333) internal successors, (35), 6 states have internal predecessors, (35), 1 states have call successors, (26), 1 states have call predecessors, (26), 1 states have return successors, (26), 1 states have call predecessors, (26), 1 states have call successors, (26) Word has length 162 [2025-02-05 20:26:40,732 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-02-05 20:26:40,733 INFO L225 Difference]: With dead ends: 264 [2025-02-05 20:26:40,733 INFO L226 Difference]: Without dead ends: 175 [2025-02-05 20:26:40,734 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 11 GetRequests, 4 SyntacticMatches, 0 SemanticMatches, 7 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 2 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=27, Invalid=45, Unknown=0, NotChecked=0, Total=72 [2025-02-05 20:26:40,734 INFO L435 NwaCegarLoop]: 101 mSDtfsCounter, 99 mSDsluCounter, 281 mSDsCounter, 0 mSdLazyCounter, 165 mSolverCounterSat, 79 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 99 SdHoareTripleChecker+Valid, 382 SdHoareTripleChecker+Invalid, 244 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 79 IncrementalHoareTripleChecker+Valid, 165 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.2s IncrementalHoareTripleChecker+Time [2025-02-05 20:26:40,736 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [99 Valid, 382 Invalid, 244 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [79 Valid, 165 Invalid, 0 Unknown, 0 Unchecked, 0.2s Time] [2025-02-05 20:26:40,736 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 175 states. [2025-02-05 20:26:40,755 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 175 to 143. [2025-02-05 20:26:40,758 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 143 states, 88 states have (on average 1.3181818181818181) internal successors, (116), 88 states have internal predecessors, (116), 52 states have call successors, (52), 2 states have call predecessors, (52), 2 states have return successors, (52), 52 states have call predecessors, (52), 52 states have call successors, (52) [2025-02-05 20:26:40,759 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 143 states to 143 states and 220 transitions. [2025-02-05 20:26:40,759 INFO L78 Accepts]: Start accepts. Automaton has 143 states and 220 transitions. Word has length 162 [2025-02-05 20:26:40,761 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-02-05 20:26:40,761 INFO L471 AbstractCegarLoop]: Abstraction has 143 states and 220 transitions. [2025-02-05 20:26:40,761 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 6 states have (on average 5.833333333333333) internal successors, (35), 6 states have internal predecessors, (35), 1 states have call successors, (26), 1 states have call predecessors, (26), 1 states have return successors, (26), 1 states have call predecessors, (26), 1 states have call successors, (26) [2025-02-05 20:26:40,761 INFO L276 IsEmpty]: Start isEmpty. Operand 143 states and 220 transitions. [2025-02-05 20:26:40,763 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 164 [2025-02-05 20:26:40,763 INFO L210 NwaCegarLoop]: Found error trace [2025-02-05 20:26:40,763 INFO L218 NwaCegarLoop]: trace histogram [26, 26, 26, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-02-05 20:26:40,763 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable4 [2025-02-05 20:26:40,763 INFO L396 AbstractCegarLoop]: === Iteration 6 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-02-05 20:26:40,764 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-02-05 20:26:40,764 INFO L85 PathProgramCache]: Analyzing trace with hash 366056432, now seen corresponding path program 1 times [2025-02-05 20:26:40,765 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-02-05 20:26:40,765 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [777783625] [2025-02-05 20:26:40,765 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-02-05 20:26:40,765 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-02-05 20:26:40,771 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 163 statements into 1 equivalence classes. [2025-02-05 20:26:40,808 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 163 of 163 statements. [2025-02-05 20:26:40,809 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-02-05 20:26:40,809 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-02-05 20:26:44,805 INFO L134 CoverageAnalysis]: Checked inductivity of 1300 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 1300 trivial. 0 not checked. [2025-02-05 20:26:44,805 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-02-05 20:26:44,806 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [777783625] [2025-02-05 20:26:44,806 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [777783625] provided 1 perfect and 0 imperfect interpolant sequences [2025-02-05 20:26:44,806 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-02-05 20:26:44,806 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [10] imperfect sequences [] total 10 [2025-02-05 20:26:44,806 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1025380448] [2025-02-05 20:26:44,806 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-02-05 20:26:44,806 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 10 states [2025-02-05 20:26:44,807 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-02-05 20:26:44,807 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 10 interpolants. [2025-02-05 20:26:44,808 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=28, Invalid=62, Unknown=0, NotChecked=0, Total=90 [2025-02-05 20:26:44,808 INFO L87 Difference]: Start difference. First operand 143 states and 220 transitions. Second operand has 10 states, 10 states have (on average 3.6) internal successors, (36), 10 states have internal predecessors, (36), 1 states have call successors, (26), 1 states have call predecessors, (26), 1 states have return successors, (26), 1 states have call predecessors, (26), 1 states have call successors, (26) [2025-02-05 20:26:46,767 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-02-05 20:26:46,768 INFO L93 Difference]: Finished difference Result 308 states and 459 transitions. [2025-02-05 20:26:46,768 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 17 states. [2025-02-05 20:26:46,768 INFO L78 Accepts]: Start accepts. Automaton has has 10 states, 10 states have (on average 3.6) internal successors, (36), 10 states have internal predecessors, (36), 1 states have call successors, (26), 1 states have call predecessors, (26), 1 states have return successors, (26), 1 states have call predecessors, (26), 1 states have call successors, (26) Word has length 163 [2025-02-05 20:26:46,769 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-02-05 20:26:46,770 INFO L225 Difference]: With dead ends: 308 [2025-02-05 20:26:46,770 INFO L226 Difference]: Without dead ends: 219 [2025-02-05 20:26:46,770 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 24 GetRequests, 3 SyntacticMatches, 0 SemanticMatches, 21 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 51 ImplicationChecksByTransitivity, 1.7s TimeCoverageRelationStatistics Valid=172, Invalid=334, Unknown=0, NotChecked=0, Total=506 [2025-02-05 20:26:46,771 INFO L435 NwaCegarLoop]: 93 mSDtfsCounter, 295 mSDsluCounter, 411 mSDsCounter, 0 mSdLazyCounter, 303 mSolverCounterSat, 11 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.7s Time, 0 mProtectedPredicate, 0 mProtectedAction, 295 SdHoareTripleChecker+Valid, 504 SdHoareTripleChecker+Invalid, 314 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 11 IncrementalHoareTripleChecker+Valid, 303 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.7s IncrementalHoareTripleChecker+Time [2025-02-05 20:26:46,771 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [295 Valid, 504 Invalid, 314 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [11 Valid, 303 Invalid, 0 Unknown, 0 Unchecked, 0.7s Time] [2025-02-05 20:26:46,772 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 219 states. [2025-02-05 20:26:46,782 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 219 to 144. [2025-02-05 20:26:46,782 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 144 states, 89 states have (on average 1.3258426966292134) internal successors, (118), 89 states have internal predecessors, (118), 52 states have call successors, (52), 2 states have call predecessors, (52), 2 states have return successors, (52), 52 states have call predecessors, (52), 52 states have call successors, (52) [2025-02-05 20:26:46,783 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 144 states to 144 states and 222 transitions. [2025-02-05 20:26:46,783 INFO L78 Accepts]: Start accepts. Automaton has 144 states and 222 transitions. Word has length 163 [2025-02-05 20:26:46,784 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-02-05 20:26:46,784 INFO L471 AbstractCegarLoop]: Abstraction has 144 states and 222 transitions. [2025-02-05 20:26:46,784 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 10 states, 10 states have (on average 3.6) internal successors, (36), 10 states have internal predecessors, (36), 1 states have call successors, (26), 1 states have call predecessors, (26), 1 states have return successors, (26), 1 states have call predecessors, (26), 1 states have call successors, (26) [2025-02-05 20:26:46,784 INFO L276 IsEmpty]: Start isEmpty. Operand 144 states and 222 transitions. [2025-02-05 20:26:46,785 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 164 [2025-02-05 20:26:46,785 INFO L210 NwaCegarLoop]: Found error trace [2025-02-05 20:26:46,785 INFO L218 NwaCegarLoop]: trace histogram [26, 26, 26, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-02-05 20:26:46,785 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable5 [2025-02-05 20:26:46,785 INFO L396 AbstractCegarLoop]: === Iteration 7 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-02-05 20:26:46,785 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-02-05 20:26:46,786 INFO L85 PathProgramCache]: Analyzing trace with hash 169542927, now seen corresponding path program 1 times [2025-02-05 20:26:46,786 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-02-05 20:26:46,786 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1081404664] [2025-02-05 20:26:46,786 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-02-05 20:26:46,786 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-02-05 20:26:46,791 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 163 statements into 1 equivalence classes. [2025-02-05 20:26:46,832 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 163 of 163 statements. [2025-02-05 20:26:46,834 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-02-05 20:26:46,834 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-02-05 20:26:51,769 INFO L134 CoverageAnalysis]: Checked inductivity of 1300 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 1300 trivial. 0 not checked. [2025-02-05 20:26:51,769 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-02-05 20:26:51,769 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1081404664] [2025-02-05 20:26:51,769 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1081404664] provided 1 perfect and 0 imperfect interpolant sequences [2025-02-05 20:26:51,769 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-02-05 20:26:51,770 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [12] imperfect sequences [] total 12 [2025-02-05 20:26:51,770 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1805157626] [2025-02-05 20:26:51,770 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-02-05 20:26:51,771 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 12 states [2025-02-05 20:26:51,771 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-02-05 20:26:51,771 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 12 interpolants. [2025-02-05 20:26:51,772 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=32, Invalid=100, Unknown=0, NotChecked=0, Total=132 [2025-02-05 20:26:51,772 INFO L87 Difference]: Start difference. First operand 144 states and 222 transitions. Second operand has 12 states, 12 states have (on average 3.0) internal successors, (36), 12 states have internal predecessors, (36), 2 states have call successors, (26), 1 states have call predecessors, (26), 1 states have return successors, (26), 1 states have call predecessors, (26), 2 states have call successors, (26) [2025-02-05 20:26:52,674 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-02-05 20:26:52,674 INFO L93 Difference]: Finished difference Result 339 states and 508 transitions. [2025-02-05 20:26:52,675 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 11 states. [2025-02-05 20:26:52,675 INFO L78 Accepts]: Start accepts. Automaton has has 12 states, 12 states have (on average 3.0) internal successors, (36), 12 states have internal predecessors, (36), 2 states have call successors, (26), 1 states have call predecessors, (26), 1 states have return successors, (26), 1 states have call predecessors, (26), 2 states have call successors, (26) Word has length 163 [2025-02-05 20:26:52,675 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-02-05 20:26:52,677 INFO L225 Difference]: With dead ends: 339 [2025-02-05 20:26:52,677 INFO L226 Difference]: Without dead ends: 249 [2025-02-05 20:26:52,678 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 22 GetRequests, 3 SyntacticMatches, 0 SemanticMatches, 19 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 51 ImplicationChecksByTransitivity, 0.8s TimeCoverageRelationStatistics Valid=120, Invalid=300, Unknown=0, NotChecked=0, Total=420 [2025-02-05 20:26:52,679 INFO L435 NwaCegarLoop]: 95 mSDtfsCounter, 498 mSDsluCounter, 380 mSDsCounter, 0 mSdLazyCounter, 347 mSolverCounterSat, 138 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.4s Time, 0 mProtectedPredicate, 0 mProtectedAction, 498 SdHoareTripleChecker+Valid, 475 SdHoareTripleChecker+Invalid, 485 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 138 IncrementalHoareTripleChecker+Valid, 347 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.5s IncrementalHoareTripleChecker+Time [2025-02-05 20:26:52,679 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [498 Valid, 475 Invalid, 485 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [138 Valid, 347 Invalid, 0 Unknown, 0 Unchecked, 0.5s Time] [2025-02-05 20:26:52,680 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 249 states. [2025-02-05 20:26:52,693 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 249 to 160. [2025-02-05 20:26:52,694 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 160 states, 105 states have (on average 1.3714285714285714) internal successors, (144), 105 states have internal predecessors, (144), 52 states have call successors, (52), 2 states have call predecessors, (52), 2 states have return successors, (52), 52 states have call predecessors, (52), 52 states have call successors, (52) [2025-02-05 20:26:52,695 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 160 states to 160 states and 248 transitions. [2025-02-05 20:26:52,696 INFO L78 Accepts]: Start accepts. Automaton has 160 states and 248 transitions. Word has length 163 [2025-02-05 20:26:52,696 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-02-05 20:26:52,696 INFO L471 AbstractCegarLoop]: Abstraction has 160 states and 248 transitions. [2025-02-05 20:26:52,697 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 12 states, 12 states have (on average 3.0) internal successors, (36), 12 states have internal predecessors, (36), 2 states have call successors, (26), 1 states have call predecessors, (26), 1 states have return successors, (26), 1 states have call predecessors, (26), 2 states have call successors, (26) [2025-02-05 20:26:52,697 INFO L276 IsEmpty]: Start isEmpty. Operand 160 states and 248 transitions. [2025-02-05 20:26:52,698 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 164 [2025-02-05 20:26:52,698 INFO L210 NwaCegarLoop]: Found error trace [2025-02-05 20:26:52,698 INFO L218 NwaCegarLoop]: trace histogram [26, 26, 26, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-02-05 20:26:52,698 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable6 [2025-02-05 20:26:52,699 INFO L396 AbstractCegarLoop]: === Iteration 8 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-02-05 20:26:52,699 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-02-05 20:26:52,699 INFO L85 PathProgramCache]: Analyzing trace with hash -1430894927, now seen corresponding path program 1 times [2025-02-05 20:26:52,699 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-02-05 20:26:52,699 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [802374229] [2025-02-05 20:26:52,700 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-02-05 20:26:52,700 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-02-05 20:26:52,711 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 163 statements into 1 equivalence classes. [2025-02-05 20:26:52,739 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 163 of 163 statements. [2025-02-05 20:26:52,740 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-02-05 20:26:52,740 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-02-05 20:26:57,385 INFO L134 CoverageAnalysis]: Checked inductivity of 1300 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 1300 trivial. 0 not checked. [2025-02-05 20:26:57,386 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-02-05 20:26:57,386 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [802374229] [2025-02-05 20:26:57,386 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [802374229] provided 1 perfect and 0 imperfect interpolant sequences [2025-02-05 20:26:57,386 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-02-05 20:26:57,386 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [13] imperfect sequences [] total 13 [2025-02-05 20:26:57,386 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [891700125] [2025-02-05 20:26:57,386 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-02-05 20:26:57,388 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 13 states [2025-02-05 20:26:57,388 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-02-05 20:26:57,389 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 13 interpolants. [2025-02-05 20:26:57,389 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=34, Invalid=122, Unknown=0, NotChecked=0, Total=156 [2025-02-05 20:26:57,389 INFO L87 Difference]: Start difference. First operand 160 states and 248 transitions. Second operand has 13 states, 13 states have (on average 2.769230769230769) internal successors, (36), 13 states have internal predecessors, (36), 2 states have call successors, (26), 1 states have call predecessors, (26), 1 states have return successors, (26), 1 states have call predecessors, (26), 2 states have call successors, (26) [2025-02-05 20:26:59,397 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-02-05 20:26:59,399 INFO L93 Difference]: Finished difference Result 365 states and 540 transitions. [2025-02-05 20:26:59,401 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 19 states. [2025-02-05 20:26:59,401 INFO L78 Accepts]: Start accepts. Automaton has has 13 states, 13 states have (on average 2.769230769230769) internal successors, (36), 13 states have internal predecessors, (36), 2 states have call successors, (26), 1 states have call predecessors, (26), 1 states have return successors, (26), 1 states have call predecessors, (26), 2 states have call successors, (26) Word has length 163 [2025-02-05 20:26:59,401 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-02-05 20:26:59,403 INFO L225 Difference]: With dead ends: 365 [2025-02-05 20:26:59,403 INFO L226 Difference]: Without dead ends: 275 [2025-02-05 20:26:59,403 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 31 GetRequests, 3 SyntacticMatches, 0 SemanticMatches, 28 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 133 ImplicationChecksByTransitivity, 1.8s TimeCoverageRelationStatistics Valid=238, Invalid=632, Unknown=0, NotChecked=0, Total=870 [2025-02-05 20:26:59,404 INFO L435 NwaCegarLoop]: 95 mSDtfsCounter, 484 mSDsluCounter, 500 mSDsCounter, 0 mSdLazyCounter, 494 mSolverCounterSat, 109 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.6s Time, 0 mProtectedPredicate, 0 mProtectedAction, 484 SdHoareTripleChecker+Valid, 595 SdHoareTripleChecker+Invalid, 603 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 109 IncrementalHoareTripleChecker+Valid, 494 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.6s IncrementalHoareTripleChecker+Time [2025-02-05 20:26:59,404 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [484 Valid, 595 Invalid, 603 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [109 Valid, 494 Invalid, 0 Unknown, 0 Unchecked, 0.6s Time] [2025-02-05 20:26:59,404 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 275 states. [2025-02-05 20:26:59,420 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 275 to 153. [2025-02-05 20:26:59,422 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 153 states, 98 states have (on average 1.346938775510204) internal successors, (132), 98 states have internal predecessors, (132), 52 states have call successors, (52), 2 states have call predecessors, (52), 2 states have return successors, (52), 52 states have call predecessors, (52), 52 states have call successors, (52) [2025-02-05 20:26:59,423 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 153 states to 153 states and 236 transitions. [2025-02-05 20:26:59,423 INFO L78 Accepts]: Start accepts. Automaton has 153 states and 236 transitions. Word has length 163 [2025-02-05 20:26:59,424 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-02-05 20:26:59,424 INFO L471 AbstractCegarLoop]: Abstraction has 153 states and 236 transitions. [2025-02-05 20:26:59,424 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 13 states, 13 states have (on average 2.769230769230769) internal successors, (36), 13 states have internal predecessors, (36), 2 states have call successors, (26), 1 states have call predecessors, (26), 1 states have return successors, (26), 1 states have call predecessors, (26), 2 states have call successors, (26) [2025-02-05 20:26:59,424 INFO L276 IsEmpty]: Start isEmpty. Operand 153 states and 236 transitions. [2025-02-05 20:26:59,426 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 164 [2025-02-05 20:26:59,426 INFO L210 NwaCegarLoop]: Found error trace [2025-02-05 20:26:59,426 INFO L218 NwaCegarLoop]: trace histogram [26, 26, 26, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-02-05 20:26:59,426 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable7 [2025-02-05 20:26:59,427 INFO L396 AbstractCegarLoop]: === Iteration 9 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-02-05 20:26:59,428 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-02-05 20:26:59,428 INFO L85 PathProgramCache]: Analyzing trace with hash -1627408432, now seen corresponding path program 1 times [2025-02-05 20:26:59,428 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-02-05 20:26:59,428 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [452865037] [2025-02-05 20:26:59,428 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-02-05 20:26:59,428 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-02-05 20:26:59,438 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 163 statements into 1 equivalence classes. [2025-02-05 20:26:59,464 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 163 of 163 statements. [2025-02-05 20:26:59,466 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-02-05 20:26:59,466 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-02-05 20:27:03,279 INFO L134 CoverageAnalysis]: Checked inductivity of 1300 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 1300 trivial. 0 not checked. [2025-02-05 20:27:03,279 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-02-05 20:27:03,279 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [452865037] [2025-02-05 20:27:03,279 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [452865037] provided 1 perfect and 0 imperfect interpolant sequences [2025-02-05 20:27:03,279 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-02-05 20:27:03,279 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [9] imperfect sequences [] total 9 [2025-02-05 20:27:03,280 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [158622692] [2025-02-05 20:27:03,280 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-02-05 20:27:03,280 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 9 states [2025-02-05 20:27:03,280 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-02-05 20:27:03,280 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2025-02-05 20:27:03,280 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=26, Invalid=46, Unknown=0, NotChecked=0, Total=72 [2025-02-05 20:27:03,281 INFO L87 Difference]: Start difference. First operand 153 states and 236 transitions. Second operand has 9 states, 9 states have (on average 4.0) internal successors, (36), 9 states have internal predecessors, (36), 1 states have call successors, (26), 1 states have call predecessors, (26), 1 states have return successors, (26), 1 states have call predecessors, (26), 1 states have call successors, (26) [2025-02-05 20:27:03,878 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-02-05 20:27:03,878 INFO L93 Difference]: Finished difference Result 301 states and 458 transitions. [2025-02-05 20:27:03,878 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2025-02-05 20:27:03,878 INFO L78 Accepts]: Start accepts. Automaton has has 9 states, 9 states have (on average 4.0) internal successors, (36), 9 states have internal predecessors, (36), 1 states have call successors, (26), 1 states have call predecessors, (26), 1 states have return successors, (26), 1 states have call predecessors, (26), 1 states have call successors, (26) Word has length 163 [2025-02-05 20:27:03,879 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-02-05 20:27:03,880 INFO L225 Difference]: With dead ends: 301 [2025-02-05 20:27:03,880 INFO L226 Difference]: Without dead ends: 211 [2025-02-05 20:27:03,880 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 15 GetRequests, 3 SyntacticMatches, 0 SemanticMatches, 12 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 13 ImplicationChecksByTransitivity, 0.7s TimeCoverageRelationStatistics Valid=71, Invalid=111, Unknown=0, NotChecked=0, Total=182 [2025-02-05 20:27:03,881 INFO L435 NwaCegarLoop]: 93 mSDtfsCounter, 154 mSDsluCounter, 301 mSDsCounter, 0 mSdLazyCounter, 199 mSolverCounterSat, 17 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 154 SdHoareTripleChecker+Valid, 394 SdHoareTripleChecker+Invalid, 216 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 17 IncrementalHoareTripleChecker+Valid, 199 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.3s IncrementalHoareTripleChecker+Time [2025-02-05 20:27:03,881 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [154 Valid, 394 Invalid, 216 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [17 Valid, 199 Invalid, 0 Unknown, 0 Unchecked, 0.3s Time] [2025-02-05 20:27:03,881 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 211 states. [2025-02-05 20:27:03,889 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 211 to 167. [2025-02-05 20:27:03,890 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 167 states, 112 states have (on average 1.3928571428571428) internal successors, (156), 112 states have internal predecessors, (156), 52 states have call successors, (52), 2 states have call predecessors, (52), 2 states have return successors, (52), 52 states have call predecessors, (52), 52 states have call successors, (52) [2025-02-05 20:27:03,890 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 167 states to 167 states and 260 transitions. [2025-02-05 20:27:03,891 INFO L78 Accepts]: Start accepts. Automaton has 167 states and 260 transitions. Word has length 163 [2025-02-05 20:27:03,891 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-02-05 20:27:03,891 INFO L471 AbstractCegarLoop]: Abstraction has 167 states and 260 transitions. [2025-02-05 20:27:03,891 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 9 states, 9 states have (on average 4.0) internal successors, (36), 9 states have internal predecessors, (36), 1 states have call successors, (26), 1 states have call predecessors, (26), 1 states have return successors, (26), 1 states have call predecessors, (26), 1 states have call successors, (26) [2025-02-05 20:27:03,891 INFO L276 IsEmpty]: Start isEmpty. Operand 167 states and 260 transitions. [2025-02-05 20:27:03,892 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 164 [2025-02-05 20:27:03,892 INFO L210 NwaCegarLoop]: Found error trace [2025-02-05 20:27:03,892 INFO L218 NwaCegarLoop]: trace histogram [26, 26, 26, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-02-05 20:27:03,892 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable8 [2025-02-05 20:27:03,892 INFO L396 AbstractCegarLoop]: === Iteration 10 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-02-05 20:27:03,893 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-02-05 20:27:03,893 INFO L85 PathProgramCache]: Analyzing trace with hash -1724297934, now seen corresponding path program 1 times [2025-02-05 20:27:03,893 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-02-05 20:27:03,893 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1834653061] [2025-02-05 20:27:03,893 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-02-05 20:27:03,893 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-02-05 20:27:03,898 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 163 statements into 1 equivalence classes. [2025-02-05 20:27:03,916 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 163 of 163 statements. [2025-02-05 20:27:03,916 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-02-05 20:27:03,916 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-02-05 20:27:07,487 INFO L134 CoverageAnalysis]: Checked inductivity of 1300 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 1300 trivial. 0 not checked. [2025-02-05 20:27:07,488 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-02-05 20:27:07,488 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1834653061] [2025-02-05 20:27:07,488 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1834653061] provided 1 perfect and 0 imperfect interpolant sequences [2025-02-05 20:27:07,488 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-02-05 20:27:07,488 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [12] imperfect sequences [] total 12 [2025-02-05 20:27:07,488 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [146977548] [2025-02-05 20:27:07,488 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-02-05 20:27:07,489 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 12 states [2025-02-05 20:27:07,489 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-02-05 20:27:07,489 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 12 interpolants. [2025-02-05 20:27:07,489 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=28, Invalid=104, Unknown=0, NotChecked=0, Total=132 [2025-02-05 20:27:07,489 INFO L87 Difference]: Start difference. First operand 167 states and 260 transitions. Second operand has 12 states, 12 states have (on average 3.0) internal successors, (36), 12 states have internal predecessors, (36), 1 states have call successors, (26), 1 states have call predecessors, (26), 1 states have return successors, (26), 1 states have call predecessors, (26), 1 states have call successors, (26) [2025-02-05 20:27:10,328 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-02-05 20:27:10,328 INFO L93 Difference]: Finished difference Result 370 states and 559 transitions. [2025-02-05 20:27:10,329 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 19 states. [2025-02-05 20:27:10,329 INFO L78 Accepts]: Start accepts. Automaton has has 12 states, 12 states have (on average 3.0) internal successors, (36), 12 states have internal predecessors, (36), 1 states have call successors, (26), 1 states have call predecessors, (26), 1 states have return successors, (26), 1 states have call predecessors, (26), 1 states have call successors, (26) Word has length 163 [2025-02-05 20:27:10,329 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-02-05 20:27:10,330 INFO L225 Difference]: With dead ends: 370 [2025-02-05 20:27:10,330 INFO L226 Difference]: Without dead ends: 263 [2025-02-05 20:27:10,335 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 31 GetRequests, 4 SyntacticMatches, 0 SemanticMatches, 27 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 128 ImplicationChecksByTransitivity, 2.3s TimeCoverageRelationStatistics Valid=214, Invalid=598, Unknown=0, NotChecked=0, Total=812 [2025-02-05 20:27:10,335 INFO L435 NwaCegarLoop]: 93 mSDtfsCounter, 503 mSDsluCounter, 416 mSDsCounter, 0 mSdLazyCounter, 597 mSolverCounterSat, 121 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.9s Time, 0 mProtectedPredicate, 0 mProtectedAction, 503 SdHoareTripleChecker+Valid, 509 SdHoareTripleChecker+Invalid, 718 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 121 IncrementalHoareTripleChecker+Valid, 597 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 1.0s IncrementalHoareTripleChecker+Time [2025-02-05 20:27:10,335 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [503 Valid, 509 Invalid, 718 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [121 Valid, 597 Invalid, 0 Unknown, 0 Unchecked, 1.0s Time] [2025-02-05 20:27:10,336 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 263 states. [2025-02-05 20:27:10,352 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 263 to 165. [2025-02-05 20:27:10,356 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 165 states, 110 states have (on average 1.3909090909090909) internal successors, (153), 110 states have internal predecessors, (153), 52 states have call successors, (52), 2 states have call predecessors, (52), 2 states have return successors, (52), 52 states have call predecessors, (52), 52 states have call successors, (52) [2025-02-05 20:27:10,357 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 165 states to 165 states and 257 transitions. [2025-02-05 20:27:10,357 INFO L78 Accepts]: Start accepts. Automaton has 165 states and 257 transitions. Word has length 163 [2025-02-05 20:27:10,357 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-02-05 20:27:10,357 INFO L471 AbstractCegarLoop]: Abstraction has 165 states and 257 transitions. [2025-02-05 20:27:10,357 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 12 states, 12 states have (on average 3.0) internal successors, (36), 12 states have internal predecessors, (36), 1 states have call successors, (26), 1 states have call predecessors, (26), 1 states have return successors, (26), 1 states have call predecessors, (26), 1 states have call successors, (26) [2025-02-05 20:27:10,358 INFO L276 IsEmpty]: Start isEmpty. Operand 165 states and 257 transitions. [2025-02-05 20:27:10,358 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 164 [2025-02-05 20:27:10,358 INFO L210 NwaCegarLoop]: Found error trace [2025-02-05 20:27:10,358 INFO L218 NwaCegarLoop]: trace histogram [26, 26, 26, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-02-05 20:27:10,358 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable9 [2025-02-05 20:27:10,358 INFO L396 AbstractCegarLoop]: === Iteration 11 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-02-05 20:27:10,359 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-02-05 20:27:10,359 INFO L85 PathProgramCache]: Analyzing trace with hash -2132967057, now seen corresponding path program 1 times [2025-02-05 20:27:10,359 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-02-05 20:27:10,359 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [461551088] [2025-02-05 20:27:10,359 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-02-05 20:27:10,359 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-02-05 20:27:10,365 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 163 statements into 1 equivalence classes. [2025-02-05 20:27:10,389 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 163 of 163 statements. [2025-02-05 20:27:10,390 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-02-05 20:27:10,390 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-02-05 20:27:13,758 INFO L134 CoverageAnalysis]: Checked inductivity of 1300 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 1300 trivial. 0 not checked. [2025-02-05 20:27:13,758 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-02-05 20:27:13,758 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [461551088] [2025-02-05 20:27:13,758 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [461551088] provided 1 perfect and 0 imperfect interpolant sequences [2025-02-05 20:27:13,758 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-02-05 20:27:13,759 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [11] imperfect sequences [] total 11 [2025-02-05 20:27:13,759 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1880661839] [2025-02-05 20:27:13,759 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-02-05 20:27:13,759 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 11 states [2025-02-05 20:27:13,759 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-02-05 20:27:13,761 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 11 interpolants. [2025-02-05 20:27:13,761 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=23, Invalid=87, Unknown=0, NotChecked=0, Total=110 [2025-02-05 20:27:13,762 INFO L87 Difference]: Start difference. First operand 165 states and 257 transitions. Second operand has 11 states, 11 states have (on average 3.272727272727273) internal successors, (36), 11 states have internal predecessors, (36), 2 states have call successors, (26), 1 states have call predecessors, (26), 1 states have return successors, (26), 2 states have call predecessors, (26), 2 states have call successors, (26) [2025-02-05 20:27:15,033 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-02-05 20:27:15,033 INFO L93 Difference]: Finished difference Result 349 states and 532 transitions. [2025-02-05 20:27:15,034 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 10 states. [2025-02-05 20:27:15,034 INFO L78 Accepts]: Start accepts. Automaton has has 11 states, 11 states have (on average 3.272727272727273) internal successors, (36), 11 states have internal predecessors, (36), 2 states have call successors, (26), 1 states have call predecessors, (26), 1 states have return successors, (26), 2 states have call predecessors, (26), 2 states have call successors, (26) Word has length 163 [2025-02-05 20:27:15,034 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-02-05 20:27:15,035 INFO L225 Difference]: With dead ends: 349 [2025-02-05 20:27:15,035 INFO L226 Difference]: Without dead ends: 243 [2025-02-05 20:27:15,036 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 22 GetRequests, 5 SyntacticMatches, 0 SemanticMatches, 17 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 29 ImplicationChecksByTransitivity, 1.1s TimeCoverageRelationStatistics Valid=96, Invalid=246, Unknown=0, NotChecked=0, Total=342 [2025-02-05 20:27:15,036 INFO L435 NwaCegarLoop]: 108 mSDtfsCounter, 280 mSDsluCounter, 386 mSDsCounter, 0 mSdLazyCounter, 393 mSolverCounterSat, 134 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.4s Time, 0 mProtectedPredicate, 0 mProtectedAction, 280 SdHoareTripleChecker+Valid, 494 SdHoareTripleChecker+Invalid, 527 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 134 IncrementalHoareTripleChecker+Valid, 393 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.5s IncrementalHoareTripleChecker+Time [2025-02-05 20:27:15,036 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [280 Valid, 494 Invalid, 527 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [134 Valid, 393 Invalid, 0 Unknown, 0 Unchecked, 0.5s Time] [2025-02-05 20:27:15,041 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 243 states. [2025-02-05 20:27:15,061 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 243 to 174. [2025-02-05 20:27:15,061 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 174 states, 119 states have (on average 1.3949579831932772) internal successors, (166), 119 states have internal predecessors, (166), 52 states have call successors, (52), 2 states have call predecessors, (52), 2 states have return successors, (52), 52 states have call predecessors, (52), 52 states have call successors, (52) [2025-02-05 20:27:15,063 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 174 states to 174 states and 270 transitions. [2025-02-05 20:27:15,063 INFO L78 Accepts]: Start accepts. Automaton has 174 states and 270 transitions. Word has length 163 [2025-02-05 20:27:15,063 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-02-05 20:27:15,064 INFO L471 AbstractCegarLoop]: Abstraction has 174 states and 270 transitions. [2025-02-05 20:27:15,064 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 11 states, 11 states have (on average 3.272727272727273) internal successors, (36), 11 states have internal predecessors, (36), 2 states have call successors, (26), 1 states have call predecessors, (26), 1 states have return successors, (26), 2 states have call predecessors, (26), 2 states have call successors, (26) [2025-02-05 20:27:15,064 INFO L276 IsEmpty]: Start isEmpty. Operand 174 states and 270 transitions. [2025-02-05 20:27:15,065 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 164 [2025-02-05 20:27:15,065 INFO L210 NwaCegarLoop]: Found error trace [2025-02-05 20:27:15,065 INFO L218 NwaCegarLoop]: trace histogram [26, 26, 26, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-02-05 20:27:15,065 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable10 [2025-02-05 20:27:15,065 INFO L396 AbstractCegarLoop]: === Iteration 12 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-02-05 20:27:15,066 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-02-05 20:27:15,066 INFO L85 PathProgramCache]: Analyzing trace with hash -629418705, now seen corresponding path program 1 times [2025-02-05 20:27:15,066 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-02-05 20:27:15,066 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1348454040] [2025-02-05 20:27:15,066 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-02-05 20:27:15,066 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-02-05 20:27:15,079 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 163 statements into 1 equivalence classes. [2025-02-05 20:27:15,105 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 163 of 163 statements. [2025-02-05 20:27:15,105 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-02-05 20:27:15,105 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-02-05 20:27:18,722 INFO L134 CoverageAnalysis]: Checked inductivity of 1300 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 1300 trivial. 0 not checked. [2025-02-05 20:27:18,723 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-02-05 20:27:18,723 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1348454040] [2025-02-05 20:27:18,723 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1348454040] provided 1 perfect and 0 imperfect interpolant sequences [2025-02-05 20:27:18,723 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-02-05 20:27:18,723 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [8] imperfect sequences [] total 8 [2025-02-05 20:27:18,723 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [989352260] [2025-02-05 20:27:18,723 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-02-05 20:27:18,723 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 8 states [2025-02-05 20:27:18,723 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-02-05 20:27:18,724 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2025-02-05 20:27:18,724 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=23, Invalid=33, Unknown=0, NotChecked=0, Total=56 [2025-02-05 20:27:18,724 INFO L87 Difference]: Start difference. First operand 174 states and 270 transitions. Second operand has 8 states, 8 states have (on average 4.5) internal successors, (36), 8 states have internal predecessors, (36), 1 states have call successors, (26), 1 states have call predecessors, (26), 1 states have return successors, (26), 1 states have call predecessors, (26), 1 states have call successors, (26) [2025-02-05 20:27:19,144 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-02-05 20:27:19,144 INFO L93 Difference]: Finished difference Result 358 states and 543 transitions. [2025-02-05 20:27:19,145 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2025-02-05 20:27:19,145 INFO L78 Accepts]: Start accepts. Automaton has has 8 states, 8 states have (on average 4.5) internal successors, (36), 8 states have internal predecessors, (36), 1 states have call successors, (26), 1 states have call predecessors, (26), 1 states have return successors, (26), 1 states have call predecessors, (26), 1 states have call successors, (26) Word has length 163 [2025-02-05 20:27:19,146 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-02-05 20:27:19,147 INFO L225 Difference]: With dead ends: 358 [2025-02-05 20:27:19,147 INFO L226 Difference]: Without dead ends: 252 [2025-02-05 20:27:19,147 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 10 GetRequests, 3 SyntacticMatches, 0 SemanticMatches, 7 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 4 ImplicationChecksByTransitivity, 0.5s TimeCoverageRelationStatistics Valid=31, Invalid=41, Unknown=0, NotChecked=0, Total=72 [2025-02-05 20:27:19,147 INFO L435 NwaCegarLoop]: 110 mSDtfsCounter, 152 mSDsluCounter, 266 mSDsCounter, 0 mSdLazyCounter, 189 mSolverCounterSat, 7 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.3s Time, 0 mProtectedPredicate, 0 mProtectedAction, 152 SdHoareTripleChecker+Valid, 376 SdHoareTripleChecker+Invalid, 196 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 7 IncrementalHoareTripleChecker+Valid, 189 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.3s IncrementalHoareTripleChecker+Time [2025-02-05 20:27:19,148 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [152 Valid, 376 Invalid, 196 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [7 Valid, 189 Invalid, 0 Unknown, 0 Unchecked, 0.3s Time] [2025-02-05 20:27:19,148 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 252 states. [2025-02-05 20:27:19,159 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 252 to 167. [2025-02-05 20:27:19,159 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 167 states, 112 states have (on average 1.375) internal successors, (154), 112 states have internal predecessors, (154), 52 states have call successors, (52), 2 states have call predecessors, (52), 2 states have return successors, (52), 52 states have call predecessors, (52), 52 states have call successors, (52) [2025-02-05 20:27:19,160 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 167 states to 167 states and 258 transitions. [2025-02-05 20:27:19,160 INFO L78 Accepts]: Start accepts. Automaton has 167 states and 258 transitions. Word has length 163 [2025-02-05 20:27:19,161 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-02-05 20:27:19,161 INFO L471 AbstractCegarLoop]: Abstraction has 167 states and 258 transitions. [2025-02-05 20:27:19,161 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 8 states, 8 states have (on average 4.5) internal successors, (36), 8 states have internal predecessors, (36), 1 states have call successors, (26), 1 states have call predecessors, (26), 1 states have return successors, (26), 1 states have call predecessors, (26), 1 states have call successors, (26) [2025-02-05 20:27:19,161 INFO L276 IsEmpty]: Start isEmpty. Operand 167 states and 258 transitions. [2025-02-05 20:27:19,162 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 164 [2025-02-05 20:27:19,162 INFO L210 NwaCegarLoop]: Found error trace [2025-02-05 20:27:19,162 INFO L218 NwaCegarLoop]: trace histogram [26, 26, 26, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-02-05 20:27:19,162 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable11 [2025-02-05 20:27:19,162 INFO L396 AbstractCegarLoop]: === Iteration 13 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-02-05 20:27:19,162 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-02-05 20:27:19,162 INFO L85 PathProgramCache]: Analyzing trace with hash 1868597232, now seen corresponding path program 1 times [2025-02-05 20:27:19,162 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-02-05 20:27:19,162 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [453753207] [2025-02-05 20:27:19,162 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-02-05 20:27:19,162 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-02-05 20:27:19,167 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 163 statements into 1 equivalence classes. [2025-02-05 20:27:19,180 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 163 of 163 statements. [2025-02-05 20:27:19,180 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-02-05 20:27:19,180 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-02-05 20:27:22,313 INFO L134 CoverageAnalysis]: Checked inductivity of 1300 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 1300 trivial. 0 not checked. [2025-02-05 20:27:22,313 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-02-05 20:27:22,313 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [453753207] [2025-02-05 20:27:22,313 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [453753207] provided 1 perfect and 0 imperfect interpolant sequences [2025-02-05 20:27:22,314 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-02-05 20:27:22,314 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [8] imperfect sequences [] total 8 [2025-02-05 20:27:22,314 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [703714880] [2025-02-05 20:27:22,314 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-02-05 20:27:22,314 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 8 states [2025-02-05 20:27:22,314 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-02-05 20:27:22,315 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2025-02-05 20:27:22,315 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=23, Invalid=33, Unknown=0, NotChecked=0, Total=56 [2025-02-05 20:27:22,315 INFO L87 Difference]: Start difference. First operand 167 states and 258 transitions. Second operand has 8 states, 8 states have (on average 4.5) internal successors, (36), 8 states have internal predecessors, (36), 1 states have call successors, (26), 1 states have call predecessors, (26), 1 states have return successors, (26), 1 states have call predecessors, (26), 1 states have call successors, (26) [2025-02-05 20:27:22,719 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-02-05 20:27:22,720 INFO L93 Difference]: Finished difference Result 316 states and 478 transitions. [2025-02-05 20:27:22,720 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2025-02-05 20:27:22,720 INFO L78 Accepts]: Start accepts. Automaton has has 8 states, 8 states have (on average 4.5) internal successors, (36), 8 states have internal predecessors, (36), 1 states have call successors, (26), 1 states have call predecessors, (26), 1 states have return successors, (26), 1 states have call predecessors, (26), 1 states have call successors, (26) Word has length 163 [2025-02-05 20:27:22,721 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-02-05 20:27:22,722 INFO L225 Difference]: With dead ends: 316 [2025-02-05 20:27:22,722 INFO L226 Difference]: Without dead ends: 208 [2025-02-05 20:27:22,722 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 10 GetRequests, 3 SyntacticMatches, 0 SemanticMatches, 7 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 4 ImplicationChecksByTransitivity, 0.5s TimeCoverageRelationStatistics Valid=31, Invalid=41, Unknown=0, NotChecked=0, Total=72 [2025-02-05 20:27:22,723 INFO L435 NwaCegarLoop]: 112 mSDtfsCounter, 104 mSDsluCounter, 315 mSDsCounter, 0 mSdLazyCounter, 225 mSolverCounterSat, 2 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.3s Time, 0 mProtectedPredicate, 0 mProtectedAction, 104 SdHoareTripleChecker+Valid, 427 SdHoareTripleChecker+Invalid, 227 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 2 IncrementalHoareTripleChecker+Valid, 225 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.3s IncrementalHoareTripleChecker+Time [2025-02-05 20:27:22,724 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [104 Valid, 427 Invalid, 227 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [2 Valid, 225 Invalid, 0 Unknown, 0 Unchecked, 0.3s Time] [2025-02-05 20:27:22,724 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 208 states. [2025-02-05 20:27:22,738 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 208 to 165. [2025-02-05 20:27:22,738 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 165 states, 110 states have (on average 1.3727272727272728) internal successors, (151), 110 states have internal predecessors, (151), 52 states have call successors, (52), 2 states have call predecessors, (52), 2 states have return successors, (52), 52 states have call predecessors, (52), 52 states have call successors, (52) [2025-02-05 20:27:22,739 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 165 states to 165 states and 255 transitions. [2025-02-05 20:27:22,739 INFO L78 Accepts]: Start accepts. Automaton has 165 states and 255 transitions. Word has length 163 [2025-02-05 20:27:22,739 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-02-05 20:27:22,739 INFO L471 AbstractCegarLoop]: Abstraction has 165 states and 255 transitions. [2025-02-05 20:27:22,740 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 8 states, 8 states have (on average 4.5) internal successors, (36), 8 states have internal predecessors, (36), 1 states have call successors, (26), 1 states have call predecessors, (26), 1 states have return successors, (26), 1 states have call predecessors, (26), 1 states have call successors, (26) [2025-02-05 20:27:22,740 INFO L276 IsEmpty]: Start isEmpty. Operand 165 states and 255 transitions. [2025-02-05 20:27:22,740 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 165 [2025-02-05 20:27:22,740 INFO L210 NwaCegarLoop]: Found error trace [2025-02-05 20:27:22,741 INFO L218 NwaCegarLoop]: trace histogram [26, 26, 26, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-02-05 20:27:22,741 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable12 [2025-02-05 20:27:22,741 INFO L396 AbstractCegarLoop]: === Iteration 14 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-02-05 20:27:22,741 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-02-05 20:27:22,741 INFO L85 PathProgramCache]: Analyzing trace with hash -994771522, now seen corresponding path program 1 times [2025-02-05 20:27:22,741 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-02-05 20:27:22,742 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [61252602] [2025-02-05 20:27:22,742 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-02-05 20:27:22,742 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-02-05 20:27:22,749 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 164 statements into 1 equivalence classes. [2025-02-05 20:27:22,754 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 164 of 164 statements. [2025-02-05 20:27:22,754 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-02-05 20:27:22,754 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-02-05 20:27:43,541 INFO L134 CoverageAnalysis]: Checked inductivity of 1300 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 1300 trivial. 0 not checked. [2025-02-05 20:27:43,541 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-02-05 20:27:43,541 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [61252602] [2025-02-05 20:27:43,541 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [61252602] provided 1 perfect and 0 imperfect interpolant sequences [2025-02-05 20:27:43,541 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-02-05 20:27:43,541 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [9] imperfect sequences [] total 9 [2025-02-05 20:27:43,541 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [420453958] [2025-02-05 20:27:43,541 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-02-05 20:27:43,542 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 9 states [2025-02-05 20:27:43,542 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-02-05 20:27:43,542 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2025-02-05 20:27:43,542 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=19, Invalid=53, Unknown=0, NotChecked=0, Total=72 [2025-02-05 20:27:43,542 INFO L87 Difference]: Start difference. First operand 165 states and 255 transitions. Second operand has 9 states, 9 states have (on average 4.111111111111111) internal successors, (37), 9 states have internal predecessors, (37), 1 states have call successors, (26), 1 states have call predecessors, (26), 1 states have return successors, (26), 1 states have call predecessors, (26), 1 states have call successors, (26) [2025-02-05 20:27:44,608 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-02-05 20:27:44,609 INFO L93 Difference]: Finished difference Result 212 states and 316 transitions. [2025-02-05 20:27:44,609 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2025-02-05 20:27:44,609 INFO L78 Accepts]: Start accepts. Automaton has has 9 states, 9 states have (on average 4.111111111111111) internal successors, (37), 9 states have internal predecessors, (37), 1 states have call successors, (26), 1 states have call predecessors, (26), 1 states have return successors, (26), 1 states have call predecessors, (26), 1 states have call successors, (26) Word has length 164 [2025-02-05 20:27:44,610 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-02-05 20:27:44,611 INFO L225 Difference]: With dead ends: 212 [2025-02-05 20:27:44,611 INFO L226 Difference]: Without dead ends: 210 [2025-02-05 20:27:44,612 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 13 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 11 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 14 ImplicationChecksByTransitivity, 1.2s TimeCoverageRelationStatistics Valid=39, Invalid=117, Unknown=0, NotChecked=0, Total=156 [2025-02-05 20:27:44,612 INFO L435 NwaCegarLoop]: 128 mSDtfsCounter, 106 mSDsluCounter, 425 mSDsCounter, 0 mSdLazyCounter, 148 mSolverCounterSat, 16 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 106 SdHoareTripleChecker+Valid, 553 SdHoareTripleChecker+Invalid, 164 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 16 IncrementalHoareTripleChecker+Valid, 148 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.2s IncrementalHoareTripleChecker+Time [2025-02-05 20:27:44,612 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [106 Valid, 553 Invalid, 164 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [16 Valid, 148 Invalid, 0 Unknown, 0 Unchecked, 0.2s Time] [2025-02-05 20:27:44,613 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 210 states. [2025-02-05 20:27:44,634 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 210 to 183. [2025-02-05 20:27:44,635 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 183 states, 127 states have (on average 1.3779527559055118) internal successors, (175), 127 states have internal predecessors, (175), 52 states have call successors, (52), 3 states have call predecessors, (52), 3 states have return successors, (52), 52 states have call predecessors, (52), 52 states have call successors, (52) [2025-02-05 20:27:44,636 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 183 states to 183 states and 279 transitions. [2025-02-05 20:27:44,637 INFO L78 Accepts]: Start accepts. Automaton has 183 states and 279 transitions. Word has length 164 [2025-02-05 20:27:44,637 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-02-05 20:27:44,637 INFO L471 AbstractCegarLoop]: Abstraction has 183 states and 279 transitions. [2025-02-05 20:27:44,637 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 9 states, 9 states have (on average 4.111111111111111) internal successors, (37), 9 states have internal predecessors, (37), 1 states have call successors, (26), 1 states have call predecessors, (26), 1 states have return successors, (26), 1 states have call predecessors, (26), 1 states have call successors, (26) [2025-02-05 20:27:44,637 INFO L276 IsEmpty]: Start isEmpty. Operand 183 states and 279 transitions. [2025-02-05 20:27:44,638 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 166 [2025-02-05 20:27:44,638 INFO L210 NwaCegarLoop]: Found error trace [2025-02-05 20:27:44,638 INFO L218 NwaCegarLoop]: trace histogram [26, 26, 26, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-02-05 20:27:44,639 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable13 [2025-02-05 20:27:44,639 INFO L396 AbstractCegarLoop]: === Iteration 15 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-02-05 20:27:44,639 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-02-05 20:27:44,639 INFO L85 PathProgramCache]: Analyzing trace with hash 587329163, now seen corresponding path program 1 times [2025-02-05 20:27:44,639 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-02-05 20:27:44,639 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [972961663] [2025-02-05 20:27:44,640 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-02-05 20:27:44,640 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-02-05 20:27:44,647 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 165 statements into 1 equivalence classes. [2025-02-05 20:27:44,655 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 165 of 165 statements. [2025-02-05 20:27:44,655 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-02-05 20:27:44,655 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-02-05 20:27:44,703 INFO L134 CoverageAnalysis]: Checked inductivity of 1300 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 1300 trivial. 0 not checked. [2025-02-05 20:27:44,703 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-02-05 20:27:44,703 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [972961663] [2025-02-05 20:27:44,703 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [972961663] provided 1 perfect and 0 imperfect interpolant sequences [2025-02-05 20:27:44,704 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-02-05 20:27:44,704 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2025-02-05 20:27:44,705 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1930319378] [2025-02-05 20:27:44,705 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-02-05 20:27:44,706 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2025-02-05 20:27:44,706 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-02-05 20:27:44,706 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2025-02-05 20:27:44,706 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-02-05 20:27:44,706 INFO L87 Difference]: Start difference. First operand 183 states and 279 transitions. Second operand has 3 states, 3 states have (on average 12.666666666666666) internal successors, (38), 3 states have internal predecessors, (38), 1 states have call successors, (26), 1 states have call predecessors, (26), 1 states have return successors, (26), 1 states have call predecessors, (26), 1 states have call successors, (26) [2025-02-05 20:27:44,776 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-02-05 20:27:44,776 INFO L93 Difference]: Finished difference Result 355 states and 526 transitions. [2025-02-05 20:27:44,776 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2025-02-05 20:27:44,777 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 12.666666666666666) internal successors, (38), 3 states have internal predecessors, (38), 1 states have call successors, (26), 1 states have call predecessors, (26), 1 states have return successors, (26), 1 states have call predecessors, (26), 1 states have call successors, (26) Word has length 165 [2025-02-05 20:27:44,777 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-02-05 20:27:44,779 INFO L225 Difference]: With dead ends: 355 [2025-02-05 20:27:44,779 INFO L226 Difference]: Without dead ends: 229 [2025-02-05 20:27:44,779 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 3 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-02-05 20:27:44,779 INFO L435 NwaCegarLoop]: 114 mSDtfsCounter, 47 mSDsluCounter, 84 mSDsCounter, 0 mSdLazyCounter, 24 mSolverCounterSat, 2 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 47 SdHoareTripleChecker+Valid, 198 SdHoareTripleChecker+Invalid, 26 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 2 IncrementalHoareTripleChecker+Valid, 24 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2025-02-05 20:27:44,780 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [47 Valid, 198 Invalid, 26 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [2 Valid, 24 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2025-02-05 20:27:44,780 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 229 states. [2025-02-05 20:27:44,820 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 229 to 226. [2025-02-05 20:27:44,821 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 226 states, 157 states have (on average 1.3248407643312101) internal successors, (208), 158 states have internal predecessors, (208), 62 states have call successors, (62), 6 states have call predecessors, (62), 6 states have return successors, (62), 61 states have call predecessors, (62), 62 states have call successors, (62) [2025-02-05 20:27:44,823 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 226 states to 226 states and 332 transitions. [2025-02-05 20:27:44,823 INFO L78 Accepts]: Start accepts. Automaton has 226 states and 332 transitions. Word has length 165 [2025-02-05 20:27:44,824 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-02-05 20:27:44,824 INFO L471 AbstractCegarLoop]: Abstraction has 226 states and 332 transitions. [2025-02-05 20:27:44,824 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 12.666666666666666) internal successors, (38), 3 states have internal predecessors, (38), 1 states have call successors, (26), 1 states have call predecessors, (26), 1 states have return successors, (26), 1 states have call predecessors, (26), 1 states have call successors, (26) [2025-02-05 20:27:44,824 INFO L276 IsEmpty]: Start isEmpty. Operand 226 states and 332 transitions. [2025-02-05 20:27:44,826 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 166 [2025-02-05 20:27:44,826 INFO L210 NwaCegarLoop]: Found error trace [2025-02-05 20:27:44,826 INFO L218 NwaCegarLoop]: trace histogram [26, 26, 26, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-02-05 20:27:44,826 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable14 [2025-02-05 20:27:44,826 INFO L396 AbstractCegarLoop]: === Iteration 16 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-02-05 20:27:44,827 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-02-05 20:27:44,827 INFO L85 PathProgramCache]: Analyzing trace with hash -572321846, now seen corresponding path program 1 times [2025-02-05 20:27:44,827 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-02-05 20:27:44,827 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [980806701] [2025-02-05 20:27:44,828 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-02-05 20:27:44,828 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-02-05 20:27:44,837 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 165 statements into 1 equivalence classes. [2025-02-05 20:27:44,847 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 165 of 165 statements. [2025-02-05 20:27:44,847 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-02-05 20:27:44,847 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-02-05 20:27:44,900 INFO L134 CoverageAnalysis]: Checked inductivity of 1300 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 1300 trivial. 0 not checked. [2025-02-05 20:27:44,900 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-02-05 20:27:44,900 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [980806701] [2025-02-05 20:27:44,900 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [980806701] provided 1 perfect and 0 imperfect interpolant sequences [2025-02-05 20:27:44,900 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-02-05 20:27:44,901 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2025-02-05 20:27:44,901 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1861564846] [2025-02-05 20:27:44,901 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-02-05 20:27:44,901 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2025-02-05 20:27:44,901 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-02-05 20:27:44,902 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2025-02-05 20:27:44,902 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-02-05 20:27:44,902 INFO L87 Difference]: Start difference. First operand 226 states and 332 transitions. Second operand has 3 states, 3 states have (on average 12.666666666666666) internal successors, (38), 3 states have internal predecessors, (38), 1 states have call successors, (26), 1 states have call predecessors, (26), 1 states have return successors, (26), 1 states have call predecessors, (26), 1 states have call successors, (26) [2025-02-05 20:27:44,975 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-02-05 20:27:44,976 INFO L93 Difference]: Finished difference Result 398 states and 578 transitions. [2025-02-05 20:27:44,976 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2025-02-05 20:27:44,976 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 12.666666666666666) internal successors, (38), 3 states have internal predecessors, (38), 1 states have call successors, (26), 1 states have call predecessors, (26), 1 states have return successors, (26), 1 states have call predecessors, (26), 1 states have call successors, (26) Word has length 165 [2025-02-05 20:27:44,977 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-02-05 20:27:44,978 INFO L225 Difference]: With dead ends: 398 [2025-02-05 20:27:44,978 INFO L226 Difference]: Without dead ends: 233 [2025-02-05 20:27:44,979 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 3 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-02-05 20:27:44,979 INFO L435 NwaCegarLoop]: 135 mSDtfsCounter, 41 mSDsluCounter, 86 mSDsCounter, 0 mSdLazyCounter, 28 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 41 SdHoareTripleChecker+Valid, 221 SdHoareTripleChecker+Invalid, 28 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 28 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2025-02-05 20:27:44,979 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [41 Valid, 221 Invalid, 28 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 28 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2025-02-05 20:27:44,980 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 233 states. [2025-02-05 20:27:45,003 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 233 to 201. [2025-02-05 20:27:45,004 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 201 states, 143 states have (on average 1.3356643356643356) internal successors, (191), 143 states have internal predecessors, (191), 52 states have call successors, (52), 5 states have call predecessors, (52), 5 states have return successors, (52), 52 states have call predecessors, (52), 52 states have call successors, (52) [2025-02-05 20:27:45,005 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 201 states to 201 states and 295 transitions. [2025-02-05 20:27:45,006 INFO L78 Accepts]: Start accepts. Automaton has 201 states and 295 transitions. Word has length 165 [2025-02-05 20:27:45,007 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-02-05 20:27:45,007 INFO L471 AbstractCegarLoop]: Abstraction has 201 states and 295 transitions. [2025-02-05 20:27:45,007 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 12.666666666666666) internal successors, (38), 3 states have internal predecessors, (38), 1 states have call successors, (26), 1 states have call predecessors, (26), 1 states have return successors, (26), 1 states have call predecessors, (26), 1 states have call successors, (26) [2025-02-05 20:27:45,007 INFO L276 IsEmpty]: Start isEmpty. Operand 201 states and 295 transitions. [2025-02-05 20:27:45,008 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 166 [2025-02-05 20:27:45,008 INFO L210 NwaCegarLoop]: Found error trace [2025-02-05 20:27:45,008 INFO L218 NwaCegarLoop]: trace histogram [26, 26, 26, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-02-05 20:27:45,009 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable15 [2025-02-05 20:27:45,009 INFO L396 AbstractCegarLoop]: === Iteration 17 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-02-05 20:27:45,009 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-02-05 20:27:45,009 INFO L85 PathProgramCache]: Analyzing trace with hash 2055236746, now seen corresponding path program 1 times [2025-02-05 20:27:45,009 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-02-05 20:27:45,009 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1340209967] [2025-02-05 20:27:45,010 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-02-05 20:27:45,010 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-02-05 20:27:45,018 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 165 statements into 1 equivalence classes. [2025-02-05 20:27:45,025 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 165 of 165 statements. [2025-02-05 20:27:45,026 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-02-05 20:27:45,026 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-02-05 20:27:46,635 INFO L134 CoverageAnalysis]: Checked inductivity of 1300 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 1300 trivial. 0 not checked. [2025-02-05 20:27:46,635 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-02-05 20:27:46,635 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1340209967] [2025-02-05 20:27:46,635 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1340209967] provided 1 perfect and 0 imperfect interpolant sequences [2025-02-05 20:27:46,635 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-02-05 20:27:46,635 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [10] imperfect sequences [] total 10 [2025-02-05 20:27:46,636 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [255552507] [2025-02-05 20:27:46,636 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-02-05 20:27:46,636 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 10 states [2025-02-05 20:27:46,636 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-02-05 20:27:46,636 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 10 interpolants. [2025-02-05 20:27:46,636 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=24, Invalid=66, Unknown=0, NotChecked=0, Total=90 [2025-02-05 20:27:46,637 INFO L87 Difference]: Start difference. First operand 201 states and 295 transitions. Second operand has 10 states, 10 states have (on average 3.8) internal successors, (38), 10 states have internal predecessors, (38), 1 states have call successors, (26), 1 states have call predecessors, (26), 1 states have return successors, (26), 1 states have call predecessors, (26), 1 states have call successors, (26) [2025-02-05 20:27:46,829 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-02-05 20:27:46,830 INFO L93 Difference]: Finished difference Result 403 states and 572 transitions. [2025-02-05 20:27:46,830 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 10 states. [2025-02-05 20:27:46,830 INFO L78 Accepts]: Start accepts. Automaton has has 10 states, 10 states have (on average 3.8) internal successors, (38), 10 states have internal predecessors, (38), 1 states have call successors, (26), 1 states have call predecessors, (26), 1 states have return successors, (26), 1 states have call predecessors, (26), 1 states have call successors, (26) Word has length 165 [2025-02-05 20:27:46,830 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-02-05 20:27:46,832 INFO L225 Difference]: With dead ends: 403 [2025-02-05 20:27:46,832 INFO L226 Difference]: Without dead ends: 263 [2025-02-05 20:27:46,832 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 14 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 12 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 18 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=48, Invalid=134, Unknown=0, NotChecked=0, Total=182 [2025-02-05 20:27:46,832 INFO L435 NwaCegarLoop]: 137 mSDtfsCounter, 95 mSDsluCounter, 639 mSDsCounter, 0 mSdLazyCounter, 202 mSolverCounterSat, 11 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 95 SdHoareTripleChecker+Valid, 776 SdHoareTripleChecker+Invalid, 213 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 11 IncrementalHoareTripleChecker+Valid, 202 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2025-02-05 20:27:46,833 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [95 Valid, 776 Invalid, 213 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [11 Valid, 202 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2025-02-05 20:27:46,833 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 263 states. [2025-02-05 20:27:46,852 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 263 to 225. [2025-02-05 20:27:46,852 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 225 states, 162 states have (on average 1.2839506172839505) internal successors, (208), 163 states have internal predecessors, (208), 56 states have call successors, (56), 6 states have call predecessors, (56), 6 states have return successors, (56), 55 states have call predecessors, (56), 56 states have call successors, (56) [2025-02-05 20:27:46,853 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 225 states to 225 states and 320 transitions. [2025-02-05 20:27:46,853 INFO L78 Accepts]: Start accepts. Automaton has 225 states and 320 transitions. Word has length 165 [2025-02-05 20:27:46,854 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-02-05 20:27:46,854 INFO L471 AbstractCegarLoop]: Abstraction has 225 states and 320 transitions. [2025-02-05 20:27:46,854 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 10 states, 10 states have (on average 3.8) internal successors, (38), 10 states have internal predecessors, (38), 1 states have call successors, (26), 1 states have call predecessors, (26), 1 states have return successors, (26), 1 states have call predecessors, (26), 1 states have call successors, (26) [2025-02-05 20:27:46,854 INFO L276 IsEmpty]: Start isEmpty. Operand 225 states and 320 transitions. [2025-02-05 20:27:46,854 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 167 [2025-02-05 20:27:46,854 INFO L210 NwaCegarLoop]: Found error trace [2025-02-05 20:27:46,855 INFO L218 NwaCegarLoop]: trace histogram [26, 26, 26, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-02-05 20:27:46,855 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable16 [2025-02-05 20:27:46,855 INFO L396 AbstractCegarLoop]: === Iteration 18 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-02-05 20:27:46,855 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-02-05 20:27:46,855 INFO L85 PathProgramCache]: Analyzing trace with hash 1228159133, now seen corresponding path program 1 times [2025-02-05 20:27:46,855 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-02-05 20:27:46,855 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1920234648] [2025-02-05 20:27:46,855 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-02-05 20:27:46,856 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-02-05 20:27:46,860 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 166 statements into 1 equivalence classes. [2025-02-05 20:27:46,865 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 166 of 166 statements. [2025-02-05 20:27:46,866 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-02-05 20:27:46,866 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-02-05 20:27:48,451 INFO L134 CoverageAnalysis]: Checked inductivity of 1300 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 1300 trivial. 0 not checked. [2025-02-05 20:27:48,451 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-02-05 20:27:48,451 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1920234648] [2025-02-05 20:27:48,451 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1920234648] provided 1 perfect and 0 imperfect interpolant sequences [2025-02-05 20:27:48,452 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-02-05 20:27:48,452 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [9] imperfect sequences [] total 9 [2025-02-05 20:27:48,452 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1613847309] [2025-02-05 20:27:48,452 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-02-05 20:27:48,452 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 9 states [2025-02-05 20:27:48,452 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-02-05 20:27:48,452 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2025-02-05 20:27:48,453 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=19, Invalid=53, Unknown=0, NotChecked=0, Total=72 [2025-02-05 20:27:48,453 INFO L87 Difference]: Start difference. First operand 225 states and 320 transitions. Second operand has 9 states, 9 states have (on average 4.333333333333333) internal successors, (39), 9 states have internal predecessors, (39), 1 states have call successors, (26), 1 states have call predecessors, (26), 1 states have return successors, (26), 1 states have call predecessors, (26), 1 states have call successors, (26) [2025-02-05 20:27:49,586 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-02-05 20:27:49,586 INFO L93 Difference]: Finished difference Result 294 states and 409 transitions. [2025-02-05 20:27:49,590 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2025-02-05 20:27:49,590 INFO L78 Accepts]: Start accepts. Automaton has has 9 states, 9 states have (on average 4.333333333333333) internal successors, (39), 9 states have internal predecessors, (39), 1 states have call successors, (26), 1 states have call predecessors, (26), 1 states have return successors, (26), 1 states have call predecessors, (26), 1 states have call successors, (26) Word has length 166 [2025-02-05 20:27:49,590 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-02-05 20:27:49,593 INFO L225 Difference]: With dead ends: 294 [2025-02-05 20:27:49,593 INFO L226 Difference]: Without dead ends: 292 [2025-02-05 20:27:49,593 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 13 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 11 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 14 ImplicationChecksByTransitivity, 1.2s TimeCoverageRelationStatistics Valid=39, Invalid=117, Unknown=0, NotChecked=0, Total=156 [2025-02-05 20:27:49,594 INFO L435 NwaCegarLoop]: 155 mSDtfsCounter, 87 mSDsluCounter, 491 mSDsCounter, 0 mSdLazyCounter, 261 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.3s Time, 0 mProtectedPredicate, 0 mProtectedAction, 87 SdHoareTripleChecker+Valid, 646 SdHoareTripleChecker+Invalid, 261 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 261 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.3s IncrementalHoareTripleChecker+Time [2025-02-05 20:27:49,594 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [87 Valid, 646 Invalid, 261 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 261 Invalid, 0 Unknown, 0 Unchecked, 0.3s Time] [2025-02-05 20:27:49,594 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 292 states. [2025-02-05 20:27:49,614 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 292 to 241. [2025-02-05 20:27:49,615 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 241 states, 178 states have (on average 1.303370786516854) internal successors, (232), 179 states have internal predecessors, (232), 56 states have call successors, (56), 6 states have call predecessors, (56), 6 states have return successors, (56), 55 states have call predecessors, (56), 56 states have call successors, (56) [2025-02-05 20:27:49,616 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 241 states to 241 states and 344 transitions. [2025-02-05 20:27:49,617 INFO L78 Accepts]: Start accepts. Automaton has 241 states and 344 transitions. Word has length 166 [2025-02-05 20:27:49,617 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-02-05 20:27:49,617 INFO L471 AbstractCegarLoop]: Abstraction has 241 states and 344 transitions. [2025-02-05 20:27:49,617 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 9 states, 9 states have (on average 4.333333333333333) internal successors, (39), 9 states have internal predecessors, (39), 1 states have call successors, (26), 1 states have call predecessors, (26), 1 states have return successors, (26), 1 states have call predecessors, (26), 1 states have call successors, (26) [2025-02-05 20:27:49,617 INFO L276 IsEmpty]: Start isEmpty. Operand 241 states and 344 transitions. [2025-02-05 20:27:49,618 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 167 [2025-02-05 20:27:49,618 INFO L210 NwaCegarLoop]: Found error trace [2025-02-05 20:27:49,618 INFO L218 NwaCegarLoop]: trace histogram [26, 26, 26, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-02-05 20:27:49,618 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable17 [2025-02-05 20:27:49,619 INFO L396 AbstractCegarLoop]: === Iteration 19 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-02-05 20:27:49,619 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-02-05 20:27:49,619 INFO L85 PathProgramCache]: Analyzing trace with hash 464095706, now seen corresponding path program 1 times [2025-02-05 20:27:49,619 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-02-05 20:27:49,619 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [625554360] [2025-02-05 20:27:49,619 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-02-05 20:27:49,619 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-02-05 20:27:49,627 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 166 statements into 1 equivalence classes. [2025-02-05 20:27:49,635 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 166 of 166 statements. [2025-02-05 20:27:49,635 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-02-05 20:27:49,635 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat