./Ultimate.py --spec ../sv-benchmarks/c/properties/unreach-call.prp --file ../sv-benchmarks/c/hardware-verification-bv/btor2c-lazyMod.gear.1.prop1-func-interl.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.gear.1.prop1-func-interl.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 a950f5ab20de05994a7f9773ec8cee1af06e8b795e2cdd285e2e11c07a0d01e7 --- Real Ultimate output --- This is Ultimate 0.3.0-?-48c9605-m [2025-02-07 23:11:12,905 INFO L188 SettingsManager]: Resetting all preferences to default values... [2025-02-07 23:11:12,957 INFO L114 SettingsManager]: Loading settings from /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/config/svcomp-Reach-64bit-Automizer_Default.epf [2025-02-07 23:11:12,961 WARN L101 SettingsManager]: Preference file contains the following unknown settings: [2025-02-07 23:11:12,964 WARN L103 SettingsManager]: * de.uni_freiburg.informatik.ultimate.core.Log level for class [2025-02-07 23:11:12,978 INFO L130 SettingsManager]: Preferences different from defaults after loading the file: [2025-02-07 23:11:12,978 INFO L151 SettingsManager]: Preferences of UltimateCore differ from their defaults: [2025-02-07 23:11:12,979 INFO L153 SettingsManager]: * Log level for class=de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher=ERROR; [2025-02-07 23:11:12,979 INFO L151 SettingsManager]: Preferences of Boogie Preprocessor differ from their defaults: [2025-02-07 23:11:12,979 INFO L153 SettingsManager]: * Use memory slicer=true [2025-02-07 23:11:12,979 INFO L151 SettingsManager]: Preferences of Boogie Procedure Inliner differ from their defaults: [2025-02-07 23:11:12,979 INFO L153 SettingsManager]: * Ignore calls to procedures called more than once=ONLY_FOR_SEQUENTIAL_PROGRAMS [2025-02-07 23:11:12,979 INFO L151 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2025-02-07 23:11:12,979 INFO L153 SettingsManager]: * Create parallel compositions if possible=false [2025-02-07 23:11:12,980 INFO L153 SettingsManager]: * Use SBE=true [2025-02-07 23:11:12,980 INFO L151 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2025-02-07 23:11:12,980 INFO L153 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2025-02-07 23:11:12,980 INFO L153 SettingsManager]: * Overapproximate operations on floating types=true [2025-02-07 23:11:12,986 INFO L153 SettingsManager]: * Check division by zero=IGNORE [2025-02-07 23:11:12,986 INFO L153 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2025-02-07 23:11:12,986 INFO L153 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2025-02-07 23:11:12,986 INFO L153 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2025-02-07 23:11:12,986 INFO L153 SettingsManager]: * Check if freed pointer was valid=false [2025-02-07 23:11:12,986 INFO L153 SettingsManager]: * Behaviour of calls to undefined functions=OVERAPPROXIMATE_BEHAVIOUR [2025-02-07 23:11:12,986 INFO L153 SettingsManager]: * Use constant arrays=true [2025-02-07 23:11:12,986 INFO L151 SettingsManager]: Preferences of IcfgBuilder differ from their defaults: [2025-02-07 23:11:12,986 INFO L153 SettingsManager]: * Size of a code block=SequenceOfStatements [2025-02-07 23:11:12,986 INFO L153 SettingsManager]: * Only consider context switches at boundaries of atomic blocks=true [2025-02-07 23:11:12,986 INFO L153 SettingsManager]: * SMT solver=External_DefaultMode [2025-02-07 23:11:12,986 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2025-02-07 23:11:12,986 INFO L151 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2025-02-07 23:11:12,986 INFO L153 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2025-02-07 23:11:12,986 INFO L153 SettingsManager]: * Compute procedure contracts=false [2025-02-07 23:11:12,986 INFO L153 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopHeads [2025-02-07 23:11:12,987 INFO L153 SettingsManager]: * Trace refinement strategy=CAMEL [2025-02-07 23:11:12,987 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2025-02-07 23:11:12,987 INFO L153 SettingsManager]: * Apply one-shot large block encoding in concurrent analysis=false [2025-02-07 23:11:12,987 INFO L153 SettingsManager]: * Automaton type used in concurrency analysis=PETRI_NET [2025-02-07 23:11:12,987 INFO L153 SettingsManager]: * Order on configurations for Petri net unfoldings=DBO [2025-02-07 23:11:12,987 INFO L153 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode [2025-02-07 23:11:12,987 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 -> a950f5ab20de05994a7f9773ec8cee1af06e8b795e2cdd285e2e11c07a0d01e7 [2025-02-07 23:11:13,226 INFO L75 nceAwareModelManager]: Repository-Root is: /tmp [2025-02-07 23:11:13,233 INFO L261 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2025-02-07 23:11:13,236 INFO L217 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2025-02-07 23:11:13,237 INFO L270 PluginConnector]: Initializing CDTParser... [2025-02-07 23:11:13,237 INFO L274 PluginConnector]: CDTParser initialized [2025-02-07 23:11:13,239 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.gear.1.prop1-func-interl.c [2025-02-07 23:11:14,432 INFO L533 CDTParser]: Created temporary CDT project at /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/data/487aa12c0/6f1a004420674bfc8c12ee2bc07ec682/FLAG1c890b8bc [2025-02-07 23:11:14,741 INFO L384 CDTParser]: Found 1 translation units. [2025-02-07 23:11:14,742 INFO L180 CDTParser]: Scanning /storage/repos/ultimate-jdk21/releaseScripts/default/sv-benchmarks/c/hardware-verification-bv/btor2c-lazyMod.gear.1.prop1-func-interl.c [2025-02-07 23:11:14,763 INFO L427 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/data/487aa12c0/6f1a004420674bfc8c12ee2bc07ec682/FLAG1c890b8bc [2025-02-07 23:11:14,778 INFO L435 CDTParser]: Successfully deleted /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/data/487aa12c0/6f1a004420674bfc8c12ee2bc07ec682 [2025-02-07 23:11:14,780 INFO L299 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2025-02-07 23:11:14,781 INFO L133 ToolchainWalker]: Walking toolchain with 6 elements. [2025-02-07 23:11:14,782 INFO L112 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2025-02-07 23:11:14,782 INFO L270 PluginConnector]: Initializing CACSL2BoogieTranslator... [2025-02-07 23:11:14,785 INFO L274 PluginConnector]: CACSL2BoogieTranslator initialized [2025-02-07 23:11:14,786 INFO L184 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 07.02 11:11:14" (1/1) ... [2025-02-07 23:11:14,787 INFO L204 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@347e6d2c and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 07.02 11:11:14, skipping insertion in model container [2025-02-07 23:11:14,787 INFO L184 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 07.02 11:11:14" (1/1) ... [2025-02-07 23:11:14,837 INFO L175 MainTranslator]: Built tables and reachable declarations [2025-02-07 23:11:14,993 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.gear.1.prop1-func-interl.c[1171,1184] [2025-02-07 23:11:15,378 INFO L210 PostProcessor]: Analyzing one entry point: main [2025-02-07 23:11:15,385 INFO L200 MainTranslator]: Completed pre-run [2025-02-07 23:11:15,393 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.gear.1.prop1-func-interl.c[1171,1184] [2025-02-07 23:11:15,590 INFO L210 PostProcessor]: Analyzing one entry point: main [2025-02-07 23:11:15,600 INFO L204 MainTranslator]: Completed translation [2025-02-07 23:11:15,601 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 07.02 11:11:15 WrapperNode [2025-02-07 23:11:15,602 INFO L131 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2025-02-07 23:11:15,602 INFO L112 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2025-02-07 23:11:15,602 INFO L270 PluginConnector]: Initializing Boogie Procedure Inliner... [2025-02-07 23:11:15,603 INFO L274 PluginConnector]: Boogie Procedure Inliner initialized [2025-02-07 23:11:15,607 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 07.02 11:11:15" (1/1) ... [2025-02-07 23:11:15,673 INFO L184 PluginConnector]: Executing the observer Inliner from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 07.02 11:11:15" (1/1) ... [2025-02-07 23:11:16,769 INFO L138 Inliner]: procedures = 17, calls = 8, calls flagged for inlining = 3, calls inlined = 3, statements flattened = 12372 [2025-02-07 23:11:16,770 INFO L131 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2025-02-07 23:11:16,770 INFO L112 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2025-02-07 23:11:16,770 INFO L270 PluginConnector]: Initializing Boogie Preprocessor... [2025-02-07 23:11:16,770 INFO L274 PluginConnector]: Boogie Preprocessor initialized [2025-02-07 23:11:16,777 INFO L184 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 07.02 11:11:15" (1/1) ... [2025-02-07 23:11:16,778 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 07.02 11:11:15" (1/1) ... [2025-02-07 23:11:17,106 INFO L184 PluginConnector]: Executing the observer MemorySlicer from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 07.02 11:11:15" (1/1) ... [2025-02-07 23:11:17,297 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-07 23:11:17,297 INFO L184 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 07.02 11:11:15" (1/1) ... [2025-02-07 23:11:17,298 INFO L184 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 07.02 11:11:15" (1/1) ... [2025-02-07 23:11:17,730 INFO L184 PluginConnector]: Executing the observer ReplaceArrayAssignments from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 07.02 11:11:15" (1/1) ... [2025-02-07 23:11:17,762 INFO L184 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 07.02 11:11:15" (1/1) ... [2025-02-07 23:11:17,807 INFO L184 PluginConnector]: Executing the observer LTLStepAnnotator from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 07.02 11:11:15" (1/1) ... [2025-02-07 23:11:17,844 INFO L184 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 07.02 11:11:15" (1/1) ... [2025-02-07 23:11:17,985 INFO L131 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2025-02-07 23:11:17,986 INFO L112 PluginConnector]: ------------------------IcfgBuilder---------------------------- [2025-02-07 23:11:17,986 INFO L270 PluginConnector]: Initializing IcfgBuilder... [2025-02-07 23:11:17,986 INFO L274 PluginConnector]: IcfgBuilder initialized [2025-02-07 23:11:17,987 INFO L184 PluginConnector]: Executing the observer IcfgBuilderObserver from plugin IcfgBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 07.02 11:11:15" (1/1) ... [2025-02-07 23:11:17,992 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2025-02-07 23:11:18,001 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 [2025-02-07 23:11:18,012 INFO L229 MonitoredProcess]: Starting monitored process 1 with /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 (exit command is (exit), workingDir is null) [2025-02-07 23:11:18,014 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 (1)] Waiting until timeout for monitored process [2025-02-07 23:11:18,033 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocInit [2025-02-07 23:11:18,033 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int#0 [2025-02-07 23:11:18,033 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2025-02-07 23:11:18,033 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2025-02-07 23:11:18,538 INFO L257 CfgBuilder]: Building ICFG [2025-02-07 23:11:18,540 INFO L287 CfgBuilder]: Building CFG for each procedure with an implementation [2025-02-07 23:11:35,827 INFO L? ?]: Removed 7032 outVars from TransFormulas that were not future-live. [2025-02-07 23:11:35,828 INFO L308 CfgBuilder]: Performing block encoding [2025-02-07 23:11:36,403 INFO L332 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2025-02-07 23:11:36,404 INFO L337 CfgBuilder]: Removed 2 assume(true) statements. [2025-02-07 23:11:36,404 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.icfgbuilder CFG 07.02 11:11:36 BoogieIcfgContainer [2025-02-07 23:11:36,404 INFO L131 PluginConnector]: ------------------------ END IcfgBuilder---------------------------- [2025-02-07 23:11:36,415 INFO L112 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2025-02-07 23:11:36,416 INFO L270 PluginConnector]: Initializing TraceAbstraction... [2025-02-07 23:11:36,423 INFO L274 PluginConnector]: TraceAbstraction initialized [2025-02-07 23:11:36,424 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 07.02 11:11:14" (1/3) ... [2025-02-07 23:11:36,424 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@7fface64 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 07.02 11:11:36, skipping insertion in model container [2025-02-07 23:11:36,424 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 07.02 11:11:15" (2/3) ... [2025-02-07 23:11:36,424 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@7fface64 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 07.02 11:11:36, skipping insertion in model container [2025-02-07 23:11:36,430 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.icfgbuilder CFG 07.02 11:11:36" (3/3) ... [2025-02-07 23:11:36,431 INFO L128 eAbstractionObserver]: Analyzing ICFG btor2c-lazyMod.gear.1.prop1-func-interl.c [2025-02-07 23:11:36,453 INFO L216 ceAbstractionStarter]: Automizer settings: Hoare:LoopHeads NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2025-02-07 23:11:36,461 INFO L151 ceAbstractionStarter]: Applying trace abstraction to ICFG btor2c-lazyMod.gear.1.prop1-func-interl.c that has 1 procedures, 4366 locations, 1 initial locations, 1 loop locations, and 1 error locations. [2025-02-07 23:11:36,620 INFO L332 AbstractCegarLoop]: ======== Iteration 0 == of CEGAR loop == AllErrorsAtOnce ======== [2025-02-07 23:11:36,634 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;@68961121, mLbeIndependenceSettings=[IndependenceType=SEMANTIC, AbstractionType=NONE, UseConditional=false, UseSemiCommutativity=true, Solver=Z3, SolverTimeout=1000ms] [2025-02-07 23:11:36,635 INFO L334 AbstractCegarLoop]: Starting to check reachability of 1 error locations. [2025-02-07 23:11:36,648 INFO L276 IsEmpty]: Start isEmpty. Operand has 4366 states, 4364 states have (on average 1.5011457378551787) internal successors, (6551), 4365 states have internal predecessors, (6551), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-02-07 23:11:36,681 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 227 [2025-02-07 23:11:36,686 INFO L210 NwaCegarLoop]: Found error trace [2025-02-07 23:11:36,687 INFO L218 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-02-07 23:11:36,688 INFO L396 AbstractCegarLoop]: === Iteration 1 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-02-07 23:11:36,693 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-02-07 23:11:36,694 INFO L85 PathProgramCache]: Analyzing trace with hash 1779805402, now seen corresponding path program 1 times [2025-02-07 23:11:36,704 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-02-07 23:11:36,705 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [978698785] [2025-02-07 23:11:36,705 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-02-07 23:11:36,705 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-02-07 23:11:36,851 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 226 statements into 1 equivalence classes. [2025-02-07 23:11:36,988 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 226 of 226 statements. [2025-02-07 23:11:36,988 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-02-07 23:11:36,988 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-02-07 23:11:37,514 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-02-07 23:11:37,514 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-02-07 23:11:37,515 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [978698785] [2025-02-07 23:11:37,516 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [978698785] provided 1 perfect and 0 imperfect interpolant sequences [2025-02-07 23:11:37,516 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-02-07 23:11:37,516 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2025-02-07 23:11:37,517 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1092388782] [2025-02-07 23:11:37,519 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-02-07 23:11:37,522 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2025-02-07 23:11:37,523 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-02-07 23:11:37,542 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2025-02-07 23:11:37,542 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-02-07 23:11:37,553 INFO L87 Difference]: Start difference. First operand has 4366 states, 4364 states have (on average 1.5011457378551787) internal successors, (6551), 4365 states have internal predecessors, (6551), 0 states have call successors, (0), 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 3 states, 3 states have (on average 75.33333333333333) internal successors, (226), 3 states have internal predecessors, (226), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-02-07 23:11:39,055 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-02-07 23:11:39,056 INFO L93 Difference]: Finished difference Result 8498 states and 12754 transitions. [2025-02-07 23:11:39,057 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2025-02-07 23:11:39,058 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 75.33333333333333) internal successors, (226), 3 states have internal predecessors, (226), 0 states have call successors, (0), 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 226 [2025-02-07 23:11:39,059 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-02-07 23:11:39,091 INFO L225 Difference]: With dead ends: 8498 [2025-02-07 23:11:39,091 INFO L226 Difference]: Without dead ends: 4365 [2025-02-07 23:11:39,103 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 3 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-02-07 23:11:39,105 INFO L435 NwaCegarLoop]: 5459 mSDtfsCounter, 0 mSDsluCounter, 5454 mSDsCounter, 0 mSdLazyCounter, 2182 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 1.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 0 SdHoareTripleChecker+Valid, 10913 SdHoareTripleChecker+Invalid, 2182 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 2182 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 1.4s IncrementalHoareTripleChecker+Time [2025-02-07 23:11:39,106 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [0 Valid, 10913 Invalid, 2182 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 2182 Invalid, 0 Unknown, 0 Unchecked, 1.4s Time] [2025-02-07 23:11:39,126 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 4365 states. [2025-02-07 23:11:39,241 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 4365 to 4365. [2025-02-07 23:11:39,248 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 4365 states, 4364 states have (on average 1.5006874427131072) internal successors, (6549), 4364 states have internal predecessors, (6549), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-02-07 23:11:39,263 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4365 states to 4365 states and 6549 transitions. [2025-02-07 23:11:39,265 INFO L78 Accepts]: Start accepts. Automaton has 4365 states and 6549 transitions. Word has length 226 [2025-02-07 23:11:39,266 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-02-07 23:11:39,267 INFO L471 AbstractCegarLoop]: Abstraction has 4365 states and 6549 transitions. [2025-02-07 23:11:39,267 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 75.33333333333333) internal successors, (226), 3 states have internal predecessors, (226), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-02-07 23:11:39,268 INFO L276 IsEmpty]: Start isEmpty. Operand 4365 states and 6549 transitions. [2025-02-07 23:11:39,270 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 227 [2025-02-07 23:11:39,274 INFO L210 NwaCegarLoop]: Found error trace [2025-02-07 23:11:39,274 INFO L218 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-02-07 23:11:39,274 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable0 [2025-02-07 23:11:39,274 INFO L396 AbstractCegarLoop]: === Iteration 2 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-02-07 23:11:39,275 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-02-07 23:11:39,275 INFO L85 PathProgramCache]: Analyzing trace with hash -865972357, now seen corresponding path program 1 times [2025-02-07 23:11:39,275 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-02-07 23:11:39,275 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [563787372] [2025-02-07 23:11:39,275 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-02-07 23:11:39,275 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-02-07 23:11:39,333 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 226 statements into 1 equivalence classes. [2025-02-07 23:11:39,372 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 226 of 226 statements. [2025-02-07 23:11:39,372 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-02-07 23:11:39,372 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-02-07 23:11:39,851 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-02-07 23:11:39,853 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-02-07 23:11:39,854 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [563787372] [2025-02-07 23:11:39,854 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [563787372] provided 1 perfect and 0 imperfect interpolant sequences [2025-02-07 23:11:39,854 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-02-07 23:11:39,854 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2025-02-07 23:11:39,854 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1684189995] [2025-02-07 23:11:39,854 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-02-07 23:11:39,855 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2025-02-07 23:11:39,855 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-02-07 23:11:39,856 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2025-02-07 23:11:39,856 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2025-02-07 23:11:39,856 INFO L87 Difference]: Start difference. First operand 4365 states and 6549 transitions. Second operand has 4 states, 4 states have (on average 56.5) internal successors, (226), 4 states have internal predecessors, (226), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-02-07 23:11:41,552 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-02-07 23:11:41,552 INFO L93 Difference]: Finished difference Result 4369 states and 6553 transitions. [2025-02-07 23:11:41,553 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2025-02-07 23:11:41,554 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 4 states have (on average 56.5) internal successors, (226), 4 states have internal predecessors, (226), 0 states have call successors, (0), 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 226 [2025-02-07 23:11:41,554 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-02-07 23:11:41,567 INFO L225 Difference]: With dead ends: 4369 [2025-02-07 23:11:41,568 INFO L226 Difference]: Without dead ends: 4367 [2025-02-07 23:11:41,571 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 4 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 2 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2025-02-07 23:11:41,573 INFO L435 NwaCegarLoop]: 5458 mSDtfsCounter, 0 mSDsluCounter, 10911 mSDsCounter, 0 mSdLazyCounter, 3274 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 1.3s Time, 0 mProtectedPredicate, 0 mProtectedAction, 0 SdHoareTripleChecker+Valid, 16369 SdHoareTripleChecker+Invalid, 3274 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 3274 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 1.6s IncrementalHoareTripleChecker+Time [2025-02-07 23:11:41,573 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [0 Valid, 16369 Invalid, 3274 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 3274 Invalid, 0 Unknown, 0 Unchecked, 1.6s Time] [2025-02-07 23:11:41,580 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 4367 states. [2025-02-07 23:11:41,632 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 4367 to 4367. [2025-02-07 23:11:41,639 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 4367 states, 4366 states have (on average 1.5004580852038478) internal successors, (6551), 4366 states have internal predecessors, (6551), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-02-07 23:11:41,649 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4367 states to 4367 states and 6551 transitions. [2025-02-07 23:11:41,649 INFO L78 Accepts]: Start accepts. Automaton has 4367 states and 6551 transitions. Word has length 226 [2025-02-07 23:11:41,650 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-02-07 23:11:41,650 INFO L471 AbstractCegarLoop]: Abstraction has 4367 states and 6551 transitions. [2025-02-07 23:11:41,651 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 56.5) internal successors, (226), 4 states have internal predecessors, (226), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-02-07 23:11:41,651 INFO L276 IsEmpty]: Start isEmpty. Operand 4367 states and 6551 transitions. [2025-02-07 23:11:41,652 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 228 [2025-02-07 23:11:41,653 INFO L210 NwaCegarLoop]: Found error trace [2025-02-07 23:11:41,653 INFO L218 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-02-07 23:11:41,653 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable1 [2025-02-07 23:11:41,654 INFO L396 AbstractCegarLoop]: === Iteration 3 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-02-07 23:11:41,654 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-02-07 23:11:41,654 INFO L85 PathProgramCache]: Analyzing trace with hash -1070653308, now seen corresponding path program 1 times [2025-02-07 23:11:41,656 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-02-07 23:11:41,657 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1847037419] [2025-02-07 23:11:41,657 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-02-07 23:11:41,657 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-02-07 23:11:41,704 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 227 statements into 1 equivalence classes. [2025-02-07 23:11:41,736 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 227 of 227 statements. [2025-02-07 23:11:41,736 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-02-07 23:11:41,737 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-02-07 23:11:41,974 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-02-07 23:11:41,976 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-02-07 23:11:41,976 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1847037419] [2025-02-07 23:11:41,976 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1847037419] provided 1 perfect and 0 imperfect interpolant sequences [2025-02-07 23:11:41,976 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-02-07 23:11:41,976 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2025-02-07 23:11:41,976 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [989598285] [2025-02-07 23:11:41,976 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-02-07 23:11:41,977 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2025-02-07 23:11:41,977 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-02-07 23:11:41,977 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2025-02-07 23:11:41,977 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2025-02-07 23:11:41,977 INFO L87 Difference]: Start difference. First operand 4367 states and 6551 transitions. Second operand has 4 states, 4 states have (on average 56.75) internal successors, (227), 4 states have internal predecessors, (227), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-02-07 23:11:43,693 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-02-07 23:11:43,693 INFO L93 Difference]: Finished difference Result 8503 states and 12756 transitions. [2025-02-07 23:11:43,695 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2025-02-07 23:11:43,695 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 4 states have (on average 56.75) internal successors, (227), 4 states have internal predecessors, (227), 0 states have call successors, (0), 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 227 [2025-02-07 23:11:43,696 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-02-07 23:11:43,707 INFO L225 Difference]: With dead ends: 8503 [2025-02-07 23:11:43,708 INFO L226 Difference]: Without dead ends: 4369 [2025-02-07 23:11:43,712 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 5 GetRequests, 3 SyntacticMatches, 0 SemanticMatches, 2 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2025-02-07 23:11:43,714 INFO L435 NwaCegarLoop]: 5458 mSDtfsCounter, 0 mSDsluCounter, 10908 mSDsCounter, 0 mSdLazyCounter, 3277 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 1.3s Time, 0 mProtectedPredicate, 0 mProtectedAction, 0 SdHoareTripleChecker+Valid, 16366 SdHoareTripleChecker+Invalid, 3277 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 3277 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 1.6s IncrementalHoareTripleChecker+Time [2025-02-07 23:11:43,715 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [0 Valid, 16366 Invalid, 3277 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 3277 Invalid, 0 Unknown, 0 Unchecked, 1.6s Time] [2025-02-07 23:11:43,721 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 4369 states. [2025-02-07 23:11:43,769 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 4369 to 4369. [2025-02-07 23:11:43,775 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 4369 states, 4368 states have (on average 1.5002289377289377) internal successors, (6553), 4368 states have internal predecessors, (6553), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-02-07 23:11:43,781 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4369 states to 4369 states and 6553 transitions. [2025-02-07 23:11:43,781 INFO L78 Accepts]: Start accepts. Automaton has 4369 states and 6553 transitions. Word has length 227 [2025-02-07 23:11:43,782 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-02-07 23:11:43,782 INFO L471 AbstractCegarLoop]: Abstraction has 4369 states and 6553 transitions. [2025-02-07 23:11:43,782 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 56.75) internal successors, (227), 4 states have internal predecessors, (227), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-02-07 23:11:43,782 INFO L276 IsEmpty]: Start isEmpty. Operand 4369 states and 6553 transitions. [2025-02-07 23:11:43,783 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 229 [2025-02-07 23:11:43,783 INFO L210 NwaCegarLoop]: Found error trace [2025-02-07 23:11:43,783 INFO L218 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-02-07 23:11:43,784 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable2 [2025-02-07 23:11:43,784 INFO L396 AbstractCegarLoop]: === Iteration 4 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-02-07 23:11:43,784 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-02-07 23:11:43,784 INFO L85 PathProgramCache]: Analyzing trace with hash -1193965418, now seen corresponding path program 1 times [2025-02-07 23:11:43,784 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-02-07 23:11:43,784 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1900067971] [2025-02-07 23:11:43,785 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-02-07 23:11:43,785 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-02-07 23:11:43,841 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 228 statements into 1 equivalence classes. [2025-02-07 23:11:43,865 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 228 of 228 statements. [2025-02-07 23:11:43,865 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-02-07 23:11:43,865 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-02-07 23:11:44,078 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-02-07 23:11:44,079 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-02-07 23:11:44,079 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1900067971] [2025-02-07 23:11:44,079 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1900067971] provided 1 perfect and 0 imperfect interpolant sequences [2025-02-07 23:11:44,079 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-02-07 23:11:44,079 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2025-02-07 23:11:44,079 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [177995153] [2025-02-07 23:11:44,079 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-02-07 23:11:44,079 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2025-02-07 23:11:44,079 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-02-07 23:11:44,080 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2025-02-07 23:11:44,080 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2025-02-07 23:11:44,080 INFO L87 Difference]: Start difference. First operand 4369 states and 6553 transitions. Second operand has 4 states, 4 states have (on average 57.0) internal successors, (228), 4 states have internal predecessors, (228), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-02-07 23:11:45,451 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-02-07 23:11:45,451 INFO L93 Difference]: Finished difference Result 8507 states and 12760 transitions. [2025-02-07 23:11:45,451 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2025-02-07 23:11:45,451 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 4 states have (on average 57.0) internal successors, (228), 4 states have internal predecessors, (228), 0 states have call successors, (0), 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 228 [2025-02-07 23:11:45,452 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-02-07 23:11:45,462 INFO L225 Difference]: With dead ends: 8507 [2025-02-07 23:11:45,462 INFO L226 Difference]: Without dead ends: 4371 [2025-02-07 23:11:45,467 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 5 GetRequests, 3 SyntacticMatches, 0 SemanticMatches, 2 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2025-02-07 23:11:45,467 INFO L435 NwaCegarLoop]: 5458 mSDtfsCounter, 0 mSDsluCounter, 10903 mSDsCounter, 0 mSdLazyCounter, 3282 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 1.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 0 SdHoareTripleChecker+Valid, 16361 SdHoareTripleChecker+Invalid, 3282 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 3282 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 1.3s IncrementalHoareTripleChecker+Time [2025-02-07 23:11:45,468 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [0 Valid, 16361 Invalid, 3282 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 3282 Invalid, 0 Unknown, 0 Unchecked, 1.3s Time] [2025-02-07 23:11:45,472 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 4371 states. [2025-02-07 23:11:45,512 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 4371 to 4371. [2025-02-07 23:11:45,517 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 4371 states, 4370 states have (on average 1.5) internal successors, (6555), 4370 states have internal predecessors, (6555), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-02-07 23:11:45,522 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4371 states to 4371 states and 6555 transitions. [2025-02-07 23:11:45,522 INFO L78 Accepts]: Start accepts. Automaton has 4371 states and 6555 transitions. Word has length 228 [2025-02-07 23:11:45,522 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-02-07 23:11:45,522 INFO L471 AbstractCegarLoop]: Abstraction has 4371 states and 6555 transitions. [2025-02-07 23:11:45,523 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 57.0) internal successors, (228), 4 states have internal predecessors, (228), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-02-07 23:11:45,523 INFO L276 IsEmpty]: Start isEmpty. Operand 4371 states and 6555 transitions. [2025-02-07 23:11:45,524 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 230 [2025-02-07 23:11:45,524 INFO L210 NwaCegarLoop]: Found error trace [2025-02-07 23:11:45,524 INFO L218 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-02-07 23:11:45,524 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable3 [2025-02-07 23:11:45,524 INFO L396 AbstractCegarLoop]: === Iteration 5 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-02-07 23:11:45,525 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-02-07 23:11:45,525 INFO L85 PathProgramCache]: Analyzing trace with hash -764820247, now seen corresponding path program 1 times [2025-02-07 23:11:45,525 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-02-07 23:11:45,525 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1106726104] [2025-02-07 23:11:45,525 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-02-07 23:11:45,525 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-02-07 23:11:45,567 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 229 statements into 1 equivalence classes. [2025-02-07 23:11:45,609 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 229 of 229 statements. [2025-02-07 23:11:45,609 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-02-07 23:11:45,609 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-02-07 23:11:45,932 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-02-07 23:11:45,933 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-02-07 23:11:45,933 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1106726104] [2025-02-07 23:11:45,933 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1106726104] provided 1 perfect and 0 imperfect interpolant sequences [2025-02-07 23:11:45,933 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-02-07 23:11:45,934 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2025-02-07 23:11:45,934 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [808045107] [2025-02-07 23:11:45,934 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-02-07 23:11:45,934 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2025-02-07 23:11:45,934 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-02-07 23:11:45,935 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2025-02-07 23:11:45,935 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2025-02-07 23:11:45,935 INFO L87 Difference]: Start difference. First operand 4371 states and 6555 transitions. Second operand has 5 states, 5 states have (on average 45.8) internal successors, (229), 4 states have internal predecessors, (229), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-02-07 23:11:50,459 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-02-07 23:11:50,460 INFO L93 Difference]: Finished difference Result 12633 states and 18947 transitions. [2025-02-07 23:11:50,460 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2025-02-07 23:11:50,460 INFO L78 Accepts]: Start accepts. Automaton has has 5 states, 5 states have (on average 45.8) internal successors, (229), 4 states have internal predecessors, (229), 0 states have call successors, (0), 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 229 [2025-02-07 23:11:50,461 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-02-07 23:11:50,481 INFO L225 Difference]: With dead ends: 12633 [2025-02-07 23:11:50,481 INFO L226 Difference]: Without dead ends: 8495 [2025-02-07 23:11:50,488 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 6 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 4 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=11, Invalid=19, Unknown=0, NotChecked=0, Total=30 [2025-02-07 23:11:50,490 INFO L435 NwaCegarLoop]: 4331 mSDtfsCounter, 6311 mSDsluCounter, 12868 mSDsCounter, 0 mSdLazyCounter, 8644 mSolverCounterSat, 1 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 3.6s Time, 0 mProtectedPredicate, 0 mProtectedAction, 6311 SdHoareTripleChecker+Valid, 17199 SdHoareTripleChecker+Invalid, 8645 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 1 IncrementalHoareTripleChecker+Valid, 8644 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 4.3s IncrementalHoareTripleChecker+Time [2025-02-07 23:11:50,490 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [6311 Valid, 17199 Invalid, 8645 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [1 Valid, 8644 Invalid, 0 Unknown, 0 Unchecked, 4.3s Time] [2025-02-07 23:11:50,500 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 8495 states. [2025-02-07 23:11:50,565 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 8495 to 4582. [2025-02-07 23:11:50,576 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 4582 states, 4581 states have (on average 1.4996725605762933) internal successors, (6870), 4581 states have internal predecessors, (6870), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-02-07 23:11:50,585 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4582 states to 4582 states and 6870 transitions. [2025-02-07 23:11:50,586 INFO L78 Accepts]: Start accepts. Automaton has 4582 states and 6870 transitions. Word has length 229 [2025-02-07 23:11:50,587 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-02-07 23:11:50,587 INFO L471 AbstractCegarLoop]: Abstraction has 4582 states and 6870 transitions. [2025-02-07 23:11:50,587 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 45.8) internal successors, (229), 4 states have internal predecessors, (229), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-02-07 23:11:50,587 INFO L276 IsEmpty]: Start isEmpty. Operand 4582 states and 6870 transitions. [2025-02-07 23:11:50,589 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 231 [2025-02-07 23:11:50,592 INFO L210 NwaCegarLoop]: Found error trace [2025-02-07 23:11:50,593 INFO L218 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-02-07 23:11:50,593 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable4 [2025-02-07 23:11:50,593 INFO L396 AbstractCegarLoop]: === Iteration 6 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-02-07 23:11:50,593 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-02-07 23:11:50,594 INFO L85 PathProgramCache]: Analyzing trace with hash -1991146239, now seen corresponding path program 1 times [2025-02-07 23:11:50,594 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-02-07 23:11:50,594 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1866172585] [2025-02-07 23:11:50,594 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-02-07 23:11:50,594 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-02-07 23:11:50,648 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 230 statements into 1 equivalence classes. [2025-02-07 23:11:50,689 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 230 of 230 statements. [2025-02-07 23:11:50,690 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-02-07 23:11:50,690 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-02-07 23:11:51,283 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-02-07 23:11:51,284 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-02-07 23:11:51,284 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1866172585] [2025-02-07 23:11:51,284 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1866172585] provided 1 perfect and 0 imperfect interpolant sequences [2025-02-07 23:11:51,284 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-02-07 23:11:51,284 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2025-02-07 23:11:51,284 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1512049585] [2025-02-07 23:11:51,284 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-02-07 23:11:51,284 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 7 states [2025-02-07 23:11:51,285 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-02-07 23:11:51,287 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2025-02-07 23:11:51,287 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=12, Invalid=30, Unknown=0, NotChecked=0, Total=42 [2025-02-07 23:11:51,288 INFO L87 Difference]: Start difference. First operand 4582 states and 6870 transitions. Second operand has 7 states, 7 states have (on average 32.857142857142854) internal successors, (230), 6 states have internal predecessors, (230), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-02-07 23:11:53,715 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-02-07 23:11:53,715 INFO L93 Difference]: Finished difference Result 8731 states and 13090 transitions. [2025-02-07 23:11:53,715 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2025-02-07 23:11:53,715 INFO L78 Accepts]: Start accepts. Automaton has has 7 states, 7 states have (on average 32.857142857142854) internal successors, (230), 6 states have internal predecessors, (230), 0 states have call successors, (0), 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 230 [2025-02-07 23:11:53,716 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-02-07 23:11:53,725 INFO L225 Difference]: With dead ends: 8731 [2025-02-07 23:11:53,725 INFO L226 Difference]: Without dead ends: 4593 [2025-02-07 23:11:53,729 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 8 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 7 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 4 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=20, Invalid=52, Unknown=0, NotChecked=0, Total=72 [2025-02-07 23:11:53,729 INFO L435 NwaCegarLoop]: 5455 mSDtfsCounter, 6341 mSDsluCounter, 21797 mSDsCounter, 0 mSdLazyCounter, 5487 mSolverCounterSat, 1 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 1.9s Time, 0 mProtectedPredicate, 0 mProtectedAction, 6341 SdHoareTripleChecker+Valid, 27252 SdHoareTripleChecker+Invalid, 5488 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 1 IncrementalHoareTripleChecker+Valid, 5487 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 2.3s IncrementalHoareTripleChecker+Time [2025-02-07 23:11:53,729 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [6341 Valid, 27252 Invalid, 5488 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [1 Valid, 5487 Invalid, 0 Unknown, 0 Unchecked, 2.3s Time] [2025-02-07 23:11:53,734 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 4593 states. [2025-02-07 23:11:53,770 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 4593 to 4589. [2025-02-07 23:11:53,775 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 4589 states, 4588 states have (on average 1.4993461203138623) internal successors, (6879), 4588 states have internal predecessors, (6879), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-02-07 23:11:53,779 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4589 states to 4589 states and 6879 transitions. [2025-02-07 23:11:53,779 INFO L78 Accepts]: Start accepts. Automaton has 4589 states and 6879 transitions. Word has length 230 [2025-02-07 23:11:53,780 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-02-07 23:11:53,780 INFO L471 AbstractCegarLoop]: Abstraction has 4589 states and 6879 transitions. [2025-02-07 23:11:53,780 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 7 states, 7 states have (on average 32.857142857142854) internal successors, (230), 6 states have internal predecessors, (230), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-02-07 23:11:53,780 INFO L276 IsEmpty]: Start isEmpty. Operand 4589 states and 6879 transitions. [2025-02-07 23:11:53,781 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 232 [2025-02-07 23:11:53,782 INFO L210 NwaCegarLoop]: Found error trace [2025-02-07 23:11:53,782 INFO L218 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-02-07 23:11:53,782 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable5 [2025-02-07 23:11:53,782 INFO L396 AbstractCegarLoop]: === Iteration 7 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-02-07 23:11:53,782 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-02-07 23:11:53,782 INFO L85 PathProgramCache]: Analyzing trace with hash -90308551, now seen corresponding path program 1 times [2025-02-07 23:11:53,782 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-02-07 23:11:53,783 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1868761787] [2025-02-07 23:11:53,783 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-02-07 23:11:53,783 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-02-07 23:11:53,825 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 231 statements into 1 equivalence classes. [2025-02-07 23:11:53,845 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 231 of 231 statements. [2025-02-07 23:11:53,845 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-02-07 23:11:53,845 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-02-07 23:11:54,553 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-02-07 23:11:54,553 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-02-07 23:11:54,553 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1868761787] [2025-02-07 23:11:54,554 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1868761787] provided 1 perfect and 0 imperfect interpolant sequences [2025-02-07 23:11:54,554 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-02-07 23:11:54,554 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2025-02-07 23:11:54,554 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1437665856] [2025-02-07 23:11:54,554 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-02-07 23:11:54,554 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 8 states [2025-02-07 23:11:54,554 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-02-07 23:11:54,555 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2025-02-07 23:11:54,555 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=16, Invalid=40, Unknown=0, NotChecked=0, Total=56 [2025-02-07 23:11:54,555 INFO L87 Difference]: Start difference. First operand 4589 states and 6879 transitions. Second operand has 8 states, 8 states have (on average 28.875) internal successors, (231), 7 states have internal predecessors, (231), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-02-07 23:11:58,557 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-02-07 23:11:58,557 INFO L93 Difference]: Finished difference Result 8768 states and 13148 transitions. [2025-02-07 23:11:58,558 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2025-02-07 23:11:58,558 INFO L78 Accepts]: Start accepts. Automaton has has 8 states, 8 states have (on average 28.875) internal successors, (231), 7 states have internal predecessors, (231), 0 states have call successors, (0), 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 231 [2025-02-07 23:11:58,559 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-02-07 23:11:58,567 INFO L225 Difference]: With dead ends: 8768 [2025-02-07 23:11:58,568 INFO L226 Difference]: Without dead ends: 4623 [2025-02-07 23:11:58,570 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 13 GetRequests, 4 SyntacticMatches, 0 SemanticMatches, 9 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 9 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=30, Invalid=80, Unknown=0, NotChecked=0, Total=110 [2025-02-07 23:11:58,571 INFO L435 NwaCegarLoop]: 5434 mSDtfsCounter, 6364 mSDsluCounter, 27003 mSDsCounter, 0 mSdLazyCounter, 6876 mSolverCounterSat, 1 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 3.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 6364 SdHoareTripleChecker+Valid, 32437 SdHoareTripleChecker+Invalid, 6877 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.1s SdHoareTripleChecker+Time, 1 IncrementalHoareTripleChecker+Valid, 6876 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 3.8s IncrementalHoareTripleChecker+Time [2025-02-07 23:11:58,571 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [6364 Valid, 32437 Invalid, 6877 Unknown, 0 Unchecked, 0.1s Time], IncrementalHoareTripleChecker [1 Valid, 6876 Invalid, 0 Unknown, 0 Unchecked, 3.8s Time] [2025-02-07 23:11:58,579 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 4623 states. [2025-02-07 23:11:58,655 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 4623 to 4601. [2025-02-07 23:11:58,671 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 4601 states, 4600 states have (on average 1.4993478260869566) internal successors, (6897), 4600 states have internal predecessors, (6897), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-02-07 23:11:58,676 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4601 states to 4601 states and 6897 transitions. [2025-02-07 23:11:58,677 INFO L78 Accepts]: Start accepts. Automaton has 4601 states and 6897 transitions. Word has length 231 [2025-02-07 23:11:58,677 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-02-07 23:11:58,677 INFO L471 AbstractCegarLoop]: Abstraction has 4601 states and 6897 transitions. [2025-02-07 23:11:58,677 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 8 states, 8 states have (on average 28.875) internal successors, (231), 7 states have internal predecessors, (231), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-02-07 23:11:58,677 INFO L276 IsEmpty]: Start isEmpty. Operand 4601 states and 6897 transitions. [2025-02-07 23:11:58,679 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 233 [2025-02-07 23:11:58,679 INFO L210 NwaCegarLoop]: Found error trace [2025-02-07 23:11:58,679 INFO L218 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-02-07 23:11:58,679 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable6 [2025-02-07 23:11:58,679 INFO L396 AbstractCegarLoop]: === Iteration 8 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-02-07 23:11:58,680 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-02-07 23:11:58,680 INFO L85 PathProgramCache]: Analyzing trace with hash -139253918, now seen corresponding path program 1 times [2025-02-07 23:11:58,680 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-02-07 23:11:58,680 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2053732448] [2025-02-07 23:11:58,680 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-02-07 23:11:58,680 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-02-07 23:11:58,762 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 232 statements into 1 equivalence classes. [2025-02-07 23:11:58,832 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 232 of 232 statements. [2025-02-07 23:11:58,832 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-02-07 23:11:58,832 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-02-07 23:11:59,353 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-02-07 23:11:59,354 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-02-07 23:11:59,354 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2053732448] [2025-02-07 23:11:59,354 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [2053732448] provided 1 perfect and 0 imperfect interpolant sequences [2025-02-07 23:11:59,354 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-02-07 23:11:59,354 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2025-02-07 23:11:59,354 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1613299115] [2025-02-07 23:11:59,354 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-02-07 23:11:59,354 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 7 states [2025-02-07 23:11:59,354 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-02-07 23:11:59,355 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2025-02-07 23:11:59,355 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=11, Invalid=31, Unknown=0, NotChecked=0, Total=42 [2025-02-07 23:11:59,355 INFO L87 Difference]: Start difference. First operand 4601 states and 6897 transitions. Second operand has 7 states, 7 states have (on average 33.142857142857146) internal successors, (232), 6 states have internal predecessors, (232), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-02-07 23:12:01,874 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-02-07 23:12:01,874 INFO L93 Difference]: Finished difference Result 8760 states and 13132 transitions. [2025-02-07 23:12:01,874 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2025-02-07 23:12:01,874 INFO L78 Accepts]: Start accepts. Automaton has has 7 states, 7 states have (on average 33.142857142857146) internal successors, (232), 6 states have internal predecessors, (232), 0 states have call successors, (0), 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 232 [2025-02-07 23:12:01,874 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-02-07 23:12:01,880 INFO L225 Difference]: With dead ends: 8760 [2025-02-07 23:12:01,880 INFO L226 Difference]: Without dead ends: 4612 [2025-02-07 23:12:01,882 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 9 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 8 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 3 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=23, Invalid=67, Unknown=0, NotChecked=0, Total=90 [2025-02-07 23:12:01,883 INFO L435 NwaCegarLoop]: 5417 mSDtfsCounter, 6332 mSDsluCounter, 21630 mSDsCounter, 0 mSdLazyCounter, 5725 mSolverCounterSat, 1 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 2.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 6332 SdHoareTripleChecker+Valid, 27047 SdHoareTripleChecker+Invalid, 5726 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 1 IncrementalHoareTripleChecker+Valid, 5725 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 2.3s IncrementalHoareTripleChecker+Time [2025-02-07 23:12:01,883 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [6332 Valid, 27047 Invalid, 5726 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [1 Valid, 5725 Invalid, 0 Unknown, 0 Unchecked, 2.3s Time] [2025-02-07 23:12:01,887 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 4612 states. [2025-02-07 23:12:01,920 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 4612 to 4601. [2025-02-07 23:12:01,926 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 4601 states, 4600 states have (on average 1.4993478260869566) internal successors, (6897), 4600 states have internal predecessors, (6897), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-02-07 23:12:01,930 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4601 states to 4601 states and 6897 transitions. [2025-02-07 23:12:01,931 INFO L78 Accepts]: Start accepts. Automaton has 4601 states and 6897 transitions. Word has length 232 [2025-02-07 23:12:01,931 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-02-07 23:12:01,931 INFO L471 AbstractCegarLoop]: Abstraction has 4601 states and 6897 transitions. [2025-02-07 23:12:01,931 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 7 states, 7 states have (on average 33.142857142857146) internal successors, (232), 6 states have internal predecessors, (232), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-02-07 23:12:01,931 INFO L276 IsEmpty]: Start isEmpty. Operand 4601 states and 6897 transitions. [2025-02-07 23:12:01,933 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 233 [2025-02-07 23:12:01,933 INFO L210 NwaCegarLoop]: Found error trace [2025-02-07 23:12:01,933 INFO L218 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-02-07 23:12:01,933 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable7 [2025-02-07 23:12:01,934 INFO L396 AbstractCegarLoop]: === Iteration 9 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-02-07 23:12:01,934 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-02-07 23:12:01,934 INFO L85 PathProgramCache]: Analyzing trace with hash -406353527, now seen corresponding path program 1 times [2025-02-07 23:12:01,934 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-02-07 23:12:01,934 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [78516368] [2025-02-07 23:12:01,935 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-02-07 23:12:01,935 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-02-07 23:12:01,981 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 232 statements into 1 equivalence classes. [2025-02-07 23:12:02,009 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 232 of 232 statements. [2025-02-07 23:12:02,009 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-02-07 23:12:02,009 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-02-07 23:12:02,496 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-02-07 23:12:02,496 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-02-07 23:12:02,496 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [78516368] [2025-02-07 23:12:02,496 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [78516368] provided 1 perfect and 0 imperfect interpolant sequences [2025-02-07 23:12:02,496 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-02-07 23:12:02,496 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2025-02-07 23:12:02,496 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [864357569] [2025-02-07 23:12:02,496 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-02-07 23:12:02,496 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 8 states [2025-02-07 23:12:02,496 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-02-07 23:12:02,497 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2025-02-07 23:12:02,497 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=16, Invalid=40, Unknown=0, NotChecked=0, Total=56 [2025-02-07 23:12:02,497 INFO L87 Difference]: Start difference. First operand 4601 states and 6897 transitions. Second operand has 8 states, 8 states have (on average 29.0) internal successors, (232), 7 states have internal predecessors, (232), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-02-07 23:12:05,333 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-02-07 23:12:05,333 INFO L93 Difference]: Finished difference Result 8771 states and 13149 transitions. [2025-02-07 23:12:05,333 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2025-02-07 23:12:05,333 INFO L78 Accepts]: Start accepts. Automaton has has 8 states, 8 states have (on average 29.0) internal successors, (232), 7 states have internal predecessors, (232), 0 states have call successors, (0), 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 232 [2025-02-07 23:12:05,334 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-02-07 23:12:05,346 INFO L225 Difference]: With dead ends: 8771 [2025-02-07 23:12:05,346 INFO L226 Difference]: Without dead ends: 4609 [2025-02-07 23:12:05,353 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 11 GetRequests, 3 SyntacticMatches, 0 SemanticMatches, 8 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 7 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=25, Invalid=65, Unknown=0, NotChecked=0, Total=90 [2025-02-07 23:12:05,354 INFO L435 NwaCegarLoop]: 5439 mSDtfsCounter, 6357 mSDsluCounter, 21706 mSDsCounter, 0 mSdLazyCounter, 5594 mSolverCounterSat, 2 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 2.3s Time, 0 mProtectedPredicate, 0 mProtectedAction, 6357 SdHoareTripleChecker+Valid, 27145 SdHoareTripleChecker+Invalid, 5596 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 2 IncrementalHoareTripleChecker+Valid, 5594 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 2.7s IncrementalHoareTripleChecker+Time [2025-02-07 23:12:05,354 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [6357 Valid, 27145 Invalid, 5596 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [2 Valid, 5594 Invalid, 0 Unknown, 0 Unchecked, 2.7s Time] [2025-02-07 23:12:05,363 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 4609 states. [2025-02-07 23:12:05,425 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 4609 to 4605. [2025-02-07 23:12:05,432 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 4605 states, 4604 states have (on average 1.4989139878366637) internal successors, (6901), 4604 states have internal predecessors, (6901), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-02-07 23:12:05,441 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4605 states to 4605 states and 6901 transitions. [2025-02-07 23:12:05,441 INFO L78 Accepts]: Start accepts. Automaton has 4605 states and 6901 transitions. Word has length 232 [2025-02-07 23:12:05,442 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-02-07 23:12:05,442 INFO L471 AbstractCegarLoop]: Abstraction has 4605 states and 6901 transitions. [2025-02-07 23:12:05,442 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 8 states, 8 states have (on average 29.0) internal successors, (232), 7 states have internal predecessors, (232), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-02-07 23:12:05,442 INFO L276 IsEmpty]: Start isEmpty. Operand 4605 states and 6901 transitions. [2025-02-07 23:12:05,444 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 234 [2025-02-07 23:12:05,445 INFO L210 NwaCegarLoop]: Found error trace [2025-02-07 23:12:05,445 INFO L218 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-02-07 23:12:05,445 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable8 [2025-02-07 23:12:05,445 INFO L396 AbstractCegarLoop]: === Iteration 10 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-02-07 23:12:05,446 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-02-07 23:12:05,446 INFO L85 PathProgramCache]: Analyzing trace with hash -1923659904, now seen corresponding path program 1 times [2025-02-07 23:12:05,446 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-02-07 23:12:05,446 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1111746409] [2025-02-07 23:12:05,446 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-02-07 23:12:05,446 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-02-07 23:12:05,515 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 233 statements into 1 equivalence classes. [2025-02-07 23:12:05,559 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 233 of 233 statements. [2025-02-07 23:12:05,560 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-02-07 23:12:05,560 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-02-07 23:12:05,929 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-02-07 23:12:05,930 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-02-07 23:12:05,930 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1111746409] [2025-02-07 23:12:05,930 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1111746409] provided 1 perfect and 0 imperfect interpolant sequences [2025-02-07 23:12:05,930 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-02-07 23:12:05,930 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2025-02-07 23:12:05,930 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [799849104] [2025-02-07 23:12:05,931 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-02-07 23:12:05,931 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2025-02-07 23:12:05,931 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-02-07 23:12:05,931 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2025-02-07 23:12:05,931 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=6, Invalid=6, Unknown=0, NotChecked=0, Total=12 [2025-02-07 23:12:05,932 INFO L87 Difference]: Start difference. First operand 4605 states and 6901 transitions. Second operand has 4 states, 4 states have (on average 58.25) internal successors, (233), 3 states have internal predecessors, (233), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-02-07 23:12:07,297 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-02-07 23:12:07,297 INFO L93 Difference]: Finished difference Result 8774 states and 13151 transitions. [2025-02-07 23:12:07,297 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2025-02-07 23:12:07,298 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 4 states have (on average 58.25) internal successors, (233), 3 states have internal predecessors, (233), 0 states have call successors, (0), 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 233 [2025-02-07 23:12:07,298 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-02-07 23:12:07,304 INFO L225 Difference]: With dead ends: 8774 [2025-02-07 23:12:07,304 INFO L226 Difference]: Without dead ends: 4607 [2025-02-07 23:12:07,309 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 4 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 2 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=6, Invalid=6, Unknown=0, NotChecked=0, Total=12 [2025-02-07 23:12:07,309 INFO L435 NwaCegarLoop]: 5441 mSDtfsCounter, 6344 mSDsluCounter, 5429 mSDsCounter, 0 mSdLazyCounter, 2219 mSolverCounterSat, 3 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 1.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 6344 SdHoareTripleChecker+Valid, 10870 SdHoareTripleChecker+Invalid, 2222 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 3 IncrementalHoareTripleChecker+Valid, 2219 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 1.3s IncrementalHoareTripleChecker+Time [2025-02-07 23:12:07,310 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [6344 Valid, 10870 Invalid, 2222 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [3 Valid, 2219 Invalid, 0 Unknown, 0 Unchecked, 1.3s Time] [2025-02-07 23:12:07,314 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 4607 states. [2025-02-07 23:12:07,352 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 4607 to 4605. [2025-02-07 23:12:07,358 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 4605 states, 4604 states have (on average 1.4984795829713293) internal successors, (6899), 4604 states have internal predecessors, (6899), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-02-07 23:12:07,362 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4605 states to 4605 states and 6899 transitions. [2025-02-07 23:12:07,363 INFO L78 Accepts]: Start accepts. Automaton has 4605 states and 6899 transitions. Word has length 233 [2025-02-07 23:12:07,364 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-02-07 23:12:07,364 INFO L471 AbstractCegarLoop]: Abstraction has 4605 states and 6899 transitions. [2025-02-07 23:12:07,364 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 58.25) internal successors, (233), 3 states have internal predecessors, (233), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-02-07 23:12:07,365 INFO L276 IsEmpty]: Start isEmpty. Operand 4605 states and 6899 transitions. [2025-02-07 23:12:07,366 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 234 [2025-02-07 23:12:07,366 INFO L210 NwaCegarLoop]: Found error trace [2025-02-07 23:12:07,367 INFO L218 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-02-07 23:12:07,367 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable9 [2025-02-07 23:12:07,367 INFO L396 AbstractCegarLoop]: === Iteration 11 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-02-07 23:12:07,367 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-02-07 23:12:07,367 INFO L85 PathProgramCache]: Analyzing trace with hash -856095371, now seen corresponding path program 1 times [2025-02-07 23:12:07,368 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-02-07 23:12:07,368 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1731732245] [2025-02-07 23:12:07,368 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-02-07 23:12:07,368 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-02-07 23:12:07,411 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 233 statements into 1 equivalence classes. [2025-02-07 23:12:07,426 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 233 of 233 statements. [2025-02-07 23:12:07,427 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-02-07 23:12:07,427 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-02-07 23:12:07,800 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-02-07 23:12:07,801 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-02-07 23:12:07,801 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1731732245] [2025-02-07 23:12:07,801 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1731732245] provided 1 perfect and 0 imperfect interpolant sequences [2025-02-07 23:12:07,801 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-02-07 23:12:07,801 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2025-02-07 23:12:07,801 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [801131116] [2025-02-07 23:12:07,801 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-02-07 23:12:07,801 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2025-02-07 23:12:07,801 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-02-07 23:12:07,802 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2025-02-07 23:12:07,802 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=10, Invalid=20, Unknown=0, NotChecked=0, Total=30 [2025-02-07 23:12:07,802 INFO L87 Difference]: Start difference. First operand 4605 states and 6899 transitions. Second operand has 6 states, 6 states have (on average 38.833333333333336) internal successors, (233), 6 states have internal predecessors, (233), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-02-07 23:12:09,808 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-02-07 23:12:09,809 INFO L93 Difference]: Finished difference Result 8787 states and 13164 transitions. [2025-02-07 23:12:09,809 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2025-02-07 23:12:09,809 INFO L78 Accepts]: Start accepts. Automaton has has 6 states, 6 states have (on average 38.833333333333336) internal successors, (233), 6 states have internal predecessors, (233), 0 states have call successors, (0), 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 233 [2025-02-07 23:12:09,810 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-02-07 23:12:09,814 INFO L225 Difference]: With dead ends: 8787 [2025-02-07 23:12:09,814 INFO L226 Difference]: Without dead ends: 4615 [2025-02-07 23:12:09,818 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 7 GetRequests, 3 SyntacticMatches, 0 SemanticMatches, 4 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=10, Invalid=20, Unknown=0, NotChecked=0, Total=30 [2025-02-07 23:12:09,819 INFO L435 NwaCegarLoop]: 5456 mSDtfsCounter, 0 mSDsluCounter, 21775 mSDsCounter, 0 mSdLazyCounter, 5508 mSolverCounterSat, 2 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 1.6s Time, 0 mProtectedPredicate, 0 mProtectedAction, 0 SdHoareTripleChecker+Valid, 27231 SdHoareTripleChecker+Invalid, 5510 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 2 IncrementalHoareTripleChecker+Valid, 5508 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 1.9s IncrementalHoareTripleChecker+Time [2025-02-07 23:12:09,819 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [0 Valid, 27231 Invalid, 5510 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [2 Valid, 5508 Invalid, 0 Unknown, 0 Unchecked, 1.9s Time] [2025-02-07 23:12:09,823 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 4615 states. [2025-02-07 23:12:09,854 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 4615 to 4615. [2025-02-07 23:12:09,859 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 4615 states, 4614 states have (on average 1.4973992197659298) internal successors, (6909), 4614 states have internal predecessors, (6909), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-02-07 23:12:09,863 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4615 states to 4615 states and 6909 transitions. [2025-02-07 23:12:09,863 INFO L78 Accepts]: Start accepts. Automaton has 4615 states and 6909 transitions. Word has length 233 [2025-02-07 23:12:09,864 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-02-07 23:12:09,864 INFO L471 AbstractCegarLoop]: Abstraction has 4615 states and 6909 transitions. [2025-02-07 23:12:09,864 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 6 states have (on average 38.833333333333336) internal successors, (233), 6 states have internal predecessors, (233), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-02-07 23:12:09,864 INFO L276 IsEmpty]: Start isEmpty. Operand 4615 states and 6909 transitions. [2025-02-07 23:12:09,865 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 235 [2025-02-07 23:12:09,865 INFO L210 NwaCegarLoop]: Found error trace [2025-02-07 23:12:09,865 INFO L218 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-02-07 23:12:09,865 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable10 [2025-02-07 23:12:09,866 INFO L396 AbstractCegarLoop]: === Iteration 12 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-02-07 23:12:09,866 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-02-07 23:12:09,866 INFO L85 PathProgramCache]: Analyzing trace with hash 1407579747, now seen corresponding path program 1 times [2025-02-07 23:12:09,866 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-02-07 23:12:09,866 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [278577493] [2025-02-07 23:12:09,866 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-02-07 23:12:09,867 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-02-07 23:12:09,906 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 234 statements into 1 equivalence classes. [2025-02-07 23:12:09,916 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 234 of 234 statements. [2025-02-07 23:12:09,916 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-02-07 23:12:09,916 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-02-07 23:12:09,986 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-02-07 23:12:09,986 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-02-07 23:12:09,986 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [278577493] [2025-02-07 23:12:09,986 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [278577493] provided 1 perfect and 0 imperfect interpolant sequences [2025-02-07 23:12:09,987 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-02-07 23:12:09,987 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2025-02-07 23:12:09,987 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [394005812] [2025-02-07 23:12:09,987 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-02-07 23:12:09,987 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2025-02-07 23:12:09,987 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-02-07 23:12:09,988 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2025-02-07 23:12:09,988 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=6, Invalid=6, Unknown=0, NotChecked=0, Total=12 [2025-02-07 23:12:09,988 INFO L87 Difference]: Start difference. First operand 4615 states and 6909 transitions. Second operand has 4 states, 4 states have (on average 58.5) internal successors, (234), 4 states have internal predecessors, (234), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-02-07 23:12:12,175 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-02-07 23:12:12,175 INFO L93 Difference]: Finished difference Result 12954 states and 19397 transitions. [2025-02-07 23:12:12,175 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2025-02-07 23:12:12,175 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 4 states have (on average 58.5) internal successors, (234), 4 states have internal predecessors, (234), 0 states have call successors, (0), 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 234 [2025-02-07 23:12:12,176 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-02-07 23:12:12,181 INFO L225 Difference]: With dead ends: 12954 [2025-02-07 23:12:12,181 INFO L226 Difference]: Without dead ends: 8774 [2025-02-07 23:12:12,184 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 4 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 2 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=6, Invalid=6, Unknown=0, NotChecked=0, Total=12 [2025-02-07 23:12:12,184 INFO L435 NwaCegarLoop]: 10599 mSDtfsCounter, 6166 mSDsluCounter, 10873 mSDsCounter, 0 mSdLazyCounter, 4338 mSolverCounterSat, 3 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 1.7s Time, 0 mProtectedPredicate, 0 mProtectedAction, 6166 SdHoareTripleChecker+Valid, 21472 SdHoareTripleChecker+Invalid, 4341 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 3 IncrementalHoareTripleChecker+Valid, 4338 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 2.1s IncrementalHoareTripleChecker+Time [2025-02-07 23:12:12,185 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [6166 Valid, 21472 Invalid, 4341 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [3 Valid, 4338 Invalid, 0 Unknown, 0 Unchecked, 2.1s Time] [2025-02-07 23:12:12,191 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 8774 states. [2025-02-07 23:12:12,268 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 8774 to 8767. [2025-02-07 23:12:12,279 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 8767 states, 8766 states have (on average 1.497262149212868) internal successors, (13125), 8766 states have internal predecessors, (13125), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-02-07 23:12:12,287 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 8767 states to 8767 states and 13125 transitions. [2025-02-07 23:12:12,288 INFO L78 Accepts]: Start accepts. Automaton has 8767 states and 13125 transitions. Word has length 234 [2025-02-07 23:12:12,289 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-02-07 23:12:12,289 INFO L471 AbstractCegarLoop]: Abstraction has 8767 states and 13125 transitions. [2025-02-07 23:12:12,289 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 58.5) internal successors, (234), 4 states have internal predecessors, (234), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-02-07 23:12:12,289 INFO L276 IsEmpty]: Start isEmpty. Operand 8767 states and 13125 transitions. [2025-02-07 23:12:12,290 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 235 [2025-02-07 23:12:12,290 INFO L210 NwaCegarLoop]: Found error trace [2025-02-07 23:12:12,290 INFO L218 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-02-07 23:12:12,290 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable11 [2025-02-07 23:12:12,290 INFO L396 AbstractCegarLoop]: === Iteration 13 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-02-07 23:12:12,291 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-02-07 23:12:12,291 INFO L85 PathProgramCache]: Analyzing trace with hash 1994997694, now seen corresponding path program 1 times [2025-02-07 23:12:12,291 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-02-07 23:12:12,291 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1664834458] [2025-02-07 23:12:12,291 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-02-07 23:12:12,291 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-02-07 23:12:12,336 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 234 statements into 1 equivalence classes. [2025-02-07 23:12:12,350 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 234 of 234 statements. [2025-02-07 23:12:12,350 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-02-07 23:12:12,350 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-02-07 23:12:12,602 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-02-07 23:12:12,602 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-02-07 23:12:12,602 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1664834458] [2025-02-07 23:12:12,602 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1664834458] provided 1 perfect and 0 imperfect interpolant sequences [2025-02-07 23:12:12,602 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-02-07 23:12:12,602 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2025-02-07 23:12:12,602 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [69972516] [2025-02-07 23:12:12,602 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-02-07 23:12:12,603 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2025-02-07 23:12:12,603 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-02-07 23:12:12,603 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2025-02-07 23:12:12,603 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=10, Invalid=10, Unknown=0, NotChecked=0, Total=20 [2025-02-07 23:12:12,603 INFO L87 Difference]: Start difference. First operand 8767 states and 13125 transitions. Second operand has 5 states, 5 states have (on average 46.8) internal successors, (234), 4 states have internal predecessors, (234), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-02-07 23:12:14,020 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-02-07 23:12:14,020 INFO L93 Difference]: Finished difference Result 17084 states and 25583 transitions. [2025-02-07 23:12:14,021 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2025-02-07 23:12:14,021 INFO L78 Accepts]: Start accepts. Automaton has has 5 states, 5 states have (on average 46.8) internal successors, (234), 4 states have internal predecessors, (234), 0 states have call successors, (0), 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 234 [2025-02-07 23:12:14,021 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-02-07 23:12:14,028 INFO L225 Difference]: With dead ends: 17084 [2025-02-07 23:12:14,028 INFO L226 Difference]: Without dead ends: 8763 [2025-02-07 23:12:14,036 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 5 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 2 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=10, Invalid=10, Unknown=0, NotChecked=0, Total=20 [2025-02-07 23:12:14,036 INFO L435 NwaCegarLoop]: 5414 mSDtfsCounter, 6343 mSDsluCounter, 5401 mSDsCounter, 0 mSdLazyCounter, 2263 mSolverCounterSat, 6 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 1.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 6343 SdHoareTripleChecker+Valid, 10815 SdHoareTripleChecker+Invalid, 2269 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 6 IncrementalHoareTripleChecker+Valid, 2263 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 1.3s IncrementalHoareTripleChecker+Time [2025-02-07 23:12:14,037 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [6343 Valid, 10815 Invalid, 2269 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [6 Valid, 2263 Invalid, 0 Unknown, 0 Unchecked, 1.3s Time] [2025-02-07 23:12:14,042 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 8763 states. [2025-02-07 23:12:14,123 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 8763 to 8763. [2025-02-07 23:12:14,133 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 8763 states, 8762 states have (on average 1.4965761241725632) internal successors, (13113), 8762 states have internal predecessors, (13113), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-02-07 23:12:14,142 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 8763 states to 8763 states and 13113 transitions. [2025-02-07 23:12:14,142 INFO L78 Accepts]: Start accepts. Automaton has 8763 states and 13113 transitions. Word has length 234 [2025-02-07 23:12:14,143 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-02-07 23:12:14,143 INFO L471 AbstractCegarLoop]: Abstraction has 8763 states and 13113 transitions. [2025-02-07 23:12:14,143 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 46.8) internal successors, (234), 4 states have internal predecessors, (234), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-02-07 23:12:14,143 INFO L276 IsEmpty]: Start isEmpty. Operand 8763 states and 13113 transitions. [2025-02-07 23:12:14,144 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 236 [2025-02-07 23:12:14,145 INFO L210 NwaCegarLoop]: Found error trace [2025-02-07 23:12:14,145 INFO L218 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-02-07 23:12:14,145 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable12 [2025-02-07 23:12:14,145 INFO L396 AbstractCegarLoop]: === Iteration 14 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-02-07 23:12:14,146 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-02-07 23:12:14,146 INFO L85 PathProgramCache]: Analyzing trace with hash 879501757, now seen corresponding path program 1 times [2025-02-07 23:12:14,146 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-02-07 23:12:14,146 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [741417985] [2025-02-07 23:12:14,146 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-02-07 23:12:14,146 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-02-07 23:12:14,187 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 235 statements into 1 equivalence classes. [2025-02-07 23:12:14,283 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 235 of 235 statements. [2025-02-07 23:12:14,283 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-02-07 23:12:14,283 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-02-07 23:12:14,416 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-02-07 23:12:14,417 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-02-07 23:12:14,417 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [741417985] [2025-02-07 23:12:14,417 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [741417985] provided 1 perfect and 0 imperfect interpolant sequences [2025-02-07 23:12:14,417 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-02-07 23:12:14,417 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2025-02-07 23:12:14,417 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1414310204] [2025-02-07 23:12:14,417 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-02-07 23:12:14,417 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2025-02-07 23:12:14,417 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-02-07 23:12:14,418 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2025-02-07 23:12:14,418 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2025-02-07 23:12:14,418 INFO L87 Difference]: Start difference. First operand 8763 states and 13113 transitions. Second operand has 5 states, 5 states have (on average 47.0) internal successors, (235), 4 states have internal predecessors, (235), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-02-07 23:12:17,801 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-02-07 23:12:17,801 INFO L93 Difference]: Finished difference Result 40941 states and 61339 transitions. [2025-02-07 23:12:17,802 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2025-02-07 23:12:17,802 INFO L78 Accepts]: Start accepts. Automaton has has 5 states, 5 states have (on average 47.0) internal successors, (235), 4 states have internal predecessors, (235), 0 states have call successors, (0), 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 235 [2025-02-07 23:12:17,802 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-02-07 23:12:17,819 INFO L225 Difference]: With dead ends: 40941 [2025-02-07 23:12:17,819 INFO L226 Difference]: Without dead ends: 16626 [2025-02-07 23:12:17,838 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 8 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 6 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=22, Invalid=34, Unknown=0, NotChecked=0, Total=56 [2025-02-07 23:12:17,838 INFO L435 NwaCegarLoop]: 15427 mSDtfsCounter, 30115 mSDsluCounter, 11071 mSDsCounter, 0 mSdLazyCounter, 5380 mSolverCounterSat, 11 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 2.6s Time, 0 mProtectedPredicate, 0 mProtectedAction, 30115 SdHoareTripleChecker+Valid, 26498 SdHoareTripleChecker+Invalid, 5391 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 11 IncrementalHoareTripleChecker+Valid, 5380 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 3.1s IncrementalHoareTripleChecker+Time [2025-02-07 23:12:17,838 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [30115 Valid, 26498 Invalid, 5391 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [11 Valid, 5380 Invalid, 0 Unknown, 0 Unchecked, 3.1s Time] [2025-02-07 23:12:17,848 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 16626 states. [2025-02-07 23:12:17,948 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 16626 to 8763. [2025-02-07 23:12:17,954 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 8763 states, 8762 states have (on average 1.495891349007076) internal successors, (13107), 8762 states have internal predecessors, (13107), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-02-07 23:12:17,962 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 8763 states to 8763 states and 13107 transitions. [2025-02-07 23:12:17,962 INFO L78 Accepts]: Start accepts. Automaton has 8763 states and 13107 transitions. Word has length 235 [2025-02-07 23:12:17,962 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-02-07 23:12:17,962 INFO L471 AbstractCegarLoop]: Abstraction has 8763 states and 13107 transitions. [2025-02-07 23:12:17,962 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 47.0) internal successors, (235), 4 states have internal predecessors, (235), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-02-07 23:12:17,962 INFO L276 IsEmpty]: Start isEmpty. Operand 8763 states and 13107 transitions. [2025-02-07 23:12:17,999 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 236 [2025-02-07 23:12:18,000 INFO L210 NwaCegarLoop]: Found error trace [2025-02-07 23:12:18,000 INFO L218 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-02-07 23:12:18,000 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable13 [2025-02-07 23:12:18,000 INFO L396 AbstractCegarLoop]: === Iteration 15 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-02-07 23:12:18,001 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-02-07 23:12:18,001 INFO L85 PathProgramCache]: Analyzing trace with hash 66198817, now seen corresponding path program 1 times [2025-02-07 23:12:18,001 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-02-07 23:12:18,001 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1080790555] [2025-02-07 23:12:18,002 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-02-07 23:12:18,002 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-02-07 23:12:18,061 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 235 statements into 1 equivalence classes. [2025-02-07 23:12:18,079 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 235 of 235 statements. [2025-02-07 23:12:18,079 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-02-07 23:12:18,079 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-02-07 23:12:18,432 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-02-07 23:12:18,432 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-02-07 23:12:18,432 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1080790555] [2025-02-07 23:12:18,432 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1080790555] provided 1 perfect and 0 imperfect interpolant sequences [2025-02-07 23:12:18,432 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-02-07 23:12:18,432 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2025-02-07 23:12:18,434 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1908925211] [2025-02-07 23:12:18,434 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-02-07 23:12:18,434 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2025-02-07 23:12:18,435 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-02-07 23:12:18,435 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2025-02-07 23:12:18,435 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2025-02-07 23:12:18,435 INFO L87 Difference]: Start difference. First operand 8763 states and 13107 transitions. Second operand has 5 states, 5 states have (on average 47.0) internal successors, (235), 4 states have internal predecessors, (235), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-02-07 23:12:20,754 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-02-07 23:12:20,755 INFO L93 Difference]: Finished difference Result 24924 states and 37320 transitions. [2025-02-07 23:12:20,755 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2025-02-07 23:12:20,755 INFO L78 Accepts]: Start accepts. Automaton has has 5 states, 5 states have (on average 47.0) internal successors, (235), 4 states have internal predecessors, (235), 0 states have call successors, (0), 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 235 [2025-02-07 23:12:20,756 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-02-07 23:12:20,770 INFO L225 Difference]: With dead ends: 24924 [2025-02-07 23:12:20,770 INFO L226 Difference]: Without dead ends: 16626 [2025-02-07 23:12:20,779 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-07 23:12:20,779 INFO L435 NwaCegarLoop]: 5461 mSDtfsCounter, 18112 mSDsluCounter, 10887 mSDsCounter, 0 mSdLazyCounter, 3293 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 1.8s Time, 0 mProtectedPredicate, 0 mProtectedAction, 18112 SdHoareTripleChecker+Valid, 16348 SdHoareTripleChecker+Invalid, 3293 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 3293 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 2.2s IncrementalHoareTripleChecker+Time [2025-02-07 23:12:20,779 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [18112 Valid, 16348 Invalid, 3293 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 3293 Invalid, 0 Unknown, 0 Unchecked, 2.2s Time] [2025-02-07 23:12:20,789 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 16626 states. [2025-02-07 23:12:20,886 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 16626 to 8759. [2025-02-07 23:12:20,893 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 8759 states, 8758 states have (on average 1.495889472482302) internal successors, (13101), 8758 states have internal predecessors, (13101), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-02-07 23:12:20,901 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 8759 states to 8759 states and 13101 transitions. [2025-02-07 23:12:20,902 INFO L78 Accepts]: Start accepts. Automaton has 8759 states and 13101 transitions. Word has length 235 [2025-02-07 23:12:20,902 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-02-07 23:12:20,902 INFO L471 AbstractCegarLoop]: Abstraction has 8759 states and 13101 transitions. [2025-02-07 23:12:20,902 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 47.0) internal successors, (235), 4 states have internal predecessors, (235), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-02-07 23:12:20,902 INFO L276 IsEmpty]: Start isEmpty. Operand 8759 states and 13101 transitions. [2025-02-07 23:12:20,903 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 237 [2025-02-07 23:12:20,903 INFO L210 NwaCegarLoop]: Found error trace [2025-02-07 23:12:20,903 INFO L218 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-02-07 23:12:20,903 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable14 [2025-02-07 23:12:20,904 INFO L396 AbstractCegarLoop]: === Iteration 16 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-02-07 23:12:20,904 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-02-07 23:12:20,904 INFO L85 PathProgramCache]: Analyzing trace with hash -766233878, now seen corresponding path program 1 times [2025-02-07 23:12:20,904 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-02-07 23:12:20,904 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1407173393] [2025-02-07 23:12:20,904 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-02-07 23:12:20,904 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-02-07 23:12:20,941 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 236 statements into 1 equivalence classes. [2025-02-07 23:12:21,000 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 236 of 236 statements. [2025-02-07 23:12:21,000 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-02-07 23:12:21,000 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-02-07 23:12:21,101 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-02-07 23:12:21,102 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-02-07 23:12:21,102 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1407173393] [2025-02-07 23:12:21,103 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1407173393] provided 1 perfect and 0 imperfect interpolant sequences [2025-02-07 23:12:21,103 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-02-07 23:12:21,103 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2025-02-07 23:12:21,103 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1971688142] [2025-02-07 23:12:21,103 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-02-07 23:12:21,103 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2025-02-07 23:12:21,103 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-02-07 23:12:21,104 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2025-02-07 23:12:21,104 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-02-07 23:12:21,104 INFO L87 Difference]: Start difference. First operand 8759 states and 13101 transitions. Second operand has 3 states, 3 states have (on average 78.66666666666667) internal successors, (236), 3 states have internal predecessors, (236), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-02-07 23:12:22,263 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-02-07 23:12:22,263 INFO L93 Difference]: Finished difference Result 17025 states and 25481 transitions. [2025-02-07 23:12:22,264 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2025-02-07 23:12:22,264 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 78.66666666666667) internal successors, (236), 3 states have internal predecessors, (236), 0 states have call successors, (0), 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 236 [2025-02-07 23:12:22,264 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-02-07 23:12:22,269 INFO L225 Difference]: With dead ends: 17025 [2025-02-07 23:12:22,269 INFO L226 Difference]: Without dead ends: 4604 [2025-02-07 23:12:22,277 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 3 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-02-07 23:12:22,277 INFO L435 NwaCegarLoop]: 5455 mSDtfsCounter, 0 mSDsluCounter, 5450 mSDsCounter, 0 mSdLazyCounter, 2178 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.9s Time, 0 mProtectedPredicate, 0 mProtectedAction, 0 SdHoareTripleChecker+Valid, 10905 SdHoareTripleChecker+Invalid, 2178 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 2178 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 1.1s IncrementalHoareTripleChecker+Time [2025-02-07 23:12:22,278 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [0 Valid, 10905 Invalid, 2178 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 2178 Invalid, 0 Unknown, 0 Unchecked, 1.1s Time] [2025-02-07 23:12:22,282 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 4604 states. [2025-02-07 23:12:22,320 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 4604 to 4604. [2025-02-07 23:12:22,325 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 4604 states, 4603 states have (on average 1.495329133174017) internal successors, (6883), 4603 states have internal predecessors, (6883), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-02-07 23:12:22,330 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4604 states to 4604 states and 6883 transitions. [2025-02-07 23:12:22,330 INFO L78 Accepts]: Start accepts. Automaton has 4604 states and 6883 transitions. Word has length 236 [2025-02-07 23:12:22,331 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-02-07 23:12:22,331 INFO L471 AbstractCegarLoop]: Abstraction has 4604 states and 6883 transitions. [2025-02-07 23:12:22,331 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 78.66666666666667) internal successors, (236), 3 states have internal predecessors, (236), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-02-07 23:12:22,331 INFO L276 IsEmpty]: Start isEmpty. Operand 4604 states and 6883 transitions. [2025-02-07 23:12:22,332 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 237 [2025-02-07 23:12:22,333 INFO L210 NwaCegarLoop]: Found error trace [2025-02-07 23:12:22,333 INFO L218 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-02-07 23:12:22,333 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable15 [2025-02-07 23:12:22,333 INFO L396 AbstractCegarLoop]: === Iteration 17 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-02-07 23:12:22,334 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-02-07 23:12:22,334 INFO L85 PathProgramCache]: Analyzing trace with hash -2121604046, now seen corresponding path program 1 times [2025-02-07 23:12:22,334 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-02-07 23:12:22,334 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [535508010] [2025-02-07 23:12:22,334 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-02-07 23:12:22,334 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-02-07 23:12:22,388 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 236 statements into 1 equivalence classes. [2025-02-07 23:12:22,422 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 236 of 236 statements. [2025-02-07 23:12:22,422 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-02-07 23:12:22,422 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-02-07 23:12:22,810 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-02-07 23:12:22,810 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-02-07 23:12:22,810 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [535508010] [2025-02-07 23:12:22,810 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [535508010] provided 1 perfect and 0 imperfect interpolant sequences [2025-02-07 23:12:22,810 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-02-07 23:12:22,810 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2025-02-07 23:12:22,810 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [713629163] [2025-02-07 23:12:22,810 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-02-07 23:12:22,810 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2025-02-07 23:12:22,811 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-02-07 23:12:22,811 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2025-02-07 23:12:22,811 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=10, Invalid=20, Unknown=0, NotChecked=0, Total=30 [2025-02-07 23:12:22,811 INFO L87 Difference]: Start difference. First operand 4604 states and 6883 transitions. Second operand has 6 states, 6 states have (on average 39.333333333333336) internal successors, (236), 5 states have internal predecessors, (236), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-02-07 23:12:25,161 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-02-07 23:12:25,161 INFO L93 Difference]: Finished difference Result 8814 states and 13174 transitions. [2025-02-07 23:12:25,161 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2025-02-07 23:12:25,161 INFO L78 Accepts]: Start accepts. Automaton has has 6 states, 6 states have (on average 39.333333333333336) internal successors, (236), 5 states have internal predecessors, (236), 0 states have call successors, (0), 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 236 [2025-02-07 23:12:25,162 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-02-07 23:12:25,166 INFO L225 Difference]: With dead ends: 8814 [2025-02-07 23:12:25,166 INFO L226 Difference]: Without dead ends: 4628 [2025-02-07 23:12:25,168 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 9 GetRequests, 3 SyntacticMatches, 0 SemanticMatches, 6 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=19, Invalid=37, Unknown=0, NotChecked=0, Total=56 [2025-02-07 23:12:25,169 INFO L435 NwaCegarLoop]: 5439 mSDtfsCounter, 6354 mSDsluCounter, 16292 mSDsCounter, 0 mSdLazyCounter, 4456 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 1.9s Time, 0 mProtectedPredicate, 0 mProtectedAction, 6354 SdHoareTripleChecker+Valid, 21731 SdHoareTripleChecker+Invalid, 4456 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 4456 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 2.2s IncrementalHoareTripleChecker+Time [2025-02-07 23:12:25,169 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [6354 Valid, 21731 Invalid, 4456 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 4456 Invalid, 0 Unknown, 0 Unchecked, 2.2s Time] [2025-02-07 23:12:25,173 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 4628 states. [2025-02-07 23:12:25,212 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 4628 to 4610. [2025-02-07 23:12:25,215 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 4610 states, 4609 states have (on average 1.4951182469082231) internal successors, (6891), 4609 states have internal predecessors, (6891), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-02-07 23:12:25,221 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4610 states to 4610 states and 6891 transitions. [2025-02-07 23:12:25,221 INFO L78 Accepts]: Start accepts. Automaton has 4610 states and 6891 transitions. Word has length 236 [2025-02-07 23:12:25,221 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-02-07 23:12:25,221 INFO L471 AbstractCegarLoop]: Abstraction has 4610 states and 6891 transitions. [2025-02-07 23:12:25,221 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 6 states have (on average 39.333333333333336) internal successors, (236), 5 states have internal predecessors, (236), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-02-07 23:12:25,222 INFO L276 IsEmpty]: Start isEmpty. Operand 4610 states and 6891 transitions. [2025-02-07 23:12:25,223 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 238 [2025-02-07 23:12:25,223 INFO L210 NwaCegarLoop]: Found error trace [2025-02-07 23:12:25,223 INFO L218 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-02-07 23:12:25,223 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable16 [2025-02-07 23:12:25,223 INFO L396 AbstractCegarLoop]: === Iteration 18 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-02-07 23:12:25,224 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-02-07 23:12:25,224 INFO L85 PathProgramCache]: Analyzing trace with hash 1445687055, now seen corresponding path program 1 times [2025-02-07 23:12:25,224 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-02-07 23:12:25,224 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [738096148] [2025-02-07 23:12:25,224 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-02-07 23:12:25,224 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-02-07 23:12:25,272 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 237 statements into 1 equivalence classes. [2025-02-07 23:12:25,291 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 237 of 237 statements. [2025-02-07 23:12:25,292 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-02-07 23:12:25,292 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-02-07 23:12:25,521 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-02-07 23:12:25,521 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-02-07 23:12:25,521 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [738096148] [2025-02-07 23:12:25,521 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [738096148] provided 1 perfect and 0 imperfect interpolant sequences [2025-02-07 23:12:25,522 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-02-07 23:12:25,522 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2025-02-07 23:12:25,522 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [143337046] [2025-02-07 23:12:25,522 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-02-07 23:12:25,522 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2025-02-07 23:12:25,522 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-02-07 23:12:25,523 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2025-02-07 23:12:25,523 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2025-02-07 23:12:25,523 INFO L87 Difference]: Start difference. First operand 4610 states and 6891 transitions. Second operand has 5 states, 5 states have (on average 47.4) internal successors, (237), 4 states have internal predecessors, (237), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-02-07 23:12:27,146 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-02-07 23:12:27,146 INFO L93 Difference]: Finished difference Result 8964 states and 13396 transitions. [2025-02-07 23:12:27,147 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2025-02-07 23:12:27,147 INFO L78 Accepts]: Start accepts. Automaton has has 5 states, 5 states have (on average 47.4) internal successors, (237), 4 states have internal predecessors, (237), 0 states have call successors, (0), 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 237 [2025-02-07 23:12:27,147 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-02-07 23:12:27,152 INFO L225 Difference]: With dead ends: 8964 [2025-02-07 23:12:27,152 INFO L226 Difference]: Without dead ends: 4764 [2025-02-07 23:12:27,156 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 6 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 4 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=11, Invalid=19, Unknown=0, NotChecked=0, Total=30 [2025-02-07 23:12:27,157 INFO L435 NwaCegarLoop]: 5452 mSDtfsCounter, 679 mSDsluCounter, 16061 mSDsCounter, 0 mSdLazyCounter, 4306 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 1.3s Time, 0 mProtectedPredicate, 0 mProtectedAction, 679 SdHoareTripleChecker+Valid, 21513 SdHoareTripleChecker+Invalid, 4306 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 4306 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 1.5s IncrementalHoareTripleChecker+Time [2025-02-07 23:12:27,157 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [679 Valid, 21513 Invalid, 4306 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 4306 Invalid, 0 Unknown, 0 Unchecked, 1.5s Time] [2025-02-07 23:12:27,161 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 4764 states. [2025-02-07 23:12:27,192 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 4764 to 4605. [2025-02-07 23:12:27,195 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 4605 states, 4604 states have (on average 1.4947871416159861) internal successors, (6882), 4604 states have internal predecessors, (6882), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-02-07 23:12:27,199 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4605 states to 4605 states and 6882 transitions. [2025-02-07 23:12:27,199 INFO L78 Accepts]: Start accepts. Automaton has 4605 states and 6882 transitions. Word has length 237 [2025-02-07 23:12:27,199 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-02-07 23:12:27,199 INFO L471 AbstractCegarLoop]: Abstraction has 4605 states and 6882 transitions. [2025-02-07 23:12:27,199 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 47.4) internal successors, (237), 4 states have internal predecessors, (237), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-02-07 23:12:27,199 INFO L276 IsEmpty]: Start isEmpty. Operand 4605 states and 6882 transitions. [2025-02-07 23:12:27,200 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 238 [2025-02-07 23:12:27,200 INFO L210 NwaCegarLoop]: Found error trace [2025-02-07 23:12:27,204 INFO L218 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-02-07 23:12:27,204 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable17 [2025-02-07 23:12:27,204 INFO L396 AbstractCegarLoop]: === Iteration 19 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-02-07 23:12:27,204 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-02-07 23:12:27,204 INFO L85 PathProgramCache]: Analyzing trace with hash 874080347, now seen corresponding path program 1 times [2025-02-07 23:12:27,204 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-02-07 23:12:27,204 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1686266013] [2025-02-07 23:12:27,204 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-02-07 23:12:27,204 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-02-07 23:12:27,240 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 237 statements into 1 equivalence classes. [2025-02-07 23:12:27,262 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 237 of 237 statements. [2025-02-07 23:12:27,262 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-02-07 23:12:27,262 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-02-07 23:12:27,681 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-02-07 23:12:27,682 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-02-07 23:12:27,682 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1686266013] [2025-02-07 23:12:27,682 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1686266013] provided 1 perfect and 0 imperfect interpolant sequences [2025-02-07 23:12:27,682 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-02-07 23:12:27,682 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2025-02-07 23:12:27,682 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1015950072] [2025-02-07 23:12:27,682 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-02-07 23:12:27,682 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2025-02-07 23:12:27,682 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-02-07 23:12:27,683 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2025-02-07 23:12:27,683 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=9, Invalid=21, Unknown=0, NotChecked=0, Total=30 [2025-02-07 23:12:27,683 INFO L87 Difference]: Start difference. First operand 4605 states and 6882 transitions. Second operand has 6 states, 6 states have (on average 39.5) internal successors, (237), 5 states have internal predecessors, (237), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0)