./Ultimate.py --spec ../sv-benchmarks/c/properties/unreach-call.prp --file ../sv-benchmarks/c/hardware-verification-bv/btor2c-lazyMod.vcegar_QF_BV_usb_phy_1.c --full-output --architecture 64bit -------------------------------------------------------------------------------- Checking for ERROR reachability Using default analysis Version 48c9605d Calling Ultimate with: /root/.sdkman/candidates/java/21.0.5-tem/bin/java -Dosgi.configuration.area=/storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/data/config -Xmx15G -Xms4m -jar /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/plugins/org.eclipse.equinox.launcher_1.6.800.v20240513-1750.jar -data @noDefault -ultimatedata /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/data -tc /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/config/AutomizerReach.xml -i ../sv-benchmarks/c/hardware-verification-bv/btor2c-lazyMod.vcegar_QF_BV_usb_phy_1.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 d1b32aaddfcc4461b9b835c36b224846d44f13a8bf0904556358f96663c9ebca --- Real Ultimate output --- This is Ultimate 0.3.0-?-48c9605-m [2025-02-08 00:10:46,726 INFO L188 SettingsManager]: Resetting all preferences to default values... [2025-02-08 00:10:46,792 INFO L114 SettingsManager]: Loading settings from /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/config/svcomp-Reach-64bit-Automizer_Default.epf [2025-02-08 00:10:46,799 WARN L101 SettingsManager]: Preference file contains the following unknown settings: [2025-02-08 00:10:46,803 WARN L103 SettingsManager]: * de.uni_freiburg.informatik.ultimate.core.Log level for class [2025-02-08 00:10:46,824 INFO L130 SettingsManager]: Preferences different from defaults after loading the file: [2025-02-08 00:10:46,829 INFO L151 SettingsManager]: Preferences of UltimateCore differ from their defaults: [2025-02-08 00:10:46,829 INFO L153 SettingsManager]: * Log level for class=de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher=ERROR; [2025-02-08 00:10:46,829 INFO L151 SettingsManager]: Preferences of Boogie Preprocessor differ from their defaults: [2025-02-08 00:10:46,829 INFO L153 SettingsManager]: * Use memory slicer=true [2025-02-08 00:10:46,829 INFO L151 SettingsManager]: Preferences of Boogie Procedure Inliner differ from their defaults: [2025-02-08 00:10:46,829 INFO L153 SettingsManager]: * Ignore calls to procedures called more than once=ONLY_FOR_SEQUENTIAL_PROGRAMS [2025-02-08 00:10:46,829 INFO L151 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2025-02-08 00:10:46,829 INFO L153 SettingsManager]: * Create parallel compositions if possible=false [2025-02-08 00:10:46,830 INFO L153 SettingsManager]: * Use SBE=true [2025-02-08 00:10:46,830 INFO L151 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2025-02-08 00:10:46,830 INFO L153 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2025-02-08 00:10:46,830 INFO L153 SettingsManager]: * Overapproximate operations on floating types=true [2025-02-08 00:10:46,830 INFO L153 SettingsManager]: * Check division by zero=IGNORE [2025-02-08 00:10:46,830 INFO L153 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2025-02-08 00:10:46,830 INFO L153 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2025-02-08 00:10:46,830 INFO L153 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2025-02-08 00:10:46,830 INFO L153 SettingsManager]: * Check if freed pointer was valid=false [2025-02-08 00:10:46,830 INFO L153 SettingsManager]: * Behaviour of calls to undefined functions=OVERAPPROXIMATE_BEHAVIOUR [2025-02-08 00:10:46,830 INFO L153 SettingsManager]: * Use constant arrays=true [2025-02-08 00:10:46,830 INFO L151 SettingsManager]: Preferences of IcfgBuilder differ from their defaults: [2025-02-08 00:10:46,830 INFO L153 SettingsManager]: * Size of a code block=SequenceOfStatements [2025-02-08 00:10:46,830 INFO L153 SettingsManager]: * Only consider context switches at boundaries of atomic blocks=true [2025-02-08 00:10:46,830 INFO L153 SettingsManager]: * SMT solver=External_DefaultMode [2025-02-08 00:10:46,830 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2025-02-08 00:10:46,830 INFO L151 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2025-02-08 00:10:46,831 INFO L153 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2025-02-08 00:10:46,831 INFO L153 SettingsManager]: * Compute procedure contracts=false [2025-02-08 00:10:46,831 INFO L153 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopHeads [2025-02-08 00:10:46,831 INFO L153 SettingsManager]: * Trace refinement strategy=CAMEL [2025-02-08 00:10:46,831 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2025-02-08 00:10:46,831 INFO L153 SettingsManager]: * Apply one-shot large block encoding in concurrent analysis=false [2025-02-08 00:10:46,831 INFO L153 SettingsManager]: * Automaton type used in concurrency analysis=PETRI_NET [2025-02-08 00:10:46,831 INFO L153 SettingsManager]: * Order on configurations for Petri net unfoldings=DBO [2025-02-08 00:10:46,831 INFO L153 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode [2025-02-08 00:10:46,832 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 -> d1b32aaddfcc4461b9b835c36b224846d44f13a8bf0904556358f96663c9ebca [2025-02-08 00:10:47,091 INFO L75 nceAwareModelManager]: Repository-Root is: /tmp [2025-02-08 00:10:47,096 INFO L261 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2025-02-08 00:10:47,098 INFO L217 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2025-02-08 00:10:47,099 INFO L270 PluginConnector]: Initializing CDTParser... [2025-02-08 00:10:47,099 INFO L274 PluginConnector]: CDTParser initialized [2025-02-08 00:10:47,099 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.vcegar_QF_BV_usb_phy_1.c [2025-02-08 00:10:48,266 INFO L533 CDTParser]: Created temporary CDT project at /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/data/b1f5142d1/0e6e6ef1b65b46b88e62678f8e94bfb8/FLAGb4b17fa0b [2025-02-08 00:10:48,706 INFO L384 CDTParser]: Found 1 translation units. [2025-02-08 00:10:48,709 INFO L180 CDTParser]: Scanning /storage/repos/ultimate-jdk21/releaseScripts/default/sv-benchmarks/c/hardware-verification-bv/btor2c-lazyMod.vcegar_QF_BV_usb_phy_1.c [2025-02-08 00:10:48,728 INFO L427 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/data/b1f5142d1/0e6e6ef1b65b46b88e62678f8e94bfb8/FLAGb4b17fa0b [2025-02-08 00:10:48,836 INFO L435 CDTParser]: Successfully deleted /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/data/b1f5142d1/0e6e6ef1b65b46b88e62678f8e94bfb8 [2025-02-08 00:10:48,838 INFO L299 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2025-02-08 00:10:48,839 INFO L133 ToolchainWalker]: Walking toolchain with 6 elements. [2025-02-08 00:10:48,840 INFO L112 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2025-02-08 00:10:48,840 INFO L270 PluginConnector]: Initializing CACSL2BoogieTranslator... [2025-02-08 00:10:48,843 INFO L274 PluginConnector]: CACSL2BoogieTranslator initialized [2025-02-08 00:10:48,843 INFO L184 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 08.02 12:10:48" (1/1) ... [2025-02-08 00:10:48,844 INFO L204 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@3266f5a1 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.02 12:10:48, skipping insertion in model container [2025-02-08 00:10:48,844 INFO L184 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 08.02 12:10:48" (1/1) ... [2025-02-08 00:10:48,878 INFO L175 MainTranslator]: Built tables and reachable declarations [2025-02-08 00:10:49,019 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.vcegar_QF_BV_usb_phy_1.c[1262,1275] [2025-02-08 00:10:49,333 INFO L210 PostProcessor]: Analyzing one entry point: main [2025-02-08 00:10:49,340 INFO L200 MainTranslator]: Completed pre-run [2025-02-08 00:10:49,348 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.vcegar_QF_BV_usb_phy_1.c[1262,1275] [2025-02-08 00:10:49,481 INFO L210 PostProcessor]: Analyzing one entry point: main [2025-02-08 00:10:49,491 INFO L204 MainTranslator]: Completed translation [2025-02-08 00:10:49,492 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.02 12:10:49 WrapperNode [2025-02-08 00:10:49,492 INFO L131 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2025-02-08 00:10:49,493 INFO L112 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2025-02-08 00:10:49,493 INFO L270 PluginConnector]: Initializing Boogie Procedure Inliner... [2025-02-08 00:10:49,493 INFO L274 PluginConnector]: Boogie Procedure Inliner initialized [2025-02-08 00:10:49,497 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.02 12:10:49" (1/1) ... [2025-02-08 00:10:49,537 INFO L184 PluginConnector]: Executing the observer Inliner from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.02 12:10:49" (1/1) ... [2025-02-08 00:10:49,937 INFO L138 Inliner]: procedures = 17, calls = 8, calls flagged for inlining = 3, calls inlined = 3, statements flattened = 4142 [2025-02-08 00:10:49,938 INFO L131 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2025-02-08 00:10:49,938 INFO L112 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2025-02-08 00:10:49,938 INFO L270 PluginConnector]: Initializing Boogie Preprocessor... [2025-02-08 00:10:49,939 INFO L274 PluginConnector]: Boogie Preprocessor initialized [2025-02-08 00:10:49,944 INFO L184 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.02 12:10:49" (1/1) ... [2025-02-08 00:10:49,945 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.02 12:10:49" (1/1) ... [2025-02-08 00:10:49,985 INFO L184 PluginConnector]: Executing the observer MemorySlicer from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.02 12:10:49" (1/1) ... [2025-02-08 00:10:50,116 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-08 00:10:50,116 INFO L184 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.02 12:10:49" (1/1) ... [2025-02-08 00:10:50,120 INFO L184 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.02 12:10:49" (1/1) ... [2025-02-08 00:10:50,196 INFO L184 PluginConnector]: Executing the observer ReplaceArrayAssignments from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.02 12:10:49" (1/1) ... [2025-02-08 00:10:50,220 INFO L184 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.02 12:10:49" (1/1) ... [2025-02-08 00:10:50,248 INFO L184 PluginConnector]: Executing the observer LTLStepAnnotator from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.02 12:10:49" (1/1) ... [2025-02-08 00:10:50,269 INFO L184 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.02 12:10:49" (1/1) ... [2025-02-08 00:10:50,347 INFO L131 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2025-02-08 00:10:50,349 INFO L112 PluginConnector]: ------------------------IcfgBuilder---------------------------- [2025-02-08 00:10:50,350 INFO L270 PluginConnector]: Initializing IcfgBuilder... [2025-02-08 00:10:50,350 INFO L274 PluginConnector]: IcfgBuilder initialized [2025-02-08 00:10:50,351 INFO L184 PluginConnector]: Executing the observer IcfgBuilderObserver from plugin IcfgBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.02 12:10:49" (1/1) ... [2025-02-08 00:10:50,358 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2025-02-08 00:10:50,370 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 [2025-02-08 00:10:50,390 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-08 00:10:50,399 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-08 00:10:50,435 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocInit [2025-02-08 00:10:50,436 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int#0 [2025-02-08 00:10:50,436 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2025-02-08 00:10:50,436 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2025-02-08 00:10:50,832 INFO L257 CfgBuilder]: Building ICFG [2025-02-08 00:10:50,834 INFO L287 CfgBuilder]: Building CFG for each procedure with an implementation [2025-02-08 00:10:53,422 INFO L? ?]: Removed 2447 outVars from TransFormulas that were not future-live. [2025-02-08 00:10:53,422 INFO L308 CfgBuilder]: Performing block encoding [2025-02-08 00:10:53,497 INFO L332 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2025-02-08 00:10:53,498 INFO L337 CfgBuilder]: Removed 0 assume(true) statements. [2025-02-08 00:10:53,498 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.icfgbuilder CFG 08.02 12:10:53 BoogieIcfgContainer [2025-02-08 00:10:53,498 INFO L131 PluginConnector]: ------------------------ END IcfgBuilder---------------------------- [2025-02-08 00:10:53,502 INFO L112 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2025-02-08 00:10:53,502 INFO L270 PluginConnector]: Initializing TraceAbstraction... [2025-02-08 00:10:53,506 INFO L274 PluginConnector]: TraceAbstraction initialized [2025-02-08 00:10:53,506 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 08.02 12:10:48" (1/3) ... [2025-02-08 00:10:53,506 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@b9aadca and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 08.02 12:10:53, skipping insertion in model container [2025-02-08 00:10:53,506 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.02 12:10:49" (2/3) ... [2025-02-08 00:10:53,507 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@b9aadca and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 08.02 12:10:53, skipping insertion in model container [2025-02-08 00:10:53,507 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.icfgbuilder CFG 08.02 12:10:53" (3/3) ... [2025-02-08 00:10:53,508 INFO L128 eAbstractionObserver]: Analyzing ICFG btor2c-lazyMod.vcegar_QF_BV_usb_phy_1.c [2025-02-08 00:10:53,518 INFO L216 ceAbstractionStarter]: Automizer settings: Hoare:LoopHeads NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2025-02-08 00:10:53,519 INFO L151 ceAbstractionStarter]: Applying trace abstraction to ICFG btor2c-lazyMod.vcegar_QF_BV_usb_phy_1.c that has 1 procedures, 821 locations, 1 initial locations, 1 loop locations, and 1 error locations. [2025-02-08 00:10:53,565 INFO L332 AbstractCegarLoop]: ======== Iteration 0 == of CEGAR loop == AllErrorsAtOnce ======== [2025-02-08 00:10:53,572 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;@56a49525, mLbeIndependenceSettings=[IndependenceType=SEMANTIC, AbstractionType=NONE, UseConditional=false, UseSemiCommutativity=true, Solver=Z3, SolverTimeout=1000ms] [2025-02-08 00:10:53,573 INFO L334 AbstractCegarLoop]: Starting to check reachability of 1 error locations. [2025-02-08 00:10:53,578 INFO L276 IsEmpty]: Start isEmpty. Operand has 821 states, 819 states have (on average 1.5006105006105006) internal successors, (1229), 820 states have internal predecessors, (1229), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-02-08 00:10:53,585 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 125 [2025-02-08 00:10:53,586 INFO L210 NwaCegarLoop]: Found error trace [2025-02-08 00:10:53,586 INFO L218 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-02-08 00:10:53,587 INFO L396 AbstractCegarLoop]: === Iteration 1 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-02-08 00:10:53,590 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-02-08 00:10:53,590 INFO L85 PathProgramCache]: Analyzing trace with hash -1049357345, now seen corresponding path program 1 times [2025-02-08 00:10:53,595 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-02-08 00:10:53,596 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1470032371] [2025-02-08 00:10:53,596 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-02-08 00:10:53,596 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-02-08 00:10:53,684 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 124 statements into 1 equivalence classes. [2025-02-08 00:10:53,759 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 124 of 124 statements. [2025-02-08 00:10:53,759 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-02-08 00:10:53,760 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-02-08 00:10:54,477 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-02-08 00:10:54,479 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-02-08 00:10:54,479 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1470032371] [2025-02-08 00:10:54,480 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1470032371] provided 1 perfect and 0 imperfect interpolant sequences [2025-02-08 00:10:54,480 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-02-08 00:10:54,480 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2025-02-08 00:10:54,482 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [997140227] [2025-02-08 00:10:54,482 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-02-08 00:10:54,485 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2025-02-08 00:10:54,486 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-02-08 00:10:54,500 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2025-02-08 00:10:54,501 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2025-02-08 00:10:54,503 INFO L87 Difference]: Start difference. First operand has 821 states, 819 states have (on average 1.5006105006105006) internal successors, (1229), 820 states have internal predecessors, (1229), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Second operand has 4 states, 4 states have (on average 31.0) internal successors, (124), 4 states have internal predecessors, (124), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-02-08 00:10:55,045 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-02-08 00:10:55,045 INFO L93 Difference]: Finished difference Result 1433 states and 2147 transitions. [2025-02-08 00:10:55,046 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2025-02-08 00:10:55,047 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 4 states have (on average 31.0) internal successors, (124), 4 states have internal predecessors, (124), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 124 [2025-02-08 00:10:55,048 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-02-08 00:10:55,057 INFO L225 Difference]: With dead ends: 1433 [2025-02-08 00:10:55,057 INFO L226 Difference]: Without dead ends: 821 [2025-02-08 00:10:55,061 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-08 00:10:55,062 INFO L435 NwaCegarLoop]: 1021 mSDtfsCounter, 0 mSDsluCounter, 2037 mSDsCounter, 0 mSdLazyCounter, 619 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.3s Time, 0 mProtectedPredicate, 0 mProtectedAction, 0 SdHoareTripleChecker+Valid, 3058 SdHoareTripleChecker+Invalid, 619 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 619 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.5s IncrementalHoareTripleChecker+Time [2025-02-08 00:10:55,063 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [0 Valid, 3058 Invalid, 619 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 619 Invalid, 0 Unknown, 0 Unchecked, 0.5s Time] [2025-02-08 00:10:55,099 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 821 states. [2025-02-08 00:10:55,130 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 821 to 821. [2025-02-08 00:10:55,132 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 821 states, 820 states have (on average 1.497560975609756) internal successors, (1228), 820 states have internal predecessors, (1228), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-02-08 00:10:55,136 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 821 states to 821 states and 1228 transitions. [2025-02-08 00:10:55,137 INFO L78 Accepts]: Start accepts. Automaton has 821 states and 1228 transitions. Word has length 124 [2025-02-08 00:10:55,138 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-02-08 00:10:55,138 INFO L471 AbstractCegarLoop]: Abstraction has 821 states and 1228 transitions. [2025-02-08 00:10:55,138 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 31.0) internal successors, (124), 4 states have internal predecessors, (124), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-02-08 00:10:55,138 INFO L276 IsEmpty]: Start isEmpty. Operand 821 states and 1228 transitions. [2025-02-08 00:10:55,139 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 126 [2025-02-08 00:10:55,139 INFO L210 NwaCegarLoop]: Found error trace [2025-02-08 00:10:55,140 INFO L218 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-02-08 00:10:55,140 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable0 [2025-02-08 00:10:55,140 INFO L396 AbstractCegarLoop]: === Iteration 2 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-02-08 00:10:55,141 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-02-08 00:10:55,141 INFO L85 PathProgramCache]: Analyzing trace with hash 1834340819, now seen corresponding path program 1 times [2025-02-08 00:10:55,141 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-02-08 00:10:55,141 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1258132549] [2025-02-08 00:10:55,141 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-02-08 00:10:55,141 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-02-08 00:10:55,181 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 125 statements into 1 equivalence classes. [2025-02-08 00:10:55,202 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 125 of 125 statements. [2025-02-08 00:10:55,202 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-02-08 00:10:55,202 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-02-08 00:10:55,411 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-02-08 00:10:55,411 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-02-08 00:10:55,411 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1258132549] [2025-02-08 00:10:55,411 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1258132549] provided 1 perfect and 0 imperfect interpolant sequences [2025-02-08 00:10:55,411 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-02-08 00:10:55,411 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2025-02-08 00:10:55,412 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [246577691] [2025-02-08 00:10:55,412 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-02-08 00:10:55,412 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2025-02-08 00:10:55,413 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-02-08 00:10:55,413 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2025-02-08 00:10:55,413 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2025-02-08 00:10:55,413 INFO L87 Difference]: Start difference. First operand 821 states and 1228 transitions. Second operand has 4 states, 4 states have (on average 31.25) internal successors, (125), 4 states have internal predecessors, (125), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-02-08 00:10:55,735 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-02-08 00:10:55,735 INFO L93 Difference]: Finished difference Result 1435 states and 2146 transitions. [2025-02-08 00:10:55,735 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2025-02-08 00:10:55,735 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 4 states have (on average 31.25) internal successors, (125), 4 states have internal predecessors, (125), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 125 [2025-02-08 00:10:55,736 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-02-08 00:10:55,739 INFO L225 Difference]: With dead ends: 1435 [2025-02-08 00:10:55,739 INFO L226 Difference]: Without dead ends: 823 [2025-02-08 00:10:55,741 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-08 00:10:55,741 INFO L435 NwaCegarLoop]: 1021 mSDtfsCounter, 0 mSDsluCounter, 2034 mSDsCounter, 0 mSdLazyCounter, 622 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 0 SdHoareTripleChecker+Valid, 3055 SdHoareTripleChecker+Invalid, 622 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 622 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.3s IncrementalHoareTripleChecker+Time [2025-02-08 00:10:55,741 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [0 Valid, 3055 Invalid, 622 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 622 Invalid, 0 Unknown, 0 Unchecked, 0.3s Time] [2025-02-08 00:10:55,742 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 823 states. [2025-02-08 00:10:55,754 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 823 to 823. [2025-02-08 00:10:55,756 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 823 states, 822 states have (on average 1.4963503649635037) internal successors, (1230), 822 states have internal predecessors, (1230), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-02-08 00:10:55,758 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 823 states to 823 states and 1230 transitions. [2025-02-08 00:10:55,758 INFO L78 Accepts]: Start accepts. Automaton has 823 states and 1230 transitions. Word has length 125 [2025-02-08 00:10:55,759 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-02-08 00:10:55,759 INFO L471 AbstractCegarLoop]: Abstraction has 823 states and 1230 transitions. [2025-02-08 00:10:55,759 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 31.25) internal successors, (125), 4 states have internal predecessors, (125), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-02-08 00:10:55,759 INFO L276 IsEmpty]: Start isEmpty. Operand 823 states and 1230 transitions. [2025-02-08 00:10:55,760 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 127 [2025-02-08 00:10:55,760 INFO L210 NwaCegarLoop]: Found error trace [2025-02-08 00:10:55,760 INFO L218 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-02-08 00:10:55,761 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable1 [2025-02-08 00:10:55,761 INFO L396 AbstractCegarLoop]: === Iteration 3 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-02-08 00:10:55,761 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-02-08 00:10:55,761 INFO L85 PathProgramCache]: Analyzing trace with hash -1333466534, now seen corresponding path program 1 times [2025-02-08 00:10:55,761 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-02-08 00:10:55,761 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2033779264] [2025-02-08 00:10:55,762 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-02-08 00:10:55,762 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-02-08 00:10:55,798 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 126 statements into 1 equivalence classes. [2025-02-08 00:10:55,872 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 126 of 126 statements. [2025-02-08 00:10:55,873 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-02-08 00:10:55,873 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-02-08 00:10:56,776 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-02-08 00:10:56,777 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-02-08 00:10:56,777 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2033779264] [2025-02-08 00:10:56,777 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [2033779264] provided 1 perfect and 0 imperfect interpolant sequences [2025-02-08 00:10:56,777 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-02-08 00:10:56,777 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2025-02-08 00:10:56,777 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1712727108] [2025-02-08 00:10:56,777 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-02-08 00:10:56,778 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 8 states [2025-02-08 00:10:56,778 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-02-08 00:10:56,778 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2025-02-08 00:10:56,778 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=14, Invalid=42, Unknown=0, NotChecked=0, Total=56 [2025-02-08 00:10:56,779 INFO L87 Difference]: Start difference. First operand 823 states and 1230 transitions. Second operand has 8 states, 8 states have (on average 15.75) internal successors, (126), 7 states have internal predecessors, (126), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-02-08 00:10:57,411 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-02-08 00:10:57,412 INFO L93 Difference]: Finished difference Result 1447 states and 2162 transitions. [2025-02-08 00:10:57,413 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2025-02-08 00:10:57,413 INFO L78 Accepts]: Start accepts. Automaton has has 8 states, 8 states have (on average 15.75) internal successors, (126), 7 states have internal predecessors, (126), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 126 [2025-02-08 00:10:57,414 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-02-08 00:10:57,416 INFO L225 Difference]: With dead ends: 1447 [2025-02-08 00:10:57,417 INFO L226 Difference]: Without dead ends: 833 [2025-02-08 00:10:57,418 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 12 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 10 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 10 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=30, Invalid=102, Unknown=0, NotChecked=0, Total=132 [2025-02-08 00:10:57,418 INFO L435 NwaCegarLoop]: 1016 mSDtfsCounter, 1133 mSDsluCounter, 5067 mSDsCounter, 0 mSdLazyCounter, 1272 mSolverCounterSat, 1 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.5s Time, 0 mProtectedPredicate, 0 mProtectedAction, 1133 SdHoareTripleChecker+Valid, 6083 SdHoareTripleChecker+Invalid, 1273 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 1 IncrementalHoareTripleChecker+Valid, 1272 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.6s IncrementalHoareTripleChecker+Time [2025-02-08 00:10:57,418 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [1133 Valid, 6083 Invalid, 1273 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [1 Valid, 1272 Invalid, 0 Unknown, 0 Unchecked, 0.6s Time] [2025-02-08 00:10:57,419 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 833 states. [2025-02-08 00:10:57,429 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 833 to 832. [2025-02-08 00:10:57,430 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 832 states, 831 states have (on average 1.4957882069795427) internal successors, (1243), 831 states have internal predecessors, (1243), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-02-08 00:10:57,432 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 832 states to 832 states and 1243 transitions. [2025-02-08 00:10:57,432 INFO L78 Accepts]: Start accepts. Automaton has 832 states and 1243 transitions. Word has length 126 [2025-02-08 00:10:57,432 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-02-08 00:10:57,432 INFO L471 AbstractCegarLoop]: Abstraction has 832 states and 1243 transitions. [2025-02-08 00:10:57,432 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 8 states, 8 states have (on average 15.75) internal successors, (126), 7 states have internal predecessors, (126), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-02-08 00:10:57,432 INFO L276 IsEmpty]: Start isEmpty. Operand 832 states and 1243 transitions. [2025-02-08 00:10:57,434 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 128 [2025-02-08 00:10:57,434 INFO L210 NwaCegarLoop]: Found error trace [2025-02-08 00:10:57,434 INFO L218 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-02-08 00:10:57,434 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable2 [2025-02-08 00:10:57,434 INFO L396 AbstractCegarLoop]: === Iteration 4 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-02-08 00:10:57,434 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-02-08 00:10:57,434 INFO L85 PathProgramCache]: Analyzing trace with hash -1794492062, now seen corresponding path program 1 times [2025-02-08 00:10:57,434 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-02-08 00:10:57,434 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1716513979] [2025-02-08 00:10:57,435 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-02-08 00:10:57,435 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-02-08 00:10:57,562 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 127 statements into 1 equivalence classes. [2025-02-08 00:10:57,584 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 127 of 127 statements. [2025-02-08 00:10:57,584 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-02-08 00:10:57,584 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-02-08 00:10:58,097 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-02-08 00:10:58,097 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-02-08 00:10:58,097 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1716513979] [2025-02-08 00:10:58,097 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1716513979] provided 1 perfect and 0 imperfect interpolant sequences [2025-02-08 00:10:58,097 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-02-08 00:10:58,097 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2025-02-08 00:10:58,097 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [533019638] [2025-02-08 00:10:58,097 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-02-08 00:10:58,097 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 7 states [2025-02-08 00:10:58,097 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-02-08 00:10:58,098 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2025-02-08 00:10:58,100 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=13, Invalid=29, Unknown=0, NotChecked=0, Total=42 [2025-02-08 00:10:58,100 INFO L87 Difference]: Start difference. First operand 832 states and 1243 transitions. Second operand has 7 states, 7 states have (on average 18.142857142857142) internal successors, (127), 6 states have internal predecessors, (127), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-02-08 00:10:59,918 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-02-08 00:10:59,919 INFO L93 Difference]: Finished difference Result 1781 states and 2657 transitions. [2025-02-08 00:10:59,919 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2025-02-08 00:10:59,920 INFO L78 Accepts]: Start accepts. Automaton has has 7 states, 7 states have (on average 18.142857142857142) internal successors, (127), 6 states have internal predecessors, (127), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 127 [2025-02-08 00:10:59,920 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-02-08 00:10:59,924 INFO L225 Difference]: With dead ends: 1781 [2025-02-08 00:10:59,924 INFO L226 Difference]: Without dead ends: 1158 [2025-02-08 00:10:59,925 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 10 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 8 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 4 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=34, Invalid=56, Unknown=0, NotChecked=0, Total=90 [2025-02-08 00:10:59,925 INFO L435 NwaCegarLoop]: 530 mSDtfsCounter, 3739 mSDsluCounter, 1584 mSDsCounter, 0 mSdLazyCounter, 2789 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 1.4s Time, 0 mProtectedPredicate, 0 mProtectedAction, 3739 SdHoareTripleChecker+Valid, 2114 SdHoareTripleChecker+Invalid, 2789 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 2789 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 1.7s IncrementalHoareTripleChecker+Time [2025-02-08 00:10:59,926 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [3739 Valid, 2114 Invalid, 2789 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 2789 Invalid, 0 Unknown, 0 Unchecked, 1.7s Time] [2025-02-08 00:10:59,929 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1158 states. [2025-02-08 00:10:59,949 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1158 to 847. [2025-02-08 00:10:59,951 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 847 states, 846 states have (on average 1.4952718676122931) internal successors, (1265), 846 states have internal predecessors, (1265), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-02-08 00:10:59,953 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 847 states to 847 states and 1265 transitions. [2025-02-08 00:10:59,953 INFO L78 Accepts]: Start accepts. Automaton has 847 states and 1265 transitions. Word has length 127 [2025-02-08 00:10:59,954 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-02-08 00:10:59,954 INFO L471 AbstractCegarLoop]: Abstraction has 847 states and 1265 transitions. [2025-02-08 00:10:59,954 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 7 states, 7 states have (on average 18.142857142857142) internal successors, (127), 6 states have internal predecessors, (127), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-02-08 00:10:59,955 INFO L276 IsEmpty]: Start isEmpty. Operand 847 states and 1265 transitions. [2025-02-08 00:10:59,957 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 129 [2025-02-08 00:10:59,957 INFO L210 NwaCegarLoop]: Found error trace [2025-02-08 00:10:59,957 INFO L218 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-02-08 00:10:59,957 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable3 [2025-02-08 00:10:59,958 INFO L396 AbstractCegarLoop]: === Iteration 5 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-02-08 00:10:59,958 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-02-08 00:10:59,958 INFO L85 PathProgramCache]: Analyzing trace with hash 701664435, now seen corresponding path program 1 times [2025-02-08 00:10:59,958 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-02-08 00:10:59,958 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1998078817] [2025-02-08 00:10:59,958 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-02-08 00:10:59,958 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-02-08 00:10:59,999 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 128 statements into 1 equivalence classes. [2025-02-08 00:11:00,029 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 128 of 128 statements. [2025-02-08 00:11:00,031 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-02-08 00:11:00,031 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-02-08 00:11:00,261 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-02-08 00:11:00,262 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-02-08 00:11:00,262 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1998078817] [2025-02-08 00:11:00,262 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1998078817] provided 1 perfect and 0 imperfect interpolant sequences [2025-02-08 00:11:00,262 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-02-08 00:11:00,262 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2025-02-08 00:11:00,262 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1820529519] [2025-02-08 00:11:00,262 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-02-08 00:11:00,263 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2025-02-08 00:11:00,263 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-02-08 00:11:00,264 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2025-02-08 00:11:00,264 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2025-02-08 00:11:00,264 INFO L87 Difference]: Start difference. First operand 847 states and 1265 transitions. Second operand has 5 states, 5 states have (on average 25.6) internal successors, (128), 4 states have internal predecessors, (128), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-02-08 00:11:00,721 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-02-08 00:11:00,722 INFO L93 Difference]: Finished difference Result 1773 states and 2644 transitions. [2025-02-08 00:11:00,723 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2025-02-08 00:11:00,723 INFO L78 Accepts]: Start accepts. Automaton has has 5 states, 5 states have (on average 25.6) internal successors, (128), 4 states have internal predecessors, (128), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 128 [2025-02-08 00:11:00,723 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-02-08 00:11:00,729 INFO L225 Difference]: With dead ends: 1773 [2025-02-08 00:11:00,729 INFO L226 Difference]: Without dead ends: 1149 [2025-02-08 00:11:00,731 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 7 GetRequests, 2 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-08 00:11:00,734 INFO L435 NwaCegarLoop]: 1001 mSDtfsCounter, 2041 mSDsluCounter, 1996 mSDsCounter, 0 mSdLazyCounter, 680 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.3s Time, 0 mProtectedPredicate, 0 mProtectedAction, 2041 SdHoareTripleChecker+Valid, 2997 SdHoareTripleChecker+Invalid, 680 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 680 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.4s IncrementalHoareTripleChecker+Time [2025-02-08 00:11:00,734 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [2041 Valid, 2997 Invalid, 680 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 680 Invalid, 0 Unknown, 0 Unchecked, 0.4s Time] [2025-02-08 00:11:00,737 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1149 states. [2025-02-08 00:11:00,759 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1149 to 846. [2025-02-08 00:11:00,760 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 846 states, 845 states have (on average 1.4946745562130177) internal successors, (1263), 845 states have internal predecessors, (1263), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-02-08 00:11:00,762 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 846 states to 846 states and 1263 transitions. [2025-02-08 00:11:00,763 INFO L78 Accepts]: Start accepts. Automaton has 846 states and 1263 transitions. Word has length 128 [2025-02-08 00:11:00,763 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-02-08 00:11:00,763 INFO L471 AbstractCegarLoop]: Abstraction has 846 states and 1263 transitions. [2025-02-08 00:11:00,763 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 25.6) internal successors, (128), 4 states have internal predecessors, (128), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-02-08 00:11:00,763 INFO L276 IsEmpty]: Start isEmpty. Operand 846 states and 1263 transitions. [2025-02-08 00:11:00,764 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 129 [2025-02-08 00:11:00,764 INFO L210 NwaCegarLoop]: Found error trace [2025-02-08 00:11:00,764 INFO L218 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-02-08 00:11:00,764 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable4 [2025-02-08 00:11:00,764 INFO L396 AbstractCegarLoop]: === Iteration 6 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-02-08 00:11:00,765 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-02-08 00:11:00,765 INFO L85 PathProgramCache]: Analyzing trace with hash -1155061241, now seen corresponding path program 1 times [2025-02-08 00:11:00,765 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-02-08 00:11:00,765 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2065783936] [2025-02-08 00:11:00,766 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-02-08 00:11:00,766 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-02-08 00:11:00,801 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 128 statements into 1 equivalence classes. [2025-02-08 00:11:00,834 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 128 of 128 statements. [2025-02-08 00:11:00,835 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-02-08 00:11:00,835 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-02-08 00:11:01,762 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-02-08 00:11:01,764 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-02-08 00:11:01,764 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2065783936] [2025-02-08 00:11:01,765 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [2065783936] provided 1 perfect and 0 imperfect interpolant sequences [2025-02-08 00:11:01,765 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-02-08 00:11:01,766 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [8] imperfect sequences [] total 8 [2025-02-08 00:11:01,766 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1919436547] [2025-02-08 00:11:01,766 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-02-08 00:11:01,766 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 9 states [2025-02-08 00:11:01,766 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-02-08 00:11:01,767 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2025-02-08 00:11:01,767 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=16, Invalid=56, Unknown=0, NotChecked=0, Total=72 [2025-02-08 00:11:01,767 INFO L87 Difference]: Start difference. First operand 846 states and 1263 transitions. Second operand has 9 states, 9 states have (on average 14.222222222222221) internal successors, (128), 8 states have internal predecessors, (128), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-02-08 00:11:02,853 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-02-08 00:11:02,853 INFO L93 Difference]: Finished difference Result 1474 states and 2200 transitions. [2025-02-08 00:11:02,854 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2025-02-08 00:11:02,855 INFO L78 Accepts]: Start accepts. Automaton has has 9 states, 9 states have (on average 14.222222222222221) internal successors, (128), 8 states have internal predecessors, (128), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 128 [2025-02-08 00:11:02,855 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-02-08 00:11:02,857 INFO L225 Difference]: With dead ends: 1474 [2025-02-08 00:11:02,857 INFO L226 Difference]: Without dead ends: 851 [2025-02-08 00:11:02,858 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 14 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 12 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 14 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=38, Invalid=144, Unknown=0, NotChecked=0, Total=182 [2025-02-08 00:11:02,865 INFO L435 NwaCegarLoop]: 1001 mSDtfsCounter, 1137 mSDsluCounter, 5992 mSDsCounter, 0 mSdLazyCounter, 1588 mSolverCounterSat, 2 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.7s Time, 0 mProtectedPredicate, 0 mProtectedAction, 1137 SdHoareTripleChecker+Valid, 6993 SdHoareTripleChecker+Invalid, 1590 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 2 IncrementalHoareTripleChecker+Valid, 1588 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 1.0s IncrementalHoareTripleChecker+Time [2025-02-08 00:11:02,865 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [1137 Valid, 6993 Invalid, 1590 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [2 Valid, 1588 Invalid, 0 Unknown, 0 Unchecked, 1.0s Time] [2025-02-08 00:11:02,866 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 851 states. [2025-02-08 00:11:02,877 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 851 to 850. [2025-02-08 00:11:02,878 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 850 states, 849 states have (on average 1.4935217903415783) internal successors, (1268), 849 states have internal predecessors, (1268), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-02-08 00:11:02,881 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 850 states to 850 states and 1268 transitions. [2025-02-08 00:11:02,881 INFO L78 Accepts]: Start accepts. Automaton has 850 states and 1268 transitions. Word has length 128 [2025-02-08 00:11:02,881 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-02-08 00:11:02,881 INFO L471 AbstractCegarLoop]: Abstraction has 850 states and 1268 transitions. [2025-02-08 00:11:02,881 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 9 states, 9 states have (on average 14.222222222222221) internal successors, (128), 8 states have internal predecessors, (128), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-02-08 00:11:02,881 INFO L276 IsEmpty]: Start isEmpty. Operand 850 states and 1268 transitions. [2025-02-08 00:11:02,882 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 130 [2025-02-08 00:11:02,882 INFO L210 NwaCegarLoop]: Found error trace [2025-02-08 00:11:02,882 INFO L218 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-02-08 00:11:02,883 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable5 [2025-02-08 00:11:02,883 INFO L396 AbstractCegarLoop]: === Iteration 7 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-02-08 00:11:02,884 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-02-08 00:11:02,884 INFO L85 PathProgramCache]: Analyzing trace with hash -1139014159, now seen corresponding path program 1 times [2025-02-08 00:11:02,884 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-02-08 00:11:02,884 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [533861473] [2025-02-08 00:11:02,884 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-02-08 00:11:02,884 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-02-08 00:11:02,932 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 129 statements into 1 equivalence classes. [2025-02-08 00:11:02,961 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 129 of 129 statements. [2025-02-08 00:11:02,961 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-02-08 00:11:02,961 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-02-08 00:11:03,373 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-02-08 00:11:03,374 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-02-08 00:11:03,374 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [533861473] [2025-02-08 00:11:03,374 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [533861473] provided 1 perfect and 0 imperfect interpolant sequences [2025-02-08 00:11:03,374 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-02-08 00:11:03,374 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2025-02-08 00:11:03,374 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [172825131] [2025-02-08 00:11:03,374 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-02-08 00:11:03,375 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2025-02-08 00:11:03,375 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-02-08 00:11:03,375 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2025-02-08 00:11:03,376 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=8, Invalid=12, Unknown=0, NotChecked=0, Total=20 [2025-02-08 00:11:03,377 INFO L87 Difference]: Start difference. First operand 850 states and 1268 transitions. Second operand has 5 states, 5 states have (on average 25.8) internal successors, (129), 4 states have internal predecessors, (129), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-02-08 00:11:03,755 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-02-08 00:11:03,756 INFO L93 Difference]: Finished difference Result 1483 states and 2213 transitions. [2025-02-08 00:11:03,756 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2025-02-08 00:11:03,756 INFO L78 Accepts]: Start accepts. Automaton has has 5 states, 5 states have (on average 25.8) internal successors, (129), 4 states have internal predecessors, (129), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 129 [2025-02-08 00:11:03,757 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-02-08 00:11:03,759 INFO L225 Difference]: With dead ends: 1483 [2025-02-08 00:11:03,759 INFO L226 Difference]: Without dead ends: 856 [2025-02-08 00:11:03,760 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 7 GetRequests, 3 SyntacticMatches, 0 SemanticMatches, 4 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=12, Invalid=18, Unknown=0, NotChecked=0, Total=30 [2025-02-08 00:11:03,760 INFO L435 NwaCegarLoop]: 1018 mSDtfsCounter, 1115 mSDsluCounter, 2030 mSDsCounter, 0 mSdLazyCounter, 629 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.3s Time, 0 mProtectedPredicate, 0 mProtectedAction, 1115 SdHoareTripleChecker+Valid, 3048 SdHoareTripleChecker+Invalid, 629 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 629 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.3s IncrementalHoareTripleChecker+Time [2025-02-08 00:11:03,761 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [1115 Valid, 3048 Invalid, 629 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 629 Invalid, 0 Unknown, 0 Unchecked, 0.3s Time] [2025-02-08 00:11:03,762 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 856 states. [2025-02-08 00:11:03,770 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 856 to 856. [2025-02-08 00:11:03,772 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 856 states, 855 states have (on average 1.4923976608187135) internal successors, (1276), 855 states have internal predecessors, (1276), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-02-08 00:11:03,774 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 856 states to 856 states and 1276 transitions. [2025-02-08 00:11:03,774 INFO L78 Accepts]: Start accepts. Automaton has 856 states and 1276 transitions. Word has length 129 [2025-02-08 00:11:03,774 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-02-08 00:11:03,774 INFO L471 AbstractCegarLoop]: Abstraction has 856 states and 1276 transitions. [2025-02-08 00:11:03,775 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 25.8) internal successors, (129), 4 states have internal predecessors, (129), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-02-08 00:11:03,775 INFO L276 IsEmpty]: Start isEmpty. Operand 856 states and 1276 transitions. [2025-02-08 00:11:03,775 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 131 [2025-02-08 00:11:03,775 INFO L210 NwaCegarLoop]: Found error trace [2025-02-08 00:11:03,776 INFO L218 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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-08 00:11:03,776 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable6 [2025-02-08 00:11:03,776 INFO L396 AbstractCegarLoop]: === Iteration 8 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-02-08 00:11:03,776 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-02-08 00:11:03,776 INFO L85 PathProgramCache]: Analyzing trace with hash -243245138, now seen corresponding path program 1 times [2025-02-08 00:11:03,777 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-02-08 00:11:03,777 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1551902595] [2025-02-08 00:11:03,777 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-02-08 00:11:03,778 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-02-08 00:11:03,810 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 130 statements into 1 equivalence classes. [2025-02-08 00:11:03,822 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 130 of 130 statements. [2025-02-08 00:11:03,822 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-02-08 00:11:03,822 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-02-08 00:11:04,159 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-02-08 00:11:04,159 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-02-08 00:11:04,159 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1551902595] [2025-02-08 00:11:04,159 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1551902595] provided 1 perfect and 0 imperfect interpolant sequences [2025-02-08 00:11:04,159 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-02-08 00:11:04,159 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2025-02-08 00:11:04,159 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [324537822] [2025-02-08 00:11:04,159 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-02-08 00:11:04,159 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 7 states [2025-02-08 00:11:04,159 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-02-08 00:11:04,160 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2025-02-08 00:11:04,160 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=13, Invalid=29, Unknown=0, NotChecked=0, Total=42 [2025-02-08 00:11:04,160 INFO L87 Difference]: Start difference. First operand 856 states and 1276 transitions. Second operand has 7 states, 7 states have (on average 18.571428571428573) internal successors, (130), 6 states have internal predecessors, (130), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-02-08 00:11:05,542 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-02-08 00:11:05,543 INFO L93 Difference]: Finished difference Result 1812 states and 2697 transitions. [2025-02-08 00:11:05,543 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2025-02-08 00:11:05,543 INFO L78 Accepts]: Start accepts. Automaton has has 7 states, 7 states have (on average 18.571428571428573) internal successors, (130), 6 states have internal predecessors, (130), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 130 [2025-02-08 00:11:05,544 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-02-08 00:11:05,547 INFO L225 Difference]: With dead ends: 1812 [2025-02-08 00:11:05,547 INFO L226 Difference]: Without dead ends: 1179 [2025-02-08 00:11:05,548 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 10 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 8 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 4 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=34, Invalid=56, Unknown=0, NotChecked=0, Total=90 [2025-02-08 00:11:05,548 INFO L435 NwaCegarLoop]: 529 mSDtfsCounter, 2192 mSDsluCounter, 1054 mSDsCounter, 0 mSdLazyCounter, 2095 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 1.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 2192 SdHoareTripleChecker+Valid, 1583 SdHoareTripleChecker+Invalid, 2095 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 2095 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 1.3s IncrementalHoareTripleChecker+Time [2025-02-08 00:11:05,548 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [2192 Valid, 1583 Invalid, 2095 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 2095 Invalid, 0 Unknown, 0 Unchecked, 1.3s Time] [2025-02-08 00:11:05,550 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1179 states. [2025-02-08 00:11:05,558 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1179 to 859. [2025-02-08 00:11:05,559 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 859 states, 858 states have (on average 1.491841491841492) internal successors, (1280), 858 states have internal predecessors, (1280), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-02-08 00:11:05,561 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 859 states to 859 states and 1280 transitions. [2025-02-08 00:11:05,561 INFO L78 Accepts]: Start accepts. Automaton has 859 states and 1280 transitions. Word has length 130 [2025-02-08 00:11:05,561 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-02-08 00:11:05,562 INFO L471 AbstractCegarLoop]: Abstraction has 859 states and 1280 transitions. [2025-02-08 00:11:05,562 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 7 states, 7 states have (on average 18.571428571428573) internal successors, (130), 6 states have internal predecessors, (130), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-02-08 00:11:05,562 INFO L276 IsEmpty]: Start isEmpty. Operand 859 states and 1280 transitions. [2025-02-08 00:11:05,562 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 132 [2025-02-08 00:11:05,562 INFO L210 NwaCegarLoop]: Found error trace [2025-02-08 00:11:05,563 INFO L218 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-02-08 00:11:05,563 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable7 [2025-02-08 00:11:05,563 INFO L396 AbstractCegarLoop]: === Iteration 9 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-02-08 00:11:05,565 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-02-08 00:11:05,565 INFO L85 PathProgramCache]: Analyzing trace with hash 662570217, now seen corresponding path program 1 times [2025-02-08 00:11:05,565 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-02-08 00:11:05,565 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2145374581] [2025-02-08 00:11:05,565 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-02-08 00:11:05,565 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-02-08 00:11:05,595 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 131 statements into 1 equivalence classes. [2025-02-08 00:11:05,612 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 131 of 131 statements. [2025-02-08 00:11:05,613 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-02-08 00:11:05,614 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-02-08 00:11:05,754 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-02-08 00:11:05,754 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-02-08 00:11:05,754 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2145374581] [2025-02-08 00:11:05,754 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [2145374581] provided 1 perfect and 0 imperfect interpolant sequences [2025-02-08 00:11:05,754 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-02-08 00:11:05,754 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2025-02-08 00:11:05,754 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [397591767] [2025-02-08 00:11:05,754 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-02-08 00:11:05,755 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2025-02-08 00:11:05,755 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-02-08 00:11:05,756 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2025-02-08 00:11:05,756 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2025-02-08 00:11:05,756 INFO L87 Difference]: Start difference. First operand 859 states and 1280 transitions. Second operand has 5 states, 5 states have (on average 26.2) internal successors, (131), 4 states have internal predecessors, (131), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-02-08 00:11:06,202 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-02-08 00:11:06,202 INFO L93 Difference]: Finished difference Result 1795 states and 2674 transitions. [2025-02-08 00:11:06,202 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2025-02-08 00:11:06,202 INFO L78 Accepts]: Start accepts. Automaton has has 5 states, 5 states have (on average 26.2) internal successors, (131), 4 states have internal predecessors, (131), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 131 [2025-02-08 00:11:06,203 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-02-08 00:11:06,206 INFO L225 Difference]: With dead ends: 1795 [2025-02-08 00:11:06,206 INFO L226 Difference]: Without dead ends: 1161 [2025-02-08 00:11:06,207 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 7 GetRequests, 2 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-08 00:11:06,210 INFO L435 NwaCegarLoop]: 1000 mSDtfsCounter, 2059 mSDsluCounter, 1994 mSDsCounter, 0 mSdLazyCounter, 683 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.3s Time, 0 mProtectedPredicate, 0 mProtectedAction, 2059 SdHoareTripleChecker+Valid, 2994 SdHoareTripleChecker+Invalid, 683 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 683 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.4s IncrementalHoareTripleChecker+Time [2025-02-08 00:11:06,210 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [2059 Valid, 2994 Invalid, 683 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 683 Invalid, 0 Unknown, 0 Unchecked, 0.4s Time] [2025-02-08 00:11:06,211 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1161 states. [2025-02-08 00:11:06,220 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1161 to 858. [2025-02-08 00:11:06,221 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 858 states, 857 states have (on average 1.4912485414235706) internal successors, (1278), 857 states have internal predecessors, (1278), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-02-08 00:11:06,223 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 858 states to 858 states and 1278 transitions. [2025-02-08 00:11:06,223 INFO L78 Accepts]: Start accepts. Automaton has 858 states and 1278 transitions. Word has length 131 [2025-02-08 00:11:06,223 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-02-08 00:11:06,223 INFO L471 AbstractCegarLoop]: Abstraction has 858 states and 1278 transitions. [2025-02-08 00:11:06,224 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 26.2) internal successors, (131), 4 states have internal predecessors, (131), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-02-08 00:11:06,224 INFO L276 IsEmpty]: Start isEmpty. Operand 858 states and 1278 transitions. [2025-02-08 00:11:06,230 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 433 [2025-02-08 00:11:06,230 INFO L210 NwaCegarLoop]: Found error trace [2025-02-08 00:11:06,230 INFO L218 NwaCegarLoop]: trace histogram [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, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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-08 00:11:06,230 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable8 [2025-02-08 00:11:06,230 INFO L396 AbstractCegarLoop]: === Iteration 10 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-02-08 00:11:06,231 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-02-08 00:11:06,231 INFO L85 PathProgramCache]: Analyzing trace with hash 526437102, now seen corresponding path program 1 times [2025-02-08 00:11:06,231 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-02-08 00:11:06,231 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [20787508] [2025-02-08 00:11:06,231 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-02-08 00:11:06,231 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-02-08 00:11:06,377 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 432 statements into 1 equivalence classes. [2025-02-08 00:11:06,694 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 432 of 432 statements. [2025-02-08 00:11:06,694 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-02-08 00:11:06,694 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-02-08 00:11:08,030 INFO L134 CoverageAnalysis]: Checked inductivity of 18 backedges. 18 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-02-08 00:11:08,030 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-02-08 00:11:08,030 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [20787508] [2025-02-08 00:11:08,030 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [20787508] provided 1 perfect and 0 imperfect interpolant sequences [2025-02-08 00:11:08,030 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-02-08 00:11:08,030 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2025-02-08 00:11:08,030 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1295389629] [2025-02-08 00:11:08,030 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-02-08 00:11:08,031 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 7 states [2025-02-08 00:11:08,031 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-02-08 00:11:08,032 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2025-02-08 00:11:08,032 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=12, Invalid=30, Unknown=0, NotChecked=0, Total=42 [2025-02-08 00:11:08,032 INFO L87 Difference]: Start difference. First operand 858 states and 1278 transitions. Second operand has 7 states, 7 states have (on average 61.714285714285715) internal successors, (432), 7 states have internal predecessors, (432), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-02-08 00:11:09,474 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-02-08 00:11:09,474 INFO L93 Difference]: Finished difference Result 2638 states and 3934 transitions. [2025-02-08 00:11:09,474 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2025-02-08 00:11:09,475 INFO L78 Accepts]: Start accepts. Automaton has has 7 states, 7 states have (on average 61.714285714285715) internal successors, (432), 7 states have internal predecessors, (432), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 432 [2025-02-08 00:11:09,475 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-02-08 00:11:09,481 INFO L225 Difference]: With dead ends: 2638 [2025-02-08 00:11:09,481 INFO L226 Difference]: Without dead ends: 2005 [2025-02-08 00:11:09,483 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 12 GetRequests, 4 SyntacticMatches, 0 SemanticMatches, 8 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 5 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=24, Invalid=66, Unknown=0, NotChecked=0, Total=90 [2025-02-08 00:11:09,483 INFO L435 NwaCegarLoop]: 1399 mSDtfsCounter, 1413 mSDsluCounter, 5986 mSDsCounter, 0 mSdLazyCounter, 2249 mSolverCounterSat, 1 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 1.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 1413 SdHoareTripleChecker+Valid, 7385 SdHoareTripleChecker+Invalid, 2250 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 1 IncrementalHoareTripleChecker+Valid, 2249 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 1.3s IncrementalHoareTripleChecker+Time [2025-02-08 00:11:09,483 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [1413 Valid, 7385 Invalid, 2250 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [1 Valid, 2249 Invalid, 0 Unknown, 0 Unchecked, 1.3s Time] [2025-02-08 00:11:09,485 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 2005 states. [2025-02-08 00:11:09,511 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 2005 to 1434. [2025-02-08 00:11:09,513 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 1434 states, 1433 states have (on average 1.4940683879972088) internal successors, (2141), 1433 states have internal predecessors, (2141), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-02-08 00:11:09,516 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1434 states to 1434 states and 2141 transitions. [2025-02-08 00:11:09,516 INFO L78 Accepts]: Start accepts. Automaton has 1434 states and 2141 transitions. Word has length 432 [2025-02-08 00:11:09,517 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-02-08 00:11:09,517 INFO L471 AbstractCegarLoop]: Abstraction has 1434 states and 2141 transitions. [2025-02-08 00:11:09,517 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 7 states, 7 states have (on average 61.714285714285715) internal successors, (432), 7 states have internal predecessors, (432), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-02-08 00:11:09,517 INFO L276 IsEmpty]: Start isEmpty. Operand 1434 states and 2141 transitions. [2025-02-08 00:11:09,522 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 434 [2025-02-08 00:11:09,522 INFO L210 NwaCegarLoop]: Found error trace [2025-02-08 00:11:09,523 INFO L218 NwaCegarLoop]: trace histogram [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, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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-08 00:11:09,523 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable9 [2025-02-08 00:11:09,523 INFO L396 AbstractCegarLoop]: === Iteration 11 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-02-08 00:11:09,523 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-02-08 00:11:09,523 INFO L85 PathProgramCache]: Analyzing trace with hash -1232142282, now seen corresponding path program 1 times [2025-02-08 00:11:09,524 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-02-08 00:11:09,524 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2030398145] [2025-02-08 00:11:09,524 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-02-08 00:11:09,524 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-02-08 00:11:09,701 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 433 statements into 1 equivalence classes. [2025-02-08 00:11:10,145 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 433 of 433 statements. [2025-02-08 00:11:10,145 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-02-08 00:11:10,145 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-02-08 00:11:11,140 INFO L134 CoverageAnalysis]: Checked inductivity of 18 backedges. 18 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-02-08 00:11:11,140 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-02-08 00:11:11,140 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2030398145] [2025-02-08 00:11:11,140 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [2030398145] provided 1 perfect and 0 imperfect interpolant sequences [2025-02-08 00:11:11,141 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-02-08 00:11:11,141 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2025-02-08 00:11:11,141 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [212337008] [2025-02-08 00:11:11,141 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-02-08 00:11:11,141 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2025-02-08 00:11:11,141 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-02-08 00:11:11,142 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2025-02-08 00:11:11,142 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=8, Invalid=12, Unknown=0, NotChecked=0, Total=20 [2025-02-08 00:11:11,142 INFO L87 Difference]: Start difference. First operand 1434 states and 2141 transitions. Second operand has 5 states, 5 states have (on average 86.6) internal successors, (433), 5 states have internal predecessors, (433), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-02-08 00:11:11,863 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-02-08 00:11:11,863 INFO L93 Difference]: Finished difference Result 2645 states and 3950 transitions. [2025-02-08 00:11:11,863 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2025-02-08 00:11:11,864 INFO L78 Accepts]: Start accepts. Automaton has has 5 states, 5 states have (on average 86.6) internal successors, (433), 5 states have internal predecessors, (433), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 433 [2025-02-08 00:11:11,864 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-02-08 00:11:11,867 INFO L225 Difference]: With dead ends: 2645 [2025-02-08 00:11:11,867 INFO L226 Difference]: Without dead ends: 1436 [2025-02-08 00:11:11,868 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 7 GetRequests, 4 SyntacticMatches, 0 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=8, Invalid=12, Unknown=0, NotChecked=0, Total=20 [2025-02-08 00:11:11,869 INFO L435 NwaCegarLoop]: 1021 mSDtfsCounter, 0 mSDsluCounter, 2582 mSDsCounter, 0 mSdLazyCounter, 1300 mSolverCounterSat, 1 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.6s Time, 0 mProtectedPredicate, 0 mProtectedAction, 0 SdHoareTripleChecker+Valid, 3603 SdHoareTripleChecker+Invalid, 1301 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 1 IncrementalHoareTripleChecker+Valid, 1300 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.7s IncrementalHoareTripleChecker+Time [2025-02-08 00:11:11,869 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [0 Valid, 3603 Invalid, 1301 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [1 Valid, 1300 Invalid, 0 Unknown, 0 Unchecked, 0.7s Time] [2025-02-08 00:11:11,870 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1436 states. [2025-02-08 00:11:11,923 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1436 to 1436. [2025-02-08 00:11:11,924 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 1436 states, 1435 states have (on average 1.4933797909407664) internal successors, (2143), 1435 states have internal predecessors, (2143), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-02-08 00:11:11,926 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1436 states to 1436 states and 2143 transitions. [2025-02-08 00:11:11,927 INFO L78 Accepts]: Start accepts. Automaton has 1436 states and 2143 transitions. Word has length 433 [2025-02-08 00:11:11,927 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-02-08 00:11:11,927 INFO L471 AbstractCegarLoop]: Abstraction has 1436 states and 2143 transitions. [2025-02-08 00:11:11,927 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 86.6) internal successors, (433), 5 states have internal predecessors, (433), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-02-08 00:11:11,928 INFO L276 IsEmpty]: Start isEmpty. Operand 1436 states and 2143 transitions. [2025-02-08 00:11:11,933 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 435 [2025-02-08 00:11:11,933 INFO L210 NwaCegarLoop]: Found error trace [2025-02-08 00:11:11,933 INFO L218 NwaCegarLoop]: trace histogram [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, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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-08 00:11:11,933 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable10 [2025-02-08 00:11:11,933 INFO L396 AbstractCegarLoop]: === Iteration 12 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-02-08 00:11:11,934 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-02-08 00:11:11,934 INFO L85 PathProgramCache]: Analyzing trace with hash -659333271, now seen corresponding path program 1 times [2025-02-08 00:11:11,934 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-02-08 00:11:11,934 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1865887969] [2025-02-08 00:11:11,934 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-02-08 00:11:11,934 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-02-08 00:11:12,070 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 434 statements into 1 equivalence classes. [2025-02-08 00:11:12,357 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 434 of 434 statements. [2025-02-08 00:11:12,357 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-02-08 00:11:12,357 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-02-08 00:11:13,151 INFO L134 CoverageAnalysis]: Checked inductivity of 18 backedges. 18 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-02-08 00:11:13,152 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-02-08 00:11:13,152 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1865887969] [2025-02-08 00:11:13,152 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1865887969] provided 1 perfect and 0 imperfect interpolant sequences [2025-02-08 00:11:13,152 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-02-08 00:11:13,153 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2025-02-08 00:11:13,153 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [724081864] [2025-02-08 00:11:13,153 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-02-08 00:11:13,153 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2025-02-08 00:11:13,154 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-02-08 00:11:13,155 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2025-02-08 00:11:13,155 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2025-02-08 00:11:13,155 INFO L87 Difference]: Start difference. First operand 1436 states and 2143 transitions. Second operand has 4 states, 4 states have (on average 108.5) internal successors, (434), 4 states have internal predecessors, (434), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-02-08 00:11:13,442 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-02-08 00:11:13,442 INFO L93 Difference]: Finished difference Result 2649 states and 3954 transitions. [2025-02-08 00:11:13,442 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2025-02-08 00:11:13,443 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 4 states have (on average 108.5) internal successors, (434), 4 states have internal predecessors, (434), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 434 [2025-02-08 00:11:13,443 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-02-08 00:11:13,447 INFO L225 Difference]: With dead ends: 2649 [2025-02-08 00:11:13,447 INFO L226 Difference]: Without dead ends: 1438 [2025-02-08 00:11:13,448 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-08 00:11:13,449 INFO L435 NwaCegarLoop]: 1021 mSDtfsCounter, 0 mSDsluCounter, 2034 mSDsCounter, 0 mSdLazyCounter, 622 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 0 SdHoareTripleChecker+Valid, 3055 SdHoareTripleChecker+Invalid, 622 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 622 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.3s IncrementalHoareTripleChecker+Time [2025-02-08 00:11:13,449 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [0 Valid, 3055 Invalid, 622 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 622 Invalid, 0 Unknown, 0 Unchecked, 0.3s Time] [2025-02-08 00:11:13,450 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1438 states. [2025-02-08 00:11:13,461 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1438 to 1438. [2025-02-08 00:11:13,463 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 1438 states, 1437 states have (on average 1.4926931106471817) internal successors, (2145), 1437 states have internal predecessors, (2145), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-02-08 00:11:13,465 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1438 states to 1438 states and 2145 transitions. [2025-02-08 00:11:13,465 INFO L78 Accepts]: Start accepts. Automaton has 1438 states and 2145 transitions. Word has length 434 [2025-02-08 00:11:13,465 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-02-08 00:11:13,465 INFO L471 AbstractCegarLoop]: Abstraction has 1438 states and 2145 transitions. [2025-02-08 00:11:13,465 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 108.5) internal successors, (434), 4 states have internal predecessors, (434), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-02-08 00:11:13,465 INFO L276 IsEmpty]: Start isEmpty. Operand 1438 states and 2145 transitions. [2025-02-08 00:11:13,468 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 436 [2025-02-08 00:11:13,469 INFO L210 NwaCegarLoop]: Found error trace [2025-02-08 00:11:13,469 INFO L218 NwaCegarLoop]: trace histogram [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, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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-08 00:11:13,469 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable11 [2025-02-08 00:11:13,469 INFO L396 AbstractCegarLoop]: === Iteration 13 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-02-08 00:11:13,470 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-02-08 00:11:13,470 INFO L85 PathProgramCache]: Analyzing trace with hash -2121018718, now seen corresponding path program 1 times [2025-02-08 00:11:13,470 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-02-08 00:11:13,470 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [425096819] [2025-02-08 00:11:13,470 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-02-08 00:11:13,470 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-02-08 00:11:13,601 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 435 statements into 1 equivalence classes. [2025-02-08 00:11:17,321 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 435 of 435 statements. [2025-02-08 00:11:17,321 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-02-08 00:11:17,321 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-02-08 00:11:18,348 INFO L134 CoverageAnalysis]: Checked inductivity of 18 backedges. 18 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-02-08 00:11:18,349 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-02-08 00:11:18,349 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [425096819] [2025-02-08 00:11:18,349 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [425096819] provided 1 perfect and 0 imperfect interpolant sequences [2025-02-08 00:11:18,349 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-02-08 00:11:18,349 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2025-02-08 00:11:18,349 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2048282330] [2025-02-08 00:11:18,349 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-02-08 00:11:18,349 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2025-02-08 00:11:18,349 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-02-08 00:11:18,350 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2025-02-08 00:11:18,350 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2025-02-08 00:11:18,351 INFO L87 Difference]: Start difference. First operand 1438 states and 2145 transitions. Second operand has 5 states, 5 states have (on average 87.0) internal successors, (435), 5 states have internal predecessors, (435), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-02-08 00:11:19,322 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-02-08 00:11:19,322 INFO L93 Difference]: Finished difference Result 3548 states and 5294 transitions. [2025-02-08 00:11:19,322 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2025-02-08 00:11:19,323 INFO L78 Accepts]: Start accepts. Automaton has has 5 states, 5 states have (on average 87.0) internal successors, (435), 5 states have internal predecessors, (435), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 435 [2025-02-08 00:11:19,324 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-02-08 00:11:19,328 INFO L225 Difference]: With dead ends: 3548 [2025-02-08 00:11:19,328 INFO L226 Difference]: Without dead ends: 1446 [2025-02-08 00:11:19,331 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-08 00:11:19,332 INFO L435 NwaCegarLoop]: 981 mSDtfsCounter, 322 mSDsluCounter, 2502 mSDsCounter, 0 mSdLazyCounter, 1545 mSolverCounterSat, 74 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.8s Time, 0 mProtectedPredicate, 0 mProtectedAction, 322 SdHoareTripleChecker+Valid, 3483 SdHoareTripleChecker+Invalid, 1619 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 74 IncrementalHoareTripleChecker+Valid, 1545 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.9s IncrementalHoareTripleChecker+Time [2025-02-08 00:11:19,332 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [322 Valid, 3483 Invalid, 1619 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [74 Valid, 1545 Invalid, 0 Unknown, 0 Unchecked, 0.9s Time] [2025-02-08 00:11:19,334 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1446 states. [2025-02-08 00:11:19,348 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1446 to 1442. [2025-02-08 00:11:19,350 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 1442 states, 1441 states have (on average 1.491325468424705) internal successors, (2149), 1441 states have internal predecessors, (2149), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-02-08 00:11:19,352 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1442 states to 1442 states and 2149 transitions. [2025-02-08 00:11:19,352 INFO L78 Accepts]: Start accepts. Automaton has 1442 states and 2149 transitions. Word has length 435 [2025-02-08 00:11:19,352 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-02-08 00:11:19,352 INFO L471 AbstractCegarLoop]: Abstraction has 1442 states and 2149 transitions. [2025-02-08 00:11:19,353 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 87.0) internal successors, (435), 5 states have internal predecessors, (435), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-02-08 00:11:19,353 INFO L276 IsEmpty]: Start isEmpty. Operand 1442 states and 2149 transitions. [2025-02-08 00:11:19,355 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 437 [2025-02-08 00:11:19,355 INFO L210 NwaCegarLoop]: Found error trace [2025-02-08 00:11:19,356 INFO L218 NwaCegarLoop]: trace histogram [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, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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-08 00:11:19,356 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable12 [2025-02-08 00:11:19,357 INFO L396 AbstractCegarLoop]: === Iteration 14 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-02-08 00:11:19,357 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-02-08 00:11:19,358 INFO L85 PathProgramCache]: Analyzing trace with hash 22789796, now seen corresponding path program 1 times [2025-02-08 00:11:19,358 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-02-08 00:11:19,358 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [807567085] [2025-02-08 00:11:19,358 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-02-08 00:11:19,358 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-02-08 00:11:19,531 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 436 statements into 1 equivalence classes. [2025-02-08 00:11:23,105 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 436 of 436 statements. [2025-02-08 00:11:23,106 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-02-08 00:11:23,106 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-02-08 00:11:24,882 INFO L134 CoverageAnalysis]: Checked inductivity of 18 backedges. 14 proven. 0 refuted. 0 times theorem prover too weak. 4 trivial. 0 not checked. [2025-02-08 00:11:24,882 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-02-08 00:11:24,882 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [807567085] [2025-02-08 00:11:24,882 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [807567085] provided 1 perfect and 0 imperfect interpolant sequences [2025-02-08 00:11:24,882 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-02-08 00:11:24,882 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2025-02-08 00:11:24,882 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1395964115] [2025-02-08 00:11:24,882 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-02-08 00:11:24,883 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2025-02-08 00:11:24,883 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-02-08 00:11:24,883 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2025-02-08 00:11:24,884 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=11, Invalid=19, Unknown=0, NotChecked=0, Total=30 [2025-02-08 00:11:24,884 INFO L87 Difference]: Start difference. First operand 1442 states and 2149 transitions. Second operand has 6 states, 6 states have (on average 72.33333333333333) internal successors, (434), 5 states have internal predecessors, (434), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-02-08 00:11:25,338 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-02-08 00:11:25,338 INFO L93 Difference]: Finished difference Result 2665 states and 3971 transitions. [2025-02-08 00:11:25,338 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2025-02-08 00:11:25,339 INFO L78 Accepts]: Start accepts. Automaton has has 6 states, 6 states have (on average 72.33333333333333) internal successors, (434), 5 states have internal predecessors, (434), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 436 [2025-02-08 00:11:25,339 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-02-08 00:11:25,342 INFO L225 Difference]: With dead ends: 2665 [2025-02-08 00:11:25,342 INFO L226 Difference]: Without dead ends: 1446 [2025-02-08 00:11:25,344 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 6 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 5 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 2 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=15, Invalid=27, Unknown=0, NotChecked=0, Total=42 [2025-02-08 00:11:25,344 INFO L435 NwaCegarLoop]: 1006 mSDtfsCounter, 1112 mSDsluCounter, 3008 mSDsCounter, 0 mSdLazyCounter, 896 mSolverCounterSat, 1 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.4s Time, 0 mProtectedPredicate, 0 mProtectedAction, 1112 SdHoareTripleChecker+Valid, 4014 SdHoareTripleChecker+Invalid, 897 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 1 IncrementalHoareTripleChecker+Valid, 896 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.4s IncrementalHoareTripleChecker+Time [2025-02-08 00:11:25,344 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [1112 Valid, 4014 Invalid, 897 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [1 Valid, 896 Invalid, 0 Unknown, 0 Unchecked, 0.4s Time] [2025-02-08 00:11:25,345 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1446 states. [2025-02-08 00:11:25,357 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1446 to 1444. [2025-02-08 00:11:25,359 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 1444 states, 1443 states have (on average 1.4892584892584892) internal successors, (2149), 1443 states have internal predecessors, (2149), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-02-08 00:11:25,360 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1444 states to 1444 states and 2149 transitions. [2025-02-08 00:11:25,360 INFO L78 Accepts]: Start accepts. Automaton has 1444 states and 2149 transitions. Word has length 436 [2025-02-08 00:11:25,361 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-02-08 00:11:25,361 INFO L471 AbstractCegarLoop]: Abstraction has 1444 states and 2149 transitions. [2025-02-08 00:11:25,361 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 6 states have (on average 72.33333333333333) internal successors, (434), 5 states have internal predecessors, (434), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-02-08 00:11:25,361 INFO L276 IsEmpty]: Start isEmpty. Operand 1444 states and 2149 transitions. [2025-02-08 00:11:25,363 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 438 [2025-02-08 00:11:25,363 INFO L210 NwaCegarLoop]: Found error trace [2025-02-08 00:11:25,364 INFO L218 NwaCegarLoop]: trace histogram [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, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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-08 00:11:25,364 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable13 [2025-02-08 00:11:25,364 INFO L396 AbstractCegarLoop]: === Iteration 15 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-02-08 00:11:25,364 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-02-08 00:11:25,364 INFO L85 PathProgramCache]: Analyzing trace with hash -1098117470, now seen corresponding path program 1 times [2025-02-08 00:11:25,365 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-02-08 00:11:25,365 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1612254027] [2025-02-08 00:11:25,365 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-02-08 00:11:25,365 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-02-08 00:11:25,496 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 437 statements into 1 equivalence classes. [2025-02-08 00:11:29,232 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 437 of 437 statements. [2025-02-08 00:11:29,232 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-02-08 00:11:29,232 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-02-08 00:11:29,987 INFO L134 CoverageAnalysis]: Checked inductivity of 19 backedges. 19 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-02-08 00:11:29,987 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-02-08 00:11:29,987 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1612254027] [2025-02-08 00:11:29,987 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1612254027] provided 1 perfect and 0 imperfect interpolant sequences [2025-02-08 00:11:29,987 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-02-08 00:11:29,987 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2025-02-08 00:11:29,987 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1351910966] [2025-02-08 00:11:29,988 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-02-08 00:11:29,988 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2025-02-08 00:11:29,988 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-02-08 00:11:29,988 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2025-02-08 00:11:29,988 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=10, Invalid=20, Unknown=0, NotChecked=0, Total=30 [2025-02-08 00:11:29,989 INFO L87 Difference]: Start difference. First operand 1444 states and 2149 transitions. Second operand has 6 states, 6 states have (on average 72.83333333333333) internal successors, (437), 6 states have internal predecessors, (437), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-02-08 00:11:31,242 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-02-08 00:11:31,243 INFO L93 Difference]: Finished difference Result 3719 states and 5547 transitions. [2025-02-08 00:11:31,243 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2025-02-08 00:11:31,243 INFO L78 Accepts]: Start accepts. Automaton has has 6 states, 6 states have (on average 72.83333333333333) internal successors, (437), 6 states have internal predecessors, (437), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 437 [2025-02-08 00:11:31,243 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-02-08 00:11:31,249 INFO L225 Difference]: With dead ends: 3719 [2025-02-08 00:11:31,249 INFO L226 Difference]: Without dead ends: 2500 [2025-02-08 00:11:31,251 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-08 00:11:31,254 INFO L435 NwaCegarLoop]: 1374 mSDtfsCounter, 1560 mSDsluCounter, 3281 mSDsCounter, 0 mSdLazyCounter, 2509 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 1.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 1560 SdHoareTripleChecker+Valid, 4655 SdHoareTripleChecker+Invalid, 2509 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 2509 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 1.2s IncrementalHoareTripleChecker+Time [2025-02-08 00:11:31,254 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [1560 Valid, 4655 Invalid, 2509 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 2509 Invalid, 0 Unknown, 0 Unchecked, 1.2s Time] [2025-02-08 00:11:31,256 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 2500 states. [2025-02-08 00:11:31,286 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 2500 to 1492. [2025-02-08 00:11:31,287 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 1492 states, 1491 states have (on average 1.488262910798122) internal successors, (2219), 1491 states have internal predecessors, (2219), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-02-08 00:11:31,288 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1492 states to 1492 states and 2219 transitions. [2025-02-08 00:11:31,289 INFO L78 Accepts]: Start accepts. Automaton has 1492 states and 2219 transitions. Word has length 437 [2025-02-08 00:11:31,289 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-02-08 00:11:31,290 INFO L471 AbstractCegarLoop]: Abstraction has 1492 states and 2219 transitions. [2025-02-08 00:11:31,290 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 6 states have (on average 72.83333333333333) internal successors, (437), 6 states have internal predecessors, (437), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-02-08 00:11:31,290 INFO L276 IsEmpty]: Start isEmpty. Operand 1492 states and 2219 transitions. [2025-02-08 00:11:31,292 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 438 [2025-02-08 00:11:31,292 INFO L210 NwaCegarLoop]: Found error trace [2025-02-08 00:11:31,293 INFO L218 NwaCegarLoop]: trace histogram [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, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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-08 00:11:31,293 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable14 [2025-02-08 00:11:31,293 INFO L396 AbstractCegarLoop]: === Iteration 16 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-02-08 00:11:31,293 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-02-08 00:11:31,293 INFO L85 PathProgramCache]: Analyzing trace with hash 1971494109, now seen corresponding path program 1 times [2025-02-08 00:11:31,293 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-02-08 00:11:31,294 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [894871403] [2025-02-08 00:11:31,294 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-02-08 00:11:31,294 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-02-08 00:11:31,434 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 437 statements into 1 equivalence classes. [2025-02-08 00:11:35,347 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 437 of 437 statements. [2025-02-08 00:11:35,347 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-02-08 00:11:35,347 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-02-08 00:11:36,144 INFO L134 CoverageAnalysis]: Checked inductivity of 19 backedges. 9 proven. 10 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-02-08 00:11:36,144 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-02-08 00:11:36,144 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [894871403] [2025-02-08 00:11:36,144 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [894871403] provided 0 perfect and 1 imperfect interpolant sequences [2025-02-08 00:11:36,144 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1707531667] [2025-02-08 00:11:36,144 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-02-08 00:11:36,144 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-02-08 00:11:36,144 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 [2025-02-08 00:11:36,147 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-08 00:11:36,148 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-08 00:11:37,341 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 437 statements into 1 equivalence classes. [2025-02-08 00:11:38,271 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 437 of 437 statements. [2025-02-08 00:11:38,272 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-02-08 00:11:38,272 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-02-08 00:11:38,304 INFO L256 TraceCheckSpWp]: Trace formula consists of 4475 conjuncts, 12 conjuncts are in the unsatisfiable core [2025-02-08 00:11:38,332 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-02-08 00:11:39,000 INFO L134 CoverageAnalysis]: Checked inductivity of 19 backedges. 9 proven. 10 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-02-08 00:11:39,001 INFO L312 TraceCheckSpWp]: Computing backward predicates... [2025-02-08 00:11:39,666 INFO L134 CoverageAnalysis]: Checked inductivity of 19 backedges. 9 proven. 10 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-02-08 00:11:39,666 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1707531667] provided 0 perfect and 2 imperfect interpolant sequences [2025-02-08 00:11:39,666 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2025-02-08 00:11:39,666 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [5, 5, 5] total 9 [2025-02-08 00:11:39,667 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [239926198] [2025-02-08 00:11:39,667 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2025-02-08 00:11:39,668 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 10 states [2025-02-08 00:11:39,668 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-02-08 00:11:39,669 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 10 interpolants. [2025-02-08 00:11:39,669 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=20, Invalid=70, Unknown=0, NotChecked=0, Total=90 [2025-02-08 00:11:39,669 INFO L87 Difference]: Start difference. First operand 1492 states and 2219 transitions. Second operand has 10 states, 10 states have (on average 62.0) internal successors, (620), 9 states have internal predecessors, (620), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-02-08 00:11:41,168 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-02-08 00:11:41,168 INFO L93 Difference]: Finished difference Result 4473 states and 6655 transitions. [2025-02-08 00:11:41,168 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 10 states. [2025-02-08 00:11:41,169 INFO L78 Accepts]: Start accepts. Automaton has has 10 states, 10 states have (on average 62.0) internal successors, (620), 9 states have internal predecessors, (620), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 437 [2025-02-08 00:11:41,169 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-02-08 00:11:41,174 INFO L225 Difference]: With dead ends: 4473 [2025-02-08 00:11:41,174 INFO L226 Difference]: Without dead ends: 2141 [2025-02-08 00:11:41,176 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 884 GetRequests, 869 SyntacticMatches, 0 SemanticMatches, 15 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 20 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=75, Invalid=197, Unknown=0, NotChecked=0, Total=272 [2025-02-08 00:11:41,177 INFO L435 NwaCegarLoop]: 978 mSDtfsCounter, 3589 mSDsluCounter, 5289 mSDsCounter, 0 mSdLazyCounter, 2577 mSolverCounterSat, 101 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 1.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 3589 SdHoareTripleChecker+Valid, 6267 SdHoareTripleChecker+Invalid, 2678 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 101 IncrementalHoareTripleChecker+Valid, 2577 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 1.4s IncrementalHoareTripleChecker+Time [2025-02-08 00:11:41,177 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [3589 Valid, 6267 Invalid, 2678 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [101 Valid, 2577 Invalid, 0 Unknown, 0 Unchecked, 1.4s Time] [2025-02-08 00:11:41,179 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 2141 states. [2025-02-08 00:11:41,193 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 2141 to 1765. [2025-02-08 00:11:41,199 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 1765 states, 1764 states have (on average 1.481859410430839) internal successors, (2614), 1764 states have internal predecessors, (2614), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-02-08 00:11:41,201 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1765 states to 1765 states and 2614 transitions. [2025-02-08 00:11:41,201 INFO L78 Accepts]: Start accepts. Automaton has 1765 states and 2614 transitions. Word has length 437 [2025-02-08 00:11:41,201 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-02-08 00:11:41,201 INFO L471 AbstractCegarLoop]: Abstraction has 1765 states and 2614 transitions. [2025-02-08 00:11:41,203 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 10 states, 10 states have (on average 62.0) internal successors, (620), 9 states have internal predecessors, (620), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-02-08 00:11:41,203 INFO L276 IsEmpty]: Start isEmpty. Operand 1765 states and 2614 transitions. [2025-02-08 00:11:41,206 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 440 [2025-02-08 00:11:41,206 INFO L210 NwaCegarLoop]: Found error trace [2025-02-08 00:11:41,206 INFO L218 NwaCegarLoop]: trace histogram [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, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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-08 00:11:41,234 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (2)] Ended with exit code 0 [2025-02-08 00:11:41,411 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,SelfDestructingSolverStorable15 [2025-02-08 00:11:41,411 INFO L396 AbstractCegarLoop]: === Iteration 17 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-02-08 00:11:41,411 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-02-08 00:11:41,412 INFO L85 PathProgramCache]: Analyzing trace with hash -1826203379, now seen corresponding path program 1 times [2025-02-08 00:11:41,412 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-02-08 00:11:41,412 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [918538696] [2025-02-08 00:11:41,412 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-02-08 00:11:41,412 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-02-08 00:11:41,631 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 439 statements into 1 equivalence classes. [2025-02-08 00:11:46,744 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 439 of 439 statements. [2025-02-08 00:11:46,744 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-02-08 00:11:46,744 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-02-08 00:11:47,477 INFO L134 CoverageAnalysis]: Checked inductivity of 19 backedges. 19 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-02-08 00:11:47,478 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-02-08 00:11:47,478 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [918538696] [2025-02-08 00:11:47,478 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [918538696] provided 1 perfect and 0 imperfect interpolant sequences [2025-02-08 00:11:47,478 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-02-08 00:11:47,478 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2025-02-08 00:11:47,478 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [800308960] [2025-02-08 00:11:47,478 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-02-08 00:11:47,478 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2025-02-08 00:11:47,478 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-02-08 00:11:47,479 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2025-02-08 00:11:47,479 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=10, Invalid=20, Unknown=0, NotChecked=0, Total=30 [2025-02-08 00:11:47,479 INFO L87 Difference]: Start difference. First operand 1765 states and 2614 transitions. Second operand has 6 states, 6 states have (on average 73.16666666666667) internal successors, (439), 6 states have internal predecessors, (439), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-02-08 00:11:48,446 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-02-08 00:11:48,446 INFO L93 Difference]: Finished difference Result 4954 states and 7329 transitions. [2025-02-08 00:11:48,447 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2025-02-08 00:11:48,447 INFO L78 Accepts]: Start accepts. Automaton has has 6 states, 6 states have (on average 73.16666666666667) internal successors, (439), 6 states have internal predecessors, (439), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 439 [2025-02-08 00:11:48,447 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-02-08 00:11:48,455 INFO L225 Difference]: With dead ends: 4954 [2025-02-08 00:11:48,455 INFO L226 Difference]: Without dead ends: 3687 [2025-02-08 00:11:48,456 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-08 00:11:48,456 INFO L435 NwaCegarLoop]: 798 mSDtfsCounter, 1827 mSDsluCounter, 2792 mSDsCounter, 0 mSdLazyCounter, 2011 mSolverCounterSat, 65 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.8s Time, 0 mProtectedPredicate, 0 mProtectedAction, 1827 SdHoareTripleChecker+Valid, 3590 SdHoareTripleChecker+Invalid, 2076 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 65 IncrementalHoareTripleChecker+Valid, 2011 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.9s IncrementalHoareTripleChecker+Time [2025-02-08 00:11:48,456 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [1827 Valid, 3590 Invalid, 2076 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [65 Valid, 2011 Invalid, 0 Unknown, 0 Unchecked, 0.9s Time] [2025-02-08 00:11:48,458 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 3687 states. [2025-02-08 00:11:48,481 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 3687 to 3249. [2025-02-08 00:11:48,487 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 3249 states, 3248 states have (on average 1.47814039408867) internal successors, (4801), 3248 states have internal predecessors, (4801), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-02-08 00:11:48,493 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3249 states to 3249 states and 4801 transitions. [2025-02-08 00:11:48,495 INFO L78 Accepts]: Start accepts. Automaton has 3249 states and 4801 transitions. Word has length 439 [2025-02-08 00:11:48,495 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-02-08 00:11:48,495 INFO L471 AbstractCegarLoop]: Abstraction has 3249 states and 4801 transitions. [2025-02-08 00:11:48,496 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 6 states have (on average 73.16666666666667) internal successors, (439), 6 states have internal predecessors, (439), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-02-08 00:11:48,496 INFO L276 IsEmpty]: Start isEmpty. Operand 3249 states and 4801 transitions. [2025-02-08 00:11:48,500 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 441 [2025-02-08 00:11:48,500 INFO L210 NwaCegarLoop]: Found error trace [2025-02-08 00:11:48,500 INFO L218 NwaCegarLoop]: trace histogram [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, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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-08 00:11:48,500 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable16 [2025-02-08 00:11:48,501 INFO L396 AbstractCegarLoop]: === Iteration 18 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-02-08 00:11:48,501 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-02-08 00:11:48,501 INFO L85 PathProgramCache]: Analyzing trace with hash 1236136487, now seen corresponding path program 1 times [2025-02-08 00:11:48,501 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-02-08 00:11:48,501 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [721748299] [2025-02-08 00:11:48,501 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-02-08 00:11:48,501 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-02-08 00:11:48,650 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 440 statements into 1 equivalence classes. [2025-02-08 00:11:55,569 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 440 of 440 statements. [2025-02-08 00:11:55,569 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-02-08 00:11:55,569 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-02-08 00:11:56,433 INFO L134 CoverageAnalysis]: Checked inductivity of 19 backedges. 19 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-02-08 00:11:56,434 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-02-08 00:11:56,434 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [721748299] [2025-02-08 00:11:56,434 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [721748299] provided 1 perfect and 0 imperfect interpolant sequences [2025-02-08 00:11:56,434 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-02-08 00:11:56,434 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2025-02-08 00:11:56,434 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2023897972] [2025-02-08 00:11:56,434 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-02-08 00:11:56,435 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2025-02-08 00:11:56,435 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-02-08 00:11:56,436 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2025-02-08 00:11:56,436 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=12, Invalid=18, Unknown=0, NotChecked=0, Total=30 [2025-02-08 00:11:56,436 INFO L87 Difference]: Start difference. First operand 3249 states and 4801 transitions. Second operand has 6 states, 6 states have (on average 73.33333333333333) internal successors, (440), 5 states have internal predecessors, (440), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-02-08 00:11:57,662 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-02-08 00:11:57,663 INFO L93 Difference]: Finished difference Result 5989 states and 8869 transitions. [2025-02-08 00:11:57,663 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2025-02-08 00:11:57,663 INFO L78 Accepts]: Start accepts. Automaton has has 6 states, 6 states have (on average 73.33333333333333) internal successors, (440), 5 states have internal predecessors, (440), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 440 [2025-02-08 00:11:57,663 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-02-08 00:11:57,669 INFO L225 Difference]: With dead ends: 5989 [2025-02-08 00:11:57,669 INFO L226 Difference]: Without dead ends: 3523 [2025-02-08 00:11:57,671 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 7 GetRequests, 2 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-08 00:11:57,671 INFO L435 NwaCegarLoop]: 652 mSDtfsCounter, 2147 mSDsluCounter, 1845 mSDsCounter, 0 mSdLazyCounter, 3004 mSolverCounterSat, 1 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 1.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 2147 SdHoareTripleChecker+Valid, 2497 SdHoareTripleChecker+Invalid, 3005 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 1 IncrementalHoareTripleChecker+Valid, 3004 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 1.2s IncrementalHoareTripleChecker+Time [2025-02-08 00:11:57,672 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [2147 Valid, 2497 Invalid, 3005 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [1 Valid, 3004 Invalid, 0 Unknown, 0 Unchecked, 1.2s Time] [2025-02-08 00:11:57,674 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 3523 states. [2025-02-08 00:11:57,697 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 3523 to 2935. [2025-02-08 00:11:57,699 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 2935 states, 2934 states have (on average 1.477845944103613) internal successors, (4336), 2934 states have internal predecessors, (4336), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-02-08 00:11:57,701 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 2935 states to 2935 states and 4336 transitions. [2025-02-08 00:11:57,701 INFO L78 Accepts]: Start accepts. Automaton has 2935 states and 4336 transitions. Word has length 440 [2025-02-08 00:11:57,702 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-02-08 00:11:57,702 INFO L471 AbstractCegarLoop]: Abstraction has 2935 states and 4336 transitions. [2025-02-08 00:11:57,703 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 6 states have (on average 73.33333333333333) internal successors, (440), 5 states have internal predecessors, (440), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-02-08 00:11:57,703 INFO L276 IsEmpty]: Start isEmpty. Operand 2935 states and 4336 transitions. [2025-02-08 00:11:57,706 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 441 [2025-02-08 00:11:57,706 INFO L210 NwaCegarLoop]: Found error trace [2025-02-08 00:11:57,707 INFO L218 NwaCegarLoop]: trace histogram [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, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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-08 00:11:57,707 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable17 [2025-02-08 00:11:57,707 INFO L396 AbstractCegarLoop]: === Iteration 19 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-02-08 00:11:57,708 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-02-08 00:11:57,708 INFO L85 PathProgramCache]: Analyzing trace with hash -1241836938, now seen corresponding path program 1 times [2025-02-08 00:11:57,708 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-02-08 00:11:57,708 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [222353940] [2025-02-08 00:11:57,708 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-02-08 00:11:57,708 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-02-08 00:11:57,857 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 440 statements into 1 equivalence classes. [2025-02-08 00:12:03,797 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 440 of 440 statements. [2025-02-08 00:12:03,797 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-02-08 00:12:03,797 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-02-08 00:12:05,583 INFO L134 CoverageAnalysis]: Checked inductivity of 19 backedges. 19 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-02-08 00:12:05,583 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-02-08 00:12:05,583 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [222353940] [2025-02-08 00:12:05,583 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [222353940] provided 1 perfect and 0 imperfect interpolant sequences [2025-02-08 00:12:05,583 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-02-08 00:12:05,583 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2025-02-08 00:12:05,583 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1829535222] [2025-02-08 00:12:05,583 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-02-08 00:12:05,584 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 8 states [2025-02-08 00:12:05,584 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-02-08 00:12:05,584 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2025-02-08 00:12:05,584 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=18, Invalid=38, Unknown=0, NotChecked=0, Total=56 [2025-02-08 00:12:05,584 INFO L87 Difference]: Start difference. First operand 2935 states and 4336 transitions. Second operand has 8 states, 8 states have (on average 55.0) internal successors, (440), 7 states have internal predecessors, (440), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-02-08 00:12:07,739 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-02-08 00:12:07,739 INFO L93 Difference]: Finished difference Result 7657 states and 11357 transitions. [2025-02-08 00:12:07,740 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2025-02-08 00:12:07,740 INFO L78 Accepts]: Start accepts. Automaton has has 8 states, 8 states have (on average 55.0) internal successors, (440), 7 states have internal predecessors, (440), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 440 [2025-02-08 00:12:07,740 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-02-08 00:12:07,747 INFO L225 Difference]: With dead ends: 7657 [2025-02-08 00:12:07,747 INFO L226 Difference]: Without dead ends: 5505 [2025-02-08 00:12:07,749 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 14 GetRequests, 3 SyntacticMatches, 0 SemanticMatches, 11 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 7 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=54, Invalid=102, Unknown=0, NotChecked=0, Total=156 [2025-02-08 00:12:07,750 INFO L435 NwaCegarLoop]: 1171 mSDtfsCounter, 4252 mSDsluCounter, 3226 mSDsCounter, 0 mSdLazyCounter, 3544 mSolverCounterSat, 8 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 1.7s Time, 0 mProtectedPredicate, 0 mProtectedAction, 4252 SdHoareTripleChecker+Valid, 4397 SdHoareTripleChecker+Invalid, 3552 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 8 IncrementalHoareTripleChecker+Valid, 3544 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 2.0s IncrementalHoareTripleChecker+Time [2025-02-08 00:12:07,750 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [4252 Valid, 4397 Invalid, 3552 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [8 Valid, 3544 Invalid, 0 Unknown, 0 Unchecked, 2.0s Time] [2025-02-08 00:12:07,752 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 5505 states. [2025-02-08 00:12:07,780 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 5505 to 3758. [2025-02-08 00:12:07,782 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 3758 states, 3757 states have (on average 1.4780409901517169) internal successors, (5553), 3757 states have internal predecessors, (5553), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-02-08 00:12:07,786 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3758 states to 3758 states and 5553 transitions. [2025-02-08 00:12:07,786 INFO L78 Accepts]: Start accepts. Automaton has 3758 states and 5553 transitions. Word has length 440 [2025-02-08 00:12:07,786 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-02-08 00:12:07,786 INFO L471 AbstractCegarLoop]: Abstraction has 3758 states and 5553 transitions. [2025-02-08 00:12:07,787 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 8 states, 8 states have (on average 55.0) internal successors, (440), 7 states have internal predecessors, (440), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-02-08 00:12:07,787 INFO L276 IsEmpty]: Start isEmpty. Operand 3758 states and 5553 transitions. [2025-02-08 00:12:07,791 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 442 [2025-02-08 00:12:07,792 INFO L210 NwaCegarLoop]: Found error trace [2025-02-08 00:12:07,792 INFO L218 NwaCegarLoop]: trace histogram [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, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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-08 00:12:07,792 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable18 [2025-02-08 00:12:07,792 INFO L396 AbstractCegarLoop]: === Iteration 20 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-02-08 00:12:07,793 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-02-08 00:12:07,793 INFO L85 PathProgramCache]: Analyzing trace with hash 1430980938, now seen corresponding path program 1 times [2025-02-08 00:12:07,793 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-02-08 00:12:07,793 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [430117454] [2025-02-08 00:12:07,793 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-02-08 00:12:07,793 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-02-08 00:12:07,938 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 441 statements into 1 equivalence classes.