./Ultimate.py --spec ../sv-benchmarks/c/properties/unreach-call.prp --file ../sv-benchmarks/c/hardware-verification-bv/btor2c-lazyMod.cal10.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.cal10.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 7f53cc5681a5a08e9c1e07ab3be30428c8fa3fd345275d441a7b8c6544c83a42 --- Real Ultimate output --- This is Ultimate 0.3.0-?-48c9605-m [2025-02-07 22:24:12,201 INFO L188 SettingsManager]: Resetting all preferences to default values... [2025-02-07 22:24:12,252 INFO L114 SettingsManager]: Loading settings from /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/config/svcomp-Reach-64bit-Automizer_Default.epf [2025-02-07 22:24:12,255 WARN L101 SettingsManager]: Preference file contains the following unknown settings: [2025-02-07 22:24:12,255 WARN L103 SettingsManager]: * de.uni_freiburg.informatik.ultimate.core.Log level for class [2025-02-07 22:24:12,272 INFO L130 SettingsManager]: Preferences different from defaults after loading the file: [2025-02-07 22:24:12,273 INFO L151 SettingsManager]: Preferences of UltimateCore differ from their defaults: [2025-02-07 22:24:12,273 INFO L153 SettingsManager]: * Log level for class=de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher=ERROR; [2025-02-07 22:24:12,273 INFO L151 SettingsManager]: Preferences of Boogie Preprocessor differ from their defaults: [2025-02-07 22:24:12,274 INFO L153 SettingsManager]: * Use memory slicer=true [2025-02-07 22:24:12,274 INFO L151 SettingsManager]: Preferences of Boogie Procedure Inliner differ from their defaults: [2025-02-07 22:24:12,274 INFO L153 SettingsManager]: * Ignore calls to procedures called more than once=ONLY_FOR_SEQUENTIAL_PROGRAMS [2025-02-07 22:24:12,275 INFO L151 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2025-02-07 22:24:12,275 INFO L153 SettingsManager]: * Create parallel compositions if possible=false [2025-02-07 22:24:12,275 INFO L153 SettingsManager]: * Use SBE=true [2025-02-07 22:24:12,275 INFO L151 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2025-02-07 22:24:12,275 INFO L153 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2025-02-07 22:24:12,276 INFO L153 SettingsManager]: * Overapproximate operations on floating types=true [2025-02-07 22:24:12,276 INFO L153 SettingsManager]: * Check division by zero=IGNORE [2025-02-07 22:24:12,276 INFO L153 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2025-02-07 22:24:12,276 INFO L153 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2025-02-07 22:24:12,276 INFO L153 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2025-02-07 22:24:12,276 INFO L153 SettingsManager]: * Check if freed pointer was valid=false [2025-02-07 22:24:12,276 INFO L153 SettingsManager]: * Behaviour of calls to undefined functions=OVERAPPROXIMATE_BEHAVIOUR [2025-02-07 22:24:12,276 INFO L153 SettingsManager]: * Use constant arrays=true [2025-02-07 22:24:12,276 INFO L151 SettingsManager]: Preferences of IcfgBuilder differ from their defaults: [2025-02-07 22:24:12,276 INFO L153 SettingsManager]: * Size of a code block=SequenceOfStatements [2025-02-07 22:24:12,277 INFO L153 SettingsManager]: * Only consider context switches at boundaries of atomic blocks=true [2025-02-07 22:24:12,277 INFO L153 SettingsManager]: * SMT solver=External_DefaultMode [2025-02-07 22:24:12,277 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2025-02-07 22:24:12,277 INFO L151 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2025-02-07 22:24:12,277 INFO L153 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2025-02-07 22:24:12,278 INFO L153 SettingsManager]: * Compute procedure contracts=false [2025-02-07 22:24:12,278 INFO L153 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopHeads [2025-02-07 22:24:12,278 INFO L153 SettingsManager]: * Trace refinement strategy=CAMEL [2025-02-07 22:24:12,278 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2025-02-07 22:24:12,278 INFO L153 SettingsManager]: * Apply one-shot large block encoding in concurrent analysis=false [2025-02-07 22:24:12,278 INFO L153 SettingsManager]: * Automaton type used in concurrency analysis=PETRI_NET [2025-02-07 22:24:12,278 INFO L153 SettingsManager]: * Order on configurations for Petri net unfoldings=DBO [2025-02-07 22:24:12,278 INFO L153 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode [2025-02-07 22:24:12,278 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 -> 7f53cc5681a5a08e9c1e07ab3be30428c8fa3fd345275d441a7b8c6544c83a42 [2025-02-07 22:24:12,525 INFO L75 nceAwareModelManager]: Repository-Root is: /tmp [2025-02-07 22:24:12,535 INFO L261 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2025-02-07 22:24:12,538 INFO L217 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2025-02-07 22:24:12,538 INFO L270 PluginConnector]: Initializing CDTParser... [2025-02-07 22:24:12,539 INFO L274 PluginConnector]: CDTParser initialized [2025-02-07 22:24:12,540 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.cal10.c [2025-02-07 22:24:13,771 INFO L533 CDTParser]: Created temporary CDT project at /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/data/b55a635d5/e5e46189256e4eac8695283788358fd6/FLAG8bee9714d [2025-02-07 22:24:14,100 INFO L384 CDTParser]: Found 1 translation units. [2025-02-07 22:24:14,101 INFO L180 CDTParser]: Scanning /storage/repos/ultimate-jdk21/releaseScripts/default/sv-benchmarks/c/hardware-verification-bv/btor2c-lazyMod.cal10.c [2025-02-07 22:24:14,120 INFO L427 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/data/b55a635d5/e5e46189256e4eac8695283788358fd6/FLAG8bee9714d [2025-02-07 22:24:14,130 INFO L435 CDTParser]: Successfully deleted /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/data/b55a635d5/e5e46189256e4eac8695283788358fd6 [2025-02-07 22:24:14,132 INFO L299 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2025-02-07 22:24:14,133 INFO L133 ToolchainWalker]: Walking toolchain with 6 elements. [2025-02-07 22:24:14,133 INFO L112 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2025-02-07 22:24:14,134 INFO L270 PluginConnector]: Initializing CACSL2BoogieTranslator... [2025-02-07 22:24:14,136 INFO L274 PluginConnector]: CACSL2BoogieTranslator initialized [2025-02-07 22:24:14,137 INFO L184 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 07.02 10:24:14" (1/1) ... [2025-02-07 22:24:14,137 INFO L204 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@2a905c53 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 07.02 10:24:14, skipping insertion in model container [2025-02-07 22:24:14,137 INFO L184 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 07.02 10:24:14" (1/1) ... [2025-02-07 22:24:14,181 INFO L175 MainTranslator]: Built tables and reachable declarations [2025-02-07 22:24:14,287 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.cal10.c[1245,1258] [2025-02-07 22:24:14,493 INFO L210 PostProcessor]: Analyzing one entry point: main [2025-02-07 22:24:14,500 INFO L200 MainTranslator]: Completed pre-run [2025-02-07 22:24:14,506 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.cal10.c[1245,1258] [2025-02-07 22:24:14,635 INFO L210 PostProcessor]: Analyzing one entry point: main [2025-02-07 22:24:14,643 INFO L204 MainTranslator]: Completed translation [2025-02-07 22:24:14,644 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 07.02 10:24:14 WrapperNode [2025-02-07 22:24:14,644 INFO L131 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2025-02-07 22:24:14,645 INFO L112 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2025-02-07 22:24:14,645 INFO L270 PluginConnector]: Initializing Boogie Procedure Inliner... [2025-02-07 22:24:14,645 INFO L274 PluginConnector]: Boogie Procedure Inliner initialized [2025-02-07 22:24:14,649 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 07.02 10:24:14" (1/1) ... [2025-02-07 22:24:14,699 INFO L184 PluginConnector]: Executing the observer Inliner from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 07.02 10:24:14" (1/1) ... [2025-02-07 22:24:15,031 INFO L138 Inliner]: procedures = 17, calls = 16, calls flagged for inlining = 3, calls inlined = 3, statements flattened = 3643 [2025-02-07 22:24:15,032 INFO L131 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2025-02-07 22:24:15,032 INFO L112 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2025-02-07 22:24:15,032 INFO L270 PluginConnector]: Initializing Boogie Preprocessor... [2025-02-07 22:24:15,032 INFO L274 PluginConnector]: Boogie Preprocessor initialized [2025-02-07 22:24:15,039 INFO L184 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 07.02 10:24:14" (1/1) ... [2025-02-07 22:24:15,039 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 07.02 10:24:14" (1/1) ... [2025-02-07 22:24:15,136 INFO L184 PluginConnector]: Executing the observer MemorySlicer from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 07.02 10:24:14" (1/1) ... [2025-02-07 22:24:15,249 INFO L175 MemorySlicer]: Split 10 memory accesses to 2 slices as follows [2, 8]. 80 percent of accesses are in the largest equivalence class. The 10 initializations are split as follows [2, 8]. The 0 writes are split as follows [0, 0]. [2025-02-07 22:24:15,249 INFO L184 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 07.02 10:24:14" (1/1) ... [2025-02-07 22:24:15,249 INFO L184 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 07.02 10:24:14" (1/1) ... [2025-02-07 22:24:15,335 INFO L184 PluginConnector]: Executing the observer ReplaceArrayAssignments from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 07.02 10:24:14" (1/1) ... [2025-02-07 22:24:15,351 INFO L184 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 07.02 10:24:14" (1/1) ... [2025-02-07 22:24:15,372 INFO L184 PluginConnector]: Executing the observer LTLStepAnnotator from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 07.02 10:24:14" (1/1) ... [2025-02-07 22:24:15,391 INFO L184 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 07.02 10:24:14" (1/1) ... [2025-02-07 22:24:15,514 INFO L131 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2025-02-07 22:24:15,515 INFO L112 PluginConnector]: ------------------------IcfgBuilder---------------------------- [2025-02-07 22:24:15,515 INFO L270 PluginConnector]: Initializing IcfgBuilder... [2025-02-07 22:24:15,515 INFO L274 PluginConnector]: IcfgBuilder initialized [2025-02-07 22:24:15,516 INFO L184 PluginConnector]: Executing the observer IcfgBuilderObserver from plugin IcfgBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 07.02 10:24:14" (1/1) ... [2025-02-07 22:24:15,527 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2025-02-07 22:24:15,542 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 [2025-02-07 22:24:15,563 INFO L229 MonitoredProcess]: Starting monitored process 1 with /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 (exit command is (exit), workingDir is null) [2025-02-07 22:24:15,570 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 (1)] Waiting until timeout for monitored process [2025-02-07 22:24:15,595 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocInit [2025-02-07 22:24:15,595 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int#0 [2025-02-07 22:24:15,595 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int#1 [2025-02-07 22:24:15,595 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2025-02-07 22:24:15,595 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2025-02-07 22:24:15,860 INFO L257 CfgBuilder]: Building ICFG [2025-02-07 22:24:15,861 INFO L287 CfgBuilder]: Building CFG for each procedure with an implementation [2025-02-07 22:24:18,804 INFO L? ?]: Removed 2042 outVars from TransFormulas that were not future-live. [2025-02-07 22:24:18,804 INFO L308 CfgBuilder]: Performing block encoding [2025-02-07 22:24:18,912 INFO L332 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2025-02-07 22:24:18,913 INFO L337 CfgBuilder]: Removed 0 assume(true) statements. [2025-02-07 22:24:18,913 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.icfgbuilder CFG 07.02 10:24:18 BoogieIcfgContainer [2025-02-07 22:24:18,913 INFO L131 PluginConnector]: ------------------------ END IcfgBuilder---------------------------- [2025-02-07 22:24:18,915 INFO L112 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2025-02-07 22:24:18,915 INFO L270 PluginConnector]: Initializing TraceAbstraction... [2025-02-07 22:24:18,931 INFO L274 PluginConnector]: TraceAbstraction initialized [2025-02-07 22:24:18,934 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 07.02 10:24:14" (1/3) ... [2025-02-07 22:24:18,935 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@7ed42bb1 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 07.02 10:24:18, skipping insertion in model container [2025-02-07 22:24:18,935 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 07.02 10:24:14" (2/3) ... [2025-02-07 22:24:18,935 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@7ed42bb1 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 07.02 10:24:18, skipping insertion in model container [2025-02-07 22:24:18,935 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.icfgbuilder CFG 07.02 10:24:18" (3/3) ... [2025-02-07 22:24:18,944 INFO L128 eAbstractionObserver]: Analyzing ICFG btor2c-lazyMod.cal10.c [2025-02-07 22:24:18,968 INFO L216 ceAbstractionStarter]: Automizer settings: Hoare:LoopHeads NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2025-02-07 22:24:18,972 INFO L151 ceAbstractionStarter]: Applying trace abstraction to ICFG btor2c-lazyMod.cal10.c that has 1 procedures, 1087 locations, 1 initial locations, 1 loop locations, and 1 error locations. [2025-02-07 22:24:19,049 INFO L332 AbstractCegarLoop]: ======== Iteration 0 == of CEGAR loop == AllErrorsAtOnce ======== [2025-02-07 22:24:19,059 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;@6b4c095b, mLbeIndependenceSettings=[IndependenceType=SEMANTIC, AbstractionType=NONE, UseConditional=false, UseSemiCommutativity=true, Solver=Z3, SolverTimeout=1000ms] [2025-02-07 22:24:19,059 INFO L334 AbstractCegarLoop]: Starting to check reachability of 1 error locations. [2025-02-07 22:24:19,067 INFO L276 IsEmpty]: Start isEmpty. Operand has 1087 states, 1085 states have (on average 1.5013824884792626) internal successors, (1629), 1086 states have internal predecessors, (1629), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-02-07 22:24:19,090 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 347 [2025-02-07 22:24:19,091 INFO L210 NwaCegarLoop]: Found error trace [2025-02-07 22:24:19,092 INFO L218 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-02-07 22:24:19,093 INFO L396 AbstractCegarLoop]: === Iteration 1 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-02-07 22:24:19,097 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-02-07 22:24:19,098 INFO L85 PathProgramCache]: Analyzing trace with hash 1203387889, now seen corresponding path program 1 times [2025-02-07 22:24:19,103 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-02-07 22:24:19,105 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [405544997] [2025-02-07 22:24:19,105 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-02-07 22:24:19,105 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-02-07 22:24:19,265 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 346 statements into 1 equivalence classes. [2025-02-07 22:24:19,789 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 346 of 346 statements. [2025-02-07 22:24:19,791 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-02-07 22:24:19,791 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-02-07 22:24:21,519 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-02-07 22:24:21,520 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-02-07 22:24:21,521 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [405544997] [2025-02-07 22:24:21,521 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [405544997] provided 1 perfect and 0 imperfect interpolant sequences [2025-02-07 22:24:21,522 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-02-07 22:24:21,522 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2025-02-07 22:24:21,523 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1902389193] [2025-02-07 22:24:21,524 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-02-07 22:24:21,527 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2025-02-07 22:24:21,528 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-02-07 22:24:21,544 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2025-02-07 22:24:21,545 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2025-02-07 22:24:21,550 INFO L87 Difference]: Start difference. First operand has 1087 states, 1085 states have (on average 1.5013824884792626) internal successors, (1629), 1086 states have internal predecessors, (1629), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Second operand has 4 states, 4 states have (on average 86.5) internal successors, (346), 4 states have internal predecessors, (346), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-02-07 22:24:22,115 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-02-07 22:24:22,116 INFO L93 Difference]: Finished difference Result 2145 states and 3217 transitions. [2025-02-07 22:24:22,120 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2025-02-07 22:24:22,121 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 4 states have (on average 86.5) internal successors, (346), 4 states have internal predecessors, (346), 0 states have call successors, (0), 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 346 [2025-02-07 22:24:22,122 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-02-07 22:24:22,143 INFO L225 Difference]: With dead ends: 2145 [2025-02-07 22:24:22,143 INFO L226 Difference]: Without dead ends: 1087 [2025-02-07 22:24:22,147 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 4 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 2 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2025-02-07 22:24:22,149 INFO L435 NwaCegarLoop]: 1355 mSDtfsCounter, 0 mSDsluCounter, 2705 mSDsCounter, 0 mSdLazyCounter, 817 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.4s Time, 0 mProtectedPredicate, 0 mProtectedAction, 0 SdHoareTripleChecker+Valid, 4060 SdHoareTripleChecker+Invalid, 817 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 817 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.5s IncrementalHoareTripleChecker+Time [2025-02-07 22:24:22,150 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [0 Valid, 4060 Invalid, 817 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 817 Invalid, 0 Unknown, 0 Unchecked, 0.5s Time] [2025-02-07 22:24:22,162 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1087 states. [2025-02-07 22:24:22,197 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1087 to 1087. [2025-02-07 22:24:22,200 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 1087 states, 1086 states have (on average 1.4990791896869244) internal successors, (1628), 1086 states have internal predecessors, (1628), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-02-07 22:24:22,205 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1087 states to 1087 states and 1628 transitions. [2025-02-07 22:24:22,207 INFO L78 Accepts]: Start accepts. Automaton has 1087 states and 1628 transitions. Word has length 346 [2025-02-07 22:24:22,208 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-02-07 22:24:22,208 INFO L471 AbstractCegarLoop]: Abstraction has 1087 states and 1628 transitions. [2025-02-07 22:24:22,208 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 86.5) internal successors, (346), 4 states have internal predecessors, (346), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-02-07 22:24:22,208 INFO L276 IsEmpty]: Start isEmpty. Operand 1087 states and 1628 transitions. [2025-02-07 22:24:22,211 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 348 [2025-02-07 22:24:22,212 INFO L210 NwaCegarLoop]: Found error trace [2025-02-07 22:24:22,212 INFO L218 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-02-07 22:24:22,212 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable0 [2025-02-07 22:24:22,213 INFO L396 AbstractCegarLoop]: === Iteration 2 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-02-07 22:24:22,213 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-02-07 22:24:22,213 INFO L85 PathProgramCache]: Analyzing trace with hash -1345001276, now seen corresponding path program 1 times [2025-02-07 22:24:22,214 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-02-07 22:24:22,214 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1477391726] [2025-02-07 22:24:22,214 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-02-07 22:24:22,214 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-02-07 22:24:22,315 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 347 statements into 1 equivalence classes. [2025-02-07 22:24:22,467 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 347 of 347 statements. [2025-02-07 22:24:22,470 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-02-07 22:24:22,470 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-02-07 22:24:23,093 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-02-07 22:24:23,095 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-02-07 22:24:23,095 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1477391726] [2025-02-07 22:24:23,096 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1477391726] provided 1 perfect and 0 imperfect interpolant sequences [2025-02-07 22:24:23,096 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-02-07 22:24:23,096 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2025-02-07 22:24:23,096 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2137649176] [2025-02-07 22:24:23,096 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-02-07 22:24:23,097 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2025-02-07 22:24:23,098 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-02-07 22:24:23,099 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2025-02-07 22:24:23,100 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2025-02-07 22:24:23,100 INFO L87 Difference]: Start difference. First operand 1087 states and 1628 transitions. Second operand has 4 states, 4 states have (on average 86.75) internal successors, (347), 4 states have internal predecessors, (347), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-02-07 22:24:23,536 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-02-07 22:24:23,537 INFO L93 Difference]: Finished difference Result 2147 states and 3216 transitions. [2025-02-07 22:24:23,537 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2025-02-07 22:24:23,537 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 4 states have (on average 86.75) internal successors, (347), 4 states have internal predecessors, (347), 0 states have call successors, (0), 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 347 [2025-02-07 22:24:23,538 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-02-07 22:24:23,542 INFO L225 Difference]: With dead ends: 2147 [2025-02-07 22:24:23,542 INFO L226 Difference]: Without dead ends: 1089 [2025-02-07 22:24:23,543 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 5 GetRequests, 3 SyntacticMatches, 0 SemanticMatches, 2 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2025-02-07 22:24:23,544 INFO L435 NwaCegarLoop]: 1355 mSDtfsCounter, 0 mSDsluCounter, 2702 mSDsCounter, 0 mSdLazyCounter, 820 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.3s Time, 0 mProtectedPredicate, 0 mProtectedAction, 0 SdHoareTripleChecker+Valid, 4057 SdHoareTripleChecker+Invalid, 820 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 820 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.4s IncrementalHoareTripleChecker+Time [2025-02-07 22:24:23,544 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [0 Valid, 4057 Invalid, 820 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 820 Invalid, 0 Unknown, 0 Unchecked, 0.4s Time] [2025-02-07 22:24:23,545 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1089 states. [2025-02-07 22:24:23,571 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1089 to 1089. [2025-02-07 22:24:23,572 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 1089 states, 1088 states have (on average 1.4981617647058822) internal successors, (1630), 1088 states have internal predecessors, (1630), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-02-07 22:24:23,575 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1089 states to 1089 states and 1630 transitions. [2025-02-07 22:24:23,575 INFO L78 Accepts]: Start accepts. Automaton has 1089 states and 1630 transitions. Word has length 347 [2025-02-07 22:24:23,575 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-02-07 22:24:23,575 INFO L471 AbstractCegarLoop]: Abstraction has 1089 states and 1630 transitions. [2025-02-07 22:24:23,576 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 86.75) internal successors, (347), 4 states have internal predecessors, (347), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-02-07 22:24:23,576 INFO L276 IsEmpty]: Start isEmpty. Operand 1089 states and 1630 transitions. [2025-02-07 22:24:23,578 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 349 [2025-02-07 22:24:23,578 INFO L210 NwaCegarLoop]: Found error trace [2025-02-07 22:24:23,578 INFO L218 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-02-07 22:24:23,579 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable1 [2025-02-07 22:24:23,579 INFO L396 AbstractCegarLoop]: === Iteration 3 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-02-07 22:24:23,579 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-02-07 22:24:23,579 INFO L85 PathProgramCache]: Analyzing trace with hash -1108823988, now seen corresponding path program 1 times [2025-02-07 22:24:23,579 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-02-07 22:24:23,579 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1873050430] [2025-02-07 22:24:23,580 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-02-07 22:24:23,580 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-02-07 22:24:23,667 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 348 statements into 1 equivalence classes. [2025-02-07 22:24:24,792 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 348 of 348 statements. [2025-02-07 22:24:24,793 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-02-07 22:24:24,793 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-02-07 22:24:25,875 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-02-07 22:24:25,876 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-02-07 22:24:25,876 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1873050430] [2025-02-07 22:24:25,876 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1873050430] provided 1 perfect and 0 imperfect interpolant sequences [2025-02-07 22:24:25,876 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-02-07 22:24:25,876 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2025-02-07 22:24:25,876 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [196007284] [2025-02-07 22:24:25,876 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-02-07 22:24:25,877 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2025-02-07 22:24:25,877 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-02-07 22:24:25,878 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2025-02-07 22:24:25,878 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2025-02-07 22:24:25,878 INFO L87 Difference]: Start difference. First operand 1089 states and 1630 transitions. Second operand has 4 states, 4 states have (on average 87.0) internal successors, (348), 4 states have internal predecessors, (348), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-02-07 22:24:26,711 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-02-07 22:24:26,715 INFO L93 Difference]: Finished difference Result 2149 states and 3217 transitions. [2025-02-07 22:24:26,716 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2025-02-07 22:24:26,716 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 4 states have (on average 87.0) internal successors, (348), 4 states have internal predecessors, (348), 0 states have call successors, (0), 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 348 [2025-02-07 22:24:26,720 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-02-07 22:24:26,724 INFO L225 Difference]: With dead ends: 2149 [2025-02-07 22:24:26,727 INFO L226 Difference]: Without dead ends: 1089 [2025-02-07 22:24:26,729 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 4 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 2 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2025-02-07 22:24:26,734 INFO L435 NwaCegarLoop]: 1353 mSDtfsCounter, 6 mSDsluCounter, 2696 mSDsCounter, 0 mSdLazyCounter, 817 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.6s Time, 0 mProtectedPredicate, 0 mProtectedAction, 6 SdHoareTripleChecker+Valid, 4049 SdHoareTripleChecker+Invalid, 817 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 817 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.8s IncrementalHoareTripleChecker+Time [2025-02-07 22:24:26,734 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [6 Valid, 4049 Invalid, 817 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 817 Invalid, 0 Unknown, 0 Unchecked, 0.8s Time] [2025-02-07 22:24:26,736 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1089 states. [2025-02-07 22:24:26,770 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1089 to 1089. [2025-02-07 22:24:26,772 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 1089 states, 1088 states have (on average 1.4972426470588236) internal successors, (1629), 1088 states have internal predecessors, (1629), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-02-07 22:24:26,779 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1089 states to 1089 states and 1629 transitions. [2025-02-07 22:24:26,783 INFO L78 Accepts]: Start accepts. Automaton has 1089 states and 1629 transitions. Word has length 348 [2025-02-07 22:24:26,783 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-02-07 22:24:26,783 INFO L471 AbstractCegarLoop]: Abstraction has 1089 states and 1629 transitions. [2025-02-07 22:24:26,784 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 87.0) internal successors, (348), 4 states have internal predecessors, (348), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-02-07 22:24:26,784 INFO L276 IsEmpty]: Start isEmpty. Operand 1089 states and 1629 transitions. [2025-02-07 22:24:26,792 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 350 [2025-02-07 22:24:26,795 INFO L210 NwaCegarLoop]: Found error trace [2025-02-07 22:24:26,796 INFO L218 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-02-07 22:24:26,796 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable2 [2025-02-07 22:24:26,796 INFO L396 AbstractCegarLoop]: === Iteration 4 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-02-07 22:24:26,797 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-02-07 22:24:26,797 INFO L85 PathProgramCache]: Analyzing trace with hash 202741740, now seen corresponding path program 1 times [2025-02-07 22:24:26,797 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-02-07 22:24:26,797 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1663192454] [2025-02-07 22:24:26,797 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-02-07 22:24:26,797 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-02-07 22:24:26,892 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 349 statements into 1 equivalence classes. [2025-02-07 22:24:28,654 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 349 of 349 statements. [2025-02-07 22:24:28,654 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-02-07 22:24:28,654 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-02-07 22:24:29,873 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-02-07 22:24:29,874 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-02-07 22:24:29,874 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1663192454] [2025-02-07 22:24:29,875 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1663192454] provided 1 perfect and 0 imperfect interpolant sequences [2025-02-07 22:24:29,875 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-02-07 22:24:29,875 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2025-02-07 22:24:29,875 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1557856937] [2025-02-07 22:24:29,875 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-02-07 22:24:29,875 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2025-02-07 22:24:29,875 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-02-07 22:24:29,876 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2025-02-07 22:24:29,877 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=9, Invalid=21, Unknown=0, NotChecked=0, Total=30 [2025-02-07 22:24:29,877 INFO L87 Difference]: Start difference. First operand 1089 states and 1629 transitions. Second operand has 6 states, 6 states have (on average 58.166666666666664) internal successors, (349), 5 states have internal predecessors, (349), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-02-07 22:24:30,727 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-02-07 22:24:30,728 INFO L93 Difference]: Finished difference Result 2817 states and 4213 transitions. [2025-02-07 22:24:30,728 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2025-02-07 22:24:30,729 INFO L78 Accepts]: Start accepts. Automaton has has 6 states, 6 states have (on average 58.166666666666664) internal successors, (349), 5 states have internal predecessors, (349), 0 states have call successors, (0), 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 349 [2025-02-07 22:24:30,730 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-02-07 22:24:30,737 INFO L225 Difference]: With dead ends: 2817 [2025-02-07 22:24:30,738 INFO L226 Difference]: Without dead ends: 1757 [2025-02-07 22:24:30,739 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 8 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 7 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=25, Invalid=47, Unknown=0, NotChecked=0, Total=72 [2025-02-07 22:24:30,741 INFO L435 NwaCegarLoop]: 1335 mSDtfsCounter, 4198 mSDsluCounter, 4005 mSDsCounter, 0 mSdLazyCounter, 1159 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.6s Time, 0 mProtectedPredicate, 0 mProtectedAction, 4198 SdHoareTripleChecker+Valid, 5340 SdHoareTripleChecker+Invalid, 1159 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 1159 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.8s IncrementalHoareTripleChecker+Time [2025-02-07 22:24:30,742 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [4198 Valid, 5340 Invalid, 1159 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 1159 Invalid, 0 Unknown, 0 Unchecked, 0.8s Time] [2025-02-07 22:24:30,745 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1757 states. [2025-02-07 22:24:30,780 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1757 to 1738. [2025-02-07 22:24:30,782 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 1738 states, 1737 states have (on average 1.4979850316637882) internal successors, (2602), 1737 states have internal predecessors, (2602), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-02-07 22:24:30,788 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1738 states to 1738 states and 2602 transitions. [2025-02-07 22:24:30,788 INFO L78 Accepts]: Start accepts. Automaton has 1738 states and 2602 transitions. Word has length 349 [2025-02-07 22:24:30,789 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-02-07 22:24:30,789 INFO L471 AbstractCegarLoop]: Abstraction has 1738 states and 2602 transitions. [2025-02-07 22:24:30,790 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 6 states have (on average 58.166666666666664) internal successors, (349), 5 states have internal predecessors, (349), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-02-07 22:24:30,790 INFO L276 IsEmpty]: Start isEmpty. Operand 1738 states and 2602 transitions. [2025-02-07 22:24:30,795 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 351 [2025-02-07 22:24:30,795 INFO L210 NwaCegarLoop]: Found error trace [2025-02-07 22:24:30,795 INFO L218 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-02-07 22:24:30,796 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable3 [2025-02-07 22:24:30,796 INFO L396 AbstractCegarLoop]: === Iteration 5 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-02-07 22:24:30,797 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-02-07 22:24:30,797 INFO L85 PathProgramCache]: Analyzing trace with hash -416577463, now seen corresponding path program 1 times [2025-02-07 22:24:30,797 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-02-07 22:24:30,797 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [793845502] [2025-02-07 22:24:30,797 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-02-07 22:24:30,797 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-02-07 22:24:30,884 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 350 statements into 1 equivalence classes. [2025-02-07 22:24:32,135 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 350 of 350 statements. [2025-02-07 22:24:32,135 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-02-07 22:24:32,135 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-02-07 22:24:33,490 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-02-07 22:24:33,490 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-02-07 22:24:33,491 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [793845502] [2025-02-07 22:24:33,491 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [793845502] provided 1 perfect and 0 imperfect interpolant sequences [2025-02-07 22:24:33,491 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-02-07 22:24:33,491 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2025-02-07 22:24:33,491 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [617766232] [2025-02-07 22:24:33,491 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-02-07 22:24:33,491 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 7 states [2025-02-07 22:24:33,491 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-02-07 22:24:33,492 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2025-02-07 22:24:33,492 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=13, Invalid=29, Unknown=0, NotChecked=0, Total=42 [2025-02-07 22:24:33,492 INFO L87 Difference]: Start difference. First operand 1738 states and 2602 transitions. Second operand has 7 states, 7 states have (on average 50.0) internal successors, (350), 6 states have internal predecessors, (350), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-02-07 22:24:34,350 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-02-07 22:24:34,351 INFO L93 Difference]: Finished difference Result 4345 states and 6502 transitions. [2025-02-07 22:24:34,351 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2025-02-07 22:24:34,352 INFO L78 Accepts]: Start accepts. Automaton has has 7 states, 7 states have (on average 50.0) internal successors, (350), 6 states have internal predecessors, (350), 0 states have call successors, (0), 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 350 [2025-02-07 22:24:34,352 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-02-07 22:24:34,361 INFO L225 Difference]: With dead ends: 4345 [2025-02-07 22:24:34,362 INFO L226 Difference]: Without dead ends: 3191 [2025-02-07 22:24:34,365 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 9 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 8 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 6 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=29, Invalid=61, Unknown=0, NotChecked=0, Total=90 [2025-02-07 22:24:34,366 INFO L435 NwaCegarLoop]: 1707 mSDtfsCounter, 3283 mSDsluCounter, 6443 mSDsCounter, 0 mSdLazyCounter, 1719 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.6s Time, 0 mProtectedPredicate, 0 mProtectedAction, 3283 SdHoareTripleChecker+Valid, 8150 SdHoareTripleChecker+Invalid, 1719 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 1719 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.8s IncrementalHoareTripleChecker+Time [2025-02-07 22:24:34,366 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [3283 Valid, 8150 Invalid, 1719 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 1719 Invalid, 0 Unknown, 0 Unchecked, 0.8s Time] [2025-02-07 22:24:34,370 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 3191 states. [2025-02-07 22:24:34,413 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 3191 to 2796. [2025-02-07 22:24:34,416 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 2796 states, 2795 states have (on average 1.4991055456171736) internal successors, (4190), 2795 states have internal predecessors, (4190), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-02-07 22:24:34,423 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 2796 states to 2796 states and 4190 transitions. [2025-02-07 22:24:34,423 INFO L78 Accepts]: Start accepts. Automaton has 2796 states and 4190 transitions. Word has length 350 [2025-02-07 22:24:34,423 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-02-07 22:24:34,424 INFO L471 AbstractCegarLoop]: Abstraction has 2796 states and 4190 transitions. [2025-02-07 22:24:34,424 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 7 states, 7 states have (on average 50.0) internal successors, (350), 6 states have internal predecessors, (350), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-02-07 22:24:34,424 INFO L276 IsEmpty]: Start isEmpty. Operand 2796 states and 4190 transitions. [2025-02-07 22:24:34,428 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 352 [2025-02-07 22:24:34,428 INFO L210 NwaCegarLoop]: Found error trace [2025-02-07 22:24:34,428 INFO L218 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-02-07 22:24:34,428 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable4 [2025-02-07 22:24:34,428 INFO L396 AbstractCegarLoop]: === Iteration 6 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-02-07 22:24:34,429 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-02-07 22:24:34,429 INFO L85 PathProgramCache]: Analyzing trace with hash 980012728, now seen corresponding path program 1 times [2025-02-07 22:24:34,429 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-02-07 22:24:34,429 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1190287741] [2025-02-07 22:24:34,429 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-02-07 22:24:34,429 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-02-07 22:24:34,498 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 351 statements into 1 equivalence classes. [2025-02-07 22:24:35,377 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 351 of 351 statements. [2025-02-07 22:24:35,377 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-02-07 22:24:35,377 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-02-07 22:24:36,337 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-02-07 22:24:36,338 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-02-07 22:24:36,338 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1190287741] [2025-02-07 22:24:36,339 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1190287741] provided 1 perfect and 0 imperfect interpolant sequences [2025-02-07 22:24:36,339 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-02-07 22:24:36,339 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2025-02-07 22:24:36,339 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [343321650] [2025-02-07 22:24:36,339 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-02-07 22:24:36,339 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 8 states [2025-02-07 22:24:36,339 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-02-07 22:24:36,340 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2025-02-07 22:24:36,340 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=15, Invalid=41, Unknown=0, NotChecked=0, Total=56 [2025-02-07 22:24:36,340 INFO L87 Difference]: Start difference. First operand 2796 states and 4190 transitions. Second operand has 8 states, 8 states have (on average 43.875) internal successors, (351), 7 states have internal predecessors, (351), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-02-07 22:24:37,707 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-02-07 22:24:37,707 INFO L93 Difference]: Finished difference Result 8986 states and 13471 transitions. [2025-02-07 22:24:37,707 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 12 states. [2025-02-07 22:24:37,708 INFO L78 Accepts]: Start accepts. Automaton has has 8 states, 8 states have (on average 43.875) internal successors, (351), 7 states have internal predecessors, (351), 0 states have call successors, (0), 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 351 [2025-02-07 22:24:37,708 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-02-07 22:24:37,720 INFO L225 Difference]: With dead ends: 8986 [2025-02-07 22:24:37,720 INFO L226 Difference]: Without dead ends: 4668 [2025-02-07 22:24:37,724 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 14 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 13 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 20 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=58, Invalid=152, Unknown=0, NotChecked=0, Total=210 [2025-02-07 22:24:37,725 INFO L435 NwaCegarLoop]: 1844 mSDtfsCounter, 5553 mSDsluCounter, 8627 mSDsCounter, 0 mSdLazyCounter, 2510 mSolverCounterSat, 45 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 1.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 5553 SdHoareTripleChecker+Valid, 10471 SdHoareTripleChecker+Invalid, 2555 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 45 IncrementalHoareTripleChecker+Valid, 2510 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 1.2s IncrementalHoareTripleChecker+Time [2025-02-07 22:24:37,725 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [5553 Valid, 10471 Invalid, 2555 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [45 Valid, 2510 Invalid, 0 Unknown, 0 Unchecked, 1.2s Time] [2025-02-07 22:24:37,729 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 4668 states. [2025-02-07 22:24:37,775 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 4668 to 4560. [2025-02-07 22:24:37,780 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 4560 states, 4559 states have (on average 1.4998903268260584) internal successors, (6838), 4559 states have internal predecessors, (6838), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-02-07 22:24:37,787 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4560 states to 4560 states and 6838 transitions. [2025-02-07 22:24:37,788 INFO L78 Accepts]: Start accepts. Automaton has 4560 states and 6838 transitions. Word has length 351 [2025-02-07 22:24:37,788 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-02-07 22:24:37,788 INFO L471 AbstractCegarLoop]: Abstraction has 4560 states and 6838 transitions. [2025-02-07 22:24:37,788 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 8 states, 8 states have (on average 43.875) internal successors, (351), 7 states have internal predecessors, (351), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-02-07 22:24:37,789 INFO L276 IsEmpty]: Start isEmpty. Operand 4560 states and 6838 transitions. [2025-02-07 22:24:37,793 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 353 [2025-02-07 22:24:37,793 INFO L210 NwaCegarLoop]: Found error trace [2025-02-07 22:24:37,793 INFO L218 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-02-07 22:24:37,793 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable5 [2025-02-07 22:24:37,793 INFO L396 AbstractCegarLoop]: === Iteration 7 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-02-07 22:24:37,793 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-02-07 22:24:37,793 INFO L85 PathProgramCache]: Analyzing trace with hash 1554580319, now seen corresponding path program 1 times [2025-02-07 22:24:37,794 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-02-07 22:24:37,794 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1867161844] [2025-02-07 22:24:37,794 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-02-07 22:24:37,794 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-02-07 22:24:37,860 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 352 statements into 1 equivalence classes. [2025-02-07 22:24:38,792 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 352 of 352 statements. [2025-02-07 22:24:38,792 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-02-07 22:24:38,792 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-02-07 22:24:39,694 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-02-07 22:24:39,694 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-02-07 22:24:39,695 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1867161844] [2025-02-07 22:24:39,695 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1867161844] provided 1 perfect and 0 imperfect interpolant sequences [2025-02-07 22:24:39,695 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-02-07 22:24:39,695 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2025-02-07 22:24:39,695 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1840195684] [2025-02-07 22:24:39,695 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-02-07 22:24:39,696 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 8 states [2025-02-07 22:24:39,696 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-02-07 22:24:39,697 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2025-02-07 22:24:39,697 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=13, Invalid=43, Unknown=0, NotChecked=0, Total=56 [2025-02-07 22:24:39,697 INFO L87 Difference]: Start difference. First operand 4560 states and 6838 transitions. Second operand has 8 states, 8 states have (on average 44.0) internal successors, (352), 7 states have internal predecessors, (352), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-02-07 22:24:40,653 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-02-07 22:24:40,653 INFO L93 Difference]: Finished difference Result 7052 states and 10569 transitions. [2025-02-07 22:24:40,654 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2025-02-07 22:24:40,654 INFO L78 Accepts]: Start accepts. Automaton has has 8 states, 8 states have (on average 44.0) internal successors, (352), 7 states have internal predecessors, (352), 0 states have call successors, (0), 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 352 [2025-02-07 22:24:40,654 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-02-07 22:24:40,665 INFO L225 Difference]: With dead ends: 7052 [2025-02-07 22:24:40,665 INFO L226 Difference]: Without dead ends: 4581 [2025-02-07 22:24:40,667 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 13 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 11 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 6 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=41, Invalid=115, Unknown=0, NotChecked=0, Total=156 [2025-02-07 22:24:40,668 INFO L435 NwaCegarLoop]: 1334 mSDtfsCounter, 4199 mSDsluCounter, 6665 mSDsCounter, 0 mSdLazyCounter, 1750 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.7s Time, 0 mProtectedPredicate, 0 mProtectedAction, 4199 SdHoareTripleChecker+Valid, 7999 SdHoareTripleChecker+Invalid, 1750 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 1750 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.9s IncrementalHoareTripleChecker+Time [2025-02-07 22:24:40,668 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [4199 Valid, 7999 Invalid, 1750 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 1750 Invalid, 0 Unknown, 0 Unchecked, 0.9s Time] [2025-02-07 22:24:40,670 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 4581 states. [2025-02-07 22:24:40,753 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 4581 to 4563. [2025-02-07 22:24:40,759 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 4563 states, 4562 states have (on average 1.4997807978956599) internal successors, (6842), 4562 states have internal predecessors, (6842), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-02-07 22:24:40,767 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4563 states to 4563 states and 6842 transitions. [2025-02-07 22:24:40,767 INFO L78 Accepts]: Start accepts. Automaton has 4563 states and 6842 transitions. Word has length 352 [2025-02-07 22:24:40,767 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-02-07 22:24:40,767 INFO L471 AbstractCegarLoop]: Abstraction has 4563 states and 6842 transitions. [2025-02-07 22:24:40,768 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 8 states, 8 states have (on average 44.0) internal successors, (352), 7 states have internal predecessors, (352), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-02-07 22:24:40,768 INFO L276 IsEmpty]: Start isEmpty. Operand 4563 states and 6842 transitions. [2025-02-07 22:24:40,773 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 354 [2025-02-07 22:24:40,773 INFO L210 NwaCegarLoop]: Found error trace [2025-02-07 22:24:40,773 INFO L218 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-02-07 22:24:40,773 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable6 [2025-02-07 22:24:40,774 INFO L396 AbstractCegarLoop]: === Iteration 8 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-02-07 22:24:40,774 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-02-07 22:24:40,779 INFO L85 PathProgramCache]: Analyzing trace with hash 351665155, now seen corresponding path program 1 times [2025-02-07 22:24:40,779 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-02-07 22:24:40,779 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1408558165] [2025-02-07 22:24:40,779 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-02-07 22:24:40,779 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-02-07 22:24:40,857 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 353 statements into 1 equivalence classes. [2025-02-07 22:24:41,939 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 353 of 353 statements. [2025-02-07 22:24:41,940 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-02-07 22:24:41,940 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-02-07 22:24:42,700 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-02-07 22:24:42,701 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-02-07 22:24:42,701 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1408558165] [2025-02-07 22:24:42,701 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1408558165] provided 1 perfect and 0 imperfect interpolant sequences [2025-02-07 22:24:42,701 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-02-07 22:24:42,701 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2025-02-07 22:24:42,701 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [44701026] [2025-02-07 22:24:42,701 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-02-07 22:24:42,701 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2025-02-07 22:24:42,702 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-02-07 22:24:42,702 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2025-02-07 22:24:42,702 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=10, Invalid=20, Unknown=0, NotChecked=0, Total=30 [2025-02-07 22:24:42,702 INFO L87 Difference]: Start difference. First operand 4563 states and 6842 transitions. Second operand has 6 states, 6 states have (on average 58.833333333333336) internal successors, (353), 5 states have internal predecessors, (353), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-02-07 22:24:43,625 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-02-07 22:24:43,626 INFO L93 Difference]: Finished difference Result 9404 states and 14098 transitions. [2025-02-07 22:24:43,626 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2025-02-07 22:24:43,626 INFO L78 Accepts]: Start accepts. Automaton has has 6 states, 6 states have (on average 58.833333333333336) internal successors, (353), 5 states have internal predecessors, (353), 0 states have call successors, (0), 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 353 [2025-02-07 22:24:43,627 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-02-07 22:24:43,637 INFO L225 Difference]: With dead ends: 9404 [2025-02-07 22:24:43,637 INFO L226 Difference]: Without dead ends: 4571 [2025-02-07 22:24:43,642 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 9 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 8 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 5 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=31, Invalid=59, Unknown=0, NotChecked=0, Total=90 [2025-02-07 22:24:43,642 INFO L435 NwaCegarLoop]: 2033 mSDtfsCounter, 3334 mSDsluCounter, 5269 mSDsCounter, 0 mSdLazyCounter, 1746 mSolverCounterSat, 33 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.7s Time, 0 mProtectedPredicate, 0 mProtectedAction, 3334 SdHoareTripleChecker+Valid, 7302 SdHoareTripleChecker+Invalid, 1779 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 33 IncrementalHoareTripleChecker+Valid, 1746 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.8s IncrementalHoareTripleChecker+Time [2025-02-07 22:24:43,642 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [3334 Valid, 7302 Invalid, 1779 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [33 Valid, 1746 Invalid, 0 Unknown, 0 Unchecked, 0.8s Time] [2025-02-07 22:24:43,645 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 4571 states. [2025-02-07 22:24:43,678 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 4571 to 4567. [2025-02-07 22:24:43,684 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 4567 states, 4566 states have (on average 1.4993429697766096) internal successors, (6846), 4566 states have internal predecessors, (6846), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-02-07 22:24:43,695 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4567 states to 4567 states and 6846 transitions. [2025-02-07 22:24:43,695 INFO L78 Accepts]: Start accepts. Automaton has 4567 states and 6846 transitions. Word has length 353 [2025-02-07 22:24:43,696 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-02-07 22:24:43,696 INFO L471 AbstractCegarLoop]: Abstraction has 4567 states and 6846 transitions. [2025-02-07 22:24:43,696 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 6 states have (on average 58.833333333333336) internal successors, (353), 5 states have internal predecessors, (353), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-02-07 22:24:43,696 INFO L276 IsEmpty]: Start isEmpty. Operand 4567 states and 6846 transitions. [2025-02-07 22:24:43,699 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 355 [2025-02-07 22:24:43,699 INFO L210 NwaCegarLoop]: Found error trace [2025-02-07 22:24:43,700 INFO L218 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-02-07 22:24:43,701 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable7 [2025-02-07 22:24:43,701 INFO L396 AbstractCegarLoop]: === Iteration 9 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-02-07 22:24:43,701 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-02-07 22:24:43,701 INFO L85 PathProgramCache]: Analyzing trace with hash 1340911626, now seen corresponding path program 1 times [2025-02-07 22:24:43,701 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-02-07 22:24:43,701 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1649680690] [2025-02-07 22:24:43,701 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-02-07 22:24:43,701 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-02-07 22:24:43,762 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 354 statements into 1 equivalence classes. [2025-02-07 22:24:43,822 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 354 of 354 statements. [2025-02-07 22:24:43,822 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-02-07 22:24:43,822 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-02-07 22:24:44,423 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-02-07 22:24:44,423 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-02-07 22:24:44,423 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1649680690] [2025-02-07 22:24:44,423 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1649680690] provided 1 perfect and 0 imperfect interpolant sequences [2025-02-07 22:24:44,423 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-02-07 22:24:44,424 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2025-02-07 22:24:44,424 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [967817689] [2025-02-07 22:24:44,424 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-02-07 22:24:44,424 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2025-02-07 22:24:44,424 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-02-07 22:24:44,425 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2025-02-07 22:24:44,425 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=9, Invalid=11, Unknown=0, NotChecked=0, Total=20 [2025-02-07 22:24:44,425 INFO L87 Difference]: Start difference. First operand 4567 states and 6846 transitions. Second operand has 5 states, 5 states have (on average 70.8) internal successors, (354), 5 states have internal predecessors, (354), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-02-07 22:24:45,087 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-02-07 22:24:45,087 INFO L93 Difference]: Finished difference Result 7077 states and 10604 transitions. [2025-02-07 22:24:45,088 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2025-02-07 22:24:45,088 INFO L78 Accepts]: Start accepts. Automaton has has 5 states, 5 states have (on average 70.8) internal successors, (354), 5 states have internal predecessors, (354), 0 states have call successors, (0), 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 354 [2025-02-07 22:24:45,089 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-02-07 22:24:45,098 INFO L225 Difference]: With dead ends: 7077 [2025-02-07 22:24:45,099 INFO L226 Difference]: Without dead ends: 4575 [2025-02-07 22:24:45,102 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 8 GetRequests, 5 SyntacticMatches, 0 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=9, Invalid=11, Unknown=0, NotChecked=0, Total=20 [2025-02-07 22:24:45,102 INFO L435 NwaCegarLoop]: 1209 mSDtfsCounter, 1625 mSDsluCounter, 2414 mSDsCounter, 0 mSdLazyCounter, 1251 mSolverCounterSat, 1 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.5s Time, 0 mProtectedPredicate, 0 mProtectedAction, 1625 SdHoareTripleChecker+Valid, 3623 SdHoareTripleChecker+Invalid, 1252 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 1 IncrementalHoareTripleChecker+Valid, 1251 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.6s IncrementalHoareTripleChecker+Time [2025-02-07 22:24:45,103 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [1625 Valid, 3623 Invalid, 1252 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [1 Valid, 1251 Invalid, 0 Unknown, 0 Unchecked, 0.6s Time] [2025-02-07 22:24:45,106 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 4575 states. [2025-02-07 22:24:45,144 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 4575 to 4573. [2025-02-07 22:24:45,149 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 4573 states, 4572 states have (on average 1.4986876640419948) internal successors, (6852), 4572 states have internal predecessors, (6852), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-02-07 22:24:45,154 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4573 states to 4573 states and 6852 transitions. [2025-02-07 22:24:45,155 INFO L78 Accepts]: Start accepts. Automaton has 4573 states and 6852 transitions. Word has length 354 [2025-02-07 22:24:45,155 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-02-07 22:24:45,155 INFO L471 AbstractCegarLoop]: Abstraction has 4573 states and 6852 transitions. [2025-02-07 22:24:45,155 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 70.8) internal successors, (354), 5 states have internal predecessors, (354), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-02-07 22:24:45,156 INFO L276 IsEmpty]: Start isEmpty. Operand 4573 states and 6852 transitions. [2025-02-07 22:24:45,159 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 355 [2025-02-07 22:24:45,159 INFO L210 NwaCegarLoop]: Found error trace [2025-02-07 22:24:45,159 INFO L218 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-02-07 22:24:45,159 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable8 [2025-02-07 22:24:45,159 INFO L396 AbstractCegarLoop]: === Iteration 10 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-02-07 22:24:45,160 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-02-07 22:24:45,160 INFO L85 PathProgramCache]: Analyzing trace with hash -99858683, now seen corresponding path program 1 times [2025-02-07 22:24:45,160 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-02-07 22:24:45,160 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1889184281] [2025-02-07 22:24:45,160 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-02-07 22:24:45,160 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-02-07 22:24:45,220 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 354 statements into 1 equivalence classes. [2025-02-07 22:24:46,079 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 354 of 354 statements. [2025-02-07 22:24:46,079 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-02-07 22:24:46,079 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-02-07 22:24:46,667 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-02-07 22:24:46,667 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-02-07 22:24:46,667 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1889184281] [2025-02-07 22:24:46,667 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1889184281] provided 1 perfect and 0 imperfect interpolant sequences [2025-02-07 22:24:46,667 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-02-07 22:24:46,667 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2025-02-07 22:24:46,667 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [565341744] [2025-02-07 22:24:46,667 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-02-07 22:24:46,668 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 7 states [2025-02-07 22:24:46,668 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-02-07 22:24:46,668 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2025-02-07 22:24:46,668 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=15, Invalid=27, Unknown=0, NotChecked=0, Total=42 [2025-02-07 22:24:46,669 INFO L87 Difference]: Start difference. First operand 4573 states and 6852 transitions. Second operand has 7 states, 7 states have (on average 50.57142857142857) internal successors, (354), 7 states have internal predecessors, (354), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-02-07 22:24:47,816 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-02-07 22:24:47,816 INFO L93 Difference]: Finished difference Result 7082 states and 10609 transitions. [2025-02-07 22:24:47,816 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2025-02-07 22:24:47,817 INFO L78 Accepts]: Start accepts. Automaton has has 7 states, 7 states have (on average 50.57142857142857) internal successors, (354), 7 states have internal predecessors, (354), 0 states have call successors, (0), 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 354 [2025-02-07 22:24:47,817 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-02-07 22:24:47,823 INFO L225 Difference]: With dead ends: 7082 [2025-02-07 22:24:47,823 INFO L226 Difference]: Without dead ends: 4581 [2025-02-07 22:24:47,826 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 7 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 5 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=15, Invalid=27, Unknown=0, NotChecked=0, Total=42 [2025-02-07 22:24:47,826 INFO L435 NwaCegarLoop]: 1103 mSDtfsCounter, 1328 mSDsluCounter, 4399 mSDsCounter, 0 mSdLazyCounter, 2613 mSolverCounterSat, 1 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.9s Time, 0 mProtectedPredicate, 0 mProtectedAction, 1328 SdHoareTripleChecker+Valid, 5502 SdHoareTripleChecker+Invalid, 2614 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 1 IncrementalHoareTripleChecker+Valid, 2613 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 1.1s IncrementalHoareTripleChecker+Time [2025-02-07 22:24:47,826 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [1328 Valid, 5502 Invalid, 2614 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [1 Valid, 2613 Invalid, 0 Unknown, 0 Unchecked, 1.1s Time] [2025-02-07 22:24:47,828 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 4581 states. [2025-02-07 22:24:47,858 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 4581 to 4577. [2025-02-07 22:24:47,862 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 4577 states, 4576 states have (on average 1.4982517482517483) internal successors, (6856), 4576 states have internal predecessors, (6856), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-02-07 22:24:47,866 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4577 states to 4577 states and 6856 transitions. [2025-02-07 22:24:47,866 INFO L78 Accepts]: Start accepts. Automaton has 4577 states and 6856 transitions. Word has length 354 [2025-02-07 22:24:47,867 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-02-07 22:24:47,867 INFO L471 AbstractCegarLoop]: Abstraction has 4577 states and 6856 transitions. [2025-02-07 22:24:47,867 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 7 states, 7 states have (on average 50.57142857142857) internal successors, (354), 7 states have internal predecessors, (354), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-02-07 22:24:47,867 INFO L276 IsEmpty]: Start isEmpty. Operand 4577 states and 6856 transitions. [2025-02-07 22:24:47,870 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 356 [2025-02-07 22:24:47,870 INFO L210 NwaCegarLoop]: Found error trace [2025-02-07 22:24:47,870 INFO L218 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-02-07 22:24:47,870 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable9 [2025-02-07 22:24:47,871 INFO L396 AbstractCegarLoop]: === Iteration 11 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-02-07 22:24:47,871 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-02-07 22:24:47,871 INFO L85 PathProgramCache]: Analyzing trace with hash 719687722, now seen corresponding path program 1 times [2025-02-07 22:24:47,871 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-02-07 22:24:47,871 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1279658959] [2025-02-07 22:24:47,871 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-02-07 22:24:47,871 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-02-07 22:24:47,930 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 355 statements into 1 equivalence classes. [2025-02-07 22:24:48,661 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 355 of 355 statements. [2025-02-07 22:24:48,661 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-02-07 22:24:48,661 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-02-07 22:24:49,911 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-02-07 22:24:49,912 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-02-07 22:24:49,912 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1279658959] [2025-02-07 22:24:49,912 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1279658959] provided 1 perfect and 0 imperfect interpolant sequences [2025-02-07 22:24:49,912 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-02-07 22:24:49,912 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [8] imperfect sequences [] total 8 [2025-02-07 22:24:49,912 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [760592259] [2025-02-07 22:24:49,912 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-02-07 22:24:49,913 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 9 states [2025-02-07 22:24:49,913 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-02-07 22:24:49,913 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2025-02-07 22:24:49,913 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=16, Invalid=56, Unknown=0, NotChecked=0, Total=72 [2025-02-07 22:24:49,913 INFO L87 Difference]: Start difference. First operand 4577 states and 6856 transitions. Second operand has 9 states, 9 states have (on average 39.44444444444444) internal successors, (355), 8 states have internal predecessors, (355), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-02-07 22:24:50,795 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-02-07 22:24:50,795 INFO L93 Difference]: Finished difference Result 7073 states and 10589 transitions. [2025-02-07 22:24:50,795 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2025-02-07 22:24:50,796 INFO L78 Accepts]: Start accepts. Automaton has has 9 states, 9 states have (on average 39.44444444444444) internal successors, (355), 8 states have internal predecessors, (355), 0 states have call successors, (0), 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 355 [2025-02-07 22:24:50,796 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-02-07 22:24:50,802 INFO L225 Difference]: With dead ends: 7073 [2025-02-07 22:24:50,803 INFO L226 Difference]: Without dead ends: 4595 [2025-02-07 22:24:50,805 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 15 GetRequests, 1 SyntacticMatches, 1 SemanticMatches, 13 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 13 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=52, Invalid=158, Unknown=0, NotChecked=0, Total=210 [2025-02-07 22:24:50,807 INFO L435 NwaCegarLoop]: 1329 mSDtfsCounter, 4192 mSDsluCounter, 6644 mSDsCounter, 0 mSdLazyCounter, 1777 mSolverCounterSat, 1 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.6s Time, 0 mProtectedPredicate, 0 mProtectedAction, 4192 SdHoareTripleChecker+Valid, 7973 SdHoareTripleChecker+Invalid, 1778 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 1 IncrementalHoareTripleChecker+Valid, 1777 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.8s IncrementalHoareTripleChecker+Time [2025-02-07 22:24:50,807 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [4192 Valid, 7973 Invalid, 1778 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [1 Valid, 1777 Invalid, 0 Unknown, 0 Unchecked, 0.8s Time] [2025-02-07 22:24:50,809 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 4595 states. [2025-02-07 22:24:50,837 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 4595 to 4581. [2025-02-07 22:24:50,841 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 4581 states, 4580 states have (on average 1.4980349344978166) internal successors, (6861), 4580 states have internal predecessors, (6861), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-02-07 22:24:50,845 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4581 states to 4581 states and 6861 transitions. [2025-02-07 22:24:50,845 INFO L78 Accepts]: Start accepts. Automaton has 4581 states and 6861 transitions. Word has length 355 [2025-02-07 22:24:50,846 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-02-07 22:24:50,846 INFO L471 AbstractCegarLoop]: Abstraction has 4581 states and 6861 transitions. [2025-02-07 22:24:50,846 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 9 states, 9 states have (on average 39.44444444444444) internal successors, (355), 8 states have internal predecessors, (355), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-02-07 22:24:50,846 INFO L276 IsEmpty]: Start isEmpty. Operand 4581 states and 6861 transitions. [2025-02-07 22:24:50,850 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 357 [2025-02-07 22:24:50,850 INFO L210 NwaCegarLoop]: Found error trace [2025-02-07 22:24:50,850 INFO L218 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-02-07 22:24:50,850 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable10 [2025-02-07 22:24:50,850 INFO L396 AbstractCegarLoop]: === Iteration 12 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-02-07 22:24:50,851 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-02-07 22:24:50,851 INFO L85 PathProgramCache]: Analyzing trace with hash -42990445, now seen corresponding path program 1 times [2025-02-07 22:24:50,851 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-02-07 22:24:50,851 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1171642132] [2025-02-07 22:24:50,851 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-02-07 22:24:50,851 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-02-07 22:24:50,919 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 356 statements into 1 equivalence classes. [2025-02-07 22:24:52,129 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 356 of 356 statements. [2025-02-07 22:24:52,129 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-02-07 22:24:52,130 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-02-07 22:24:52,957 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-02-07 22:24:52,957 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-02-07 22:24:52,958 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1171642132] [2025-02-07 22:24:52,958 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1171642132] provided 1 perfect and 0 imperfect interpolant sequences [2025-02-07 22:24:52,958 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-02-07 22:24:52,958 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2025-02-07 22:24:52,958 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [335551353] [2025-02-07 22:24:52,958 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-02-07 22:24:52,960 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2025-02-07 22:24:52,960 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-02-07 22:24:52,960 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2025-02-07 22:24:52,960 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=8, Invalid=12, Unknown=0, NotChecked=0, Total=20 [2025-02-07 22:24:52,961 INFO L87 Difference]: Start difference. First operand 4581 states and 6861 transitions. Second operand has 5 states, 5 states have (on average 71.2) internal successors, (356), 4 states have internal predecessors, (356), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-02-07 22:24:53,557 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-02-07 22:24:53,557 INFO L93 Difference]: Finished difference Result 7100 states and 10629 transitions. [2025-02-07 22:24:53,559 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2025-02-07 22:24:53,559 INFO L78 Accepts]: Start accepts. Automaton has has 5 states, 5 states have (on average 71.2) internal successors, (356), 4 states have internal predecessors, (356), 0 states have call successors, (0), 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 356 [2025-02-07 22:24:53,559 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-02-07 22:24:53,565 INFO L225 Difference]: With dead ends: 7100 [2025-02-07 22:24:53,565 INFO L226 Difference]: Without dead ends: 4585 [2025-02-07 22:24:53,568 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 5 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 4 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=12, Invalid=18, Unknown=0, NotChecked=0, Total=30 [2025-02-07 22:24:53,569 INFO L435 NwaCegarLoop]: 1211 mSDtfsCounter, 1307 mSDsluCounter, 2417 mSDsCounter, 0 mSdLazyCounter, 1246 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.5s Time, 0 mProtectedPredicate, 0 mProtectedAction, 1307 SdHoareTripleChecker+Valid, 3628 SdHoareTripleChecker+Invalid, 1246 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 1246 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.6s IncrementalHoareTripleChecker+Time [2025-02-07 22:24:53,569 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [1307 Valid, 3628 Invalid, 1246 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 1246 Invalid, 0 Unknown, 0 Unchecked, 0.6s Time] [2025-02-07 22:24:53,572 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 4585 states. [2025-02-07 22:24:53,597 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 4585 to 4583. [2025-02-07 22:24:53,601 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 4583 states, 4582 states have (on average 1.4978175469227413) internal successors, (6863), 4582 states have internal predecessors, (6863), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-02-07 22:24:53,605 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4583 states to 4583 states and 6863 transitions. [2025-02-07 22:24:53,605 INFO L78 Accepts]: Start accepts. Automaton has 4583 states and 6863 transitions. Word has length 356 [2025-02-07 22:24:53,605 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-02-07 22:24:53,605 INFO L471 AbstractCegarLoop]: Abstraction has 4583 states and 6863 transitions. [2025-02-07 22:24:53,606 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 71.2) internal successors, (356), 4 states have internal predecessors, (356), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-02-07 22:24:53,606 INFO L276 IsEmpty]: Start isEmpty. Operand 4583 states and 6863 transitions. [2025-02-07 22:24:53,609 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 357 [2025-02-07 22:24:53,609 INFO L210 NwaCegarLoop]: Found error trace [2025-02-07 22:24:53,609 INFO L218 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-02-07 22:24:53,609 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable11 [2025-02-07 22:24:53,609 INFO L396 AbstractCegarLoop]: === Iteration 13 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-02-07 22:24:53,610 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-02-07 22:24:53,610 INFO L85 PathProgramCache]: Analyzing trace with hash 725092629, now seen corresponding path program 1 times [2025-02-07 22:24:53,610 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-02-07 22:24:53,610 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2039052398] [2025-02-07 22:24:53,610 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-02-07 22:24:53,610 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-02-07 22:24:53,676 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 356 statements into 1 equivalence classes. [2025-02-07 22:24:54,659 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 356 of 356 statements. [2025-02-07 22:24:54,660 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-02-07 22:24:54,660 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-02-07 22:24:54,962 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-02-07 22:24:54,962 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-02-07 22:24:54,962 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2039052398] [2025-02-07 22:24:54,962 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [2039052398] provided 1 perfect and 0 imperfect interpolant sequences [2025-02-07 22:24:54,962 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-02-07 22:24:54,962 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2025-02-07 22:24:54,962 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2052881302] [2025-02-07 22:24:54,962 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-02-07 22:24:54,963 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2025-02-07 22:24:54,963 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-02-07 22:24:54,963 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2025-02-07 22:24:54,963 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=9, Invalid=11, Unknown=0, NotChecked=0, Total=20 [2025-02-07 22:24:54,963 INFO L87 Difference]: Start difference. First operand 4583 states and 6863 transitions. Second operand has 5 states, 5 states have (on average 71.2) internal successors, (356), 4 states have internal predecessors, (356), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-02-07 22:24:55,744 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-02-07 22:24:55,744 INFO L93 Difference]: Finished difference Result 7093 states and 10620 transitions. [2025-02-07 22:24:55,744 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2025-02-07 22:24:55,745 INFO L78 Accepts]: Start accepts. Automaton has has 5 states, 5 states have (on average 71.2) internal successors, (356), 4 states have internal predecessors, (356), 0 states have call successors, (0), 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 356 [2025-02-07 22:24:55,745 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-02-07 22:24:55,750 INFO L225 Difference]: With dead ends: 7093 [2025-02-07 22:24:55,750 INFO L226 Difference]: Without dead ends: 4585 [2025-02-07 22:24:55,752 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 5 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=9, Invalid=11, Unknown=0, NotChecked=0, Total=20 [2025-02-07 22:24:55,753 INFO L435 NwaCegarLoop]: 1106 mSDtfsCounter, 1298 mSDsluCounter, 2208 mSDsCounter, 0 mSdLazyCounter, 1559 mSolverCounterSat, 1 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.6s Time, 0 mProtectedPredicate, 0 mProtectedAction, 1298 SdHoareTripleChecker+Valid, 3314 SdHoareTripleChecker+Invalid, 1560 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 1 IncrementalHoareTripleChecker+Valid, 1559 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.8s IncrementalHoareTripleChecker+Time [2025-02-07 22:24:55,753 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [1298 Valid, 3314 Invalid, 1560 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [1 Valid, 1559 Invalid, 0 Unknown, 0 Unchecked, 0.8s Time] [2025-02-07 22:24:55,756 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 4585 states. [2025-02-07 22:24:55,783 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 4585 to 4585. [2025-02-07 22:24:55,788 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 4585 states, 4584 states have (on average 1.4976003490401397) internal successors, (6865), 4584 states have internal predecessors, (6865), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-02-07 22:24:55,792 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4585 states to 4585 states and 6865 transitions. [2025-02-07 22:24:55,793 INFO L78 Accepts]: Start accepts. Automaton has 4585 states and 6865 transitions. Word has length 356 [2025-02-07 22:24:55,793 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-02-07 22:24:55,793 INFO L471 AbstractCegarLoop]: Abstraction has 4585 states and 6865 transitions. [2025-02-07 22:24:55,793 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 71.2) internal successors, (356), 4 states have internal predecessors, (356), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-02-07 22:24:55,793 INFO L276 IsEmpty]: Start isEmpty. Operand 4585 states and 6865 transitions. [2025-02-07 22:24:55,796 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 357 [2025-02-07 22:24:55,796 INFO L210 NwaCegarLoop]: Found error trace [2025-02-07 22:24:55,797 INFO L218 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-02-07 22:24:55,797 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable12 [2025-02-07 22:24:55,797 INFO L396 AbstractCegarLoop]: === Iteration 14 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-02-07 22:24:55,797 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-02-07 22:24:55,797 INFO L85 PathProgramCache]: Analyzing trace with hash -1643788082, now seen corresponding path program 1 times [2025-02-07 22:24:55,797 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-02-07 22:24:55,797 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1994668511] [2025-02-07 22:24:55,797 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-02-07 22:24:55,798 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-02-07 22:24:55,860 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 356 statements into 1 equivalence classes. [2025-02-07 22:24:56,641 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 356 of 356 statements. [2025-02-07 22:24:56,641 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-02-07 22:24:56,642 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-02-07 22:24:57,019 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-02-07 22:24:57,019 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-02-07 22:24:57,019 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1994668511] [2025-02-07 22:24:57,019 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1994668511] provided 1 perfect and 0 imperfect interpolant sequences [2025-02-07 22:24:57,019 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-02-07 22:24:57,019 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2025-02-07 22:24:57,020 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [967706494] [2025-02-07 22:24:57,020 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-02-07 22:24:57,020 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2025-02-07 22:24:57,020 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-02-07 22:24:57,020 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2025-02-07 22:24:57,020 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2025-02-07 22:24:57,021 INFO L87 Difference]: Start difference. First operand 4585 states and 6865 transitions. Second operand has 4 states, 4 states have (on average 89.0) internal successors, (356), 4 states have internal predecessors, (356), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-02-07 22:24:57,389 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-02-07 22:24:57,389 INFO L93 Difference]: Finished difference Result 7105 states and 10634 transitions. [2025-02-07 22:24:57,389 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2025-02-07 22:24:57,390 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 4 states have (on average 89.0) internal successors, (356), 4 states have internal predecessors, (356), 0 states have call successors, (0), 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 356 [2025-02-07 22:24:57,390 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-02-07 22:24:57,397 INFO L225 Difference]: With dead ends: 7105 [2025-02-07 22:24:57,397 INFO L226 Difference]: Without dead ends: 4591 [2025-02-07 22:24:57,400 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 6 GetRequests, 4 SyntacticMatches, 0 SemanticMatches, 2 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2025-02-07 22:24:57,400 INFO L435 NwaCegarLoop]: 1353 mSDtfsCounter, 0 mSDsluCounter, 2700 mSDsCounter, 0 mSdLazyCounter, 821 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.3s Time, 0 mProtectedPredicate, 0 mProtectedAction, 0 SdHoareTripleChecker+Valid, 4053 SdHoareTripleChecker+Invalid, 821 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 821 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.3s IncrementalHoareTripleChecker+Time [2025-02-07 22:24:57,400 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [0 Valid, 4053 Invalid, 821 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 821 Invalid, 0 Unknown, 0 Unchecked, 0.3s Time] [2025-02-07 22:24:57,403 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 4591 states. [2025-02-07 22:24:57,428 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 4591 to 4591. [2025-02-07 22:24:57,432 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 4591 states, 4590 states have (on average 1.496949891067538) internal successors, (6871), 4590 states have internal predecessors, (6871), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-02-07 22:24:57,436 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4591 states to 4591 states and 6871 transitions. [2025-02-07 22:24:57,436 INFO L78 Accepts]: Start accepts. Automaton has 4591 states and 6871 transitions. Word has length 356 [2025-02-07 22:24:57,436 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-02-07 22:24:57,436 INFO L471 AbstractCegarLoop]: Abstraction has 4591 states and 6871 transitions. [2025-02-07 22:24:57,436 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 89.0) internal successors, (356), 4 states have internal predecessors, (356), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-02-07 22:24:57,436 INFO L276 IsEmpty]: Start isEmpty. Operand 4591 states and 6871 transitions. [2025-02-07 22:24:57,439 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 358 [2025-02-07 22:24:57,439 INFO L210 NwaCegarLoop]: Found error trace [2025-02-07 22:24:57,439 INFO L218 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-02-07 22:24:57,439 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable13 [2025-02-07 22:24:57,440 INFO L396 AbstractCegarLoop]: === Iteration 15 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-02-07 22:24:57,440 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-02-07 22:24:57,440 INFO L85 PathProgramCache]: Analyzing trace with hash -626860718, now seen corresponding path program 1 times [2025-02-07 22:24:57,440 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-02-07 22:24:57,440 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [37005236] [2025-02-07 22:24:57,440 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-02-07 22:24:57,440 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-02-07 22:24:57,504 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 357 statements into 1 equivalence classes. [2025-02-07 22:24:58,870 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 357 of 357 statements. [2025-02-07 22:24:58,870 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-02-07 22:24:58,871 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-02-07 22:24:59,549 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-02-07 22:24:59,549 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-02-07 22:24:59,549 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [37005236] [2025-02-07 22:24:59,549 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [37005236] provided 1 perfect and 0 imperfect interpolant sequences [2025-02-07 22:24:59,549 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-02-07 22:24:59,549 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2025-02-07 22:24:59,549 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1182978095] [2025-02-07 22:24:59,549 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-02-07 22:24:59,550 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2025-02-07 22:24:59,550 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-02-07 22:24:59,550 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2025-02-07 22:24:59,550 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2025-02-07 22:24:59,551 INFO L87 Difference]: Start difference. First operand 4591 states and 6871 transitions. Second operand has 4 states, 4 states have (on average 89.25) internal successors, (357), 4 states have internal predecessors, (357), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-02-07 22:24:59,932 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-02-07 22:24:59,932 INFO L93 Difference]: Finished difference Result 7187 states and 10747 transitions. [2025-02-07 22:24:59,932 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2025-02-07 22:24:59,933 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 4 states have (on average 89.25) internal successors, (357), 4 states have internal predecessors, (357), 0 states have call successors, (0), 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 357 [2025-02-07 22:24:59,933 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-02-07 22:24:59,939 INFO L225 Difference]: With dead ends: 7187 [2025-02-07 22:24:59,939 INFO L226 Difference]: Without dead ends: 4591 [2025-02-07 22:24:59,943 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 5 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=9, Invalid=11, Unknown=0, NotChecked=0, Total=20 [2025-02-07 22:24:59,944 INFO L435 NwaCegarLoop]: 1346 mSDtfsCounter, 914 mSDsluCounter, 1738 mSDsCounter, 0 mSdLazyCounter, 637 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.3s Time, 0 mProtectedPredicate, 0 mProtectedAction, 914 SdHoareTripleChecker+Valid, 3084 SdHoareTripleChecker+Invalid, 637 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 637 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.4s IncrementalHoareTripleChecker+Time [2025-02-07 22:24:59,945 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [914 Valid, 3084 Invalid, 637 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 637 Invalid, 0 Unknown, 0 Unchecked, 0.4s Time] [2025-02-07 22:24:59,947 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 4591 states. [2025-02-07 22:24:59,968 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 4591 to 2659. [2025-02-07 22:24:59,970 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 2659 states, 2658 states have (on average 1.4932279909706547) internal successors, (3969), 2658 states have internal predecessors, (3969), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-02-07 22:24:59,973 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 2659 states to 2659 states and 3969 transitions. [2025-02-07 22:24:59,973 INFO L78 Accepts]: Start accepts. Automaton has 2659 states and 3969 transitions. Word has length 357 [2025-02-07 22:24:59,973 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-02-07 22:24:59,974 INFO L471 AbstractCegarLoop]: Abstraction has 2659 states and 3969 transitions. [2025-02-07 22:24:59,974 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 89.25) internal successors, (357), 4 states have internal predecessors, (357), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-02-07 22:24:59,974 INFO L276 IsEmpty]: Start isEmpty. Operand 2659 states and 3969 transitions. [2025-02-07 22:24:59,976 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 358 [2025-02-07 22:24:59,976 INFO L210 NwaCegarLoop]: Found error trace [2025-02-07 22:24:59,976 INFO L218 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-02-07 22:24:59,977 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable14 [2025-02-07 22:24:59,977 INFO L396 AbstractCegarLoop]: === Iteration 16 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-02-07 22:24:59,977 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-02-07 22:24:59,977 INFO L85 PathProgramCache]: Analyzing trace with hash -592196436, now seen corresponding path program 1 times [2025-02-07 22:24:59,977 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-02-07 22:24:59,977 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [165007228] [2025-02-07 22:24:59,977 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-02-07 22:24:59,977 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-02-07 22:25:00,037 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 357 statements into 1 equivalence classes. [2025-02-07 22:25:01,225 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 357 of 357 statements. [2025-02-07 22:25:01,225 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-02-07 22:25:01,225 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-02-07 22:25:02,032 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-02-07 22:25:02,033 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-02-07 22:25:02,033 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [165007228] [2025-02-07 22:25:02,033 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [165007228] provided 1 perfect and 0 imperfect interpolant sequences [2025-02-07 22:25:02,033 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-02-07 22:25:02,033 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2025-02-07 22:25:02,033 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1598090002] [2025-02-07 22:25:02,033 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-02-07 22:25:02,034 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 7 states [2025-02-07 22:25:02,034 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-02-07 22:25:02,034 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2025-02-07 22:25:02,034 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=15, Invalid=27, Unknown=0, NotChecked=0, Total=42 [2025-02-07 22:25:02,035 INFO L87 Difference]: Start difference. First operand 2659 states and 3969 transitions. Second operand has 7 states, 7 states have (on average 51.0) internal successors, (357), 7 states have internal predecessors, (357), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-02-07 22:25:03,066 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-02-07 22:25:03,066 INFO L93 Difference]: Finished difference Result 4293 states and 6400 transitions. [2025-02-07 22:25:03,066 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2025-02-07 22:25:03,066 INFO L78 Accepts]: Start accepts. Automaton has has 7 states, 7 states have (on average 51.0) internal successors, (357), 7 states have internal predecessors, (357), 0 states have call successors, (0), 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 357 [2025-02-07 22:25:03,067 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-02-07 22:25:03,069 INFO L225 Difference]: With dead ends: 4293 [2025-02-07 22:25:03,069 INFO L226 Difference]: Without dead ends: 2667 [2025-02-07 22:25:03,071 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 11 GetRequests, 3 SyntacticMatches, 0 SemanticMatches, 8 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 3 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=30, Invalid=60, Unknown=0, NotChecked=0, Total=90 [2025-02-07 22:25:03,071 INFO L435 NwaCegarLoop]: 1097 mSDtfsCounter, 1363 mSDsluCounter, 3593 mSDsCounter, 0 mSdLazyCounter, 2278 mSolverCounterSat, 1 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.8s Time, 0 mProtectedPredicate, 0 mProtectedAction, 1363 SdHoareTripleChecker+Valid, 4690 SdHoareTripleChecker+Invalid, 2279 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 1 IncrementalHoareTripleChecker+Valid, 2278 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 1.0s IncrementalHoareTripleChecker+Time [2025-02-07 22:25:03,071 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [1363 Valid, 4690 Invalid, 2279 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [1 Valid, 2278 Invalid, 0 Unknown, 0 Unchecked, 1.0s Time] [2025-02-07 22:25:03,072 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 2667 states. [2025-02-07 22:25:03,083 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 2667 to 2663. [2025-02-07 22:25:03,085 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 2663 states, 2662 states have (on average 1.4924868519909842) internal successors, (3973), 2662 states have internal predecessors, (3973), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-02-07 22:25:03,087 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 2663 states to 2663 states and 3973 transitions. [2025-02-07 22:25:03,087 INFO L78 Accepts]: Start accepts. Automaton has 2663 states and 3973 transitions. Word has length 357 [2025-02-07 22:25:03,087 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-02-07 22:25:03,087 INFO L471 AbstractCegarLoop]: Abstraction has 2663 states and 3973 transitions. [2025-02-07 22:25:03,087 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 7 states, 7 states have (on average 51.0) internal successors, (357), 7 states have internal predecessors, (357), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-02-07 22:25:03,088 INFO L276 IsEmpty]: Start isEmpty. Operand 2663 states and 3973 transitions. [2025-02-07 22:25:03,089 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 359 [2025-02-07 22:25:03,089 INFO L210 NwaCegarLoop]: Found error trace [2025-02-07 22:25:03,089 INFO L218 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-02-07 22:25:03,089 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable15 [2025-02-07 22:25:03,089 INFO L396 AbstractCegarLoop]: === Iteration 17 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-02-07 22:25:03,090 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-02-07 22:25:03,090 INFO L85 PathProgramCache]: Analyzing trace with hash 1801873204, now seen corresponding path program 1 times [2025-02-07 22:25:03,091 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-02-07 22:25:03,091 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [961917848] [2025-02-07 22:25:03,091 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-02-07 22:25:03,091 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-02-07 22:25:03,172 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 358 statements into 1 equivalence classes. [2025-02-07 22:25:04,007 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 358 of 358 statements. [2025-02-07 22:25:04,007 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-02-07 22:25:04,007 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-02-07 22:25:04,305 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-02-07 22:25:04,305 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-02-07 22:25:04,305 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [961917848] [2025-02-07 22:25:04,305 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [961917848] provided 1 perfect and 0 imperfect interpolant sequences [2025-02-07 22:25:04,305 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-02-07 22:25:04,305 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2025-02-07 22:25:04,305 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1485637572] [2025-02-07 22:25:04,306 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-02-07 22:25:04,306 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2025-02-07 22:25:04,306 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-02-07 22:25:04,306 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2025-02-07 22:25:04,306 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=9, Invalid=11, Unknown=0, NotChecked=0, Total=20 [2025-02-07 22:25:04,307 INFO L87 Difference]: Start difference. First operand 2663 states and 3973 transitions. Second operand has 5 states, 5 states have (on average 71.6) internal successors, (358), 4 states have internal predecessors, (358), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-02-07 22:25:05,062 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-02-07 22:25:05,062 INFO L93 Difference]: Finished difference Result 4293 states and 6398 transitions. [2025-02-07 22:25:05,063 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2025-02-07 22:25:05,063 INFO L78 Accepts]: Start accepts. Automaton has has 5 states, 5 states have (on average 71.6) internal successors, (358), 4 states have internal predecessors, (358), 0 states have call successors, (0), 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 358 [2025-02-07 22:25:05,063 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-02-07 22:25:05,065 INFO L225 Difference]: With dead ends: 4293 [2025-02-07 22:25:05,065 INFO L226 Difference]: Without dead ends: 2665 [2025-02-07 22:25:05,067 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 5 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=9, Invalid=11, Unknown=0, NotChecked=0, Total=20 [2025-02-07 22:25:05,067 INFO L435 NwaCegarLoop]: 1105 mSDtfsCounter, 1333 mSDsluCounter, 2206 mSDsCounter, 0 mSdLazyCounter, 1559 mSolverCounterSat, 1 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.6s Time, 0 mProtectedPredicate, 0 mProtectedAction, 1333 SdHoareTripleChecker+Valid, 3311 SdHoareTripleChecker+Invalid, 1560 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 1 IncrementalHoareTripleChecker+Valid, 1559 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.7s IncrementalHoareTripleChecker+Time [2025-02-07 22:25:05,067 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [1333 Valid, 3311 Invalid, 1560 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [1 Valid, 1559 Invalid, 0 Unknown, 0 Unchecked, 0.7s Time] [2025-02-07 22:25:05,068 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 2665 states. [2025-02-07 22:25:05,079 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 2665 to 2665. [2025-02-07 22:25:05,081 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 2665 states, 2664 states have (on average 1.492117117117117) internal successors, (3975), 2664 states have internal predecessors, (3975), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-02-07 22:25:05,083 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 2665 states to 2665 states and 3975 transitions. [2025-02-07 22:25:05,083 INFO L78 Accepts]: Start accepts. Automaton has 2665 states and 3975 transitions. Word has length 358 [2025-02-07 22:25:05,083 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-02-07 22:25:05,083 INFO L471 AbstractCegarLoop]: Abstraction has 2665 states and 3975 transitions. [2025-02-07 22:25:05,083 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 71.6) internal successors, (358), 4 states have internal predecessors, (358), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-02-07 22:25:05,083 INFO L276 IsEmpty]: Start isEmpty. Operand 2665 states and 3975 transitions. [2025-02-07 22:25:05,085 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 359 [2025-02-07 22:25:05,085 INFO L210 NwaCegarLoop]: Found error trace [2025-02-07 22:25:05,085 INFO L218 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-02-07 22:25:05,085 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable16 [2025-02-07 22:25:05,085 INFO L396 AbstractCegarLoop]: === Iteration 18 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-02-07 22:25:05,085 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-02-07 22:25:05,086 INFO L85 PathProgramCache]: Analyzing trace with hash -423015578, now seen corresponding path program 1 times [2025-02-07 22:25:05,086 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-02-07 22:25:05,086 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [409541963] [2025-02-07 22:25:05,086 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-02-07 22:25:05,086 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-02-07 22:25:05,145 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 358 statements into 1 equivalence classes. [2025-02-07 22:25:06,200 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 358 of 358 statements. [2025-02-07 22:25:06,200 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-02-07 22:25:06,201 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-02-07 22:25:08,016 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-02-07 22:25:08,016 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-02-07 22:25:08,016 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [409541963] [2025-02-07 22:25:08,016 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [409541963] provided 1 perfect and 0 imperfect interpolant sequences [2025-02-07 22:25:08,016 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-02-07 22:25:08,016 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [11] imperfect sequences [] total 11 [2025-02-07 22:25:08,016 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [572487933] [2025-02-07 22:25:08,016 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-02-07 22:25:08,016 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 12 states [2025-02-07 22:25:08,017 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-02-07 22:25:08,017 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 12 interpolants. [2025-02-07 22:25:08,017 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=26, Invalid=106, Unknown=0, NotChecked=0, Total=132 [2025-02-07 22:25:08,017 INFO L87 Difference]: Start difference. First operand 2665 states and 3975 transitions. Second operand has 12 states, 12 states have (on average 29.833333333333332) internal successors, (358), 11 states have internal predecessors, (358), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-02-07 22:25:11,078 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-02-07 22:25:11,078 INFO L93 Difference]: Finished difference Result 8719 states and 12984 transitions. [2025-02-07 22:25:11,078 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 15 states. [2025-02-07 22:25:11,079 INFO L78 Accepts]: Start accepts. Automaton has has 12 states, 12 states have (on average 29.833333333333332) internal successors, (358), 11 states have internal predecessors, (358), 0 states have call successors, (0), 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 358 [2025-02-07 22:25:11,079 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-02-07 22:25:11,083 INFO L225 Difference]: With dead ends: 8719 [2025-02-07 22:25:11,083 INFO L226 Difference]: Without dead ends: 7085 [2025-02-07 22:25:11,085 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 23 GetRequests, 3 SyntacticMatches, 0 SemanticMatches, 20 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 63 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=104, Invalid=358, Unknown=0, NotChecked=0, Total=462 [2025-02-07 22:25:11,085 INFO L435 NwaCegarLoop]: 1719 mSDtfsCounter, 7513 mSDsluCounter, 13279 mSDsCounter, 0 mSdLazyCounter, 7564 mSolverCounterSat, 3 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 2.4s Time, 0 mProtectedPredicate, 0 mProtectedAction, 7513 SdHoareTripleChecker+Valid, 14998 SdHoareTripleChecker+Invalid, 7567 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 3 IncrementalHoareTripleChecker+Valid, 7564 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 2.8s IncrementalHoareTripleChecker+Time [2025-02-07 22:25:11,085 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [7513 Valid, 14998 Invalid, 7567 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [3 Valid, 7564 Invalid, 0 Unknown, 0 Unchecked, 2.8s Time] [2025-02-07 22:25:11,088 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 7085 states. [2025-02-07 22:25:11,135 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 7085 to 4603. [2025-02-07 22:25:11,137 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 4603 states, 4602 states have (on average 1.4960886571056062) internal successors, (6885), 4602 states have internal predecessors, (6885), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-02-07 22:25:11,142 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4603 states to 4603 states and 6885 transitions. [2025-02-07 22:25:11,142 INFO L78 Accepts]: Start accepts. Automaton has 4603 states and 6885 transitions. Word has length 358 [2025-02-07 22:25:11,142 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-02-07 22:25:11,142 INFO L471 AbstractCegarLoop]: Abstraction has 4603 states and 6885 transitions. [2025-02-07 22:25:11,142 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 12 states, 12 states have (on average 29.833333333333332) internal successors, (358), 11 states have internal predecessors, (358), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-02-07 22:25:11,143 INFO L276 IsEmpty]: Start isEmpty. Operand 4603 states and 6885 transitions. [2025-02-07 22:25:11,146 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 360 [2025-02-07 22:25:11,146 INFO L210 NwaCegarLoop]: Found error trace [2025-02-07 22:25:11,146 INFO L218 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-02-07 22:25:11,146 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable17 [2025-02-07 22:25:11,146 INFO L396 AbstractCegarLoop]: === Iteration 19 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-02-07 22:25:11,146 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-02-07 22:25:11,147 INFO L85 PathProgramCache]: Analyzing trace with hash 1532784681, now seen corresponding path program 1 times [2025-02-07 22:25:11,147 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-02-07 22:25:11,147 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1674420250] [2025-02-07 22:25:11,147 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-02-07 22:25:11,147 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-02-07 22:25:11,225 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 359 statements into 1 equivalence classes. [2025-02-07 22:25:12,072 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 359 of 359 statements. [2025-02-07 22:25:12,073 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-02-07 22:25:12,073 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-02-07 22:25:14,277 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-02-07 22:25:14,278 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-02-07 22:25:14,278 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1674420250] [2025-02-07 22:25:14,278 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1674420250] provided 1 perfect and 0 imperfect interpolant sequences [2025-02-07 22:25:14,278 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-02-07 22:25:14,278 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [9] imperfect sequences [] total 9 [2025-02-07 22:25:14,278 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1865499970] [2025-02-07 22:25:14,278 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-02-07 22:25:14,279 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 10 states [2025-02-07 22:25:14,279 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-02-07 22:25:14,279 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 10 interpolants. [2025-02-07 22:25:14,280 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=26, Invalid=64, Unknown=0, NotChecked=0, Total=90 [2025-02-07 22:25:14,280 INFO L87 Difference]: Start difference. First operand 4603 states and 6885 transitions. Second operand has 10 states, 10 states have (on average 35.9) internal successors, (359), 9 states have internal predecessors, (359), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-02-07 22:25:15,363 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-02-07 22:25:15,363 INFO L93 Difference]: Finished difference Result 13739 states and 20553 transitions. [2025-02-07 22:25:15,363 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 16 states. [2025-02-07 22:25:15,363 INFO L78 Accepts]: Start accepts. Automaton has has 10 states, 10 states have (on average 35.9) internal successors, (359), 9 states have internal predecessors, (359), 0 states have call successors, (0), 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 359 [2025-02-07 22:25:15,364 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-02-07 22:25:15,367 INFO L225 Difference]: With dead ends: 13739 [2025-02-07 22:25:15,367 INFO L226 Difference]: Without dead ends: 5411 [2025-02-07 22:25:15,371 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 17 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 16 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 41 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=79, Invalid=227, Unknown=0, NotChecked=0, Total=306 [2025-02-07 22:25:15,372 INFO L435 NwaCegarLoop]: 1421 mSDtfsCounter, 4341 mSDsluCounter, 8458 mSDsCounter, 0 mSdLazyCounter, 2625 mSolverCounterSat, 38 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.8s Time, 0 mProtectedPredicate, 0 mProtectedAction, 4341 SdHoareTripleChecker+Valid, 9879 SdHoareTripleChecker+Invalid, 2663 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 38 IncrementalHoareTripleChecker+Valid, 2625 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 1.0s IncrementalHoareTripleChecker+Time [2025-02-07 22:25:15,372 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [4341 Valid, 9879 Invalid, 2663 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [38 Valid, 2625 Invalid, 0 Unknown, 0 Unchecked, 1.0s Time] [2025-02-07 22:25:15,373 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 5411 states. [2025-02-07 22:25:15,396 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 5411 to 5299. [2025-02-07 22:25:15,399 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 5299 states, 5298 states have (on average 1.4973574933937335) internal successors, (7933), 5298 states have internal predecessors, (7933), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-02-07 22:25:15,403 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5299 states to 5299 states and 7933 transitions. [2025-02-07 22:25:15,403 INFO L78 Accepts]: Start accepts. Automaton has 5299 states and 7933 transitions. Word has length 359 [2025-02-07 22:25:15,403 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-02-07 22:25:15,403 INFO L471 AbstractCegarLoop]: Abstraction has 5299 states and 7933 transitions. [2025-02-07 22:25:15,403 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 10 states, 10 states have (on average 35.9) internal successors, (359), 9 states have internal predecessors, (359), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-02-07 22:25:15,403 INFO L276 IsEmpty]: Start isEmpty. Operand 5299 states and 7933 transitions. [2025-02-07 22:25:15,406 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 361 [2025-02-07 22:25:15,406 INFO L210 NwaCegarLoop]: Found error trace [2025-02-07 22:25:15,406 INFO L218 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-02-07 22:25:15,407 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable18 [2025-02-07 22:25:15,407 INFO L396 AbstractCegarLoop]: === Iteration 20 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-02-07 22:25:15,407 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-02-07 22:25:15,407 INFO L85 PathProgramCache]: Analyzing trace with hash 794241722, now seen corresponding path program 1 times [2025-02-07 22:25:15,408 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-02-07 22:25:15,408 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1350698093] [2025-02-07 22:25:15,408 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-02-07 22:25:15,408 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-02-07 22:25:15,483 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 360 statements into 1 equivalence classes. [2025-02-07 22:25:16,472 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 360 of 360 statements. [2025-02-07 22:25:16,473 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-02-07 22:25:16,473 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-02-07 22:25:17,050 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-02-07 22:25:17,050 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-02-07 22:25:17,050 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1350698093] [2025-02-07 22:25:17,050 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1350698093] provided 1 perfect and 0 imperfect interpolant sequences [2025-02-07 22:25:17,050 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-02-07 22:25:17,050 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2025-02-07 22:25:17,050 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1803392535] [2025-02-07 22:25:17,050 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-02-07 22:25:17,051 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2025-02-07 22:25:17,051 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-02-07 22:25:17,051 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2025-02-07 22:25:17,051 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2025-02-07 22:25:17,052 INFO L87 Difference]: Start difference. First operand 5299 states and 7933 transitions. Second operand has 5 states, 5 states have (on average 72.0) internal successors, (360), 5 states have internal predecessors, (360), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-02-07 22:25:17,489 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-02-07 22:25:17,489 INFO L93 Difference]: Finished difference Result 8217 states and 12292 transitions. [2025-02-07 22:25:17,489 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2025-02-07 22:25:17,490 INFO L78 Accepts]: Start accepts. Automaton has has 5 states, 5 states have (on average 72.0) internal successors, (360), 5 states have internal predecessors, (360), 0 states have call successors, (0), 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 360 [2025-02-07 22:25:17,490 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-02-07 22:25:17,493 INFO L225 Difference]: With dead ends: 8217 [2025-02-07 22:25:17,494 INFO L226 Difference]: Without dead ends: 5299 [2025-02-07 22:25:17,496 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 22:25:17,498 INFO L435 NwaCegarLoop]: 1340 mSDtfsCounter, 1405 mSDsluCounter, 2654 mSDsCounter, 0 mSdLazyCounter, 837 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.3s Time, 0 mProtectedPredicate, 0 mProtectedAction, 1405 SdHoareTripleChecker+Valid, 3994 SdHoareTripleChecker+Invalid, 837 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 837 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.4s IncrementalHoareTripleChecker+Time [2025-02-07 22:25:17,498 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [1405 Valid, 3994 Invalid, 837 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 837 Invalid, 0 Unknown, 0 Unchecked, 0.4s Time] [2025-02-07 22:25:17,504 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 5299 states. [2025-02-07 22:25:17,550 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 5299 to 5299. [2025-02-07 22:25:17,553 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 5299 states, 5298 states have (on average 1.4969799924499811) internal successors, (7931), 5298 states have internal predecessors, (7931), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-02-07 22:25:17,557 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5299 states to 5299 states and 7931 transitions. [2025-02-07 22:25:17,558 INFO L78 Accepts]: Start accepts. Automaton has 5299 states and 7931 transitions. Word has length 360 [2025-02-07 22:25:17,558 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-02-07 22:25:17,558 INFO L471 AbstractCegarLoop]: Abstraction has 5299 states and 7931 transitions. [2025-02-07 22:25:17,558 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 72.0) internal successors, (360), 5 states have internal predecessors, (360), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-02-07 22:25:17,558 INFO L276 IsEmpty]: Start isEmpty. Operand 5299 states and 7931 transitions. [2025-02-07 22:25:17,561 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 362 [2025-02-07 22:25:17,561 INFO L210 NwaCegarLoop]: Found error trace [2025-02-07 22:25:17,561 INFO L218 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-02-07 22:25:17,561 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable19 [2025-02-07 22:25:17,562 INFO L396 AbstractCegarLoop]: === Iteration 21 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-02-07 22:25:17,562 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-02-07 22:25:17,562 INFO L85 PathProgramCache]: Analyzing trace with hash -1894345655, now seen corresponding path program 1 times [2025-02-07 22:25:17,562 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-02-07 22:25:17,562 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1234638359] [2025-02-07 22:25:17,562 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-02-07 22:25:17,563 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-02-07 22:25:17,622 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 361 statements into 1 equivalence classes. [2025-02-07 22:25:18,851 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 361 of 361 statements. [2025-02-07 22:25:18,852 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-02-07 22:25:18,852 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-02-07 22:25:19,403 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-02-07 22:25:19,403 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-02-07 22:25:19,403 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1234638359] [2025-02-07 22:25:19,403 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1234638359] provided 1 perfect and 0 imperfect interpolant sequences [2025-02-07 22:25:19,403 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-02-07 22:25:19,403 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2025-02-07 22:25:19,403 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1469493141] [2025-02-07 22:25:19,403 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-02-07 22:25:19,404 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2025-02-07 22:25:19,404 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-02-07 22:25:19,404 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2025-02-07 22:25:19,404 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=9, Invalid=11, Unknown=0, NotChecked=0, Total=20 [2025-02-07 22:25:19,404 INFO L87 Difference]: Start difference. First operand 5299 states and 7931 transitions. Second operand has 5 states, 5 states have (on average 72.2) internal successors, (361), 5 states have internal predecessors, (361), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-02-07 22:25:19,995 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-02-07 22:25:19,995 INFO L93 Difference]: Finished difference Result 8435 states and 12611 transitions. [2025-02-07 22:25:19,996 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2025-02-07 22:25:19,996 INFO L78 Accepts]: Start accepts. Automaton has has 5 states, 5 states have (on average 72.2) internal successors, (361), 5 states have internal predecessors, (361), 0 states have call successors, (0), 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 361 [2025-02-07 22:25:19,996 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-02-07 22:25:20,001 INFO L225 Difference]: With dead ends: 8435 [2025-02-07 22:25:20,001 INFO L226 Difference]: Without dead ends: 5299 [2025-02-07 22:25:20,004 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 6 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 4 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=14, Invalid=16, Unknown=0, NotChecked=0, Total=30 [2025-02-07 22:25:20,004 INFO L435 NwaCegarLoop]: 1208 mSDtfsCounter, 1449 mSDsluCounter, 1994 mSDsCounter, 0 mSdLazyCounter, 1116 mSolverCounterSat, 1 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.5s Time, 0 mProtectedPredicate, 0 mProtectedAction, 1449 SdHoareTripleChecker+Valid, 3202 SdHoareTripleChecker+Invalid, 1117 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 1 IncrementalHoareTripleChecker+Valid, 1116 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.6s IncrementalHoareTripleChecker+Time [2025-02-07 22:25:20,005 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [1449 Valid, 3202 Invalid, 1117 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [1 Valid, 1116 Invalid, 0 Unknown, 0 Unchecked, 0.6s Time] [2025-02-07 22:25:20,007 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 5299 states. [2025-02-07 22:25:20,030 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 5299 to 3185. [2025-02-07 22:25:20,032 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 3185 states, 3184 states have (on average 1.49214824120603) internal successors, (4751), 3184 states have internal predecessors, (4751), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-02-07 22:25:20,034 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3185 states to 3185 states and 4751 transitions. [2025-02-07 22:25:20,035 INFO L78 Accepts]: Start accepts. Automaton has 3185 states and 4751 transitions. Word has length 361 [2025-02-07 22:25:20,035 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-02-07 22:25:20,035 INFO L471 AbstractCegarLoop]: Abstraction has 3185 states and 4751 transitions. [2025-02-07 22:25:20,035 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 72.2) internal successors, (361), 5 states have internal predecessors, (361), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-02-07 22:25:20,035 INFO L276 IsEmpty]: Start isEmpty. Operand 3185 states and 4751 transitions. [2025-02-07 22:25:20,037 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 362 [2025-02-07 22:25:20,037 INFO L210 NwaCegarLoop]: Found error trace [2025-02-07 22:25:20,037 INFO L218 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-02-07 22:25:20,037 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable20 [2025-02-07 22:25:20,037 INFO L396 AbstractCegarLoop]: === Iteration 22 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-02-07 22:25:20,038 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-02-07 22:25:20,038 INFO L85 PathProgramCache]: Analyzing trace with hash 1133587488, now seen corresponding path program 1 times [2025-02-07 22:25:20,038 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-02-07 22:25:20,038 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [718383217] [2025-02-07 22:25:20,038 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-02-07 22:25:20,038 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-02-07 22:25:20,096 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 361 statements into 1 equivalence classes. [2025-02-07 22:25:21,216 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 361 of 361 statements. [2025-02-07 22:25:21,217 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-02-07 22:25:21,217 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-02-07 22:25:22,381 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-02-07 22:25:22,381 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-02-07 22:25:22,381 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [718383217] [2025-02-07 22:25:22,381 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [718383217] provided 1 perfect and 0 imperfect interpolant sequences [2025-02-07 22:25:22,381 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-02-07 22:25:22,381 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2025-02-07 22:25:22,382 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [794531655] [2025-02-07 22:25:22,385 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-02-07 22:25:22,386 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 8 states [2025-02-07 22:25:22,386 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-02-07 22:25:22,386 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2025-02-07 22:25:22,387 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=16, Invalid=40, Unknown=0, NotChecked=0, Total=56 [2025-02-07 22:25:22,387 INFO L87 Difference]: Start difference. First operand 3185 states and 4751 transitions. Second operand has 8 states, 8 states have (on average 45.125) internal successors, (361), 7 states have internal predecessors, (361), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-02-07 22:25:24,130 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-02-07 22:25:24,132 INFO L93 Difference]: Finished difference Result 7232 states and 10768 transitions. [2025-02-07 22:25:24,132 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2025-02-07 22:25:24,132 INFO L78 Accepts]: Start accepts. Automaton has has 8 states, 8 states have (on average 45.125) internal successors, (361), 7 states have internal predecessors, (361), 0 states have call successors, (0), 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 361 [2025-02-07 22:25:24,133 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-02-07 22:25:24,136 INFO L225 Difference]: With dead ends: 7232 [2025-02-07 22:25:24,136 INFO L226 Difference]: Without dead ends: 4899 [2025-02-07 22:25:24,138 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 13 GetRequests, 4 SyntacticMatches, 0 SemanticMatches, 9 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 9 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=32, Invalid=78, Unknown=0, NotChecked=0, Total=110 [2025-02-07 22:25:24,143 INFO L435 NwaCegarLoop]: 2013 mSDtfsCounter, 2650 mSDsluCounter, 9127 mSDsCounter, 0 mSdLazyCounter, 5193 mSolverCounterSat, 1 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 1.4s Time, 0 mProtectedPredicate, 0 mProtectedAction, 2650 SdHoareTripleChecker+Valid, 11140 SdHoareTripleChecker+Invalid, 5194 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 1 IncrementalHoareTripleChecker+Valid, 5193 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 1.7s IncrementalHoareTripleChecker+Time [2025-02-07 22:25:24,144 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [2650 Valid, 11140 Invalid, 5194 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [1 Valid, 5193 Invalid, 0 Unknown, 0 Unchecked, 1.7s Time] [2025-02-07 22:25:24,146 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 4899 states. [2025-02-07 22:25:24,198 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 4899 to 3543. [2025-02-07 22:25:24,203 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 3543 states, 3542 states have (on average 1.4937888198757765) internal successors, (5291), 3542 states have internal predecessors, (5291), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-02-07 22:25:24,205 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3543 states to 3543 states and 5291 transitions. [2025-02-07 22:25:24,206 INFO L78 Accepts]: Start accepts. Automaton has 3543 states and 5291 transitions. Word has length 361 [2025-02-07 22:25:24,206 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-02-07 22:25:24,206 INFO L471 AbstractCegarLoop]: Abstraction has 3543 states and 5291 transitions. [2025-02-07 22:25:24,206 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 8 states, 8 states have (on average 45.125) internal successors, (361), 7 states have internal predecessors, (361), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-02-07 22:25:24,206 INFO L276 IsEmpty]: Start isEmpty. Operand 3543 states and 5291 transitions. [2025-02-07 22:25:24,208 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 362 [2025-02-07 22:25:24,208 INFO L210 NwaCegarLoop]: Found error trace [2025-02-07 22:25:24,208 INFO L218 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-02-07 22:25:24,209 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable21 [2025-02-07 22:25:24,209 INFO L396 AbstractCegarLoop]: === Iteration 23 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-02-07 22:25:24,210 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-02-07 22:25:24,210 INFO L85 PathProgramCache]: Analyzing trace with hash 489059702, now seen corresponding path program 1 times [2025-02-07 22:25:24,210 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-02-07 22:25:24,210 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1075070378] [2025-02-07 22:25:24,210 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-02-07 22:25:24,210 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-02-07 22:25:24,270 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 361 statements into 1 equivalence classes. [2025-02-07 22:25:25,517 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 361 of 361 statements. [2025-02-07 22:25:25,518 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-02-07 22:25:25,518 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-02-07 22:25:26,451 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-02-07 22:25:26,452 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-02-07 22:25:26,453 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1075070378] [2025-02-07 22:25:26,453 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1075070378] provided 1 perfect and 0 imperfect interpolant sequences [2025-02-07 22:25:26,453 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-02-07 22:25:26,453 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2025-02-07 22:25:26,453 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [421860560] [2025-02-07 22:25:26,453 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-02-07 22:25:26,453 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 8 states [2025-02-07 22:25:26,453 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-02-07 22:25:26,454 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2025-02-07 22:25:26,454 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=16, Invalid=40, Unknown=0, NotChecked=0, Total=56 [2025-02-07 22:25:26,454 INFO L87 Difference]: Start difference. First operand 3543 states and 5291 transitions. Second operand has 8 states, 8 states have (on average 45.125) internal successors, (361), 7 states have internal predecessors, (361), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-02-07 22:25:27,077 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-02-07 22:25:27,078 INFO L93 Difference]: Finished difference Result 8277 states and 12330 transitions. [2025-02-07 22:25:27,078 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2025-02-07 22:25:27,078 INFO L78 Accepts]: Start accepts. Automaton has has 8 states, 8 states have (on average 45.125) internal successors, (361), 7 states have internal predecessors, (361), 0 states have call successors, (0), 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 361 [2025-02-07 22:25:27,078 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-02-07 22:25:27,083 INFO L225 Difference]: With dead ends: 8277 [2025-02-07 22:25:27,083 INFO L226 Difference]: Without dead ends: 5765 [2025-02-07 22:25:27,086 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 12 GetRequests, 3 SyntacticMatches, 0 SemanticMatches, 9 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 9 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=32, Invalid=78, Unknown=0, NotChecked=0, Total=110 [2025-02-07 22:25:27,090 INFO L435 NwaCegarLoop]: 1340 mSDtfsCounter, 3834 mSDsluCounter, 6327 mSDsCounter, 0 mSdLazyCounter, 1622 mSolverCounterSat, 1 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.5s Time, 0 mProtectedPredicate, 0 mProtectedAction, 3834 SdHoareTripleChecker+Valid, 7667 SdHoareTripleChecker+Invalid, 1623 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 1 IncrementalHoareTripleChecker+Valid, 1622 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.6s IncrementalHoareTripleChecker+Time [2025-02-07 22:25:27,090 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [3834 Valid, 7667 Invalid, 1623 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [1 Valid, 1622 Invalid, 0 Unknown, 0 Unchecked, 0.6s Time] [2025-02-07 22:25:27,097 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 5765 states. [2025-02-07 22:25:27,158 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 5765 to 3181. [2025-02-07 22:25:27,160 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 3181 states, 3180 states have (on average 1.491509433962264) internal successors, (4743), 3180 states have internal predecessors, (4743), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-02-07 22:25:27,164 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3181 states to 3181 states and 4743 transitions. [2025-02-07 22:25:27,165 INFO L78 Accepts]: Start accepts. Automaton has 3181 states and 4743 transitions. Word has length 361 [2025-02-07 22:25:27,165 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-02-07 22:25:27,165 INFO L471 AbstractCegarLoop]: Abstraction has 3181 states and 4743 transitions. [2025-02-07 22:25:27,165 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 8 states, 8 states have (on average 45.125) internal successors, (361), 7 states have internal predecessors, (361), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-02-07 22:25:27,165 INFO L276 IsEmpty]: Start isEmpty. Operand 3181 states and 4743 transitions. [2025-02-07 22:25:27,167 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 362 [2025-02-07 22:25:27,167 INFO L210 NwaCegarLoop]: Found error trace [2025-02-07 22:25:27,167 INFO L218 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-02-07 22:25:27,167 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable22 [2025-02-07 22:25:27,167 INFO L396 AbstractCegarLoop]: === Iteration 24 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-02-07 22:25:27,168 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-02-07 22:25:27,169 INFO L85 PathProgramCache]: Analyzing trace with hash -188574112, now seen corresponding path program 1 times [2025-02-07 22:25:27,169 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-02-07 22:25:27,169 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [929499985] [2025-02-07 22:25:27,169 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-02-07 22:25:27,169 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-02-07 22:25:27,250 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 361 statements into 1 equivalence classes. [2025-02-07 22:25:28,642 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 361 of 361 statements. [2025-02-07 22:25:28,643 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-02-07 22:25:28,643 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-02-07 22:25:29,597 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-02-07 22:25:29,597 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-02-07 22:25:29,597 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [929499985] [2025-02-07 22:25:29,597 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [929499985] provided 1 perfect and 0 imperfect interpolant sequences [2025-02-07 22:25:29,597 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-02-07 22:25:29,597 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [8] imperfect sequences [] total 8 [2025-02-07 22:25:29,598 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [266396306] [2025-02-07 22:25:29,598 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-02-07 22:25:29,598 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 9 states [2025-02-07 22:25:29,598 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-02-07 22:25:29,598 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2025-02-07 22:25:29,598 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=22, Invalid=50, Unknown=0, NotChecked=0, Total=72 [2025-02-07 22:25:29,599 INFO L87 Difference]: Start difference. First operand 3181 states and 4743 transitions. Second operand has 9 states, 9 states have (on average 40.111111111111114) internal successors, (361), 8 states have internal predecessors, (361), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-02-07 22:25:30,655 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-02-07 22:25:30,656 INFO L93 Difference]: Finished difference Result 5044 states and 7513 transitions. [2025-02-07 22:25:30,656 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 10 states. [2025-02-07 22:25:30,656 INFO L78 Accepts]: Start accepts. Automaton has has 9 states, 9 states have (on average 40.111111111111114) internal successors, (361), 8 states have internal predecessors, (361), 0 states have call successors, (0), 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 361 [2025-02-07 22:25:30,656 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-02-07 22:25:30,658 INFO L225 Difference]: With dead ends: 5044 [2025-02-07 22:25:30,658 INFO L226 Difference]: Without dead ends: 3189 [2025-02-07 22:25:30,660 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 15 GetRequests, 3 SyntacticMatches, 0 SemanticMatches, 12 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 10 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=55, Invalid=127, Unknown=0, NotChecked=0, Total=182 [2025-02-07 22:25:30,660 INFO L435 NwaCegarLoop]: 1218 mSDtfsCounter, 2723 mSDsluCounter, 6085 mSDsCounter, 0 mSdLazyCounter, 2387 mSolverCounterSat, 1 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.8s Time, 0 mProtectedPredicate, 0 mProtectedAction, 2723 SdHoareTripleChecker+Valid, 7303 SdHoareTripleChecker+Invalid, 2388 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 1 IncrementalHoareTripleChecker+Valid, 2387 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 1.0s IncrementalHoareTripleChecker+Time [2025-02-07 22:25:30,660 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [2723 Valid, 7303 Invalid, 2388 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [1 Valid, 2387 Invalid, 0 Unknown, 0 Unchecked, 1.0s Time] [2025-02-07 22:25:30,662 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 3189 states. [2025-02-07 22:25:30,674 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 3189 to 3187. [2025-02-07 22:25:30,676 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 3187 states, 3186 states have (on average 1.490583804143126) internal successors, (4749), 3186 states have internal predecessors, (4749), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-02-07 22:25:30,678 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3187 states to 3187 states and 4749 transitions. [2025-02-07 22:25:30,678 INFO L78 Accepts]: Start accepts. Automaton has 3187 states and 4749 transitions. Word has length 361 [2025-02-07 22:25:30,678 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-02-07 22:25:30,678 INFO L471 AbstractCegarLoop]: Abstraction has 3187 states and 4749 transitions. [2025-02-07 22:25:30,678 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 9 states, 9 states have (on average 40.111111111111114) internal successors, (361), 8 states have internal predecessors, (361), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-02-07 22:25:30,678 INFO L276 IsEmpty]: Start isEmpty. Operand 3187 states and 4749 transitions. [2025-02-07 22:25:30,680 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 363 [2025-02-07 22:25:30,680 INFO L210 NwaCegarLoop]: Found error trace [2025-02-07 22:25:30,680 INFO L218 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-02-07 22:25:30,680 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable23 [2025-02-07 22:25:30,680 INFO L396 AbstractCegarLoop]: === Iteration 25 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-02-07 22:25:30,681 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-02-07 22:25:30,681 INFO L85 PathProgramCache]: Analyzing trace with hash 1540623857, now seen corresponding path program 1 times [2025-02-07 22:25:30,681 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-02-07 22:25:30,681 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [52102233] [2025-02-07 22:25:30,681 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-02-07 22:25:30,681 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-02-07 22:25:30,737 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 362 statements into 1 equivalence classes. [2025-02-07 22:25:30,981 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 362 of 362 statements. [2025-02-07 22:25:30,981 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-02-07 22:25:30,981 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-02-07 22:25:31,373 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-02-07 22:25:31,374 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-02-07 22:25:31,374 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [52102233] [2025-02-07 22:25:31,374 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [52102233] provided 1 perfect and 0 imperfect interpolant sequences [2025-02-07 22:25:31,374 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-02-07 22:25:31,374 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2025-02-07 22:25:31,374 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1478440844] [2025-02-07 22:25:31,374 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-02-07 22:25:31,374 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2025-02-07 22:25:31,374 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-02-07 22:25:31,375 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2025-02-07 22:25:31,375 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2025-02-07 22:25:31,375 INFO L87 Difference]: Start difference. First operand 3187 states and 4749 transitions. Second operand has 4 states, 4 states have (on average 90.5) internal successors, (362), 4 states have internal predecessors, (362), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-02-07 22:25:31,729 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-02-07 22:25:31,729 INFO L93 Difference]: Finished difference Result 5056 states and 7525 transitions. [2025-02-07 22:25:31,729 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2025-02-07 22:25:31,729 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 4 states have (on average 90.5) internal successors, (362), 4 states have internal predecessors, (362), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 362 [2025-02-07 22:25:31,730 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-02-07 22:25:31,732 INFO L225 Difference]: With dead ends: 5056 [2025-02-07 22:25:31,732 INFO L226 Difference]: Without dead ends: 3193 [2025-02-07 22:25:31,733 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 6 GetRequests, 4 SyntacticMatches, 0 SemanticMatches, 2 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2025-02-07 22:25:31,733 INFO L435 NwaCegarLoop]: 1350 mSDtfsCounter, 0 mSDsluCounter, 2694 mSDsCounter, 0 mSdLazyCounter, 821 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.3s Time, 0 mProtectedPredicate, 0 mProtectedAction, 0 SdHoareTripleChecker+Valid, 4044 SdHoareTripleChecker+Invalid, 821 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 821 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.3s IncrementalHoareTripleChecker+Time [2025-02-07 22:25:31,733 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [0 Valid, 4044 Invalid, 821 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 821 Invalid, 0 Unknown, 0 Unchecked, 0.3s Time] [2025-02-07 22:25:31,734 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 3193 states. [2025-02-07 22:25:31,747 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 3193 to 3193. [2025-02-07 22:25:31,748 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 3193 states, 3192 states have (on average 1.4896616541353382) internal successors, (4755), 3192 states have internal predecessors, (4755), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-02-07 22:25:31,750 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3193 states to 3193 states and 4755 transitions. [2025-02-07 22:25:31,751 INFO L78 Accepts]: Start accepts. Automaton has 3193 states and 4755 transitions. Word has length 362 [2025-02-07 22:25:31,751 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-02-07 22:25:31,751 INFO L471 AbstractCegarLoop]: Abstraction has 3193 states and 4755 transitions. [2025-02-07 22:25:31,751 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 90.5) internal successors, (362), 4 states have internal predecessors, (362), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-02-07 22:25:31,751 INFO L276 IsEmpty]: Start isEmpty. Operand 3193 states and 4755 transitions. [2025-02-07 22:25:31,753 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 364 [2025-02-07 22:25:31,753 INFO L210 NwaCegarLoop]: Found error trace [2025-02-07 22:25:31,753 INFO L218 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-02-07 22:25:31,753 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable24 [2025-02-07 22:25:31,753 INFO L396 AbstractCegarLoop]: === Iteration 26 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-02-07 22:25:31,753 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-02-07 22:25:31,753 INFO L85 PathProgramCache]: Analyzing trace with hash -762061637, now seen corresponding path program 1 times [2025-02-07 22:25:31,754 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-02-07 22:25:31,754 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1877125235] [2025-02-07 22:25:31,754 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-02-07 22:25:31,754 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-02-07 22:25:31,808 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 363 statements into 1 equivalence classes. [2025-02-07 22:25:33,128 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 363 of 363 statements. [2025-02-07 22:25:33,128 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-02-07 22:25:33,128 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat