./Ultimate.py --spec ../sv-benchmarks/c/properties/unreach-call.prp --file ../sv-benchmarks/c/hardware-verification-bv/btor2c-lazyMod.cal6.c --full-output --architecture 64bit -------------------------------------------------------------------------------- Checking for ERROR reachability Using default analysis Version 48c9605d 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.cal6.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 965536a1eccbb3950fb02708c11ed62fda8db430ae4f769dc023e63105c711ca --- Real Ultimate output --- This is Ultimate 0.3.0-?-48c9605-m [2025-02-07 22:46:12,771 INFO L188 SettingsManager]: Resetting all preferences to default values... [2025-02-07 22:46:12,822 INFO L114 SettingsManager]: Loading settings from /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/config/svcomp-Reach-64bit-Automizer_Default.epf [2025-02-07 22:46:12,830 WARN L101 SettingsManager]: Preference file contains the following unknown settings: [2025-02-07 22:46:12,830 WARN L103 SettingsManager]: * de.uni_freiburg.informatik.ultimate.core.Log level for class [2025-02-07 22:46:12,850 INFO L130 SettingsManager]: Preferences different from defaults after loading the file: [2025-02-07 22:46:12,851 INFO L151 SettingsManager]: Preferences of UltimateCore differ from their defaults: [2025-02-07 22:46:12,851 INFO L153 SettingsManager]: * Log level for class=de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher=ERROR; [2025-02-07 22:46:12,852 INFO L151 SettingsManager]: Preferences of Boogie Preprocessor differ from their defaults: [2025-02-07 22:46:12,852 INFO L153 SettingsManager]: * Use memory slicer=true [2025-02-07 22:46:12,852 INFO L151 SettingsManager]: Preferences of Boogie Procedure Inliner differ from their defaults: [2025-02-07 22:46:12,852 INFO L153 SettingsManager]: * Ignore calls to procedures called more than once=ONLY_FOR_SEQUENTIAL_PROGRAMS [2025-02-07 22:46:12,853 INFO L151 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2025-02-07 22:46:12,853 INFO L153 SettingsManager]: * Create parallel compositions if possible=false [2025-02-07 22:46:12,853 INFO L153 SettingsManager]: * Use SBE=true [2025-02-07 22:46:12,853 INFO L151 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2025-02-07 22:46:12,853 INFO L153 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2025-02-07 22:46:12,853 INFO L153 SettingsManager]: * Overapproximate operations on floating types=true [2025-02-07 22:46:12,854 INFO L153 SettingsManager]: * Check division by zero=IGNORE [2025-02-07 22:46:12,854 INFO L153 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2025-02-07 22:46:12,854 INFO L153 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2025-02-07 22:46:12,854 INFO L153 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2025-02-07 22:46:12,854 INFO L153 SettingsManager]: * Check if freed pointer was valid=false [2025-02-07 22:46:12,854 INFO L153 SettingsManager]: * Behaviour of calls to undefined functions=OVERAPPROXIMATE_BEHAVIOUR [2025-02-07 22:46:12,854 INFO L153 SettingsManager]: * Use constant arrays=true [2025-02-07 22:46:12,854 INFO L151 SettingsManager]: Preferences of IcfgBuilder differ from their defaults: [2025-02-07 22:46:12,854 INFO L153 SettingsManager]: * Size of a code block=SequenceOfStatements [2025-02-07 22:46:12,854 INFO L153 SettingsManager]: * Only consider context switches at boundaries of atomic blocks=true [2025-02-07 22:46:12,854 INFO L153 SettingsManager]: * SMT solver=External_DefaultMode [2025-02-07 22:46:12,854 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2025-02-07 22:46:12,855 INFO L151 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2025-02-07 22:46:12,855 INFO L153 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2025-02-07 22:46:12,855 INFO L153 SettingsManager]: * Compute procedure contracts=false [2025-02-07 22:46:12,855 INFO L153 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopHeads [2025-02-07 22:46:12,855 INFO L153 SettingsManager]: * Trace refinement strategy=CAMEL [2025-02-07 22:46:12,855 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2025-02-07 22:46:12,855 INFO L153 SettingsManager]: * Apply one-shot large block encoding in concurrent analysis=false [2025-02-07 22:46:12,856 INFO L153 SettingsManager]: * Automaton type used in concurrency analysis=PETRI_NET [2025-02-07 22:46:12,856 INFO L153 SettingsManager]: * Order on configurations for Petri net unfoldings=DBO [2025-02-07 22:46:12,856 INFO L153 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode [2025-02-07 22:46:12,856 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 -> 965536a1eccbb3950fb02708c11ed62fda8db430ae4f769dc023e63105c711ca [2025-02-07 22:46:13,076 INFO L75 nceAwareModelManager]: Repository-Root is: /tmp [2025-02-07 22:46:13,086 INFO L261 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2025-02-07 22:46:13,088 INFO L217 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2025-02-07 22:46:13,089 INFO L270 PluginConnector]: Initializing CDTParser... [2025-02-07 22:46:13,093 INFO L274 PluginConnector]: CDTParser initialized [2025-02-07 22:46:13,094 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.cal6.c [2025-02-07 22:46:14,366 INFO L533 CDTParser]: Created temporary CDT project at /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/data/13d3a675e/2acf31c65aed45379a36f324c134175a/FLAGd5ec3f38c [2025-02-07 22:46:14,719 INFO L384 CDTParser]: Found 1 translation units. [2025-02-07 22:46:14,720 INFO L180 CDTParser]: Scanning /storage/repos/ultimate-jdk21/releaseScripts/default/sv-benchmarks/c/hardware-verification-bv/btor2c-lazyMod.cal6.c [2025-02-07 22:46:14,735 INFO L427 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/data/13d3a675e/2acf31c65aed45379a36f324c134175a/FLAGd5ec3f38c [2025-02-07 22:46:14,933 INFO L435 CDTParser]: Successfully deleted /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/data/13d3a675e/2acf31c65aed45379a36f324c134175a [2025-02-07 22:46:14,935 INFO L299 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2025-02-07 22:46:14,936 INFO L133 ToolchainWalker]: Walking toolchain with 6 elements. [2025-02-07 22:46:14,937 INFO L112 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2025-02-07 22:46:14,937 INFO L270 PluginConnector]: Initializing CACSL2BoogieTranslator... [2025-02-07 22:46:14,940 INFO L274 PluginConnector]: CACSL2BoogieTranslator initialized [2025-02-07 22:46:14,940 INFO L184 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 07.02 10:46:14" (1/1) ... [2025-02-07 22:46:14,941 INFO L204 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@53398619 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 07.02 10:46:14, skipping insertion in model container [2025-02-07 22:46:14,941 INFO L184 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 07.02 10:46:14" (1/1) ... [2025-02-07 22:46:14,967 INFO L175 MainTranslator]: Built tables and reachable declarations [2025-02-07 22:46:15,099 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.cal6.c[1244,1257] [2025-02-07 22:46:15,346 INFO L210 PostProcessor]: Analyzing one entry point: main [2025-02-07 22:46:15,353 INFO L200 MainTranslator]: Completed pre-run [2025-02-07 22:46:15,364 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.cal6.c[1244,1257] [2025-02-07 22:46:15,473 INFO L210 PostProcessor]: Analyzing one entry point: main [2025-02-07 22:46:15,482 INFO L204 MainTranslator]: Completed translation [2025-02-07 22:46:15,483 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 07.02 10:46:15 WrapperNode [2025-02-07 22:46:15,483 INFO L131 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2025-02-07 22:46:15,484 INFO L112 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2025-02-07 22:46:15,484 INFO L270 PluginConnector]: Initializing Boogie Procedure Inliner... [2025-02-07 22:46:15,484 INFO L274 PluginConnector]: Boogie Procedure Inliner initialized [2025-02-07 22:46:15,488 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 07.02 10:46:15" (1/1) ... [2025-02-07 22:46:15,520 INFO L184 PluginConnector]: Executing the observer Inliner from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 07.02 10:46:15" (1/1) ... [2025-02-07 22:46:15,849 INFO L138 Inliner]: procedures = 17, calls = 15, calls flagged for inlining = 3, calls inlined = 3, statements flattened = 3697 [2025-02-07 22:46:15,849 INFO L131 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2025-02-07 22:46:15,850 INFO L112 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2025-02-07 22:46:15,850 INFO L270 PluginConnector]: Initializing Boogie Preprocessor... [2025-02-07 22:46:15,850 INFO L274 PluginConnector]: Boogie Preprocessor initialized [2025-02-07 22:46:15,856 INFO L184 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 07.02 10:46:15" (1/1) ... [2025-02-07 22:46:15,856 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 07.02 10:46:15" (1/1) ... [2025-02-07 22:46:15,902 INFO L184 PluginConnector]: Executing the observer MemorySlicer from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 07.02 10:46:15" (1/1) ... [2025-02-07 22:46:16,034 INFO L175 MemorySlicer]: Split 9 memory accesses to 2 slices as follows [2, 7]. 78 percent of accesses are in the largest equivalence class. The 9 initializations are split as follows [2, 7]. The 0 writes are split as follows [0, 0]. [2025-02-07 22:46:16,035 INFO L184 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 07.02 10:46:15" (1/1) ... [2025-02-07 22:46:16,036 INFO L184 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 07.02 10:46:15" (1/1) ... [2025-02-07 22:46:16,112 INFO L184 PluginConnector]: Executing the observer ReplaceArrayAssignments from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 07.02 10:46:15" (1/1) ... [2025-02-07 22:46:16,128 INFO L184 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 07.02 10:46:15" (1/1) ... [2025-02-07 22:46:16,148 INFO L184 PluginConnector]: Executing the observer LTLStepAnnotator from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 07.02 10:46:15" (1/1) ... [2025-02-07 22:46:16,166 INFO L184 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 07.02 10:46:15" (1/1) ... [2025-02-07 22:46:16,244 INFO L131 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2025-02-07 22:46:16,246 INFO L112 PluginConnector]: ------------------------IcfgBuilder---------------------------- [2025-02-07 22:46:16,246 INFO L270 PluginConnector]: Initializing IcfgBuilder... [2025-02-07 22:46:16,246 INFO L274 PluginConnector]: IcfgBuilder initialized [2025-02-07 22:46:16,247 INFO L184 PluginConnector]: Executing the observer IcfgBuilderObserver from plugin IcfgBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 07.02 10:46:15" (1/1) ... [2025-02-07 22:46:16,251 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2025-02-07 22:46:16,260 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 [2025-02-07 22:46:16,283 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-07 22:46:16,292 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-07 22:46:16,320 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocInit [2025-02-07 22:46:16,320 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int#0 [2025-02-07 22:46:16,320 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int#1 [2025-02-07 22:46:16,320 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2025-02-07 22:46:16,320 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2025-02-07 22:46:16,732 INFO L257 CfgBuilder]: Building ICFG [2025-02-07 22:46:16,733 INFO L287 CfgBuilder]: Building CFG for each procedure with an implementation [2025-02-07 22:46:19,775 INFO L? ?]: Removed 2053 outVars from TransFormulas that were not future-live. [2025-02-07 22:46:19,775 INFO L308 CfgBuilder]: Performing block encoding [2025-02-07 22:46:19,920 INFO L332 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2025-02-07 22:46:19,928 INFO L337 CfgBuilder]: Removed 0 assume(true) statements. [2025-02-07 22:46:19,928 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.icfgbuilder CFG 07.02 10:46:19 BoogieIcfgContainer [2025-02-07 22:46:19,928 INFO L131 PluginConnector]: ------------------------ END IcfgBuilder---------------------------- [2025-02-07 22:46:19,930 INFO L112 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2025-02-07 22:46:19,930 INFO L270 PluginConnector]: Initializing TraceAbstraction... [2025-02-07 22:46:19,938 INFO L274 PluginConnector]: TraceAbstraction initialized [2025-02-07 22:46:19,938 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 07.02 10:46:14" (1/3) ... [2025-02-07 22:46:19,939 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@1dc97651 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 07.02 10:46:19, skipping insertion in model container [2025-02-07 22:46:19,939 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 07.02 10:46:15" (2/3) ... [2025-02-07 22:46:19,939 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@1dc97651 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 07.02 10:46:19, skipping insertion in model container [2025-02-07 22:46:19,939 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.icfgbuilder CFG 07.02 10:46:19" (3/3) ... [2025-02-07 22:46:19,940 INFO L128 eAbstractionObserver]: Analyzing ICFG btor2c-lazyMod.cal6.c [2025-02-07 22:46:19,966 INFO L216 ceAbstractionStarter]: Automizer settings: Hoare:LoopHeads NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2025-02-07 22:46:19,968 INFO L151 ceAbstractionStarter]: Applying trace abstraction to ICFG btor2c-lazyMod.cal6.c that has 1 procedures, 1107 locations, 1 initial locations, 1 loop locations, and 1 error locations. [2025-02-07 22:46:20,068 INFO L332 AbstractCegarLoop]: ======== Iteration 0 == of CEGAR loop == AllErrorsAtOnce ======== [2025-02-07 22:46:20,083 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;@60ab6225, mLbeIndependenceSettings=[IndependenceType=SEMANTIC, AbstractionType=NONE, UseConditional=false, UseSemiCommutativity=true, Solver=Z3, SolverTimeout=1000ms] [2025-02-07 22:46:20,083 INFO L334 AbstractCegarLoop]: Starting to check reachability of 1 error locations. [2025-02-07 22:46:20,092 INFO L276 IsEmpty]: Start isEmpty. Operand has 1107 states, 1105 states have (on average 1.5013574660633484) internal successors, (1659), 1106 states have internal predecessors, (1659), 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-07 22:46:20,134 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 363 [2025-02-07 22:46:20,138 INFO L210 NwaCegarLoop]: Found error trace [2025-02-07 22:46:20,139 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, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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-07 22:46:20,140 INFO L396 AbstractCegarLoop]: === Iteration 1 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-02-07 22:46:20,144 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-02-07 22:46:20,148 INFO L85 PathProgramCache]: Analyzing trace with hash 1795090761, now seen corresponding path program 1 times [2025-02-07 22:46:20,169 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-02-07 22:46:20,173 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1782133603] [2025-02-07 22:46:20,174 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-02-07 22:46:20,176 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-02-07 22:46:20,392 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 362 statements into 1 equivalence classes. [2025-02-07 22:46:20,813 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 362 of 362 statements. [2025-02-07 22:46:20,813 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-02-07 22:46:20,814 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-02-07 22:46:22,520 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-07 22:46:22,522 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-02-07 22:46:22,522 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1782133603] [2025-02-07 22:46:22,523 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1782133603] provided 1 perfect and 0 imperfect interpolant sequences [2025-02-07 22:46:22,523 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-02-07 22:46:22,524 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2025-02-07 22:46:22,525 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [836517221] [2025-02-07 22:46:22,525 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-02-07 22:46:22,528 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2025-02-07 22:46:22,529 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-02-07 22:46:22,544 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2025-02-07 22:46:22,545 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2025-02-07 22:46:22,549 INFO L87 Difference]: Start difference. First operand has 1107 states, 1105 states have (on average 1.5013574660633484) internal successors, (1659), 1106 states have internal predecessors, (1659), 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 90.5) internal successors, (362), 4 states have internal predecessors, (362), 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-07 22:46:23,231 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-02-07 22:46:23,232 INFO L93 Difference]: Finished difference Result 2185 states and 3277 transitions. [2025-02-07 22:46:23,233 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2025-02-07 22:46:23,234 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 4 states have (on average 90.5) internal successors, (362), 4 states have internal predecessors, (362), 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 362 [2025-02-07 22:46:23,235 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-02-07 22:46:23,247 INFO L225 Difference]: With dead ends: 2185 [2025-02-07 22:46:23,251 INFO L226 Difference]: Without dead ends: 1107 [2025-02-07 22:46:23,256 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-07 22:46:23,261 INFO L435 NwaCegarLoop]: 1380 mSDtfsCounter, 0 mSDsluCounter, 2755 mSDsCounter, 0 mSdLazyCounter, 832 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.5s Time, 0 mProtectedPredicate, 0 mProtectedAction, 0 SdHoareTripleChecker+Valid, 4135 SdHoareTripleChecker+Invalid, 832 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 832 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.6s IncrementalHoareTripleChecker+Time [2025-02-07 22:46:23,262 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [0 Valid, 4135 Invalid, 832 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 832 Invalid, 0 Unknown, 0 Unchecked, 0.6s Time] [2025-02-07 22:46:23,285 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1107 states. [2025-02-07 22:46:23,343 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1107 to 1107. [2025-02-07 22:46:23,346 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 1107 states, 1106 states have (on average 1.4990958408679929) internal successors, (1658), 1106 states have internal predecessors, (1658), 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-07 22:46:23,352 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1107 states to 1107 states and 1658 transitions. [2025-02-07 22:46:23,356 INFO L78 Accepts]: Start accepts. Automaton has 1107 states and 1658 transitions. Word has length 362 [2025-02-07 22:46:23,358 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-02-07 22:46:23,361 INFO L471 AbstractCegarLoop]: Abstraction has 1107 states and 1658 transitions. [2025-02-07 22:46:23,362 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 90.5) internal successors, (362), 4 states have internal predecessors, (362), 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-07 22:46:23,362 INFO L276 IsEmpty]: Start isEmpty. Operand 1107 states and 1658 transitions. [2025-02-07 22:46:23,365 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 364 [2025-02-07 22:46:23,368 INFO L210 NwaCegarLoop]: Found error trace [2025-02-07 22:46:23,368 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, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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-07 22:46:23,368 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable0 [2025-02-07 22:46:23,368 INFO L396 AbstractCegarLoop]: === Iteration 2 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-02-07 22:46:23,369 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-02-07 22:46:23,369 INFO L85 PathProgramCache]: Analyzing trace with hash -182081449, now seen corresponding path program 1 times [2025-02-07 22:46:23,369 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-02-07 22:46:23,369 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [618933011] [2025-02-07 22:46:23,369 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-02-07 22:46:23,369 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-02-07 22:46:23,499 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 363 statements into 1 equivalence classes. [2025-02-07 22:46:23,669 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 363 of 363 statements. [2025-02-07 22:46:23,670 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-02-07 22:46:23,670 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-02-07 22:46:24,280 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-07 22:46:24,280 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-02-07 22:46:24,280 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [618933011] [2025-02-07 22:46:24,280 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [618933011] provided 1 perfect and 0 imperfect interpolant sequences [2025-02-07 22:46:24,280 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-02-07 22:46:24,280 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2025-02-07 22:46:24,280 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1843573902] [2025-02-07 22:46:24,280 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-02-07 22:46:24,281 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2025-02-07 22:46:24,281 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-02-07 22:46:24,282 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2025-02-07 22:46:24,282 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2025-02-07 22:46:24,282 INFO L87 Difference]: Start difference. First operand 1107 states and 1658 transitions. Second operand has 4 states, 4 states have (on average 90.75) internal successors, (363), 4 states have internal predecessors, (363), 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-07 22:46:24,717 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-02-07 22:46:24,717 INFO L93 Difference]: Finished difference Result 2187 states and 3276 transitions. [2025-02-07 22:46:24,717 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2025-02-07 22:46:24,718 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 4 states have (on average 90.75) internal successors, (363), 4 states have internal predecessors, (363), 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 363 [2025-02-07 22:46:24,719 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-02-07 22:46:24,722 INFO L225 Difference]: With dead ends: 2187 [2025-02-07 22:46:24,722 INFO L226 Difference]: Without dead ends: 1109 [2025-02-07 22:46:24,723 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-07 22:46:24,724 INFO L435 NwaCegarLoop]: 1380 mSDtfsCounter, 0 mSDsluCounter, 2752 mSDsCounter, 0 mSdLazyCounter, 835 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.3s Time, 0 mProtectedPredicate, 0 mProtectedAction, 0 SdHoareTripleChecker+Valid, 4132 SdHoareTripleChecker+Invalid, 835 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 835 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.4s IncrementalHoareTripleChecker+Time [2025-02-07 22:46:24,724 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [0 Valid, 4132 Invalid, 835 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 835 Invalid, 0 Unknown, 0 Unchecked, 0.4s Time] [2025-02-07 22:46:24,725 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1109 states. [2025-02-07 22:46:24,737 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1109 to 1109. [2025-02-07 22:46:24,739 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 1109 states, 1108 states have (on average 1.4981949458483754) internal successors, (1660), 1108 states have internal predecessors, (1660), 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-07 22:46:24,741 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1109 states to 1109 states and 1660 transitions. [2025-02-07 22:46:24,742 INFO L78 Accepts]: Start accepts. Automaton has 1109 states and 1660 transitions. Word has length 363 [2025-02-07 22:46:24,742 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-02-07 22:46:24,742 INFO L471 AbstractCegarLoop]: Abstraction has 1109 states and 1660 transitions. [2025-02-07 22:46:24,742 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 90.75) internal successors, (363), 4 states have internal predecessors, (363), 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-07 22:46:24,743 INFO L276 IsEmpty]: Start isEmpty. Operand 1109 states and 1660 transitions. [2025-02-07 22:46:24,745 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 365 [2025-02-07 22:46:24,745 INFO L210 NwaCegarLoop]: Found error trace [2025-02-07 22:46:24,745 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, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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-07 22:46:24,746 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable1 [2025-02-07 22:46:24,746 INFO L396 AbstractCegarLoop]: === Iteration 3 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-02-07 22:46:24,746 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-02-07 22:46:24,746 INFO L85 PathProgramCache]: Analyzing trace with hash 581952260, now seen corresponding path program 1 times [2025-02-07 22:46:24,746 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-02-07 22:46:24,746 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [87003311] [2025-02-07 22:46:24,747 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-02-07 22:46:24,747 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-02-07 22:46:24,818 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 364 statements into 1 equivalence classes. [2025-02-07 22:46:25,770 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 364 of 364 statements. [2025-02-07 22:46:25,771 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-02-07 22:46:25,771 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-02-07 22:46:26,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-07 22:46:26,719 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-02-07 22:46:26,720 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [87003311] [2025-02-07 22:46:26,720 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [87003311] provided 1 perfect and 0 imperfect interpolant sequences [2025-02-07 22:46:26,720 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-02-07 22:46:26,720 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2025-02-07 22:46:26,720 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [362226555] [2025-02-07 22:46:26,720 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-02-07 22:46:26,721 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2025-02-07 22:46:26,721 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-02-07 22:46:26,721 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2025-02-07 22:46:26,722 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2025-02-07 22:46:26,722 INFO L87 Difference]: Start difference. First operand 1109 states and 1660 transitions. Second operand has 4 states, 4 states have (on average 91.0) internal successors, (364), 4 states have internal predecessors, (364), 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-07 22:46:27,294 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-02-07 22:46:27,294 INFO L93 Difference]: Finished difference Result 2189 states and 3277 transitions. [2025-02-07 22:46:27,295 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2025-02-07 22:46:27,296 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 4 states have (on average 91.0) internal successors, (364), 4 states have internal predecessors, (364), 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 364 [2025-02-07 22:46:27,296 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-02-07 22:46:27,301 INFO L225 Difference]: With dead ends: 2189 [2025-02-07 22:46:27,302 INFO L226 Difference]: Without dead ends: 1109 [2025-02-07 22:46:27,305 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-07 22:46:27,306 INFO L435 NwaCegarLoop]: 1378 mSDtfsCounter, 14 mSDsluCounter, 2736 mSDsCounter, 0 mSdLazyCounter, 830 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.4s Time, 0 mProtectedPredicate, 0 mProtectedAction, 14 SdHoareTripleChecker+Valid, 4114 SdHoareTripleChecker+Invalid, 830 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 830 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.5s IncrementalHoareTripleChecker+Time [2025-02-07 22:46:27,306 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [14 Valid, 4114 Invalid, 830 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 830 Invalid, 0 Unknown, 0 Unchecked, 0.5s Time] [2025-02-07 22:46:27,309 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1109 states. [2025-02-07 22:46:27,329 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1109 to 1109. [2025-02-07 22:46:27,330 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 1109 states, 1108 states have (on average 1.4972924187725631) internal successors, (1659), 1108 states have internal predecessors, (1659), 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-07 22:46:27,333 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1109 states to 1109 states and 1659 transitions. [2025-02-07 22:46:27,334 INFO L78 Accepts]: Start accepts. Automaton has 1109 states and 1659 transitions. Word has length 364 [2025-02-07 22:46:27,334 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-02-07 22:46:27,334 INFO L471 AbstractCegarLoop]: Abstraction has 1109 states and 1659 transitions. [2025-02-07 22:46:27,334 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 91.0) internal successors, (364), 4 states have internal predecessors, (364), 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-07 22:46:27,335 INFO L276 IsEmpty]: Start isEmpty. Operand 1109 states and 1659 transitions. [2025-02-07 22:46:27,340 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 366 [2025-02-07 22:46:27,341 INFO L210 NwaCegarLoop]: Found error trace [2025-02-07 22:46:27,341 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, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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-07 22:46:27,341 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable2 [2025-02-07 22:46:27,341 INFO L396 AbstractCegarLoop]: === Iteration 4 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-02-07 22:46:27,342 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-02-07 22:46:27,342 INFO L85 PathProgramCache]: Analyzing trace with hash -181572035, now seen corresponding path program 1 times [2025-02-07 22:46:27,343 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-02-07 22:46:27,343 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1559949642] [2025-02-07 22:46:27,343 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-02-07 22:46:27,343 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-02-07 22:46:27,443 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 365 statements into 1 equivalence classes. [2025-02-07 22:46:28,108 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 365 of 365 statements. [2025-02-07 22:46:28,109 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-02-07 22:46:28,109 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-02-07 22:46:28,961 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-07 22:46:28,962 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-02-07 22:46:28,962 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1559949642] [2025-02-07 22:46:28,962 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1559949642] provided 1 perfect and 0 imperfect interpolant sequences [2025-02-07 22:46:28,962 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-02-07 22:46:28,962 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2025-02-07 22:46:28,962 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [687106988] [2025-02-07 22:46:28,962 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-02-07 22:46:28,963 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2025-02-07 22:46:28,963 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-02-07 22:46:28,964 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2025-02-07 22:46:28,964 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-02-07 22:46:28,964 INFO L87 Difference]: Start difference. First operand 1109 states and 1659 transitions. Second operand has 3 states, 3 states have (on average 121.66666666666667) internal successors, (365), 3 states have internal predecessors, (365), 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-07 22:46:29,374 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-02-07 22:46:29,374 INFO L93 Difference]: Finished difference Result 2189 states and 3275 transitions. [2025-02-07 22:46:29,375 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2025-02-07 22:46:29,375 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 121.66666666666667) internal successors, (365), 3 states have internal predecessors, (365), 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 365 [2025-02-07 22:46:29,376 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-02-07 22:46:29,379 INFO L225 Difference]: With dead ends: 2189 [2025-02-07 22:46:29,379 INFO L226 Difference]: Without dead ends: 1109 [2025-02-07 22:46:29,380 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 3 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-02-07 22:46:29,381 INFO L435 NwaCegarLoop]: 1378 mSDtfsCounter, 2 mSDsluCounter, 1374 mSDsCounter, 0 mSdLazyCounter, 553 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.3s Time, 0 mProtectedPredicate, 0 mProtectedAction, 2 SdHoareTripleChecker+Valid, 2752 SdHoareTripleChecker+Invalid, 553 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 553 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.4s IncrementalHoareTripleChecker+Time [2025-02-07 22:46:29,381 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [2 Valid, 2752 Invalid, 553 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 553 Invalid, 0 Unknown, 0 Unchecked, 0.4s Time] [2025-02-07 22:46:29,383 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1109 states. [2025-02-07 22:46:29,394 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1109 to 1109. [2025-02-07 22:46:29,396 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 1109 states, 1108 states have (on average 1.4963898916967509) internal successors, (1658), 1108 states have internal predecessors, (1658), 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-07 22:46:29,399 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1109 states to 1109 states and 1658 transitions. [2025-02-07 22:46:29,400 INFO L78 Accepts]: Start accepts. Automaton has 1109 states and 1658 transitions. Word has length 365 [2025-02-07 22:46:29,400 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-02-07 22:46:29,401 INFO L471 AbstractCegarLoop]: Abstraction has 1109 states and 1658 transitions. [2025-02-07 22:46:29,401 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 121.66666666666667) internal successors, (365), 3 states have internal predecessors, (365), 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-07 22:46:29,401 INFO L276 IsEmpty]: Start isEmpty. Operand 1109 states and 1658 transitions. [2025-02-07 22:46:29,404 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 367 [2025-02-07 22:46:29,404 INFO L210 NwaCegarLoop]: Found error trace [2025-02-07 22:46:29,404 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, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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-07 22:46:29,404 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable3 [2025-02-07 22:46:29,404 INFO L396 AbstractCegarLoop]: === Iteration 5 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-02-07 22:46:29,405 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-02-07 22:46:29,405 INFO L85 PathProgramCache]: Analyzing trace with hash -1334538217, now seen corresponding path program 1 times [2025-02-07 22:46:29,405 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-02-07 22:46:29,405 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [952566595] [2025-02-07 22:46:29,405 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-02-07 22:46:29,406 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-02-07 22:46:29,475 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 366 statements into 1 equivalence classes. [2025-02-07 22:46:29,961 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 366 of 366 statements. [2025-02-07 22:46:29,961 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-02-07 22:46:29,961 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-02-07 22:46:30,655 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-07 22:46:30,656 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-02-07 22:46:30,656 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [952566595] [2025-02-07 22:46:30,656 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [952566595] provided 1 perfect and 0 imperfect interpolant sequences [2025-02-07 22:46:30,656 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-02-07 22:46:30,656 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2025-02-07 22:46:30,657 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1941202734] [2025-02-07 22:46:30,657 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-02-07 22:46:30,658 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2025-02-07 22:46:30,658 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-02-07 22:46:30,658 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2025-02-07 22:46:30,658 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2025-02-07 22:46:30,659 INFO L87 Difference]: Start difference. First operand 1109 states and 1658 transitions. Second operand has 4 states, 4 states have (on average 91.5) internal successors, (366), 4 states have internal predecessors, (366), 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-07 22:46:31,138 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-02-07 22:46:31,138 INFO L93 Difference]: Finished difference Result 2189 states and 3273 transitions. [2025-02-07 22:46:31,138 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2025-02-07 22:46:31,139 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 4 states have (on average 91.5) internal successors, (366), 4 states have internal predecessors, (366), 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 366 [2025-02-07 22:46:31,139 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-02-07 22:46:31,143 INFO L225 Difference]: With dead ends: 2189 [2025-02-07 22:46:31,143 INFO L226 Difference]: Without dead ends: 1109 [2025-02-07 22:46:31,144 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-07 22:46:31,145 INFO L435 NwaCegarLoop]: 1376 mSDtfsCounter, 28 mSDsluCounter, 2713 mSDsCounter, 0 mSdLazyCounter, 826 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.4s Time, 0 mProtectedPredicate, 0 mProtectedAction, 28 SdHoareTripleChecker+Valid, 4089 SdHoareTripleChecker+Invalid, 826 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 826 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.4s IncrementalHoareTripleChecker+Time [2025-02-07 22:46:31,145 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [28 Valid, 4089 Invalid, 826 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 826 Invalid, 0 Unknown, 0 Unchecked, 0.4s Time] [2025-02-07 22:46:31,147 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1109 states. [2025-02-07 22:46:31,159 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1109 to 1109. [2025-02-07 22:46:31,161 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 1109 states, 1108 states have (on average 1.4954873646209386) internal successors, (1657), 1108 states have internal predecessors, (1657), 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-07 22:46:31,164 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1109 states to 1109 states and 1657 transitions. [2025-02-07 22:46:31,164 INFO L78 Accepts]: Start accepts. Automaton has 1109 states and 1657 transitions. Word has length 366 [2025-02-07 22:46:31,164 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-02-07 22:46:31,164 INFO L471 AbstractCegarLoop]: Abstraction has 1109 states and 1657 transitions. [2025-02-07 22:46:31,165 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 91.5) internal successors, (366), 4 states have internal predecessors, (366), 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-07 22:46:31,165 INFO L276 IsEmpty]: Start isEmpty. Operand 1109 states and 1657 transitions. [2025-02-07 22:46:31,169 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 368 [2025-02-07 22:46:31,169 INFO L210 NwaCegarLoop]: Found error trace [2025-02-07 22:46:31,169 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, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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-07 22:46:31,170 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable4 [2025-02-07 22:46:31,170 INFO L396 AbstractCegarLoop]: === Iteration 6 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-02-07 22:46:31,170 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-02-07 22:46:31,171 INFO L85 PathProgramCache]: Analyzing trace with hash -1585576540, now seen corresponding path program 1 times [2025-02-07 22:46:31,171 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-02-07 22:46:31,171 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1074661779] [2025-02-07 22:46:31,171 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-02-07 22:46:31,171 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-02-07 22:46:31,259 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 367 statements into 1 equivalence classes. [2025-02-07 22:46:32,766 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 367 of 367 statements. [2025-02-07 22:46:32,766 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-02-07 22:46:32,766 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-02-07 22:46:34,113 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-07 22:46:34,113 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-02-07 22:46:34,113 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1074661779] [2025-02-07 22:46:34,113 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1074661779] provided 1 perfect and 0 imperfect interpolant sequences [2025-02-07 22:46:34,113 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-02-07 22:46:34,113 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2025-02-07 22:46:34,113 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [879427541] [2025-02-07 22:46:34,113 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-02-07 22:46:34,114 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 8 states [2025-02-07 22:46:34,114 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-02-07 22:46:34,114 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2025-02-07 22:46:34,114 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=14, Invalid=42, Unknown=0, NotChecked=0, Total=56 [2025-02-07 22:46:34,114 INFO L87 Difference]: Start difference. First operand 1109 states and 1657 transitions. Second operand has 8 states, 8 states have (on average 45.875) internal successors, (367), 7 states have internal predecessors, (367), 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-07 22:46:35,570 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-02-07 22:46:35,570 INFO L93 Difference]: Finished difference Result 2225 states and 3323 transitions. [2025-02-07 22:46:35,571 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2025-02-07 22:46:35,571 INFO L78 Accepts]: Start accepts. Automaton has has 8 states, 8 states have (on average 45.875) internal successors, (367), 7 states have internal predecessors, (367), 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 367 [2025-02-07 22:46:35,572 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-02-07 22:46:35,575 INFO L225 Difference]: With dead ends: 2225 [2025-02-07 22:46:35,575 INFO L226 Difference]: Without dead ends: 1145 [2025-02-07 22:46:35,576 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 13 GetRequests, 3 SyntacticMatches, 0 SemanticMatches, 10 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 10 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=30, Invalid=102, Unknown=0, NotChecked=0, Total=132 [2025-02-07 22:46:35,577 INFO L435 NwaCegarLoop]: 1127 mSDtfsCounter, 1411 mSDsluCounter, 5625 mSDsCounter, 0 mSdLazyCounter, 3165 mSolverCounterSat, 1 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 1.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 1411 SdHoareTripleChecker+Valid, 6752 SdHoareTripleChecker+Invalid, 3166 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 1 IncrementalHoareTripleChecker+Valid, 3165 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 1.4s IncrementalHoareTripleChecker+Time [2025-02-07 22:46:35,577 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [1411 Valid, 6752 Invalid, 3166 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [1 Valid, 3165 Invalid, 0 Unknown, 0 Unchecked, 1.4s Time] [2025-02-07 22:46:35,578 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1145 states. [2025-02-07 22:46:35,588 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1145 to 1143. [2025-02-07 22:46:35,590 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 1143 states, 1142 states have (on average 1.4929947460595447) internal successors, (1705), 1142 states have internal predecessors, (1705), 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-07 22:46:35,593 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1143 states to 1143 states and 1705 transitions. [2025-02-07 22:46:35,593 INFO L78 Accepts]: Start accepts. Automaton has 1143 states and 1705 transitions. Word has length 367 [2025-02-07 22:46:35,594 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-02-07 22:46:35,594 INFO L471 AbstractCegarLoop]: Abstraction has 1143 states and 1705 transitions. [2025-02-07 22:46:35,595 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 8 states, 8 states have (on average 45.875) internal successors, (367), 7 states have internal predecessors, (367), 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-07 22:46:35,595 INFO L276 IsEmpty]: Start isEmpty. Operand 1143 states and 1705 transitions. [2025-02-07 22:46:35,598 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 369 [2025-02-07 22:46:35,598 INFO L210 NwaCegarLoop]: Found error trace [2025-02-07 22:46:35,598 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, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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-07 22:46:35,598 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable5 [2025-02-07 22:46:35,598 INFO L396 AbstractCegarLoop]: === Iteration 7 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-02-07 22:46:35,599 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-02-07 22:46:35,599 INFO L85 PathProgramCache]: Analyzing trace with hash -1199908200, now seen corresponding path program 1 times [2025-02-07 22:46:35,599 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-02-07 22:46:35,599 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [854592206] [2025-02-07 22:46:35,599 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-02-07 22:46:35,599 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-02-07 22:46:35,666 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 368 statements into 1 equivalence classes. [2025-02-07 22:46:36,157 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 368 of 368 statements. [2025-02-07 22:46:36,157 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-02-07 22:46:36,158 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-02-07 22:46:37,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-07 22:46:37,089 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-02-07 22:46:37,089 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [854592206] [2025-02-07 22:46:37,090 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [854592206] provided 1 perfect and 0 imperfect interpolant sequences [2025-02-07 22:46:37,090 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-02-07 22:46:37,090 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2025-02-07 22:46:37,090 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [724783085] [2025-02-07 22:46:37,090 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-02-07 22:46:37,090 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2025-02-07 22:46:37,090 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-02-07 22:46:37,091 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2025-02-07 22:46:37,091 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=8, Invalid=12, Unknown=0, NotChecked=0, Total=20 [2025-02-07 22:46:37,091 INFO L87 Difference]: Start difference. First operand 1143 states and 1705 transitions. Second operand has 5 states, 5 states have (on average 73.6) internal successors, (368), 5 states have internal predecessors, (368), 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-07 22:46:37,551 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-02-07 22:46:37,551 INFO L93 Difference]: Finished difference Result 2277 states and 3396 transitions. [2025-02-07 22:46:37,552 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2025-02-07 22:46:37,552 INFO L78 Accepts]: Start accepts. Automaton has has 5 states, 5 states have (on average 73.6) internal successors, (368), 5 states have internal predecessors, (368), 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 368 [2025-02-07 22:46:37,553 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-02-07 22:46:37,556 INFO L225 Difference]: With dead ends: 2277 [2025-02-07 22:46:37,556 INFO L226 Difference]: Without dead ends: 1163 [2025-02-07 22:46:37,558 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 8 GetRequests, 4 SyntacticMatches, 1 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=8, Invalid=12, Unknown=0, NotChecked=0, Total=20 [2025-02-07 22:46:37,558 INFO L435 NwaCegarLoop]: 1376 mSDtfsCounter, 33 mSDsluCounter, 2743 mSDsCounter, 0 mSdLazyCounter, 846 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.4s Time, 0 mProtectedPredicate, 0 mProtectedAction, 33 SdHoareTripleChecker+Valid, 4119 SdHoareTripleChecker+Invalid, 846 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 846 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.4s IncrementalHoareTripleChecker+Time [2025-02-07 22:46:37,559 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [33 Valid, 4119 Invalid, 846 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 846 Invalid, 0 Unknown, 0 Unchecked, 0.4s Time] [2025-02-07 22:46:37,561 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1163 states. [2025-02-07 22:46:37,572 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1163 to 1162. [2025-02-07 22:46:37,573 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 1162 states, 1161 states have (on average 1.491817398794143) internal successors, (1732), 1161 states have internal predecessors, (1732), 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-07 22:46:37,577 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1162 states to 1162 states and 1732 transitions. [2025-02-07 22:46:37,577 INFO L78 Accepts]: Start accepts. Automaton has 1162 states and 1732 transitions. Word has length 368 [2025-02-07 22:46:37,578 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-02-07 22:46:37,578 INFO L471 AbstractCegarLoop]: Abstraction has 1162 states and 1732 transitions. [2025-02-07 22:46:37,578 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 73.6) internal successors, (368), 5 states have internal predecessors, (368), 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-07 22:46:37,578 INFO L276 IsEmpty]: Start isEmpty. Operand 1162 states and 1732 transitions. [2025-02-07 22:46:37,580 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 369 [2025-02-07 22:46:37,580 INFO L210 NwaCegarLoop]: Found error trace [2025-02-07 22:46:37,580 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, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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-07 22:46:37,580 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable6 [2025-02-07 22:46:37,580 INFO L396 AbstractCegarLoop]: === Iteration 8 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-02-07 22:46:37,581 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-02-07 22:46:37,581 INFO L85 PathProgramCache]: Analyzing trace with hash 1584027703, now seen corresponding path program 1 times [2025-02-07 22:46:37,582 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-02-07 22:46:37,582 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2124510978] [2025-02-07 22:46:37,582 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-02-07 22:46:37,582 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-02-07 22:46:37,647 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 368 statements into 1 equivalence classes. [2025-02-07 22:46:38,111 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 368 of 368 statements. [2025-02-07 22:46:38,111 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-02-07 22:46:38,111 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-02-07 22:46:38,700 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-07 22:46:38,701 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-02-07 22:46:38,701 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2124510978] [2025-02-07 22:46:38,701 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [2124510978] provided 1 perfect and 0 imperfect interpolant sequences [2025-02-07 22:46:38,701 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-02-07 22:46:38,701 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2025-02-07 22:46:38,701 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1609574810] [2025-02-07 22:46:38,701 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-02-07 22:46:38,702 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2025-02-07 22:46:38,702 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-02-07 22:46:38,702 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2025-02-07 22:46:38,702 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2025-02-07 22:46:38,703 INFO L87 Difference]: Start difference. First operand 1162 states and 1732 transitions. Second operand has 4 states, 4 states have (on average 92.0) internal successors, (368), 4 states have internal predecessors, (368), 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-07 22:46:39,111 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-02-07 22:46:39,111 INFO L93 Difference]: Finished difference Result 2295 states and 3421 transitions. [2025-02-07 22:46:39,112 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2025-02-07 22:46:39,112 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 4 states have (on average 92.0) internal successors, (368), 4 states have internal predecessors, (368), 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 368 [2025-02-07 22:46:39,112 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-02-07 22:46:39,115 INFO L225 Difference]: With dead ends: 2295 [2025-02-07 22:46:39,115 INFO L226 Difference]: Without dead ends: 1162 [2025-02-07 22:46:39,116 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 5 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=9, Invalid=11, Unknown=0, NotChecked=0, Total=20 [2025-02-07 22:46:39,117 INFO L435 NwaCegarLoop]: 1374 mSDtfsCounter, 62 mSDsluCounter, 2680 mSDsCounter, 0 mSdLazyCounter, 819 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.3s Time, 0 mProtectedPredicate, 0 mProtectedAction, 62 SdHoareTripleChecker+Valid, 4054 SdHoareTripleChecker+Invalid, 819 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 819 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.4s IncrementalHoareTripleChecker+Time [2025-02-07 22:46:39,117 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [62 Valid, 4054 Invalid, 819 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 819 Invalid, 0 Unknown, 0 Unchecked, 0.4s Time] [2025-02-07 22:46:39,118 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1162 states. [2025-02-07 22:46:39,127 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1162 to 1162. [2025-02-07 22:46:39,128 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 1162 states, 1161 states have (on average 1.4900947459086995) internal successors, (1730), 1161 states have internal predecessors, (1730), 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-07 22:46:39,131 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1162 states to 1162 states and 1730 transitions. [2025-02-07 22:46:39,131 INFO L78 Accepts]: Start accepts. Automaton has 1162 states and 1730 transitions. Word has length 368 [2025-02-07 22:46:39,131 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-02-07 22:46:39,131 INFO L471 AbstractCegarLoop]: Abstraction has 1162 states and 1730 transitions. [2025-02-07 22:46:39,131 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 92.0) internal successors, (368), 4 states have internal predecessors, (368), 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-07 22:46:39,132 INFO L276 IsEmpty]: Start isEmpty. Operand 1162 states and 1730 transitions. [2025-02-07 22:46:39,133 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 370 [2025-02-07 22:46:39,133 INFO L210 NwaCegarLoop]: Found error trace [2025-02-07 22:46:39,133 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, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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-07 22:46:39,135 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable7 [2025-02-07 22:46:39,136 INFO L396 AbstractCegarLoop]: === Iteration 9 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-02-07 22:46:39,136 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-02-07 22:46:39,136 INFO L85 PathProgramCache]: Analyzing trace with hash 6413134, now seen corresponding path program 1 times [2025-02-07 22:46:39,136 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-02-07 22:46:39,137 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1840946774] [2025-02-07 22:46:39,137 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-02-07 22:46:39,137 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-02-07 22:46:39,198 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 369 statements into 1 equivalence classes. [2025-02-07 22:46:39,690 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 369 of 369 statements. [2025-02-07 22:46:39,690 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-02-07 22:46:39,690 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-02-07 22:46:40,276 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-07 22:46:40,277 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-02-07 22:46:40,277 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1840946774] [2025-02-07 22:46:40,277 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1840946774] provided 1 perfect and 0 imperfect interpolant sequences [2025-02-07 22:46:40,277 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-02-07 22:46:40,277 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2025-02-07 22:46:40,277 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [325618762] [2025-02-07 22:46:40,277 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-02-07 22:46:40,278 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2025-02-07 22:46:40,278 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-02-07 22:46:40,278 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2025-02-07 22:46:40,278 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2025-02-07 22:46:40,279 INFO L87 Difference]: Start difference. First operand 1162 states and 1730 transitions. Second operand has 4 states, 4 states have (on average 92.25) internal successors, (369), 4 states have internal predecessors, (369), 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-07 22:46:40,678 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-02-07 22:46:40,679 INFO L93 Difference]: Finished difference Result 2295 states and 3417 transitions. [2025-02-07 22:46:40,679 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2025-02-07 22:46:40,679 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 4 states have (on average 92.25) internal successors, (369), 4 states have internal predecessors, (369), 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 369 [2025-02-07 22:46:40,680 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-02-07 22:46:40,682 INFO L225 Difference]: With dead ends: 2295 [2025-02-07 22:46:40,682 INFO L226 Difference]: Without dead ends: 1162 [2025-02-07 22:46:40,684 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-07 22:46:40,684 INFO L435 NwaCegarLoop]: 1373 mSDtfsCounter, 50 mSDsluCounter, 2676 mSDsCounter, 0 mSdLazyCounter, 821 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.3s Time, 0 mProtectedPredicate, 0 mProtectedAction, 50 SdHoareTripleChecker+Valid, 4049 SdHoareTripleChecker+Invalid, 821 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 821 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.4s IncrementalHoareTripleChecker+Time [2025-02-07 22:46:40,684 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [50 Valid, 4049 Invalid, 821 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 821 Invalid, 0 Unknown, 0 Unchecked, 0.4s Time] [2025-02-07 22:46:40,685 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1162 states. [2025-02-07 22:46:40,695 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1162 to 1162. [2025-02-07 22:46:40,697 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 1162 states, 1161 states have (on average 1.4892334194659775) internal successors, (1729), 1161 states have internal predecessors, (1729), 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-07 22:46:40,698 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1162 states to 1162 states and 1729 transitions. [2025-02-07 22:46:40,698 INFO L78 Accepts]: Start accepts. Automaton has 1162 states and 1729 transitions. Word has length 369 [2025-02-07 22:46:40,699 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-02-07 22:46:40,699 INFO L471 AbstractCegarLoop]: Abstraction has 1162 states and 1729 transitions. [2025-02-07 22:46:40,699 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 92.25) internal successors, (369), 4 states have internal predecessors, (369), 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-07 22:46:40,699 INFO L276 IsEmpty]: Start isEmpty. Operand 1162 states and 1729 transitions. [2025-02-07 22:46:40,701 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 371 [2025-02-07 22:46:40,701 INFO L210 NwaCegarLoop]: Found error trace [2025-02-07 22:46:40,701 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, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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-07 22:46:40,701 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable8 [2025-02-07 22:46:40,701 INFO L396 AbstractCegarLoop]: === Iteration 10 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-02-07 22:46:40,701 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-02-07 22:46:40,702 INFO L85 PathProgramCache]: Analyzing trace with hash 1087071644, now seen corresponding path program 1 times [2025-02-07 22:46:40,702 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-02-07 22:46:40,702 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1716292203] [2025-02-07 22:46:40,702 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-02-07 22:46:40,702 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-02-07 22:46:40,764 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 370 statements into 1 equivalence classes. [2025-02-07 22:46:41,735 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 370 of 370 statements. [2025-02-07 22:46:41,735 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-02-07 22:46:41,735 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-02-07 22:46:42,542 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-07 22:46:42,542 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-02-07 22:46:42,542 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1716292203] [2025-02-07 22:46:42,542 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1716292203] provided 1 perfect and 0 imperfect interpolant sequences [2025-02-07 22:46:42,542 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-02-07 22:46:42,542 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2025-02-07 22:46:42,542 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1314041619] [2025-02-07 22:46:42,542 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-02-07 22:46:42,543 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 7 states [2025-02-07 22:46:42,543 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-02-07 22:46:42,543 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2025-02-07 22:46:42,543 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=15, Invalid=27, Unknown=0, NotChecked=0, Total=42 [2025-02-07 22:46:42,543 INFO L87 Difference]: Start difference. First operand 1162 states and 1729 transitions. Second operand has 7 states, 7 states have (on average 52.857142857142854) internal successors, (370), 6 states have internal predecessors, (370), 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-07 22:46:43,591 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-02-07 22:46:43,591 INFO L93 Difference]: Finished difference Result 2295 states and 3415 transitions. [2025-02-07 22:46:43,591 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2025-02-07 22:46:43,592 INFO L78 Accepts]: Start accepts. Automaton has has 7 states, 7 states have (on average 52.857142857142854) internal successors, (370), 6 states have internal predecessors, (370), 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 370 [2025-02-07 22:46:43,592 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-02-07 22:46:43,598 INFO L225 Difference]: With dead ends: 2295 [2025-02-07 22:46:43,598 INFO L226 Difference]: Without dead ends: 1162 [2025-02-07 22:46:43,600 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 9 GetRequests, 4 SyntacticMatches, 0 SemanticMatches, 5 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=15, Invalid=27, Unknown=0, NotChecked=0, Total=42 [2025-02-07 22:46:43,600 INFO L435 NwaCegarLoop]: 1127 mSDtfsCounter, 1343 mSDsluCounter, 4474 mSDsCounter, 0 mSdLazyCounter, 2609 mSolverCounterSat, 1 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.9s Time, 0 mProtectedPredicate, 0 mProtectedAction, 1343 SdHoareTripleChecker+Valid, 5601 SdHoareTripleChecker+Invalid, 2610 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 1 IncrementalHoareTripleChecker+Valid, 2609 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 1.0s IncrementalHoareTripleChecker+Time [2025-02-07 22:46:43,600 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [1343 Valid, 5601 Invalid, 2610 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [1 Valid, 2609 Invalid, 0 Unknown, 0 Unchecked, 1.0s Time] [2025-02-07 22:46:43,601 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1162 states. [2025-02-07 22:46:43,609 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1162 to 1128. [2025-02-07 22:46:43,610 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 1128 states, 1127 states have (on average 1.489795918367347) internal successors, (1679), 1127 states have internal predecessors, (1679), 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-07 22:46:43,612 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1128 states to 1128 states and 1679 transitions. [2025-02-07 22:46:43,612 INFO L78 Accepts]: Start accepts. Automaton has 1128 states and 1679 transitions. Word has length 370 [2025-02-07 22:46:43,612 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-02-07 22:46:43,612 INFO L471 AbstractCegarLoop]: Abstraction has 1128 states and 1679 transitions. [2025-02-07 22:46:43,612 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 7 states, 7 states have (on average 52.857142857142854) internal successors, (370), 6 states have internal predecessors, (370), 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-07 22:46:43,612 INFO L276 IsEmpty]: Start isEmpty. Operand 1128 states and 1679 transitions. [2025-02-07 22:46:43,614 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 372 [2025-02-07 22:46:43,614 INFO L210 NwaCegarLoop]: Found error trace [2025-02-07 22:46:43,614 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, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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-07 22:46:43,614 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable9 [2025-02-07 22:46:43,614 INFO L396 AbstractCegarLoop]: === Iteration 11 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-02-07 22:46:43,615 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-02-07 22:46:43,615 INFO L85 PathProgramCache]: Analyzing trace with hash 2035193157, now seen corresponding path program 1 times [2025-02-07 22:46:43,615 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-02-07 22:46:43,615 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [600932384] [2025-02-07 22:46:43,615 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-02-07 22:46:43,615 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-02-07 22:46:43,684 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 371 statements into 1 equivalence classes. [2025-02-07 22:46:44,828 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 371 of 371 statements. [2025-02-07 22:46:44,829 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-02-07 22:46:44,829 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-02-07 22:46:45,501 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-07 22:46:45,502 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-02-07 22:46:45,502 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [600932384] [2025-02-07 22:46:45,502 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [600932384] provided 1 perfect and 0 imperfect interpolant sequences [2025-02-07 22:46:45,502 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-02-07 22:46:45,502 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2025-02-07 22:46:45,502 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [437321102] [2025-02-07 22:46:45,502 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-02-07 22:46:45,502 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 7 states [2025-02-07 22:46:45,503 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-02-07 22:46:45,503 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2025-02-07 22:46:45,503 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=15, Invalid=27, Unknown=0, NotChecked=0, Total=42 [2025-02-07 22:46:45,503 INFO L87 Difference]: Start difference. First operand 1128 states and 1679 transitions. Second operand has 7 states, 7 states have (on average 53.0) internal successors, (371), 6 states have internal predecessors, (371), 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-07 22:46:46,426 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-02-07 22:46:46,426 INFO L93 Difference]: Finished difference Result 2235 states and 3327 transitions. [2025-02-07 22:46:46,426 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2025-02-07 22:46:46,426 INFO L78 Accepts]: Start accepts. Automaton has has 7 states, 7 states have (on average 53.0) internal successors, (371), 6 states have internal predecessors, (371), 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 371 [2025-02-07 22:46:46,427 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-02-07 22:46:46,429 INFO L225 Difference]: With dead ends: 2235 [2025-02-07 22:46:46,429 INFO L226 Difference]: Without dead ends: 1136 [2025-02-07 22:46:46,430 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 11 GetRequests, 3 SyntacticMatches, 0 SemanticMatches, 8 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 3 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=30, Invalid=60, Unknown=0, NotChecked=0, Total=90 [2025-02-07 22:46:46,430 INFO L435 NwaCegarLoop]: 1238 mSDtfsCounter, 1316 mSDsluCounter, 4892 mSDsCounter, 0 mSdLazyCounter, 2041 mSolverCounterSat, 1 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.7s Time, 0 mProtectedPredicate, 0 mProtectedAction, 1316 SdHoareTripleChecker+Valid, 6130 SdHoareTripleChecker+Invalid, 2042 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 1 IncrementalHoareTripleChecker+Valid, 2041 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.9s IncrementalHoareTripleChecker+Time [2025-02-07 22:46:46,430 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [1316 Valid, 6130 Invalid, 2042 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [1 Valid, 2041 Invalid, 0 Unknown, 0 Unchecked, 0.9s Time] [2025-02-07 22:46:46,432 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1136 states. [2025-02-07 22:46:46,438 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1136 to 1134. [2025-02-07 22:46:46,440 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 1134 states, 1133 states have (on average 1.4872021182700794) internal successors, (1685), 1133 states have internal predecessors, (1685), 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-07 22:46:46,441 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1134 states to 1134 states and 1685 transitions. [2025-02-07 22:46:46,441 INFO L78 Accepts]: Start accepts. Automaton has 1134 states and 1685 transitions. Word has length 371 [2025-02-07 22:46:46,441 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-02-07 22:46:46,441 INFO L471 AbstractCegarLoop]: Abstraction has 1134 states and 1685 transitions. [2025-02-07 22:46:46,441 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 7 states, 7 states have (on average 53.0) internal successors, (371), 6 states have internal predecessors, (371), 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-07 22:46:46,441 INFO L276 IsEmpty]: Start isEmpty. Operand 1134 states and 1685 transitions. [2025-02-07 22:46:46,443 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 373 [2025-02-07 22:46:46,443 INFO L210 NwaCegarLoop]: Found error trace [2025-02-07 22:46:46,443 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, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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-07 22:46:46,443 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable10 [2025-02-07 22:46:46,443 INFO L396 AbstractCegarLoop]: === Iteration 12 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-02-07 22:46:46,443 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-02-07 22:46:46,443 INFO L85 PathProgramCache]: Analyzing trace with hash 1370723447, now seen corresponding path program 1 times [2025-02-07 22:46:46,443 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-02-07 22:46:46,443 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1078719624] [2025-02-07 22:46:46,443 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-02-07 22:46:46,443 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-02-07 22:46:46,502 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 372 statements into 1 equivalence classes. [2025-02-07 22:46:47,372 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 372 of 372 statements. [2025-02-07 22:46:47,373 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-02-07 22:46:47,373 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-02-07 22:46:48,213 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-07 22:46:48,213 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-02-07 22:46:48,213 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1078719624] [2025-02-07 22:46:48,213 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1078719624] provided 1 perfect and 0 imperfect interpolant sequences [2025-02-07 22:46:48,213 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-02-07 22:46:48,213 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2025-02-07 22:46:48,213 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1219373040] [2025-02-07 22:46:48,213 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-02-07 22:46:48,213 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2025-02-07 22:46:48,214 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-02-07 22:46:48,214 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2025-02-07 22:46:48,214 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=12, Invalid=18, Unknown=0, NotChecked=0, Total=30 [2025-02-07 22:46:48,214 INFO L87 Difference]: Start difference. First operand 1134 states and 1685 transitions. Second operand has 6 states, 6 states have (on average 62.0) internal successors, (372), 5 states have internal predecessors, (372), 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-07 22:46:48,921 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-02-07 22:46:48,921 INFO L93 Difference]: Finished difference Result 2287 states and 3389 transitions. [2025-02-07 22:46:48,922 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2025-02-07 22:46:48,922 INFO L78 Accepts]: Start accepts. Automaton has has 6 states, 6 states have (on average 62.0) internal successors, (372), 5 states have internal predecessors, (372), 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 372 [2025-02-07 22:46:48,923 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-02-07 22:46:48,926 INFO L225 Difference]: With dead ends: 2287 [2025-02-07 22:46:48,926 INFO L226 Difference]: Without dead ends: 1159 [2025-02-07 22:46:48,930 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 8 GetRequests, 4 SyntacticMatches, 0 SemanticMatches, 4 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=12, Invalid=18, Unknown=0, NotChecked=0, Total=30 [2025-02-07 22:46:48,930 INFO L435 NwaCegarLoop]: 1240 mSDtfsCounter, 1344 mSDsluCounter, 3714 mSDsCounter, 0 mSdLazyCounter, 1649 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.6s Time, 0 mProtectedPredicate, 0 mProtectedAction, 1344 SdHoareTripleChecker+Valid, 4954 SdHoareTripleChecker+Invalid, 1649 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 1649 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.7s IncrementalHoareTripleChecker+Time [2025-02-07 22:46:48,930 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [1344 Valid, 4954 Invalid, 1649 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 1649 Invalid, 0 Unknown, 0 Unchecked, 0.7s Time] [2025-02-07 22:46:48,932 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1159 states. [2025-02-07 22:46:48,948 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1159 to 1159. [2025-02-07 22:46:48,953 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 1159 states, 1158 states have (on average 1.4810017271157168) internal successors, (1715), 1158 states have internal predecessors, (1715), 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-07 22:46:48,955 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1159 states to 1159 states and 1715 transitions. [2025-02-07 22:46:48,955 INFO L78 Accepts]: Start accepts. Automaton has 1159 states and 1715 transitions. Word has length 372 [2025-02-07 22:46:48,955 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-02-07 22:46:48,955 INFO L471 AbstractCegarLoop]: Abstraction has 1159 states and 1715 transitions. [2025-02-07 22:46:48,958 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 6 states have (on average 62.0) internal successors, (372), 5 states have internal predecessors, (372), 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-07 22:46:48,959 INFO L276 IsEmpty]: Start isEmpty. Operand 1159 states and 1715 transitions. [2025-02-07 22:46:48,960 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 373 [2025-02-07 22:46:48,960 INFO L210 NwaCegarLoop]: Found error trace [2025-02-07 22:46:48,960 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, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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-07 22:46:48,960 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable11 [2025-02-07 22:46:48,964 INFO L396 AbstractCegarLoop]: === Iteration 13 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-02-07 22:46:48,965 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-02-07 22:46:48,965 INFO L85 PathProgramCache]: Analyzing trace with hash -765027276, now seen corresponding path program 1 times [2025-02-07 22:46:48,965 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-02-07 22:46:48,965 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1689377694] [2025-02-07 22:46:48,965 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-02-07 22:46:48,965 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-02-07 22:46:49,075 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 372 statements into 1 equivalence classes. [2025-02-07 22:46:50,291 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 372 of 372 statements. [2025-02-07 22:46:50,292 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-02-07 22:46:50,292 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-02-07 22:46:50,855 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-07 22:46:50,855 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-02-07 22:46:50,855 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1689377694] [2025-02-07 22:46:50,855 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1689377694] provided 1 perfect and 0 imperfect interpolant sequences [2025-02-07 22:46:50,855 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-02-07 22:46:50,856 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2025-02-07 22:46:50,856 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1167252953] [2025-02-07 22:46:50,856 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-02-07 22:46:50,856 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 7 states [2025-02-07 22:46:50,856 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-02-07 22:46:50,857 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2025-02-07 22:46:50,857 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=11, Invalid=31, Unknown=0, NotChecked=0, Total=42 [2025-02-07 22:46:50,857 INFO L87 Difference]: Start difference. First operand 1159 states and 1715 transitions. Second operand has 7 states, 7 states have (on average 53.142857142857146) internal successors, (372), 7 states have internal predecessors, (372), 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-07 22:46:52,241 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-02-07 22:46:52,242 INFO L93 Difference]: Finished difference Result 3273 states and 4849 transitions. [2025-02-07 22:46:52,242 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 11 states. [2025-02-07 22:46:52,242 INFO L78 Accepts]: Start accepts. Automaton has has 7 states, 7 states have (on average 53.142857142857146) internal successors, (372), 7 states have internal predecessors, (372), 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 372 [2025-02-07 22:46:52,242 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-02-07 22:46:52,247 INFO L225 Difference]: With dead ends: 3273 [2025-02-07 22:46:52,247 INFO L226 Difference]: Without dead ends: 2136 [2025-02-07 22:46:52,248 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 11 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 9 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 6 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=27, Invalid=83, Unknown=0, NotChecked=0, Total=110 [2025-02-07 22:46:52,248 INFO L435 NwaCegarLoop]: 2000 mSDtfsCounter, 1391 mSDsluCounter, 9091 mSDsCounter, 0 mSdLazyCounter, 2940 mSolverCounterSat, 56 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 1.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 1391 SdHoareTripleChecker+Valid, 11091 SdHoareTripleChecker+Invalid, 2996 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 56 IncrementalHoareTripleChecker+Valid, 2940 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 1.3s IncrementalHoareTripleChecker+Time [2025-02-07 22:46:52,249 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [1391 Valid, 11091 Invalid, 2996 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [56 Valid, 2940 Invalid, 0 Unknown, 0 Unchecked, 1.3s Time] [2025-02-07 22:46:52,250 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 2136 states. [2025-02-07 22:46:52,265 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 2136 to 2130. [2025-02-07 22:46:52,267 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 2130 states, 2129 states have (on average 1.4584311883513386) internal successors, (3105), 2129 states have internal predecessors, (3105), 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-07 22:46:52,269 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 2130 states to 2130 states and 3105 transitions. [2025-02-07 22:46:52,269 INFO L78 Accepts]: Start accepts. Automaton has 2130 states and 3105 transitions. Word has length 372 [2025-02-07 22:46:52,269 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-02-07 22:46:52,269 INFO L471 AbstractCegarLoop]: Abstraction has 2130 states and 3105 transitions. [2025-02-07 22:46:52,270 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 7 states, 7 states have (on average 53.142857142857146) internal successors, (372), 7 states have internal predecessors, (372), 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-07 22:46:52,270 INFO L276 IsEmpty]: Start isEmpty. Operand 2130 states and 3105 transitions. [2025-02-07 22:46:52,271 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 374 [2025-02-07 22:46:52,271 INFO L210 NwaCegarLoop]: Found error trace [2025-02-07 22:46:52,272 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, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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-07 22:46:52,272 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable12 [2025-02-07 22:46:52,272 INFO L396 AbstractCegarLoop]: === Iteration 14 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-02-07 22:46:52,272 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-02-07 22:46:52,272 INFO L85 PathProgramCache]: Analyzing trace with hash 255007487, now seen corresponding path program 1 times [2025-02-07 22:46:52,272 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-02-07 22:46:52,272 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1525785370] [2025-02-07 22:46:52,273 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-02-07 22:46:52,273 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-02-07 22:46:52,334 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 373 statements into 1 equivalence classes. [2025-02-07 22:46:52,936 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 373 of 373 statements. [2025-02-07 22:46:52,936 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-02-07 22:46:52,936 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-02-07 22:46:53,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-07 22:46:53,333 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-02-07 22:46:53,333 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1525785370] [2025-02-07 22:46:53,333 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1525785370] provided 1 perfect and 0 imperfect interpolant sequences [2025-02-07 22:46:53,333 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-02-07 22:46:53,334 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2025-02-07 22:46:53,334 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1750034065] [2025-02-07 22:46:53,334 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-02-07 22:46:53,334 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2025-02-07 22:46:53,334 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-02-07 22:46:53,334 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2025-02-07 22:46:53,335 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2025-02-07 22:46:53,335 INFO L87 Difference]: Start difference. First operand 2130 states and 3105 transitions. Second operand has 4 states, 4 states have (on average 93.25) internal successors, (373), 4 states have internal predecessors, (373), 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-07 22:46:53,699 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-02-07 22:46:53,700 INFO L93 Difference]: Finished difference Result 4230 states and 6165 transitions. [2025-02-07 22:46:53,700 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2025-02-07 22:46:53,700 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 4 states have (on average 93.25) internal successors, (373), 4 states have internal predecessors, (373), 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 373 [2025-02-07 22:46:53,700 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-02-07 22:46:53,704 INFO L225 Difference]: With dead ends: 4230 [2025-02-07 22:46:53,705 INFO L226 Difference]: Without dead ends: 2129 [2025-02-07 22:46:53,706 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 6 GetRequests, 4 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-07 22:46:53,707 INFO L435 NwaCegarLoop]: 1374 mSDtfsCounter, 0 mSDsluCounter, 2742 mSDsCounter, 0 mSdLazyCounter, 836 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.3s Time, 0 mProtectedPredicate, 0 mProtectedAction, 0 SdHoareTripleChecker+Valid, 4116 SdHoareTripleChecker+Invalid, 836 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 836 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.3s IncrementalHoareTripleChecker+Time [2025-02-07 22:46:53,707 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [0 Valid, 4116 Invalid, 836 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 836 Invalid, 0 Unknown, 0 Unchecked, 0.3s Time] [2025-02-07 22:46:53,708 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 2129 states. [2025-02-07 22:46:53,724 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 2129 to 2129. [2025-02-07 22:46:53,726 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 2129 states, 2128 states have (on average 1.457236842105263) internal successors, (3101), 2128 states have internal predecessors, (3101), 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-07 22:46:53,728 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 2129 states to 2129 states and 3101 transitions. [2025-02-07 22:46:53,728 INFO L78 Accepts]: Start accepts. Automaton has 2129 states and 3101 transitions. Word has length 373 [2025-02-07 22:46:53,728 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-02-07 22:46:53,728 INFO L471 AbstractCegarLoop]: Abstraction has 2129 states and 3101 transitions. [2025-02-07 22:46:53,729 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 93.25) internal successors, (373), 4 states have internal predecessors, (373), 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-07 22:46:53,729 INFO L276 IsEmpty]: Start isEmpty. Operand 2129 states and 3101 transitions. [2025-02-07 22:46:53,730 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 374 [2025-02-07 22:46:53,730 INFO L210 NwaCegarLoop]: Found error trace [2025-02-07 22:46:53,731 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, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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-07 22:46:53,731 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable13 [2025-02-07 22:46:53,731 INFO L396 AbstractCegarLoop]: === Iteration 15 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-02-07 22:46:53,731 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-02-07 22:46:53,731 INFO L85 PathProgramCache]: Analyzing trace with hash -276830222, now seen corresponding path program 1 times [2025-02-07 22:46:53,731 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-02-07 22:46:53,731 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1180349377] [2025-02-07 22:46:53,732 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-02-07 22:46:53,732 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-02-07 22:46:53,793 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 373 statements into 1 equivalence classes. [2025-02-07 22:46:54,857 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 373 of 373 statements. [2025-02-07 22:46:54,857 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-02-07 22:46:54,857 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-02-07 22:46:55,405 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-07 22:46:55,405 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-02-07 22:46:55,405 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1180349377] [2025-02-07 22:46:55,405 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1180349377] provided 1 perfect and 0 imperfect interpolant sequences [2025-02-07 22:46:55,405 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-02-07 22:46:55,405 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2025-02-07 22:46:55,405 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [629299997] [2025-02-07 22:46:55,405 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-02-07 22:46:55,406 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2025-02-07 22:46:55,406 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-02-07 22:46:55,406 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2025-02-07 22:46:55,406 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=12, Invalid=18, Unknown=0, NotChecked=0, Total=30 [2025-02-07 22:46:55,406 INFO L87 Difference]: Start difference. First operand 2129 states and 3101 transitions. Second operand has 6 states, 6 states have (on average 62.166666666666664) internal successors, (373), 6 states have internal predecessors, (373), 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-07 22:46:56,367 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-02-07 22:46:56,367 INFO L93 Difference]: Finished difference Result 4233 states and 6165 transitions. [2025-02-07 22:46:56,368 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2025-02-07 22:46:56,368 INFO L78 Accepts]: Start accepts. Automaton has has 6 states, 6 states have (on average 62.166666666666664) internal successors, (373), 6 states have internal predecessors, (373), 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 373 [2025-02-07 22:46:56,369 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-02-07 22:46:56,373 INFO L225 Difference]: With dead ends: 4233 [2025-02-07 22:46:56,373 INFO L226 Difference]: Without dead ends: 2133 [2025-02-07 22:46:56,374 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 6 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 4 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=12, Invalid=18, Unknown=0, NotChecked=0, Total=30 [2025-02-07 22:46:56,375 INFO L435 NwaCegarLoop]: 1128 mSDtfsCounter, 1632 mSDsluCounter, 3377 mSDsCounter, 0 mSdLazyCounter, 2095 mSolverCounterSat, 1 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.8s Time, 0 mProtectedPredicate, 0 mProtectedAction, 1632 SdHoareTripleChecker+Valid, 4505 SdHoareTripleChecker+Invalid, 2096 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 1 IncrementalHoareTripleChecker+Valid, 2095 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.9s IncrementalHoareTripleChecker+Time [2025-02-07 22:46:56,375 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [1632 Valid, 4505 Invalid, 2096 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [1 Valid, 2095 Invalid, 0 Unknown, 0 Unchecked, 0.9s Time] [2025-02-07 22:46:56,377 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 2133 states. [2025-02-07 22:46:56,390 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 2133 to 2131. [2025-02-07 22:46:56,392 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 2131 states, 2130 states have (on average 1.4568075117370891) internal successors, (3103), 2130 states have internal predecessors, (3103), 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-07 22:46:56,394 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 2131 states to 2131 states and 3103 transitions. [2025-02-07 22:46:56,394 INFO L78 Accepts]: Start accepts. Automaton has 2131 states and 3103 transitions. Word has length 373 [2025-02-07 22:46:56,394 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-02-07 22:46:56,394 INFO L471 AbstractCegarLoop]: Abstraction has 2131 states and 3103 transitions. [2025-02-07 22:46:56,395 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 6 states have (on average 62.166666666666664) internal successors, (373), 6 states have internal predecessors, (373), 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-07 22:46:56,395 INFO L276 IsEmpty]: Start isEmpty. Operand 2131 states and 3103 transitions. [2025-02-07 22:46:56,396 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 375 [2025-02-07 22:46:56,396 INFO L210 NwaCegarLoop]: Found error trace [2025-02-07 22:46:56,396 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, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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-07 22:46:56,396 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable14 [2025-02-07 22:46:56,397 INFO L396 AbstractCegarLoop]: === Iteration 16 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-02-07 22:46:56,397 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-02-07 22:46:56,397 INFO L85 PathProgramCache]: Analyzing trace with hash -722781872, now seen corresponding path program 1 times [2025-02-07 22:46:56,397 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-02-07 22:46:56,397 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1350957460] [2025-02-07 22:46:56,397 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-02-07 22:46:56,397 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-02-07 22:46:56,460 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 374 statements into 1 equivalence classes. [2025-02-07 22:46:57,556 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 374 of 374 statements. [2025-02-07 22:46:57,557 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-02-07 22:46:57,557 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-02-07 22:46:58,280 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-07 22:46:58,280 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-02-07 22:46:58,280 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1350957460] [2025-02-07 22:46:58,280 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1350957460] provided 1 perfect and 0 imperfect interpolant sequences [2025-02-07 22:46:58,280 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-02-07 22:46:58,280 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2025-02-07 22:46:58,280 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1907423633] [2025-02-07 22:46:58,280 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-02-07 22:46:58,280 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 7 states [2025-02-07 22:46:58,280 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-02-07 22:46:58,281 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2025-02-07 22:46:58,281 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=15, Invalid=27, Unknown=0, NotChecked=0, Total=42 [2025-02-07 22:46:58,281 INFO L87 Difference]: Start difference. First operand 2131 states and 3103 transitions. Second operand has 7 states, 7 states have (on average 53.42857142857143) internal successors, (374), 6 states have internal predecessors, (374), 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-07 22:46:59,406 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-02-07 22:46:59,406 INFO L93 Difference]: Finished difference Result 3270 states and 4786 transitions. [2025-02-07 22:46:59,406 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2025-02-07 22:46:59,407 INFO L78 Accepts]: Start accepts. Automaton has has 7 states, 7 states have (on average 53.42857142857143) internal successors, (374), 6 states have internal predecessors, (374), 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 374 [2025-02-07 22:46:59,407 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-02-07 22:46:59,409 INFO L225 Difference]: With dead ends: 3270 [2025-02-07 22:46:59,409 INFO L226 Difference]: Without dead ends: 1168 [2025-02-07 22:46:59,410 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 8 GetRequests, 3 SyntacticMatches, 0 SemanticMatches, 5 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=15, Invalid=27, Unknown=0, NotChecked=0, Total=42 [2025-02-07 22:46:59,411 INFO L435 NwaCegarLoop]: 1127 mSDtfsCounter, 1337 mSDsluCounter, 4489 mSDsCounter, 0 mSdLazyCounter, 2617 mSolverCounterSat, 1 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.9s Time, 0 mProtectedPredicate, 0 mProtectedAction, 1337 SdHoareTripleChecker+Valid, 5616 SdHoareTripleChecker+Invalid, 2618 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 1 IncrementalHoareTripleChecker+Valid, 2617 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 1.1s IncrementalHoareTripleChecker+Time [2025-02-07 22:46:59,411 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [1337 Valid, 5616 Invalid, 2618 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [1 Valid, 2617 Invalid, 0 Unknown, 0 Unchecked, 1.1s Time] [2025-02-07 22:46:59,412 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1168 states. [2025-02-07 22:46:59,418 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1168 to 1167. [2025-02-07 22:46:59,418 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 1167 states, 1166 states have (on average 1.4777015437392795) internal successors, (1723), 1166 states have internal predecessors, (1723), 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-07 22:46:59,419 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1167 states to 1167 states and 1723 transitions. [2025-02-07 22:46:59,419 INFO L78 Accepts]: Start accepts. Automaton has 1167 states and 1723 transitions. Word has length 374 [2025-02-07 22:46:59,420 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-02-07 22:46:59,420 INFO L471 AbstractCegarLoop]: Abstraction has 1167 states and 1723 transitions. [2025-02-07 22:46:59,420 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 7 states, 7 states have (on average 53.42857142857143) internal successors, (374), 6 states have internal predecessors, (374), 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-07 22:46:59,420 INFO L276 IsEmpty]: Start isEmpty. Operand 1167 states and 1723 transitions. [2025-02-07 22:46:59,421 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 375 [2025-02-07 22:46:59,421 INFO L210 NwaCegarLoop]: Found error trace [2025-02-07 22:46:59,421 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, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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-07 22:46:59,422 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable15 [2025-02-07 22:46:59,422 INFO L396 AbstractCegarLoop]: === Iteration 17 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-02-07 22:46:59,422 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-02-07 22:46:59,422 INFO L85 PathProgramCache]: Analyzing trace with hash 2143863115, now seen corresponding path program 1 times [2025-02-07 22:46:59,422 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-02-07 22:46:59,422 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1687250805] [2025-02-07 22:46:59,422 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-02-07 22:46:59,423 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-02-07 22:46:59,496 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 374 statements into 1 equivalence classes. [2025-02-07 22:46:59,552 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 374 of 374 statements. [2025-02-07 22:46:59,552 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-02-07 22:46:59,552 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-02-07 22:46:59,994 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-07 22:46:59,995 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-02-07 22:46:59,995 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1687250805] [2025-02-07 22:46:59,995 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1687250805] provided 1 perfect and 0 imperfect interpolant sequences [2025-02-07 22:46:59,995 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-02-07 22:46:59,995 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2025-02-07 22:46:59,995 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [942866042] [2025-02-07 22:46:59,995 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-02-07 22:46:59,996 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2025-02-07 22:46:59,996 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-02-07 22:46:59,996 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2025-02-07 22:46:59,996 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2025-02-07 22:46:59,996 INFO L87 Difference]: Start difference. First operand 1167 states and 1723 transitions. Second operand has 5 states, 5 states have (on average 74.8) internal successors, (374), 5 states have internal predecessors, (374), 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-07 22:47:00,466 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-02-07 22:47:00,466 INFO L93 Difference]: Finished difference Result 2309 states and 3408 transitions. [2025-02-07 22:47:00,466 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2025-02-07 22:47:00,467 INFO L78 Accepts]: Start accepts. Automaton has has 5 states, 5 states have (on average 74.8) internal successors, (374), 5 states have internal predecessors, (374), 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 374 [2025-02-07 22:47:00,467 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-02-07 22:47:00,469 INFO L225 Difference]: With dead ends: 2309 [2025-02-07 22:47:00,469 INFO L226 Difference]: Without dead ends: 1171 [2025-02-07 22:47:00,470 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 6 GetRequests, 2 SyntacticMatches, 1 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2025-02-07 22:47:00,470 INFO L435 NwaCegarLoop]: 1372 mSDtfsCounter, 2 mSDsluCounter, 4106 mSDsCounter, 0 mSdLazyCounter, 1123 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.4s Time, 0 mProtectedPredicate, 0 mProtectedAction, 2 SdHoareTripleChecker+Valid, 5478 SdHoareTripleChecker+Invalid, 1123 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 1123 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.5s IncrementalHoareTripleChecker+Time [2025-02-07 22:47:00,471 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [2 Valid, 5478 Invalid, 1123 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 1123 Invalid, 0 Unknown, 0 Unchecked, 0.5s Time] [2025-02-07 22:47:00,471 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1171 states. [2025-02-07 22:47:00,477 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1171 to 1170. [2025-02-07 22:47:00,478 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 1170 states, 1169 states have (on average 1.476475620188195) internal successors, (1726), 1169 states have internal predecessors, (1726), 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-07 22:47:00,478 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1170 states to 1170 states and 1726 transitions. [2025-02-07 22:47:00,478 INFO L78 Accepts]: Start accepts. Automaton has 1170 states and 1726 transitions. Word has length 374 [2025-02-07 22:47:00,479 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-02-07 22:47:00,479 INFO L471 AbstractCegarLoop]: Abstraction has 1170 states and 1726 transitions. [2025-02-07 22:47:00,479 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 74.8) internal successors, (374), 5 states have internal predecessors, (374), 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-07 22:47:00,479 INFO L276 IsEmpty]: Start isEmpty. Operand 1170 states and 1726 transitions. [2025-02-07 22:47:00,480 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 376 [2025-02-07 22:47:00,480 INFO L210 NwaCegarLoop]: Found error trace [2025-02-07 22:47:00,481 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, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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-07 22:47:00,481 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable16 [2025-02-07 22:47:00,481 INFO L396 AbstractCegarLoop]: === Iteration 18 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-02-07 22:47:00,481 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-02-07 22:47:00,481 INFO L85 PathProgramCache]: Analyzing trace with hash -966675301, now seen corresponding path program 1 times [2025-02-07 22:47:00,481 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-02-07 22:47:00,481 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2054912495] [2025-02-07 22:47:00,482 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-02-07 22:47:00,482 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-02-07 22:47:00,549 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 375 statements into 1 equivalence classes. [2025-02-07 22:47:01,389 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 375 of 375 statements. [2025-02-07 22:47:01,389 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-02-07 22:47:01,389 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-02-07 22:47:01,703 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-07 22:47:01,703 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-02-07 22:47:01,704 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2054912495] [2025-02-07 22:47:01,704 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [2054912495] provided 1 perfect and 0 imperfect interpolant sequences [2025-02-07 22:47:01,704 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-02-07 22:47:01,704 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2025-02-07 22:47:01,704 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [102488562] [2025-02-07 22:47:01,704 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-02-07 22:47:01,704 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2025-02-07 22:47:01,704 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-02-07 22:47:01,705 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2025-02-07 22:47:01,705 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=9, Invalid=11, Unknown=0, NotChecked=0, Total=20 [2025-02-07 22:47:01,705 INFO L87 Difference]: Start difference. First operand 1170 states and 1726 transitions. Second operand has 5 states, 5 states have (on average 75.0) internal successors, (375), 4 states have internal predecessors, (375), 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-07 22:47:02,461 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-02-07 22:47:02,461 INFO L93 Difference]: Finished difference Result 2312 states and 3411 transitions. [2025-02-07 22:47:02,462 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2025-02-07 22:47:02,462 INFO L78 Accepts]: Start accepts. Automaton has has 5 states, 5 states have (on average 75.0) internal successors, (375), 4 states have internal predecessors, (375), 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 375 [2025-02-07 22:47:02,462 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-02-07 22:47:02,464 INFO L225 Difference]: With dead ends: 2312 [2025-02-07 22:47:02,464 INFO L226 Difference]: Without dead ends: 1171 [2025-02-07 22:47:02,465 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 4 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=9, Invalid=11, Unknown=0, NotChecked=0, Total=20 [2025-02-07 22:47:02,466 INFO L435 NwaCegarLoop]: 1130 mSDtfsCounter, 1298 mSDsluCounter, 2256 mSDsCounter, 0 mSdLazyCounter, 1565 mSolverCounterSat, 1 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.6s Time, 0 mProtectedPredicate, 0 mProtectedAction, 1298 SdHoareTripleChecker+Valid, 3386 SdHoareTripleChecker+Invalid, 1566 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 1 IncrementalHoareTripleChecker+Valid, 1565 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.7s IncrementalHoareTripleChecker+Time [2025-02-07 22:47:02,466 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [1298 Valid, 3386 Invalid, 1566 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [1 Valid, 1565 Invalid, 0 Unknown, 0 Unchecked, 0.7s Time] [2025-02-07 22:47:02,467 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1171 states. [2025-02-07 22:47:02,472 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1171 to 1171. [2025-02-07 22:47:02,473 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 1171 states, 1170 states have (on average 1.4760683760683762) internal successors, (1727), 1170 states have internal predecessors, (1727), 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-07 22:47:02,474 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1171 states to 1171 states and 1727 transitions. [2025-02-07 22:47:02,474 INFO L78 Accepts]: Start accepts. Automaton has 1171 states and 1727 transitions. Word has length 375 [2025-02-07 22:47:02,474 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-02-07 22:47:02,474 INFO L471 AbstractCegarLoop]: Abstraction has 1171 states and 1727 transitions. [2025-02-07 22:47:02,474 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 75.0) internal successors, (375), 4 states have internal predecessors, (375), 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-07 22:47:02,474 INFO L276 IsEmpty]: Start isEmpty. Operand 1171 states and 1727 transitions. [2025-02-07 22:47:02,476 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 376 [2025-02-07 22:47:02,476 INFO L210 NwaCegarLoop]: Found error trace [2025-02-07 22:47:02,476 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, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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-07 22:47:02,476 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable17 [2025-02-07 22:47:02,476 INFO L396 AbstractCegarLoop]: === Iteration 19 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-02-07 22:47:02,477 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-02-07 22:47:02,477 INFO L85 PathProgramCache]: Analyzing trace with hash 1757741704, now seen corresponding path program 1 times [2025-02-07 22:47:02,477 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-02-07 22:47:02,477 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2016462687] [2025-02-07 22:47:02,477 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-02-07 22:47:02,477 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-02-07 22:47:02,543 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 375 statements into 1 equivalence classes. [2025-02-07 22:47:02,861 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 375 of 375 statements. [2025-02-07 22:47:02,861 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-02-07 22:47:02,861 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-02-07 22:47:03,743 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-07 22:47:03,746 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-02-07 22:47:03,746 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2016462687] [2025-02-07 22:47:03,746 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [2016462687] provided 1 perfect and 0 imperfect interpolant sequences [2025-02-07 22:47:03,747 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-02-07 22:47:03,747 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2025-02-07 22:47:03,747 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1498654063] [2025-02-07 22:47:03,747 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-02-07 22:47:03,747 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2025-02-07 22:47:03,747 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-02-07 22:47:03,747 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2025-02-07 22:47:03,747 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2025-02-07 22:47:03,747 INFO L87 Difference]: Start difference. First operand 1171 states and 1727 transitions. Second operand has 4 states, 4 states have (on average 93.75) internal successors, (375), 4 states have internal predecessors, (375), 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-07 22:47:04,087 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-02-07 22:47:04,087 INFO L93 Difference]: Finished difference Result 2316 states and 3415 transitions. [2025-02-07 22:47:04,087 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2025-02-07 22:47:04,087 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 4 states have (on average 93.75) internal successors, (375), 4 states have internal predecessors, (375), 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 375 [2025-02-07 22:47:04,088 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-02-07 22:47:04,090 INFO L225 Difference]: With dead ends: 2316 [2025-02-07 22:47:04,090 INFO L226 Difference]: Without dead ends: 1174 [2025-02-07 22:47:04,091 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 6 GetRequests, 3 SyntacticMatches, 1 SemanticMatches, 2 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2025-02-07 22:47:04,091 INFO L435 NwaCegarLoop]: 1374 mSDtfsCounter, 0 mSDsluCounter, 2742 mSDsCounter, 0 mSdLazyCounter, 836 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.3s Time, 0 mProtectedPredicate, 0 mProtectedAction, 0 SdHoareTripleChecker+Valid, 4116 SdHoareTripleChecker+Invalid, 836 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 836 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.3s IncrementalHoareTripleChecker+Time [2025-02-07 22:47:04,091 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [0 Valid, 4116 Invalid, 836 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 836 Invalid, 0 Unknown, 0 Unchecked, 0.3s Time] [2025-02-07 22:47:04,095 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1174 states. [2025-02-07 22:47:04,100 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1174 to 1174. [2025-02-07 22:47:04,101 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 1174 states, 1173 states have (on average 1.474850809889173) internal successors, (1730), 1173 states have internal predecessors, (1730), 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-07 22:47:04,101 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1174 states to 1174 states and 1730 transitions. [2025-02-07 22:47:04,102 INFO L78 Accepts]: Start accepts. Automaton has 1174 states and 1730 transitions. Word has length 375 [2025-02-07 22:47:04,102 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-02-07 22:47:04,102 INFO L471 AbstractCegarLoop]: Abstraction has 1174 states and 1730 transitions. [2025-02-07 22:47:04,102 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 93.75) internal successors, (375), 4 states have internal predecessors, (375), 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-07 22:47:04,102 INFO L276 IsEmpty]: Start isEmpty. Operand 1174 states and 1730 transitions. [2025-02-07 22:47:04,103 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 377 [2025-02-07 22:47:04,107 INFO L210 NwaCegarLoop]: Found error trace [2025-02-07 22:47:04,108 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, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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-07 22:47:04,108 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable18 [2025-02-07 22:47:04,108 INFO L396 AbstractCegarLoop]: === Iteration 20 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-02-07 22:47:04,108 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-02-07 22:47:04,108 INFO L85 PathProgramCache]: Analyzing trace with hash -102454629, now seen corresponding path program 1 times [2025-02-07 22:47:04,108 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-02-07 22:47:04,108 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [444147784] [2025-02-07 22:47:04,108 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-02-07 22:47:04,108 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-02-07 22:47:04,215 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 376 statements into 1 equivalence classes. [2025-02-07 22:47:06,067 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 376 of 376 statements. [2025-02-07 22:47:06,067 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-02-07 22:47:06,067 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-02-07 22:47:06,735 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-07 22:47:06,739 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-02-07 22:47:06,739 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [444147784] [2025-02-07 22:47:06,739 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [444147784] provided 1 perfect and 0 imperfect interpolant sequences [2025-02-07 22:47:06,740 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-02-07 22:47:06,740 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2025-02-07 22:47:06,740 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1390548612] [2025-02-07 22:47:06,740 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-02-07 22:47:06,740 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2025-02-07 22:47:06,740 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-02-07 22:47:06,740 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2025-02-07 22:47:06,740 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=10, Invalid=20, Unknown=0, NotChecked=0, Total=30 [2025-02-07 22:47:06,741 INFO L87 Difference]: Start difference. First operand 1174 states and 1730 transitions. Second operand has 6 states, 6 states have (on average 62.666666666666664) internal successors, (376), 6 states have internal predecessors, (376), 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-07 22:47:07,527 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-02-07 22:47:07,527 INFO L93 Difference]: Finished difference Result 3396 states and 5004 transitions. [2025-02-07 22:47:07,527 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2025-02-07 22:47:07,528 INFO L78 Accepts]: Start accepts. Automaton has has 6 states, 6 states have (on average 62.666666666666664) internal successors, (376), 6 states have internal predecessors, (376), 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 376 [2025-02-07 22:47:07,528 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-02-07 22:47:07,530 INFO L225 Difference]: With dead ends: 3396 [2025-02-07 22:47:07,530 INFO L226 Difference]: Without dead ends: 1174 [2025-02-07 22:47:07,532 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 10 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 8 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 5 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=31, Invalid=59, Unknown=0, NotChecked=0, Total=90 [2025-02-07 22:47:07,532 INFO L435 NwaCegarLoop]: 1862 mSDtfsCounter, 2195 mSDsluCounter, 4947 mSDsCounter, 0 mSdLazyCounter, 1680 mSolverCounterSat, 31 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.6s Time, 0 mProtectedPredicate, 0 mProtectedAction, 2195 SdHoareTripleChecker+Valid, 6809 SdHoareTripleChecker+Invalid, 1711 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 31 IncrementalHoareTripleChecker+Valid, 1680 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.7s IncrementalHoareTripleChecker+Time [2025-02-07 22:47:07,532 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [2195 Valid, 6809 Invalid, 1711 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [31 Valid, 1680 Invalid, 0 Unknown, 0 Unchecked, 0.7s Time] [2025-02-07 22:47:07,533 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1174 states. [2025-02-07 22:47:07,539 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1174 to 1174. [2025-02-07 22:47:07,539 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 1174 states, 1173 states have (on average 1.473998294970162) internal successors, (1729), 1173 states have internal predecessors, (1729), 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-07 22:47:07,540 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1174 states to 1174 states and 1729 transitions. [2025-02-07 22:47:07,543 INFO L78 Accepts]: Start accepts. Automaton has 1174 states and 1729 transitions. Word has length 376 [2025-02-07 22:47:07,544 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-02-07 22:47:07,544 INFO L471 AbstractCegarLoop]: Abstraction has 1174 states and 1729 transitions. [2025-02-07 22:47:07,544 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 6 states have (on average 62.666666666666664) internal successors, (376), 6 states have internal predecessors, (376), 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-07 22:47:07,544 INFO L276 IsEmpty]: Start isEmpty. Operand 1174 states and 1729 transitions. [2025-02-07 22:47:07,545 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 378 [2025-02-07 22:47:07,545 INFO L210 NwaCegarLoop]: Found error trace [2025-02-07 22:47:07,545 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, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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-07 22:47:07,545 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable19 [2025-02-07 22:47:07,549 INFO L396 AbstractCegarLoop]: === Iteration 21 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-02-07 22:47:07,549 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-02-07 22:47:07,550 INFO L85 PathProgramCache]: Analyzing trace with hash 1767944230, now seen corresponding path program 1 times [2025-02-07 22:47:07,550 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-02-07 22:47:07,550 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1429405241] [2025-02-07 22:47:07,550 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-02-07 22:47:07,550 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-02-07 22:47:07,620 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 377 statements into 1 equivalence classes. [2025-02-07 22:47:08,578 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 377 of 377 statements. [2025-02-07 22:47:08,578 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-02-07 22:47:08,578 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-02-07 22:47:10,706 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-07 22:47:10,707 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-02-07 22:47:10,707 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1429405241] [2025-02-07 22:47:10,707 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1429405241] provided 1 perfect and 0 imperfect interpolant sequences [2025-02-07 22:47:10,707 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-02-07 22:47:10,707 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [9] imperfect sequences [] total 9 [2025-02-07 22:47:10,707 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [282241268] [2025-02-07 22:47:10,707 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-02-07 22:47:10,708 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 10 states [2025-02-07 22:47:10,708 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-02-07 22:47:10,708 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 10 interpolants. [2025-02-07 22:47:10,708 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=26, Invalid=64, Unknown=0, NotChecked=0, Total=90 [2025-02-07 22:47:10,708 INFO L87 Difference]: Start difference. First operand 1174 states and 1729 transitions. Second operand has 10 states, 10 states have (on average 37.7) internal successors, (377), 9 states have internal predecessors, (377), 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-07 22:47:11,504 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-02-07 22:47:11,504 INFO L93 Difference]: Finished difference Result 2752 states and 4064 transitions. [2025-02-07 22:47:11,505 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 10 states. [2025-02-07 22:47:11,505 INFO L78 Accepts]: Start accepts. Automaton has has 10 states, 10 states have (on average 37.7) internal successors, (377), 9 states have internal predecessors, (377), 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 377 [2025-02-07 22:47:11,506 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-02-07 22:47:11,508 INFO L225 Difference]: With dead ends: 2752 [2025-02-07 22:47:11,508 INFO L226 Difference]: Without dead ends: 1277 [2025-02-07 22:47:11,509 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 11 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 10 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 17 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=34, Invalid=98, Unknown=0, NotChecked=0, Total=132 [2025-02-07 22:47:11,509 INFO L435 NwaCegarLoop]: 1348 mSDtfsCounter, 2543 mSDsluCounter, 5476 mSDsCounter, 0 mSdLazyCounter, 1709 mSolverCounterSat, 9 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.6s Time, 0 mProtectedPredicate, 0 mProtectedAction, 2543 SdHoareTripleChecker+Valid, 6824 SdHoareTripleChecker+Invalid, 1718 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 9 IncrementalHoareTripleChecker+Valid, 1709 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.7s IncrementalHoareTripleChecker+Time [2025-02-07 22:47:11,509 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [2543 Valid, 6824 Invalid, 1718 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [9 Valid, 1709 Invalid, 0 Unknown, 0 Unchecked, 0.7s Time] [2025-02-07 22:47:11,510 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1277 states. [2025-02-07 22:47:11,516 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1277 to 1263. [2025-02-07 22:47:11,517 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 1263 states, 1262 states have (on average 1.4762282091917591) internal successors, (1863), 1262 states have internal predecessors, (1863), 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-07 22:47:11,518 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1263 states to 1263 states and 1863 transitions. [2025-02-07 22:47:11,518 INFO L78 Accepts]: Start accepts. Automaton has 1263 states and 1863 transitions. Word has length 377 [2025-02-07 22:47:11,519 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-02-07 22:47:11,519 INFO L471 AbstractCegarLoop]: Abstraction has 1263 states and 1863 transitions. [2025-02-07 22:47:11,519 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 10 states, 10 states have (on average 37.7) internal successors, (377), 9 states have internal predecessors, (377), 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-07 22:47:11,519 INFO L276 IsEmpty]: Start isEmpty. Operand 1263 states and 1863 transitions. [2025-02-07 22:47:11,520 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 379 [2025-02-07 22:47:11,520 INFO L210 NwaCegarLoop]: Found error trace [2025-02-07 22:47:11,520 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, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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-07 22:47:11,521 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable20 [2025-02-07 22:47:11,521 INFO L396 AbstractCegarLoop]: === Iteration 22 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-02-07 22:47:11,521 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-02-07 22:47:11,521 INFO L85 PathProgramCache]: Analyzing trace with hash -1078115704, now seen corresponding path program 1 times [2025-02-07 22:47:11,521 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-02-07 22:47:11,521 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1411035010] [2025-02-07 22:47:11,521 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-02-07 22:47:11,522 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-02-07 22:47:11,584 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 378 statements into 1 equivalence classes. [2025-02-07 22:47:12,921 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 378 of 378 statements. [2025-02-07 22:47:12,921 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-02-07 22:47:12,921 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-02-07 22:47:13,552 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-07 22:47:13,553 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-02-07 22:47:13,553 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1411035010] [2025-02-07 22:47:13,553 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1411035010] provided 1 perfect and 0 imperfect interpolant sequences [2025-02-07 22:47:13,553 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-02-07 22:47:13,553 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2025-02-07 22:47:13,553 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [107079893] [2025-02-07 22:47:13,553 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-02-07 22:47:13,554 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2025-02-07 22:47:13,554 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-02-07 22:47:13,554 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2025-02-07 22:47:13,554 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2025-02-07 22:47:13,554 INFO L87 Difference]: Start difference. First operand 1263 states and 1863 transitions. Second operand has 4 states, 4 states have (on average 94.5) internal successors, (378), 4 states have internal predecessors, (378), 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-07 22:47:13,913 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-02-07 22:47:13,913 INFO L93 Difference]: Finished difference Result 2497 states and 3683 transitions. [2025-02-07 22:47:13,916 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2025-02-07 22:47:13,916 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 4 states have (on average 94.5) internal successors, (378), 4 states have internal predecessors, (378), 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 378 [2025-02-07 22:47:13,916 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-02-07 22:47:13,918 INFO L225 Difference]: With dead ends: 2497 [2025-02-07 22:47:13,918 INFO L226 Difference]: Without dead ends: 1263 [2025-02-07 22:47:13,918 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 5 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=9, Invalid=11, Unknown=0, NotChecked=0, Total=20 [2025-02-07 22:47:13,921 INFO L435 NwaCegarLoop]: 1366 mSDtfsCounter, 931 mSDsluCounter, 1758 mSDsCounter, 0 mSdLazyCounter, 653 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.3s Time, 0 mProtectedPredicate, 0 mProtectedAction, 931 SdHoareTripleChecker+Valid, 3124 SdHoareTripleChecker+Invalid, 653 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 653 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.3s IncrementalHoareTripleChecker+Time [2025-02-07 22:47:13,922 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [931 Valid, 3124 Invalid, 653 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 653 Invalid, 0 Unknown, 0 Unchecked, 0.3s Time] [2025-02-07 22:47:13,923 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1263 states. [2025-02-07 22:47:13,929 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1263 to 1263. [2025-02-07 22:47:13,930 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 1263 states, 1262 states have (on average 1.4754358161648178) internal successors, (1862), 1262 states have internal predecessors, (1862), 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-07 22:47:13,931 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1263 states to 1263 states and 1862 transitions. [2025-02-07 22:47:13,932 INFO L78 Accepts]: Start accepts. Automaton has 1263 states and 1862 transitions. Word has length 378 [2025-02-07 22:47:13,932 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-02-07 22:47:13,932 INFO L471 AbstractCegarLoop]: Abstraction has 1263 states and 1862 transitions. [2025-02-07 22:47:13,933 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 94.5) internal successors, (378), 4 states have internal predecessors, (378), 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-07 22:47:13,933 INFO L276 IsEmpty]: Start isEmpty. Operand 1263 states and 1862 transitions. [2025-02-07 22:47:13,934 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 380 [2025-02-07 22:47:13,934 INFO L210 NwaCegarLoop]: Found error trace [2025-02-07 22:47:13,934 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, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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-07 22:47:13,934 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable21 [2025-02-07 22:47:13,934 INFO L396 AbstractCegarLoop]: === Iteration 23 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-02-07 22:47:13,935 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-02-07 22:47:13,935 INFO L85 PathProgramCache]: Analyzing trace with hash -844207610, now seen corresponding path program 1 times [2025-02-07 22:47:13,935 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-02-07 22:47:13,935 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1707080996] [2025-02-07 22:47:13,935 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-02-07 22:47:13,935 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-02-07 22:47:13,994 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 379 statements into 1 equivalence classes. [2025-02-07 22:47:15,219 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 379 of 379 statements. [2025-02-07 22:47:15,219 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-02-07 22:47:15,219 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-02-07 22:47:15,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-07 22:47:15,848 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-02-07 22:47:15,848 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1707080996] [2025-02-07 22:47:15,848 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1707080996] provided 1 perfect and 0 imperfect interpolant sequences [2025-02-07 22:47:15,849 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-02-07 22:47:15,849 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2025-02-07 22:47:15,849 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [482422117] [2025-02-07 22:47:15,849 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-02-07 22:47:15,849 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 7 states [2025-02-07 22:47:15,849 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-02-07 22:47:15,850 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2025-02-07 22:47:15,850 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=11, Invalid=31, Unknown=0, NotChecked=0, Total=42 [2025-02-07 22:47:15,850 INFO L87 Difference]: Start difference. First operand 1263 states and 1862 transitions. Second operand has 7 states, 7 states have (on average 54.142857142857146) internal successors, (379), 7 states have internal predecessors, (379), 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-07 22:47:16,599 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-02-07 22:47:16,599 INFO L93 Difference]: Finished difference Result 2566 states and 3782 transitions. [2025-02-07 22:47:16,599 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2025-02-07 22:47:16,600 INFO L78 Accepts]: Start accepts. Automaton has has 7 states, 7 states have (on average 54.142857142857146) internal successors, (379), 7 states have internal predecessors, (379), 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 379 [2025-02-07 22:47:16,600 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-02-07 22:47:16,601 INFO L225 Difference]: With dead ends: 2566 [2025-02-07 22:47:16,602 INFO L226 Difference]: Without dead ends: 1267 [2025-02-07 22:47:16,603 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 11 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 9 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 6 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=27, Invalid=83, Unknown=0, NotChecked=0, Total=110 [2025-02-07 22:47:16,604 INFO L435 NwaCegarLoop]: 1356 mSDtfsCounter, 1080 mSDsluCounter, 5576 mSDsCounter, 0 mSdLazyCounter, 1791 mSolverCounterSat, 4 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.6s Time, 0 mProtectedPredicate, 0 mProtectedAction, 1080 SdHoareTripleChecker+Valid, 6932 SdHoareTripleChecker+Invalid, 1795 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 4 IncrementalHoareTripleChecker+Valid, 1791 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.7s IncrementalHoareTripleChecker+Time [2025-02-07 22:47:16,604 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [1080 Valid, 6932 Invalid, 1795 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [4 Valid, 1791 Invalid, 0 Unknown, 0 Unchecked, 0.7s Time] [2025-02-07 22:47:16,605 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1267 states. [2025-02-07 22:47:16,612 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1267 to 1265. [2025-02-07 22:47:16,613 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 1265 states, 1264 states have (on average 1.4746835443037976) internal successors, (1864), 1264 states have internal predecessors, (1864), 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-07 22:47:16,614 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1265 states to 1265 states and 1864 transitions. [2025-02-07 22:47:16,614 INFO L78 Accepts]: Start accepts. Automaton has 1265 states and 1864 transitions. Word has length 379 [2025-02-07 22:47:16,614 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-02-07 22:47:16,614 INFO L471 AbstractCegarLoop]: Abstraction has 1265 states and 1864 transitions. [2025-02-07 22:47:16,614 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 7 states, 7 states have (on average 54.142857142857146) internal successors, (379), 7 states have internal predecessors, (379), 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-07 22:47:16,614 INFO L276 IsEmpty]: Start isEmpty. Operand 1265 states and 1864 transitions. [2025-02-07 22:47:16,616 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 381 [2025-02-07 22:47:16,616 INFO L210 NwaCegarLoop]: Found error trace [2025-02-07 22:47:16,616 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, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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-07 22:47:16,616 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable22 [2025-02-07 22:47:16,616 INFO L396 AbstractCegarLoop]: === Iteration 24 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-02-07 22:47:16,617 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-02-07 22:47:16,617 INFO L85 PathProgramCache]: Analyzing trace with hash 2007640330, now seen corresponding path program 1 times [2025-02-07 22:47:16,617 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-02-07 22:47:16,617 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [265610994] [2025-02-07 22:47:16,617 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-02-07 22:47:16,617 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-02-07 22:47:16,701 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 380 statements into 1 equivalence classes. [2025-02-07 22:47:17,664 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 380 of 380 statements. [2025-02-07 22:47:17,665 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-02-07 22:47:17,665 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-02-07 22:47:18,478 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-07 22:47:18,479 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-02-07 22:47:18,479 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [265610994] [2025-02-07 22:47:18,479 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [265610994] provided 1 perfect and 0 imperfect interpolant sequences [2025-02-07 22:47:18,479 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-02-07 22:47:18,479 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2025-02-07 22:47:18,479 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1866375393] [2025-02-07 22:47:18,479 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-02-07 22:47:18,480 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 7 states [2025-02-07 22:47:18,480 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-02-07 22:47:18,480 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2025-02-07 22:47:18,480 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=13, Invalid=29, Unknown=0, NotChecked=0, Total=42 [2025-02-07 22:47:18,481 INFO L87 Difference]: Start difference. First operand 1265 states and 1864 transitions. Second operand has 7 states, 7 states have (on average 54.285714285714285) internal successors, (380), 6 states have internal predecessors, (380), 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-07 22:47:19,300 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-02-07 22:47:19,300 INFO L93 Difference]: Finished difference Result 3218 states and 4755 transitions. [2025-02-07 22:47:19,301 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2025-02-07 22:47:19,301 INFO L78 Accepts]: Start accepts. Automaton has has 7 states, 7 states have (on average 54.285714285714285) internal successors, (380), 6 states have internal predecessors, (380), 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 380 [2025-02-07 22:47:19,301 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-02-07 22:47:19,303 INFO L225 Difference]: With dead ends: 3218 [2025-02-07 22:47:19,303 INFO L226 Difference]: Without dead ends: 1982 [2025-02-07 22:47:19,304 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 8 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 7 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 4 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=23, Invalid=49, Unknown=0, NotChecked=0, Total=72 [2025-02-07 22:47:19,305 INFO L435 NwaCegarLoop]: 1428 mSDtfsCounter, 2949 mSDsluCounter, 5501 mSDsCounter, 0 mSdLazyCounter, 2344 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.6s Time, 0 mProtectedPredicate, 0 mProtectedAction, 2949 SdHoareTripleChecker+Valid, 6929 SdHoareTripleChecker+Invalid, 2344 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 2344 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.8s IncrementalHoareTripleChecker+Time [2025-02-07 22:47:19,305 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [2949 Valid, 6929 Invalid, 2344 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 2344 Invalid, 0 Unknown, 0 Unchecked, 0.8s Time] [2025-02-07 22:47:19,307 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1982 states. [2025-02-07 22:47:19,322 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1982 to 1800. [2025-02-07 22:47:19,323 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 1800 states, 1799 states have (on average 1.482490272373541) internal successors, (2667), 1799 states have internal predecessors, (2667), 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-07 22:47:19,324 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1800 states to 1800 states and 2667 transitions. [2025-02-07 22:47:19,325 INFO L78 Accepts]: Start accepts. Automaton has 1800 states and 2667 transitions. Word has length 380 [2025-02-07 22:47:19,325 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-02-07 22:47:19,325 INFO L471 AbstractCegarLoop]: Abstraction has 1800 states and 2667 transitions. [2025-02-07 22:47:19,325 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 7 states, 7 states have (on average 54.285714285714285) internal successors, (380), 6 states have internal predecessors, (380), 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-07 22:47:19,325 INFO L276 IsEmpty]: Start isEmpty. Operand 1800 states and 2667 transitions. [2025-02-07 22:47:19,327 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 382 [2025-02-07 22:47:19,327 INFO L210 NwaCegarLoop]: Found error trace [2025-02-07 22:47:19,327 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, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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-07 22:47:19,327 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable23 [2025-02-07 22:47:19,327 INFO L396 AbstractCegarLoop]: === Iteration 25 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-02-07 22:47:19,328 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-02-07 22:47:19,328 INFO L85 PathProgramCache]: Analyzing trace with hash -12098714, now seen corresponding path program 1 times [2025-02-07 22:47:19,328 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-02-07 22:47:19,328 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1607004105] [2025-02-07 22:47:19,328 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-02-07 22:47:19,329 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-02-07 22:47:19,415 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 381 statements into 1 equivalence classes. [2025-02-07 22:47:20,703 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 381 of 381 statements. [2025-02-07 22:47:20,703 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-02-07 22:47:20,703 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-02-07 22:47:21,522 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-07 22:47:21,522 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-02-07 22:47:21,523 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1607004105] [2025-02-07 22:47:21,523 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1607004105] provided 1 perfect and 0 imperfect interpolant sequences [2025-02-07 22:47:21,523 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-02-07 22:47:21,523 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2025-02-07 22:47:21,523 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [799570069] [2025-02-07 22:47:21,523 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-02-07 22:47:21,523 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 7 states [2025-02-07 22:47:21,523 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-02-07 22:47:21,524 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2025-02-07 22:47:21,524 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=13, Invalid=29, Unknown=0, NotChecked=0, Total=42 [2025-02-07 22:47:21,524 INFO L87 Difference]: Start difference. First operand 1800 states and 2667 transitions. Second operand has 7 states, 7 states have (on average 54.42857142857143) internal successors, (381), 6 states have internal predecessors, (381), 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-07 22:47:22,101 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-02-07 22:47:22,102 INFO L93 Difference]: Finished difference Result 5151 states and 7629 transitions. [2025-02-07 22:47:22,102 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2025-02-07 22:47:22,102 INFO L78 Accepts]: Start accepts. Automaton has has 7 states, 7 states have (on average 54.42857142857143) internal successors, (381), 6 states have internal predecessors, (381), 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 381 [2025-02-07 22:47:22,102 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-02-07 22:47:22,106 INFO L225 Difference]: With dead ends: 5151 [2025-02-07 22:47:22,107 INFO L226 Difference]: Without dead ends: 3380 [2025-02-07 22:47:22,108 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 10 GetRequests, 3 SyntacticMatches, 0 SemanticMatches, 7 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 4 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=23, Invalid=49, Unknown=0, NotChecked=0, Total=72 [2025-02-07 22:47:22,108 INFO L435 NwaCegarLoop]: 1365 mSDtfsCounter, 4001 mSDsluCounter, 5448 mSDsCounter, 0 mSdLazyCounter, 1431 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.4s Time, 0 mProtectedPredicate, 0 mProtectedAction, 4001 SdHoareTripleChecker+Valid, 6813 SdHoareTripleChecker+Invalid, 1431 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 1431 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.5s IncrementalHoareTripleChecker+Time [2025-02-07 22:47:22,109 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [4001 Valid, 6813 Invalid, 1431 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 1431 Invalid, 0 Unknown, 0 Unchecked, 0.5s Time] [2025-02-07 22:47:22,110 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 3380 states. [2025-02-07 22:47:22,129 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 3380 to 2938. [2025-02-07 22:47:22,131 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 2938 states, 2937 states have (on average 1.4892747701736466) internal successors, (4374), 2937 states have internal predecessors, (4374), 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-07 22:47:22,133 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 2938 states to 2938 states and 4374 transitions. [2025-02-07 22:47:22,134 INFO L78 Accepts]: Start accepts. Automaton has 2938 states and 4374 transitions. Word has length 381 [2025-02-07 22:47:22,134 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-02-07 22:47:22,134 INFO L471 AbstractCegarLoop]: Abstraction has 2938 states and 4374 transitions. [2025-02-07 22:47:22,134 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 7 states, 7 states have (on average 54.42857142857143) internal successors, (381), 6 states have internal predecessors, (381), 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-07 22:47:22,134 INFO L276 IsEmpty]: Start isEmpty. Operand 2938 states and 4374 transitions. [2025-02-07 22:47:22,137 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 382 [2025-02-07 22:47:22,137 INFO L210 NwaCegarLoop]: Found error trace [2025-02-07 22:47:22,137 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, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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-07 22:47:22,137 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable24 [2025-02-07 22:47:22,137 INFO L396 AbstractCegarLoop]: === Iteration 26 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-02-07 22:47:22,137 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-02-07 22:47:22,138 INFO L85 PathProgramCache]: Analyzing trace with hash -508788225, now seen corresponding path program 1 times [2025-02-07 22:47:22,138 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-02-07 22:47:22,138 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1721285903] [2025-02-07 22:47:22,138 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-02-07 22:47:22,138 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-02-07 22:47:22,206 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 381 statements into 1 equivalence classes. [2025-02-07 22:47:23,103 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 381 of 381 statements. [2025-02-07 22:47:23,104 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-02-07 22:47:23,104 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-02-07 22:47:23,402 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-07 22:47:23,405 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-02-07 22:47:23,405 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1721285903] [2025-02-07 22:47:23,405 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1721285903] provided 1 perfect and 0 imperfect interpolant sequences [2025-02-07 22:47:23,406 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-02-07 22:47:23,406 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2025-02-07 22:47:23,406 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1601532471] [2025-02-07 22:47:23,406 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-02-07 22:47:23,406 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2025-02-07 22:47:23,406 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-02-07 22:47:23,406 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2025-02-07 22:47:23,406 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=9, Invalid=11, Unknown=0, NotChecked=0, Total=20 [2025-02-07 22:47:23,406 INFO L87 Difference]: Start difference. First operand 2938 states and 4374 transitions. Second operand has 5 states, 5 states have (on average 76.2) internal successors, (381), 4 states have internal predecessors, (381), 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-07 22:47:24,069 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-02-07 22:47:24,069 INFO L93 Difference]: Finished difference Result 5848 states and 8707 transitions. [2025-02-07 22:47:24,069 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2025-02-07 22:47:24,069 INFO L78 Accepts]: Start accepts. Automaton has has 5 states, 5 states have (on average 76.2) internal successors, (381), 4 states have internal predecessors, (381), 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 381 [2025-02-07 22:47:24,070 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-02-07 22:47:24,073 INFO L225 Difference]: With dead ends: 5848 [2025-02-07 22:47:24,073 INFO L226 Difference]: Without dead ends: 2939 [2025-02-07 22:47:24,075 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 5 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=9, Invalid=11, Unknown=0, NotChecked=0, Total=20 [2025-02-07 22:47:24,075 INFO L435 NwaCegarLoop]: 1128 mSDtfsCounter, 1356 mSDsluCounter, 2252 mSDsCounter, 0 mSdLazyCounter, 1565 mSolverCounterSat, 1 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.5s Time, 0 mProtectedPredicate, 0 mProtectedAction, 1356 SdHoareTripleChecker+Valid, 3380 SdHoareTripleChecker+Invalid, 1566 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 1 IncrementalHoareTripleChecker+Valid, 1565 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.6s IncrementalHoareTripleChecker+Time [2025-02-07 22:47:24,076 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [1356 Valid, 3380 Invalid, 1566 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [1 Valid, 1565 Invalid, 0 Unknown, 0 Unchecked, 0.6s Time] [2025-02-07 22:47:24,077 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 2939 states. [2025-02-07 22:47:24,089 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 2939 to 2939. [2025-02-07 22:47:24,091 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 2939 states, 2938 states have (on average 1.4891082368958475) internal successors, (4375), 2938 states have internal predecessors, (4375), 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-07 22:47:24,096 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 2939 states to 2939 states and 4375 transitions. [2025-02-07 22:47:24,100 INFO L78 Accepts]: Start accepts. Automaton has 2939 states and 4375 transitions. Word has length 381 [2025-02-07 22:47:24,101 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-02-07 22:47:24,101 INFO L471 AbstractCegarLoop]: Abstraction has 2939 states and 4375 transitions. [2025-02-07 22:47:24,101 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 76.2) internal successors, (381), 4 states have internal predecessors, (381), 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-07 22:47:24,101 INFO L276 IsEmpty]: Start isEmpty. Operand 2939 states and 4375 transitions. [2025-02-07 22:47:24,104 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 383 [2025-02-07 22:47:24,104 INFO L210 NwaCegarLoop]: Found error trace [2025-02-07 22:47:24,104 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, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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-07 22:47:24,104 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable25 [2025-02-07 22:47:24,104 INFO L396 AbstractCegarLoop]: === Iteration 27 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-02-07 22:47:24,104 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-02-07 22:47:24,108 INFO L85 PathProgramCache]: Analyzing trace with hash 1263008801, now seen corresponding path program 1 times [2025-02-07 22:47:24,108 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-02-07 22:47:24,108 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1213304616] [2025-02-07 22:47:24,109 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-02-07 22:47:24,109 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-02-07 22:47:24,165 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 382 statements into 1 equivalence classes. [2025-02-07 22:47:25,226 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 382 of 382 statements. [2025-02-07 22:47:25,226 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-02-07 22:47:25,227 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-02-07 22:47:26,460 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-07 22:47:26,460 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-02-07 22:47:26,460 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1213304616] [2025-02-07 22:47:26,460 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1213304616] provided 1 perfect and 0 imperfect interpolant sequences [2025-02-07 22:47:26,460 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-02-07 22:47:26,460 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2025-02-07 22:47:26,460 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [265074958] [2025-02-07 22:47:26,460 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-02-07 22:47:26,460 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 8 states [2025-02-07 22:47:26,460 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-02-07 22:47:26,461 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2025-02-07 22:47:26,461 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=14, Invalid=42, Unknown=0, NotChecked=0, Total=56 [2025-02-07 22:47:26,461 INFO L87 Difference]: Start difference. First operand 2939 states and 4375 transitions. Second operand has 8 states, 8 states have (on average 47.75) internal successors, (382), 7 states have internal predecessors, (382), 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-07 22:47:27,340 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-02-07 22:47:27,340 INFO L93 Difference]: Finished difference Result 5978 states and 8873 transitions. [2025-02-07 22:47:27,341 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2025-02-07 22:47:27,341 INFO L78 Accepts]: Start accepts. Automaton has has 8 states, 8 states have (on average 47.75) internal successors, (382), 7 states have internal predecessors, (382), 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 382 [2025-02-07 22:47:27,341 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-02-07 22:47:27,349 INFO L225 Difference]: With dead ends: 5978 [2025-02-07 22:47:27,349 INFO L226 Difference]: Without dead ends: 3068 [2025-02-07 22:47:27,355 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 13 GetRequests, 3 SyntacticMatches, 0 SemanticMatches, 10 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 10 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=30, Invalid=102, Unknown=0, NotChecked=0, Total=132 [2025-02-07 22:47:27,356 INFO L435 NwaCegarLoop]: 1235 mSDtfsCounter, 1455 mSDsluCounter, 6165 mSDsCounter, 0 mSdLazyCounter, 2493 mSolverCounterSat, 1 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.7s Time, 0 mProtectedPredicate, 0 mProtectedAction, 1455 SdHoareTripleChecker+Valid, 7400 SdHoareTripleChecker+Invalid, 2494 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 1 IncrementalHoareTripleChecker+Valid, 2493 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.8s IncrementalHoareTripleChecker+Time [2025-02-07 22:47:27,357 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [1455 Valid, 7400 Invalid, 2494 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [1 Valid, 2493 Invalid, 0 Unknown, 0 Unchecked, 0.8s Time] [2025-02-07 22:47:27,358 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 3068 states. [2025-02-07 22:47:27,393 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 3068 to 3063. [2025-02-07 22:47:27,395 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 3063 states, 3062 states have (on average 1.480731548007838) internal successors, (4534), 3062 states have internal predecessors, (4534), 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-07 22:47:27,398 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3063 states to 3063 states and 4534 transitions. [2025-02-07 22:47:27,398 INFO L78 Accepts]: Start accepts. Automaton has 3063 states and 4534 transitions. Word has length 382 [2025-02-07 22:47:27,398 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-02-07 22:47:27,398 INFO L471 AbstractCegarLoop]: Abstraction has 3063 states and 4534 transitions. [2025-02-07 22:47:27,398 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 8 states, 8 states have (on average 47.75) internal successors, (382), 7 states have internal predecessors, (382), 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-07 22:47:27,398 INFO L276 IsEmpty]: Start isEmpty. Operand 3063 states and 4534 transitions. [2025-02-07 22:47:27,401 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 384 [2025-02-07 22:47:27,401 INFO L210 NwaCegarLoop]: Found error trace [2025-02-07 22:47:27,401 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, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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-07 22:47:27,401 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable26 [2025-02-07 22:47:27,402 INFO L396 AbstractCegarLoop]: === Iteration 28 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-02-07 22:47:27,402 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-02-07 22:47:27,402 INFO L85 PathProgramCache]: Analyzing trace with hash 1791612037, now seen corresponding path program 1 times [2025-02-07 22:47:27,402 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-02-07 22:47:27,402 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1132855129] [2025-02-07 22:47:27,402 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-02-07 22:47:27,402 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-02-07 22:47:27,470 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 383 statements into 1 equivalence classes. [2025-02-07 22:47:29,345 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 383 of 383 statements. [2025-02-07 22:47:29,346 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-02-07 22:47:29,346 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-02-07 22:47:30,154 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-07 22:47:30,155 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-02-07 22:47:30,155 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1132855129] [2025-02-07 22:47:30,155 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1132855129] provided 1 perfect and 0 imperfect interpolant sequences [2025-02-07 22:47:30,155 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-02-07 22:47:30,155 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2025-02-07 22:47:30,155 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1446488381] [2025-02-07 22:47:30,155 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-02-07 22:47:30,155 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2025-02-07 22:47:30,155 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-02-07 22:47:30,156 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2025-02-07 22:47:30,156 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=10, Invalid=20, Unknown=0, NotChecked=0, Total=30 [2025-02-07 22:47:30,156 INFO L87 Difference]: Start difference. First operand 3063 states and 4534 transitions. Second operand has 6 states, 6 states have (on average 63.833333333333336) internal successors, (383), 6 states have internal predecessors, (383), 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-07 22:47:30,626 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-02-07 22:47:30,626 INFO L93 Difference]: Finished difference Result 6097 states and 9025 transitions. [2025-02-07 22:47:30,627 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2025-02-07 22:47:30,627 INFO L78 Accepts]: Start accepts. Automaton has has 6 states, 6 states have (on average 63.833333333333336) internal successors, (383), 6 states have internal predecessors, (383), 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 383 [2025-02-07 22:47:30,627 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-02-07 22:47:30,630 INFO L225 Difference]: With dead ends: 6097 [2025-02-07 22:47:30,630 INFO L226 Difference]: Without dead ends: 3063 [2025-02-07 22:47:30,633 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 9 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 7 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 3 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=26, Invalid=46, Unknown=0, NotChecked=0, Total=72 [2025-02-07 22:47:30,633 INFO L435 NwaCegarLoop]: 1358 mSDtfsCounter, 1443 mSDsluCounter, 3109 mSDsCounter, 0 mSdLazyCounter, 953 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.4s Time, 0 mProtectedPredicate, 0 mProtectedAction, 1443 SdHoareTripleChecker+Valid, 4467 SdHoareTripleChecker+Invalid, 953 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 953 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.4s IncrementalHoareTripleChecker+Time [2025-02-07 22:47:30,633 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [1443 Valid, 4467 Invalid, 953 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 953 Invalid, 0 Unknown, 0 Unchecked, 0.4s Time] [2025-02-07 22:47:30,634 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 3063 states. [2025-02-07 22:47:30,648 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 3063 to 3063. [2025-02-07 22:47:30,650 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 3063 states, 3062 states have (on average 1.4804049640757675) internal successors, (4533), 3062 states have internal predecessors, (4533), 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-07 22:47:30,652 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3063 states to 3063 states and 4533 transitions. [2025-02-07 22:47:30,652 INFO L78 Accepts]: Start accepts. Automaton has 3063 states and 4533 transitions. Word has length 383 [2025-02-07 22:47:30,652 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-02-07 22:47:30,652 INFO L471 AbstractCegarLoop]: Abstraction has 3063 states and 4533 transitions. [2025-02-07 22:47:30,652 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 6 states have (on average 63.833333333333336) internal successors, (383), 6 states have internal predecessors, (383), 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-07 22:47:30,652 INFO L276 IsEmpty]: Start isEmpty. Operand 3063 states and 4533 transitions. [2025-02-07 22:47:30,655 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 385 [2025-02-07 22:47:30,655 INFO L210 NwaCegarLoop]: Found error trace [2025-02-07 22:47:30,655 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, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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-07 22:47:30,655 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable27 [2025-02-07 22:47:30,655 INFO L396 AbstractCegarLoop]: === Iteration 29 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-02-07 22:47:30,655 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-02-07 22:47:30,656 INFO L85 PathProgramCache]: Analyzing trace with hash -7160383, now seen corresponding path program 1 times [2025-02-07 22:47:30,656 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-02-07 22:47:30,656 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [350217699] [2025-02-07 22:47:30,656 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-02-07 22:47:30,656 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-02-07 22:47:30,718 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 384 statements into 1 equivalence classes. [2025-02-07 22:47:32,010 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 384 of 384 statements. [2025-02-07 22:47:32,010 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-02-07 22:47:32,010 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-02-07 22:47:32,940 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-07 22:47:32,940 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-02-07 22:47:32,940 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [350217699] [2025-02-07 22:47:32,941 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [350217699] provided 1 perfect and 0 imperfect interpolant sequences [2025-02-07 22:47:32,941 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-02-07 22:47:32,941 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [8] imperfect sequences [] total 8 [2025-02-07 22:47:32,941 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2024994062] [2025-02-07 22:47:32,941 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-02-07 22:47:32,941 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 9 states [2025-02-07 22:47:32,941 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-02-07 22:47:32,941 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2025-02-07 22:47:32,941 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=22, Invalid=50, Unknown=0, NotChecked=0, Total=72 [2025-02-07 22:47:32,941 INFO L87 Difference]: Start difference. First operand 3063 states and 4533 transitions. Second operand has 9 states, 9 states have (on average 42.666666666666664) internal successors, (384), 8 states have internal predecessors, (384), 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-07 22:47:34,020 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-02-07 22:47:34,021 INFO L93 Difference]: Finished difference Result 6101 states and 9029 transitions. [2025-02-07 22:47:34,021 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 10 states. [2025-02-07 22:47:34,021 INFO L78 Accepts]: Start accepts. Automaton has has 9 states, 9 states have (on average 42.666666666666664) internal successors, (384), 8 states have internal predecessors, (384), 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 384 [2025-02-07 22:47:34,021 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-02-07 22:47:34,024 INFO L225 Difference]: With dead ends: 6101 [2025-02-07 22:47:34,024 INFO L226 Difference]: Without dead ends: 3067 [2025-02-07 22:47:34,026 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 15 GetRequests, 3 SyntacticMatches, 0 SemanticMatches, 12 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 10 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=55, Invalid=127, Unknown=0, NotChecked=0, Total=182 [2025-02-07 22:47:34,027 INFO L435 NwaCegarLoop]: 1224 mSDtfsCounter, 2785 mSDsluCounter, 6114 mSDsCounter, 0 mSdLazyCounter, 2494 mSolverCounterSat, 1 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.8s Time, 0 mProtectedPredicate, 0 mProtectedAction, 2785 SdHoareTripleChecker+Valid, 7338 SdHoareTripleChecker+Invalid, 2495 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 1 IncrementalHoareTripleChecker+Valid, 2494 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 1.0s IncrementalHoareTripleChecker+Time [2025-02-07 22:47:34,027 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [2785 Valid, 7338 Invalid, 2495 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [1 Valid, 2494 Invalid, 0 Unknown, 0 Unchecked, 1.0s Time] [2025-02-07 22:47:34,032 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 3067 states. [2025-02-07 22:47:34,048 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 3067 to 3066. [2025-02-07 22:47:34,050 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 3066 states, 3065 states have (on average 1.4799347471451876) internal successors, (4536), 3065 states have internal predecessors, (4536), 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-07 22:47:34,052 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3066 states to 3066 states and 4536 transitions. [2025-02-07 22:47:34,052 INFO L78 Accepts]: Start accepts. Automaton has 3066 states and 4536 transitions. Word has length 384 [2025-02-07 22:47:34,052 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-02-07 22:47:34,052 INFO L471 AbstractCegarLoop]: Abstraction has 3066 states and 4536 transitions. [2025-02-07 22:47:34,052 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 9 states, 9 states have (on average 42.666666666666664) internal successors, (384), 8 states have internal predecessors, (384), 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-07 22:47:34,053 INFO L276 IsEmpty]: Start isEmpty. Operand 3066 states and 4536 transitions. [2025-02-07 22:47:34,055 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 386 [2025-02-07 22:47:34,055 INFO L210 NwaCegarLoop]: Found error trace [2025-02-07 22:47:34,055 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, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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-07 22:47:34,056 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable28 [2025-02-07 22:47:34,056 INFO L396 AbstractCegarLoop]: === Iteration 30 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-02-07 22:47:34,056 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-02-07 22:47:34,056 INFO L85 PathProgramCache]: Analyzing trace with hash 191779920, now seen corresponding path program 1 times [2025-02-07 22:47:34,056 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-02-07 22:47:34,056 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1179845822] [2025-02-07 22:47:34,056 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-02-07 22:47:34,056 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-02-07 22:47:34,136 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 385 statements into 1 equivalence classes. [2025-02-07 22:47:35,281 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 385 of 385 statements. [2025-02-07 22:47:35,282 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-02-07 22:47:35,282 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-02-07 22:47:35,628 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-07 22:47:35,629 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-02-07 22:47:35,629 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1179845822] [2025-02-07 22:47:35,629 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1179845822] provided 1 perfect and 0 imperfect interpolant sequences [2025-02-07 22:47:35,631 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-02-07 22:47:35,631 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2025-02-07 22:47:35,631 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2006125901] [2025-02-07 22:47:35,631 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-02-07 22:47:35,631 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2025-02-07 22:47:35,631 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-02-07 22:47:35,632 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2025-02-07 22:47:35,632 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2025-02-07 22:47:35,632 INFO L87 Difference]: Start difference. First operand 3066 states and 4536 transitions. Second operand has 4 states, 4 states have (on average 96.25) internal successors, (385), 4 states have internal predecessors, (385), 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-07 22:47:35,960 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-02-07 22:47:35,961 INFO L93 Difference]: Finished difference Result 6106 states and 9033 transitions. [2025-02-07 22:47:35,961 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2025-02-07 22:47:35,961 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 4 states have (on average 96.25) internal successors, (385), 4 states have internal predecessors, (385), 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 385 [2025-02-07 22:47:35,961 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-02-07 22:47:35,964 INFO L225 Difference]: With dead ends: 6106 [2025-02-07 22:47:35,964 INFO L226 Difference]: Without dead ends: 3069 [2025-02-07 22:47:35,966 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 6 GetRequests, 4 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-07 22:47:35,966 INFO L435 NwaCegarLoop]: 1371 mSDtfsCounter, 0 mSDsluCounter, 2736 mSDsCounter, 0 mSdLazyCounter, 836 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.3s Time, 0 mProtectedPredicate, 0 mProtectedAction, 0 SdHoareTripleChecker+Valid, 4107 SdHoareTripleChecker+Invalid, 836 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 836 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.3s IncrementalHoareTripleChecker+Time [2025-02-07 22:47:35,969 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [0 Valid, 4107 Invalid, 836 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 836 Invalid, 0 Unknown, 0 Unchecked, 0.3s Time] [2025-02-07 22:47:35,970 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 3069 states. [2025-02-07 22:47:35,984 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 3069 to 3069. [2025-02-07 22:47:35,986 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 3069 states, 3068 states have (on average 1.4794654498044328) internal successors, (4539), 3068 states have internal predecessors, (4539), 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-07 22:47:35,987 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3069 states to 3069 states and 4539 transitions. [2025-02-07 22:47:35,987 INFO L78 Accepts]: Start accepts. Automaton has 3069 states and 4539 transitions. Word has length 385 [2025-02-07 22:47:35,988 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-02-07 22:47:35,988 INFO L471 AbstractCegarLoop]: Abstraction has 3069 states and 4539 transitions. [2025-02-07 22:47:35,988 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 96.25) internal successors, (385), 4 states have internal predecessors, (385), 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-07 22:47:35,988 INFO L276 IsEmpty]: Start isEmpty. Operand 3069 states and 4539 transitions. [2025-02-07 22:47:35,991 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 387 [2025-02-07 22:47:35,991 INFO L210 NwaCegarLoop]: Found error trace [2025-02-07 22:47:35,991 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, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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-07 22:47:35,991 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable29 [2025-02-07 22:47:35,991 INFO L396 AbstractCegarLoop]: === Iteration 31 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-02-07 22:47:35,992 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-02-07 22:47:35,992 INFO L85 PathProgramCache]: Analyzing trace with hash -1764284153, now seen corresponding path program 1 times [2025-02-07 22:47:35,992 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-02-07 22:47:35,992 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [369475263] [2025-02-07 22:47:35,992 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-02-07 22:47:35,992 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-02-07 22:47:36,070 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 386 statements into 1 equivalence classes.