./Ultimate.py --spec ../sv-benchmarks/c/properties/unreach-call.prp --file ../sv-benchmarks/c/hardware-verification-bv/btor2c-lazyMod.arbitrated_top_n3_w8_d8_e0.c --full-output --architecture 64bit -------------------------------------------------------------------------------- Checking for ERROR reachability Using default analysis Version c00e63dc Calling Ultimate with: /root/.sdkman/candidates/java/21.0.5-tem/bin/java -Dosgi.configuration.area=/storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/data/config -Xmx15G -Xms4m -jar /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/plugins/org.eclipse.equinox.launcher_1.6.800.v20240513-1750.jar -data @noDefault -ultimatedata /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/data -tc /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/config/AutomizerReach.xml -i ../sv-benchmarks/c/hardware-verification-bv/btor2c-lazyMod.arbitrated_top_n3_w8_d8_e0.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 0768daa5b1ea2eb0c105d55be0264f5089d89f20bbc5998c83191bedf3acf6dc --- Real Ultimate output --- This is Ultimate 0.3.0-?-c00e63d-m [2025-02-05 18:11:42,631 INFO L188 SettingsManager]: Resetting all preferences to default values... [2025-02-05 18:11:42,682 INFO L114 SettingsManager]: Loading settings from /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/config/svcomp-Reach-64bit-Automizer_Default.epf [2025-02-05 18:11:42,689 WARN L101 SettingsManager]: Preference file contains the following unknown settings: [2025-02-05 18:11:42,689 WARN L103 SettingsManager]: * de.uni_freiburg.informatik.ultimate.core.Log level for class [2025-02-05 18:11:42,709 INFO L130 SettingsManager]: Preferences different from defaults after loading the file: [2025-02-05 18:11:42,710 INFO L151 SettingsManager]: Preferences of UltimateCore differ from their defaults: [2025-02-05 18:11:42,710 INFO L153 SettingsManager]: * Log level for class=de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher=ERROR; [2025-02-05 18:11:42,710 INFO L151 SettingsManager]: Preferences of Boogie Preprocessor differ from their defaults: [2025-02-05 18:11:42,710 INFO L153 SettingsManager]: * Use memory slicer=true [2025-02-05 18:11:42,710 INFO L151 SettingsManager]: Preferences of Boogie Procedure Inliner differ from their defaults: [2025-02-05 18:11:42,710 INFO L153 SettingsManager]: * Ignore calls to procedures called more than once=ONLY_FOR_SEQUENTIAL_PROGRAMS [2025-02-05 18:11:42,710 INFO L151 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2025-02-05 18:11:42,710 INFO L153 SettingsManager]: * Create parallel compositions if possible=false [2025-02-05 18:11:42,710 INFO L153 SettingsManager]: * Use SBE=true [2025-02-05 18:11:42,710 INFO L151 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2025-02-05 18:11:42,710 INFO L153 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2025-02-05 18:11:42,710 INFO L153 SettingsManager]: * Overapproximate operations on floating types=true [2025-02-05 18:11:42,710 INFO L153 SettingsManager]: * Check division by zero=IGNORE [2025-02-05 18:11:42,711 INFO L153 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2025-02-05 18:11:42,711 INFO L153 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2025-02-05 18:11:42,711 INFO L153 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2025-02-05 18:11:42,711 INFO L153 SettingsManager]: * Check if freed pointer was valid=false [2025-02-05 18:11:42,711 INFO L153 SettingsManager]: * Behaviour of calls to undefined functions=OVERAPPROXIMATE_BEHAVIOUR [2025-02-05 18:11:42,711 INFO L153 SettingsManager]: * Use constant arrays=true [2025-02-05 18:11:42,711 INFO L151 SettingsManager]: Preferences of IcfgBuilder differ from their defaults: [2025-02-05 18:11:42,711 INFO L153 SettingsManager]: * Size of a code block=SequenceOfStatements [2025-02-05 18:11:42,711 INFO L153 SettingsManager]: * Only consider context switches at boundaries of atomic blocks=true [2025-02-05 18:11:42,711 INFO L153 SettingsManager]: * SMT solver=External_DefaultMode [2025-02-05 18:11:42,711 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2025-02-05 18:11:42,711 INFO L151 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2025-02-05 18:11:42,711 INFO L153 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2025-02-05 18:11:42,711 INFO L153 SettingsManager]: * Compute procedure contracts=false [2025-02-05 18:11:42,711 INFO L153 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopHeads [2025-02-05 18:11:42,711 INFO L153 SettingsManager]: * Trace refinement strategy=CAMEL [2025-02-05 18:11:42,711 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2025-02-05 18:11:42,713 INFO L153 SettingsManager]: * Apply one-shot large block encoding in concurrent analysis=false [2025-02-05 18:11:42,714 INFO L153 SettingsManager]: * Automaton type used in concurrency analysis=PETRI_NET [2025-02-05 18:11:42,714 INFO L153 SettingsManager]: * Order on configurations for Petri net unfoldings=DBO [2025-02-05 18:11:42,714 INFO L153 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode [2025-02-05 18:11:42,714 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 -> 0768daa5b1ea2eb0c105d55be0264f5089d89f20bbc5998c83191bedf3acf6dc [2025-02-05 18:11:42,946 INFO L75 nceAwareModelManager]: Repository-Root is: /tmp [2025-02-05 18:11:42,953 INFO L261 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2025-02-05 18:11:42,957 INFO L217 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2025-02-05 18:11:42,959 INFO L270 PluginConnector]: Initializing CDTParser... [2025-02-05 18:11:42,959 INFO L274 PluginConnector]: CDTParser initialized [2025-02-05 18:11:42,961 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.arbitrated_top_n3_w8_d8_e0.c [2025-02-05 18:11:44,271 INFO L533 CDTParser]: Created temporary CDT project at /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/data/95fbb5451/b0d78c976c014563aed22b4b18a839a5/FLAGf4c504e1b [2025-02-05 18:11:44,553 INFO L384 CDTParser]: Found 1 translation units. [2025-02-05 18:11:44,553 INFO L180 CDTParser]: Scanning /storage/repos/ultimate-jdk21/releaseScripts/default/sv-benchmarks/c/hardware-verification-bv/btor2c-lazyMod.arbitrated_top_n3_w8_d8_e0.c [2025-02-05 18:11:44,563 INFO L427 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/data/95fbb5451/b0d78c976c014563aed22b4b18a839a5/FLAGf4c504e1b [2025-02-05 18:11:44,577 INFO L435 CDTParser]: Successfully deleted /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/data/95fbb5451/b0d78c976c014563aed22b4b18a839a5 [2025-02-05 18:11:44,579 INFO L299 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2025-02-05 18:11:44,580 INFO L133 ToolchainWalker]: Walking toolchain with 6 elements. [2025-02-05 18:11:44,580 INFO L112 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2025-02-05 18:11:44,581 INFO L270 PluginConnector]: Initializing CACSL2BoogieTranslator... [2025-02-05 18:11:44,583 INFO L274 PluginConnector]: CACSL2BoogieTranslator initialized [2025-02-05 18:11:44,584 INFO L184 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 05.02 06:11:44" (1/1) ... [2025-02-05 18:11:44,584 INFO L204 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@184cb39e and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 05.02 06:11:44, skipping insertion in model container [2025-02-05 18:11:44,584 INFO L184 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 05.02 06:11:44" (1/1) ... [2025-02-05 18:11:44,615 INFO L175 MainTranslator]: Built tables and reachable declarations [2025-02-05 18:11:44,709 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.arbitrated_top_n3_w8_d8_e0.c[1269,1282] [2025-02-05 18:11:44,919 INFO L210 PostProcessor]: Analyzing one entry point: main [2025-02-05 18:11:44,932 INFO L200 MainTranslator]: Completed pre-run [2025-02-05 18:11:44,940 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.arbitrated_top_n3_w8_d8_e0.c[1269,1282] [2025-02-05 18:11:45,127 INFO L210 PostProcessor]: Analyzing one entry point: main [2025-02-05 18:11:45,140 INFO L204 MainTranslator]: Completed translation [2025-02-05 18:11:45,141 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 05.02 06:11:45 WrapperNode [2025-02-05 18:11:45,141 INFO L131 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2025-02-05 18:11:45,142 INFO L112 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2025-02-05 18:11:45,142 INFO L270 PluginConnector]: Initializing Boogie Procedure Inliner... [2025-02-05 18:11:45,142 INFO L274 PluginConnector]: Boogie Procedure Inliner initialized [2025-02-05 18:11:45,148 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 05.02 06:11:45" (1/1) ... [2025-02-05 18:11:45,191 INFO L184 PluginConnector]: Executing the observer Inliner from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 05.02 06:11:45" (1/1) ... [2025-02-05 18:11:45,446 INFO L138 Inliner]: procedures = 17, calls = 18, calls flagged for inlining = 3, calls inlined = 3, statements flattened = 3705 [2025-02-05 18:11:45,446 INFO L131 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2025-02-05 18:11:45,447 INFO L112 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2025-02-05 18:11:45,447 INFO L270 PluginConnector]: Initializing Boogie Preprocessor... [2025-02-05 18:11:45,447 INFO L274 PluginConnector]: Boogie Preprocessor initialized [2025-02-05 18:11:45,454 INFO L184 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 05.02 06:11:45" (1/1) ... [2025-02-05 18:11:45,454 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 05.02 06:11:45" (1/1) ... [2025-02-05 18:11:45,500 INFO L184 PluginConnector]: Executing the observer MemorySlicer from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 05.02 06:11:45" (1/1) ... [2025-02-05 18:11:45,664 INFO L175 MemorySlicer]: Split 2 memory accesses to 1 slices as follows [2]. 100 percent of accesses are in the largest equivalence class. The 2 initializations are split as follows [2]. The 0 writes are split as follows [0]. [2025-02-05 18:11:45,664 INFO L184 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 05.02 06:11:45" (1/1) ... [2025-02-05 18:11:45,665 INFO L184 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 05.02 06:11:45" (1/1) ... [2025-02-05 18:11:45,752 INFO L184 PluginConnector]: Executing the observer ReplaceArrayAssignments from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 05.02 06:11:45" (1/1) ... [2025-02-05 18:11:45,785 INFO L184 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 05.02 06:11:45" (1/1) ... [2025-02-05 18:11:45,809 INFO L184 PluginConnector]: Executing the observer LTLStepAnnotator from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 05.02 06:11:45" (1/1) ... [2025-02-05 18:11:45,823 INFO L184 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 05.02 06:11:45" (1/1) ... [2025-02-05 18:11:45,914 INFO L131 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2025-02-05 18:11:45,915 INFO L112 PluginConnector]: ------------------------IcfgBuilder---------------------------- [2025-02-05 18:11:45,915 INFO L270 PluginConnector]: Initializing IcfgBuilder... [2025-02-05 18:11:45,915 INFO L274 PluginConnector]: IcfgBuilder initialized [2025-02-05 18:11:45,916 INFO L184 PluginConnector]: Executing the observer IcfgBuilderObserver from plugin IcfgBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 05.02 06:11:45" (1/1) ... [2025-02-05 18:11:45,923 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2025-02-05 18:11:45,938 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 [2025-02-05 18:11:45,959 INFO L229 MonitoredProcess]: Starting monitored process 1 with /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 (exit command is (exit), workingDir is null) [2025-02-05 18:11:45,964 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 (1)] Waiting until timeout for monitored process [2025-02-05 18:11:45,987 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocInit [2025-02-05 18:11:45,990 INFO L130 BoogieDeclarations]: Found specification of procedure assume_abort_if_not [2025-02-05 18:11:45,990 INFO L138 BoogieDeclarations]: Found implementation of procedure assume_abort_if_not [2025-02-05 18:11:45,990 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int#0 [2025-02-05 18:11:45,991 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2025-02-05 18:11:45,991 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2025-02-05 18:11:46,319 INFO L257 CfgBuilder]: Building ICFG [2025-02-05 18:11:46,321 INFO L287 CfgBuilder]: Building CFG for each procedure with an implementation [2025-02-05 18:11:48,843 INFO L? ?]: Removed 2070 outVars from TransFormulas that were not future-live. [2025-02-05 18:11:48,843 INFO L308 CfgBuilder]: Performing block encoding [2025-02-05 18:11:48,929 INFO L332 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2025-02-05 18:11:48,929 INFO L337 CfgBuilder]: Removed 0 assume(true) statements. [2025-02-05 18:11:48,930 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.icfgbuilder CFG 05.02 06:11:48 BoogieIcfgContainer [2025-02-05 18:11:48,930 INFO L131 PluginConnector]: ------------------------ END IcfgBuilder---------------------------- [2025-02-05 18:11:48,931 INFO L112 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2025-02-05 18:11:48,931 INFO L270 PluginConnector]: Initializing TraceAbstraction... [2025-02-05 18:11:48,935 INFO L274 PluginConnector]: TraceAbstraction initialized [2025-02-05 18:11:48,935 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 05.02 06:11:44" (1/3) ... [2025-02-05 18:11:48,939 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@7a6d785b and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 05.02 06:11:48, skipping insertion in model container [2025-02-05 18:11:48,939 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 05.02 06:11:45" (2/3) ... [2025-02-05 18:11:48,939 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@7a6d785b and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 05.02 06:11:48, skipping insertion in model container [2025-02-05 18:11:48,939 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.icfgbuilder CFG 05.02 06:11:48" (3/3) ... [2025-02-05 18:11:48,940 INFO L128 eAbstractionObserver]: Analyzing ICFG btor2c-lazyMod.arbitrated_top_n3_w8_d8_e0.c [2025-02-05 18:11:48,963 INFO L216 ceAbstractionStarter]: Automizer settings: Hoare:LoopHeads NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2025-02-05 18:11:48,964 INFO L151 ceAbstractionStarter]: Applying trace abstraction to ICFG btor2c-lazyMod.arbitrated_top_n3_w8_d8_e0.c that has 2 procedures, 1098 locations, 1 initial locations, 1 loop locations, and 1 error locations. [2025-02-05 18:11:49,063 INFO L332 AbstractCegarLoop]: ======== Iteration 0 == of CEGAR loop == AllErrorsAtOnce ======== [2025-02-05 18:11:49,074 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;@644822aa, mLbeIndependenceSettings=[IndependenceType=SEMANTIC, AbstractionType=NONE, UseConditional=false, UseSemiCommutativity=true, Solver=Z3, SolverTimeout=1000ms] [2025-02-05 18:11:49,077 INFO L334 AbstractCegarLoop]: Starting to check reachability of 1 error locations. [2025-02-05 18:11:49,087 INFO L276 IsEmpty]: Start isEmpty. Operand has 1098 states, 1085 states have (on average 1.4940092165898617) internal successors, (1621), 1086 states have internal predecessors, (1621), 10 states have call successors, (10), 1 states have call predecessors, (10), 1 states have return successors, (10), 10 states have call predecessors, (10), 10 states have call successors, (10) [2025-02-05 18:11:49,104 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 374 [2025-02-05 18:11:49,105 INFO L210 NwaCegarLoop]: Found error trace [2025-02-05 18:11:49,107 INFO L218 NwaCegarLoop]: trace histogram [10, 10, 10, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-02-05 18:11:49,107 INFO L396 AbstractCegarLoop]: === Iteration 1 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-02-05 18:11:49,111 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-02-05 18:11:49,111 INFO L85 PathProgramCache]: Analyzing trace with hash -1502717973, now seen corresponding path program 1 times [2025-02-05 18:11:49,116 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-02-05 18:11:49,118 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [951729811] [2025-02-05 18:11:49,119 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-02-05 18:11:49,119 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-02-05 18:11:49,304 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 373 statements into 1 equivalence classes. [2025-02-05 18:11:49,409 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 373 of 373 statements. [2025-02-05 18:11:49,414 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-02-05 18:11:49,417 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-02-05 18:11:49,766 INFO L134 CoverageAnalysis]: Checked inductivity of 180 backedges. 0 proven. 18 refuted. 0 times theorem prover too weak. 162 trivial. 0 not checked. [2025-02-05 18:11:49,767 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-02-05 18:11:49,767 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [951729811] [2025-02-05 18:11:49,768 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [951729811] provided 0 perfect and 1 imperfect interpolant sequences [2025-02-05 18:11:49,768 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [130141328] [2025-02-05 18:11:49,768 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-02-05 18:11:49,768 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-02-05 18:11:49,769 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 [2025-02-05 18:11:49,773 INFO L229 MonitoredProcess]: Starting monitored process 2 with /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2025-02-05 18:11:49,775 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (2)] Waiting until timeout for monitored process [2025-02-05 18:11:50,126 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 373 statements into 1 equivalence classes. [2025-02-05 18:11:50,299 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 373 of 373 statements. [2025-02-05 18:11:50,299 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-02-05 18:11:50,299 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-02-05 18:11:50,308 INFO L256 TraceCheckSpWp]: Trace formula consists of 1867 conjuncts, 1 conjuncts are in the unsatisfiable core [2025-02-05 18:11:50,318 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-02-05 18:11:50,339 INFO L134 CoverageAnalysis]: Checked inductivity of 180 backedges. 18 proven. 0 refuted. 0 times theorem prover too weak. 162 trivial. 0 not checked. [2025-02-05 18:11:50,340 INFO L308 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2025-02-05 18:11:50,340 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [130141328] provided 1 perfect and 0 imperfect interpolant sequences [2025-02-05 18:11:50,340 INFO L185 FreeRefinementEngine]: Found 1 perfect and 1 imperfect interpolant sequences. [2025-02-05 18:11:50,340 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [2] total 2 [2025-02-05 18:11:50,342 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [92353591] [2025-02-05 18:11:50,342 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-02-05 18:11:50,344 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 2 states [2025-02-05 18:11:50,345 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-02-05 18:11:50,357 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 2 interpolants. [2025-02-05 18:11:50,357 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=1, Invalid=1, Unknown=0, NotChecked=0, Total=2 [2025-02-05 18:11:50,360 INFO L87 Difference]: Start difference. First operand has 1098 states, 1085 states have (on average 1.4940092165898617) internal successors, (1621), 1086 states have internal predecessors, (1621), 10 states have call successors, (10), 1 states have call predecessors, (10), 1 states have return successors, (10), 10 states have call predecessors, (10), 10 states have call successors, (10) Second operand has 2 states, 2 states have (on average 164.0) internal successors, (328), 2 states have internal predecessors, (328), 2 states have call successors, (10), 2 states have call predecessors, (10), 1 states have return successors, (10), 1 states have call predecessors, (10), 2 states have call successors, (10) [2025-02-05 18:11:50,815 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-02-05 18:11:50,816 INFO L93 Difference]: Finished difference Result 2027 states and 3042 transitions. [2025-02-05 18:11:50,820 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 2 states. [2025-02-05 18:11:50,821 INFO L78 Accepts]: Start accepts. Automaton has has 2 states, 2 states have (on average 164.0) internal successors, (328), 2 states have internal predecessors, (328), 2 states have call successors, (10), 2 states have call predecessors, (10), 1 states have return successors, (10), 1 states have call predecessors, (10), 2 states have call successors, (10) Word has length 373 [2025-02-05 18:11:50,822 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-02-05 18:11:50,839 INFO L225 Difference]: With dead ends: 2027 [2025-02-05 18:11:50,839 INFO L226 Difference]: Without dead ends: 1095 [2025-02-05 18:11:50,845 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 374 GetRequests, 374 SyntacticMatches, 0 SemanticMatches, 0 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=1, Invalid=1, Unknown=0, NotChecked=0, Total=2 [2025-02-05 18:11:50,847 INFO L435 NwaCegarLoop]: 1370 mSDtfsCounter, 0 mSDsluCounter, 0 mSDsCounter, 0 mSdLazyCounter, 266 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.3s Time, 0 mProtectedPredicate, 0 mProtectedAction, 0 SdHoareTripleChecker+Valid, 1370 SdHoareTripleChecker+Invalid, 266 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 266 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.4s IncrementalHoareTripleChecker+Time [2025-02-05 18:11:50,848 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [0 Valid, 1370 Invalid, 266 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 266 Invalid, 0 Unknown, 0 Unchecked, 0.4s Time] [2025-02-05 18:11:50,865 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1095 states. [2025-02-05 18:11:50,916 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1095 to 1095. [2025-02-05 18:11:50,918 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 1095 states, 1083 states have (on average 1.492151431209603) internal successors, (1616), 1083 states have internal predecessors, (1616), 10 states have call successors, (10), 1 states have call predecessors, (10), 1 states have return successors, (10), 10 states have call predecessors, (10), 10 states have call successors, (10) [2025-02-05 18:11:50,930 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1095 states to 1095 states and 1636 transitions. [2025-02-05 18:11:50,931 INFO L78 Accepts]: Start accepts. Automaton has 1095 states and 1636 transitions. Word has length 373 [2025-02-05 18:11:50,932 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-02-05 18:11:50,932 INFO L471 AbstractCegarLoop]: Abstraction has 1095 states and 1636 transitions. [2025-02-05 18:11:50,933 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 2 states, 2 states have (on average 164.0) internal successors, (328), 2 states have internal predecessors, (328), 2 states have call successors, (10), 2 states have call predecessors, (10), 1 states have return successors, (10), 1 states have call predecessors, (10), 2 states have call successors, (10) [2025-02-05 18:11:50,933 INFO L276 IsEmpty]: Start isEmpty. Operand 1095 states and 1636 transitions. [2025-02-05 18:11:50,937 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 374 [2025-02-05 18:11:50,937 INFO L210 NwaCegarLoop]: Found error trace [2025-02-05 18:11:50,940 INFO L218 NwaCegarLoop]: trace histogram [10, 10, 10, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-02-05 18:11:50,953 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (2)] Forceful destruction successful, exit code 0 [2025-02-05 18:11:51,141 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 2 /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable0 [2025-02-05 18:11:51,141 INFO L396 AbstractCegarLoop]: === Iteration 2 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-02-05 18:11:51,143 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-02-05 18:11:51,143 INFO L85 PathProgramCache]: Analyzing trace with hash 2117794337, now seen corresponding path program 1 times [2025-02-05 18:11:51,143 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-02-05 18:11:51,143 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [846269400] [2025-02-05 18:11:51,143 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-02-05 18:11:51,144 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-02-05 18:11:51,229 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 373 statements into 1 equivalence classes. [2025-02-05 18:11:51,556 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 373 of 373 statements. [2025-02-05 18:11:51,556 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-02-05 18:11:51,556 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-02-05 18:11:52,913 INFO L134 CoverageAnalysis]: Checked inductivity of 180 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 180 trivial. 0 not checked. [2025-02-05 18:11:52,914 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-02-05 18:11:52,917 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [846269400] [2025-02-05 18:11:52,918 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [846269400] provided 1 perfect and 0 imperfect interpolant sequences [2025-02-05 18:11:52,918 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-02-05 18:11:52,918 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2025-02-05 18:11:52,918 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [295296565] [2025-02-05 18:11:52,918 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-02-05 18:11:52,919 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2025-02-05 18:11:52,919 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-02-05 18:11:52,920 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2025-02-05 18:11:52,920 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2025-02-05 18:11:52,920 INFO L87 Difference]: Start difference. First operand 1095 states and 1636 transitions. Second operand has 4 states, 4 states have (on average 81.5) internal successors, (326), 4 states have internal predecessors, (326), 1 states have call successors, (10), 1 states have call predecessors, (10), 1 states have return successors, (10), 1 states have call predecessors, (10), 1 states have call successors, (10) [2025-02-05 18:11:53,447 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-02-05 18:11:53,448 INFO L93 Difference]: Finished difference Result 1099 states and 1640 transitions. [2025-02-05 18:11:53,448 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2025-02-05 18:11:53,448 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 4 states have (on average 81.5) internal successors, (326), 4 states have internal predecessors, (326), 1 states have call successors, (10), 1 states have call predecessors, (10), 1 states have return successors, (10), 1 states have call predecessors, (10), 1 states have call successors, (10) Word has length 373 [2025-02-05 18:11:53,449 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-02-05 18:11:53,452 INFO L225 Difference]: With dead ends: 1099 [2025-02-05 18:11:53,452 INFO L226 Difference]: Without dead ends: 1097 [2025-02-05 18:11:53,453 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 4 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 2 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2025-02-05 18:11:53,453 INFO L435 NwaCegarLoop]: 1368 mSDtfsCounter, 0 mSDsluCounter, 2731 mSDsCounter, 0 mSdLazyCounter, 808 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.4s Time, 0 mProtectedPredicate, 0 mProtectedAction, 0 SdHoareTripleChecker+Valid, 4099 SdHoareTripleChecker+Invalid, 808 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 808 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.5s IncrementalHoareTripleChecker+Time [2025-02-05 18:11:53,454 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [0 Valid, 4099 Invalid, 808 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 808 Invalid, 0 Unknown, 0 Unchecked, 0.5s Time] [2025-02-05 18:11:53,455 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1097 states. [2025-02-05 18:11:53,466 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1097 to 1097. [2025-02-05 18:11:53,467 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 1097 states, 1085 states have (on average 1.4912442396313363) internal successors, (1618), 1085 states have internal predecessors, (1618), 10 states have call successors, (10), 1 states have call predecessors, (10), 1 states have return successors, (10), 10 states have call predecessors, (10), 10 states have call successors, (10) [2025-02-05 18:11:53,470 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1097 states to 1097 states and 1638 transitions. [2025-02-05 18:11:53,470 INFO L78 Accepts]: Start accepts. Automaton has 1097 states and 1638 transitions. Word has length 373 [2025-02-05 18:11:53,471 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-02-05 18:11:53,472 INFO L471 AbstractCegarLoop]: Abstraction has 1097 states and 1638 transitions. [2025-02-05 18:11:53,472 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 81.5) internal successors, (326), 4 states have internal predecessors, (326), 1 states have call successors, (10), 1 states have call predecessors, (10), 1 states have return successors, (10), 1 states have call predecessors, (10), 1 states have call successors, (10) [2025-02-05 18:11:53,472 INFO L276 IsEmpty]: Start isEmpty. Operand 1097 states and 1638 transitions. [2025-02-05 18:11:53,475 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 375 [2025-02-05 18:11:53,475 INFO L210 NwaCegarLoop]: Found error trace [2025-02-05 18:11:53,475 INFO L218 NwaCegarLoop]: trace histogram [10, 10, 10, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-02-05 18:11:53,476 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable1 [2025-02-05 18:11:53,476 INFO L396 AbstractCegarLoop]: === Iteration 3 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-02-05 18:11:53,476 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-02-05 18:11:53,476 INFO L85 PathProgramCache]: Analyzing trace with hash 1231794936, now seen corresponding path program 1 times [2025-02-05 18:11:53,476 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-02-05 18:11:53,477 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [586747749] [2025-02-05 18:11:53,477 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-02-05 18:11:53,477 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-02-05 18:11:53,527 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 374 statements into 1 equivalence classes. [2025-02-05 18:11:53,633 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 374 of 374 statements. [2025-02-05 18:11:53,634 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-02-05 18:11:53,634 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-02-05 18:11:54,224 INFO L134 CoverageAnalysis]: Checked inductivity of 180 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 180 trivial. 0 not checked. [2025-02-05 18:11:54,224 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-02-05 18:11:54,224 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [586747749] [2025-02-05 18:11:54,224 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [586747749] provided 1 perfect and 0 imperfect interpolant sequences [2025-02-05 18:11:54,224 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-02-05 18:11:54,226 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2025-02-05 18:11:54,226 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [96843235] [2025-02-05 18:11:54,226 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-02-05 18:11:54,226 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2025-02-05 18:11:54,226 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-02-05 18:11:54,227 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2025-02-05 18:11:54,227 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2025-02-05 18:11:54,227 INFO L87 Difference]: Start difference. First operand 1097 states and 1638 transitions. Second operand has 5 states, 5 states have (on average 65.4) internal successors, (327), 5 states have internal predecessors, (327), 2 states have call successors, (10), 1 states have call predecessors, (10), 1 states have return successors, (10), 2 states have call predecessors, (10), 2 states have call successors, (10) [2025-02-05 18:11:55,509 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-02-05 18:11:55,510 INFO L93 Difference]: Finished difference Result 2787 states and 4165 transitions. [2025-02-05 18:11:55,510 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2025-02-05 18:11:55,510 INFO L78 Accepts]: Start accepts. Automaton has has 5 states, 5 states have (on average 65.4) internal successors, (327), 5 states have internal predecessors, (327), 2 states have call successors, (10), 1 states have call predecessors, (10), 1 states have return successors, (10), 2 states have call predecessors, (10), 2 states have call successors, (10) Word has length 374 [2025-02-05 18:11:55,511 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-02-05 18:11:55,514 INFO L225 Difference]: With dead ends: 2787 [2025-02-05 18:11:55,514 INFO L226 Difference]: Without dead ends: 1097 [2025-02-05 18:11:55,515 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 8 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 6 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=22, Invalid=34, Unknown=0, NotChecked=0, Total=56 [2025-02-05 18:11:55,518 INFO L435 NwaCegarLoop]: 2107 mSDtfsCounter, 2387 mSDsluCounter, 3141 mSDsCounter, 0 mSdLazyCounter, 1673 mSolverCounterSat, 87 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 1.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 2393 SdHoareTripleChecker+Valid, 5248 SdHoareTripleChecker+Invalid, 1760 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 87 IncrementalHoareTripleChecker+Valid, 1673 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 1.2s IncrementalHoareTripleChecker+Time [2025-02-05 18:11:55,518 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [2393 Valid, 5248 Invalid, 1760 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [87 Valid, 1673 Invalid, 0 Unknown, 0 Unchecked, 1.2s Time] [2025-02-05 18:11:55,520 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1097 states. [2025-02-05 18:11:55,532 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1097 to 1097. [2025-02-05 18:11:55,534 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 1097 states, 1085 states have (on average 1.4903225806451612) internal successors, (1617), 1085 states have internal predecessors, (1617), 10 states have call successors, (10), 1 states have call predecessors, (10), 1 states have return successors, (10), 10 states have call predecessors, (10), 10 states have call successors, (10) [2025-02-05 18:11:55,537 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1097 states to 1097 states and 1637 transitions. [2025-02-05 18:11:55,537 INFO L78 Accepts]: Start accepts. Automaton has 1097 states and 1637 transitions. Word has length 374 [2025-02-05 18:11:55,538 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-02-05 18:11:55,538 INFO L471 AbstractCegarLoop]: Abstraction has 1097 states and 1637 transitions. [2025-02-05 18:11:55,538 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 65.4) internal successors, (327), 5 states have internal predecessors, (327), 2 states have call successors, (10), 1 states have call predecessors, (10), 1 states have return successors, (10), 2 states have call predecessors, (10), 2 states have call successors, (10) [2025-02-05 18:11:55,538 INFO L276 IsEmpty]: Start isEmpty. Operand 1097 states and 1637 transitions. [2025-02-05 18:11:55,540 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 376 [2025-02-05 18:11:55,540 INFO L210 NwaCegarLoop]: Found error trace [2025-02-05 18:11:55,541 INFO L218 NwaCegarLoop]: trace histogram [10, 10, 10, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-02-05 18:11:55,541 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable2 [2025-02-05 18:11:55,541 INFO L396 AbstractCegarLoop]: === Iteration 4 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-02-05 18:11:55,541 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-02-05 18:11:55,542 INFO L85 PathProgramCache]: Analyzing trace with hash 515443175, now seen corresponding path program 1 times [2025-02-05 18:11:55,542 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-02-05 18:11:55,542 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [663504254] [2025-02-05 18:11:55,542 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-02-05 18:11:55,542 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-02-05 18:11:55,592 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 375 statements into 1 equivalence classes. [2025-02-05 18:11:55,696 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 375 of 375 statements. [2025-02-05 18:11:55,697 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-02-05 18:11:55,697 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-02-05 18:11:56,288 INFO L134 CoverageAnalysis]: Checked inductivity of 180 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 180 trivial. 0 not checked. [2025-02-05 18:11:56,290 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-02-05 18:11:56,290 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [663504254] [2025-02-05 18:11:56,290 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [663504254] provided 1 perfect and 0 imperfect interpolant sequences [2025-02-05 18:11:56,290 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-02-05 18:11:56,290 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2025-02-05 18:11:56,290 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2057003658] [2025-02-05 18:11:56,290 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-02-05 18:11:56,291 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2025-02-05 18:11:56,291 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-02-05 18:11:56,292 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2025-02-05 18:11:56,292 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=8, Invalid=12, Unknown=0, NotChecked=0, Total=20 [2025-02-05 18:11:56,292 INFO L87 Difference]: Start difference. First operand 1097 states and 1637 transitions. Second operand has 5 states, 5 states have (on average 65.6) internal successors, (328), 5 states have internal predecessors, (328), 2 states have call successors, (10), 1 states have call predecessors, (10), 1 states have return successors, (10), 2 states have call predecessors, (10), 2 states have call successors, (10) [2025-02-05 18:11:57,068 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-02-05 18:11:57,068 INFO L93 Difference]: Finished difference Result 2028 states and 3026 transitions. [2025-02-05 18:11:57,068 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2025-02-05 18:11:57,069 INFO L78 Accepts]: Start accepts. Automaton has has 5 states, 5 states have (on average 65.6) internal successors, (328), 5 states have internal predecessors, (328), 2 states have call successors, (10), 1 states have call predecessors, (10), 1 states have return successors, (10), 2 states have call predecessors, (10), 2 states have call successors, (10) Word has length 375 [2025-02-05 18:11:57,069 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-02-05 18:11:57,072 INFO L225 Difference]: With dead ends: 2028 [2025-02-05 18:11:57,072 INFO L226 Difference]: Without dead ends: 1097 [2025-02-05 18:11:57,073 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 6 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 4 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=13, Invalid=17, Unknown=0, NotChecked=0, Total=30 [2025-02-05 18:11:57,074 INFO L435 NwaCegarLoop]: 1010 mSDtfsCounter, 2957 mSDsluCounter, 1012 mSDsCounter, 0 mSdLazyCounter, 1257 mSolverCounterSat, 1 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.6s Time, 0 mProtectedPredicate, 0 mProtectedAction, 2961 SdHoareTripleChecker+Valid, 2022 SdHoareTripleChecker+Invalid, 1258 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 1 IncrementalHoareTripleChecker+Valid, 1257 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.7s IncrementalHoareTripleChecker+Time [2025-02-05 18:11:57,075 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [2961 Valid, 2022 Invalid, 1258 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [1 Valid, 1257 Invalid, 0 Unknown, 0 Unchecked, 0.7s Time] [2025-02-05 18:11:57,076 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1097 states. [2025-02-05 18:11:57,087 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1097 to 1097. [2025-02-05 18:11:57,088 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 1097 states, 1085 states have (on average 1.489400921658986) internal successors, (1616), 1085 states have internal predecessors, (1616), 10 states have call successors, (10), 1 states have call predecessors, (10), 1 states have return successors, (10), 10 states have call predecessors, (10), 10 states have call successors, (10) [2025-02-05 18:11:57,092 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1097 states to 1097 states and 1636 transitions. [2025-02-05 18:11:57,092 INFO L78 Accepts]: Start accepts. Automaton has 1097 states and 1636 transitions. Word has length 375 [2025-02-05 18:11:57,093 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-02-05 18:11:57,093 INFO L471 AbstractCegarLoop]: Abstraction has 1097 states and 1636 transitions. [2025-02-05 18:11:57,093 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 65.6) internal successors, (328), 5 states have internal predecessors, (328), 2 states have call successors, (10), 1 states have call predecessors, (10), 1 states have return successors, (10), 2 states have call predecessors, (10), 2 states have call successors, (10) [2025-02-05 18:11:57,093 INFO L276 IsEmpty]: Start isEmpty. Operand 1097 states and 1636 transitions. [2025-02-05 18:11:57,095 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 377 [2025-02-05 18:11:57,095 INFO L210 NwaCegarLoop]: Found error trace [2025-02-05 18:11:57,096 INFO L218 NwaCegarLoop]: trace histogram [10, 10, 10, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-02-05 18:11:57,096 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable3 [2025-02-05 18:11:57,096 INFO L396 AbstractCegarLoop]: === Iteration 5 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-02-05 18:11:57,097 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-02-05 18:11:57,097 INFO L85 PathProgramCache]: Analyzing trace with hash -361141695, now seen corresponding path program 1 times [2025-02-05 18:11:57,097 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-02-05 18:11:57,097 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [232842531] [2025-02-05 18:11:57,097 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-02-05 18:11:57,098 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-02-05 18:11:57,158 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 376 statements into 1 equivalence classes. [2025-02-05 18:11:57,266 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 376 of 376 statements. [2025-02-05 18:11:57,266 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-02-05 18:11:57,266 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-02-05 18:11:57,665 INFO L134 CoverageAnalysis]: Checked inductivity of 180 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 180 trivial. 0 not checked. [2025-02-05 18:11:57,666 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-02-05 18:11:57,666 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [232842531] [2025-02-05 18:11:57,666 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [232842531] provided 1 perfect and 0 imperfect interpolant sequences [2025-02-05 18:11:57,666 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-02-05 18:11:57,666 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2025-02-05 18:11:57,666 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1541377008] [2025-02-05 18:11:57,666 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-02-05 18:11:57,667 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2025-02-05 18:11:57,667 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-02-05 18:11:57,667 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2025-02-05 18:11:57,667 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=8, Invalid=12, Unknown=0, NotChecked=0, Total=20 [2025-02-05 18:11:57,668 INFO L87 Difference]: Start difference. First operand 1097 states and 1636 transitions. Second operand has 5 states, 5 states have (on average 65.8) internal successors, (329), 5 states have internal predecessors, (329), 2 states have call successors, (10), 1 states have call predecessors, (10), 1 states have return successors, (10), 2 states have call predecessors, (10), 2 states have call successors, (10) [2025-02-05 18:11:58,530 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-02-05 18:11:58,531 INFO L93 Difference]: Finished difference Result 2028 states and 3024 transitions. [2025-02-05 18:11:58,531 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2025-02-05 18:11:58,531 INFO L78 Accepts]: Start accepts. Automaton has has 5 states, 5 states have (on average 65.8) internal successors, (329), 5 states have internal predecessors, (329), 2 states have call successors, (10), 1 states have call predecessors, (10), 1 states have return successors, (10), 2 states have call predecessors, (10), 2 states have call successors, (10) Word has length 376 [2025-02-05 18:11:58,532 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-02-05 18:11:58,534 INFO L225 Difference]: With dead ends: 2028 [2025-02-05 18:11:58,535 INFO L226 Difference]: Without dead ends: 1097 [2025-02-05 18:11:58,535 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 6 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 4 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=13, Invalid=17, Unknown=0, NotChecked=0, Total=30 [2025-02-05 18:11:58,536 INFO L435 NwaCegarLoop]: 1010 mSDtfsCounter, 2877 mSDsluCounter, 1012 mSDsCounter, 0 mSdLazyCounter, 1255 mSolverCounterSat, 1 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.7s Time, 0 mProtectedPredicate, 0 mProtectedAction, 2881 SdHoareTripleChecker+Valid, 2022 SdHoareTripleChecker+Invalid, 1256 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 1 IncrementalHoareTripleChecker+Valid, 1255 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.8s IncrementalHoareTripleChecker+Time [2025-02-05 18:11:58,536 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [2881 Valid, 2022 Invalid, 1256 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [1 Valid, 1255 Invalid, 0 Unknown, 0 Unchecked, 0.8s Time] [2025-02-05 18:11:58,537 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1097 states. [2025-02-05 18:11:58,547 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1097 to 1097. [2025-02-05 18:11:58,548 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 1097 states, 1085 states have (on average 1.4884792626728112) internal successors, (1615), 1085 states have internal predecessors, (1615), 10 states have call successors, (10), 1 states have call predecessors, (10), 1 states have return successors, (10), 10 states have call predecessors, (10), 10 states have call successors, (10) [2025-02-05 18:11:58,550 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1097 states to 1097 states and 1635 transitions. [2025-02-05 18:11:58,551 INFO L78 Accepts]: Start accepts. Automaton has 1097 states and 1635 transitions. Word has length 376 [2025-02-05 18:11:58,551 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-02-05 18:11:58,551 INFO L471 AbstractCegarLoop]: Abstraction has 1097 states and 1635 transitions. [2025-02-05 18:11:58,551 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 65.8) internal successors, (329), 5 states have internal predecessors, (329), 2 states have call successors, (10), 1 states have call predecessors, (10), 1 states have return successors, (10), 2 states have call predecessors, (10), 2 states have call successors, (10) [2025-02-05 18:11:58,551 INFO L276 IsEmpty]: Start isEmpty. Operand 1097 states and 1635 transitions. [2025-02-05 18:11:58,553 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 378 [2025-02-05 18:11:58,553 INFO L210 NwaCegarLoop]: Found error trace [2025-02-05 18:11:58,553 INFO L218 NwaCegarLoop]: trace histogram [10, 10, 10, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-02-05 18:11:58,553 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable4 [2025-02-05 18:11:58,553 INFO L396 AbstractCegarLoop]: === Iteration 6 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-02-05 18:11:58,554 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-02-05 18:11:58,554 INFO L85 PathProgramCache]: Analyzing trace with hash -2017417658, now seen corresponding path program 1 times [2025-02-05 18:11:58,554 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-02-05 18:11:58,554 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [222310032] [2025-02-05 18:11:58,554 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-02-05 18:11:58,554 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-02-05 18:11:58,604 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 377 statements into 1 equivalence classes. [2025-02-05 18:11:58,681 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 377 of 377 statements. [2025-02-05 18:11:58,681 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-02-05 18:11:58,681 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-02-05 18:11:59,255 INFO L134 CoverageAnalysis]: Checked inductivity of 180 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 180 trivial. 0 not checked. [2025-02-05 18:11:59,255 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-02-05 18:11:59,255 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [222310032] [2025-02-05 18:11:59,255 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [222310032] provided 1 perfect and 0 imperfect interpolant sequences [2025-02-05 18:11:59,255 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-02-05 18:11:59,255 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2025-02-05 18:11:59,255 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [143280881] [2025-02-05 18:11:59,256 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-02-05 18:11:59,256 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2025-02-05 18:11:59,256 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-02-05 18:11:59,257 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2025-02-05 18:11:59,257 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=8, Invalid=12, Unknown=0, NotChecked=0, Total=20 [2025-02-05 18:11:59,257 INFO L87 Difference]: Start difference. First operand 1097 states and 1635 transitions. Second operand has 5 states, 5 states have (on average 66.0) internal successors, (330), 5 states have internal predecessors, (330), 2 states have call successors, (10), 1 states have call predecessors, (10), 1 states have return successors, (10), 2 states have call predecessors, (10), 2 states have call successors, (10) [2025-02-05 18:12:00,059 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-02-05 18:12:00,059 INFO L93 Difference]: Finished difference Result 2028 states and 3022 transitions. [2025-02-05 18:12:00,060 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2025-02-05 18:12:00,060 INFO L78 Accepts]: Start accepts. Automaton has has 5 states, 5 states have (on average 66.0) internal successors, (330), 5 states have internal predecessors, (330), 2 states have call successors, (10), 1 states have call predecessors, (10), 1 states have return successors, (10), 2 states have call predecessors, (10), 2 states have call successors, (10) Word has length 377 [2025-02-05 18:12:00,061 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-02-05 18:12:00,065 INFO L225 Difference]: With dead ends: 2028 [2025-02-05 18:12:00,065 INFO L226 Difference]: Without dead ends: 1097 [2025-02-05 18:12:00,066 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 6 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 4 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=13, Invalid=17, Unknown=0, NotChecked=0, Total=30 [2025-02-05 18:12:00,067 INFO L435 NwaCegarLoop]: 1010 mSDtfsCounter, 1463 mSDsluCounter, 1026 mSDsCounter, 0 mSdLazyCounter, 1253 mSolverCounterSat, 1 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.6s Time, 0 mProtectedPredicate, 0 mProtectedAction, 1467 SdHoareTripleChecker+Valid, 2036 SdHoareTripleChecker+Invalid, 1254 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 1 IncrementalHoareTripleChecker+Valid, 1253 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.8s IncrementalHoareTripleChecker+Time [2025-02-05 18:12:00,067 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [1467 Valid, 2036 Invalid, 1254 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [1 Valid, 1253 Invalid, 0 Unknown, 0 Unchecked, 0.8s Time] [2025-02-05 18:12:00,069 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1097 states. [2025-02-05 18:12:00,080 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1097 to 1097. [2025-02-05 18:12:00,081 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 1097 states, 1085 states have (on average 1.487557603686636) internal successors, (1614), 1085 states have internal predecessors, (1614), 10 states have call successors, (10), 1 states have call predecessors, (10), 1 states have return successors, (10), 10 states have call predecessors, (10), 10 states have call successors, (10) [2025-02-05 18:12:00,085 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1097 states to 1097 states and 1634 transitions. [2025-02-05 18:12:00,085 INFO L78 Accepts]: Start accepts. Automaton has 1097 states and 1634 transitions. Word has length 377 [2025-02-05 18:12:00,085 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-02-05 18:12:00,085 INFO L471 AbstractCegarLoop]: Abstraction has 1097 states and 1634 transitions. [2025-02-05 18:12:00,086 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 66.0) internal successors, (330), 5 states have internal predecessors, (330), 2 states have call successors, (10), 1 states have call predecessors, (10), 1 states have return successors, (10), 2 states have call predecessors, (10), 2 states have call successors, (10) [2025-02-05 18:12:00,086 INFO L276 IsEmpty]: Start isEmpty. Operand 1097 states and 1634 transitions. [2025-02-05 18:12:00,088 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 379 [2025-02-05 18:12:00,088 INFO L210 NwaCegarLoop]: Found error trace [2025-02-05 18:12:00,089 INFO L218 NwaCegarLoop]: trace histogram [10, 10, 10, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-02-05 18:12:00,089 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable5 [2025-02-05 18:12:00,089 INFO L396 AbstractCegarLoop]: === Iteration 7 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-02-05 18:12:00,089 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-02-05 18:12:00,090 INFO L85 PathProgramCache]: Analyzing trace with hash -1201882304, now seen corresponding path program 1 times [2025-02-05 18:12:00,090 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-02-05 18:12:00,090 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1574863580] [2025-02-05 18:12:00,090 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-02-05 18:12:00,090 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-02-05 18:12:00,142 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 378 statements into 1 equivalence classes. [2025-02-05 18:12:00,206 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 378 of 378 statements. [2025-02-05 18:12:00,206 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-02-05 18:12:00,206 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-02-05 18:12:00,513 INFO L134 CoverageAnalysis]: Checked inductivity of 180 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 180 trivial. 0 not checked. [2025-02-05 18:12:00,514 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-02-05 18:12:00,514 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1574863580] [2025-02-05 18:12:00,514 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1574863580] provided 1 perfect and 0 imperfect interpolant sequences [2025-02-05 18:12:00,514 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-02-05 18:12:00,514 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2025-02-05 18:12:00,514 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [54771530] [2025-02-05 18:12:00,514 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-02-05 18:12:00,514 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2025-02-05 18:12:00,514 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-02-05 18:12:00,515 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2025-02-05 18:12:00,515 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2025-02-05 18:12:00,515 INFO L87 Difference]: Start difference. First operand 1097 states and 1634 transitions. Second operand has 4 states, 4 states have (on average 82.75) internal successors, (331), 4 states have internal predecessors, (331), 1 states have call successors, (10), 1 states have call predecessors, (10), 1 states have return successors, (10), 1 states have call predecessors, (10), 1 states have call successors, (10) [2025-02-05 18:12:00,896 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-02-05 18:12:00,896 INFO L93 Difference]: Finished difference Result 2030 states and 3023 transitions. [2025-02-05 18:12:00,897 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2025-02-05 18:12:00,898 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 4 states have (on average 82.75) internal successors, (331), 4 states have internal predecessors, (331), 1 states have call successors, (10), 1 states have call predecessors, (10), 1 states have return successors, (10), 1 states have call predecessors, (10), 1 states have call successors, (10) Word has length 378 [2025-02-05 18:12:00,898 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-02-05 18:12:00,901 INFO L225 Difference]: With dead ends: 2030 [2025-02-05 18:12:00,901 INFO L226 Difference]: Without dead ends: 1099 [2025-02-05 18:12:00,902 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 5 GetRequests, 3 SyntacticMatches, 0 SemanticMatches, 2 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2025-02-05 18:12:00,903 INFO L435 NwaCegarLoop]: 1364 mSDtfsCounter, 0 mSDsluCounter, 2720 mSDsCounter, 0 mSdLazyCounter, 811 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.3s Time, 0 mProtectedPredicate, 0 mProtectedAction, 0 SdHoareTripleChecker+Valid, 4084 SdHoareTripleChecker+Invalid, 811 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 811 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.4s IncrementalHoareTripleChecker+Time [2025-02-05 18:12:00,903 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [0 Valid, 4084 Invalid, 811 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 811 Invalid, 0 Unknown, 0 Unchecked, 0.4s Time] [2025-02-05 18:12:00,905 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1099 states. [2025-02-05 18:12:00,915 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1099 to 1099. [2025-02-05 18:12:00,917 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 1099 states, 1087 states have (on average 1.486660533578657) internal successors, (1616), 1087 states have internal predecessors, (1616), 10 states have call successors, (10), 1 states have call predecessors, (10), 1 states have return successors, (10), 10 states have call predecessors, (10), 10 states have call successors, (10) [2025-02-05 18:12:00,919 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1099 states to 1099 states and 1636 transitions. [2025-02-05 18:12:00,919 INFO L78 Accepts]: Start accepts. Automaton has 1099 states and 1636 transitions. Word has length 378 [2025-02-05 18:12:00,919 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-02-05 18:12:00,919 INFO L471 AbstractCegarLoop]: Abstraction has 1099 states and 1636 transitions. [2025-02-05 18:12:00,920 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 82.75) internal successors, (331), 4 states have internal predecessors, (331), 1 states have call successors, (10), 1 states have call predecessors, (10), 1 states have return successors, (10), 1 states have call predecessors, (10), 1 states have call successors, (10) [2025-02-05 18:12:00,920 INFO L276 IsEmpty]: Start isEmpty. Operand 1099 states and 1636 transitions. [2025-02-05 18:12:00,921 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 380 [2025-02-05 18:12:00,921 INFO L210 NwaCegarLoop]: Found error trace [2025-02-05 18:12:00,922 INFO L218 NwaCegarLoop]: trace histogram [10, 10, 10, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-02-05 18:12:00,922 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable6 [2025-02-05 18:12:00,922 INFO L396 AbstractCegarLoop]: === Iteration 8 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-02-05 18:12:00,922 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-02-05 18:12:00,922 INFO L85 PathProgramCache]: Analyzing trace with hash -967103052, now seen corresponding path program 1 times [2025-02-05 18:12:00,922 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-02-05 18:12:00,922 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1149205967] [2025-02-05 18:12:00,922 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-02-05 18:12:00,923 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-02-05 18:12:00,974 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 379 statements into 1 equivalence classes. [2025-02-05 18:12:01,091 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 379 of 379 statements. [2025-02-05 18:12:01,091 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-02-05 18:12:01,091 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-02-05 18:12:01,711 INFO L134 CoverageAnalysis]: Checked inductivity of 180 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 180 trivial. 0 not checked. [2025-02-05 18:12:01,711 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-02-05 18:12:01,712 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1149205967] [2025-02-05 18:12:01,712 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1149205967] provided 1 perfect and 0 imperfect interpolant sequences [2025-02-05 18:12:01,712 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-02-05 18:12:01,712 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2025-02-05 18:12:01,712 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1265107595] [2025-02-05 18:12:01,712 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-02-05 18:12:01,712 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2025-02-05 18:12:01,712 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-02-05 18:12:01,715 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2025-02-05 18:12:01,715 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2025-02-05 18:12:01,715 INFO L87 Difference]: Start difference. First operand 1099 states and 1636 transitions. Second operand has 4 states, 4 states have (on average 83.0) internal successors, (332), 4 states have internal predecessors, (332), 1 states have call successors, (10), 1 states have call predecessors, (10), 1 states have return successors, (10), 1 states have call predecessors, (10), 1 states have call successors, (10) [2025-02-05 18:12:02,137 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-02-05 18:12:02,137 INFO L93 Difference]: Finished difference Result 2032 states and 3024 transitions. [2025-02-05 18:12:02,137 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2025-02-05 18:12:02,138 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 4 states have (on average 83.0) internal successors, (332), 4 states have internal predecessors, (332), 1 states have call successors, (10), 1 states have call predecessors, (10), 1 states have return successors, (10), 1 states have call predecessors, (10), 1 states have call successors, (10) Word has length 379 [2025-02-05 18:12:02,138 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-02-05 18:12:02,141 INFO L225 Difference]: With dead ends: 2032 [2025-02-05 18:12:02,141 INFO L226 Difference]: Without dead ends: 1099 [2025-02-05 18:12:02,142 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 7 GetRequests, 4 SyntacticMatches, 0 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=9, Invalid=11, Unknown=0, NotChecked=0, Total=20 [2025-02-05 18:12:02,142 INFO L435 NwaCegarLoop]: 1295 mSDtfsCounter, 1370 mSDsluCounter, 1297 mSDsCounter, 0 mSdLazyCounter, 679 mSolverCounterSat, 1 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.3s Time, 0 mProtectedPredicate, 0 mProtectedAction, 1370 SdHoareTripleChecker+Valid, 2592 SdHoareTripleChecker+Invalid, 680 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 1 IncrementalHoareTripleChecker+Valid, 679 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.4s IncrementalHoareTripleChecker+Time [2025-02-05 18:12:02,143 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [1370 Valid, 2592 Invalid, 680 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [1 Valid, 679 Invalid, 0 Unknown, 0 Unchecked, 0.4s Time] [2025-02-05 18:12:02,144 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1099 states. [2025-02-05 18:12:02,153 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1099 to 1099. [2025-02-05 18:12:02,154 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 1099 states, 1087 states have (on average 1.484820607175713) internal successors, (1614), 1087 states have internal predecessors, (1614), 10 states have call successors, (10), 1 states have call predecessors, (10), 1 states have return successors, (10), 10 states have call predecessors, (10), 10 states have call successors, (10) [2025-02-05 18:12:02,156 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1099 states to 1099 states and 1634 transitions. [2025-02-05 18:12:02,157 INFO L78 Accepts]: Start accepts. Automaton has 1099 states and 1634 transitions. Word has length 379 [2025-02-05 18:12:02,157 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-02-05 18:12:02,157 INFO L471 AbstractCegarLoop]: Abstraction has 1099 states and 1634 transitions. [2025-02-05 18:12:02,157 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 83.0) internal successors, (332), 4 states have internal predecessors, (332), 1 states have call successors, (10), 1 states have call predecessors, (10), 1 states have return successors, (10), 1 states have call predecessors, (10), 1 states have call successors, (10) [2025-02-05 18:12:02,157 INFO L276 IsEmpty]: Start isEmpty. Operand 1099 states and 1634 transitions. [2025-02-05 18:12:02,159 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 382 [2025-02-05 18:12:02,159 INFO L210 NwaCegarLoop]: Found error trace [2025-02-05 18:12:02,159 INFO L218 NwaCegarLoop]: trace histogram [10, 10, 10, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-02-05 18:12:02,160 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable7 [2025-02-05 18:12:02,160 INFO L396 AbstractCegarLoop]: === Iteration 9 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-02-05 18:12:02,160 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-02-05 18:12:02,160 INFO L85 PathProgramCache]: Analyzing trace with hash 416730609, now seen corresponding path program 1 times [2025-02-05 18:12:02,160 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-02-05 18:12:02,160 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [69275671] [2025-02-05 18:12:02,160 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-02-05 18:12:02,161 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-02-05 18:12:02,224 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 381 statements into 1 equivalence classes. [2025-02-05 18:12:02,291 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 381 of 381 statements. [2025-02-05 18:12:02,291 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-02-05 18:12:02,291 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-02-05 18:12:02,733 INFO L134 CoverageAnalysis]: Checked inductivity of 180 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 180 trivial. 0 not checked. [2025-02-05 18:12:02,734 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-02-05 18:12:02,734 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [69275671] [2025-02-05 18:12:02,734 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [69275671] provided 1 perfect and 0 imperfect interpolant sequences [2025-02-05 18:12:02,734 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-02-05 18:12:02,734 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2025-02-05 18:12:02,734 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1355452512] [2025-02-05 18:12:02,734 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-02-05 18:12:02,734 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2025-02-05 18:12:02,734 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-02-05 18:12:02,735 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2025-02-05 18:12:02,735 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2025-02-05 18:12:02,735 INFO L87 Difference]: Start difference. First operand 1099 states and 1634 transitions. Second operand has 5 states, 5 states have (on average 66.8) internal successors, (334), 5 states have internal predecessors, (334), 1 states have call successors, (10), 1 states have call predecessors, (10), 1 states have return successors, (10), 1 states have call predecessors, (10), 1 states have call successors, (10) [2025-02-05 18:12:03,359 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-02-05 18:12:03,359 INFO L93 Difference]: Finished difference Result 2102 states and 3123 transitions. [2025-02-05 18:12:03,360 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2025-02-05 18:12:03,360 INFO L78 Accepts]: Start accepts. Automaton has has 5 states, 5 states have (on average 66.8) internal successors, (334), 5 states have internal predecessors, (334), 1 states have call successors, (10), 1 states have call predecessors, (10), 1 states have return successors, (10), 1 states have call predecessors, (10), 1 states have call successors, (10) Word has length 381 [2025-02-05 18:12:03,361 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-02-05 18:12:03,364 INFO L225 Difference]: With dead ends: 2102 [2025-02-05 18:12:03,364 INFO L226 Difference]: Without dead ends: 1099 [2025-02-05 18:12:03,365 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 7 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 5 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=15, Invalid=27, Unknown=0, NotChecked=0, Total=42 [2025-02-05 18:12:03,366 INFO L435 NwaCegarLoop]: 1351 mSDtfsCounter, 1571 mSDsluCounter, 2657 mSDsCounter, 0 mSdLazyCounter, 892 mSolverCounterSat, 2 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.5s Time, 0 mProtectedPredicate, 0 mProtectedAction, 1571 SdHoareTripleChecker+Valid, 4008 SdHoareTripleChecker+Invalid, 894 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 2 IncrementalHoareTripleChecker+Valid, 892 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.6s IncrementalHoareTripleChecker+Time [2025-02-05 18:12:03,366 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [1571 Valid, 4008 Invalid, 894 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [2 Valid, 892 Invalid, 0 Unknown, 0 Unchecked, 0.6s Time] [2025-02-05 18:12:03,368 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1099 states. [2025-02-05 18:12:03,378 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1099 to 1099. [2025-02-05 18:12:03,379 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 1099 states, 1087 states have (on average 1.483900643974241) internal successors, (1613), 1087 states have internal predecessors, (1613), 10 states have call successors, (10), 1 states have call predecessors, (10), 1 states have return successors, (10), 10 states have call predecessors, (10), 10 states have call successors, (10) [2025-02-05 18:12:03,382 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1099 states to 1099 states and 1633 transitions. [2025-02-05 18:12:03,382 INFO L78 Accepts]: Start accepts. Automaton has 1099 states and 1633 transitions. Word has length 381 [2025-02-05 18:12:03,382 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-02-05 18:12:03,382 INFO L471 AbstractCegarLoop]: Abstraction has 1099 states and 1633 transitions. [2025-02-05 18:12:03,382 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 66.8) internal successors, (334), 5 states have internal predecessors, (334), 1 states have call successors, (10), 1 states have call predecessors, (10), 1 states have return successors, (10), 1 states have call predecessors, (10), 1 states have call successors, (10) [2025-02-05 18:12:03,383 INFO L276 IsEmpty]: Start isEmpty. Operand 1099 states and 1633 transitions. [2025-02-05 18:12:03,384 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 383 [2025-02-05 18:12:03,384 INFO L210 NwaCegarLoop]: Found error trace [2025-02-05 18:12:03,385 INFO L218 NwaCegarLoop]: trace histogram [10, 10, 10, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-02-05 18:12:03,385 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable8 [2025-02-05 18:12:03,385 INFO L396 AbstractCegarLoop]: === Iteration 10 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-02-05 18:12:03,388 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-02-05 18:12:03,388 INFO L85 PathProgramCache]: Analyzing trace with hash 1622929638, now seen corresponding path program 1 times [2025-02-05 18:12:03,388 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-02-05 18:12:03,388 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1329590476] [2025-02-05 18:12:03,388 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-02-05 18:12:03,388 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-02-05 18:12:03,475 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 382 statements into 1 equivalence classes. [2025-02-05 18:12:03,537 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 382 of 382 statements. [2025-02-05 18:12:03,538 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-02-05 18:12:03,538 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-02-05 18:12:03,846 INFO L134 CoverageAnalysis]: Checked inductivity of 180 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 180 trivial. 0 not checked. [2025-02-05 18:12:03,846 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-02-05 18:12:03,847 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1329590476] [2025-02-05 18:12:03,847 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1329590476] provided 1 perfect and 0 imperfect interpolant sequences [2025-02-05 18:12:03,847 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-02-05 18:12:03,847 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2025-02-05 18:12:03,847 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1675631588] [2025-02-05 18:12:03,847 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-02-05 18:12:03,847 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2025-02-05 18:12:03,848 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-02-05 18:12:03,848 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2025-02-05 18:12:03,848 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=8, Invalid=12, Unknown=0, NotChecked=0, Total=20 [2025-02-05 18:12:03,849 INFO L87 Difference]: Start difference. First operand 1099 states and 1633 transitions. Second operand has 5 states, 5 states have (on average 67.0) internal successors, (335), 5 states have internal predecessors, (335), 1 states have call successors, (10), 1 states have call predecessors, (10), 1 states have return successors, (10), 1 states have call predecessors, (10), 1 states have call successors, (10) [2025-02-05 18:12:04,273 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-02-05 18:12:04,274 INFO L93 Difference]: Finished difference Result 2032 states and 3018 transitions. [2025-02-05 18:12:04,274 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2025-02-05 18:12:04,274 INFO L78 Accepts]: Start accepts. Automaton has has 5 states, 5 states have (on average 67.0) internal successors, (335), 5 states have internal predecessors, (335), 1 states have call successors, (10), 1 states have call predecessors, (10), 1 states have return successors, (10), 1 states have call predecessors, (10), 1 states have call successors, (10) Word has length 382 [2025-02-05 18:12:04,275 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-02-05 18:12:04,277 INFO L225 Difference]: With dead ends: 2032 [2025-02-05 18:12:04,277 INFO L226 Difference]: Without dead ends: 1099 [2025-02-05 18:12:04,278 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 6 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 4 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=13, Invalid=17, Unknown=0, NotChecked=0, Total=30 [2025-02-05 18:12:04,279 INFO L435 NwaCegarLoop]: 1296 mSDtfsCounter, 3005 mSDsluCounter, 1298 mSDsCounter, 0 mSdLazyCounter, 673 mSolverCounterSat, 1 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.3s Time, 0 mProtectedPredicate, 0 mProtectedAction, 3015 SdHoareTripleChecker+Valid, 2594 SdHoareTripleChecker+Invalid, 674 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 1 IncrementalHoareTripleChecker+Valid, 673 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.4s IncrementalHoareTripleChecker+Time [2025-02-05 18:12:04,279 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [3015 Valid, 2594 Invalid, 674 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [1 Valid, 673 Invalid, 0 Unknown, 0 Unchecked, 0.4s Time] [2025-02-05 18:12:04,281 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1099 states. [2025-02-05 18:12:04,314 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1099 to 1099. [2025-02-05 18:12:04,315 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 1099 states, 1087 states have (on average 1.482980680772769) internal successors, (1612), 1087 states have internal predecessors, (1612), 10 states have call successors, (10), 1 states have call predecessors, (10), 1 states have return successors, (10), 10 states have call predecessors, (10), 10 states have call successors, (10) [2025-02-05 18:12:04,317 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1099 states to 1099 states and 1632 transitions. [2025-02-05 18:12:04,317 INFO L78 Accepts]: Start accepts. Automaton has 1099 states and 1632 transitions. Word has length 382 [2025-02-05 18:12:04,317 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-02-05 18:12:04,317 INFO L471 AbstractCegarLoop]: Abstraction has 1099 states and 1632 transitions. [2025-02-05 18:12:04,318 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 67.0) internal successors, (335), 5 states have internal predecessors, (335), 1 states have call successors, (10), 1 states have call predecessors, (10), 1 states have return successors, (10), 1 states have call predecessors, (10), 1 states have call successors, (10) [2025-02-05 18:12:04,318 INFO L276 IsEmpty]: Start isEmpty. Operand 1099 states and 1632 transitions. [2025-02-05 18:12:04,319 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 384 [2025-02-05 18:12:04,319 INFO L210 NwaCegarLoop]: Found error trace [2025-02-05 18:12:04,320 INFO L218 NwaCegarLoop]: trace histogram [10, 10, 10, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-02-05 18:12:04,320 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable9 [2025-02-05 18:12:04,320 INFO L396 AbstractCegarLoop]: === Iteration 11 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-02-05 18:12:04,320 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-02-05 18:12:04,321 INFO L85 PathProgramCache]: Analyzing trace with hash 1229055340, now seen corresponding path program 1 times [2025-02-05 18:12:04,321 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-02-05 18:12:04,321 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [733223355] [2025-02-05 18:12:04,321 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-02-05 18:12:04,321 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-02-05 18:12:04,369 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 383 statements into 1 equivalence classes. [2025-02-05 18:12:04,430 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 383 of 383 statements. [2025-02-05 18:12:04,430 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-02-05 18:12:04,430 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-02-05 18:12:04,968 INFO L134 CoverageAnalysis]: Checked inductivity of 180 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 180 trivial. 0 not checked. [2025-02-05 18:12:04,968 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-02-05 18:12:04,968 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [733223355] [2025-02-05 18:12:04,969 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [733223355] provided 1 perfect and 0 imperfect interpolant sequences [2025-02-05 18:12:04,969 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-02-05 18:12:04,969 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2025-02-05 18:12:04,969 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1550752879] [2025-02-05 18:12:04,969 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-02-05 18:12:04,970 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2025-02-05 18:12:04,970 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-02-05 18:12:04,970 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2025-02-05 18:12:04,970 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=8, Invalid=12, Unknown=0, NotChecked=0, Total=20 [2025-02-05 18:12:04,971 INFO L87 Difference]: Start difference. First operand 1099 states and 1632 transitions. Second operand has 5 states, 5 states have (on average 67.2) internal successors, (336), 5 states have internal predecessors, (336), 1 states have call successors, (10), 1 states have call predecessors, (10), 1 states have return successors, (10), 1 states have call predecessors, (10), 1 states have call successors, (10) [2025-02-05 18:12:05,429 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-02-05 18:12:05,429 INFO L93 Difference]: Finished difference Result 2032 states and 3016 transitions. [2025-02-05 18:12:05,429 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2025-02-05 18:12:05,430 INFO L78 Accepts]: Start accepts. Automaton has has 5 states, 5 states have (on average 67.2) internal successors, (336), 5 states have internal predecessors, (336), 1 states have call successors, (10), 1 states have call predecessors, (10), 1 states have return successors, (10), 1 states have call predecessors, (10), 1 states have call successors, (10) Word has length 383 [2025-02-05 18:12:05,430 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-02-05 18:12:05,433 INFO L225 Difference]: With dead ends: 2032 [2025-02-05 18:12:05,433 INFO L226 Difference]: Without dead ends: 1099 [2025-02-05 18:12:05,434 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 6 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 4 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=13, Invalid=17, Unknown=0, NotChecked=0, Total=30 [2025-02-05 18:12:05,435 INFO L435 NwaCegarLoop]: 1296 mSDtfsCounter, 2919 mSDsluCounter, 1298 mSDsCounter, 0 mSdLazyCounter, 671 mSolverCounterSat, 1 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.4s Time, 0 mProtectedPredicate, 0 mProtectedAction, 2929 SdHoareTripleChecker+Valid, 2594 SdHoareTripleChecker+Invalid, 672 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 1 IncrementalHoareTripleChecker+Valid, 671 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.4s IncrementalHoareTripleChecker+Time [2025-02-05 18:12:05,435 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [2929 Valid, 2594 Invalid, 672 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [1 Valid, 671 Invalid, 0 Unknown, 0 Unchecked, 0.4s Time] [2025-02-05 18:12:05,436 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1099 states. [2025-02-05 18:12:05,445 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1099 to 1099. [2025-02-05 18:12:05,446 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 1099 states, 1087 states have (on average 1.4820607175712972) internal successors, (1611), 1087 states have internal predecessors, (1611), 10 states have call successors, (10), 1 states have call predecessors, (10), 1 states have return successors, (10), 10 states have call predecessors, (10), 10 states have call successors, (10) [2025-02-05 18:12:05,448 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1099 states to 1099 states and 1631 transitions. [2025-02-05 18:12:05,448 INFO L78 Accepts]: Start accepts. Automaton has 1099 states and 1631 transitions. Word has length 383 [2025-02-05 18:12:05,449 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-02-05 18:12:05,449 INFO L471 AbstractCegarLoop]: Abstraction has 1099 states and 1631 transitions. [2025-02-05 18:12:05,449 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 67.2) internal successors, (336), 5 states have internal predecessors, (336), 1 states have call successors, (10), 1 states have call predecessors, (10), 1 states have return successors, (10), 1 states have call predecessors, (10), 1 states have call successors, (10) [2025-02-05 18:12:05,449 INFO L276 IsEmpty]: Start isEmpty. Operand 1099 states and 1631 transitions. [2025-02-05 18:12:05,451 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 385 [2025-02-05 18:12:05,451 INFO L210 NwaCegarLoop]: Found error trace [2025-02-05 18:12:05,451 INFO L218 NwaCegarLoop]: trace histogram [10, 10, 10, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-02-05 18:12:05,451 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable10 [2025-02-05 18:12:05,451 INFO L396 AbstractCegarLoop]: === Iteration 12 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-02-05 18:12:05,452 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-02-05 18:12:05,452 INFO L85 PathProgramCache]: Analyzing trace with hash -1873401055, now seen corresponding path program 1 times [2025-02-05 18:12:05,452 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-02-05 18:12:05,452 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1516068202] [2025-02-05 18:12:05,452 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-02-05 18:12:05,452 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-02-05 18:12:05,506 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 384 statements into 1 equivalence classes. [2025-02-05 18:12:05,567 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 384 of 384 statements. [2025-02-05 18:12:05,567 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-02-05 18:12:05,567 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-02-05 18:12:05,864 INFO L134 CoverageAnalysis]: Checked inductivity of 180 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 180 trivial. 0 not checked. [2025-02-05 18:12:05,865 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-02-05 18:12:05,865 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1516068202] [2025-02-05 18:12:05,865 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1516068202] provided 1 perfect and 0 imperfect interpolant sequences [2025-02-05 18:12:05,865 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-02-05 18:12:05,865 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2025-02-05 18:12:05,865 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [652994078] [2025-02-05 18:12:05,865 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-02-05 18:12:05,866 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2025-02-05 18:12:05,866 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-02-05 18:12:05,867 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2025-02-05 18:12:05,867 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=8, Invalid=12, Unknown=0, NotChecked=0, Total=20 [2025-02-05 18:12:05,867 INFO L87 Difference]: Start difference. First operand 1099 states and 1631 transitions. Second operand has 5 states, 5 states have (on average 67.4) internal successors, (337), 5 states have internal predecessors, (337), 1 states have call successors, (10), 1 states have call predecessors, (10), 1 states have return successors, (10), 1 states have call predecessors, (10), 1 states have call successors, (10) [2025-02-05 18:12:06,293 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-02-05 18:12:06,293 INFO L93 Difference]: Finished difference Result 2032 states and 3014 transitions. [2025-02-05 18:12:06,293 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2025-02-05 18:12:06,294 INFO L78 Accepts]: Start accepts. Automaton has has 5 states, 5 states have (on average 67.4) internal successors, (337), 5 states have internal predecessors, (337), 1 states have call successors, (10), 1 states have call predecessors, (10), 1 states have return successors, (10), 1 states have call predecessors, (10), 1 states have call successors, (10) Word has length 384 [2025-02-05 18:12:06,294 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-02-05 18:12:06,296 INFO L225 Difference]: With dead ends: 2032 [2025-02-05 18:12:06,296 INFO L226 Difference]: Without dead ends: 1099 [2025-02-05 18:12:06,297 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 6 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 4 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=13, Invalid=17, Unknown=0, NotChecked=0, Total=30 [2025-02-05 18:12:06,298 INFO L435 NwaCegarLoop]: 1295 mSDtfsCounter, 2841 mSDsluCounter, 1297 mSDsCounter, 0 mSdLazyCounter, 671 mSolverCounterSat, 1 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.3s Time, 0 mProtectedPredicate, 0 mProtectedAction, 2851 SdHoareTripleChecker+Valid, 2592 SdHoareTripleChecker+Invalid, 672 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 1 IncrementalHoareTripleChecker+Valid, 671 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.4s IncrementalHoareTripleChecker+Time [2025-02-05 18:12:06,298 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [2851 Valid, 2592 Invalid, 672 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [1 Valid, 671 Invalid, 0 Unknown, 0 Unchecked, 0.4s Time] [2025-02-05 18:12:06,299 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1099 states. [2025-02-05 18:12:06,307 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1099 to 1099. [2025-02-05 18:12:06,308 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 1099 states, 1087 states have (on average 1.4811407543698252) internal successors, (1610), 1087 states have internal predecessors, (1610), 10 states have call successors, (10), 1 states have call predecessors, (10), 1 states have return successors, (10), 10 states have call predecessors, (10), 10 states have call successors, (10) [2025-02-05 18:12:06,309 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1099 states to 1099 states and 1630 transitions. [2025-02-05 18:12:06,309 INFO L78 Accepts]: Start accepts. Automaton has 1099 states and 1630 transitions. Word has length 384 [2025-02-05 18:12:06,309 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-02-05 18:12:06,309 INFO L471 AbstractCegarLoop]: Abstraction has 1099 states and 1630 transitions. [2025-02-05 18:12:06,310 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 67.4) internal successors, (337), 5 states have internal predecessors, (337), 1 states have call successors, (10), 1 states have call predecessors, (10), 1 states have return successors, (10), 1 states have call predecessors, (10), 1 states have call successors, (10) [2025-02-05 18:12:06,310 INFO L276 IsEmpty]: Start isEmpty. Operand 1099 states and 1630 transitions. [2025-02-05 18:12:06,311 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 386 [2025-02-05 18:12:06,311 INFO L210 NwaCegarLoop]: Found error trace [2025-02-05 18:12:06,312 INFO L218 NwaCegarLoop]: trace histogram [10, 10, 10, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-02-05 18:12:06,312 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable11 [2025-02-05 18:12:06,312 INFO L396 AbstractCegarLoop]: === Iteration 13 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-02-05 18:12:06,312 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-02-05 18:12:06,312 INFO L85 PathProgramCache]: Analyzing trace with hash 1173518460, now seen corresponding path program 1 times [2025-02-05 18:12:06,312 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-02-05 18:12:06,312 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1269932165] [2025-02-05 18:12:06,313 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-02-05 18:12:06,313 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-02-05 18:12:06,358 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 385 statements into 1 equivalence classes. [2025-02-05 18:12:06,414 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 385 of 385 statements. [2025-02-05 18:12:06,414 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-02-05 18:12:06,414 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-02-05 18:12:06,843 INFO L134 CoverageAnalysis]: Checked inductivity of 180 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 180 trivial. 0 not checked. [2025-02-05 18:12:06,843 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-02-05 18:12:06,843 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1269932165] [2025-02-05 18:12:06,844 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1269932165] provided 1 perfect and 0 imperfect interpolant sequences [2025-02-05 18:12:06,844 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-02-05 18:12:06,844 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2025-02-05 18:12:06,844 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2049306646] [2025-02-05 18:12:06,844 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-02-05 18:12:06,844 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2025-02-05 18:12:06,844 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-02-05 18:12:06,845 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2025-02-05 18:12:06,845 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=8, Invalid=12, Unknown=0, NotChecked=0, Total=20 [2025-02-05 18:12:06,845 INFO L87 Difference]: Start difference. First operand 1099 states and 1630 transitions. Second operand has 5 states, 5 states have (on average 67.6) internal successors, (338), 5 states have internal predecessors, (338), 1 states have call successors, (10), 1 states have call predecessors, (10), 1 states have return successors, (10), 1 states have call predecessors, (10), 1 states have call successors, (10) [2025-02-05 18:12:07,218 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-02-05 18:12:07,218 INFO L93 Difference]: Finished difference Result 2032 states and 3012 transitions. [2025-02-05 18:12:07,219 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2025-02-05 18:12:07,219 INFO L78 Accepts]: Start accepts. Automaton has has 5 states, 5 states have (on average 67.6) internal successors, (338), 5 states have internal predecessors, (338), 1 states have call successors, (10), 1 states have call predecessors, (10), 1 states have return successors, (10), 1 states have call predecessors, (10), 1 states have call successors, (10) Word has length 385 [2025-02-05 18:12:07,220 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-02-05 18:12:07,222 INFO L225 Difference]: With dead ends: 2032 [2025-02-05 18:12:07,222 INFO L226 Difference]: Without dead ends: 1099 [2025-02-05 18:12:07,227 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 6 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 4 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=13, Invalid=17, Unknown=0, NotChecked=0, Total=30 [2025-02-05 18:12:07,227 INFO L435 NwaCegarLoop]: 1296 mSDtfsCounter, 1517 mSDsluCounter, 1312 mSDsCounter, 0 mSdLazyCounter, 667 mSolverCounterSat, 1 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.3s Time, 0 mProtectedPredicate, 0 mProtectedAction, 1527 SdHoareTripleChecker+Valid, 2608 SdHoareTripleChecker+Invalid, 668 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 1 IncrementalHoareTripleChecker+Valid, 667 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.3s IncrementalHoareTripleChecker+Time [2025-02-05 18:12:07,228 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [1527 Valid, 2608 Invalid, 668 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [1 Valid, 667 Invalid, 0 Unknown, 0 Unchecked, 0.3s Time] [2025-02-05 18:12:07,229 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1099 states. [2025-02-05 18:12:07,249 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1099 to 1099. [2025-02-05 18:12:07,250 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 1099 states, 1087 states have (on average 1.4802207911683534) internal successors, (1609), 1087 states have internal predecessors, (1609), 10 states have call successors, (10), 1 states have call predecessors, (10), 1 states have return successors, (10), 10 states have call predecessors, (10), 10 states have call successors, (10) [2025-02-05 18:12:07,251 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1099 states to 1099 states and 1629 transitions. [2025-02-05 18:12:07,251 INFO L78 Accepts]: Start accepts. Automaton has 1099 states and 1629 transitions. Word has length 385 [2025-02-05 18:12:07,252 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-02-05 18:12:07,252 INFO L471 AbstractCegarLoop]: Abstraction has 1099 states and 1629 transitions. [2025-02-05 18:12:07,252 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 67.6) internal successors, (338), 5 states have internal predecessors, (338), 1 states have call successors, (10), 1 states have call predecessors, (10), 1 states have return successors, (10), 1 states have call predecessors, (10), 1 states have call successors, (10) [2025-02-05 18:12:07,252 INFO L276 IsEmpty]: Start isEmpty. Operand 1099 states and 1629 transitions. [2025-02-05 18:12:07,257 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 387 [2025-02-05 18:12:07,257 INFO L210 NwaCegarLoop]: Found error trace [2025-02-05 18:12:07,258 INFO L218 NwaCegarLoop]: trace histogram [10, 10, 10, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-02-05 18:12:07,258 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable12 [2025-02-05 18:12:07,258 INFO L396 AbstractCegarLoop]: === Iteration 14 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-02-05 18:12:07,258 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-02-05 18:12:07,258 INFO L85 PathProgramCache]: Analyzing trace with hash 1226177884, now seen corresponding path program 1 times [2025-02-05 18:12:07,258 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-02-05 18:12:07,258 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1016619392] [2025-02-05 18:12:07,258 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-02-05 18:12:07,259 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-02-05 18:12:07,317 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 386 statements into 1 equivalence classes. [2025-02-05 18:12:07,534 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 386 of 386 statements. [2025-02-05 18:12:07,536 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-02-05 18:12:07,536 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-02-05 18:12:07,995 INFO L134 CoverageAnalysis]: Checked inductivity of 180 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 180 trivial. 0 not checked. [2025-02-05 18:12:07,995 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-02-05 18:12:07,995 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1016619392] [2025-02-05 18:12:07,996 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1016619392] provided 1 perfect and 0 imperfect interpolant sequences [2025-02-05 18:12:07,996 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-02-05 18:12:07,997 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2025-02-05 18:12:07,997 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [939667355] [2025-02-05 18:12:07,997 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-02-05 18:12:07,997 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2025-02-05 18:12:07,997 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-02-05 18:12:07,998 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2025-02-05 18:12:07,998 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2025-02-05 18:12:07,998 INFO L87 Difference]: Start difference. First operand 1099 states and 1629 transitions. Second operand has 4 states, 4 states have (on average 84.75) internal successors, (339), 4 states have internal predecessors, (339), 1 states have call successors, (10), 1 states have call predecessors, (10), 1 states have return successors, (10), 1 states have call predecessors, (10), 1 states have call successors, (10) [2025-02-05 18:12:08,533 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-02-05 18:12:08,534 INFO L93 Difference]: Finished difference Result 2032 states and 3010 transitions. [2025-02-05 18:12:08,534 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2025-02-05 18:12:08,534 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 4 states have (on average 84.75) internal successors, (339), 4 states have internal predecessors, (339), 1 states have call successors, (10), 1 states have call predecessors, (10), 1 states have return successors, (10), 1 states have call predecessors, (10), 1 states have call successors, (10) Word has length 386 [2025-02-05 18:12:08,535 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-02-05 18:12:08,537 INFO L225 Difference]: With dead ends: 2032 [2025-02-05 18:12:08,537 INFO L226 Difference]: Without dead ends: 1099 [2025-02-05 18:12:08,538 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 7 GetRequests, 4 SyntacticMatches, 0 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=9, Invalid=11, Unknown=0, NotChecked=0, Total=20 [2025-02-05 18:12:08,538 INFO L435 NwaCegarLoop]: 1295 mSDtfsCounter, 1402 mSDsluCounter, 1297 mSDsCounter, 0 mSdLazyCounter, 667 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.4s Time, 0 mProtectedPredicate, 0 mProtectedAction, 1402 SdHoareTripleChecker+Valid, 2592 SdHoareTripleChecker+Invalid, 667 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 667 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.5s IncrementalHoareTripleChecker+Time [2025-02-05 18:12:08,539 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [1402 Valid, 2592 Invalid, 667 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 667 Invalid, 0 Unknown, 0 Unchecked, 0.5s Time] [2025-02-05 18:12:08,540 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1099 states. [2025-02-05 18:12:08,550 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1099 to 1099. [2025-02-05 18:12:08,551 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 1099 states, 1087 states have (on average 1.4793008279668813) internal successors, (1608), 1087 states have internal predecessors, (1608), 10 states have call successors, (10), 1 states have call predecessors, (10), 1 states have return successors, (10), 10 states have call predecessors, (10), 10 states have call successors, (10) [2025-02-05 18:12:08,552 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1099 states to 1099 states and 1628 transitions. [2025-02-05 18:12:08,552 INFO L78 Accepts]: Start accepts. Automaton has 1099 states and 1628 transitions. Word has length 386 [2025-02-05 18:12:08,552 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-02-05 18:12:08,552 INFO L471 AbstractCegarLoop]: Abstraction has 1099 states and 1628 transitions. [2025-02-05 18:12:08,558 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 84.75) internal successors, (339), 4 states have internal predecessors, (339), 1 states have call successors, (10), 1 states have call predecessors, (10), 1 states have return successors, (10), 1 states have call predecessors, (10), 1 states have call successors, (10) [2025-02-05 18:12:08,561 INFO L276 IsEmpty]: Start isEmpty. Operand 1099 states and 1628 transitions. [2025-02-05 18:12:08,563 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 388 [2025-02-05 18:12:08,563 INFO L210 NwaCegarLoop]: Found error trace [2025-02-05 18:12:08,564 INFO L218 NwaCegarLoop]: trace histogram [10, 10, 10, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-02-05 18:12:08,564 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable13 [2025-02-05 18:12:08,564 INFO L396 AbstractCegarLoop]: === Iteration 15 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-02-05 18:12:08,566 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-02-05 18:12:08,567 INFO L85 PathProgramCache]: Analyzing trace with hash -370195493, now seen corresponding path program 1 times [2025-02-05 18:12:08,567 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-02-05 18:12:08,567 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1003370460] [2025-02-05 18:12:08,567 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-02-05 18:12:08,567 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-02-05 18:12:08,673 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 387 statements into 1 equivalence classes. [2025-02-05 18:12:08,809 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 387 of 387 statements. [2025-02-05 18:12:08,809 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-02-05 18:12:08,809 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-02-05 18:12:09,255 INFO L134 CoverageAnalysis]: Checked inductivity of 180 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 180 trivial. 0 not checked. [2025-02-05 18:12:09,256 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-02-05 18:12:09,256 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1003370460] [2025-02-05 18:12:09,256 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1003370460] provided 1 perfect and 0 imperfect interpolant sequences [2025-02-05 18:12:09,256 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-02-05 18:12:09,256 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2025-02-05 18:12:09,256 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1081470428] [2025-02-05 18:12:09,256 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-02-05 18:12:09,257 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2025-02-05 18:12:09,257 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-02-05 18:12:09,257 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2025-02-05 18:12:09,257 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2025-02-05 18:12:09,258 INFO L87 Difference]: Start difference. First operand 1099 states and 1628 transitions. Second operand has 4 states, 4 states have (on average 85.0) internal successors, (340), 4 states have internal predecessors, (340), 1 states have call successors, (10), 1 states have call predecessors, (10), 1 states have return successors, (10), 1 states have call predecessors, (10), 1 states have call successors, (10) [2025-02-05 18:12:09,647 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-02-05 18:12:09,647 INFO L93 Difference]: Finished difference Result 2032 states and 3008 transitions. [2025-02-05 18:12:09,647 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2025-02-05 18:12:09,647 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 4 states have (on average 85.0) internal successors, (340), 4 states have internal predecessors, (340), 1 states have call successors, (10), 1 states have call predecessors, (10), 1 states have return successors, (10), 1 states have call predecessors, (10), 1 states have call successors, (10) Word has length 387 [2025-02-05 18:12:09,648 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-02-05 18:12:09,650 INFO L225 Difference]: With dead ends: 2032 [2025-02-05 18:12:09,650 INFO L226 Difference]: Without dead ends: 1099 [2025-02-05 18:12:09,651 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 7 GetRequests, 4 SyntacticMatches, 0 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=9, Invalid=11, Unknown=0, NotChecked=0, Total=20 [2025-02-05 18:12:09,652 INFO L435 NwaCegarLoop]: 1295 mSDtfsCounter, 1317 mSDsluCounter, 1297 mSDsCounter, 0 mSdLazyCounter, 665 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.3s Time, 0 mProtectedPredicate, 0 mProtectedAction, 1317 SdHoareTripleChecker+Valid, 2592 SdHoareTripleChecker+Invalid, 665 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 665 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.4s IncrementalHoareTripleChecker+Time [2025-02-05 18:12:09,652 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [1317 Valid, 2592 Invalid, 665 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 665 Invalid, 0 Unknown, 0 Unchecked, 0.4s Time] [2025-02-05 18:12:09,653 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1099 states. [2025-02-05 18:12:09,661 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1099 to 1099. [2025-02-05 18:12:09,662 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 1099 states, 1087 states have (on average 1.4783808647654093) internal successors, (1607), 1087 states have internal predecessors, (1607), 10 states have call successors, (10), 1 states have call predecessors, (10), 1 states have return successors, (10), 10 states have call predecessors, (10), 10 states have call successors, (10) [2025-02-05 18:12:09,663 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1099 states to 1099 states and 1627 transitions. [2025-02-05 18:12:09,663 INFO L78 Accepts]: Start accepts. Automaton has 1099 states and 1627 transitions. Word has length 387 [2025-02-05 18:12:09,663 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-02-05 18:12:09,663 INFO L471 AbstractCegarLoop]: Abstraction has 1099 states and 1627 transitions. [2025-02-05 18:12:09,664 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 85.0) internal successors, (340), 4 states have internal predecessors, (340), 1 states have call successors, (10), 1 states have call predecessors, (10), 1 states have return successors, (10), 1 states have call predecessors, (10), 1 states have call successors, (10) [2025-02-05 18:12:09,664 INFO L276 IsEmpty]: Start isEmpty. Operand 1099 states and 1627 transitions. [2025-02-05 18:12:09,665 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 389 [2025-02-05 18:12:09,665 INFO L210 NwaCegarLoop]: Found error trace [2025-02-05 18:12:09,666 INFO L218 NwaCegarLoop]: trace histogram [10, 10, 10, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-02-05 18:12:09,666 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable14 [2025-02-05 18:12:09,666 INFO L396 AbstractCegarLoop]: === Iteration 16 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-02-05 18:12:09,666 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-02-05 18:12:09,666 INFO L85 PathProgramCache]: Analyzing trace with hash -943651755, now seen corresponding path program 1 times [2025-02-05 18:12:09,666 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-02-05 18:12:09,666 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [176447345] [2025-02-05 18:12:09,666 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-02-05 18:12:09,667 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-02-05 18:12:09,715 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 388 statements into 1 equivalence classes. [2025-02-05 18:12:10,110 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 388 of 388 statements. [2025-02-05 18:12:10,114 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-02-05 18:12:10,114 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-02-05 18:12:10,521 INFO L134 CoverageAnalysis]: Checked inductivity of 180 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 180 trivial. 0 not checked. [2025-02-05 18:12:10,521 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-02-05 18:12:10,521 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [176447345] [2025-02-05 18:12:10,521 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [176447345] provided 1 perfect and 0 imperfect interpolant sequences [2025-02-05 18:12:10,521 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-02-05 18:12:10,522 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2025-02-05 18:12:10,522 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [416440476] [2025-02-05 18:12:10,522 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-02-05 18:12:10,522 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2025-02-05 18:12:10,522 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-02-05 18:12:10,523 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2025-02-05 18:12:10,523 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=6, Invalid=6, Unknown=0, NotChecked=0, Total=12 [2025-02-05 18:12:10,523 INFO L87 Difference]: Start difference. First operand 1099 states and 1627 transitions. Second operand has 4 states, 4 states have (on average 85.25) internal successors, (341), 4 states have internal predecessors, (341), 2 states have call successors, (10), 1 states have call predecessors, (10), 1 states have return successors, (10), 2 states have call predecessors, (10), 2 states have call successors, (10) [2025-02-05 18:12:11,283 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-02-05 18:12:11,283 INFO L93 Difference]: Finished difference Result 2032 states and 3006 transitions. [2025-02-05 18:12:11,283 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2025-02-05 18:12:11,284 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 4 states have (on average 85.25) internal successors, (341), 4 states have internal predecessors, (341), 2 states have call successors, (10), 1 states have call predecessors, (10), 1 states have return successors, (10), 2 states have call predecessors, (10), 2 states have call successors, (10) Word has length 388 [2025-02-05 18:12:11,284 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-02-05 18:12:11,287 INFO L225 Difference]: With dead ends: 2032 [2025-02-05 18:12:11,287 INFO L226 Difference]: Without dead ends: 1099 [2025-02-05 18:12:11,288 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 4 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 2 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=6, Invalid=6, Unknown=0, NotChecked=0, Total=12 [2025-02-05 18:12:11,288 INFO L435 NwaCegarLoop]: 1021 mSDtfsCounter, 1488 mSDsluCounter, 1020 mSDsCounter, 0 mSdLazyCounter, 1214 mSolverCounterSat, 1 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.6s Time, 0 mProtectedPredicate, 0 mProtectedAction, 1492 SdHoareTripleChecker+Valid, 2041 SdHoareTripleChecker+Invalid, 1215 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 1 IncrementalHoareTripleChecker+Valid, 1214 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.7s IncrementalHoareTripleChecker+Time [2025-02-05 18:12:11,288 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [1492 Valid, 2041 Invalid, 1215 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [1 Valid, 1214 Invalid, 0 Unknown, 0 Unchecked, 0.7s Time] [2025-02-05 18:12:11,289 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1099 states. [2025-02-05 18:12:11,325 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1099 to 1099. [2025-02-05 18:12:11,326 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 1099 states, 1087 states have (on average 1.4774609015639375) internal successors, (1606), 1087 states have internal predecessors, (1606), 10 states have call successors, (10), 1 states have call predecessors, (10), 1 states have return successors, (10), 10 states have call predecessors, (10), 10 states have call successors, (10) [2025-02-05 18:12:11,327 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1099 states to 1099 states and 1626 transitions. [2025-02-05 18:12:11,327 INFO L78 Accepts]: Start accepts. Automaton has 1099 states and 1626 transitions. Word has length 388 [2025-02-05 18:12:11,328 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-02-05 18:12:11,328 INFO L471 AbstractCegarLoop]: Abstraction has 1099 states and 1626 transitions. [2025-02-05 18:12:11,328 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 85.25) internal successors, (341), 4 states have internal predecessors, (341), 2 states have call successors, (10), 1 states have call predecessors, (10), 1 states have return successors, (10), 2 states have call predecessors, (10), 2 states have call successors, (10) [2025-02-05 18:12:11,328 INFO L276 IsEmpty]: Start isEmpty. Operand 1099 states and 1626 transitions. [2025-02-05 18:12:11,329 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 390 [2025-02-05 18:12:11,330 INFO L210 NwaCegarLoop]: Found error trace [2025-02-05 18:12:11,330 INFO L218 NwaCegarLoop]: trace histogram [10, 10, 10, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-02-05 18:12:11,330 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable15 [2025-02-05 18:12:11,330 INFO L396 AbstractCegarLoop]: === Iteration 17 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-02-05 18:12:11,331 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-02-05 18:12:11,331 INFO L85 PathProgramCache]: Analyzing trace with hash 528349341, now seen corresponding path program 1 times [2025-02-05 18:12:11,331 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-02-05 18:12:11,331 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [183801552] [2025-02-05 18:12:11,331 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-02-05 18:12:11,331 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-02-05 18:12:11,379 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 389 statements into 1 equivalence classes. [2025-02-05 18:12:11,810 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 389 of 389 statements. [2025-02-05 18:12:11,810 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-02-05 18:12:11,810 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-02-05 18:12:12,820 INFO L134 CoverageAnalysis]: Checked inductivity of 180 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 180 trivial. 0 not checked. [2025-02-05 18:12:12,820 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-02-05 18:12:12,820 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [183801552] [2025-02-05 18:12:12,820 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [183801552] provided 1 perfect and 0 imperfect interpolant sequences [2025-02-05 18:12:12,820 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-02-05 18:12:12,824 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2025-02-05 18:12:12,825 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [785068332] [2025-02-05 18:12:12,825 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-02-05 18:12:12,825 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 7 states [2025-02-05 18:12:12,825 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-02-05 18:12:12,826 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2025-02-05 18:12:12,826 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=11, Invalid=31, Unknown=0, NotChecked=0, Total=42 [2025-02-05 18:12:12,826 INFO L87 Difference]: Start difference. First operand 1099 states and 1626 transitions. Second operand has 7 states, 7 states have (on average 48.857142857142854) internal successors, (342), 7 states have internal predecessors, (342), 2 states have call successors, (10), 1 states have call predecessors, (10), 1 states have return successors, (10), 2 states have call predecessors, (10), 2 states have call successors, (10) [2025-02-05 18:12:13,803 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-02-05 18:12:13,803 INFO L93 Difference]: Finished difference Result 2088 states and 3087 transitions. [2025-02-05 18:12:13,804 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2025-02-05 18:12:13,804 INFO L78 Accepts]: Start accepts. Automaton has has 7 states, 7 states have (on average 48.857142857142854) internal successors, (342), 7 states have internal predecessors, (342), 2 states have call successors, (10), 1 states have call predecessors, (10), 1 states have return successors, (10), 2 states have call predecessors, (10), 2 states have call successors, (10) Word has length 389 [2025-02-05 18:12:13,804 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-02-05 18:12:13,810 INFO L225 Difference]: With dead ends: 2088 [2025-02-05 18:12:13,811 INFO L226 Difference]: Without dead ends: 1103 [2025-02-05 18:12:13,812 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 11 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 9 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 6 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=27, Invalid=83, Unknown=0, NotChecked=0, Total=110 [2025-02-05 18:12:13,812 INFO L435 NwaCegarLoop]: 1320 mSDtfsCounter, 1605 mSDsluCounter, 4964 mSDsCounter, 0 mSdLazyCounter, 1831 mSolverCounterSat, 12 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.8s Time, 0 mProtectedPredicate, 0 mProtectedAction, 1615 SdHoareTripleChecker+Valid, 6284 SdHoareTripleChecker+Invalid, 1843 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 12 IncrementalHoareTripleChecker+Valid, 1831 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.9s IncrementalHoareTripleChecker+Time [2025-02-05 18:12:13,815 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [1615 Valid, 6284 Invalid, 1843 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [12 Valid, 1831 Invalid, 0 Unknown, 0 Unchecked, 0.9s Time] [2025-02-05 18:12:13,817 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1103 states. [2025-02-05 18:12:13,839 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1103 to 1101. [2025-02-05 18:12:13,839 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 1101 states, 1089 states have (on average 1.4756657483930211) internal successors, (1607), 1089 states have internal predecessors, (1607), 10 states have call successors, (10), 1 states have call predecessors, (10), 1 states have return successors, (10), 10 states have call predecessors, (10), 10 states have call successors, (10) [2025-02-05 18:12:13,840 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1101 states to 1101 states and 1627 transitions. [2025-02-05 18:12:13,841 INFO L78 Accepts]: Start accepts. Automaton has 1101 states and 1627 transitions. Word has length 389 [2025-02-05 18:12:13,841 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-02-05 18:12:13,841 INFO L471 AbstractCegarLoop]: Abstraction has 1101 states and 1627 transitions. [2025-02-05 18:12:13,841 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 7 states, 7 states have (on average 48.857142857142854) internal successors, (342), 7 states have internal predecessors, (342), 2 states have call successors, (10), 1 states have call predecessors, (10), 1 states have return successors, (10), 2 states have call predecessors, (10), 2 states have call successors, (10) [2025-02-05 18:12:13,841 INFO L276 IsEmpty]: Start isEmpty. Operand 1101 states and 1627 transitions. [2025-02-05 18:12:13,844 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 391 [2025-02-05 18:12:13,844 INFO L210 NwaCegarLoop]: Found error trace [2025-02-05 18:12:13,844 INFO L218 NwaCegarLoop]: trace histogram [10, 10, 10, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-02-05 18:12:13,844 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable16 [2025-02-05 18:12:13,844 INFO L396 AbstractCegarLoop]: === Iteration 18 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-02-05 18:12:13,845 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-02-05 18:12:13,845 INFO L85 PathProgramCache]: Analyzing trace with hash -1902627859, now seen corresponding path program 1 times [2025-02-05 18:12:13,845 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-02-05 18:12:13,845 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [468527594] [2025-02-05 18:12:13,845 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-02-05 18:12:13,845 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-02-05 18:12:13,898 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 390 statements into 1 equivalence classes. [2025-02-05 18:12:14,377 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 390 of 390 statements. [2025-02-05 18:12:14,377 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-02-05 18:12:14,377 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-02-05 18:12:15,227 INFO L134 CoverageAnalysis]: Checked inductivity of 180 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 180 trivial. 0 not checked. [2025-02-05 18:12:15,228 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-02-05 18:12:15,228 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [468527594] [2025-02-05 18:12:15,228 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [468527594] provided 1 perfect and 0 imperfect interpolant sequences [2025-02-05 18:12:15,228 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-02-05 18:12:15,228 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [9] imperfect sequences [] total 9 [2025-02-05 18:12:15,228 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1587396113] [2025-02-05 18:12:15,228 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-02-05 18:12:15,229 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 9 states [2025-02-05 18:12:15,229 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-02-05 18:12:15,230 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2025-02-05 18:12:15,230 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=21, Invalid=51, Unknown=0, NotChecked=0, Total=72 [2025-02-05 18:12:15,230 INFO L87 Difference]: Start difference. First operand 1101 states and 1627 transitions. Second operand has 9 states, 9 states have (on average 38.111111111111114) internal successors, (343), 9 states have internal predecessors, (343), 2 states have call successors, (10), 1 states have call predecessors, (10), 1 states have return successors, (10), 2 states have call predecessors, (10), 2 states have call successors, (10) [2025-02-05 18:12:16,792 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-02-05 18:12:16,793 INFO L93 Difference]: Finished difference Result 2048 states and 3024 transitions. [2025-02-05 18:12:16,793 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2025-02-05 18:12:16,793 INFO L78 Accepts]: Start accepts. Automaton has has 9 states, 9 states have (on average 38.111111111111114) internal successors, (343), 9 states have internal predecessors, (343), 2 states have call successors, (10), 1 states have call predecessors, (10), 1 states have return successors, (10), 2 states have call predecessors, (10), 2 states have call successors, (10) Word has length 390 [2025-02-05 18:12:16,794 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-02-05 18:12:16,796 INFO L225 Difference]: With dead ends: 2048 [2025-02-05 18:12:16,796 INFO L226 Difference]: Without dead ends: 1113 [2025-02-05 18:12:16,797 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 9 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 7 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=21, Invalid=51, Unknown=0, NotChecked=0, Total=72 [2025-02-05 18:12:16,797 INFO L435 NwaCegarLoop]: 1011 mSDtfsCounter, 1556 mSDsluCounter, 5995 mSDsCounter, 0 mSdLazyCounter, 4340 mSolverCounterSat, 3 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 1.3s Time, 0 mProtectedPredicate, 0 mProtectedAction, 1561 SdHoareTripleChecker+Valid, 7006 SdHoareTripleChecker+Invalid, 4343 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 3 IncrementalHoareTripleChecker+Valid, 4340 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 1.5s IncrementalHoareTripleChecker+Time [2025-02-05 18:12:16,797 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [1561 Valid, 7006 Invalid, 4343 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [3 Valid, 4340 Invalid, 0 Unknown, 0 Unchecked, 1.5s Time] [2025-02-05 18:12:16,799 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1113 states. [2025-02-05 18:12:16,808 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1113 to 1109. [2025-02-05 18:12:16,809 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 1109 states, 1097 states have (on average 1.4749316317228807) internal successors, (1618), 1097 states have internal predecessors, (1618), 10 states have call successors, (10), 1 states have call predecessors, (10), 1 states have return successors, (10), 10 states have call predecessors, (10), 10 states have call successors, (10) [2025-02-05 18:12:16,810 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1109 states to 1109 states and 1638 transitions. [2025-02-05 18:12:16,810 INFO L78 Accepts]: Start accepts. Automaton has 1109 states and 1638 transitions. Word has length 390 [2025-02-05 18:12:16,810 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-02-05 18:12:16,810 INFO L471 AbstractCegarLoop]: Abstraction has 1109 states and 1638 transitions. [2025-02-05 18:12:16,811 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 9 states, 9 states have (on average 38.111111111111114) internal successors, (343), 9 states have internal predecessors, (343), 2 states have call successors, (10), 1 states have call predecessors, (10), 1 states have return successors, (10), 2 states have call predecessors, (10), 2 states have call successors, (10) [2025-02-05 18:12:16,811 INFO L276 IsEmpty]: Start isEmpty. Operand 1109 states and 1638 transitions. [2025-02-05 18:12:16,813 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 392 [2025-02-05 18:12:16,813 INFO L210 NwaCegarLoop]: Found error trace [2025-02-05 18:12:16,813 INFO L218 NwaCegarLoop]: trace histogram [10, 10, 10, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-02-05 18:12:16,813 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable17 [2025-02-05 18:12:16,813 INFO L396 AbstractCegarLoop]: === Iteration 19 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-02-05 18:12:16,814 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-02-05 18:12:16,814 INFO L85 PathProgramCache]: Analyzing trace with hash 288859642, now seen corresponding path program 1 times [2025-02-05 18:12:16,814 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-02-05 18:12:16,814 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [757711981] [2025-02-05 18:12:16,814 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-02-05 18:12:16,814 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-02-05 18:12:16,880 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 391 statements into 1 equivalence classes. [2025-02-05 18:12:17,046 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 391 of 391 statements. [2025-02-05 18:12:17,046 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-02-05 18:12:17,046 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-02-05 18:12:17,497 INFO L134 CoverageAnalysis]: Checked inductivity of 180 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 180 trivial. 0 not checked. [2025-02-05 18:12:17,497 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-02-05 18:12:17,497 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [757711981] [2025-02-05 18:12:17,497 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [757711981] provided 1 perfect and 0 imperfect interpolant sequences [2025-02-05 18:12:17,497 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-02-05 18:12:17,497 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2025-02-05 18:12:17,497 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [498362564] [2025-02-05 18:12:17,497 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-02-05 18:12:17,498 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2025-02-05 18:12:17,498 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-02-05 18:12:17,499 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2025-02-05 18:12:17,499 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=6, Invalid=6, Unknown=0, NotChecked=0, Total=12 [2025-02-05 18:12:17,499 INFO L87 Difference]: Start difference. First operand 1109 states and 1638 transitions. Second operand has 4 states, 4 states have (on average 86.0) internal successors, (344), 4 states have internal predecessors, (344), 2 states have call successors, (10), 1 states have call predecessors, (10), 1 states have return successors, (10), 2 states have call predecessors, (10), 2 states have call successors, (10) [2025-02-05 18:12:18,136 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-02-05 18:12:18,136 INFO L93 Difference]: Finished difference Result 2052 states and 3028 transitions. [2025-02-05 18:12:18,136 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2025-02-05 18:12:18,137 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 4 states have (on average 86.0) internal successors, (344), 4 states have internal predecessors, (344), 2 states have call successors, (10), 1 states have call predecessors, (10), 1 states have return successors, (10), 2 states have call predecessors, (10), 2 states have call successors, (10) Word has length 391 [2025-02-05 18:12:18,137 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-02-05 18:12:18,140 INFO L225 Difference]: With dead ends: 2052 [2025-02-05 18:12:18,140 INFO L226 Difference]: Without dead ends: 1109 [2025-02-05 18:12:18,141 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 4 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 2 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=6, Invalid=6, Unknown=0, NotChecked=0, Total=12 [2025-02-05 18:12:18,145 INFO L435 NwaCegarLoop]: 1020 mSDtfsCounter, 1573 mSDsluCounter, 1021 mSDsCounter, 0 mSdLazyCounter, 1210 mSolverCounterSat, 1 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.5s Time, 0 mProtectedPredicate, 0 mProtectedAction, 1580 SdHoareTripleChecker+Valid, 2041 SdHoareTripleChecker+Invalid, 1211 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 1 IncrementalHoareTripleChecker+Valid, 1210 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.6s IncrementalHoareTripleChecker+Time [2025-02-05 18:12:18,145 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [1580 Valid, 2041 Invalid, 1211 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [1 Valid, 1210 Invalid, 0 Unknown, 0 Unchecked, 0.6s Time] [2025-02-05 18:12:18,146 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1109 states. [2025-02-05 18:12:18,156 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1109 to 1109. [2025-02-05 18:12:18,157 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 1109 states, 1097 states have (on average 1.4740200546946216) internal successors, (1617), 1097 states have internal predecessors, (1617), 10 states have call successors, (10), 1 states have call predecessors, (10), 1 states have return successors, (10), 10 states have call predecessors, (10), 10 states have call successors, (10) [2025-02-05 18:12:18,158 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1109 states to 1109 states and 1637 transitions. [2025-02-05 18:12:18,159 INFO L78 Accepts]: Start accepts. Automaton has 1109 states and 1637 transitions. Word has length 391 [2025-02-05 18:12:18,159 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-02-05 18:12:18,159 INFO L471 AbstractCegarLoop]: Abstraction has 1109 states and 1637 transitions. [2025-02-05 18:12:18,159 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 86.0) internal successors, (344), 4 states have internal predecessors, (344), 2 states have call successors, (10), 1 states have call predecessors, (10), 1 states have return successors, (10), 2 states have call predecessors, (10), 2 states have call successors, (10) [2025-02-05 18:12:18,159 INFO L276 IsEmpty]: Start isEmpty. Operand 1109 states and 1637 transitions. [2025-02-05 18:12:18,161 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 393 [2025-02-05 18:12:18,161 INFO L210 NwaCegarLoop]: Found error trace [2025-02-05 18:12:18,161 INFO L218 NwaCegarLoop]: trace histogram [10, 10, 10, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-02-05 18:12:18,161 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable18 [2025-02-05 18:12:18,161 INFO L396 AbstractCegarLoop]: === Iteration 20 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-02-05 18:12:18,162 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-02-05 18:12:18,162 INFO L85 PathProgramCache]: Analyzing trace with hash 1107378001, now seen corresponding path program 1 times [2025-02-05 18:12:18,162 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-02-05 18:12:18,162 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [974919166] [2025-02-05 18:12:18,162 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-02-05 18:12:18,162 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-02-05 18:12:18,215 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 392 statements into 1 equivalence classes. [2025-02-05 18:12:18,586 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 392 of 392 statements. [2025-02-05 18:12:18,586 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-02-05 18:12:18,587 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-02-05 18:12:19,533 INFO L134 CoverageAnalysis]: Checked inductivity of 180 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 180 trivial. 0 not checked. [2025-02-05 18:12:19,534 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-02-05 18:12:19,534 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [974919166] [2025-02-05 18:12:19,534 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [974919166] provided 1 perfect and 0 imperfect interpolant sequences [2025-02-05 18:12:19,534 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-02-05 18:12:19,534 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2025-02-05 18:12:19,535 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [867114440] [2025-02-05 18:12:19,535 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-02-05 18:12:19,535 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2025-02-05 18:12:19,535 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-02-05 18:12:19,536 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2025-02-05 18:12:19,536 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=12, Invalid=18, Unknown=0, NotChecked=0, Total=30 [2025-02-05 18:12:19,536 INFO L87 Difference]: Start difference. First operand 1109 states and 1637 transitions. Second operand has 6 states, 6 states have (on average 57.5) internal successors, (345), 6 states have internal predecessors, (345), 2 states have call successors, (10), 1 states have call predecessors, (10), 1 states have return successors, (10), 2 states have call predecessors, (10), 2 states have call successors, (10) [2025-02-05 18:12:20,923 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-02-05 18:12:20,924 INFO L93 Difference]: Finished difference Result 2972 states and 4383 transitions. [2025-02-05 18:12:20,924 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2025-02-05 18:12:20,924 INFO L78 Accepts]: Start accepts. Automaton has has 6 states, 6 states have (on average 57.5) internal successors, (345), 6 states have internal predecessors, (345), 2 states have call successors, (10), 1 states have call predecessors, (10), 1 states have return successors, (10), 2 states have call predecessors, (10), 2 states have call successors, (10) Word has length 392 [2025-02-05 18:12:20,925 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-02-05 18:12:20,931 INFO L225 Difference]: With dead ends: 2972 [2025-02-05 18:12:20,931 INFO L226 Difference]: Without dead ends: 2029 [2025-02-05 18:12:20,933 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 10 GetRequests, 5 SyntacticMatches, 0 SemanticMatches, 5 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=17, Invalid=25, Unknown=0, NotChecked=0, Total=42 [2025-02-05 18:12:20,933 INFO L435 NwaCegarLoop]: 1130 mSDtfsCounter, 3910 mSDsluCounter, 3193 mSDsCounter, 0 mSdLazyCounter, 2700 mSolverCounterSat, 3 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 1.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 3927 SdHoareTripleChecker+Valid, 4323 SdHoareTripleChecker+Invalid, 2703 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 3 IncrementalHoareTripleChecker+Valid, 2700 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 1.3s IncrementalHoareTripleChecker+Time [2025-02-05 18:12:20,934 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [3927 Valid, 4323 Invalid, 2703 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [3 Valid, 2700 Invalid, 0 Unknown, 0 Unchecked, 1.3s Time] [2025-02-05 18:12:20,939 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 2029 states. [2025-02-05 18:12:20,955 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 2029 to 1201. [2025-02-05 18:12:20,956 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 1201 states, 1186 states have (on average 1.4713322091062395) internal successors, (1745), 1186 states have internal predecessors, (1745), 13 states have call successors, (13), 1 states have call predecessors, (13), 1 states have return successors, (13), 13 states have call predecessors, (13), 13 states have call successors, (13) [2025-02-05 18:12:20,957 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1201 states to 1201 states and 1771 transitions. [2025-02-05 18:12:20,957 INFO L78 Accepts]: Start accepts. Automaton has 1201 states and 1771 transitions. Word has length 392 [2025-02-05 18:12:20,957 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-02-05 18:12:20,958 INFO L471 AbstractCegarLoop]: Abstraction has 1201 states and 1771 transitions. [2025-02-05 18:12:20,958 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 6 states have (on average 57.5) internal successors, (345), 6 states have internal predecessors, (345), 2 states have call successors, (10), 1 states have call predecessors, (10), 1 states have return successors, (10), 2 states have call predecessors, (10), 2 states have call successors, (10) [2025-02-05 18:12:20,958 INFO L276 IsEmpty]: Start isEmpty. Operand 1201 states and 1771 transitions. [2025-02-05 18:12:20,959 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 394 [2025-02-05 18:12:20,960 INFO L210 NwaCegarLoop]: Found error trace [2025-02-05 18:12:20,960 INFO L218 NwaCegarLoop]: trace histogram [10, 10, 10, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-02-05 18:12:20,960 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable19 [2025-02-05 18:12:20,960 INFO L396 AbstractCegarLoop]: === Iteration 21 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-02-05 18:12:20,961 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-02-05 18:12:20,961 INFO L85 PathProgramCache]: Analyzing trace with hash -1019619800, now seen corresponding path program 1 times [2025-02-05 18:12:20,961 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-02-05 18:12:20,961 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [96199354] [2025-02-05 18:12:20,961 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-02-05 18:12:20,961 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-02-05 18:12:21,014 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 393 statements into 1 equivalence classes. [2025-02-05 18:12:21,287 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 393 of 393 statements. [2025-02-05 18:12:21,287 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-02-05 18:12:21,287 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-02-05 18:12:21,965 INFO L134 CoverageAnalysis]: Checked inductivity of 180 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 180 trivial. 0 not checked. [2025-02-05 18:12:21,966 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-02-05 18:12:21,966 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [96199354] [2025-02-05 18:12:21,966 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [96199354] provided 1 perfect and 0 imperfect interpolant sequences [2025-02-05 18:12:21,966 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-02-05 18:12:21,966 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2025-02-05 18:12:21,966 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1075193046] [2025-02-05 18:12:21,966 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-02-05 18:12:21,967 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2025-02-05 18:12:21,967 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-02-05 18:12:21,967 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2025-02-05 18:12:21,967 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=9, Invalid=11, Unknown=0, NotChecked=0, Total=20 [2025-02-05 18:12:21,967 INFO L87 Difference]: Start difference. First operand 1201 states and 1771 transitions. Second operand has 5 states, 5 states have (on average 69.2) internal successors, (346), 5 states have internal predecessors, (346), 1 states have call successors, (10), 1 states have call predecessors, (10), 1 states have return successors, (10), 1 states have call predecessors, (10), 1 states have call successors, (10) [2025-02-05 18:12:22,838 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-02-05 18:12:22,838 INFO L93 Difference]: Finished difference Result 2148 states and 3166 transitions. [2025-02-05 18:12:22,838 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2025-02-05 18:12:22,839 INFO L78 Accepts]: Start accepts. Automaton has has 5 states, 5 states have (on average 69.2) internal successors, (346), 5 states have internal predecessors, (346), 1 states have call successors, (10), 1 states have call predecessors, (10), 1 states have return successors, (10), 1 states have call predecessors, (10), 1 states have call successors, (10) Word has length 393 [2025-02-05 18:12:22,839 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-02-05 18:12:22,842 INFO L225 Difference]: With dead ends: 2148 [2025-02-05 18:12:22,842 INFO L226 Difference]: Without dead ends: 1205 [2025-02-05 18:12:22,843 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-05 18:12:22,843 INFO L435 NwaCegarLoop]: 1019 mSDtfsCounter, 1498 mSDsluCounter, 1997 mSDsCounter, 0 mSdLazyCounter, 1829 mSolverCounterSat, 1 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.7s Time, 0 mProtectedPredicate, 0 mProtectedAction, 1498 SdHoareTripleChecker+Valid, 3016 SdHoareTripleChecker+Invalid, 1830 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 1 IncrementalHoareTripleChecker+Valid, 1829 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.8s IncrementalHoareTripleChecker+Time [2025-02-05 18:12:22,844 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [1498 Valid, 3016 Invalid, 1830 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [1 Valid, 1829 Invalid, 0 Unknown, 0 Unchecked, 0.8s Time] [2025-02-05 18:12:22,845 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1205 states. [2025-02-05 18:12:22,853 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1205 to 1203. [2025-02-05 18:12:22,854 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 1203 states, 1188 states have (on average 1.4705387205387206) internal successors, (1747), 1188 states have internal predecessors, (1747), 13 states have call successors, (13), 1 states have call predecessors, (13), 1 states have return successors, (13), 13 states have call predecessors, (13), 13 states have call successors, (13) [2025-02-05 18:12:22,855 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1203 states to 1203 states and 1773 transitions. [2025-02-05 18:12:22,855 INFO L78 Accepts]: Start accepts. Automaton has 1203 states and 1773 transitions. Word has length 393 [2025-02-05 18:12:22,855 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-02-05 18:12:22,855 INFO L471 AbstractCegarLoop]: Abstraction has 1203 states and 1773 transitions. [2025-02-05 18:12:22,855 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 69.2) internal successors, (346), 5 states have internal predecessors, (346), 1 states have call successors, (10), 1 states have call predecessors, (10), 1 states have return successors, (10), 1 states have call predecessors, (10), 1 states have call successors, (10) [2025-02-05 18:12:22,855 INFO L276 IsEmpty]: Start isEmpty. Operand 1203 states and 1773 transitions. [2025-02-05 18:12:22,857 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 395 [2025-02-05 18:12:22,857 INFO L210 NwaCegarLoop]: Found error trace [2025-02-05 18:12:22,857 INFO L218 NwaCegarLoop]: trace histogram [10, 10, 10, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-02-05 18:12:22,857 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable20 [2025-02-05 18:12:22,857 INFO L396 AbstractCegarLoop]: === Iteration 22 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-02-05 18:12:22,858 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-02-05 18:12:22,858 INFO L85 PathProgramCache]: Analyzing trace with hash -832977849, now seen corresponding path program 1 times [2025-02-05 18:12:22,858 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-02-05 18:12:22,858 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1292659480] [2025-02-05 18:12:22,858 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-02-05 18:12:22,858 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-02-05 18:12:22,908 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 394 statements into 1 equivalence classes. [2025-02-05 18:12:23,376 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 394 of 394 statements. [2025-02-05 18:12:23,376 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-02-05 18:12:23,376 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-02-05 18:12:24,500 INFO L134 CoverageAnalysis]: Checked inductivity of 180 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 180 trivial. 0 not checked. [2025-02-05 18:12:24,500 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-02-05 18:12:24,500 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1292659480] [2025-02-05 18:12:24,500 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1292659480] provided 1 perfect and 0 imperfect interpolant sequences [2025-02-05 18:12:24,500 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-02-05 18:12:24,501 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [11] imperfect sequences [] total 11 [2025-02-05 18:12:24,501 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1047650751] [2025-02-05 18:12:24,501 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-02-05 18:12:24,501 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 11 states [2025-02-05 18:12:24,502 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-02-05 18:12:24,503 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 11 interpolants. [2025-02-05 18:12:24,503 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=23, Invalid=87, Unknown=0, NotChecked=0, Total=110 [2025-02-05 18:12:24,503 INFO L87 Difference]: Start difference. First operand 1203 states and 1773 transitions. Second operand has 11 states, 11 states have (on average 31.545454545454547) internal successors, (347), 11 states have internal predecessors, (347), 2 states have call successors, (10), 1 states have call predecessors, (10), 1 states have return successors, (10), 2 states have call predecessors, (10), 2 states have call successors, (10) [2025-02-05 18:12:26,548 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-02-05 18:12:26,549 INFO L93 Difference]: Finished difference Result 3274 states and 4818 transitions. [2025-02-05 18:12:26,549 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 11 states. [2025-02-05 18:12:26,549 INFO L78 Accepts]: Start accepts. Automaton has has 11 states, 11 states have (on average 31.545454545454547) internal successors, (347), 11 states have internal predecessors, (347), 2 states have call successors, (10), 1 states have call predecessors, (10), 1 states have return successors, (10), 2 states have call predecessors, (10), 2 states have call successors, (10) Word has length 394 [2025-02-05 18:12:26,549 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-02-05 18:12:26,558 INFO L225 Difference]: With dead ends: 3274 [2025-02-05 18:12:26,558 INFO L226 Difference]: Without dead ends: 2329 [2025-02-05 18:12:26,560 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 16 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 14 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 25 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=53, Invalid=187, Unknown=0, NotChecked=0, Total=240 [2025-02-05 18:12:26,561 INFO L435 NwaCegarLoop]: 1110 mSDtfsCounter, 3964 mSDsluCounter, 7650 mSDsCounter, 0 mSdLazyCounter, 4627 mSolverCounterSat, 14 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 1.6s Time, 0 mProtectedPredicate, 0 mProtectedAction, 3980 SdHoareTripleChecker+Valid, 8760 SdHoareTripleChecker+Invalid, 4641 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 14 IncrementalHoareTripleChecker+Valid, 4627 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 1.9s IncrementalHoareTripleChecker+Time [2025-02-05 18:12:26,561 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [3980 Valid, 8760 Invalid, 4641 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [14 Valid, 4627 Invalid, 0 Unknown, 0 Unchecked, 1.9s Time] [2025-02-05 18:12:26,563 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 2329 states. [2025-02-05 18:12:26,576 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 2329 to 1499. [2025-02-05 18:12:26,577 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 1499 states, 1474 states have (on average 1.466078697421981) internal successors, (2161), 1474 states have internal predecessors, (2161), 23 states have call successors, (23), 1 states have call predecessors, (23), 1 states have return successors, (23), 23 states have call predecessors, (23), 23 states have call successors, (23) [2025-02-05 18:12:26,578 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1499 states to 1499 states and 2207 transitions. [2025-02-05 18:12:26,578 INFO L78 Accepts]: Start accepts. Automaton has 1499 states and 2207 transitions. Word has length 394 [2025-02-05 18:12:26,579 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-02-05 18:12:26,579 INFO L471 AbstractCegarLoop]: Abstraction has 1499 states and 2207 transitions. [2025-02-05 18:12:26,579 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 11 states, 11 states have (on average 31.545454545454547) internal successors, (347), 11 states have internal predecessors, (347), 2 states have call successors, (10), 1 states have call predecessors, (10), 1 states have return successors, (10), 2 states have call predecessors, (10), 2 states have call successors, (10) [2025-02-05 18:12:26,579 INFO L276 IsEmpty]: Start isEmpty. Operand 1499 states and 2207 transitions. [2025-02-05 18:12:26,581 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 396 [2025-02-05 18:12:26,581 INFO L210 NwaCegarLoop]: Found error trace [2025-02-05 18:12:26,581 INFO L218 NwaCegarLoop]: trace histogram [10, 10, 10, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-02-05 18:12:26,581 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable21 [2025-02-05 18:12:26,581 INFO L396 AbstractCegarLoop]: === Iteration 23 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-02-05 18:12:26,582 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-02-05 18:12:26,582 INFO L85 PathProgramCache]: Analyzing trace with hash -1734008897, now seen corresponding path program 1 times [2025-02-05 18:12:26,582 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-02-05 18:12:26,582 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [940328839] [2025-02-05 18:12:26,582 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-02-05 18:12:26,582 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-02-05 18:12:26,748 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 395 statements into 1 equivalence classes. [2025-02-05 18:12:27,132 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 395 of 395 statements. [2025-02-05 18:12:27,132 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-02-05 18:12:27,132 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-02-05 18:12:28,163 INFO L134 CoverageAnalysis]: Checked inductivity of 180 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 180 trivial. 0 not checked. [2025-02-05 18:12:28,164 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-02-05 18:12:28,164 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [940328839] [2025-02-05 18:12:28,164 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [940328839] provided 1 perfect and 0 imperfect interpolant sequences [2025-02-05 18:12:28,164 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-02-05 18:12:28,164 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [11] imperfect sequences [] total 11 [2025-02-05 18:12:28,164 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1674102960] [2025-02-05 18:12:28,164 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-02-05 18:12:28,164 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 11 states [2025-02-05 18:12:28,164 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-02-05 18:12:28,165 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 11 interpolants. [2025-02-05 18:12:28,165 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=23, Invalid=87, Unknown=0, NotChecked=0, Total=110 [2025-02-05 18:12:28,165 INFO L87 Difference]: Start difference. First operand 1499 states and 2207 transitions. Second operand has 11 states, 11 states have (on average 31.636363636363637) internal successors, (348), 11 states have internal predecessors, (348), 2 states have call successors, (10), 1 states have call predecessors, (10), 1 states have return successors, (10), 2 states have call predecessors, (10), 2 states have call successors, (10) [2025-02-05 18:12:30,603 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-02-05 18:12:30,603 INFO L93 Difference]: Finished difference Result 4002 states and 5883 transitions. [2025-02-05 18:12:30,604 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 11 states. [2025-02-05 18:12:30,604 INFO L78 Accepts]: Start accepts. Automaton has has 11 states, 11 states have (on average 31.636363636363637) internal successors, (348), 11 states have internal predecessors, (348), 2 states have call successors, (10), 1 states have call predecessors, (10), 1 states have return successors, (10), 2 states have call predecessors, (10), 2 states have call successors, (10) Word has length 395 [2025-02-05 18:12:30,604 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-02-05 18:12:30,612 INFO L225 Difference]: With dead ends: 4002 [2025-02-05 18:12:30,612 INFO L226 Difference]: Without dead ends: 3057 [2025-02-05 18:12:30,613 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 16 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 14 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 25 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=53, Invalid=187, Unknown=0, NotChecked=0, Total=240 [2025-02-05 18:12:30,614 INFO L435 NwaCegarLoop]: 1233 mSDtfsCounter, 3912 mSDsluCounter, 9128 mSDsCounter, 0 mSdLazyCounter, 5624 mSolverCounterSat, 12 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 1.9s Time, 0 mProtectedPredicate, 0 mProtectedAction, 3927 SdHoareTripleChecker+Valid, 10361 SdHoareTripleChecker+Invalid, 5636 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 12 IncrementalHoareTripleChecker+Valid, 5624 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 2.3s IncrementalHoareTripleChecker+Time [2025-02-05 18:12:30,614 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [3927 Valid, 10361 Invalid, 5636 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [12 Valid, 5624 Invalid, 0 Unknown, 0 Unchecked, 2.3s Time] [2025-02-05 18:12:30,616 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 3057 states. [2025-02-05 18:12:30,650 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 3057 to 2094. [2025-02-05 18:12:30,652 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 2094 states, 2048 states have (on average 1.4609375) internal successors, (2992), 2048 states have internal predecessors, (2992), 44 states have call successors, (44), 1 states have call predecessors, (44), 1 states have return successors, (44), 44 states have call predecessors, (44), 44 states have call successors, (44) [2025-02-05 18:12:30,654 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 2094 states to 2094 states and 3080 transitions. [2025-02-05 18:12:30,655 INFO L78 Accepts]: Start accepts. Automaton has 2094 states and 3080 transitions. Word has length 395 [2025-02-05 18:12:30,655 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-02-05 18:12:30,655 INFO L471 AbstractCegarLoop]: Abstraction has 2094 states and 3080 transitions. [2025-02-05 18:12:30,655 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 11 states, 11 states have (on average 31.636363636363637) internal successors, (348), 11 states have internal predecessors, (348), 2 states have call successors, (10), 1 states have call predecessors, (10), 1 states have return successors, (10), 2 states have call predecessors, (10), 2 states have call successors, (10) [2025-02-05 18:12:30,655 INFO L276 IsEmpty]: Start isEmpty. Operand 2094 states and 3080 transitions. [2025-02-05 18:12:30,659 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 397 [2025-02-05 18:12:30,659 INFO L210 NwaCegarLoop]: Found error trace [2025-02-05 18:12:30,660 INFO L218 NwaCegarLoop]: trace histogram [10, 10, 10, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-02-05 18:12:30,660 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable22 [2025-02-05 18:12:30,660 INFO L396 AbstractCegarLoop]: === Iteration 24 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-02-05 18:12:30,660 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-02-05 18:12:30,660 INFO L85 PathProgramCache]: Analyzing trace with hash 1051931326, now seen corresponding path program 1 times [2025-02-05 18:12:30,660 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-02-05 18:12:30,660 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [955412121] [2025-02-05 18:12:30,660 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-02-05 18:12:30,661 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-02-05 18:12:30,727 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 396 statements into 1 equivalence classes. [2025-02-05 18:12:31,211 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 396 of 396 statements. [2025-02-05 18:12:31,211 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-02-05 18:12:31,211 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-02-05 18:12:31,850 INFO L134 CoverageAnalysis]: Checked inductivity of 180 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 180 trivial. 0 not checked. [2025-02-05 18:12:31,850 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-02-05 18:12:31,850 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [955412121] [2025-02-05 18:12:31,850 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [955412121] provided 1 perfect and 0 imperfect interpolant sequences [2025-02-05 18:12:31,850 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-02-05 18:12:31,850 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2025-02-05 18:12:31,850 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [63330381] [2025-02-05 18:12:31,850 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-02-05 18:12:31,852 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2025-02-05 18:12:31,852 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-02-05 18:12:31,852 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2025-02-05 18:12:31,853 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2025-02-05 18:12:31,853 INFO L87 Difference]: Start difference. First operand 2094 states and 3080 transitions. Second operand has 5 states, 5 states have (on average 69.8) internal successors, (349), 5 states have internal predecessors, (349), 1 states have call successors, (10), 1 states have call predecessors, (10), 1 states have return successors, (10), 1 states have call predecessors, (10), 1 states have call successors, (10) [2025-02-05 18:12:32,366 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-02-05 18:12:32,366 INFO L93 Difference]: Finished difference Result 3289 states and 4832 transitions. [2025-02-05 18:12:32,366 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2025-02-05 18:12:32,366 INFO L78 Accepts]: Start accepts. Automaton has has 5 states, 5 states have (on average 69.8) internal successors, (349), 5 states have internal predecessors, (349), 1 states have call successors, (10), 1 states have call predecessors, (10), 1 states have return successors, (10), 1 states have call predecessors, (10), 1 states have call successors, (10) Word has length 396 [2025-02-05 18:12:32,367 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-02-05 18:12:32,371 INFO L225 Difference]: With dead ends: 3289 [2025-02-05 18:12:32,371 INFO L226 Difference]: Without dead ends: 2344 [2025-02-05 18:12:32,372 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 5 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2025-02-05 18:12:32,372 INFO L435 NwaCegarLoop]: 1349 mSDtfsCounter, 219 mSDsluCounter, 4039 mSDsCounter, 0 mSdLazyCounter, 1091 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.4s Time, 0 mProtectedPredicate, 0 mProtectedAction, 219 SdHoareTripleChecker+Valid, 5388 SdHoareTripleChecker+Invalid, 1091 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 1091 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.5s IncrementalHoareTripleChecker+Time [2025-02-05 18:12:32,372 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [219 Valid, 5388 Invalid, 1091 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 1091 Invalid, 0 Unknown, 0 Unchecked, 0.5s Time] [2025-02-05 18:12:32,374 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 2344 states. [2025-02-05 18:12:32,393 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 2344 to 2342. [2025-02-05 18:12:32,395 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 2342 states, 2296 states have (on average 1.458623693379791) internal successors, (3349), 2296 states have internal predecessors, (3349), 44 states have call successors, (44), 1 states have call predecessors, (44), 1 states have return successors, (44), 44 states have call predecessors, (44), 44 states have call successors, (44) [2025-02-05 18:12:32,397 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 2342 states to 2342 states and 3437 transitions. [2025-02-05 18:12:32,397 INFO L78 Accepts]: Start accepts. Automaton has 2342 states and 3437 transitions. Word has length 396 [2025-02-05 18:12:32,397 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-02-05 18:12:32,397 INFO L471 AbstractCegarLoop]: Abstraction has 2342 states and 3437 transitions. [2025-02-05 18:12:32,397 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 69.8) internal successors, (349), 5 states have internal predecessors, (349), 1 states have call successors, (10), 1 states have call predecessors, (10), 1 states have return successors, (10), 1 states have call predecessors, (10), 1 states have call successors, (10) [2025-02-05 18:12:32,398 INFO L276 IsEmpty]: Start isEmpty. Operand 2342 states and 3437 transitions. [2025-02-05 18:12:32,400 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 398 [2025-02-05 18:12:32,400 INFO L210 NwaCegarLoop]: Found error trace [2025-02-05 18:12:32,400 INFO L218 NwaCegarLoop]: trace histogram [10, 10, 10, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-02-05 18:12:32,400 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable23 [2025-02-05 18:12:32,400 INFO L396 AbstractCegarLoop]: === Iteration 25 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-02-05 18:12:32,401 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-02-05 18:12:32,401 INFO L85 PathProgramCache]: Analyzing trace with hash 138496027, now seen corresponding path program 1 times [2025-02-05 18:12:32,401 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-02-05 18:12:32,401 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [479034693] [2025-02-05 18:12:32,401 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-02-05 18:12:32,401 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-02-05 18:12:32,451 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 397 statements into 1 equivalence classes. [2025-02-05 18:12:32,946 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 397 of 397 statements. [2025-02-05 18:12:32,946 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-02-05 18:12:32,946 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-02-05 18:12:33,944 INFO L134 CoverageAnalysis]: Checked inductivity of 180 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 180 trivial. 0 not checked. [2025-02-05 18:12:33,944 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-02-05 18:12:33,945 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [479034693] [2025-02-05 18:12:33,945 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [479034693] provided 1 perfect and 0 imperfect interpolant sequences [2025-02-05 18:12:33,945 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-02-05 18:12:33,945 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2025-02-05 18:12:33,945 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1950260586] [2025-02-05 18:12:33,945 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-02-05 18:12:33,945 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 7 states [2025-02-05 18:12:33,945 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-02-05 18:12:33,946 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2025-02-05 18:12:33,946 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=11, Invalid=31, Unknown=0, NotChecked=0, Total=42 [2025-02-05 18:12:33,946 INFO L87 Difference]: Start difference. First operand 2342 states and 3437 transitions. Second operand has 7 states, 7 states have (on average 50.0) internal successors, (350), 7 states have internal predecessors, (350), 1 states have call successors, (10), 1 states have call predecessors, (10), 1 states have return successors, (10), 1 states have call predecessors, (10), 1 states have call successors, (10) [2025-02-05 18:12:34,761 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-02-05 18:12:34,761 INFO L93 Difference]: Finished difference Result 4261 states and 6240 transitions. [2025-02-05 18:12:34,761 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2025-02-05 18:12:34,761 INFO L78 Accepts]: Start accepts. Automaton has has 7 states, 7 states have (on average 50.0) internal successors, (350), 7 states have internal predecessors, (350), 1 states have call successors, (10), 1 states have call predecessors, (10), 1 states have return successors, (10), 1 states have call predecessors, (10), 1 states have call successors, (10) Word has length 397 [2025-02-05 18:12:34,762 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-02-05 18:12:34,767 INFO L225 Difference]: With dead ends: 4261 [2025-02-05 18:12:34,767 INFO L226 Difference]: Without dead ends: 3068 [2025-02-05 18:12:34,768 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 10 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 8 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 2 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=25, Invalid=65, Unknown=0, NotChecked=0, Total=90 [2025-02-05 18:12:34,768 INFO L435 NwaCegarLoop]: 1327 mSDtfsCounter, 2983 mSDsluCounter, 5298 mSDsCounter, 0 mSdLazyCounter, 1488 mSolverCounterSat, 11 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.6s Time, 0 mProtectedPredicate, 0 mProtectedAction, 2993 SdHoareTripleChecker+Valid, 6625 SdHoareTripleChecker+Invalid, 1499 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 11 IncrementalHoareTripleChecker+Valid, 1488 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.7s IncrementalHoareTripleChecker+Time [2025-02-05 18:12:34,768 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [2993 Valid, 6625 Invalid, 1499 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [11 Valid, 1488 Invalid, 0 Unknown, 0 Unchecked, 0.7s Time] [2025-02-05 18:12:34,770 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 3068 states. [2025-02-05 18:12:34,795 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 3068 to 3068. [2025-02-05 18:12:34,797 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 3068 states, 3012 states have (on average 1.455179282868526) internal successors, (4383), 3012 states have internal predecessors, (4383), 54 states have call successors, (54), 1 states have call predecessors, (54), 1 states have return successors, (54), 54 states have call predecessors, (54), 54 states have call successors, (54) [2025-02-05 18:12:34,799 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3068 states to 3068 states and 4491 transitions. [2025-02-05 18:12:34,800 INFO L78 Accepts]: Start accepts. Automaton has 3068 states and 4491 transitions. Word has length 397 [2025-02-05 18:12:34,800 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-02-05 18:12:34,800 INFO L471 AbstractCegarLoop]: Abstraction has 3068 states and 4491 transitions. [2025-02-05 18:12:34,800 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 7 states, 7 states have (on average 50.0) internal successors, (350), 7 states have internal predecessors, (350), 1 states have call successors, (10), 1 states have call predecessors, (10), 1 states have return successors, (10), 1 states have call predecessors, (10), 1 states have call successors, (10) [2025-02-05 18:12:34,800 INFO L276 IsEmpty]: Start isEmpty. Operand 3068 states and 4491 transitions. [2025-02-05 18:12:34,806 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 930 [2025-02-05 18:12:34,806 INFO L210 NwaCegarLoop]: Found error trace [2025-02-05 18:12:34,807 INFO L218 NwaCegarLoop]: trace histogram [20, 20, 20, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-02-05 18:12:34,807 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable24 [2025-02-05 18:12:34,807 INFO L396 AbstractCegarLoop]: === Iteration 26 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-02-05 18:12:34,807 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-02-05 18:12:34,807 INFO L85 PathProgramCache]: Analyzing trace with hash -1945454703, now seen corresponding path program 1 times [2025-02-05 18:12:34,807 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-02-05 18:12:34,807 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [419985455] [2025-02-05 18:12:34,808 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-02-05 18:12:34,808 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-02-05 18:12:34,931 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 929 statements into 1 equivalence classes. [2025-02-05 18:12:35,849 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 929 of 929 statements. [2025-02-05 18:12:35,849 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-02-05 18:12:35,849 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-02-05 18:12:36,890 INFO L134 CoverageAnalysis]: Checked inductivity of 1027 backedges. 267 proven. 0 refuted. 0 times theorem prover too weak. 760 trivial. 0 not checked. [2025-02-05 18:12:36,891 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-02-05 18:12:36,891 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [419985455] [2025-02-05 18:12:36,891 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [419985455] provided 1 perfect and 0 imperfect interpolant sequences [2025-02-05 18:12:36,891 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-02-05 18:12:36,891 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2025-02-05 18:12:36,891 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1338614990] [2025-02-05 18:12:36,891 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-02-05 18:12:36,892 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2025-02-05 18:12:36,892 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-02-05 18:12:36,893 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2025-02-05 18:12:36,893 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=8, Invalid=12, Unknown=0, NotChecked=0, Total=20 [2025-02-05 18:12:36,893 INFO L87 Difference]: Start difference. First operand 3068 states and 4491 transitions. Second operand has 5 states, 5 states have (on average 166.4) internal successors, (832), 5 states have internal predecessors, (832), 2 states have call successors, (20), 1 states have call predecessors, (20), 1 states have return successors, (20), 2 states have call predecessors, (20), 2 states have call successors, (20) [2025-02-05 18:12:37,352 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-02-05 18:12:37,353 INFO L93 Difference]: Finished difference Result 4261 states and 6239 transitions. [2025-02-05 18:12:37,353 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2025-02-05 18:12:37,353 INFO L78 Accepts]: Start accepts. Automaton has has 5 states, 5 states have (on average 166.4) internal successors, (832), 5 states have internal predecessors, (832), 2 states have call successors, (20), 1 states have call predecessors, (20), 1 states have return successors, (20), 2 states have call predecessors, (20), 2 states have call successors, (20) Word has length 929 [2025-02-05 18:12:37,354 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-02-05 18:12:37,360 INFO L225 Difference]: With dead ends: 4261 [2025-02-05 18:12:37,360 INFO L226 Difference]: Without dead ends: 3068 [2025-02-05 18:12:37,361 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 6 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 4 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=13, Invalid=17, Unknown=0, NotChecked=0, Total=30 [2025-02-05 18:12:37,362 INFO L435 NwaCegarLoop]: 1293 mSDtfsCounter, 1430 mSDsluCounter, 1309 mSDsCounter, 0 mSdLazyCounter, 661 mSolverCounterSat, 1 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.3s Time, 0 mProtectedPredicate, 0 mProtectedAction, 1440 SdHoareTripleChecker+Valid, 2602 SdHoareTripleChecker+Invalid, 662 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 1 IncrementalHoareTripleChecker+Valid, 661 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.4s IncrementalHoareTripleChecker+Time [2025-02-05 18:12:37,362 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [1440 Valid, 2602 Invalid, 662 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [1 Valid, 661 Invalid, 0 Unknown, 0 Unchecked, 0.4s Time] [2025-02-05 18:12:37,364 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 3068 states. [2025-02-05 18:12:37,407 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 3068 to 3068. [2025-02-05 18:12:37,410 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 3068 states, 3012 states have (on average 1.454847277556441) internal successors, (4382), 3012 states have internal predecessors, (4382), 54 states have call successors, (54), 1 states have call predecessors, (54), 1 states have return successors, (54), 54 states have call predecessors, (54), 54 states have call successors, (54) [2025-02-05 18:12:37,413 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3068 states to 3068 states and 4490 transitions. [2025-02-05 18:12:37,414 INFO L78 Accepts]: Start accepts. Automaton has 3068 states and 4490 transitions. Word has length 929 [2025-02-05 18:12:37,414 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-02-05 18:12:37,414 INFO L471 AbstractCegarLoop]: Abstraction has 3068 states and 4490 transitions. [2025-02-05 18:12:37,415 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 166.4) internal successors, (832), 5 states have internal predecessors, (832), 2 states have call successors, (20), 1 states have call predecessors, (20), 1 states have return successors, (20), 2 states have call predecessors, (20), 2 states have call successors, (20) [2025-02-05 18:12:37,415 INFO L276 IsEmpty]: Start isEmpty. Operand 3068 states and 4490 transitions. [2025-02-05 18:12:37,427 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 931 [2025-02-05 18:12:37,427 INFO L210 NwaCegarLoop]: Found error trace [2025-02-05 18:12:37,427 INFO L218 NwaCegarLoop]: trace histogram [20, 20, 20, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-02-05 18:12:37,427 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable25 [2025-02-05 18:12:37,428 INFO L396 AbstractCegarLoop]: === Iteration 27 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-02-05 18:12:37,428 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-02-05 18:12:37,428 INFO L85 PathProgramCache]: Analyzing trace with hash -1687323203, now seen corresponding path program 1 times [2025-02-05 18:12:37,428 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-02-05 18:12:37,428 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1515802072] [2025-02-05 18:12:37,428 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-02-05 18:12:37,428 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-02-05 18:12:37,573 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 930 statements into 1 equivalence classes. [2025-02-05 18:12:37,874 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 930 of 930 statements. [2025-02-05 18:12:37,874 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-02-05 18:12:37,874 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-02-05 18:12:38,820 INFO L134 CoverageAnalysis]: Checked inductivity of 1027 backedges. 267 proven. 0 refuted. 0 times theorem prover too weak. 760 trivial. 0 not checked. [2025-02-05 18:12:38,821 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-02-05 18:12:38,821 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1515802072] [2025-02-05 18:12:38,821 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1515802072] provided 1 perfect and 0 imperfect interpolant sequences [2025-02-05 18:12:38,821 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-02-05 18:12:38,821 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2025-02-05 18:12:38,821 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1888438358] [2025-02-05 18:12:38,821 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-02-05 18:12:38,821 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2025-02-05 18:12:38,821 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-02-05 18:12:38,822 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2025-02-05 18:12:38,822 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=8, Invalid=12, Unknown=0, NotChecked=0, Total=20 [2025-02-05 18:12:38,823 INFO L87 Difference]: Start difference. First operand 3068 states and 4490 transitions. Second operand has 5 states, 5 states have (on average 166.6) internal successors, (833), 5 states have internal predecessors, (833), 2 states have call successors, (20), 1 states have call predecessors, (20), 1 states have return successors, (20), 2 states have call predecessors, (20), 2 states have call successors, (20) [2025-02-05 18:12:39,231 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-02-05 18:12:39,231 INFO L93 Difference]: Finished difference Result 4261 states and 6237 transitions. [2025-02-05 18:12:39,231 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2025-02-05 18:12:39,232 INFO L78 Accepts]: Start accepts. Automaton has has 5 states, 5 states have (on average 166.6) internal successors, (833), 5 states have internal predecessors, (833), 2 states have call successors, (20), 1 states have call predecessors, (20), 1 states have return successors, (20), 2 states have call predecessors, (20), 2 states have call successors, (20) Word has length 930 [2025-02-05 18:12:39,232 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-02-05 18:12:39,236 INFO L225 Difference]: With dead ends: 4261 [2025-02-05 18:12:39,236 INFO L226 Difference]: Without dead ends: 3068 [2025-02-05 18:12:39,237 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 6 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 4 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=13, Invalid=17, Unknown=0, NotChecked=0, Total=30 [2025-02-05 18:12:39,237 INFO L435 NwaCegarLoop]: 1292 mSDtfsCounter, 2636 mSDsluCounter, 1294 mSDsCounter, 0 mSdLazyCounter, 661 mSolverCounterSat, 1 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.3s Time, 0 mProtectedPredicate, 0 mProtectedAction, 2646 SdHoareTripleChecker+Valid, 2586 SdHoareTripleChecker+Invalid, 662 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 1 IncrementalHoareTripleChecker+Valid, 661 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.4s IncrementalHoareTripleChecker+Time [2025-02-05 18:12:39,238 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [2646 Valid, 2586 Invalid, 662 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [1 Valid, 661 Invalid, 0 Unknown, 0 Unchecked, 0.4s Time] [2025-02-05 18:12:39,239 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 3068 states. [2025-02-05 18:12:39,260 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 3068 to 3068. [2025-02-05 18:12:39,261 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 3068 states, 3012 states have (on average 1.454515272244356) internal successors, (4381), 3012 states have internal predecessors, (4381), 54 states have call successors, (54), 1 states have call predecessors, (54), 1 states have return successors, (54), 54 states have call predecessors, (54), 54 states have call successors, (54) [2025-02-05 18:12:39,264 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3068 states to 3068 states and 4489 transitions. [2025-02-05 18:12:39,264 INFO L78 Accepts]: Start accepts. Automaton has 3068 states and 4489 transitions. Word has length 930 [2025-02-05 18:12:39,264 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-02-05 18:12:39,264 INFO L471 AbstractCegarLoop]: Abstraction has 3068 states and 4489 transitions. [2025-02-05 18:12:39,264 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 166.6) internal successors, (833), 5 states have internal predecessors, (833), 2 states have call successors, (20), 1 states have call predecessors, (20), 1 states have return successors, (20), 2 states have call predecessors, (20), 2 states have call successors, (20) [2025-02-05 18:12:39,264 INFO L276 IsEmpty]: Start isEmpty. Operand 3068 states and 4489 transitions. [2025-02-05 18:12:39,270 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 932 [2025-02-05 18:12:39,270 INFO L210 NwaCegarLoop]: Found error trace [2025-02-05 18:12:39,270 INFO L218 NwaCegarLoop]: trace histogram [20, 20, 20, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-02-05 18:12:39,271 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable26 [2025-02-05 18:12:39,271 INFO L396 AbstractCegarLoop]: === Iteration 28 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-02-05 18:12:39,271 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-02-05 18:12:39,271 INFO L85 PathProgramCache]: Analyzing trace with hash -960251614, now seen corresponding path program 1 times [2025-02-05 18:12:39,271 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-02-05 18:12:39,271 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1969135688] [2025-02-05 18:12:39,271 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-02-05 18:12:39,271 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-02-05 18:12:39,394 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 931 statements into 1 equivalence classes. [2025-02-05 18:12:39,697 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 931 of 931 statements. [2025-02-05 18:12:39,697 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-02-05 18:12:39,697 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-02-05 18:12:40,626 INFO L134 CoverageAnalysis]: Checked inductivity of 1027 backedges. 267 proven. 0 refuted. 0 times theorem prover too weak. 760 trivial. 0 not checked. [2025-02-05 18:12:40,626 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-02-05 18:12:40,626 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1969135688] [2025-02-05 18:12:40,626 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1969135688] provided 1 perfect and 0 imperfect interpolant sequences [2025-02-05 18:12:40,626 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-02-05 18:12:40,626 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2025-02-05 18:12:40,626 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1422123549] [2025-02-05 18:12:40,626 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-02-05 18:12:40,627 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2025-02-05 18:12:40,627 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-02-05 18:12:40,628 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2025-02-05 18:12:40,628 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=8, Invalid=12, Unknown=0, NotChecked=0, Total=20 [2025-02-05 18:12:40,628 INFO L87 Difference]: Start difference. First operand 3068 states and 4489 transitions. Second operand has 5 states, 5 states have (on average 166.8) internal successors, (834), 5 states have internal predecessors, (834), 2 states have call successors, (20), 1 states have call predecessors, (20), 1 states have return successors, (20), 2 states have call predecessors, (20), 2 states have call successors, (20) [2025-02-05 18:12:41,344 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-02-05 18:12:41,344 INFO L93 Difference]: Finished difference Result 4261 states and 6235 transitions. [2025-02-05 18:12:41,344 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2025-02-05 18:12:41,344 INFO L78 Accepts]: Start accepts. Automaton has has 5 states, 5 states have (on average 166.8) internal successors, (834), 5 states have internal predecessors, (834), 2 states have call successors, (20), 1 states have call predecessors, (20), 1 states have return successors, (20), 2 states have call predecessors, (20), 2 states have call successors, (20) Word has length 931 [2025-02-05 18:12:41,345 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-02-05 18:12:41,349 INFO L225 Difference]: With dead ends: 4261 [2025-02-05 18:12:41,349 INFO L226 Difference]: Without dead ends: 3068 [2025-02-05 18:12:41,351 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 6 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 4 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=13, Invalid=17, Unknown=0, NotChecked=0, Total=30 [2025-02-05 18:12:41,352 INFO L435 NwaCegarLoop]: 998 mSDtfsCounter, 2509 mSDsluCounter, 1000 mSDsCounter, 0 mSdLazyCounter, 1247 mSolverCounterSat, 1 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.6s Time, 0 mProtectedPredicate, 0 mProtectedAction, 2509 SdHoareTripleChecker+Valid, 1998 SdHoareTripleChecker+Invalid, 1248 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 1 IncrementalHoareTripleChecker+Valid, 1247 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.7s IncrementalHoareTripleChecker+Time [2025-02-05 18:12:41,352 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [2509 Valid, 1998 Invalid, 1248 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [1 Valid, 1247 Invalid, 0 Unknown, 0 Unchecked, 0.7s Time] [2025-02-05 18:12:41,354 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 3068 states. [2025-02-05 18:12:41,376 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 3068 to 3068. [2025-02-05 18:12:41,378 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 3068 states, 3012 states have (on average 1.454183266932271) internal successors, (4380), 3012 states have internal predecessors, (4380), 54 states have call successors, (54), 1 states have call predecessors, (54), 1 states have return successors, (54), 54 states have call predecessors, (54), 54 states have call successors, (54) [2025-02-05 18:12:41,381 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3068 states to 3068 states and 4488 transitions. [2025-02-05 18:12:41,381 INFO L78 Accepts]: Start accepts. Automaton has 3068 states and 4488 transitions. Word has length 931 [2025-02-05 18:12:41,381 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-02-05 18:12:41,381 INFO L471 AbstractCegarLoop]: Abstraction has 3068 states and 4488 transitions. [2025-02-05 18:12:41,382 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 166.8) internal successors, (834), 5 states have internal predecessors, (834), 2 states have call successors, (20), 1 states have call predecessors, (20), 1 states have return successors, (20), 2 states have call predecessors, (20), 2 states have call successors, (20) [2025-02-05 18:12:41,382 INFO L276 IsEmpty]: Start isEmpty. Operand 3068 states and 4488 transitions. [2025-02-05 18:12:41,388 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 933 [2025-02-05 18:12:41,388 INFO L210 NwaCegarLoop]: Found error trace [2025-02-05 18:12:41,389 INFO L218 NwaCegarLoop]: trace histogram [20, 20, 20, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-02-05 18:12:41,389 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable27 [2025-02-05 18:12:41,389 INFO L396 AbstractCegarLoop]: === Iteration 29 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-02-05 18:12:41,389 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-02-05 18:12:41,389 INFO L85 PathProgramCache]: Analyzing trace with hash 1077135150, now seen corresponding path program 1 times [2025-02-05 18:12:41,389 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-02-05 18:12:41,389 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2094407412] [2025-02-05 18:12:41,389 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-02-05 18:12:41,389 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-02-05 18:12:41,616 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 932 statements into 1 equivalence classes. [2025-02-05 18:12:41,971 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 932 of 932 statements. [2025-02-05 18:12:41,971 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-02-05 18:12:41,971 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-02-05 18:12:42,933 INFO L134 CoverageAnalysis]: Checked inductivity of 1027 backedges. 267 proven. 0 refuted. 0 times theorem prover too weak. 760 trivial. 0 not checked. [2025-02-05 18:12:42,933 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-02-05 18:12:42,933 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2094407412] [2025-02-05 18:12:42,933 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [2094407412] provided 1 perfect and 0 imperfect interpolant sequences [2025-02-05 18:12:42,933 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-02-05 18:12:42,933 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2025-02-05 18:12:42,933 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [757956923] [2025-02-05 18:12:42,933 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-02-05 18:12:42,938 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2025-02-05 18:12:42,941 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-02-05 18:12:42,943 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2025-02-05 18:12:42,943 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=8, Invalid=12, Unknown=0, NotChecked=0, Total=20 [2025-02-05 18:12:42,944 INFO L87 Difference]: Start difference. First operand 3068 states and 4488 transitions. Second operand has 5 states, 5 states have (on average 167.0) internal successors, (835), 5 states have internal predecessors, (835), 2 states have call successors, (20), 1 states have call predecessors, (20), 1 states have return successors, (20), 2 states have call predecessors, (20), 2 states have call successors, (20) [2025-02-05 18:12:43,404 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-02-05 18:12:43,404 INFO L93 Difference]: Finished difference Result 4261 states and 6233 transitions. [2025-02-05 18:12:43,405 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2025-02-05 18:12:43,406 INFO L78 Accepts]: Start accepts. Automaton has has 5 states, 5 states have (on average 167.0) internal successors, (835), 5 states have internal predecessors, (835), 2 states have call successors, (20), 1 states have call predecessors, (20), 1 states have return successors, (20), 2 states have call predecessors, (20), 2 states have call successors, (20) Word has length 932 [2025-02-05 18:12:43,406 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-02-05 18:12:43,415 INFO L225 Difference]: With dead ends: 4261 [2025-02-05 18:12:43,419 INFO L226 Difference]: Without dead ends: 3068 [2025-02-05 18:12:43,421 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 6 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 4 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=13, Invalid=17, Unknown=0, NotChecked=0, Total=30 [2025-02-05 18:12:43,422 INFO L435 NwaCegarLoop]: 1292 mSDtfsCounter, 1372 mSDsluCounter, 1308 mSDsCounter, 0 mSdLazyCounter, 657 mSolverCounterSat, 1 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.3s Time, 0 mProtectedPredicate, 0 mProtectedAction, 1382 SdHoareTripleChecker+Valid, 2600 SdHoareTripleChecker+Invalid, 658 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 1 IncrementalHoareTripleChecker+Valid, 657 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.4s IncrementalHoareTripleChecker+Time [2025-02-05 18:12:43,422 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [1382 Valid, 2600 Invalid, 658 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [1 Valid, 657 Invalid, 0 Unknown, 0 Unchecked, 0.4s Time] [2025-02-05 18:12:43,427 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 3068 states. [2025-02-05 18:12:43,514 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 3068 to 3068. [2025-02-05 18:12:43,516 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 3068 states, 3012 states have (on average 1.453851261620186) internal successors, (4379), 3012 states have internal predecessors, (4379), 54 states have call successors, (54), 1 states have call predecessors, (54), 1 states have return successors, (54), 54 states have call predecessors, (54), 54 states have call successors, (54) [2025-02-05 18:12:43,524 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3068 states to 3068 states and 4487 transitions. [2025-02-05 18:12:43,528 INFO L78 Accepts]: Start accepts. Automaton has 3068 states and 4487 transitions. Word has length 932 [2025-02-05 18:12:43,529 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-02-05 18:12:43,529 INFO L471 AbstractCegarLoop]: Abstraction has 3068 states and 4487 transitions. [2025-02-05 18:12:43,529 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 167.0) internal successors, (835), 5 states have internal predecessors, (835), 2 states have call successors, (20), 1 states have call predecessors, (20), 1 states have return successors, (20), 2 states have call predecessors, (20), 2 states have call successors, (20) [2025-02-05 18:12:43,529 INFO L276 IsEmpty]: Start isEmpty. Operand 3068 states and 4487 transitions. [2025-02-05 18:12:43,551 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 934 [2025-02-05 18:12:43,555 INFO L210 NwaCegarLoop]: Found error trace [2025-02-05 18:12:43,556 INFO L218 NwaCegarLoop]: trace histogram [20, 20, 20, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-02-05 18:12:43,556 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable28 [2025-02-05 18:12:43,556 INFO L396 AbstractCegarLoop]: === Iteration 30 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-02-05 18:12:43,557 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-02-05 18:12:43,557 INFO L85 PathProgramCache]: Analyzing trace with hash 1446388542, now seen corresponding path program 1 times [2025-02-05 18:12:43,557 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-02-05 18:12:43,557 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1800223744] [2025-02-05 18:12:43,557 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-02-05 18:12:43,557 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-02-05 18:12:43,824 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 933 statements into 1 equivalence classes. [2025-02-05 18:12:44,267 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 933 of 933 statements. [2025-02-05 18:12:44,268 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-02-05 18:12:44,268 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-02-05 18:12:45,268 INFO L134 CoverageAnalysis]: Checked inductivity of 1027 backedges. 267 proven. 0 refuted. 0 times theorem prover too weak. 760 trivial. 0 not checked. [2025-02-05 18:12:45,268 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-02-05 18:12:45,268 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1800223744] [2025-02-05 18:12:45,268 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1800223744] provided 1 perfect and 0 imperfect interpolant sequences [2025-02-05 18:12:45,268 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-02-05 18:12:45,268 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2025-02-05 18:12:45,268 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1946094738] [2025-02-05 18:12:45,268 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-02-05 18:12:45,269 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2025-02-05 18:12:45,269 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-02-05 18:12:45,270 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2025-02-05 18:12:45,270 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=8, Invalid=12, Unknown=0, NotChecked=0, Total=20 [2025-02-05 18:12:45,270 INFO L87 Difference]: Start difference. First operand 3068 states and 4487 transitions. Second operand has 5 states, 5 states have (on average 167.2) internal successors, (836), 5 states have internal predecessors, (836), 2 states have call successors, (20), 1 states have call predecessors, (20), 1 states have return successors, (20), 2 states have call predecessors, (20), 2 states have call successors, (20) [2025-02-05 18:12:45,616 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-02-05 18:12:45,616 INFO L93 Difference]: Finished difference Result 4261 states and 6231 transitions. [2025-02-05 18:12:45,617 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2025-02-05 18:12:45,617 INFO L78 Accepts]: Start accepts. Automaton has has 5 states, 5 states have (on average 167.2) internal successors, (836), 5 states have internal predecessors, (836), 2 states have call successors, (20), 1 states have call predecessors, (20), 1 states have return successors, (20), 2 states have call predecessors, (20), 2 states have call successors, (20) Word has length 933 [2025-02-05 18:12:45,617 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-02-05 18:12:45,621 INFO L225 Difference]: With dead ends: 4261 [2025-02-05 18:12:45,621 INFO L226 Difference]: Without dead ends: 3068 [2025-02-05 18:12:45,622 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 6 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 4 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=13, Invalid=17, Unknown=0, NotChecked=0, Total=30 [2025-02-05 18:12:45,623 INFO L435 NwaCegarLoop]: 1291 mSDtfsCounter, 2520 mSDsluCounter, 1293 mSDsCounter, 0 mSdLazyCounter, 657 mSolverCounterSat, 1 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.3s Time, 0 mProtectedPredicate, 0 mProtectedAction, 2530 SdHoareTripleChecker+Valid, 2584 SdHoareTripleChecker+Invalid, 658 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 1 IncrementalHoareTripleChecker+Valid, 657 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.3s IncrementalHoareTripleChecker+Time [2025-02-05 18:12:45,624 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [2530 Valid, 2584 Invalid, 658 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [1 Valid, 657 Invalid, 0 Unknown, 0 Unchecked, 0.3s Time] [2025-02-05 18:12:45,626 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 3068 states. [2025-02-05 18:12:45,645 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 3068 to 3068. [2025-02-05 18:12:45,647 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 3068 states, 3012 states have (on average 1.453519256308101) internal successors, (4378), 3012 states have internal predecessors, (4378), 54 states have call successors, (54), 1 states have call predecessors, (54), 1 states have return successors, (54), 54 states have call predecessors, (54), 54 states have call successors, (54) [2025-02-05 18:12:45,649 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3068 states to 3068 states and 4486 transitions. [2025-02-05 18:12:45,649 INFO L78 Accepts]: Start accepts. Automaton has 3068 states and 4486 transitions. Word has length 933 [2025-02-05 18:12:45,650 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-02-05 18:12:45,650 INFO L471 AbstractCegarLoop]: Abstraction has 3068 states and 4486 transitions. [2025-02-05 18:12:45,650 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 167.2) internal successors, (836), 5 states have internal predecessors, (836), 2 states have call successors, (20), 1 states have call predecessors, (20), 1 states have return successors, (20), 2 states have call predecessors, (20), 2 states have call successors, (20) [2025-02-05 18:12:45,650 INFO L276 IsEmpty]: Start isEmpty. Operand 3068 states and 4486 transitions. [2025-02-05 18:12:45,656 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 935 [2025-02-05 18:12:45,656 INFO L210 NwaCegarLoop]: Found error trace [2025-02-05 18:12:45,656 INFO L218 NwaCegarLoop]: trace histogram [20, 20, 20, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-02-05 18:12:45,657 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable29 [2025-02-05 18:12:45,657 INFO L396 AbstractCegarLoop]: === Iteration 31 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-02-05 18:12:45,657 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-02-05 18:12:45,657 INFO L85 PathProgramCache]: Analyzing trace with hash -801768513, now seen corresponding path program 1 times [2025-02-05 18:12:45,657 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-02-05 18:12:45,658 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1343245767] [2025-02-05 18:12:45,658 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-02-05 18:12:45,658 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-02-05 18:12:45,836 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 934 statements into 1 equivalence classes. [2025-02-05 18:12:46,158 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 934 of 934 statements. [2025-02-05 18:12:46,158 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-02-05 18:12:46,158 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-02-05 18:12:47,089 INFO L134 CoverageAnalysis]: Checked inductivity of 1027 backedges. 267 proven. 0 refuted. 0 times theorem prover too weak. 760 trivial. 0 not checked. [2025-02-05 18:12:47,089 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-02-05 18:12:47,089 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1343245767] [2025-02-05 18:12:47,089 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1343245767] provided 1 perfect and 0 imperfect interpolant sequences [2025-02-05 18:12:47,089 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-02-05 18:12:47,089 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2025-02-05 18:12:47,090 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [800234050] [2025-02-05 18:12:47,090 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-02-05 18:12:47,090 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2025-02-05 18:12:47,090 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-02-05 18:12:47,091 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2025-02-05 18:12:47,091 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=8, Invalid=12, Unknown=0, NotChecked=0, Total=20 [2025-02-05 18:12:47,091 INFO L87 Difference]: Start difference. First operand 3068 states and 4486 transitions. Second operand has 5 states, 5 states have (on average 167.4) internal successors, (837), 5 states have internal predecessors, (837), 2 states have call successors, (20), 1 states have call predecessors, (20), 1 states have return successors, (20), 2 states have call predecessors, (20), 2 states have call successors, (20) [2025-02-05 18:12:47,785 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-02-05 18:12:47,785 INFO L93 Difference]: Finished difference Result 4261 states and 6229 transitions. [2025-02-05 18:12:47,785 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2025-02-05 18:12:47,785 INFO L78 Accepts]: Start accepts. Automaton has has 5 states, 5 states have (on average 167.4) internal successors, (837), 5 states have internal predecessors, (837), 2 states have call successors, (20), 1 states have call predecessors, (20), 1 states have return successors, (20), 2 states have call predecessors, (20), 2 states have call successors, (20) Word has length 934 [2025-02-05 18:12:47,786 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-02-05 18:12:47,790 INFO L225 Difference]: With dead ends: 4261 [2025-02-05 18:12:47,790 INFO L226 Difference]: Without dead ends: 3068 [2025-02-05 18:12:47,791 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 6 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 4 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=13, Invalid=17, Unknown=0, NotChecked=0, Total=30 [2025-02-05 18:12:47,791 INFO L435 NwaCegarLoop]: 996 mSDtfsCounter, 1245 mSDsluCounter, 1012 mSDsCounter, 0 mSdLazyCounter, 1245 mSolverCounterSat, 1 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.6s Time, 0 mProtectedPredicate, 0 mProtectedAction, 1245 SdHoareTripleChecker+Valid, 2008 SdHoareTripleChecker+Invalid, 1246 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 1 IncrementalHoareTripleChecker+Valid, 1245 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.7s IncrementalHoareTripleChecker+Time [2025-02-05 18:12:47,791 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [1245 Valid, 2008 Invalid, 1246 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [1 Valid, 1245 Invalid, 0 Unknown, 0 Unchecked, 0.7s Time] [2025-02-05 18:12:47,793 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 3068 states. [2025-02-05 18:12:47,823 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 3068 to 3068. [2025-02-05 18:12:47,825 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 3068 states, 3012 states have (on average 1.453187250996016) internal successors, (4377), 3012 states have internal predecessors, (4377), 54 states have call successors, (54), 1 states have call predecessors, (54), 1 states have return successors, (54), 54 states have call predecessors, (54), 54 states have call successors, (54) [2025-02-05 18:12:47,827 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3068 states to 3068 states and 4485 transitions. [2025-02-05 18:12:47,828 INFO L78 Accepts]: Start accepts. Automaton has 3068 states and 4485 transitions. Word has length 934 [2025-02-05 18:12:47,829 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-02-05 18:12:47,829 INFO L471 AbstractCegarLoop]: Abstraction has 3068 states and 4485 transitions. [2025-02-05 18:12:47,829 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 167.4) internal successors, (837), 5 states have internal predecessors, (837), 2 states have call successors, (20), 1 states have call predecessors, (20), 1 states have return successors, (20), 2 states have call predecessors, (20), 2 states have call successors, (20) [2025-02-05 18:12:47,829 INFO L276 IsEmpty]: Start isEmpty. Operand 3068 states and 4485 transitions. [2025-02-05 18:12:47,835 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 936 [2025-02-05 18:12:47,835 INFO L210 NwaCegarLoop]: Found error trace [2025-02-05 18:12:47,835 INFO L218 NwaCegarLoop]: trace histogram [20, 20, 20, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-02-05 18:12:47,835 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable30 [2025-02-05 18:12:47,836 INFO L396 AbstractCegarLoop]: === Iteration 32 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-02-05 18:12:47,836 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-02-05 18:12:47,836 INFO L85 PathProgramCache]: Analyzing trace with hash -683579729, now seen corresponding path program 1 times [2025-02-05 18:12:47,836 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-02-05 18:12:47,836 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1958760514] [2025-02-05 18:12:47,836 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-02-05 18:12:47,837 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-02-05 18:12:48,010 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 935 statements into 1 equivalence classes. [2025-02-05 18:12:48,310 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 935 of 935 statements. [2025-02-05 18:12:48,310 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-02-05 18:12:48,310 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-02-05 18:12:49,316 INFO L134 CoverageAnalysis]: Checked inductivity of 1027 backedges. 267 proven. 0 refuted. 0 times theorem prover too weak. 760 trivial. 0 not checked. [2025-02-05 18:12:49,317 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-02-05 18:12:49,317 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1958760514] [2025-02-05 18:12:49,317 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1958760514] provided 1 perfect and 0 imperfect interpolant sequences [2025-02-05 18:12:49,317 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-02-05 18:12:49,317 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2025-02-05 18:12:49,317 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1582120508] [2025-02-05 18:12:49,317 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-02-05 18:12:49,318 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2025-02-05 18:12:49,318 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-02-05 18:12:49,319 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2025-02-05 18:12:49,319 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=8, Invalid=12, Unknown=0, NotChecked=0, Total=20 [2025-02-05 18:12:49,321 INFO L87 Difference]: Start difference. First operand 3068 states and 4485 transitions. Second operand has 5 states, 5 states have (on average 167.6) internal successors, (838), 5 states have internal predecessors, (838), 2 states have call successors, (20), 1 states have call predecessors, (20), 1 states have return successors, (20), 2 states have call predecessors, (20), 2 states have call successors, (20) [2025-02-05 18:12:49,812 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-02-05 18:12:49,812 INFO L93 Difference]: Finished difference Result 4261 states and 6227 transitions. [2025-02-05 18:12:49,812 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2025-02-05 18:12:49,812 INFO L78 Accepts]: Start accepts. Automaton has has 5 states, 5 states have (on average 167.6) internal successors, (838), 5 states have internal predecessors, (838), 2 states have call successors, (20), 1 states have call predecessors, (20), 1 states have return successors, (20), 2 states have call predecessors, (20), 2 states have call successors, (20) Word has length 935 [2025-02-05 18:12:49,813 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-02-05 18:12:49,816 INFO L225 Difference]: With dead ends: 4261 [2025-02-05 18:12:49,816 INFO L226 Difference]: Without dead ends: 3068 [2025-02-05 18:12:49,819 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 6 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 4 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=13, Invalid=17, Unknown=0, NotChecked=0, Total=30 [2025-02-05 18:12:49,819 INFO L435 NwaCegarLoop]: 1291 mSDtfsCounter, 2420 mSDsluCounter, 1293 mSDsCounter, 0 mSdLazyCounter, 653 mSolverCounterSat, 1 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.4s Time, 0 mProtectedPredicate, 0 mProtectedAction, 2430 SdHoareTripleChecker+Valid, 2584 SdHoareTripleChecker+Invalid, 654 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 1 IncrementalHoareTripleChecker+Valid, 653 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.4s IncrementalHoareTripleChecker+Time [2025-02-05 18:12:49,820 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [2430 Valid, 2584 Invalid, 654 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [1 Valid, 653 Invalid, 0 Unknown, 0 Unchecked, 0.4s Time] [2025-02-05 18:12:49,822 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 3068 states. [2025-02-05 18:12:49,882 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 3068 to 3068. [2025-02-05 18:12:49,889 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 3068 states, 3012 states have (on average 1.452855245683931) internal successors, (4376), 3012 states have internal predecessors, (4376), 54 states have call successors, (54), 1 states have call predecessors, (54), 1 states have return successors, (54), 54 states have call predecessors, (54), 54 states have call successors, (54) [2025-02-05 18:12:49,897 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3068 states to 3068 states and 4484 transitions. [2025-02-05 18:12:49,898 INFO L78 Accepts]: Start accepts. Automaton has 3068 states and 4484 transitions. Word has length 935 [2025-02-05 18:12:49,898 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-02-05 18:12:49,898 INFO L471 AbstractCegarLoop]: Abstraction has 3068 states and 4484 transitions. [2025-02-05 18:12:49,898 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 167.6) internal successors, (838), 5 states have internal predecessors, (838), 2 states have call successors, (20), 1 states have call predecessors, (20), 1 states have return successors, (20), 2 states have call predecessors, (20), 2 states have call successors, (20) [2025-02-05 18:12:49,898 INFO L276 IsEmpty]: Start isEmpty. Operand 3068 states and 4484 transitions. [2025-02-05 18:12:49,912 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 937 [2025-02-05 18:12:49,913 INFO L210 NwaCegarLoop]: Found error trace [2025-02-05 18:12:49,913 INFO L218 NwaCegarLoop]: trace histogram [20, 20, 20, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-02-05 18:12:49,913 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable31 [2025-02-05 18:12:49,913 INFO L396 AbstractCegarLoop]: === Iteration 33 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-02-05 18:12:49,914 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-02-05 18:12:49,914 INFO L85 PathProgramCache]: Analyzing trace with hash 426956891, now seen corresponding path program 1 times [2025-02-05 18:12:49,914 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-02-05 18:12:49,914 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1171652913] [2025-02-05 18:12:49,914 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-02-05 18:12:49,914 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-02-05 18:12:50,070 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 936 statements into 1 equivalence classes. [2025-02-05 18:12:50,379 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 936 of 936 statements. [2025-02-05 18:12:50,379 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-02-05 18:12:50,379 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-02-05 18:12:51,412 INFO L134 CoverageAnalysis]: Checked inductivity of 1027 backedges. 267 proven. 0 refuted. 0 times theorem prover too weak. 760 trivial. 0 not checked. [2025-02-05 18:12:51,416 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-02-05 18:12:51,416 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1171652913] [2025-02-05 18:12:51,416 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1171652913] provided 1 perfect and 0 imperfect interpolant sequences [2025-02-05 18:12:51,416 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-02-05 18:12:51,416 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2025-02-05 18:12:51,416 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1862666148] [2025-02-05 18:12:51,419 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-02-05 18:12:51,420 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2025-02-05 18:12:51,420 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-02-05 18:12:51,421 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2025-02-05 18:12:51,421 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=8, Invalid=12, Unknown=0, NotChecked=0, Total=20 [2025-02-05 18:12:51,421 INFO L87 Difference]: Start difference. First operand 3068 states and 4484 transitions. Second operand has 5 states, 5 states have (on average 167.8) internal successors, (839), 5 states have internal predecessors, (839), 2 states have call successors, (20), 1 states have call predecessors, (20), 1 states have return successors, (20), 2 states have call predecessors, (20), 2 states have call successors, (20) [2025-02-05 18:12:51,867 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-02-05 18:12:51,867 INFO L93 Difference]: Finished difference Result 4261 states and 6225 transitions. [2025-02-05 18:12:51,867 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2025-02-05 18:12:51,868 INFO L78 Accepts]: Start accepts. Automaton has has 5 states, 5 states have (on average 167.8) internal successors, (839), 5 states have internal predecessors, (839), 2 states have call successors, (20), 1 states have call predecessors, (20), 1 states have return successors, (20), 2 states have call predecessors, (20), 2 states have call successors, (20) Word has length 936 [2025-02-05 18:12:51,868 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-02-05 18:12:51,871 INFO L225 Difference]: With dead ends: 4261 [2025-02-05 18:12:51,872 INFO L226 Difference]: Without dead ends: 3068 [2025-02-05 18:12:51,873 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 6 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 4 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=13, Invalid=17, Unknown=0, NotChecked=0, Total=30 [2025-02-05 18:12:51,874 INFO L435 NwaCegarLoop]: 1290 mSDtfsCounter, 1306 mSDsluCounter, 1306 mSDsCounter, 0 mSdLazyCounter, 653 mSolverCounterSat, 1 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.3s Time, 0 mProtectedPredicate, 0 mProtectedAction, 1316 SdHoareTripleChecker+Valid, 2596 SdHoareTripleChecker+Invalid, 654 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 1 IncrementalHoareTripleChecker+Valid, 653 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.4s IncrementalHoareTripleChecker+Time [2025-02-05 18:12:51,874 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [1316 Valid, 2596 Invalid, 654 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [1 Valid, 653 Invalid, 0 Unknown, 0 Unchecked, 0.4s Time] [2025-02-05 18:12:51,875 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 3068 states. [2025-02-05 18:12:51,930 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 3068 to 3068. [2025-02-05 18:12:51,932 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 3068 states, 3012 states have (on average 1.452523240371846) internal successors, (4375), 3012 states have internal predecessors, (4375), 54 states have call successors, (54), 1 states have call predecessors, (54), 1 states have return successors, (54), 54 states have call predecessors, (54), 54 states have call successors, (54) [2025-02-05 18:12:51,938 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3068 states to 3068 states and 4483 transitions. [2025-02-05 18:12:51,939 INFO L78 Accepts]: Start accepts. Automaton has 3068 states and 4483 transitions. Word has length 936 [2025-02-05 18:12:51,939 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-02-05 18:12:51,939 INFO L471 AbstractCegarLoop]: Abstraction has 3068 states and 4483 transitions. [2025-02-05 18:12:51,943 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 167.8) internal successors, (839), 5 states have internal predecessors, (839), 2 states have call successors, (20), 1 states have call predecessors, (20), 1 states have return successors, (20), 2 states have call predecessors, (20), 2 states have call successors, (20) [2025-02-05 18:12:51,945 INFO L276 IsEmpty]: Start isEmpty. Operand 3068 states and 4483 transitions. [2025-02-05 18:12:51,965 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 938 [2025-02-05 18:12:51,965 INFO L210 NwaCegarLoop]: Found error trace [2025-02-05 18:12:51,966 INFO L218 NwaCegarLoop]: trace histogram [20, 20, 20, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-02-05 18:12:51,966 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable32 [2025-02-05 18:12:51,966 INFO L396 AbstractCegarLoop]: === Iteration 34 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-02-05 18:12:51,966 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-02-05 18:12:51,967 INFO L85 PathProgramCache]: Analyzing trace with hash 619906368, now seen corresponding path program 1 times [2025-02-05 18:12:51,967 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-02-05 18:12:51,967 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [666141911] [2025-02-05 18:12:51,967 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-02-05 18:12:51,967 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-02-05 18:12:52,180 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 937 statements into 1 equivalence classes. [2025-02-05 18:12:52,698 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 937 of 937 statements. [2025-02-05 18:12:52,699 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-02-05 18:12:52,699 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-02-05 18:12:53,684 INFO L134 CoverageAnalysis]: Checked inductivity of 1027 backedges. 267 proven. 0 refuted. 0 times theorem prover too weak. 760 trivial. 0 not checked. [2025-02-05 18:12:53,684 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-02-05 18:12:53,684 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [666141911] [2025-02-05 18:12:53,684 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [666141911] provided 1 perfect and 0 imperfect interpolant sequences [2025-02-05 18:12:53,684 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-02-05 18:12:53,684 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2025-02-05 18:12:53,684 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1464741160] [2025-02-05 18:12:53,684 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-02-05 18:12:53,685 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2025-02-05 18:12:53,685 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-02-05 18:12:53,686 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2025-02-05 18:12:53,686 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=8, Invalid=12, Unknown=0, NotChecked=0, Total=20 [2025-02-05 18:12:53,686 INFO L87 Difference]: Start difference. First operand 3068 states and 4483 transitions. Second operand has 5 states, 5 states have (on average 168.0) internal successors, (840), 5 states have internal predecessors, (840), 2 states have call successors, (20), 1 states have call predecessors, (20), 1 states have return successors, (20), 2 states have call predecessors, (20), 2 states have call successors, (20) [2025-02-05 18:12:54,380 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-02-05 18:12:54,380 INFO L93 Difference]: Finished difference Result 4261 states and 6223 transitions. [2025-02-05 18:12:54,380 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2025-02-05 18:12:54,380 INFO L78 Accepts]: Start accepts. Automaton has has 5 states, 5 states have (on average 168.0) internal successors, (840), 5 states have internal predecessors, (840), 2 states have call successors, (20), 1 states have call predecessors, (20), 1 states have return successors, (20), 2 states have call predecessors, (20), 2 states have call successors, (20) Word has length 937 [2025-02-05 18:12:54,381 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-02-05 18:12:54,384 INFO L225 Difference]: With dead ends: 4261 [2025-02-05 18:12:54,384 INFO L226 Difference]: Without dead ends: 3068 [2025-02-05 18:12:54,385 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 6 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 4 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=13, Invalid=17, Unknown=0, NotChecked=0, Total=30 [2025-02-05 18:12:54,385 INFO L435 NwaCegarLoop]: 994 mSDtfsCounter, 2277 mSDsluCounter, 996 mSDsCounter, 0 mSdLazyCounter, 1243 mSolverCounterSat, 1 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.6s Time, 0 mProtectedPredicate, 0 mProtectedAction, 2277 SdHoareTripleChecker+Valid, 1990 SdHoareTripleChecker+Invalid, 1244 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 1 IncrementalHoareTripleChecker+Valid, 1243 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.7s IncrementalHoareTripleChecker+Time [2025-02-05 18:12:54,385 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [2277 Valid, 1990 Invalid, 1244 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [1 Valid, 1243 Invalid, 0 Unknown, 0 Unchecked, 0.7s Time] [2025-02-05 18:12:54,387 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 3068 states. [2025-02-05 18:12:54,407 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 3068 to 3068. [2025-02-05 18:12:54,409 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 3068 states, 3012 states have (on average 1.452191235059761) internal successors, (4374), 3012 states have internal predecessors, (4374), 54 states have call successors, (54), 1 states have call predecessors, (54), 1 states have return successors, (54), 54 states have call predecessors, (54), 54 states have call successors, (54) [2025-02-05 18:12:54,411 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3068 states to 3068 states and 4482 transitions. [2025-02-05 18:12:54,412 INFO L78 Accepts]: Start accepts. Automaton has 3068 states and 4482 transitions. Word has length 937 [2025-02-05 18:12:54,412 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-02-05 18:12:54,412 INFO L471 AbstractCegarLoop]: Abstraction has 3068 states and 4482 transitions. [2025-02-05 18:12:54,412 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 168.0) internal successors, (840), 5 states have internal predecessors, (840), 2 states have call successors, (20), 1 states have call predecessors, (20), 1 states have return successors, (20), 2 states have call predecessors, (20), 2 states have call successors, (20) [2025-02-05 18:12:54,412 INFO L276 IsEmpty]: Start isEmpty. Operand 3068 states and 4482 transitions. [2025-02-05 18:12:54,418 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 939 [2025-02-05 18:12:54,418 INFO L210 NwaCegarLoop]: Found error trace [2025-02-05 18:12:54,419 INFO L218 NwaCegarLoop]: trace histogram [20, 20, 20, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-02-05 18:12:54,419 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable33 [2025-02-05 18:12:54,419 INFO L396 AbstractCegarLoop]: === Iteration 35 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-02-05 18:12:54,420 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-02-05 18:12:54,420 INFO L85 PathProgramCache]: Analyzing trace with hash 767573708, now seen corresponding path program 1 times [2025-02-05 18:12:54,420 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-02-05 18:12:54,420 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [813548161] [2025-02-05 18:12:54,420 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-02-05 18:12:54,420 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-02-05 18:12:54,544 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 938 statements into 1 equivalence classes. [2025-02-05 18:12:55,420 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 938 of 938 statements. [2025-02-05 18:12:55,421 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-02-05 18:12:55,421 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-02-05 18:12:56,773 INFO L134 CoverageAnalysis]: Checked inductivity of 1027 backedges. 267 proven. 0 refuted. 0 times theorem prover too weak. 760 trivial. 0 not checked. [2025-02-05 18:12:56,773 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-02-05 18:12:56,774 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [813548161] [2025-02-05 18:12:56,774 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [813548161] provided 1 perfect and 0 imperfect interpolant sequences [2025-02-05 18:12:56,774 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-02-05 18:12:56,774 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2025-02-05 18:12:56,774 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1305168178] [2025-02-05 18:12:56,774 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-02-05 18:12:56,775 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2025-02-05 18:12:56,775 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-02-05 18:12:56,775 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2025-02-05 18:12:56,775 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2025-02-05 18:12:56,776 INFO L87 Difference]: Start difference. First operand 3068 states and 4482 transitions. Second operand has 4 states, 4 states have (on average 210.25) internal successors, (841), 4 states have internal predecessors, (841), 2 states have call successors, (20), 1 states have call predecessors, (20), 1 states have return successors, (20), 2 states have call predecessors, (20), 2 states have call successors, (20) [2025-02-05 18:12:57,159 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-02-05 18:12:57,159 INFO L93 Difference]: Finished difference Result 4261 states and 6221 transitions. [2025-02-05 18:12:57,159 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2025-02-05 18:12:57,160 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 4 states have (on average 210.25) internal successors, (841), 4 states have internal predecessors, (841), 2 states have call successors, (20), 1 states have call predecessors, (20), 1 states have return successors, (20), 2 states have call predecessors, (20), 2 states have call successors, (20) Word has length 938 [2025-02-05 18:12:57,160 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-02-05 18:12:57,163 INFO L225 Difference]: With dead ends: 4261 [2025-02-05 18:12:57,163 INFO L226 Difference]: Without dead ends: 3068 [2025-02-05 18:12:57,164 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 7 GetRequests, 4 SyntacticMatches, 0 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=9, Invalid=11, Unknown=0, NotChecked=0, Total=20 [2025-02-05 18:12:57,164 INFO L435 NwaCegarLoop]: 1289 mSDtfsCounter, 1207 mSDsluCounter, 1291 mSDsCounter, 0 mSdLazyCounter, 651 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.3s Time, 0 mProtectedPredicate, 0 mProtectedAction, 1207 SdHoareTripleChecker+Valid, 2580 SdHoareTripleChecker+Invalid, 651 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 651 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.4s IncrementalHoareTripleChecker+Time [2025-02-05 18:12:57,164 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [1207 Valid, 2580 Invalid, 651 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 651 Invalid, 0 Unknown, 0 Unchecked, 0.4s Time] [2025-02-05 18:12:57,170 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 3068 states. [2025-02-05 18:12:57,211 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 3068 to 3068. [2025-02-05 18:12:57,214 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 3068 states, 3012 states have (on average 1.451859229747676) internal successors, (4373), 3012 states have internal predecessors, (4373), 54 states have call successors, (54), 1 states have call predecessors, (54), 1 states have return successors, (54), 54 states have call predecessors, (54), 54 states have call successors, (54) [2025-02-05 18:12:57,216 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3068 states to 3068 states and 4481 transitions. [2025-02-05 18:12:57,217 INFO L78 Accepts]: Start accepts. Automaton has 3068 states and 4481 transitions. Word has length 938 [2025-02-05 18:12:57,217 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-02-05 18:12:57,217 INFO L471 AbstractCegarLoop]: Abstraction has 3068 states and 4481 transitions. [2025-02-05 18:12:57,217 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 210.25) internal successors, (841), 4 states have internal predecessors, (841), 2 states have call successors, (20), 1 states have call predecessors, (20), 1 states have return successors, (20), 2 states have call predecessors, (20), 2 states have call successors, (20) [2025-02-05 18:12:57,217 INFO L276 IsEmpty]: Start isEmpty. Operand 3068 states and 4481 transitions. [2025-02-05 18:12:57,223 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 940 [2025-02-05 18:12:57,223 INFO L210 NwaCegarLoop]: Found error trace [2025-02-05 18:12:57,224 INFO L218 NwaCegarLoop]: trace histogram [20, 20, 20, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-02-05 18:12:57,224 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable34 [2025-02-05 18:12:57,224 INFO L396 AbstractCegarLoop]: === Iteration 36 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-02-05 18:12:57,225 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-02-05 18:12:57,225 INFO L85 PathProgramCache]: Analyzing trace with hash -1372181999, now seen corresponding path program 1 times [2025-02-05 18:12:57,225 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-02-05 18:12:57,225 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1849773615] [2025-02-05 18:12:57,225 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-02-05 18:12:57,225 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-02-05 18:12:57,349 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 939 statements into 1 equivalence classes. [2025-02-05 18:12:58,282 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 939 of 939 statements. [2025-02-05 18:12:58,282 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-02-05 18:12:58,282 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-02-05 18:12:59,586 INFO L134 CoverageAnalysis]: Checked inductivity of 1027 backedges. 267 proven. 0 refuted. 0 times theorem prover too weak. 760 trivial. 0 not checked. [2025-02-05 18:12:59,586 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-02-05 18:12:59,586 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1849773615] [2025-02-05 18:12:59,586 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1849773615] provided 1 perfect and 0 imperfect interpolant sequences [2025-02-05 18:12:59,586 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-02-05 18:12:59,587 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2025-02-05 18:12:59,587 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1650358663] [2025-02-05 18:12:59,587 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-02-05 18:12:59,587 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2025-02-05 18:12:59,587 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-02-05 18:12:59,588 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2025-02-05 18:12:59,588 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2025-02-05 18:12:59,588 INFO L87 Difference]: Start difference. First operand 3068 states and 4481 transitions. Second operand has 4 states, 4 states have (on average 210.5) internal successors, (842), 4 states have internal predecessors, (842), 2 states have call successors, (20), 1 states have call predecessors, (20), 1 states have return successors, (20), 2 states have call predecessors, (20), 2 states have call successors, (20) [2025-02-05 18:12:59,972 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-02-05 18:12:59,972 INFO L93 Difference]: Finished difference Result 4261 states and 6219 transitions. [2025-02-05 18:12:59,973 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2025-02-05 18:12:59,973 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 4 states have (on average 210.5) internal successors, (842), 4 states have internal predecessors, (842), 2 states have call successors, (20), 1 states have call predecessors, (20), 1 states have return successors, (20), 2 states have call predecessors, (20), 2 states have call successors, (20) Word has length 939 [2025-02-05 18:12:59,973 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-02-05 18:12:59,976 INFO L225 Difference]: With dead ends: 4261 [2025-02-05 18:12:59,976 INFO L226 Difference]: Without dead ends: 3068 [2025-02-05 18:12:59,977 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 7 GetRequests, 4 SyntacticMatches, 0 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=9, Invalid=11, Unknown=0, NotChecked=0, Total=20 [2025-02-05 18:12:59,977 INFO L435 NwaCegarLoop]: 1289 mSDtfsCounter, 1150 mSDsluCounter, 1291 mSDsCounter, 0 mSdLazyCounter, 649 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.3s Time, 0 mProtectedPredicate, 0 mProtectedAction, 1150 SdHoareTripleChecker+Valid, 2580 SdHoareTripleChecker+Invalid, 649 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 649 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.4s IncrementalHoareTripleChecker+Time [2025-02-05 18:12:59,978 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [1150 Valid, 2580 Invalid, 649 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 649 Invalid, 0 Unknown, 0 Unchecked, 0.4s Time] [2025-02-05 18:12:59,979 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 3068 states. [2025-02-05 18:12:59,996 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 3068 to 3068. [2025-02-05 18:12:59,997 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 3068 states, 3012 states have (on average 1.451527224435591) internal successors, (4372), 3012 states have internal predecessors, (4372), 54 states have call successors, (54), 1 states have call predecessors, (54), 1 states have return successors, (54), 54 states have call predecessors, (54), 54 states have call successors, (54) [2025-02-05 18:13:00,000 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3068 states to 3068 states and 4480 transitions. [2025-02-05 18:13:00,000 INFO L78 Accepts]: Start accepts. Automaton has 3068 states and 4480 transitions. Word has length 939 [2025-02-05 18:13:00,000 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-02-05 18:13:00,000 INFO L471 AbstractCegarLoop]: Abstraction has 3068 states and 4480 transitions. [2025-02-05 18:13:00,001 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 210.5) internal successors, (842), 4 states have internal predecessors, (842), 2 states have call successors, (20), 1 states have call predecessors, (20), 1 states have return successors, (20), 2 states have call predecessors, (20), 2 states have call successors, (20) [2025-02-05 18:13:00,001 INFO L276 IsEmpty]: Start isEmpty. Operand 3068 states and 4480 transitions. [2025-02-05 18:13:00,007 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 941 [2025-02-05 18:13:00,007 INFO L210 NwaCegarLoop]: Found error trace [2025-02-05 18:13:00,007 INFO L218 NwaCegarLoop]: trace histogram [20, 20, 20, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-02-05 18:13:00,007 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable35 [2025-02-05 18:13:00,008 INFO L396 AbstractCegarLoop]: === Iteration 37 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-02-05 18:13:00,008 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-02-05 18:13:00,008 INFO L85 PathProgramCache]: Analyzing trace with hash 412144383, now seen corresponding path program 1 times [2025-02-05 18:13:00,008 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-02-05 18:13:00,008 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1033822980] [2025-02-05 18:13:00,008 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-02-05 18:13:00,009 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-02-05 18:13:00,128 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 940 statements into 1 equivalence classes. [2025-02-05 18:13:01,119 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 940 of 940 statements. [2025-02-05 18:13:01,119 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-02-05 18:13:01,119 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-02-05 18:13:02,401 INFO L134 CoverageAnalysis]: Checked inductivity of 1027 backedges. 267 proven. 0 refuted. 0 times theorem prover too weak. 760 trivial. 0 not checked. [2025-02-05 18:13:02,401 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-02-05 18:13:02,401 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1033822980] [2025-02-05 18:13:02,401 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1033822980] provided 1 perfect and 0 imperfect interpolant sequences [2025-02-05 18:13:02,401 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-02-05 18:13:02,401 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2025-02-05 18:13:02,401 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1941569200] [2025-02-05 18:13:02,401 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-02-05 18:13:02,402 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2025-02-05 18:13:02,402 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-02-05 18:13:02,403 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2025-02-05 18:13:02,403 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2025-02-05 18:13:02,403 INFO L87 Difference]: Start difference. First operand 3068 states and 4480 transitions. Second operand has 4 states, 4 states have (on average 210.75) internal successors, (843), 4 states have internal predecessors, (843), 2 states have call successors, (20), 1 states have call predecessors, (20), 1 states have return successors, (20), 2 states have call predecessors, (20), 2 states have call successors, (20) [2025-02-05 18:13:02,773 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-02-05 18:13:02,773 INFO L93 Difference]: Finished difference Result 4261 states and 6217 transitions. [2025-02-05 18:13:02,773 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2025-02-05 18:13:02,774 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 4 states have (on average 210.75) internal successors, (843), 4 states have internal predecessors, (843), 2 states have call successors, (20), 1 states have call predecessors, (20), 1 states have return successors, (20), 2 states have call predecessors, (20), 2 states have call successors, (20) Word has length 940 [2025-02-05 18:13:02,774 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-02-05 18:13:02,777 INFO L225 Difference]: With dead ends: 4261 [2025-02-05 18:13:02,777 INFO L226 Difference]: Without dead ends: 3068 [2025-02-05 18:13:02,778 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 7 GetRequests, 4 SyntacticMatches, 0 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=9, Invalid=11, Unknown=0, NotChecked=0, Total=20 [2025-02-05 18:13:02,778 INFO L435 NwaCegarLoop]: 1289 mSDtfsCounter, 1093 mSDsluCounter, 1291 mSDsCounter, 0 mSdLazyCounter, 647 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.3s Time, 0 mProtectedPredicate, 0 mProtectedAction, 1093 SdHoareTripleChecker+Valid, 2580 SdHoareTripleChecker+Invalid, 647 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 647 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.3s IncrementalHoareTripleChecker+Time [2025-02-05 18:13:02,779 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [1093 Valid, 2580 Invalid, 647 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 647 Invalid, 0 Unknown, 0 Unchecked, 0.3s Time] [2025-02-05 18:13:02,780 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 3068 states. [2025-02-05 18:13:02,807 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 3068 to 3068. [2025-02-05 18:13:02,809 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 3068 states, 3012 states have (on average 1.451195219123506) internal successors, (4371), 3012 states have internal predecessors, (4371), 54 states have call successors, (54), 1 states have call predecessors, (54), 1 states have return successors, (54), 54 states have call predecessors, (54), 54 states have call successors, (54) [2025-02-05 18:13:02,811 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3068 states to 3068 states and 4479 transitions. [2025-02-05 18:13:02,812 INFO L78 Accepts]: Start accepts. Automaton has 3068 states and 4479 transitions. Word has length 940 [2025-02-05 18:13:02,813 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-02-05 18:13:02,813 INFO L471 AbstractCegarLoop]: Abstraction has 3068 states and 4479 transitions. [2025-02-05 18:13:02,813 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 210.75) internal successors, (843), 4 states have internal predecessors, (843), 2 states have call successors, (20), 1 states have call predecessors, (20), 1 states have return successors, (20), 2 states have call predecessors, (20), 2 states have call successors, (20) [2025-02-05 18:13:02,813 INFO L276 IsEmpty]: Start isEmpty. Operand 3068 states and 4479 transitions. [2025-02-05 18:13:02,820 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 942 [2025-02-05 18:13:02,820 INFO L210 NwaCegarLoop]: Found error trace [2025-02-05 18:13:02,821 INFO L218 NwaCegarLoop]: trace histogram [20, 20, 20, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-02-05 18:13:02,821 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable36 [2025-02-05 18:13:02,821 INFO L396 AbstractCegarLoop]: === Iteration 38 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-02-05 18:13:02,821 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-02-05 18:13:02,822 INFO L85 PathProgramCache]: Analyzing trace with hash 484710107, now seen corresponding path program 1 times [2025-02-05 18:13:02,823 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-02-05 18:13:02,823 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [757587006] [2025-02-05 18:13:02,824 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-02-05 18:13:02,824 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-02-05 18:13:02,955 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 941 statements into 1 equivalence classes.