./Ultimate.py --spec ../sv-benchmarks/c/properties/unreach-call.prp --file ../sv-benchmarks/c/hardware-verification-bv/btor2c-lazyMod.h_TreeArb.c --full-output --architecture 64bit -------------------------------------------------------------------------------- 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/hardware-verification-bv/btor2c-lazyMod.h_TreeArb.c -s /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/config/svcomp-Reach-64bit-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 64bit --witnessprinter.graph.data.programhash 889216697607a3ef71c51d8e84a75d701eba6a2c1ee6a0bec339c47f3476a23a --- Real Ultimate output --- This is Ultimate 0.3.0-?-c00e63d-m [2025-02-05 19:14:16,825 INFO L188 SettingsManager]: Resetting all preferences to default values... [2025-02-05 19:14:16,898 INFO L114 SettingsManager]: Loading settings from /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/config/svcomp-Reach-64bit-Automizer_Default.epf [2025-02-05 19:14:16,903 WARN L101 SettingsManager]: Preference file contains the following unknown settings: [2025-02-05 19:14:16,904 WARN L103 SettingsManager]: * de.uni_freiburg.informatik.ultimate.core.Log level for class [2025-02-05 19:14:16,921 INFO L130 SettingsManager]: Preferences different from defaults after loading the file: [2025-02-05 19:14:16,922 INFO L151 SettingsManager]: Preferences of UltimateCore differ from their defaults: [2025-02-05 19:14:16,922 INFO L153 SettingsManager]: * Log level for class=de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher=ERROR; [2025-02-05 19:14:16,923 INFO L151 SettingsManager]: Preferences of Boogie Preprocessor differ from their defaults: [2025-02-05 19:14:16,923 INFO L153 SettingsManager]: * Use memory slicer=true [2025-02-05 19:14:16,923 INFO L151 SettingsManager]: Preferences of Boogie Procedure Inliner differ from their defaults: [2025-02-05 19:14:16,923 INFO L153 SettingsManager]: * Ignore calls to procedures called more than once=ONLY_FOR_SEQUENTIAL_PROGRAMS [2025-02-05 19:14:16,923 INFO L151 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2025-02-05 19:14:16,923 INFO L153 SettingsManager]: * Create parallel compositions if possible=false [2025-02-05 19:14:16,924 INFO L153 SettingsManager]: * Use SBE=true [2025-02-05 19:14:16,924 INFO L151 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2025-02-05 19:14:16,924 INFO L153 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2025-02-05 19:14:16,924 INFO L153 SettingsManager]: * Overapproximate operations on floating types=true [2025-02-05 19:14:16,924 INFO L153 SettingsManager]: * Check division by zero=IGNORE [2025-02-05 19:14:16,924 INFO L153 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2025-02-05 19:14:16,924 INFO L153 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2025-02-05 19:14:16,925 INFO L153 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2025-02-05 19:14:16,925 INFO L153 SettingsManager]: * Check if freed pointer was valid=false [2025-02-05 19:14:16,925 INFO L153 SettingsManager]: * Behaviour of calls to undefined functions=OVERAPPROXIMATE_BEHAVIOUR [2025-02-05 19:14:16,925 INFO L153 SettingsManager]: * Use constant arrays=true [2025-02-05 19:14:16,925 INFO L151 SettingsManager]: Preferences of IcfgBuilder differ from their defaults: [2025-02-05 19:14:16,925 INFO L153 SettingsManager]: * Size of a code block=SequenceOfStatements [2025-02-05 19:14:16,925 INFO L153 SettingsManager]: * Only consider context switches at boundaries of atomic blocks=true [2025-02-05 19:14:16,925 INFO L153 SettingsManager]: * SMT solver=External_DefaultMode [2025-02-05 19:14:16,925 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2025-02-05 19:14:16,926 INFO L151 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2025-02-05 19:14:16,926 INFO L153 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2025-02-05 19:14:16,926 INFO L153 SettingsManager]: * Compute procedure contracts=false [2025-02-05 19:14:16,926 INFO L153 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopHeads [2025-02-05 19:14:16,926 INFO L153 SettingsManager]: * Trace refinement strategy=CAMEL [2025-02-05 19:14:16,926 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2025-02-05 19:14:16,926 INFO L153 SettingsManager]: * Apply one-shot large block encoding in concurrent analysis=false [2025-02-05 19:14:16,926 INFO L153 SettingsManager]: * Automaton type used in concurrency analysis=PETRI_NET [2025-02-05 19:14:16,926 INFO L153 SettingsManager]: * Order on configurations for Petri net unfoldings=DBO [2025-02-05 19:14:16,926 INFO L153 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode [2025-02-05 19:14:16,926 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 -> 64bit Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Graph data programhash -> 889216697607a3ef71c51d8e84a75d701eba6a2c1ee6a0bec339c47f3476a23a [2025-02-05 19:14:17,206 INFO L75 nceAwareModelManager]: Repository-Root is: /tmp [2025-02-05 19:14:17,219 INFO L261 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2025-02-05 19:14:17,223 INFO L217 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2025-02-05 19:14:17,224 INFO L270 PluginConnector]: Initializing CDTParser... [2025-02-05 19:14:17,225 INFO L274 PluginConnector]: CDTParser initialized [2025-02-05 19:14:17,227 INFO L431 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/../sv-benchmarks/c/hardware-verification-bv/btor2c-lazyMod.h_TreeArb.c [2025-02-05 19:14:18,618 INFO L533 CDTParser]: Created temporary CDT project at /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/data/a4e4dc7f0/c11e577aa54248389ee70922f5e9068f/FLAGfa9d7cb03 [2025-02-05 19:14:19,081 INFO L384 CDTParser]: Found 1 translation units. [2025-02-05 19:14:19,082 INFO L180 CDTParser]: Scanning /storage/repos/ultimate-jdk21/releaseScripts/default/sv-benchmarks/c/hardware-verification-bv/btor2c-lazyMod.h_TreeArb.c [2025-02-05 19:14:19,108 INFO L427 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/data/a4e4dc7f0/c11e577aa54248389ee70922f5e9068f/FLAGfa9d7cb03 [2025-02-05 19:14:19,130 INFO L435 CDTParser]: Successfully deleted /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/data/a4e4dc7f0/c11e577aa54248389ee70922f5e9068f [2025-02-05 19:14:19,133 INFO L299 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2025-02-05 19:14:19,135 INFO L133 ToolchainWalker]: Walking toolchain with 6 elements. [2025-02-05 19:14:19,139 INFO L112 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2025-02-05 19:14:19,139 INFO L270 PluginConnector]: Initializing CACSL2BoogieTranslator... [2025-02-05 19:14:19,144 INFO L274 PluginConnector]: CACSL2BoogieTranslator initialized [2025-02-05 19:14:19,145 INFO L184 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 05.02 07:14:19" (1/1) ... [2025-02-05 19:14:19,147 INFO L204 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@49cc8ada and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 05.02 07:14:19, skipping insertion in model container [2025-02-05 19:14:19,148 INFO L184 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 05.02 07:14:19" (1/1) ... [2025-02-05 19:14:19,213 INFO L175 MainTranslator]: Built tables and reachable declarations [2025-02-05 19:14:19,397 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/hardware-verification-bv/btor2c-lazyMod.h_TreeArb.c[1249,1262] [2025-02-05 19:14:19,810 INFO L210 PostProcessor]: Analyzing one entry point: main [2025-02-05 19:14:19,818 INFO L200 MainTranslator]: Completed pre-run [2025-02-05 19:14:19,828 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/hardware-verification-bv/btor2c-lazyMod.h_TreeArb.c[1249,1262] [2025-02-05 19:14:20,005 INFO L210 PostProcessor]: Analyzing one entry point: main [2025-02-05 19:14:20,019 INFO L204 MainTranslator]: Completed translation [2025-02-05 19:14:20,020 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 05.02 07:14:20 WrapperNode [2025-02-05 19:14:20,020 INFO L131 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2025-02-05 19:14:20,021 INFO L112 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2025-02-05 19:14:20,021 INFO L270 PluginConnector]: Initializing Boogie Procedure Inliner... [2025-02-05 19:14:20,021 INFO L274 PluginConnector]: Boogie Procedure Inliner initialized [2025-02-05 19:14:20,027 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 05.02 07:14:20" (1/1) ... [2025-02-05 19:14:20,081 INFO L184 PluginConnector]: Executing the observer Inliner from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 05.02 07:14:20" (1/1) ... [2025-02-05 19:14:20,513 INFO L138 Inliner]: procedures = 17, calls = 8, calls flagged for inlining = 3, calls inlined = 3, statements flattened = 3993 [2025-02-05 19:14:20,513 INFO L131 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2025-02-05 19:14:20,515 INFO L112 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2025-02-05 19:14:20,515 INFO L270 PluginConnector]: Initializing Boogie Preprocessor... [2025-02-05 19:14:20,515 INFO L274 PluginConnector]: Boogie Preprocessor initialized [2025-02-05 19:14:20,524 INFO L184 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 05.02 07:14:20" (1/1) ... [2025-02-05 19:14:20,524 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 05.02 07:14:20" (1/1) ... [2025-02-05 19:14:20,610 INFO L184 PluginConnector]: Executing the observer MemorySlicer from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 05.02 07:14:20" (1/1) ... [2025-02-05 19:14:20,782 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 19:14:20,791 INFO L184 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 05.02 07:14:20" (1/1) ... [2025-02-05 19:14:20,792 INFO L184 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 05.02 07:14:20" (1/1) ... [2025-02-05 19:14:20,949 INFO L184 PluginConnector]: Executing the observer ReplaceArrayAssignments from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 05.02 07:14:20" (1/1) ... [2025-02-05 19:14:20,979 INFO L184 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 05.02 07:14:20" (1/1) ... [2025-02-05 19:14:21,011 INFO L184 PluginConnector]: Executing the observer LTLStepAnnotator from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 05.02 07:14:20" (1/1) ... [2025-02-05 19:14:21,035 INFO L184 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 05.02 07:14:20" (1/1) ... [2025-02-05 19:14:21,086 INFO L131 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2025-02-05 19:14:21,088 INFO L112 PluginConnector]: ------------------------IcfgBuilder---------------------------- [2025-02-05 19:14:21,089 INFO L270 PluginConnector]: Initializing IcfgBuilder... [2025-02-05 19:14:21,089 INFO L274 PluginConnector]: IcfgBuilder initialized [2025-02-05 19:14:21,090 INFO L184 PluginConnector]: Executing the observer IcfgBuilderObserver from plugin IcfgBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 05.02 07:14:20" (1/1) ... [2025-02-05 19:14:21,097 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2025-02-05 19:14:21,110 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 [2025-02-05 19:14:21,125 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 19:14:21,128 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 19:14:21,148 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocInit [2025-02-05 19:14:21,149 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int#0 [2025-02-05 19:14:21,149 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2025-02-05 19:14:21,149 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2025-02-05 19:14:21,571 INFO L257 CfgBuilder]: Building ICFG [2025-02-05 19:14:21,573 INFO L287 CfgBuilder]: Building CFG for each procedure with an implementation [2025-02-05 19:14:24,758 INFO L? ?]: Removed 2723 outVars from TransFormulas that were not future-live. [2025-02-05 19:14:24,759 INFO L308 CfgBuilder]: Performing block encoding [2025-02-05 19:14:24,899 INFO L332 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2025-02-05 19:14:24,899 INFO L337 CfgBuilder]: Removed 0 assume(true) statements. [2025-02-05 19:14:24,899 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.icfgbuilder CFG 05.02 07:14:24 BoogieIcfgContainer [2025-02-05 19:14:24,902 INFO L131 PluginConnector]: ------------------------ END IcfgBuilder---------------------------- [2025-02-05 19:14:24,905 INFO L112 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2025-02-05 19:14:24,905 INFO L270 PluginConnector]: Initializing TraceAbstraction... [2025-02-05 19:14:24,910 INFO L274 PluginConnector]: TraceAbstraction initialized [2025-02-05 19:14:24,910 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 05.02 07:14:19" (1/3) ... [2025-02-05 19:14:24,911 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@75e8095f and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 05.02 07:14:24, skipping insertion in model container [2025-02-05 19:14:24,911 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 05.02 07:14:20" (2/3) ... [2025-02-05 19:14:24,912 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@75e8095f and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 05.02 07:14:24, skipping insertion in model container [2025-02-05 19:14:24,913 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.icfgbuilder CFG 05.02 07:14:24" (3/3) ... [2025-02-05 19:14:24,914 INFO L128 eAbstractionObserver]: Analyzing ICFG btor2c-lazyMod.h_TreeArb.c [2025-02-05 19:14:24,929 INFO L216 ceAbstractionStarter]: Automizer settings: Hoare:LoopHeads NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2025-02-05 19:14:24,931 INFO L151 ceAbstractionStarter]: Applying trace abstraction to ICFG btor2c-lazyMod.h_TreeArb.c that has 1 procedures, 726 locations, 1 initial locations, 1 loop locations, and 1 error locations. [2025-02-05 19:14:24,999 INFO L332 AbstractCegarLoop]: ======== Iteration 0 == of CEGAR loop == AllErrorsAtOnce ======== [2025-02-05 19:14:25,013 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;@d9d8846, mLbeIndependenceSettings=[IndependenceType=SEMANTIC, AbstractionType=NONE, UseConditional=false, UseSemiCommutativity=true, Solver=Z3, SolverTimeout=1000ms] [2025-02-05 19:14:25,013 INFO L334 AbstractCegarLoop]: Starting to check reachability of 1 error locations. [2025-02-05 19:14:25,019 INFO L276 IsEmpty]: Start isEmpty. Operand has 726 states, 724 states have (on average 1.4986187845303867) internal successors, (1085), 725 states have internal predecessors, (1085), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-02-05 19:14:25,026 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 86 [2025-02-05 19:14:25,026 INFO L210 NwaCegarLoop]: Found error trace [2025-02-05 19:14:25,027 INFO L218 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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 19:14:25,027 INFO L396 AbstractCegarLoop]: === Iteration 1 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-02-05 19:14:25,031 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-02-05 19:14:25,031 INFO L85 PathProgramCache]: Analyzing trace with hash -1864099079, now seen corresponding path program 1 times [2025-02-05 19:14:25,037 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-02-05 19:14:25,038 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1150215108] [2025-02-05 19:14:25,038 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-02-05 19:14:25,038 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-02-05 19:14:25,192 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 85 statements into 1 equivalence classes. [2025-02-05 19:14:25,385 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 85 of 85 statements. [2025-02-05 19:14:25,385 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-02-05 19:14:25,386 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-02-05 19:14:26,220 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-02-05 19:14:26,220 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-02-05 19:14:26,220 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1150215108] [2025-02-05 19:14:26,221 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1150215108] provided 1 perfect and 0 imperfect interpolant sequences [2025-02-05 19:14:26,221 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-02-05 19:14:26,222 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2025-02-05 19:14:26,223 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [286213395] [2025-02-05 19:14:26,224 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-02-05 19:14:26,227 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2025-02-05 19:14:26,227 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-02-05 19:14:26,242 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2025-02-05 19:14:26,242 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2025-02-05 19:14:26,245 INFO L87 Difference]: Start difference. First operand has 726 states, 724 states have (on average 1.4986187845303867) internal successors, (1085), 725 states have internal predecessors, (1085), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Second operand has 4 states, 4 states have (on average 21.25) internal successors, (85), 4 states have internal predecessors, (85), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-02-05 19:14:26,817 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-02-05 19:14:26,817 INFO L93 Difference]: Finished difference Result 1389 states and 2079 transitions. [2025-02-05 19:14:26,821 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2025-02-05 19:14:26,823 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 4 states have (on average 21.25) internal successors, (85), 4 states have internal predecessors, (85), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 85 [2025-02-05 19:14:26,823 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-02-05 19:14:26,838 INFO L225 Difference]: With dead ends: 1389 [2025-02-05 19:14:26,838 INFO L226 Difference]: Without dead ends: 725 [2025-02-05 19:14:26,844 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 4 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 2 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2025-02-05 19:14:26,848 INFO L435 NwaCegarLoop]: 900 mSDtfsCounter, 0 mSDsluCounter, 1795 mSDsCounter, 0 mSdLazyCounter, 547 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.4s Time, 0 mProtectedPredicate, 0 mProtectedAction, 0 SdHoareTripleChecker+Valid, 2695 SdHoareTripleChecker+Invalid, 547 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 547 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.5s IncrementalHoareTripleChecker+Time [2025-02-05 19:14:26,848 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [0 Valid, 2695 Invalid, 547 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 547 Invalid, 0 Unknown, 0 Unchecked, 0.5s Time] [2025-02-05 19:14:26,863 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 725 states. [2025-02-05 19:14:26,922 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 725 to 725. [2025-02-05 19:14:26,924 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 725 states, 724 states have (on average 1.4958563535911602) internal successors, (1083), 724 states have internal predecessors, (1083), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-02-05 19:14:26,933 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 725 states to 725 states and 1083 transitions. [2025-02-05 19:14:26,934 INFO L78 Accepts]: Start accepts. Automaton has 725 states and 1083 transitions. Word has length 85 [2025-02-05 19:14:26,935 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-02-05 19:14:26,935 INFO L471 AbstractCegarLoop]: Abstraction has 725 states and 1083 transitions. [2025-02-05 19:14:26,935 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 21.25) internal successors, (85), 4 states have internal predecessors, (85), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-02-05 19:14:26,935 INFO L276 IsEmpty]: Start isEmpty. Operand 725 states and 1083 transitions. [2025-02-05 19:14:26,938 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 87 [2025-02-05 19:14:26,938 INFO L210 NwaCegarLoop]: Found error trace [2025-02-05 19:14:26,938 INFO L218 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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 19:14:26,938 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable0 [2025-02-05 19:14:26,939 INFO L396 AbstractCegarLoop]: === Iteration 2 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-02-05 19:14:26,939 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-02-05 19:14:26,939 INFO L85 PathProgramCache]: Analyzing trace with hash -1947816483, now seen corresponding path program 1 times [2025-02-05 19:14:26,939 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-02-05 19:14:26,940 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1485441558] [2025-02-05 19:14:26,940 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-02-05 19:14:26,940 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-02-05 19:14:27,002 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 86 statements into 1 equivalence classes. [2025-02-05 19:14:27,053 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 86 of 86 statements. [2025-02-05 19:14:27,054 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-02-05 19:14:27,054 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-02-05 19:14:27,387 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-02-05 19:14:27,387 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-02-05 19:14:27,387 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1485441558] [2025-02-05 19:14:27,388 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1485441558] provided 1 perfect and 0 imperfect interpolant sequences [2025-02-05 19:14:27,388 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-02-05 19:14:27,388 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2025-02-05 19:14:27,388 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [649337779] [2025-02-05 19:14:27,388 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-02-05 19:14:27,390 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2025-02-05 19:14:27,390 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-02-05 19:14:27,391 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2025-02-05 19:14:27,391 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2025-02-05 19:14:27,391 INFO L87 Difference]: Start difference. First operand 725 states and 1083 transitions. Second operand has 4 states, 4 states have (on average 21.5) internal successors, (86), 4 states have internal predecessors, (86), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-02-05 19:14:27,804 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-02-05 19:14:27,805 INFO L93 Difference]: Finished difference Result 1390 states and 2077 transitions. [2025-02-05 19:14:27,805 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2025-02-05 19:14:27,806 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 4 states have (on average 21.5) internal successors, (86), 4 states have internal predecessors, (86), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 86 [2025-02-05 19:14:27,806 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-02-05 19:14:27,810 INFO L225 Difference]: With dead ends: 1390 [2025-02-05 19:14:27,810 INFO L226 Difference]: Without dead ends: 727 [2025-02-05 19:14:27,811 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 5 GetRequests, 3 SyntacticMatches, 0 SemanticMatches, 2 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2025-02-05 19:14:27,812 INFO L435 NwaCegarLoop]: 900 mSDtfsCounter, 0 mSDsluCounter, 1792 mSDsCounter, 0 mSdLazyCounter, 550 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.3s Time, 0 mProtectedPredicate, 0 mProtectedAction, 0 SdHoareTripleChecker+Valid, 2692 SdHoareTripleChecker+Invalid, 550 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 550 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.4s IncrementalHoareTripleChecker+Time [2025-02-05 19:14:27,812 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [0 Valid, 2692 Invalid, 550 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 550 Invalid, 0 Unknown, 0 Unchecked, 0.4s Time] [2025-02-05 19:14:27,814 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 727 states. [2025-02-05 19:14:27,828 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 727 to 727. [2025-02-05 19:14:27,830 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 727 states, 726 states have (on average 1.4944903581267217) internal successors, (1085), 726 states have internal predecessors, (1085), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-02-05 19:14:27,833 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 727 states to 727 states and 1085 transitions. [2025-02-05 19:14:27,834 INFO L78 Accepts]: Start accepts. Automaton has 727 states and 1085 transitions. Word has length 86 [2025-02-05 19:14:27,834 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-02-05 19:14:27,834 INFO L471 AbstractCegarLoop]: Abstraction has 727 states and 1085 transitions. [2025-02-05 19:14:27,834 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 21.5) internal successors, (86), 4 states have internal predecessors, (86), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-02-05 19:14:27,834 INFO L276 IsEmpty]: Start isEmpty. Operand 727 states and 1085 transitions. [2025-02-05 19:14:27,837 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 88 [2025-02-05 19:14:27,837 INFO L210 NwaCegarLoop]: Found error trace [2025-02-05 19:14:27,837 INFO L218 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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 19:14:27,837 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable1 [2025-02-05 19:14:27,837 INFO L396 AbstractCegarLoop]: === Iteration 3 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-02-05 19:14:27,838 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-02-05 19:14:27,838 INFO L85 PathProgramCache]: Analyzing trace with hash 1678741364, now seen corresponding path program 1 times [2025-02-05 19:14:27,838 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-02-05 19:14:27,838 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [440313034] [2025-02-05 19:14:27,838 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-02-05 19:14:27,838 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-02-05 19:14:27,902 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 87 statements into 1 equivalence classes. [2025-02-05 19:14:28,080 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 87 of 87 statements. [2025-02-05 19:14:28,081 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-02-05 19:14:28,081 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-02-05 19:14:28,719 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-02-05 19:14:28,721 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-02-05 19:14:28,721 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [440313034] [2025-02-05 19:14:28,721 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [440313034] provided 1 perfect and 0 imperfect interpolant sequences [2025-02-05 19:14:28,721 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-02-05 19:14:28,722 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2025-02-05 19:14:28,722 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [767689014] [2025-02-05 19:14:28,722 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-02-05 19:14:28,722 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2025-02-05 19:14:28,723 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-02-05 19:14:28,724 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2025-02-05 19:14:28,724 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=9, Invalid=21, Unknown=0, NotChecked=0, Total=30 [2025-02-05 19:14:28,724 INFO L87 Difference]: Start difference. First operand 727 states and 1085 transitions. Second operand has 6 states, 6 states have (on average 14.5) internal successors, (87), 6 states have internal predecessors, (87), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-02-05 19:14:29,304 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-02-05 19:14:29,305 INFO L93 Difference]: Finished difference Result 1397 states and 2086 transitions. [2025-02-05 19:14:29,306 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2025-02-05 19:14:29,306 INFO L78 Accepts]: Start accepts. Automaton has has 6 states, 6 states have (on average 14.5) internal successors, (87), 6 states have internal predecessors, (87), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 87 [2025-02-05 19:14:29,307 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-02-05 19:14:29,314 INFO L225 Difference]: With dead ends: 1397 [2025-02-05 19:14:29,316 INFO L226 Difference]: Without dead ends: 732 [2025-02-05 19:14:29,317 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 7 GetRequests, 3 SyntacticMatches, 0 SemanticMatches, 4 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=9, Invalid=21, Unknown=0, NotChecked=0, Total=30 [2025-02-05 19:14:29,318 INFO L435 NwaCegarLoop]: 896 mSDtfsCounter, 1 mSDsluCounter, 3572 mSDsCounter, 0 mSdLazyCounter, 936 mSolverCounterSat, 1 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.4s Time, 0 mProtectedPredicate, 0 mProtectedAction, 1 SdHoareTripleChecker+Valid, 4468 SdHoareTripleChecker+Invalid, 937 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 1 IncrementalHoareTripleChecker+Valid, 936 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.5s IncrementalHoareTripleChecker+Time [2025-02-05 19:14:29,319 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [1 Valid, 4468 Invalid, 937 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [1 Valid, 936 Invalid, 0 Unknown, 0 Unchecked, 0.5s Time] [2025-02-05 19:14:29,321 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 732 states. [2025-02-05 19:14:29,341 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 732 to 732. [2025-02-05 19:14:29,344 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 732 states, 731 states have (on average 1.4924760601915186) internal successors, (1091), 731 states have internal predecessors, (1091), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-02-05 19:14:29,346 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 732 states to 732 states and 1091 transitions. [2025-02-05 19:14:29,346 INFO L78 Accepts]: Start accepts. Automaton has 732 states and 1091 transitions. Word has length 87 [2025-02-05 19:14:29,347 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-02-05 19:14:29,347 INFO L471 AbstractCegarLoop]: Abstraction has 732 states and 1091 transitions. [2025-02-05 19:14:29,347 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 6 states have (on average 14.5) internal successors, (87), 6 states have internal predecessors, (87), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-02-05 19:14:29,347 INFO L276 IsEmpty]: Start isEmpty. Operand 732 states and 1091 transitions. [2025-02-05 19:14:29,349 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 89 [2025-02-05 19:14:29,352 INFO L210 NwaCegarLoop]: Found error trace [2025-02-05 19:14:29,353 INFO L218 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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 19:14:29,353 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable2 [2025-02-05 19:14:29,353 INFO L396 AbstractCegarLoop]: === Iteration 4 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-02-05 19:14:29,353 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-02-05 19:14:29,353 INFO L85 PathProgramCache]: Analyzing trace with hash -419549241, now seen corresponding path program 1 times [2025-02-05 19:14:29,354 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-02-05 19:14:29,354 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [351951904] [2025-02-05 19:14:29,354 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-02-05 19:14:29,354 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-02-05 19:14:29,408 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 88 statements into 1 equivalence classes. [2025-02-05 19:14:29,556 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 88 of 88 statements. [2025-02-05 19:14:29,556 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-02-05 19:14:29,556 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-02-05 19:14:30,191 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-02-05 19:14:30,192 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-02-05 19:14:30,192 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [351951904] [2025-02-05 19:14:30,192 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [351951904] provided 1 perfect and 0 imperfect interpolant sequences [2025-02-05 19:14:30,192 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-02-05 19:14:30,192 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2025-02-05 19:14:30,192 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2070622820] [2025-02-05 19:14:30,193 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-02-05 19:14:30,193 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 7 states [2025-02-05 19:14:30,193 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-02-05 19:14:30,194 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2025-02-05 19:14:30,194 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=11, Invalid=31, Unknown=0, NotChecked=0, Total=42 [2025-02-05 19:14:30,194 INFO L87 Difference]: Start difference. First operand 732 states and 1091 transitions. Second operand has 7 states, 7 states have (on average 12.571428571428571) internal successors, (88), 7 states have internal predecessors, (88), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-02-05 19:14:31,309 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-02-05 19:14:31,310 INFO L93 Difference]: Finished difference Result 1953 states and 2911 transitions. [2025-02-05 19:14:31,310 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2025-02-05 19:14:31,310 INFO L78 Accepts]: Start accepts. Automaton has has 7 states, 7 states have (on average 12.571428571428571) internal successors, (88), 7 states have internal predecessors, (88), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 88 [2025-02-05 19:14:31,311 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-02-05 19:14:31,316 INFO L225 Difference]: With dead ends: 1953 [2025-02-05 19:14:31,317 INFO L226 Difference]: Without dead ends: 1283 [2025-02-05 19:14:31,321 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 12 GetRequests, 3 SyntacticMatches, 0 SemanticMatches, 9 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 3 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=33, Invalid=77, Unknown=0, NotChecked=0, Total=110 [2025-02-05 19:14:31,322 INFO L435 NwaCegarLoop]: 846 mSDtfsCounter, 2628 mSDsluCounter, 3379 mSDsCounter, 0 mSdLazyCounter, 1180 mSolverCounterSat, 1 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.8s Time, 0 mProtectedPredicate, 0 mProtectedAction, 2628 SdHoareTripleChecker+Valid, 4225 SdHoareTripleChecker+Invalid, 1181 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 1 IncrementalHoareTripleChecker+Valid, 1180 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 1.0s IncrementalHoareTripleChecker+Time [2025-02-05 19:14:31,323 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [2628 Valid, 4225 Invalid, 1181 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [1 Valid, 1180 Invalid, 0 Unknown, 0 Unchecked, 1.0s Time] [2025-02-05 19:14:31,326 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1283 states. [2025-02-05 19:14:31,351 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1283 to 817. [2025-02-05 19:14:31,352 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 817 states, 816 states have (on average 1.491421568627451) internal successors, (1217), 816 states have internal predecessors, (1217), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-02-05 19:14:31,356 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 817 states to 817 states and 1217 transitions. [2025-02-05 19:14:31,356 INFO L78 Accepts]: Start accepts. Automaton has 817 states and 1217 transitions. Word has length 88 [2025-02-05 19:14:31,357 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-02-05 19:14:31,357 INFO L471 AbstractCegarLoop]: Abstraction has 817 states and 1217 transitions. [2025-02-05 19:14:31,358 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 7 states, 7 states have (on average 12.571428571428571) internal successors, (88), 7 states have internal predecessors, (88), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-02-05 19:14:31,358 INFO L276 IsEmpty]: Start isEmpty. Operand 817 states and 1217 transitions. [2025-02-05 19:14:31,359 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 89 [2025-02-05 19:14:31,361 INFO L210 NwaCegarLoop]: Found error trace [2025-02-05 19:14:31,361 INFO L218 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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 19:14:31,361 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable3 [2025-02-05 19:14:31,362 INFO L396 AbstractCegarLoop]: === Iteration 5 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-02-05 19:14:31,362 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-02-05 19:14:31,362 INFO L85 PathProgramCache]: Analyzing trace with hash -1905229086, now seen corresponding path program 1 times [2025-02-05 19:14:31,363 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-02-05 19:14:31,363 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2142323782] [2025-02-05 19:14:31,363 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-02-05 19:14:31,364 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-02-05 19:14:31,414 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 88 statements into 1 equivalence classes. [2025-02-05 19:14:31,548 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 88 of 88 statements. [2025-02-05 19:14:31,548 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-02-05 19:14:31,549 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-02-05 19:14:31,848 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-02-05 19:14:31,849 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-02-05 19:14:31,849 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2142323782] [2025-02-05 19:14:31,849 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [2142323782] provided 1 perfect and 0 imperfect interpolant sequences [2025-02-05 19:14:31,849 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-02-05 19:14:31,849 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2025-02-05 19:14:31,849 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1401254703] [2025-02-05 19:14:31,849 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-02-05 19:14:31,850 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 7 states [2025-02-05 19:14:31,850 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-02-05 19:14:31,850 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2025-02-05 19:14:31,850 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=11, Invalid=31, Unknown=0, NotChecked=0, Total=42 [2025-02-05 19:14:31,851 INFO L87 Difference]: Start difference. First operand 817 states and 1217 transitions. Second operand has 7 states, 7 states have (on average 12.571428571428571) internal successors, (88), 7 states have internal predecessors, (88), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-02-05 19:14:32,510 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-02-05 19:14:32,510 INFO L93 Difference]: Finished difference Result 1576 states and 2347 transitions. [2025-02-05 19:14:32,511 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2025-02-05 19:14:32,511 INFO L78 Accepts]: Start accepts. Automaton has has 7 states, 7 states have (on average 12.571428571428571) internal successors, (88), 7 states have internal predecessors, (88), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 88 [2025-02-05 19:14:32,511 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-02-05 19:14:32,515 INFO L225 Difference]: With dead ends: 1576 [2025-02-05 19:14:32,516 INFO L226 Difference]: Without dead ends: 880 [2025-02-05 19:14:32,517 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 8 GetRequests, 3 SyntacticMatches, 0 SemanticMatches, 5 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=11, Invalid=31, Unknown=0, NotChecked=0, Total=42 [2025-02-05 19:14:32,519 INFO L435 NwaCegarLoop]: 895 mSDtfsCounter, 29 mSDsluCounter, 4462 mSDsCounter, 0 mSdLazyCounter, 1128 mSolverCounterSat, 1 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.5s Time, 0 mProtectedPredicate, 0 mProtectedAction, 29 SdHoareTripleChecker+Valid, 5357 SdHoareTripleChecker+Invalid, 1129 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 1 IncrementalHoareTripleChecker+Valid, 1128 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.6s IncrementalHoareTripleChecker+Time [2025-02-05 19:14:32,519 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [29 Valid, 5357 Invalid, 1129 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [1 Valid, 1128 Invalid, 0 Unknown, 0 Unchecked, 0.6s Time] [2025-02-05 19:14:32,522 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 880 states. [2025-02-05 19:14:32,535 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 880 to 880. [2025-02-05 19:14:32,536 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 880 states, 879 states have (on average 1.4869169510807736) internal successors, (1307), 879 states have internal predecessors, (1307), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-02-05 19:14:32,539 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 880 states to 880 states and 1307 transitions. [2025-02-05 19:14:32,539 INFO L78 Accepts]: Start accepts. Automaton has 880 states and 1307 transitions. Word has length 88 [2025-02-05 19:14:32,539 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-02-05 19:14:32,540 INFO L471 AbstractCegarLoop]: Abstraction has 880 states and 1307 transitions. [2025-02-05 19:14:32,540 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 7 states, 7 states have (on average 12.571428571428571) internal successors, (88), 7 states have internal predecessors, (88), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-02-05 19:14:32,541 INFO L276 IsEmpty]: Start isEmpty. Operand 880 states and 1307 transitions. [2025-02-05 19:14:32,584 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 90 [2025-02-05 19:14:32,588 INFO L210 NwaCegarLoop]: Found error trace [2025-02-05 19:14:32,589 INFO L218 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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 19:14:32,589 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable4 [2025-02-05 19:14:32,589 INFO L396 AbstractCegarLoop]: === Iteration 6 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-02-05 19:14:32,590 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-02-05 19:14:32,590 INFO L85 PathProgramCache]: Analyzing trace with hash 1131916812, now seen corresponding path program 1 times [2025-02-05 19:14:32,590 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-02-05 19:14:32,590 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1685853134] [2025-02-05 19:14:32,590 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-02-05 19:14:32,590 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-02-05 19:14:32,703 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 89 statements into 1 equivalence classes. [2025-02-05 19:14:32,762 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 89 of 89 statements. [2025-02-05 19:14:32,762 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-02-05 19:14:32,762 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-02-05 19:14:33,103 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-02-05 19:14:33,104 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-02-05 19:14:33,104 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1685853134] [2025-02-05 19:14:33,104 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1685853134] provided 1 perfect and 0 imperfect interpolant sequences [2025-02-05 19:14:33,104 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-02-05 19:14:33,104 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2025-02-05 19:14:33,105 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1792649956] [2025-02-05 19:14:33,105 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-02-05 19:14:33,105 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2025-02-05 19:14:33,105 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-02-05 19:14:33,106 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2025-02-05 19:14:33,106 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2025-02-05 19:14:33,106 INFO L87 Difference]: Start difference. First operand 880 states and 1307 transitions. Second operand has 5 states, 5 states have (on average 17.8) internal successors, (89), 5 states have internal predecessors, (89), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-02-05 19:14:33,537 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-02-05 19:14:33,537 INFO L93 Difference]: Finished difference Result 1677 states and 2492 transitions. [2025-02-05 19:14:33,538 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2025-02-05 19:14:33,538 INFO L78 Accepts]: Start accepts. Automaton has has 5 states, 5 states have (on average 17.8) internal successors, (89), 5 states have internal predecessors, (89), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 89 [2025-02-05 19:14:33,538 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-02-05 19:14:33,542 INFO L225 Difference]: With dead ends: 1677 [2025-02-05 19:14:33,542 INFO L226 Difference]: Without dead ends: 944 [2025-02-05 19:14:33,543 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 6 GetRequests, 3 SyntacticMatches, 0 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2025-02-05 19:14:33,544 INFO L435 NwaCegarLoop]: 899 mSDtfsCounter, 28 mSDsluCounter, 2688 mSDsCounter, 0 mSdLazyCounter, 736 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.3s Time, 0 mProtectedPredicate, 0 mProtectedAction, 28 SdHoareTripleChecker+Valid, 3587 SdHoareTripleChecker+Invalid, 736 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 736 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.4s IncrementalHoareTripleChecker+Time [2025-02-05 19:14:33,544 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [28 Valid, 3587 Invalid, 736 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 736 Invalid, 0 Unknown, 0 Unchecked, 0.4s Time] [2025-02-05 19:14:33,545 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 944 states. [2025-02-05 19:14:33,559 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 944 to 944. [2025-02-05 19:14:33,561 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 944 states, 943 states have (on average 1.4835630965005302) internal successors, (1399), 943 states have internal predecessors, (1399), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-02-05 19:14:33,564 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 944 states to 944 states and 1399 transitions. [2025-02-05 19:14:33,564 INFO L78 Accepts]: Start accepts. Automaton has 944 states and 1399 transitions. Word has length 89 [2025-02-05 19:14:33,564 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-02-05 19:14:33,564 INFO L471 AbstractCegarLoop]: Abstraction has 944 states and 1399 transitions. [2025-02-05 19:14:33,564 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 17.8) internal successors, (89), 5 states have internal predecessors, (89), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-02-05 19:14:33,564 INFO L276 IsEmpty]: Start isEmpty. Operand 944 states and 1399 transitions. [2025-02-05 19:14:33,567 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 90 [2025-02-05 19:14:33,567 INFO L210 NwaCegarLoop]: Found error trace [2025-02-05 19:14:33,567 INFO L218 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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 19:14:33,568 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable5 [2025-02-05 19:14:33,568 INFO L396 AbstractCegarLoop]: === Iteration 7 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-02-05 19:14:33,568 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-02-05 19:14:33,569 INFO L85 PathProgramCache]: Analyzing trace with hash -791771441, now seen corresponding path program 1 times [2025-02-05 19:14:33,569 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-02-05 19:14:33,569 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1280511569] [2025-02-05 19:14:33,569 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-02-05 19:14:33,570 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-02-05 19:14:33,610 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 89 statements into 1 equivalence classes. [2025-02-05 19:14:33,716 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 89 of 89 statements. [2025-02-05 19:14:33,717 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-02-05 19:14:33,717 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-02-05 19:14:34,328 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-02-05 19:14:34,329 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-02-05 19:14:34,330 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1280511569] [2025-02-05 19:14:34,330 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1280511569] provided 1 perfect and 0 imperfect interpolant sequences [2025-02-05 19:14:34,330 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-02-05 19:14:34,330 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [9] imperfect sequences [] total 9 [2025-02-05 19:14:34,330 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [15811720] [2025-02-05 19:14:34,330 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-02-05 19:14:34,330 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 9 states [2025-02-05 19:14:34,331 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-02-05 19:14:34,331 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2025-02-05 19:14:34,331 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=15, Invalid=57, Unknown=0, NotChecked=0, Total=72 [2025-02-05 19:14:34,331 INFO L87 Difference]: Start difference. First operand 944 states and 1399 transitions. Second operand has 9 states, 9 states have (on average 9.88888888888889) internal successors, (89), 9 states have internal predecessors, (89), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-02-05 19:14:35,808 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-02-05 19:14:35,809 INFO L93 Difference]: Finished difference Result 2223 states and 3293 transitions. [2025-02-05 19:14:35,809 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2025-02-05 19:14:35,809 INFO L78 Accepts]: Start accepts. Automaton has has 9 states, 9 states have (on average 9.88888888888889) internal successors, (89), 9 states have internal predecessors, (89), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 89 [2025-02-05 19:14:35,809 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-02-05 19:14:35,815 INFO L225 Difference]: With dead ends: 2223 [2025-02-05 19:14:35,815 INFO L226 Difference]: Without dead ends: 1458 [2025-02-05 19:14:35,817 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 14 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 12 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 6 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=43, Invalid=139, Unknown=0, NotChecked=0, Total=182 [2025-02-05 19:14:35,818 INFO L435 NwaCegarLoop]: 846 mSDtfsCounter, 2707 mSDsluCounter, 5064 mSDsCounter, 0 mSdLazyCounter, 1657 mSolverCounterSat, 2 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 1.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 2707 SdHoareTripleChecker+Valid, 5910 SdHoareTripleChecker+Invalid, 1659 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 2 IncrementalHoareTripleChecker+Valid, 1657 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 1.3s IncrementalHoareTripleChecker+Time [2025-02-05 19:14:35,819 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [2707 Valid, 5910 Invalid, 1659 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [2 Valid, 1657 Invalid, 0 Unknown, 0 Unchecked, 1.3s Time] [2025-02-05 19:14:35,822 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1458 states. [2025-02-05 19:14:35,842 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1458 to 964. [2025-02-05 19:14:35,844 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 964 states, 963 states have (on average 1.4818276220145379) internal successors, (1427), 963 states have internal predecessors, (1427), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-02-05 19:14:35,847 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 964 states to 964 states and 1427 transitions. [2025-02-05 19:14:35,848 INFO L78 Accepts]: Start accepts. Automaton has 964 states and 1427 transitions. Word has length 89 [2025-02-05 19:14:35,848 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-02-05 19:14:35,848 INFO L471 AbstractCegarLoop]: Abstraction has 964 states and 1427 transitions. [2025-02-05 19:14:35,848 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 9 states, 9 states have (on average 9.88888888888889) internal successors, (89), 9 states have internal predecessors, (89), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-02-05 19:14:35,848 INFO L276 IsEmpty]: Start isEmpty. Operand 964 states and 1427 transitions. [2025-02-05 19:14:35,850 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 90 [2025-02-05 19:14:35,850 INFO L210 NwaCegarLoop]: Found error trace [2025-02-05 19:14:35,850 INFO L218 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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 19:14:35,851 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable6 [2025-02-05 19:14:35,851 INFO L396 AbstractCegarLoop]: === Iteration 8 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-02-05 19:14:35,851 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-02-05 19:14:35,851 INFO L85 PathProgramCache]: Analyzing trace with hash 1358350279, now seen corresponding path program 1 times [2025-02-05 19:14:35,851 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-02-05 19:14:35,851 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [911627330] [2025-02-05 19:14:35,851 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-02-05 19:14:35,851 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-02-05 19:14:35,897 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 89 statements into 1 equivalence classes. [2025-02-05 19:14:35,985 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 89 of 89 statements. [2025-02-05 19:14:35,985 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-02-05 19:14:35,985 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-02-05 19:14:36,506 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-02-05 19:14:36,506 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-02-05 19:14:36,506 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [911627330] [2025-02-05 19:14:36,507 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [911627330] provided 1 perfect and 0 imperfect interpolant sequences [2025-02-05 19:14:36,507 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-02-05 19:14:36,507 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [8] imperfect sequences [] total 8 [2025-02-05 19:14:36,507 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1944441912] [2025-02-05 19:14:36,507 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-02-05 19:14:36,507 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 8 states [2025-02-05 19:14:36,507 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-02-05 19:14:36,508 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2025-02-05 19:14:36,508 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=13, Invalid=43, Unknown=0, NotChecked=0, Total=56 [2025-02-05 19:14:36,508 INFO L87 Difference]: Start difference. First operand 964 states and 1427 transitions. Second operand has 8 states, 8 states have (on average 11.125) internal successors, (89), 8 states have internal predecessors, (89), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-02-05 19:14:37,594 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-02-05 19:14:37,594 INFO L93 Difference]: Finished difference Result 2264 states and 3351 transitions. [2025-02-05 19:14:37,595 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2025-02-05 19:14:37,595 INFO L78 Accepts]: Start accepts. Automaton has has 8 states, 8 states have (on average 11.125) internal successors, (89), 8 states have internal predecessors, (89), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 89 [2025-02-05 19:14:37,595 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-02-05 19:14:37,600 INFO L225 Difference]: With dead ends: 2264 [2025-02-05 19:14:37,600 INFO L226 Difference]: Without dead ends: 1412 [2025-02-05 19:14:37,601 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 14 GetRequests, 3 SyntacticMatches, 0 SemanticMatches, 11 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 6 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=41, Invalid=115, Unknown=0, NotChecked=0, Total=156 [2025-02-05 19:14:37,602 INFO L435 NwaCegarLoop]: 846 mSDtfsCounter, 2534 mSDsluCounter, 4223 mSDsCounter, 0 mSdLazyCounter, 1417 mSolverCounterSat, 1 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.8s Time, 0 mProtectedPredicate, 0 mProtectedAction, 2534 SdHoareTripleChecker+Valid, 5069 SdHoareTripleChecker+Invalid, 1418 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 1 IncrementalHoareTripleChecker+Valid, 1417 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 1.0s IncrementalHoareTripleChecker+Time [2025-02-05 19:14:37,602 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [2534 Valid, 5069 Invalid, 1418 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [1 Valid, 1417 Invalid, 0 Unknown, 0 Unchecked, 1.0s Time] [2025-02-05 19:14:37,604 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1412 states. [2025-02-05 19:14:37,618 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1412 to 990. [2025-02-05 19:14:37,619 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 990 states, 989 states have (on average 1.4792719919110213) internal successors, (1463), 989 states have internal predecessors, (1463), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-02-05 19:14:37,622 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 990 states to 990 states and 1463 transitions. [2025-02-05 19:14:37,622 INFO L78 Accepts]: Start accepts. Automaton has 990 states and 1463 transitions. Word has length 89 [2025-02-05 19:14:37,622 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-02-05 19:14:37,622 INFO L471 AbstractCegarLoop]: Abstraction has 990 states and 1463 transitions. [2025-02-05 19:14:37,622 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 8 states, 8 states have (on average 11.125) internal successors, (89), 8 states have internal predecessors, (89), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-02-05 19:14:37,622 INFO L276 IsEmpty]: Start isEmpty. Operand 990 states and 1463 transitions. [2025-02-05 19:14:37,623 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 91 [2025-02-05 19:14:37,623 INFO L210 NwaCegarLoop]: Found error trace [2025-02-05 19:14:37,624 INFO L218 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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 19:14:37,624 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable7 [2025-02-05 19:14:37,624 INFO L396 AbstractCegarLoop]: === Iteration 9 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-02-05 19:14:37,624 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-02-05 19:14:37,624 INFO L85 PathProgramCache]: Analyzing trace with hash -1363123818, now seen corresponding path program 1 times [2025-02-05 19:14:37,625 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-02-05 19:14:37,625 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [117556381] [2025-02-05 19:14:37,625 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-02-05 19:14:37,625 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-02-05 19:14:37,664 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 90 statements into 1 equivalence classes. [2025-02-05 19:14:37,713 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 90 of 90 statements. [2025-02-05 19:14:37,713 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-02-05 19:14:37,714 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-02-05 19:14:38,136 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-02-05 19:14:38,137 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-02-05 19:14:38,137 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [117556381] [2025-02-05 19:14:38,137 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [117556381] provided 1 perfect and 0 imperfect interpolant sequences [2025-02-05 19:14:38,137 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-02-05 19:14:38,137 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2025-02-05 19:14:38,137 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1690554300] [2025-02-05 19:14:38,137 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-02-05 19:14:38,138 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 7 states [2025-02-05 19:14:38,138 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-02-05 19:14:38,138 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2025-02-05 19:14:38,138 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=11, Invalid=31, Unknown=0, NotChecked=0, Total=42 [2025-02-05 19:14:38,139 INFO L87 Difference]: Start difference. First operand 990 states and 1463 transitions. Second operand has 7 states, 7 states have (on average 12.857142857142858) internal successors, (90), 7 states have internal predecessors, (90), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-02-05 19:14:39,004 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-02-05 19:14:39,004 INFO L93 Difference]: Finished difference Result 2312 states and 3417 transitions. [2025-02-05 19:14:39,004 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2025-02-05 19:14:39,005 INFO L78 Accepts]: Start accepts. Automaton has has 7 states, 7 states have (on average 12.857142857142858) internal successors, (90), 7 states have internal predecessors, (90), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 90 [2025-02-05 19:14:39,005 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-02-05 19:14:39,009 INFO L225 Difference]: With dead ends: 2312 [2025-02-05 19:14:39,009 INFO L226 Difference]: Without dead ends: 1426 [2025-02-05 19:14:39,011 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 12 GetRequests, 3 SyntacticMatches, 0 SemanticMatches, 9 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 3 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=33, Invalid=77, Unknown=0, NotChecked=0, Total=110 [2025-02-05 19:14:39,011 INFO L435 NwaCegarLoop]: 847 mSDtfsCounter, 2520 mSDsluCounter, 3383 mSDsCounter, 0 mSdLazyCounter, 1175 mSolverCounterSat, 1 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.7s Time, 0 mProtectedPredicate, 0 mProtectedAction, 2520 SdHoareTripleChecker+Valid, 4230 SdHoareTripleChecker+Invalid, 1176 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 1 IncrementalHoareTripleChecker+Valid, 1175 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.8s IncrementalHoareTripleChecker+Time [2025-02-05 19:14:39,011 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [2520 Valid, 4230 Invalid, 1176 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [1 Valid, 1175 Invalid, 0 Unknown, 0 Unchecked, 0.8s Time] [2025-02-05 19:14:39,013 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1426 states. [2025-02-05 19:14:39,028 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1426 to 992. [2025-02-05 19:14:39,030 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 992 states, 991 states have (on average 1.4762865792129163) internal successors, (1463), 991 states have internal predecessors, (1463), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-02-05 19:14:39,032 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 992 states to 992 states and 1463 transitions. [2025-02-05 19:14:39,032 INFO L78 Accepts]: Start accepts. Automaton has 992 states and 1463 transitions. Word has length 90 [2025-02-05 19:14:39,032 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-02-05 19:14:39,033 INFO L471 AbstractCegarLoop]: Abstraction has 992 states and 1463 transitions. [2025-02-05 19:14:39,033 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 7 states, 7 states have (on average 12.857142857142858) internal successors, (90), 7 states have internal predecessors, (90), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-02-05 19:14:39,033 INFO L276 IsEmpty]: Start isEmpty. Operand 992 states and 1463 transitions. [2025-02-05 19:14:39,034 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 91 [2025-02-05 19:14:39,034 INFO L210 NwaCegarLoop]: Found error trace [2025-02-05 19:14:39,034 INFO L218 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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 19:14:39,034 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable8 [2025-02-05 19:14:39,034 INFO L396 AbstractCegarLoop]: === Iteration 10 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-02-05 19:14:39,035 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-02-05 19:14:39,035 INFO L85 PathProgramCache]: Analyzing trace with hash -638826378, now seen corresponding path program 1 times [2025-02-05 19:14:39,035 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-02-05 19:14:39,035 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [59311537] [2025-02-05 19:14:39,035 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-02-05 19:14:39,035 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-02-05 19:14:39,073 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 90 statements into 1 equivalence classes. [2025-02-05 19:14:39,131 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 90 of 90 statements. [2025-02-05 19:14:39,131 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-02-05 19:14:39,131 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-02-05 19:14:39,791 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-02-05 19:14:39,791 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-02-05 19:14:39,791 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [59311537] [2025-02-05 19:14:39,791 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [59311537] provided 1 perfect and 0 imperfect interpolant sequences [2025-02-05 19:14:39,792 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-02-05 19:14:39,792 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2025-02-05 19:14:39,792 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2033779380] [2025-02-05 19:14:39,792 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-02-05 19:14:39,792 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 7 states [2025-02-05 19:14:39,792 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-02-05 19:14:39,793 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2025-02-05 19:14:39,793 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=11, Invalid=31, Unknown=0, NotChecked=0, Total=42 [2025-02-05 19:14:39,793 INFO L87 Difference]: Start difference. First operand 992 states and 1463 transitions. Second operand has 7 states, 7 states have (on average 12.857142857142858) internal successors, (90), 7 states have internal predecessors, (90), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-02-05 19:14:40,557 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-02-05 19:14:40,558 INFO L93 Difference]: Finished difference Result 2221 states and 3283 transitions. [2025-02-05 19:14:40,558 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2025-02-05 19:14:40,558 INFO L78 Accepts]: Start accepts. Automaton has has 7 states, 7 states have (on average 12.857142857142858) internal successors, (90), 7 states have internal predecessors, (90), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 90 [2025-02-05 19:14:40,559 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-02-05 19:14:40,563 INFO L225 Difference]: With dead ends: 2221 [2025-02-05 19:14:40,563 INFO L226 Difference]: Without dead ends: 1428 [2025-02-05 19:14:40,565 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 12 GetRequests, 3 SyntacticMatches, 0 SemanticMatches, 9 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 3 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=33, Invalid=77, Unknown=0, NotChecked=0, Total=110 [2025-02-05 19:14:40,565 INFO L435 NwaCegarLoop]: 847 mSDtfsCounter, 2500 mSDsluCounter, 3383 mSDsCounter, 0 mSdLazyCounter, 1175 mSolverCounterSat, 1 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.6s Time, 0 mProtectedPredicate, 0 mProtectedAction, 2500 SdHoareTripleChecker+Valid, 4230 SdHoareTripleChecker+Invalid, 1176 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 1 IncrementalHoareTripleChecker+Valid, 1175 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.7s IncrementalHoareTripleChecker+Time [2025-02-05 19:14:40,566 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [2500 Valid, 4230 Invalid, 1176 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [1 Valid, 1175 Invalid, 0 Unknown, 0 Unchecked, 0.7s Time] [2025-02-05 19:14:40,568 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1428 states. [2025-02-05 19:14:40,581 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1428 to 994. [2025-02-05 19:14:40,583 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 994 states, 993 states have (on average 1.4733131923464249) internal successors, (1463), 993 states have internal predecessors, (1463), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-02-05 19:14:40,585 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 994 states to 994 states and 1463 transitions. [2025-02-05 19:14:40,585 INFO L78 Accepts]: Start accepts. Automaton has 994 states and 1463 transitions. Word has length 90 [2025-02-05 19:14:40,585 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-02-05 19:14:40,585 INFO L471 AbstractCegarLoop]: Abstraction has 994 states and 1463 transitions. [2025-02-05 19:14:40,585 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 7 states, 7 states have (on average 12.857142857142858) internal successors, (90), 7 states have internal predecessors, (90), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-02-05 19:14:40,585 INFO L276 IsEmpty]: Start isEmpty. Operand 994 states and 1463 transitions. [2025-02-05 19:14:40,588 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 91 [2025-02-05 19:14:40,589 INFO L210 NwaCegarLoop]: Found error trace [2025-02-05 19:14:40,589 INFO L218 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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 19:14:40,589 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable9 [2025-02-05 19:14:40,589 INFO L396 AbstractCegarLoop]: === Iteration 11 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-02-05 19:14:40,590 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-02-05 19:14:40,590 INFO L85 PathProgramCache]: Analyzing trace with hash -1648819638, now seen corresponding path program 1 times [2025-02-05 19:14:40,590 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-02-05 19:14:40,590 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1506109174] [2025-02-05 19:14:40,590 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-02-05 19:14:40,590 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-02-05 19:14:40,628 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 90 statements into 1 equivalence classes. [2025-02-05 19:14:40,712 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 90 of 90 statements. [2025-02-05 19:14:40,713 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-02-05 19:14:40,713 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-02-05 19:14:41,393 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-02-05 19:14:41,394 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-02-05 19:14:41,395 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1506109174] [2025-02-05 19:14:41,395 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1506109174] provided 1 perfect and 0 imperfect interpolant sequences [2025-02-05 19:14:41,395 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-02-05 19:14:41,395 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [9] imperfect sequences [] total 9 [2025-02-05 19:14:41,395 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1264753184] [2025-02-05 19:14:41,395 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-02-05 19:14:41,395 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 9 states [2025-02-05 19:14:41,396 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-02-05 19:14:41,396 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2025-02-05 19:14:41,396 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=15, Invalid=57, Unknown=0, NotChecked=0, Total=72 [2025-02-05 19:14:41,396 INFO L87 Difference]: Start difference. First operand 994 states and 1463 transitions. Second operand has 9 states, 9 states have (on average 10.0) internal successors, (90), 9 states have internal predecessors, (90), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-02-05 19:14:42,506 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-02-05 19:14:42,506 INFO L93 Difference]: Finished difference Result 2230 states and 3282 transitions. [2025-02-05 19:14:42,506 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2025-02-05 19:14:42,506 INFO L78 Accepts]: Start accepts. Automaton has has 9 states, 9 states have (on average 10.0) internal successors, (90), 9 states have internal predecessors, (90), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 90 [2025-02-05 19:14:42,507 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-02-05 19:14:42,510 INFO L225 Difference]: With dead ends: 2230 [2025-02-05 19:14:42,510 INFO L226 Difference]: Without dead ends: 1309 [2025-02-05 19:14:42,511 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 14 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 12 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 6 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=43, Invalid=139, Unknown=0, NotChecked=0, Total=182 [2025-02-05 19:14:42,511 INFO L435 NwaCegarLoop]: 846 mSDtfsCounter, 2176 mSDsluCounter, 5064 mSDsCounter, 0 mSdLazyCounter, 1657 mSolverCounterSat, 2 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.8s Time, 0 mProtectedPredicate, 0 mProtectedAction, 2176 SdHoareTripleChecker+Valid, 5910 SdHoareTripleChecker+Invalid, 1659 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 2 IncrementalHoareTripleChecker+Valid, 1657 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 1.0s IncrementalHoareTripleChecker+Time [2025-02-05 19:14:42,512 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [2176 Valid, 5910 Invalid, 1659 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [2 Valid, 1657 Invalid, 0 Unknown, 0 Unchecked, 1.0s Time] [2025-02-05 19:14:42,513 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1309 states. [2025-02-05 19:14:42,526 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1309 to 1007. [2025-02-05 19:14:42,528 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 1007 states, 1006 states have (on average 1.4721669980119285) internal successors, (1481), 1006 states have internal predecessors, (1481), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-02-05 19:14:42,530 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1007 states to 1007 states and 1481 transitions. [2025-02-05 19:14:42,530 INFO L78 Accepts]: Start accepts. Automaton has 1007 states and 1481 transitions. Word has length 90 [2025-02-05 19:14:42,530 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-02-05 19:14:42,530 INFO L471 AbstractCegarLoop]: Abstraction has 1007 states and 1481 transitions. [2025-02-05 19:14:42,530 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 9 states, 9 states have (on average 10.0) internal successors, (90), 9 states have internal predecessors, (90), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-02-05 19:14:42,530 INFO L276 IsEmpty]: Start isEmpty. Operand 1007 states and 1481 transitions. [2025-02-05 19:14:42,531 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 92 [2025-02-05 19:14:42,531 INFO L210 NwaCegarLoop]: Found error trace [2025-02-05 19:14:42,531 INFO L218 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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 19:14:42,532 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable10 [2025-02-05 19:14:42,532 INFO L396 AbstractCegarLoop]: === Iteration 12 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-02-05 19:14:42,532 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-02-05 19:14:42,532 INFO L85 PathProgramCache]: Analyzing trace with hash -1208620310, now seen corresponding path program 1 times [2025-02-05 19:14:42,532 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-02-05 19:14:42,532 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [618037440] [2025-02-05 19:14:42,533 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-02-05 19:14:42,533 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-02-05 19:14:42,573 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 91 statements into 1 equivalence classes. [2025-02-05 19:14:42,625 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 91 of 91 statements. [2025-02-05 19:14:42,625 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-02-05 19:14:42,625 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-02-05 19:14:43,040 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-02-05 19:14:43,040 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-02-05 19:14:43,040 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [618037440] [2025-02-05 19:14:43,041 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [618037440] provided 1 perfect and 0 imperfect interpolant sequences [2025-02-05 19:14:43,041 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-02-05 19:14:43,041 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2025-02-05 19:14:43,041 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [57550440] [2025-02-05 19:14:43,041 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-02-05 19:14:43,041 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 7 states [2025-02-05 19:14:43,041 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-02-05 19:14:43,042 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2025-02-05 19:14:43,042 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=11, Invalid=31, Unknown=0, NotChecked=0, Total=42 [2025-02-05 19:14:43,042 INFO L87 Difference]: Start difference. First operand 1007 states and 1481 transitions. Second operand has 7 states, 7 states have (on average 13.0) internal successors, (91), 7 states have internal predecessors, (91), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-02-05 19:14:43,768 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-02-05 19:14:43,768 INFO L93 Difference]: Finished difference Result 2126 states and 3133 transitions. [2025-02-05 19:14:43,768 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2025-02-05 19:14:43,768 INFO L78 Accepts]: Start accepts. Automaton has has 7 states, 7 states have (on average 13.0) internal successors, (91), 7 states have internal predecessors, (91), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 91 [2025-02-05 19:14:43,768 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-02-05 19:14:43,771 INFO L225 Difference]: With dead ends: 2126 [2025-02-05 19:14:43,771 INFO L226 Difference]: Without dead ends: 1323 [2025-02-05 19:14:43,772 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 12 GetRequests, 3 SyntacticMatches, 0 SemanticMatches, 9 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 3 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=33, Invalid=77, Unknown=0, NotChecked=0, Total=110 [2025-02-05 19:14:43,772 INFO L435 NwaCegarLoop]: 847 mSDtfsCounter, 2134 mSDsluCounter, 3383 mSDsCounter, 0 mSdLazyCounter, 1175 mSolverCounterSat, 1 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.6s Time, 0 mProtectedPredicate, 0 mProtectedAction, 2134 SdHoareTripleChecker+Valid, 4230 SdHoareTripleChecker+Invalid, 1176 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 1 IncrementalHoareTripleChecker+Valid, 1175 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.7s IncrementalHoareTripleChecker+Time [2025-02-05 19:14:43,772 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [2134 Valid, 4230 Invalid, 1176 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [1 Valid, 1175 Invalid, 0 Unknown, 0 Unchecked, 0.7s Time] [2025-02-05 19:14:43,774 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1323 states. [2025-02-05 19:14:43,784 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1323 to 1009. [2025-02-05 19:14:43,785 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 1009 states, 1008 states have (on average 1.4692460317460319) internal successors, (1481), 1008 states have internal predecessors, (1481), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-02-05 19:14:43,787 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1009 states to 1009 states and 1481 transitions. [2025-02-05 19:14:43,787 INFO L78 Accepts]: Start accepts. Automaton has 1009 states and 1481 transitions. Word has length 91 [2025-02-05 19:14:43,787 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-02-05 19:14:43,787 INFO L471 AbstractCegarLoop]: Abstraction has 1009 states and 1481 transitions. [2025-02-05 19:14:43,788 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 7 states, 7 states have (on average 13.0) internal successors, (91), 7 states have internal predecessors, (91), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-02-05 19:14:43,788 INFO L276 IsEmpty]: Start isEmpty. Operand 1009 states and 1481 transitions. [2025-02-05 19:14:43,788 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 92 [2025-02-05 19:14:43,789 INFO L210 NwaCegarLoop]: Found error trace [2025-02-05 19:14:43,789 INFO L218 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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 19:14:43,789 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable11 [2025-02-05 19:14:43,789 INFO L396 AbstractCegarLoop]: === Iteration 13 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-02-05 19:14:43,789 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-02-05 19:14:43,790 INFO L85 PathProgramCache]: Analyzing trace with hash -696165662, now seen corresponding path program 1 times [2025-02-05 19:14:43,790 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-02-05 19:14:43,790 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [954512826] [2025-02-05 19:14:43,790 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-02-05 19:14:43,790 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-02-05 19:14:43,823 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 91 statements into 1 equivalence classes. [2025-02-05 19:14:43,921 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 91 of 91 statements. [2025-02-05 19:14:43,921 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-02-05 19:14:43,921 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-02-05 19:14:44,333 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-02-05 19:14:44,333 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-02-05 19:14:44,333 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [954512826] [2025-02-05 19:14:44,333 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [954512826] provided 1 perfect and 0 imperfect interpolant sequences [2025-02-05 19:14:44,333 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-02-05 19:14:44,333 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2025-02-05 19:14:44,334 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2088790877] [2025-02-05 19:14:44,334 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-02-05 19:14:44,334 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 7 states [2025-02-05 19:14:44,334 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-02-05 19:14:44,334 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2025-02-05 19:14:44,334 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=11, Invalid=31, Unknown=0, NotChecked=0, Total=42 [2025-02-05 19:14:44,335 INFO L87 Difference]: Start difference. First operand 1009 states and 1481 transitions. Second operand has 7 states, 7 states have (on average 13.0) internal successors, (91), 7 states have internal predecessors, (91), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-02-05 19:14:45,326 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-02-05 19:14:45,327 INFO L93 Difference]: Finished difference Result 2161 states and 3171 transitions. [2025-02-05 19:14:45,327 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2025-02-05 19:14:45,327 INFO L78 Accepts]: Start accepts. Automaton has has 7 states, 7 states have (on average 13.0) internal successors, (91), 7 states have internal predecessors, (91), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 91 [2025-02-05 19:14:45,327 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-02-05 19:14:45,330 INFO L225 Difference]: With dead ends: 2161 [2025-02-05 19:14:45,330 INFO L226 Difference]: Without dead ends: 1261 [2025-02-05 19:14:45,331 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 12 GetRequests, 3 SyntacticMatches, 0 SemanticMatches, 9 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 3 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=33, Invalid=77, Unknown=0, NotChecked=0, Total=110 [2025-02-05 19:14:45,331 INFO L435 NwaCegarLoop]: 847 mSDtfsCounter, 1954 mSDsluCounter, 3383 mSDsCounter, 0 mSdLazyCounter, 1175 mSolverCounterSat, 1 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.8s Time, 0 mProtectedPredicate, 0 mProtectedAction, 1954 SdHoareTripleChecker+Valid, 4230 SdHoareTripleChecker+Invalid, 1176 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 1 IncrementalHoareTripleChecker+Valid, 1175 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.9s IncrementalHoareTripleChecker+Time [2025-02-05 19:14:45,332 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [1954 Valid, 4230 Invalid, 1176 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [1 Valid, 1175 Invalid, 0 Unknown, 0 Unchecked, 0.9s Time] [2025-02-05 19:14:45,333 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1261 states. [2025-02-05 19:14:45,344 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1261 to 1011. [2025-02-05 19:14:45,345 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 1011 states, 1010 states have (on average 1.4663366336633663) internal successors, (1481), 1010 states have internal predecessors, (1481), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-02-05 19:14:45,347 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1011 states to 1011 states and 1481 transitions. [2025-02-05 19:14:45,347 INFO L78 Accepts]: Start accepts. Automaton has 1011 states and 1481 transitions. Word has length 91 [2025-02-05 19:14:45,347 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-02-05 19:14:45,347 INFO L471 AbstractCegarLoop]: Abstraction has 1011 states and 1481 transitions. [2025-02-05 19:14:45,348 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 7 states, 7 states have (on average 13.0) internal successors, (91), 7 states have internal predecessors, (91), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-02-05 19:14:45,348 INFO L276 IsEmpty]: Start isEmpty. Operand 1011 states and 1481 transitions. [2025-02-05 19:14:45,349 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 92 [2025-02-05 19:14:45,349 INFO L210 NwaCegarLoop]: Found error trace [2025-02-05 19:14:45,349 INFO L218 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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 19:14:45,349 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable12 [2025-02-05 19:14:45,349 INFO L396 AbstractCegarLoop]: === Iteration 14 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-02-05 19:14:45,350 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-02-05 19:14:45,350 INFO L85 PathProgramCache]: Analyzing trace with hash 399771960, now seen corresponding path program 1 times [2025-02-05 19:14:45,350 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-02-05 19:14:45,350 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [832774050] [2025-02-05 19:14:45,350 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-02-05 19:14:45,350 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-02-05 19:14:45,385 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 91 statements into 1 equivalence classes. [2025-02-05 19:14:45,452 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 91 of 91 statements. [2025-02-05 19:14:45,452 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-02-05 19:14:45,452 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-02-05 19:14:45,830 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-02-05 19:14:45,831 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-02-05 19:14:45,831 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [832774050] [2025-02-05 19:14:45,831 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [832774050] provided 1 perfect and 0 imperfect interpolant sequences [2025-02-05 19:14:45,831 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-02-05 19:14:45,831 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2025-02-05 19:14:45,831 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [402760709] [2025-02-05 19:14:45,831 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-02-05 19:14:45,832 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 7 states [2025-02-05 19:14:45,832 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-02-05 19:14:45,832 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2025-02-05 19:14:45,832 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=11, Invalid=31, Unknown=0, NotChecked=0, Total=42 [2025-02-05 19:14:45,833 INFO L87 Difference]: Start difference. First operand 1011 states and 1481 transitions. Second operand has 7 states, 7 states have (on average 13.0) internal successors, (91), 7 states have internal predecessors, (91), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-02-05 19:14:46,615 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-02-05 19:14:46,615 INFO L93 Difference]: Finished difference Result 2268 states and 3324 transitions. [2025-02-05 19:14:46,616 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2025-02-05 19:14:46,616 INFO L78 Accepts]: Start accepts. Automaton has has 7 states, 7 states have (on average 13.0) internal successors, (91), 7 states have internal predecessors, (91), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 91 [2025-02-05 19:14:46,616 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-02-05 19:14:46,619 INFO L225 Difference]: With dead ends: 2268 [2025-02-05 19:14:46,619 INFO L226 Difference]: Without dead ends: 1326 [2025-02-05 19:14:46,620 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 12 GetRequests, 3 SyntacticMatches, 0 SemanticMatches, 9 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 3 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=33, Invalid=77, Unknown=0, NotChecked=0, Total=110 [2025-02-05 19:14:46,621 INFO L435 NwaCegarLoop]: 847 mSDtfsCounter, 2154 mSDsluCounter, 3383 mSDsCounter, 0 mSdLazyCounter, 1175 mSolverCounterSat, 1 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.6s Time, 0 mProtectedPredicate, 0 mProtectedAction, 2154 SdHoareTripleChecker+Valid, 4230 SdHoareTripleChecker+Invalid, 1176 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 1 IncrementalHoareTripleChecker+Valid, 1175 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.7s IncrementalHoareTripleChecker+Time [2025-02-05 19:14:46,621 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [2154 Valid, 4230 Invalid, 1176 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [1 Valid, 1175 Invalid, 0 Unknown, 0 Unchecked, 0.7s Time] [2025-02-05 19:14:46,622 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1326 states. [2025-02-05 19:14:46,633 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1326 to 1012. [2025-02-05 19:14:46,635 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 1012 states, 1011 states have (on average 1.4648862512363996) internal successors, (1481), 1011 states have internal predecessors, (1481), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-02-05 19:14:46,636 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1012 states to 1012 states and 1481 transitions. [2025-02-05 19:14:46,636 INFO L78 Accepts]: Start accepts. Automaton has 1012 states and 1481 transitions. Word has length 91 [2025-02-05 19:14:46,636 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-02-05 19:14:46,637 INFO L471 AbstractCegarLoop]: Abstraction has 1012 states and 1481 transitions. [2025-02-05 19:14:46,637 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 7 states, 7 states have (on average 13.0) internal successors, (91), 7 states have internal predecessors, (91), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-02-05 19:14:46,637 INFO L276 IsEmpty]: Start isEmpty. Operand 1012 states and 1481 transitions. [2025-02-05 19:14:46,638 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 93 [2025-02-05 19:14:46,638 INFO L210 NwaCegarLoop]: Found error trace [2025-02-05 19:14:46,638 INFO L218 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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 19:14:46,638 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable13 [2025-02-05 19:14:46,638 INFO L396 AbstractCegarLoop]: === Iteration 15 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-02-05 19:14:46,638 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-02-05 19:14:46,639 INFO L85 PathProgramCache]: Analyzing trace with hash 263742459, now seen corresponding path program 1 times [2025-02-05 19:14:46,639 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-02-05 19:14:46,639 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [362992820] [2025-02-05 19:14:46,639 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-02-05 19:14:46,639 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-02-05 19:14:46,674 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 92 statements into 1 equivalence classes. [2025-02-05 19:14:46,702 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 92 of 92 statements. [2025-02-05 19:14:46,703 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-02-05 19:14:46,703 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-02-05 19:14:47,088 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-02-05 19:14:47,089 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-02-05 19:14:47,089 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [362992820] [2025-02-05 19:14:47,089 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [362992820] provided 1 perfect and 0 imperfect interpolant sequences [2025-02-05 19:14:47,089 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-02-05 19:14:47,089 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2025-02-05 19:14:47,089 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1019414221] [2025-02-05 19:14:47,089 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-02-05 19:14:47,090 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2025-02-05 19:14:47,090 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-02-05 19:14:47,090 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2025-02-05 19:14:47,090 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2025-02-05 19:14:47,090 INFO L87 Difference]: Start difference. First operand 1012 states and 1481 transitions. Second operand has 5 states, 5 states have (on average 18.4) internal successors, (92), 5 states have internal predecessors, (92), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-02-05 19:14:47,697 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-02-05 19:14:47,697 INFO L93 Difference]: Finished difference Result 2122 states and 3111 transitions. [2025-02-05 19:14:47,697 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2025-02-05 19:14:47,698 INFO L78 Accepts]: Start accepts. Automaton has has 5 states, 5 states have (on average 18.4) internal successors, (92), 5 states have internal predecessors, (92), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 92 [2025-02-05 19:14:47,698 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-02-05 19:14:47,700 INFO L225 Difference]: With dead ends: 2122 [2025-02-05 19:14:47,700 INFO L226 Difference]: Without dead ends: 1222 [2025-02-05 19:14:47,701 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 8 GetRequests, 3 SyntacticMatches, 0 SemanticMatches, 5 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=17, Invalid=25, Unknown=0, NotChecked=0, Total=42 [2025-02-05 19:14:47,702 INFO L435 NwaCegarLoop]: 850 mSDtfsCounter, 1957 mSDsluCounter, 1696 mSDsCounter, 0 mSdLazyCounter, 697 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.5s Time, 0 mProtectedPredicate, 0 mProtectedAction, 1957 SdHoareTripleChecker+Valid, 2546 SdHoareTripleChecker+Invalid, 697 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 697 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.6s IncrementalHoareTripleChecker+Time [2025-02-05 19:14:47,702 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [1957 Valid, 2546 Invalid, 697 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 697 Invalid, 0 Unknown, 0 Unchecked, 0.6s Time] [2025-02-05 19:14:47,703 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1222 states. [2025-02-05 19:14:47,716 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1222 to 960. [2025-02-05 19:14:47,717 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 960 states, 959 states have (on average 1.4650677789363922) internal successors, (1405), 959 states have internal predecessors, (1405), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-02-05 19:14:47,719 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 960 states to 960 states and 1405 transitions. [2025-02-05 19:14:47,719 INFO L78 Accepts]: Start accepts. Automaton has 960 states and 1405 transitions. Word has length 92 [2025-02-05 19:14:47,720 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-02-05 19:14:47,720 INFO L471 AbstractCegarLoop]: Abstraction has 960 states and 1405 transitions. [2025-02-05 19:14:47,720 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 18.4) internal successors, (92), 5 states have internal predecessors, (92), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-02-05 19:14:47,720 INFO L276 IsEmpty]: Start isEmpty. Operand 960 states and 1405 transitions. [2025-02-05 19:14:47,721 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 93 [2025-02-05 19:14:47,721 INFO L210 NwaCegarLoop]: Found error trace [2025-02-05 19:14:47,721 INFO L218 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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 19:14:47,721 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable14 [2025-02-05 19:14:47,722 INFO L396 AbstractCegarLoop]: === Iteration 16 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-02-05 19:14:47,722 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-02-05 19:14:47,722 INFO L85 PathProgramCache]: Analyzing trace with hash -2100700709, now seen corresponding path program 1 times [2025-02-05 19:14:47,722 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-02-05 19:14:47,722 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [240528318] [2025-02-05 19:14:47,722 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-02-05 19:14:47,722 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-02-05 19:14:47,767 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 92 statements into 1 equivalence classes. [2025-02-05 19:14:47,833 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 92 of 92 statements. [2025-02-05 19:14:47,833 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-02-05 19:14:47,833 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-02-05 19:14:48,139 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-02-05 19:14:48,139 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-02-05 19:14:48,139 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [240528318] [2025-02-05 19:14:48,139 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [240528318] provided 1 perfect and 0 imperfect interpolant sequences [2025-02-05 19:14:48,139 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-02-05 19:14:48,139 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2025-02-05 19:14:48,140 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [17331544] [2025-02-05 19:14:48,140 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-02-05 19:14:48,140 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2025-02-05 19:14:48,140 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-02-05 19:14:48,140 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2025-02-05 19:14:48,143 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2025-02-05 19:14:48,143 INFO L87 Difference]: Start difference. First operand 960 states and 1405 transitions. Second operand has 5 states, 5 states have (on average 18.4) internal successors, (92), 5 states have internal predecessors, (92), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-02-05 19:14:48,759 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-02-05 19:14:48,760 INFO L93 Difference]: Finished difference Result 1975 states and 2905 transitions. [2025-02-05 19:14:48,760 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2025-02-05 19:14:48,760 INFO L78 Accepts]: Start accepts. Automaton has has 5 states, 5 states have (on average 18.4) internal successors, (92), 5 states have internal predecessors, (92), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 92 [2025-02-05 19:14:48,760 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-02-05 19:14:48,763 INFO L225 Difference]: With dead ends: 1975 [2025-02-05 19:14:48,763 INFO L226 Difference]: Without dead ends: 1172 [2025-02-05 19:14:48,763 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 8 GetRequests, 3 SyntacticMatches, 0 SemanticMatches, 5 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=17, Invalid=25, Unknown=0, NotChecked=0, Total=42 [2025-02-05 19:14:48,764 INFO L435 NwaCegarLoop]: 850 mSDtfsCounter, 1917 mSDsluCounter, 1696 mSDsCounter, 0 mSdLazyCounter, 697 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.5s Time, 0 mProtectedPredicate, 0 mProtectedAction, 1917 SdHoareTripleChecker+Valid, 2546 SdHoareTripleChecker+Invalid, 697 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 697 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.6s IncrementalHoareTripleChecker+Time [2025-02-05 19:14:48,764 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [1917 Valid, 2546 Invalid, 697 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 697 Invalid, 0 Unknown, 0 Unchecked, 0.6s Time] [2025-02-05 19:14:48,765 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1172 states. [2025-02-05 19:14:48,773 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1172 to 924. [2025-02-05 19:14:48,774 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 924 states, 923 states have (on average 1.465872156013001) internal successors, (1353), 923 states have internal predecessors, (1353), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-02-05 19:14:48,775 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 924 states to 924 states and 1353 transitions. [2025-02-05 19:14:48,775 INFO L78 Accepts]: Start accepts. Automaton has 924 states and 1353 transitions. Word has length 92 [2025-02-05 19:14:48,775 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-02-05 19:14:48,776 INFO L471 AbstractCegarLoop]: Abstraction has 924 states and 1353 transitions. [2025-02-05 19:14:48,776 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 18.4) internal successors, (92), 5 states have internal predecessors, (92), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-02-05 19:14:48,776 INFO L276 IsEmpty]: Start isEmpty. Operand 924 states and 1353 transitions. [2025-02-05 19:14:48,776 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 93 [2025-02-05 19:14:48,776 INFO L210 NwaCegarLoop]: Found error trace [2025-02-05 19:14:48,776 INFO L218 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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 19:14:48,777 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable15 [2025-02-05 19:14:48,777 INFO L396 AbstractCegarLoop]: === Iteration 17 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-02-05 19:14:48,777 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-02-05 19:14:48,777 INFO L85 PathProgramCache]: Analyzing trace with hash -1365014161, now seen corresponding path program 1 times [2025-02-05 19:14:48,777 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-02-05 19:14:48,777 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1005180973] [2025-02-05 19:14:48,777 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-02-05 19:14:48,778 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-02-05 19:14:48,813 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 92 statements into 1 equivalence classes. [2025-02-05 19:14:48,860 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 92 of 92 statements. [2025-02-05 19:14:48,861 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-02-05 19:14:48,861 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-02-05 19:14:49,203 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-02-05 19:14:49,204 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-02-05 19:14:49,204 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1005180973] [2025-02-05 19:14:49,204 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1005180973] provided 1 perfect and 0 imperfect interpolant sequences [2025-02-05 19:14:49,204 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-02-05 19:14:49,205 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2025-02-05 19:14:49,205 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [929898303] [2025-02-05 19:14:49,205 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-02-05 19:14:49,205 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 7 states [2025-02-05 19:14:49,205 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-02-05 19:14:49,206 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2025-02-05 19:14:49,206 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=11, Invalid=31, Unknown=0, NotChecked=0, Total=42 [2025-02-05 19:14:49,206 INFO L87 Difference]: Start difference. First operand 924 states and 1353 transitions. Second operand has 7 states, 7 states have (on average 13.142857142857142) internal successors, (92), 7 states have internal predecessors, (92), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-02-05 19:14:50,041 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-02-05 19:14:50,041 INFO L93 Difference]: Finished difference Result 2214 states and 3250 transitions. [2025-02-05 19:14:50,041 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2025-02-05 19:14:50,041 INFO L78 Accepts]: Start accepts. Automaton has has 7 states, 7 states have (on average 13.142857142857142) internal successors, (92), 7 states have internal predecessors, (92), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 92 [2025-02-05 19:14:50,041 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-02-05 19:14:50,044 INFO L225 Difference]: With dead ends: 2214 [2025-02-05 19:14:50,044 INFO L226 Difference]: Without dead ends: 1386 [2025-02-05 19:14:50,045 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 12 GetRequests, 3 SyntacticMatches, 0 SemanticMatches, 9 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 3 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=33, Invalid=77, Unknown=0, NotChecked=0, Total=110 [2025-02-05 19:14:50,046 INFO L435 NwaCegarLoop]: 846 mSDtfsCounter, 2572 mSDsluCounter, 3379 mSDsCounter, 0 mSdLazyCounter, 1180 mSolverCounterSat, 1 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.6s Time, 0 mProtectedPredicate, 0 mProtectedAction, 2572 SdHoareTripleChecker+Valid, 4225 SdHoareTripleChecker+Invalid, 1181 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 1 IncrementalHoareTripleChecker+Valid, 1180 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.8s IncrementalHoareTripleChecker+Time [2025-02-05 19:14:50,046 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [2572 Valid, 4225 Invalid, 1181 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [1 Valid, 1180 Invalid, 0 Unknown, 0 Unchecked, 0.8s Time] [2025-02-05 19:14:50,047 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1386 states. [2025-02-05 19:14:50,053 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1386 to 922. [2025-02-05 19:14:50,054 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 922 states, 921 states have (on average 1.4647122692725298) internal successors, (1349), 921 states have internal predecessors, (1349), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-02-05 19:14:50,055 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 922 states to 922 states and 1349 transitions. [2025-02-05 19:14:50,055 INFO L78 Accepts]: Start accepts. Automaton has 922 states and 1349 transitions. Word has length 92 [2025-02-05 19:14:50,055 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-02-05 19:14:50,055 INFO L471 AbstractCegarLoop]: Abstraction has 922 states and 1349 transitions. [2025-02-05 19:14:50,055 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 7 states, 7 states have (on average 13.142857142857142) internal successors, (92), 7 states have internal predecessors, (92), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-02-05 19:14:50,055 INFO L276 IsEmpty]: Start isEmpty. Operand 922 states and 1349 transitions. [2025-02-05 19:14:50,056 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 94 [2025-02-05 19:14:50,056 INFO L210 NwaCegarLoop]: Found error trace [2025-02-05 19:14:50,056 INFO L218 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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 19:14:50,056 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable16 [2025-02-05 19:14:50,056 INFO L396 AbstractCegarLoop]: === Iteration 18 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-02-05 19:14:50,056 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-02-05 19:14:50,056 INFO L85 PathProgramCache]: Analyzing trace with hash -1027025854, now seen corresponding path program 1 times [2025-02-05 19:14:50,056 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-02-05 19:14:50,056 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1372710858] [2025-02-05 19:14:50,056 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-02-05 19:14:50,057 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-02-05 19:14:50,091 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 93 statements into 1 equivalence classes. [2025-02-05 19:14:50,113 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 93 of 93 statements. [2025-02-05 19:14:50,114 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-02-05 19:14:50,114 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-02-05 19:14:50,448 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-02-05 19:14:50,448 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-02-05 19:14:50,448 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1372710858] [2025-02-05 19:14:50,448 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1372710858] provided 1 perfect and 0 imperfect interpolant sequences [2025-02-05 19:14:50,448 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-02-05 19:14:50,449 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2025-02-05 19:14:50,449 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1818790639] [2025-02-05 19:14:50,449 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-02-05 19:14:50,449 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 7 states [2025-02-05 19:14:50,449 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-02-05 19:14:50,449 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2025-02-05 19:14:50,450 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=11, Invalid=31, Unknown=0, NotChecked=0, Total=42 [2025-02-05 19:14:50,450 INFO L87 Difference]: Start difference. First operand 922 states and 1349 transitions. Second operand has 7 states, 7 states have (on average 13.285714285714286) internal successors, (93), 7 states have internal predecessors, (93), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-02-05 19:14:51,117 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-02-05 19:14:51,118 INFO L93 Difference]: Finished difference Result 2016 states and 2950 transitions. [2025-02-05 19:14:51,118 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2025-02-05 19:14:51,118 INFO L78 Accepts]: Start accepts. Automaton has has 7 states, 7 states have (on average 13.285714285714286) internal successors, (93), 7 states have internal predecessors, (93), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 93 [2025-02-05 19:14:51,118 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-02-05 19:14:51,121 INFO L225 Difference]: With dead ends: 2016 [2025-02-05 19:14:51,121 INFO L226 Difference]: Without dead ends: 1159 [2025-02-05 19:14:51,121 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 12 GetRequests, 3 SyntacticMatches, 0 SemanticMatches, 9 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 3 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=33, Invalid=77, Unknown=0, NotChecked=0, Total=110 [2025-02-05 19:14:51,122 INFO L435 NwaCegarLoop]: 847 mSDtfsCounter, 1908 mSDsluCounter, 3383 mSDsCounter, 0 mSdLazyCounter, 1175 mSolverCounterSat, 1 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.5s Time, 0 mProtectedPredicate, 0 mProtectedAction, 1908 SdHoareTripleChecker+Valid, 4230 SdHoareTripleChecker+Invalid, 1176 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 1 IncrementalHoareTripleChecker+Valid, 1175 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.6s IncrementalHoareTripleChecker+Time [2025-02-05 19:14:51,122 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [1908 Valid, 4230 Invalid, 1176 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [1 Valid, 1175 Invalid, 0 Unknown, 0 Unchecked, 0.6s Time] [2025-02-05 19:14:51,123 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1159 states. [2025-02-05 19:14:51,128 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1159 to 923. [2025-02-05 19:14:51,129 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 923 states, 922 states have (on average 1.4631236442516269) internal successors, (1349), 922 states have internal predecessors, (1349), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-02-05 19:14:51,130 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 923 states to 923 states and 1349 transitions. [2025-02-05 19:14:51,130 INFO L78 Accepts]: Start accepts. Automaton has 923 states and 1349 transitions. Word has length 93 [2025-02-05 19:14:51,130 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-02-05 19:14:51,130 INFO L471 AbstractCegarLoop]: Abstraction has 923 states and 1349 transitions. [2025-02-05 19:14:51,130 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 7 states, 7 states have (on average 13.285714285714286) internal successors, (93), 7 states have internal predecessors, (93), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-02-05 19:14:51,130 INFO L276 IsEmpty]: Start isEmpty. Operand 923 states and 1349 transitions. [2025-02-05 19:14:51,131 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 95 [2025-02-05 19:14:51,131 INFO L210 NwaCegarLoop]: Found error trace [2025-02-05 19:14:51,131 INFO L218 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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 19:14:51,131 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable17 [2025-02-05 19:14:51,131 INFO L396 AbstractCegarLoop]: === Iteration 19 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-02-05 19:14:51,132 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-02-05 19:14:51,132 INFO L85 PathProgramCache]: Analyzing trace with hash 399872414, now seen corresponding path program 1 times [2025-02-05 19:14:51,132 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-02-05 19:14:51,132 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1275097044] [2025-02-05 19:14:51,132 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-02-05 19:14:51,132 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-02-05 19:14:51,166 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 94 statements into 1 equivalence classes. [2025-02-05 19:14:51,185 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 94 of 94 statements. [2025-02-05 19:14:51,185 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-02-05 19:14:51,185 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-02-05 19:14:51,413 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-02-05 19:14:51,413 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-02-05 19:14:51,414 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1275097044] [2025-02-05 19:14:51,414 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1275097044] provided 1 perfect and 0 imperfect interpolant sequences [2025-02-05 19:14:51,414 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-02-05 19:14:51,414 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2025-02-05 19:14:51,414 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1709956396] [2025-02-05 19:14:51,414 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-02-05 19:14:51,414 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2025-02-05 19:14:51,414 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-02-05 19:14:51,415 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2025-02-05 19:14:51,415 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2025-02-05 19:14:51,415 INFO L87 Difference]: Start difference. First operand 923 states and 1349 transitions. Second operand has 5 states, 5 states have (on average 18.8) internal successors, (94), 5 states have internal predecessors, (94), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-02-05 19:14:51,947 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-02-05 19:14:51,947 INFO L93 Difference]: Finished difference Result 1949 states and 2861 transitions. [2025-02-05 19:14:51,948 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2025-02-05 19:14:51,948 INFO L78 Accepts]: Start accepts. Automaton has has 5 states, 5 states have (on average 18.8) internal successors, (94), 5 states have internal predecessors, (94), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 94 [2025-02-05 19:14:51,948 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-02-05 19:14:51,950 INFO L225 Difference]: With dead ends: 1949 [2025-02-05 19:14:51,950 INFO L226 Difference]: Without dead ends: 1092 [2025-02-05 19:14:51,951 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 8 GetRequests, 3 SyntacticMatches, 0 SemanticMatches, 5 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=17, Invalid=25, Unknown=0, NotChecked=0, Total=42 [2025-02-05 19:14:51,952 INFO L435 NwaCegarLoop]: 850 mSDtfsCounter, 1891 mSDsluCounter, 1696 mSDsCounter, 0 mSdLazyCounter, 697 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.4s Time, 0 mProtectedPredicate, 0 mProtectedAction, 1891 SdHoareTripleChecker+Valid, 2546 SdHoareTripleChecker+Invalid, 697 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 697 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.5s IncrementalHoareTripleChecker+Time [2025-02-05 19:14:51,952 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [1891 Valid, 2546 Invalid, 697 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 697 Invalid, 0 Unknown, 0 Unchecked, 0.5s Time] [2025-02-05 19:14:51,953 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1092 states. [2025-02-05 19:14:51,958 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1092 to 859. [2025-02-05 19:14:51,959 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 859 states, 858 states have (on average 1.472027972027972) internal successors, (1263), 858 states have internal predecessors, (1263), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-02-05 19:14:51,960 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 859 states to 859 states and 1263 transitions. [2025-02-05 19:14:51,960 INFO L78 Accepts]: Start accepts. Automaton has 859 states and 1263 transitions. Word has length 94 [2025-02-05 19:14:51,960 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-02-05 19:14:51,960 INFO L471 AbstractCegarLoop]: Abstraction has 859 states and 1263 transitions. [2025-02-05 19:14:51,960 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 18.8) internal successors, (94), 5 states have internal predecessors, (94), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-02-05 19:14:51,960 INFO L276 IsEmpty]: Start isEmpty. Operand 859 states and 1263 transitions. [2025-02-05 19:14:51,964 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 420 [2025-02-05 19:14:51,964 INFO L210 NwaCegarLoop]: Found error trace [2025-02-05 19:14:51,965 INFO L218 NwaCegarLoop]: trace histogram [2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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 19:14:51,965 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable18 [2025-02-05 19:14:51,965 INFO L396 AbstractCegarLoop]: === Iteration 20 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-02-05 19:14:51,965 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-02-05 19:14:51,966 INFO L85 PathProgramCache]: Analyzing trace with hash -119752639, now seen corresponding path program 1 times [2025-02-05 19:14:51,966 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-02-05 19:14:51,966 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [53855309] [2025-02-05 19:14:51,966 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-02-05 19:14:51,966 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-02-05 19:14:52,188 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 419 statements into 1 equivalence classes. [2025-02-05 19:14:57,514 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 419 of 419 statements. [2025-02-05 19:14:57,514 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-02-05 19:14:57,514 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-02-05 19:14:59,187 INFO L134 CoverageAnalysis]: Checked inductivity of 52 backedges. 52 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-02-05 19:14:59,188 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-02-05 19:14:59,188 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [53855309] [2025-02-05 19:14:59,188 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [53855309] provided 1 perfect and 0 imperfect interpolant sequences [2025-02-05 19:14:59,188 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-02-05 19:14:59,188 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2025-02-05 19:14:59,188 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1398733051] [2025-02-05 19:14:59,188 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-02-05 19:14:59,189 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2025-02-05 19:14:59,189 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-02-05 19:14:59,189 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2025-02-05 19:14:59,189 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2025-02-05 19:14:59,190 INFO L87 Difference]: Start difference. First operand 859 states and 1263 transitions. Second operand has 5 states, 5 states have (on average 83.8) internal successors, (419), 5 states have internal predecessors, (419), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-02-05 19:14:59,968 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-02-05 19:14:59,968 INFO L93 Difference]: Finished difference Result 2227 states and 3296 transitions. [2025-02-05 19:14:59,969 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2025-02-05 19:14:59,969 INFO L78 Accepts]: Start accepts. Automaton has has 5 states, 5 states have (on average 83.8) internal successors, (419), 5 states have internal predecessors, (419), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 419 [2025-02-05 19:14:59,970 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-02-05 19:14:59,973 INFO L225 Difference]: With dead ends: 2227 [2025-02-05 19:14:59,973 INFO L226 Difference]: Without dead ends: 863 [2025-02-05 19:14:59,974 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 8 GetRequests, 3 SyntacticMatches, 0 SemanticMatches, 5 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=15, Invalid=27, Unknown=0, NotChecked=0, Total=42 [2025-02-05 19:14:59,975 INFO L435 NwaCegarLoop]: 1411 mSDtfsCounter, 700 mSDsluCounter, 3497 mSDsCounter, 0 mSdLazyCounter, 1375 mSolverCounterSat, 52 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.6s Time, 0 mProtectedPredicate, 0 mProtectedAction, 700 SdHoareTripleChecker+Valid, 4908 SdHoareTripleChecker+Invalid, 1427 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 52 IncrementalHoareTripleChecker+Valid, 1375 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.7s IncrementalHoareTripleChecker+Time [2025-02-05 19:14:59,975 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [700 Valid, 4908 Invalid, 1427 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [52 Valid, 1375 Invalid, 0 Unknown, 0 Unchecked, 0.7s Time] [2025-02-05 19:14:59,977 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 863 states. [2025-02-05 19:14:59,985 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 863 to 861. [2025-02-05 19:14:59,986 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 861 states, 860 states have (on average 1.4709302325581395) internal successors, (1265), 860 states have internal predecessors, (1265), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-02-05 19:14:59,987 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 861 states to 861 states and 1265 transitions. [2025-02-05 19:14:59,987 INFO L78 Accepts]: Start accepts. Automaton has 861 states and 1265 transitions. Word has length 419 [2025-02-05 19:14:59,988 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-02-05 19:14:59,988 INFO L471 AbstractCegarLoop]: Abstraction has 861 states and 1265 transitions. [2025-02-05 19:14:59,988 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 83.8) internal successors, (419), 5 states have internal predecessors, (419), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-02-05 19:14:59,988 INFO L276 IsEmpty]: Start isEmpty. Operand 861 states and 1265 transitions. [2025-02-05 19:14:59,990 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 421 [2025-02-05 19:14:59,990 INFO L210 NwaCegarLoop]: Found error trace [2025-02-05 19:14:59,991 INFO L218 NwaCegarLoop]: trace histogram [2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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 19:14:59,991 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable19 [2025-02-05 19:14:59,991 INFO L396 AbstractCegarLoop]: === Iteration 21 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-02-05 19:14:59,991 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-02-05 19:14:59,991 INFO L85 PathProgramCache]: Analyzing trace with hash -120957454, now seen corresponding path program 1 times [2025-02-05 19:14:59,991 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-02-05 19:14:59,991 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [627123596] [2025-02-05 19:14:59,992 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-02-05 19:14:59,992 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-02-05 19:15:00,175 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 420 statements into 1 equivalence classes. [2025-02-05 19:15:05,285 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 420 of 420 statements. [2025-02-05 19:15:05,286 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-02-05 19:15:05,286 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-02-05 19:15:06,719 INFO L134 CoverageAnalysis]: Checked inductivity of 52 backedges. 52 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-02-05 19:15:06,719 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-02-05 19:15:06,719 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [627123596] [2025-02-05 19:15:06,719 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [627123596] provided 1 perfect and 0 imperfect interpolant sequences [2025-02-05 19:15:06,719 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-02-05 19:15:06,719 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2025-02-05 19:15:06,720 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [993024308] [2025-02-05 19:15:06,720 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-02-05 19:15:06,720 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2025-02-05 19:15:06,721 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-02-05 19:15:06,721 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2025-02-05 19:15:06,721 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2025-02-05 19:15:06,722 INFO L87 Difference]: Start difference. First operand 861 states and 1265 transitions. Second operand has 5 states, 5 states have (on average 84.0) internal successors, (420), 5 states have internal predecessors, (420), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-02-05 19:15:07,245 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-02-05 19:15:07,246 INFO L93 Difference]: Finished difference Result 1696 states and 2505 transitions. [2025-02-05 19:15:07,246 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2025-02-05 19:15:07,246 INFO L78 Accepts]: Start accepts. Automaton has has 5 states, 5 states have (on average 84.0) internal successors, (420), 5 states have internal predecessors, (420), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 420 [2025-02-05 19:15:07,247 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-02-05 19:15:07,248 INFO L225 Difference]: With dead ends: 1696 [2025-02-05 19:15:07,248 INFO L226 Difference]: Without dead ends: 865 [2025-02-05 19:15:07,249 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 6 GetRequests, 3 SyntacticMatches, 0 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2025-02-05 19:15:07,250 INFO L435 NwaCegarLoop]: 888 mSDtfsCounter, 76 mSDsluCounter, 2452 mSDsCounter, 0 mSdLazyCounter, 983 mSolverCounterSat, 9 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.4s Time, 0 mProtectedPredicate, 0 mProtectedAction, 76 SdHoareTripleChecker+Valid, 3340 SdHoareTripleChecker+Invalid, 992 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 9 IncrementalHoareTripleChecker+Valid, 983 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.5s IncrementalHoareTripleChecker+Time [2025-02-05 19:15:07,250 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [76 Valid, 3340 Invalid, 992 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [9 Valid, 983 Invalid, 0 Unknown, 0 Unchecked, 0.5s Time] [2025-02-05 19:15:07,251 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 865 states. [2025-02-05 19:15:07,257 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 865 to 863. [2025-02-05 19:15:07,258 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 863 states, 862 states have (on average 1.4698375870069607) internal successors, (1267), 862 states have internal predecessors, (1267), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-02-05 19:15:07,259 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 863 states to 863 states and 1267 transitions. [2025-02-05 19:15:07,259 INFO L78 Accepts]: Start accepts. Automaton has 863 states and 1267 transitions. Word has length 420 [2025-02-05 19:15:07,260 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-02-05 19:15:07,260 INFO L471 AbstractCegarLoop]: Abstraction has 863 states and 1267 transitions. [2025-02-05 19:15:07,260 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 84.0) internal successors, (420), 5 states have internal predecessors, (420), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-02-05 19:15:07,260 INFO L276 IsEmpty]: Start isEmpty. Operand 863 states and 1267 transitions. [2025-02-05 19:15:07,263 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 422 [2025-02-05 19:15:07,263 INFO L210 NwaCegarLoop]: Found error trace [2025-02-05 19:15:07,263 INFO L218 NwaCegarLoop]: trace histogram [2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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 19:15:07,263 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable20 [2025-02-05 19:15:07,264 INFO L396 AbstractCegarLoop]: === Iteration 22 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-02-05 19:15:07,264 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-02-05 19:15:07,264 INFO L85 PathProgramCache]: Analyzing trace with hash -370518374, now seen corresponding path program 1 times [2025-02-05 19:15:07,265 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-02-05 19:15:07,265 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1989455186] [2025-02-05 19:15:07,265 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-02-05 19:15:07,265 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-02-05 19:15:07,459 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 421 statements into 1 equivalence classes. [2025-02-05 19:15:10,922 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 421 of 421 statements. [2025-02-05 19:15:10,922 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-02-05 19:15:10,922 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-02-05 19:15:12,135 INFO L134 CoverageAnalysis]: Checked inductivity of 52 backedges. 52 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-02-05 19:15:12,135 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-02-05 19:15:12,135 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1989455186] [2025-02-05 19:15:12,135 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1989455186] provided 1 perfect and 0 imperfect interpolant sequences [2025-02-05 19:15:12,135 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-02-05 19:15:12,135 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2025-02-05 19:15:12,136 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1759907976] [2025-02-05 19:15:12,136 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-02-05 19:15:12,136 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2025-02-05 19:15:12,136 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-02-05 19:15:12,137 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2025-02-05 19:15:12,137 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2025-02-05 19:15:12,137 INFO L87 Difference]: Start difference. First operand 863 states and 1267 transitions. Second operand has 5 states, 5 states have (on average 84.2) internal successors, (421), 5 states have internal predecessors, (421), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-02-05 19:15:12,640 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-02-05 19:15:12,640 INFO L93 Difference]: Finished difference Result 1658 states and 2446 transitions. [2025-02-05 19:15:12,640 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2025-02-05 19:15:12,641 INFO L78 Accepts]: Start accepts. Automaton has has 5 states, 5 states have (on average 84.2) internal successors, (421), 5 states have internal predecessors, (421), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 421 [2025-02-05 19:15:12,641 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-02-05 19:15:12,644 INFO L225 Difference]: With dead ends: 1658 [2025-02-05 19:15:12,644 INFO L226 Difference]: Without dead ends: 867 [2025-02-05 19:15:12,645 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 6 GetRequests, 3 SyntacticMatches, 0 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2025-02-05 19:15:12,649 INFO L435 NwaCegarLoop]: 893 mSDtfsCounter, 42 mSDsluCounter, 2462 mSDsCounter, 0 mSdLazyCounter, 968 mSolverCounterSat, 4 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.4s Time, 0 mProtectedPredicate, 0 mProtectedAction, 42 SdHoareTripleChecker+Valid, 3355 SdHoareTripleChecker+Invalid, 972 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 4 IncrementalHoareTripleChecker+Valid, 968 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.5s IncrementalHoareTripleChecker+Time [2025-02-05 19:15:12,652 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [42 Valid, 3355 Invalid, 972 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [4 Valid, 968 Invalid, 0 Unknown, 0 Unchecked, 0.5s Time] [2025-02-05 19:15:12,653 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 867 states. [2025-02-05 19:15:12,661 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 867 to 865. [2025-02-05 19:15:12,662 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 865 states, 864 states have (on average 1.46875) internal successors, (1269), 864 states have internal predecessors, (1269), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-02-05 19:15:12,667 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 865 states to 865 states and 1269 transitions. [2025-02-05 19:15:12,667 INFO L78 Accepts]: Start accepts. Automaton has 865 states and 1269 transitions. Word has length 421 [2025-02-05 19:15:12,667 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-02-05 19:15:12,667 INFO L471 AbstractCegarLoop]: Abstraction has 865 states and 1269 transitions. [2025-02-05 19:15:12,668 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 84.2) internal successors, (421), 5 states have internal predecessors, (421), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-02-05 19:15:12,668 INFO L276 IsEmpty]: Start isEmpty. Operand 865 states and 1269 transitions. [2025-02-05 19:15:12,674 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 423 [2025-02-05 19:15:12,674 INFO L210 NwaCegarLoop]: Found error trace [2025-02-05 19:15:12,674 INFO L218 NwaCegarLoop]: trace histogram [2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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 19:15:12,675 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable21 [2025-02-05 19:15:12,675 INFO L396 AbstractCegarLoop]: === Iteration 23 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-02-05 19:15:12,675 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-02-05 19:15:12,675 INFO L85 PathProgramCache]: Analyzing trace with hash 277147458, now seen corresponding path program 1 times [2025-02-05 19:15:12,676 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-02-05 19:15:12,676 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1319372428] [2025-02-05 19:15:12,676 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-02-05 19:15:12,676 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-02-05 19:15:12,844 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 422 statements into 1 equivalence classes. [2025-02-05 19:15:16,209 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 422 of 422 statements. [2025-02-05 19:15:16,209 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-02-05 19:15:16,209 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-02-05 19:15:17,355 INFO L134 CoverageAnalysis]: Checked inductivity of 52 backedges. 52 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-02-05 19:15:17,356 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-02-05 19:15:17,356 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1319372428] [2025-02-05 19:15:17,356 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1319372428] provided 1 perfect and 0 imperfect interpolant sequences [2025-02-05 19:15:17,356 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-02-05 19:15:17,356 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2025-02-05 19:15:17,356 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1607818408] [2025-02-05 19:15:17,356 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-02-05 19:15:17,356 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2025-02-05 19:15:17,356 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-02-05 19:15:17,357 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2025-02-05 19:15:17,357 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=10, Invalid=20, Unknown=0, NotChecked=0, Total=30 [2025-02-05 19:15:17,358 INFO L87 Difference]: Start difference. First operand 865 states and 1269 transitions. Second operand has 6 states, 6 states have (on average 70.33333333333333) internal successors, (422), 6 states have internal predecessors, (422), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-02-05 19:15:17,979 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-02-05 19:15:17,979 INFO L93 Difference]: Finished difference Result 1662 states and 2450 transitions. [2025-02-05 19:15:17,980 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2025-02-05 19:15:17,980 INFO L78 Accepts]: Start accepts. Automaton has has 6 states, 6 states have (on average 70.33333333333333) internal successors, (422), 6 states have internal predecessors, (422), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 422 [2025-02-05 19:15:17,981 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-02-05 19:15:17,983 INFO L225 Difference]: With dead ends: 1662 [2025-02-05 19:15:17,983 INFO L226 Difference]: Without dead ends: 869 [2025-02-05 19:15:17,985 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 6 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 4 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=10, Invalid=20, Unknown=0, NotChecked=0, Total=30 [2025-02-05 19:15:17,986 INFO L435 NwaCegarLoop]: 891 mSDtfsCounter, 44 mSDsluCounter, 3144 mSDsCounter, 0 mSdLazyCounter, 1369 mSolverCounterSat, 4 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.5s Time, 0 mProtectedPredicate, 0 mProtectedAction, 44 SdHoareTripleChecker+Valid, 4035 SdHoareTripleChecker+Invalid, 1373 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 4 IncrementalHoareTripleChecker+Valid, 1369 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.6s IncrementalHoareTripleChecker+Time [2025-02-05 19:15:17,989 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [44 Valid, 4035 Invalid, 1373 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [4 Valid, 1369 Invalid, 0 Unknown, 0 Unchecked, 0.6s Time] [2025-02-05 19:15:17,990 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 869 states. [2025-02-05 19:15:17,996 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 869 to 867. [2025-02-05 19:15:17,997 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 867 states, 866 states have (on average 1.4676674364896074) internal successors, (1271), 866 states have internal predecessors, (1271), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-02-05 19:15:17,997 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 867 states to 867 states and 1271 transitions. [2025-02-05 19:15:17,997 INFO L78 Accepts]: Start accepts. Automaton has 867 states and 1271 transitions. Word has length 422 [2025-02-05 19:15:17,998 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-02-05 19:15:17,998 INFO L471 AbstractCegarLoop]: Abstraction has 867 states and 1271 transitions. [2025-02-05 19:15:17,998 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 6 states have (on average 70.33333333333333) internal successors, (422), 6 states have internal predecessors, (422), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-02-05 19:15:17,998 INFO L276 IsEmpty]: Start isEmpty. Operand 867 states and 1271 transitions. [2025-02-05 19:15:18,000 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 424 [2025-02-05 19:15:18,000 INFO L210 NwaCegarLoop]: Found error trace [2025-02-05 19:15:18,000 INFO L218 NwaCegarLoop]: trace histogram [2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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 19:15:18,000 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable22 [2025-02-05 19:15:18,000 INFO L396 AbstractCegarLoop]: === Iteration 24 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-02-05 19:15:18,001 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-02-05 19:15:18,001 INFO L85 PathProgramCache]: Analyzing trace with hash 124268308, now seen corresponding path program 1 times [2025-02-05 19:15:18,001 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-02-05 19:15:18,001 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1000413310] [2025-02-05 19:15:18,001 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-02-05 19:15:18,001 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-02-05 19:15:18,165 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 423 statements into 1 equivalence classes. [2025-02-05 19:15:30,709 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 423 of 423 statements. [2025-02-05 19:15:30,709 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-02-05 19:15:30,709 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-02-05 19:15:31,750 INFO L134 CoverageAnalysis]: Checked inductivity of 52 backedges. 52 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-02-05 19:15:31,750 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-02-05 19:15:31,750 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1000413310] [2025-02-05 19:15:31,750 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1000413310] provided 1 perfect and 0 imperfect interpolant sequences [2025-02-05 19:15:31,751 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-02-05 19:15:31,751 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2025-02-05 19:15:31,751 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [499879765] [2025-02-05 19:15:31,751 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-02-05 19:15:31,751 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2025-02-05 19:15:31,751 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-02-05 19:15:31,752 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2025-02-05 19:15:31,752 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2025-02-05 19:15:31,752 INFO L87 Difference]: Start difference. First operand 867 states and 1271 transitions. Second operand has 5 states, 5 states have (on average 84.6) internal successors, (423), 5 states have internal predecessors, (423), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-02-05 19:15:32,265 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-02-05 19:15:32,265 INFO L93 Difference]: Finished difference Result 1708 states and 2517 transitions. [2025-02-05 19:15:32,265 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2025-02-05 19:15:32,265 INFO L78 Accepts]: Start accepts. Automaton has has 5 states, 5 states have (on average 84.6) internal successors, (423), 5 states have internal predecessors, (423), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 423 [2025-02-05 19:15:32,266 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-02-05 19:15:32,268 INFO L225 Difference]: With dead ends: 1708 [2025-02-05 19:15:32,268 INFO L226 Difference]: Without dead ends: 871 [2025-02-05 19:15:32,273 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 5 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2025-02-05 19:15:32,274 INFO L435 NwaCegarLoop]: 888 mSDtfsCounter, 74 mSDsluCounter, 2459 mSDsCounter, 0 mSdLazyCounter, 976 mSolverCounterSat, 9 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.4s Time, 0 mProtectedPredicate, 0 mProtectedAction, 74 SdHoareTripleChecker+Valid, 3347 SdHoareTripleChecker+Invalid, 985 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 9 IncrementalHoareTripleChecker+Valid, 976 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.5s IncrementalHoareTripleChecker+Time [2025-02-05 19:15:32,274 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [74 Valid, 3347 Invalid, 985 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [9 Valid, 976 Invalid, 0 Unknown, 0 Unchecked, 0.5s Time] [2025-02-05 19:15:32,276 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 871 states. [2025-02-05 19:15:32,282 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 871 to 869. [2025-02-05 19:15:32,283 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 869 states, 868 states have (on average 1.4665898617511521) internal successors, (1273), 868 states have internal predecessors, (1273), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-02-05 19:15:32,284 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 869 states to 869 states and 1273 transitions. [2025-02-05 19:15:32,284 INFO L78 Accepts]: Start accepts. Automaton has 869 states and 1273 transitions. Word has length 423 [2025-02-05 19:15:32,284 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-02-05 19:15:32,284 INFO L471 AbstractCegarLoop]: Abstraction has 869 states and 1273 transitions. [2025-02-05 19:15:32,284 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 84.6) internal successors, (423), 5 states have internal predecessors, (423), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-02-05 19:15:32,285 INFO L276 IsEmpty]: Start isEmpty. Operand 869 states and 1273 transitions. [2025-02-05 19:15:32,287 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 425 [2025-02-05 19:15:32,287 INFO L210 NwaCegarLoop]: Found error trace [2025-02-05 19:15:32,287 INFO L218 NwaCegarLoop]: trace histogram [2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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 19:15:32,288 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable23 [2025-02-05 19:15:32,288 INFO L396 AbstractCegarLoop]: === Iteration 25 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-02-05 19:15:32,289 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-02-05 19:15:32,289 INFO L85 PathProgramCache]: Analyzing trace with hash 1723232782, now seen corresponding path program 1 times [2025-02-05 19:15:32,289 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-02-05 19:15:32,289 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1555395262] [2025-02-05 19:15:32,290 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-02-05 19:15:32,290 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms