./Ultimate.py --spec ../sv-benchmarks/c/properties/unreach-call.prp --file ../sv-benchmarks/c/hardware-verification-bv/btor2c-lazyMod.vis_arrays_bpbs_p2.c --full-output --architecture 64bit -------------------------------------------------------------------------------- Checking for ERROR reachability Using default analysis Version c00e63dc Calling Ultimate with: /root/.sdkman/candidates/java/21.0.5-tem/bin/java -Dosgi.configuration.area=/storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/data/config -Xmx15G -Xms4m -jar /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/plugins/org.eclipse.equinox.launcher_1.6.800.v20240513-1750.jar -data @noDefault -ultimatedata /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/data -tc /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/config/AutomizerReach.xml -i ../sv-benchmarks/c/hardware-verification-bv/btor2c-lazyMod.vis_arrays_bpbs_p2.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 4fbb35f76027517819b7c383b61e34fa76a9ce203f76a516ef6e2a6ae9cf5da8 --- Real Ultimate output --- This is Ultimate 0.3.0-?-c00e63d-m [2025-02-05 20:13:03,139 INFO L188 SettingsManager]: Resetting all preferences to default values... [2025-02-05 20:13:03,193 INFO L114 SettingsManager]: Loading settings from /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/config/svcomp-Reach-64bit-Automizer_Default.epf [2025-02-05 20:13:03,197 WARN L101 SettingsManager]: Preference file contains the following unknown settings: [2025-02-05 20:13:03,197 WARN L103 SettingsManager]: * de.uni_freiburg.informatik.ultimate.core.Log level for class [2025-02-05 20:13:03,215 INFO L130 SettingsManager]: Preferences different from defaults after loading the file: [2025-02-05 20:13:03,215 INFO L151 SettingsManager]: Preferences of UltimateCore differ from their defaults: [2025-02-05 20:13:03,216 INFO L153 SettingsManager]: * Log level for class=de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher=ERROR; [2025-02-05 20:13:03,216 INFO L151 SettingsManager]: Preferences of Boogie Preprocessor differ from their defaults: [2025-02-05 20:13:03,216 INFO L153 SettingsManager]: * Use memory slicer=true [2025-02-05 20:13:03,217 INFO L151 SettingsManager]: Preferences of Boogie Procedure Inliner differ from their defaults: [2025-02-05 20:13:03,217 INFO L153 SettingsManager]: * Ignore calls to procedures called more than once=ONLY_FOR_SEQUENTIAL_PROGRAMS [2025-02-05 20:13:03,217 INFO L151 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2025-02-05 20:13:03,217 INFO L153 SettingsManager]: * Create parallel compositions if possible=false [2025-02-05 20:13:03,218 INFO L153 SettingsManager]: * Use SBE=true [2025-02-05 20:13:03,218 INFO L151 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2025-02-05 20:13:03,218 INFO L153 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2025-02-05 20:13:03,218 INFO L153 SettingsManager]: * Overapproximate operations on floating types=true [2025-02-05 20:13:03,218 INFO L153 SettingsManager]: * Check division by zero=IGNORE [2025-02-05 20:13:03,218 INFO L153 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2025-02-05 20:13:03,218 INFO L153 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2025-02-05 20:13:03,218 INFO L153 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2025-02-05 20:13:03,218 INFO L153 SettingsManager]: * Check if freed pointer was valid=false [2025-02-05 20:13:03,219 INFO L153 SettingsManager]: * Behaviour of calls to undefined functions=OVERAPPROXIMATE_BEHAVIOUR [2025-02-05 20:13:03,219 INFO L153 SettingsManager]: * Use constant arrays=true [2025-02-05 20:13:03,219 INFO L151 SettingsManager]: Preferences of IcfgBuilder differ from their defaults: [2025-02-05 20:13:03,219 INFO L153 SettingsManager]: * Size of a code block=SequenceOfStatements [2025-02-05 20:13:03,219 INFO L153 SettingsManager]: * Only consider context switches at boundaries of atomic blocks=true [2025-02-05 20:13:03,219 INFO L153 SettingsManager]: * SMT solver=External_DefaultMode [2025-02-05 20:13:03,219 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2025-02-05 20:13:03,219 INFO L151 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2025-02-05 20:13:03,219 INFO L153 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2025-02-05 20:13:03,219 INFO L153 SettingsManager]: * Compute procedure contracts=false [2025-02-05 20:13:03,220 INFO L153 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopHeads [2025-02-05 20:13:03,220 INFO L153 SettingsManager]: * Trace refinement strategy=CAMEL [2025-02-05 20:13:03,220 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2025-02-05 20:13:03,220 INFO L153 SettingsManager]: * Apply one-shot large block encoding in concurrent analysis=false [2025-02-05 20:13:03,220 INFO L153 SettingsManager]: * Automaton type used in concurrency analysis=PETRI_NET [2025-02-05 20:13:03,220 INFO L153 SettingsManager]: * Order on configurations for Petri net unfoldings=DBO [2025-02-05 20:13:03,220 INFO L153 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode [2025-02-05 20:13:03,220 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 -> 4fbb35f76027517819b7c383b61e34fa76a9ce203f76a516ef6e2a6ae9cf5da8 [2025-02-05 20:13:03,414 INFO L75 nceAwareModelManager]: Repository-Root is: /tmp [2025-02-05 20:13:03,420 INFO L261 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2025-02-05 20:13:03,421 INFO L217 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2025-02-05 20:13:03,422 INFO L270 PluginConnector]: Initializing CDTParser... [2025-02-05 20:13:03,422 INFO L274 PluginConnector]: CDTParser initialized [2025-02-05 20:13:03,423 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.vis_arrays_bpbs_p2.c [2025-02-05 20:13:04,542 INFO L533 CDTParser]: Created temporary CDT project at /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/data/0e2f56a2d/0020a3ef69454679b8893d1fa646626b/FLAG2d057a6ad [2025-02-05 20:13:04,840 INFO L384 CDTParser]: Found 1 translation units. [2025-02-05 20:13:04,840 INFO L180 CDTParser]: Scanning /storage/repos/ultimate-jdk21/releaseScripts/default/sv-benchmarks/c/hardware-verification-bv/btor2c-lazyMod.vis_arrays_bpbs_p2.c [2025-02-05 20:13:04,859 INFO L427 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/data/0e2f56a2d/0020a3ef69454679b8893d1fa646626b/FLAG2d057a6ad [2025-02-05 20:13:05,093 INFO L435 CDTParser]: Successfully deleted /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/data/0e2f56a2d/0020a3ef69454679b8893d1fa646626b [2025-02-05 20:13:05,095 INFO L299 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2025-02-05 20:13:05,096 INFO L133 ToolchainWalker]: Walking toolchain with 6 elements. [2025-02-05 20:13:05,097 INFO L112 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2025-02-05 20:13:05,097 INFO L270 PluginConnector]: Initializing CACSL2BoogieTranslator... [2025-02-05 20:13:05,100 INFO L274 PluginConnector]: CACSL2BoogieTranslator initialized [2025-02-05 20:13:05,100 INFO L184 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 05.02 08:13:05" (1/1) ... [2025-02-05 20:13:05,101 INFO L204 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@45a68aae and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 05.02 08:13:05, skipping insertion in model container [2025-02-05 20:13:05,101 INFO L184 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 05.02 08:13:05" (1/1) ... [2025-02-05 20:13:05,139 INFO L175 MainTranslator]: Built tables and reachable declarations [2025-02-05 20:13:05,259 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.vis_arrays_bpbs_p2.c[1258,1271] [2025-02-05 20:13:05,501 INFO L210 PostProcessor]: Analyzing one entry point: main [2025-02-05 20:13:05,511 INFO L200 MainTranslator]: Completed pre-run [2025-02-05 20:13:05,518 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.vis_arrays_bpbs_p2.c[1258,1271] [2025-02-05 20:13:05,650 INFO L210 PostProcessor]: Analyzing one entry point: main [2025-02-05 20:13:05,661 INFO L204 MainTranslator]: Completed translation [2025-02-05 20:13:05,661 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 05.02 08:13:05 WrapperNode [2025-02-05 20:13:05,662 INFO L131 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2025-02-05 20:13:05,662 INFO L112 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2025-02-05 20:13:05,662 INFO L270 PluginConnector]: Initializing Boogie Procedure Inliner... [2025-02-05 20:13:05,662 INFO L274 PluginConnector]: Boogie Procedure Inliner initialized [2025-02-05 20:13:05,666 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 05.02 08:13:05" (1/1) ... [2025-02-05 20:13:05,726 INFO L184 PluginConnector]: Executing the observer Inliner from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 05.02 08:13:05" (1/1) ... [2025-02-05 20:13:05,988 INFO L138 Inliner]: procedures = 17, calls = 8, calls flagged for inlining = 3, calls inlined = 3, statements flattened = 4637 [2025-02-05 20:13:05,989 INFO L131 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2025-02-05 20:13:05,989 INFO L112 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2025-02-05 20:13:05,989 INFO L270 PluginConnector]: Initializing Boogie Preprocessor... [2025-02-05 20:13:05,989 INFO L274 PluginConnector]: Boogie Preprocessor initialized [2025-02-05 20:13:05,995 INFO L184 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 05.02 08:13:05" (1/1) ... [2025-02-05 20:13:05,996 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 05.02 08:13:05" (1/1) ... [2025-02-05 20:13:06,047 INFO L184 PluginConnector]: Executing the observer MemorySlicer from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 05.02 08:13:05" (1/1) ... [2025-02-05 20:13:06,179 INFO L175 MemorySlicer]: Split 2 memory accesses to 1 slices as follows [2]. 100 percent of accesses are in the largest equivalence class. The 2 initializations are split as follows [2]. The 0 writes are split as follows [0]. [2025-02-05 20:13:06,180 INFO L184 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 05.02 08:13:05" (1/1) ... [2025-02-05 20:13:06,180 INFO L184 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 05.02 08:13:05" (1/1) ... [2025-02-05 20:13:06,318 INFO L184 PluginConnector]: Executing the observer ReplaceArrayAssignments from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 05.02 08:13:05" (1/1) ... [2025-02-05 20:13:06,339 INFO L184 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 05.02 08:13:05" (1/1) ... [2025-02-05 20:13:06,378 INFO L184 PluginConnector]: Executing the observer LTLStepAnnotator from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 05.02 08:13:05" (1/1) ... [2025-02-05 20:13:06,411 INFO L184 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 05.02 08:13:05" (1/1) ... [2025-02-05 20:13:06,464 INFO L131 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2025-02-05 20:13:06,466 INFO L112 PluginConnector]: ------------------------IcfgBuilder---------------------------- [2025-02-05 20:13:06,466 INFO L270 PluginConnector]: Initializing IcfgBuilder... [2025-02-05 20:13:06,466 INFO L274 PluginConnector]: IcfgBuilder initialized [2025-02-05 20:13:06,467 INFO L184 PluginConnector]: Executing the observer IcfgBuilderObserver from plugin IcfgBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 05.02 08:13:05" (1/1) ... [2025-02-05 20:13:06,471 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2025-02-05 20:13:06,482 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 [2025-02-05 20:13:06,494 INFO L229 MonitoredProcess]: Starting monitored process 1 with /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 (exit command is (exit), workingDir is null) [2025-02-05 20:13:06,497 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 (1)] Waiting until timeout for monitored process [2025-02-05 20:13:06,515 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocInit [2025-02-05 20:13:06,515 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int#0 [2025-02-05 20:13:06,516 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2025-02-05 20:13:06,516 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2025-02-05 20:13:06,851 INFO L257 CfgBuilder]: Building ICFG [2025-02-05 20:13:06,853 INFO L287 CfgBuilder]: Building CFG for each procedure with an implementation [2025-02-05 20:13:09,828 INFO L? ?]: Removed 2911 outVars from TransFormulas that were not future-live. [2025-02-05 20:13:09,828 INFO L308 CfgBuilder]: Performing block encoding [2025-02-05 20:13:09,972 INFO L332 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2025-02-05 20:13:09,973 INFO L337 CfgBuilder]: Removed 0 assume(true) statements. [2025-02-05 20:13:09,973 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.icfgbuilder CFG 05.02 08:13:09 BoogieIcfgContainer [2025-02-05 20:13:09,973 INFO L131 PluginConnector]: ------------------------ END IcfgBuilder---------------------------- [2025-02-05 20:13:09,975 INFO L112 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2025-02-05 20:13:09,975 INFO L270 PluginConnector]: Initializing TraceAbstraction... [2025-02-05 20:13:09,979 INFO L274 PluginConnector]: TraceAbstraction initialized [2025-02-05 20:13:09,980 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 05.02 08:13:05" (1/3) ... [2025-02-05 20:13:09,980 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@5adf4be6 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 05.02 08:13:09, skipping insertion in model container [2025-02-05 20:13:09,980 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 05.02 08:13:05" (2/3) ... [2025-02-05 20:13:09,980 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@5adf4be6 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 05.02 08:13:09, skipping insertion in model container [2025-02-05 20:13:09,980 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.icfgbuilder CFG 05.02 08:13:09" (3/3) ... [2025-02-05 20:13:09,981 INFO L128 eAbstractionObserver]: Analyzing ICFG btor2c-lazyMod.vis_arrays_bpbs_p2.c [2025-02-05 20:13:09,993 INFO L216 ceAbstractionStarter]: Automizer settings: Hoare:LoopHeads NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2025-02-05 20:13:09,995 INFO L151 ceAbstractionStarter]: Applying trace abstraction to ICFG btor2c-lazyMod.vis_arrays_bpbs_p2.c that has 1 procedures, 1154 locations, 1 initial locations, 1 loop locations, and 1 error locations. [2025-02-05 20:13:10,084 INFO L332 AbstractCegarLoop]: ======== Iteration 0 == of CEGAR loop == AllErrorsAtOnce ======== [2025-02-05 20:13:10,103 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;@7d3c5b94, mLbeIndependenceSettings=[IndependenceType=SEMANTIC, AbstractionType=NONE, UseConditional=false, UseSemiCommutativity=true, Solver=Z3, SolverTimeout=1000ms] [2025-02-05 20:13:10,103 INFO L334 AbstractCegarLoop]: Starting to check reachability of 1 error locations. [2025-02-05 20:13:10,113 INFO L276 IsEmpty]: Start isEmpty. Operand has 1154 states, 1152 states have (on average 1.4991319444444444) internal successors, (1727), 1153 states have internal predecessors, (1727), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-02-05 20:13:10,134 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 196 [2025-02-05 20:13:10,134 INFO L210 NwaCegarLoop]: Found error trace [2025-02-05 20:13:10,134 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] [2025-02-05 20:13:10,135 INFO L396 AbstractCegarLoop]: === Iteration 1 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-02-05 20:13:10,142 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-02-05 20:13:10,143 INFO L85 PathProgramCache]: Analyzing trace with hash -1322169781, now seen corresponding path program 1 times [2025-02-05 20:13:10,147 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-02-05 20:13:10,168 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1293914190] [2025-02-05 20:13:10,168 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-02-05 20:13:10,169 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-02-05 20:13:10,307 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 195 statements into 1 equivalence classes. [2025-02-05 20:13:10,811 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 195 of 195 statements. [2025-02-05 20:13:10,812 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-02-05 20:13:10,812 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-02-05 20:13:11,921 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-05 20:13:11,924 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-02-05 20:13:11,924 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1293914190] [2025-02-05 20:13:11,924 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1293914190] provided 1 perfect and 0 imperfect interpolant sequences [2025-02-05 20:13:11,924 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-02-05 20:13:11,924 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2025-02-05 20:13:11,925 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [569001195] [2025-02-05 20:13:11,926 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-02-05 20:13:11,928 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2025-02-05 20:13:11,929 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-02-05 20:13:11,945 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2025-02-05 20:13:11,945 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2025-02-05 20:13:11,948 INFO L87 Difference]: Start difference. First operand has 1154 states, 1152 states have (on average 1.4991319444444444) internal successors, (1727), 1153 states have internal predecessors, (1727), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Second operand has 5 states, 5 states have (on average 39.0) internal successors, (195), 5 states have internal predecessors, (195), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-02-05 20:13:12,685 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-02-05 20:13:12,686 INFO L93 Difference]: Finished difference Result 2171 states and 3252 transitions. [2025-02-05 20:13:12,687 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2025-02-05 20:13:12,688 INFO L78 Accepts]: Start accepts. Automaton has has 5 states, 5 states have (on average 39.0) internal successors, (195), 5 states have internal predecessors, (195), 0 states have call successors, (0), 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 195 [2025-02-05 20:13:12,688 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-02-05 20:13:12,702 INFO L225 Difference]: With dead ends: 2171 [2025-02-05 20:13:12,702 INFO L226 Difference]: Without dead ends: 1159 [2025-02-05 20:13:12,711 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 5 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2025-02-05 20:13:12,713 INFO L435 NwaCegarLoop]: 1432 mSDtfsCounter, 6 mSDsluCounter, 4288 mSDsCounter, 0 mSdLazyCounter, 1171 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.5s Time, 0 mProtectedPredicate, 0 mProtectedAction, 6 SdHoareTripleChecker+Valid, 5720 SdHoareTripleChecker+Invalid, 1171 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 1171 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.7s IncrementalHoareTripleChecker+Time [2025-02-05 20:13:12,717 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [6 Valid, 5720 Invalid, 1171 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 1171 Invalid, 0 Unknown, 0 Unchecked, 0.7s Time] [2025-02-05 20:13:12,732 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1159 states. [2025-02-05 20:13:12,787 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1159 to 1157. [2025-02-05 20:13:12,790 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 1157 states, 1156 states have (on average 1.4974048442906573) internal successors, (1731), 1156 states have internal predecessors, (1731), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-02-05 20:13:12,799 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1157 states to 1157 states and 1731 transitions. [2025-02-05 20:13:12,800 INFO L78 Accepts]: Start accepts. Automaton has 1157 states and 1731 transitions. Word has length 195 [2025-02-05 20:13:12,802 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-02-05 20:13:12,802 INFO L471 AbstractCegarLoop]: Abstraction has 1157 states and 1731 transitions. [2025-02-05 20:13:12,802 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 39.0) internal successors, (195), 5 states have internal predecessors, (195), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-02-05 20:13:12,802 INFO L276 IsEmpty]: Start isEmpty. Operand 1157 states and 1731 transitions. [2025-02-05 20:13:12,804 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 197 [2025-02-05 20:13:12,805 INFO L210 NwaCegarLoop]: Found error trace [2025-02-05 20:13:12,805 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] [2025-02-05 20:13:12,805 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable0 [2025-02-05 20:13:12,805 INFO L396 AbstractCegarLoop]: === Iteration 2 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-02-05 20:13:12,809 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-02-05 20:13:12,809 INFO L85 PathProgramCache]: Analyzing trace with hash -1073999853, now seen corresponding path program 1 times [2025-02-05 20:13:12,809 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-02-05 20:13:12,810 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [787375031] [2025-02-05 20:13:12,810 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-02-05 20:13:12,810 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-02-05 20:13:12,882 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 196 statements into 1 equivalence classes. [2025-02-05 20:13:12,940 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 196 of 196 statements. [2025-02-05 20:13:12,941 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-02-05 20:13:12,941 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-02-05 20:13:13,497 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-05 20:13:13,499 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-02-05 20:13:13,499 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [787375031] [2025-02-05 20:13:13,499 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [787375031] provided 1 perfect and 0 imperfect interpolant sequences [2025-02-05 20:13:13,499 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-02-05 20:13:13,499 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2025-02-05 20:13:13,499 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1631183714] [2025-02-05 20:13:13,499 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-02-05 20:13:13,500 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2025-02-05 20:13:13,500 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-02-05 20:13:13,502 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2025-02-05 20:13:13,502 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2025-02-05 20:13:13,502 INFO L87 Difference]: Start difference. First operand 1157 states and 1731 transitions. Second operand has 4 states, 4 states have (on average 49.0) internal successors, (196), 4 states have internal predecessors, (196), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-02-05 20:13:13,939 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-02-05 20:13:13,940 INFO L93 Difference]: Finished difference Result 1161 states and 1735 transitions. [2025-02-05 20:13:13,940 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2025-02-05 20:13:13,940 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 4 states have (on average 49.0) internal successors, (196), 4 states have internal predecessors, (196), 0 states have call successors, (0), 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 196 [2025-02-05 20:13:13,941 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-02-05 20:13:13,945 INFO L225 Difference]: With dead ends: 1161 [2025-02-05 20:13:13,945 INFO L226 Difference]: Without dead ends: 1159 [2025-02-05 20:13:13,945 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 4 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 2 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2025-02-05 20:13:13,946 INFO L435 NwaCegarLoop]: 1435 mSDtfsCounter, 0 mSDsluCounter, 2865 mSDsCounter, 0 mSdLazyCounter, 868 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.3s Time, 0 mProtectedPredicate, 0 mProtectedAction, 0 SdHoareTripleChecker+Valid, 4300 SdHoareTripleChecker+Invalid, 868 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 868 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.4s IncrementalHoareTripleChecker+Time [2025-02-05 20:13:13,946 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [0 Valid, 4300 Invalid, 868 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 868 Invalid, 0 Unknown, 0 Unchecked, 0.4s Time] [2025-02-05 20:13:13,948 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1159 states. [2025-02-05 20:13:13,961 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1159 to 1159. [2025-02-05 20:13:13,962 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 1159 states, 1158 states have (on average 1.496545768566494) internal successors, (1733), 1158 states have internal predecessors, (1733), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-02-05 20:13:13,965 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1159 states to 1159 states and 1733 transitions. [2025-02-05 20:13:13,965 INFO L78 Accepts]: Start accepts. Automaton has 1159 states and 1733 transitions. Word has length 196 [2025-02-05 20:13:13,966 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-02-05 20:13:13,966 INFO L471 AbstractCegarLoop]: Abstraction has 1159 states and 1733 transitions. [2025-02-05 20:13:13,966 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 49.0) internal successors, (196), 4 states have internal predecessors, (196), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-02-05 20:13:13,966 INFO L276 IsEmpty]: Start isEmpty. Operand 1159 states and 1733 transitions. [2025-02-05 20:13:13,968 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 198 [2025-02-05 20:13:13,969 INFO L210 NwaCegarLoop]: Found error trace [2025-02-05 20:13:13,969 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] [2025-02-05 20:13:13,969 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable1 [2025-02-05 20:13:13,969 INFO L396 AbstractCegarLoop]: === Iteration 3 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-02-05 20:13:13,970 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-02-05 20:13:13,970 INFO L85 PathProgramCache]: Analyzing trace with hash 1070423407, now seen corresponding path program 1 times [2025-02-05 20:13:13,970 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-02-05 20:13:13,970 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1188157945] [2025-02-05 20:13:13,970 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-02-05 20:13:13,970 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-02-05 20:13:14,028 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 197 statements into 1 equivalence classes. [2025-02-05 20:13:14,067 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 197 of 197 statements. [2025-02-05 20:13:14,068 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-02-05 20:13:14,068 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-02-05 20:13:14,344 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-05 20:13:14,344 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-02-05 20:13:14,345 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1188157945] [2025-02-05 20:13:14,345 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1188157945] provided 1 perfect and 0 imperfect interpolant sequences [2025-02-05 20:13:14,345 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-02-05 20:13:14,345 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2025-02-05 20:13:14,345 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1712103785] [2025-02-05 20:13:14,345 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-02-05 20:13:14,345 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2025-02-05 20:13:14,345 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-02-05 20:13:14,346 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2025-02-05 20:13:14,346 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2025-02-05 20:13:14,346 INFO L87 Difference]: Start difference. First operand 1159 states and 1733 transitions. Second operand has 4 states, 4 states have (on average 49.25) internal successors, (197), 4 states have internal predecessors, (197), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-02-05 20:13:14,761 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-02-05 20:13:14,761 INFO L93 Difference]: Finished difference Result 2178 states and 3257 transitions. [2025-02-05 20:13:14,762 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2025-02-05 20:13:14,762 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 4 states have (on average 49.25) internal successors, (197), 4 states have internal predecessors, (197), 0 states have call successors, (0), 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 197 [2025-02-05 20:13:14,766 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-02-05 20:13:14,769 INFO L225 Difference]: With dead ends: 2178 [2025-02-05 20:13:14,769 INFO L226 Difference]: Without dead ends: 1161 [2025-02-05 20:13:14,772 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 5 GetRequests, 3 SyntacticMatches, 0 SemanticMatches, 2 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2025-02-05 20:13:14,772 INFO L435 NwaCegarLoop]: 1435 mSDtfsCounter, 0 mSDsluCounter, 2862 mSDsCounter, 0 mSdLazyCounter, 871 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.3s Time, 0 mProtectedPredicate, 0 mProtectedAction, 0 SdHoareTripleChecker+Valid, 4297 SdHoareTripleChecker+Invalid, 871 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 871 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.4s IncrementalHoareTripleChecker+Time [2025-02-05 20:13:14,772 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [0 Valid, 4297 Invalid, 871 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 871 Invalid, 0 Unknown, 0 Unchecked, 0.4s Time] [2025-02-05 20:13:14,774 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1161 states. [2025-02-05 20:13:14,790 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1161 to 1161. [2025-02-05 20:13:14,794 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 1161 states, 1160 states have (on average 1.4956896551724137) internal successors, (1735), 1160 states have internal predecessors, (1735), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-02-05 20:13:14,797 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1161 states to 1161 states and 1735 transitions. [2025-02-05 20:13:14,797 INFO L78 Accepts]: Start accepts. Automaton has 1161 states and 1735 transitions. Word has length 197 [2025-02-05 20:13:14,797 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-02-05 20:13:14,797 INFO L471 AbstractCegarLoop]: Abstraction has 1161 states and 1735 transitions. [2025-02-05 20:13:14,797 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 49.25) internal successors, (197), 4 states have internal predecessors, (197), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-02-05 20:13:14,798 INFO L276 IsEmpty]: Start isEmpty. Operand 1161 states and 1735 transitions. [2025-02-05 20:13:14,799 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 199 [2025-02-05 20:13:14,799 INFO L210 NwaCegarLoop]: Found error trace [2025-02-05 20:13:14,799 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] [2025-02-05 20:13:14,799 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable2 [2025-02-05 20:13:14,799 INFO L396 AbstractCegarLoop]: === Iteration 4 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-02-05 20:13:14,800 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-02-05 20:13:14,800 INFO L85 PathProgramCache]: Analyzing trace with hash 754897806, now seen corresponding path program 1 times [2025-02-05 20:13:14,801 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-02-05 20:13:14,801 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [971480883] [2025-02-05 20:13:14,801 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-02-05 20:13:14,801 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-02-05 20:13:14,846 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 198 statements into 1 equivalence classes. [2025-02-05 20:13:14,951 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 198 of 198 statements. [2025-02-05 20:13:14,951 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-02-05 20:13:14,952 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-02-05 20:13:15,592 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-05 20:13:15,593 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-02-05 20:13:15,593 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [971480883] [2025-02-05 20:13:15,593 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [971480883] provided 1 perfect and 0 imperfect interpolant sequences [2025-02-05 20:13:15,593 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-02-05 20:13:15,593 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2025-02-05 20:13:15,593 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1831962007] [2025-02-05 20:13:15,593 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-02-05 20:13:15,593 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 7 states [2025-02-05 20:13:15,594 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-02-05 20:13:15,594 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2025-02-05 20:13:15,594 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=15, Invalid=27, Unknown=0, NotChecked=0, Total=42 [2025-02-05 20:13:15,594 INFO L87 Difference]: Start difference. First operand 1161 states and 1735 transitions. Second operand has 7 states, 7 states have (on average 28.285714285714285) internal successors, (198), 7 states have internal predecessors, (198), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-02-05 20:13:16,296 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-02-05 20:13:16,297 INFO L93 Difference]: Finished difference Result 2188 states and 3270 transitions. [2025-02-05 20:13:16,297 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2025-02-05 20:13:16,297 INFO L78 Accepts]: Start accepts. Automaton has has 7 states, 7 states have (on average 28.285714285714285) internal successors, (198), 7 states have internal predecessors, (198), 0 states have call successors, (0), 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 198 [2025-02-05 20:13:16,297 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-02-05 20:13:16,301 INFO L225 Difference]: With dead ends: 2188 [2025-02-05 20:13:16,301 INFO L226 Difference]: Without dead ends: 1169 [2025-02-05 20:13:16,302 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 8 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 6 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 4 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=19, Invalid=37, Unknown=0, NotChecked=0, Total=56 [2025-02-05 20:13:16,304 INFO L435 NwaCegarLoop]: 1402 mSDtfsCounter, 1650 mSDsluCounter, 4198 mSDsCounter, 0 mSdLazyCounter, 1295 mSolverCounterSat, 1 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.5s Time, 0 mProtectedPredicate, 0 mProtectedAction, 1650 SdHoareTripleChecker+Valid, 5600 SdHoareTripleChecker+Invalid, 1296 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 1 IncrementalHoareTripleChecker+Valid, 1295 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.6s IncrementalHoareTripleChecker+Time [2025-02-05 20:13:16,304 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [1650 Valid, 5600 Invalid, 1296 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [1 Valid, 1295 Invalid, 0 Unknown, 0 Unchecked, 0.6s Time] [2025-02-05 20:13:16,307 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1169 states. [2025-02-05 20:13:16,318 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1169 to 1166. [2025-02-05 20:13:16,319 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 1166 states, 1165 states have (on average 1.4944206008583691) internal successors, (1741), 1165 states have internal predecessors, (1741), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-02-05 20:13:16,322 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1166 states to 1166 states and 1741 transitions. [2025-02-05 20:13:16,322 INFO L78 Accepts]: Start accepts. Automaton has 1166 states and 1741 transitions. Word has length 198 [2025-02-05 20:13:16,322 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-02-05 20:13:16,323 INFO L471 AbstractCegarLoop]: Abstraction has 1166 states and 1741 transitions. [2025-02-05 20:13:16,323 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 7 states, 7 states have (on average 28.285714285714285) internal successors, (198), 7 states have internal predecessors, (198), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-02-05 20:13:16,323 INFO L276 IsEmpty]: Start isEmpty. Operand 1166 states and 1741 transitions. [2025-02-05 20:13:16,324 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 200 [2025-02-05 20:13:16,324 INFO L210 NwaCegarLoop]: Found error trace [2025-02-05 20:13:16,324 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] [2025-02-05 20:13:16,324 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable3 [2025-02-05 20:13:16,324 INFO L396 AbstractCegarLoop]: === Iteration 5 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-02-05 20:13:16,325 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-02-05 20:13:16,325 INFO L85 PathProgramCache]: Analyzing trace with hash -1821708898, now seen corresponding path program 1 times [2025-02-05 20:13:16,325 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-02-05 20:13:16,325 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [896575666] [2025-02-05 20:13:16,325 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-02-05 20:13:16,325 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-02-05 20:13:16,365 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 199 statements into 1 equivalence classes. [2025-02-05 20:13:16,453 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 199 of 199 statements. [2025-02-05 20:13:16,454 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-02-05 20:13:16,454 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-02-05 20:13:16,851 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-02-05 20:13:16,851 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-02-05 20:13:16,851 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [896575666] [2025-02-05 20:13:16,851 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [896575666] provided 1 perfect and 0 imperfect interpolant sequences [2025-02-05 20:13:16,851 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-02-05 20:13:16,851 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2025-02-05 20:13:16,851 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [67937617] [2025-02-05 20:13:16,852 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-02-05 20:13:16,852 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2025-02-05 20:13:16,852 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-02-05 20:13:16,852 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2025-02-05 20:13:16,852 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2025-02-05 20:13:16,853 INFO L87 Difference]: Start difference. First operand 1166 states and 1741 transitions. Second operand has 5 states, 5 states have (on average 39.8) internal successors, (199), 5 states have internal predecessors, (199), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-02-05 20:13:17,427 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-02-05 20:13:17,428 INFO L93 Difference]: Finished difference Result 2196 states and 3279 transitions. [2025-02-05 20:13:17,428 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2025-02-05 20:13:17,428 INFO L78 Accepts]: Start accepts. Automaton has has 5 states, 5 states have (on average 39.8) internal successors, (199), 5 states have internal predecessors, (199), 0 states have call successors, (0), 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 199 [2025-02-05 20:13:17,428 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-02-05 20:13:17,432 INFO L225 Difference]: With dead ends: 2196 [2025-02-05 20:13:17,432 INFO L226 Difference]: Without dead ends: 1172 [2025-02-05 20:13:17,433 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 5 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2025-02-05 20:13:17,433 INFO L435 NwaCegarLoop]: 1432 mSDtfsCounter, 5 mSDsluCounter, 4288 mSDsCounter, 0 mSdLazyCounter, 1171 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.4s Time, 0 mProtectedPredicate, 0 mProtectedAction, 5 SdHoareTripleChecker+Valid, 5720 SdHoareTripleChecker+Invalid, 1171 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 1171 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.5s IncrementalHoareTripleChecker+Time [2025-02-05 20:13:17,433 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [5 Valid, 5720 Invalid, 1171 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 1171 Invalid, 0 Unknown, 0 Unchecked, 0.5s Time] [2025-02-05 20:13:17,435 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1172 states. [2025-02-05 20:13:17,445 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1172 to 1170. [2025-02-05 20:13:17,447 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 1170 states, 1169 states have (on average 1.4935842600513258) internal successors, (1746), 1169 states have internal predecessors, (1746), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-02-05 20:13:17,449 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1170 states to 1170 states and 1746 transitions. [2025-02-05 20:13:17,449 INFO L78 Accepts]: Start accepts. Automaton has 1170 states and 1746 transitions. Word has length 199 [2025-02-05 20:13:17,450 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-02-05 20:13:17,450 INFO L471 AbstractCegarLoop]: Abstraction has 1170 states and 1746 transitions. [2025-02-05 20:13:17,450 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 39.8) internal successors, (199), 5 states have internal predecessors, (199), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-02-05 20:13:17,450 INFO L276 IsEmpty]: Start isEmpty. Operand 1170 states and 1746 transitions. [2025-02-05 20:13:17,451 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 200 [2025-02-05 20:13:17,451 INFO L210 NwaCegarLoop]: Found error trace [2025-02-05 20:13:17,451 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] [2025-02-05 20:13:17,451 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable4 [2025-02-05 20:13:17,452 INFO L396 AbstractCegarLoop]: === Iteration 6 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-02-05 20:13:17,452 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-02-05 20:13:17,452 INFO L85 PathProgramCache]: Analyzing trace with hash 1341129891, now seen corresponding path program 1 times [2025-02-05 20:13:17,452 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-02-05 20:13:17,452 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1437035926] [2025-02-05 20:13:17,452 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-02-05 20:13:17,452 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-02-05 20:13:17,494 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 199 statements into 1 equivalence classes. [2025-02-05 20:13:17,526 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 199 of 199 statements. [2025-02-05 20:13:17,527 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-02-05 20:13:17,527 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-02-05 20:13:18,037 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-05 20:13:18,038 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-02-05 20:13:18,038 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1437035926] [2025-02-05 20:13:18,038 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1437035926] provided 1 perfect and 0 imperfect interpolant sequences [2025-02-05 20:13:18,038 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-02-05 20:13:18,038 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [8] imperfect sequences [] total 8 [2025-02-05 20:13:18,038 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [771160632] [2025-02-05 20:13:18,038 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-02-05 20:13:18,040 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 8 states [2025-02-05 20:13:18,040 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-02-05 20:13:18,041 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2025-02-05 20:13:18,041 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=15, Invalid=41, Unknown=0, NotChecked=0, Total=56 [2025-02-05 20:13:18,041 INFO L87 Difference]: Start difference. First operand 1170 states and 1746 transitions. Second operand has 8 states, 8 states have (on average 24.875) internal successors, (199), 8 states have internal predecessors, (199), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-02-05 20:13:18,902 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-02-05 20:13:18,902 INFO L93 Difference]: Finished difference Result 2237 states and 3337 transitions. [2025-02-05 20:13:18,903 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2025-02-05 20:13:18,903 INFO L78 Accepts]: Start accepts. Automaton has has 8 states, 8 states have (on average 24.875) internal successors, (199), 8 states have internal predecessors, (199), 0 states have call successors, (0), 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 199 [2025-02-05 20:13:18,903 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-02-05 20:13:18,907 INFO L225 Difference]: With dead ends: 2237 [2025-02-05 20:13:18,907 INFO L226 Difference]: Without dead ends: 1209 [2025-02-05 20:13:18,908 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 8 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 6 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 2 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=15, Invalid=41, Unknown=0, NotChecked=0, Total=56 [2025-02-05 20:13:18,909 INFO L435 NwaCegarLoop]: 1430 mSDtfsCounter, 31 mSDsluCounter, 7164 mSDsCounter, 0 mSdLazyCounter, 1781 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.7s Time, 0 mProtectedPredicate, 0 mProtectedAction, 31 SdHoareTripleChecker+Valid, 8594 SdHoareTripleChecker+Invalid, 1781 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 1781 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.8s IncrementalHoareTripleChecker+Time [2025-02-05 20:13:18,909 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [31 Valid, 8594 Invalid, 1781 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 1781 Invalid, 0 Unknown, 0 Unchecked, 0.8s Time] [2025-02-05 20:13:18,912 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1209 states. [2025-02-05 20:13:18,924 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1209 to 1205. [2025-02-05 20:13:18,926 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 1205 states, 1204 states have (on average 1.4925249169435215) internal successors, (1797), 1204 states have internal predecessors, (1797), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-02-05 20:13:18,929 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1205 states to 1205 states and 1797 transitions. [2025-02-05 20:13:18,929 INFO L78 Accepts]: Start accepts. Automaton has 1205 states and 1797 transitions. Word has length 199 [2025-02-05 20:13:18,929 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-02-05 20:13:18,929 INFO L471 AbstractCegarLoop]: Abstraction has 1205 states and 1797 transitions. [2025-02-05 20:13:18,929 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 8 states, 8 states have (on average 24.875) internal successors, (199), 8 states have internal predecessors, (199), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-02-05 20:13:18,930 INFO L276 IsEmpty]: Start isEmpty. Operand 1205 states and 1797 transitions. [2025-02-05 20:13:18,932 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 200 [2025-02-05 20:13:18,932 INFO L210 NwaCegarLoop]: Found error trace [2025-02-05 20:13:18,932 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] [2025-02-05 20:13:18,933 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable5 [2025-02-05 20:13:18,933 INFO L396 AbstractCegarLoop]: === Iteration 7 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-02-05 20:13:18,934 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-02-05 20:13:18,934 INFO L85 PathProgramCache]: Analyzing trace with hash -817577939, now seen corresponding path program 1 times [2025-02-05 20:13:18,934 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-02-05 20:13:18,934 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1647954029] [2025-02-05 20:13:18,934 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-02-05 20:13:18,934 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-02-05 20:13:18,975 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 199 statements into 1 equivalence classes. [2025-02-05 20:13:19,000 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 199 of 199 statements. [2025-02-05 20:13:19,001 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-02-05 20:13:19,002 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-02-05 20:13:19,226 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-05 20:13:19,227 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-02-05 20:13:19,227 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1647954029] [2025-02-05 20:13:19,227 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1647954029] provided 1 perfect and 0 imperfect interpolant sequences [2025-02-05 20:13:19,227 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-02-05 20:13:19,227 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2025-02-05 20:13:19,227 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1587906416] [2025-02-05 20:13:19,227 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-02-05 20:13:19,228 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2025-02-05 20:13:19,228 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-02-05 20:13:19,228 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2025-02-05 20:13:19,228 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=10, Invalid=20, Unknown=0, NotChecked=0, Total=30 [2025-02-05 20:13:19,229 INFO L87 Difference]: Start difference. First operand 1205 states and 1797 transitions. Second operand has 6 states, 6 states have (on average 33.166666666666664) internal successors, (199), 6 states have internal predecessors, (199), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-02-05 20:13:19,724 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-02-05 20:13:19,725 INFO L93 Difference]: Finished difference Result 2280 states and 3400 transitions. [2025-02-05 20:13:19,725 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2025-02-05 20:13:19,725 INFO L78 Accepts]: Start accepts. Automaton has has 6 states, 6 states have (on average 33.166666666666664) internal successors, (199), 6 states have internal predecessors, (199), 0 states have call successors, (0), 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 199 [2025-02-05 20:13:19,725 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-02-05 20:13:19,729 INFO L225 Difference]: With dead ends: 2280 [2025-02-05 20:13:19,729 INFO L226 Difference]: Without dead ends: 1217 [2025-02-05 20:13:19,730 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 6 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 4 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=10, Invalid=20, Unknown=0, NotChecked=0, Total=30 [2025-02-05 20:13:19,730 INFO L435 NwaCegarLoop]: 1434 mSDtfsCounter, 4 mSDsluCounter, 4292 mSDsCounter, 0 mSdLazyCounter, 1166 mSolverCounterSat, 1 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.4s Time, 0 mProtectedPredicate, 0 mProtectedAction, 4 SdHoareTripleChecker+Valid, 5726 SdHoareTripleChecker+Invalid, 1167 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 1 IncrementalHoareTripleChecker+Valid, 1166 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.5s IncrementalHoareTripleChecker+Time [2025-02-05 20:13:19,730 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [4 Valid, 5726 Invalid, 1167 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [1 Valid, 1166 Invalid, 0 Unknown, 0 Unchecked, 0.5s Time] [2025-02-05 20:13:19,732 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1217 states. [2025-02-05 20:13:19,743 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1217 to 1217. [2025-02-05 20:13:19,744 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 1217 states, 1216 states have (on average 1.490953947368421) internal successors, (1813), 1216 states have internal predecessors, (1813), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-02-05 20:13:19,747 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1217 states to 1217 states and 1813 transitions. [2025-02-05 20:13:19,747 INFO L78 Accepts]: Start accepts. Automaton has 1217 states and 1813 transitions. Word has length 199 [2025-02-05 20:13:19,747 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-02-05 20:13:19,747 INFO L471 AbstractCegarLoop]: Abstraction has 1217 states and 1813 transitions. [2025-02-05 20:13:19,747 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 6 states have (on average 33.166666666666664) internal successors, (199), 6 states have internal predecessors, (199), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-02-05 20:13:19,748 INFO L276 IsEmpty]: Start isEmpty. Operand 1217 states and 1813 transitions. [2025-02-05 20:13:19,749 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 200 [2025-02-05 20:13:19,749 INFO L210 NwaCegarLoop]: Found error trace [2025-02-05 20:13:19,749 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] [2025-02-05 20:13:19,749 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable6 [2025-02-05 20:13:19,749 INFO L396 AbstractCegarLoop]: === Iteration 8 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-02-05 20:13:19,749 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-02-05 20:13:19,750 INFO L85 PathProgramCache]: Analyzing trace with hash -472939559, now seen corresponding path program 1 times [2025-02-05 20:13:19,750 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-02-05 20:13:19,750 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1218617555] [2025-02-05 20:13:19,750 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-02-05 20:13:19,750 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-02-05 20:13:19,787 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 199 statements into 1 equivalence classes. [2025-02-05 20:13:19,832 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 199 of 199 statements. [2025-02-05 20:13:19,832 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-02-05 20:13:19,832 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-02-05 20:13:20,015 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-05 20:13:20,016 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-02-05 20:13:20,016 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1218617555] [2025-02-05 20:13:20,016 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1218617555] provided 1 perfect and 0 imperfect interpolant sequences [2025-02-05 20:13:20,016 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-02-05 20:13:20,016 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2025-02-05 20:13:20,017 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [251843439] [2025-02-05 20:13:20,017 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-02-05 20:13:20,017 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2025-02-05 20:13:20,017 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-02-05 20:13:20,017 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2025-02-05 20:13:20,017 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=10, Invalid=20, Unknown=0, NotChecked=0, Total=30 [2025-02-05 20:13:20,018 INFO L87 Difference]: Start difference. First operand 1217 states and 1813 transitions. Second operand has 6 states, 6 states have (on average 33.166666666666664) internal successors, (199), 6 states have internal predecessors, (199), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-02-05 20:13:20,622 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-02-05 20:13:20,622 INFO L93 Difference]: Finished difference Result 2298 states and 3423 transitions. [2025-02-05 20:13:20,622 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2025-02-05 20:13:20,623 INFO L78 Accepts]: Start accepts. Automaton has has 6 states, 6 states have (on average 33.166666666666664) internal successors, (199), 6 states have internal predecessors, (199), 0 states have call successors, (0), 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 199 [2025-02-05 20:13:20,623 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-02-05 20:13:20,626 INFO L225 Difference]: With dead ends: 2298 [2025-02-05 20:13:20,627 INFO L226 Difference]: Without dead ends: 1223 [2025-02-05 20:13:20,628 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 6 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 4 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=10, Invalid=20, Unknown=0, NotChecked=0, Total=30 [2025-02-05 20:13:20,628 INFO L435 NwaCegarLoop]: 1434 mSDtfsCounter, 4 mSDsluCounter, 5721 mSDsCounter, 0 mSdLazyCounter, 1459 mSolverCounterSat, 1 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.5s Time, 0 mProtectedPredicate, 0 mProtectedAction, 4 SdHoareTripleChecker+Valid, 7155 SdHoareTripleChecker+Invalid, 1460 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 1 IncrementalHoareTripleChecker+Valid, 1459 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.6s IncrementalHoareTripleChecker+Time [2025-02-05 20:13:20,628 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [4 Valid, 7155 Invalid, 1460 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [1 Valid, 1459 Invalid, 0 Unknown, 0 Unchecked, 0.6s Time] [2025-02-05 20:13:20,631 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1223 states. [2025-02-05 20:13:20,643 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1223 to 1223. [2025-02-05 20:13:20,645 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 1223 states, 1222 states have (on average 1.4901800327332242) internal successors, (1821), 1222 states have internal predecessors, (1821), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-02-05 20:13:20,647 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1223 states to 1223 states and 1821 transitions. [2025-02-05 20:13:20,647 INFO L78 Accepts]: Start accepts. Automaton has 1223 states and 1821 transitions. Word has length 199 [2025-02-05 20:13:20,647 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-02-05 20:13:20,648 INFO L471 AbstractCegarLoop]: Abstraction has 1223 states and 1821 transitions. [2025-02-05 20:13:20,648 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 6 states have (on average 33.166666666666664) internal successors, (199), 6 states have internal predecessors, (199), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-02-05 20:13:20,648 INFO L276 IsEmpty]: Start isEmpty. Operand 1223 states and 1821 transitions. [2025-02-05 20:13:20,649 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 201 [2025-02-05 20:13:20,649 INFO L210 NwaCegarLoop]: Found error trace [2025-02-05 20:13:20,649 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] [2025-02-05 20:13:20,650 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable7 [2025-02-05 20:13:20,651 INFO L396 AbstractCegarLoop]: === Iteration 9 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-02-05 20:13:20,652 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-02-05 20:13:20,652 INFO L85 PathProgramCache]: Analyzing trace with hash 2007848108, now seen corresponding path program 1 times [2025-02-05 20:13:20,652 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-02-05 20:13:20,652 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [568694239] [2025-02-05 20:13:20,652 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-02-05 20:13:20,652 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-02-05 20:13:20,696 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 200 statements into 1 equivalence classes. [2025-02-05 20:13:20,798 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 200 of 200 statements. [2025-02-05 20:13:20,799 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-02-05 20:13:20,799 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-02-05 20:13:21,132 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-05 20:13:21,132 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-02-05 20:13:21,133 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [568694239] [2025-02-05 20:13:21,133 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [568694239] provided 1 perfect and 0 imperfect interpolant sequences [2025-02-05 20:13:21,133 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-02-05 20:13:21,133 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2025-02-05 20:13:21,133 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1884847649] [2025-02-05 20:13:21,133 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-02-05 20:13:21,133 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2025-02-05 20:13:21,133 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-02-05 20:13:21,134 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2025-02-05 20:13:21,134 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2025-02-05 20:13:21,135 INFO L87 Difference]: Start difference. First operand 1223 states and 1821 transitions. Second operand has 5 states, 5 states have (on average 40.0) internal successors, (200), 5 states have internal predecessors, (200), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-02-05 20:13:21,641 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-02-05 20:13:21,641 INFO L93 Difference]: Finished difference Result 2312 states and 3442 transitions. [2025-02-05 20:13:21,641 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2025-02-05 20:13:21,641 INFO L78 Accepts]: Start accepts. Automaton has has 5 states, 5 states have (on average 40.0) internal successors, (200), 5 states have internal predecessors, (200), 0 states have call successors, (0), 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 200 [2025-02-05 20:13:21,641 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-02-05 20:13:21,645 INFO L225 Difference]: With dead ends: 2312 [2025-02-05 20:13:21,645 INFO L226 Difference]: Without dead ends: 1231 [2025-02-05 20:13:21,646 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 5 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2025-02-05 20:13:21,646 INFO L435 NwaCegarLoop]: 1432 mSDtfsCounter, 6 mSDsluCounter, 4288 mSDsCounter, 0 mSdLazyCounter, 1171 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.4s Time, 0 mProtectedPredicate, 0 mProtectedAction, 6 SdHoareTripleChecker+Valid, 5720 SdHoareTripleChecker+Invalid, 1171 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 1171 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.5s IncrementalHoareTripleChecker+Time [2025-02-05 20:13:21,646 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [6 Valid, 5720 Invalid, 1171 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 1171 Invalid, 0 Unknown, 0 Unchecked, 0.5s Time] [2025-02-05 20:13:21,648 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1231 states. [2025-02-05 20:13:21,660 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1231 to 1229. [2025-02-05 20:13:21,661 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 1229 states, 1228 states have (on average 1.489413680781759) internal successors, (1829), 1228 states have internal predecessors, (1829), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-02-05 20:13:21,664 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1229 states to 1229 states and 1829 transitions. [2025-02-05 20:13:21,664 INFO L78 Accepts]: Start accepts. Automaton has 1229 states and 1829 transitions. Word has length 200 [2025-02-05 20:13:21,664 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-02-05 20:13:21,664 INFO L471 AbstractCegarLoop]: Abstraction has 1229 states and 1829 transitions. [2025-02-05 20:13:21,664 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 40.0) internal successors, (200), 5 states have internal predecessors, (200), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-02-05 20:13:21,664 INFO L276 IsEmpty]: Start isEmpty. Operand 1229 states and 1829 transitions. [2025-02-05 20:13:21,666 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 202 [2025-02-05 20:13:21,666 INFO L210 NwaCegarLoop]: Found error trace [2025-02-05 20:13:21,666 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] [2025-02-05 20:13:21,666 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable8 [2025-02-05 20:13:21,666 INFO L396 AbstractCegarLoop]: === Iteration 10 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-02-05 20:13:21,668 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-02-05 20:13:21,668 INFO L85 PathProgramCache]: Analyzing trace with hash 710560458, now seen corresponding path program 1 times [2025-02-05 20:13:21,669 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-02-05 20:13:21,669 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [354752477] [2025-02-05 20:13:21,669 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-02-05 20:13:21,669 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-02-05 20:13:21,707 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 201 statements into 1 equivalence classes. [2025-02-05 20:13:21,749 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 201 of 201 statements. [2025-02-05 20:13:21,750 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-02-05 20:13:21,750 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-02-05 20:13:21,947 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-05 20:13:21,948 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-02-05 20:13:21,948 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [354752477] [2025-02-05 20:13:21,948 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [354752477] provided 1 perfect and 0 imperfect interpolant sequences [2025-02-05 20:13:21,948 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-02-05 20:13:21,949 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2025-02-05 20:13:21,949 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1450721957] [2025-02-05 20:13:21,949 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-02-05 20:13:21,949 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2025-02-05 20:13:21,949 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-02-05 20:13:21,949 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2025-02-05 20:13:21,949 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=10, Invalid=20, Unknown=0, NotChecked=0, Total=30 [2025-02-05 20:13:21,950 INFO L87 Difference]: Start difference. First operand 1229 states and 1829 transitions. Second operand has 6 states, 6 states have (on average 33.5) internal successors, (201), 6 states have internal predecessors, (201), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-02-05 20:13:22,486 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-02-05 20:13:22,487 INFO L93 Difference]: Finished difference Result 2322 states and 3455 transitions. [2025-02-05 20:13:22,487 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2025-02-05 20:13:22,487 INFO L78 Accepts]: Start accepts. Automaton has has 6 states, 6 states have (on average 33.5) internal successors, (201), 6 states have internal predecessors, (201), 0 states have call successors, (0), 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 201 [2025-02-05 20:13:22,487 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-02-05 20:13:22,490 INFO L225 Difference]: With dead ends: 2322 [2025-02-05 20:13:22,490 INFO L226 Difference]: Without dead ends: 1235 [2025-02-05 20:13:22,491 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 6 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 4 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=10, Invalid=20, Unknown=0, NotChecked=0, Total=30 [2025-02-05 20:13:22,491 INFO L435 NwaCegarLoop]: 1434 mSDtfsCounter, 4 mSDsluCounter, 5721 mSDsCounter, 0 mSdLazyCounter, 1459 mSolverCounterSat, 1 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.4s Time, 0 mProtectedPredicate, 0 mProtectedAction, 4 SdHoareTripleChecker+Valid, 7155 SdHoareTripleChecker+Invalid, 1460 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 1 IncrementalHoareTripleChecker+Valid, 1459 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.5s IncrementalHoareTripleChecker+Time [2025-02-05 20:13:22,491 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [4 Valid, 7155 Invalid, 1460 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [1 Valid, 1459 Invalid, 0 Unknown, 0 Unchecked, 0.5s Time] [2025-02-05 20:13:22,493 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1235 states. [2025-02-05 20:13:22,501 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1235 to 1235. [2025-02-05 20:13:22,503 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 1235 states, 1234 states have (on average 1.4886547811993518) internal successors, (1837), 1234 states have internal predecessors, (1837), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-02-05 20:13:22,505 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1235 states to 1235 states and 1837 transitions. [2025-02-05 20:13:22,505 INFO L78 Accepts]: Start accepts. Automaton has 1235 states and 1837 transitions. Word has length 201 [2025-02-05 20:13:22,506 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-02-05 20:13:22,506 INFO L471 AbstractCegarLoop]: Abstraction has 1235 states and 1837 transitions. [2025-02-05 20:13:22,506 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 6 states have (on average 33.5) internal successors, (201), 6 states have internal predecessors, (201), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-02-05 20:13:22,506 INFO L276 IsEmpty]: Start isEmpty. Operand 1235 states and 1837 transitions. [2025-02-05 20:13:22,507 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 202 [2025-02-05 20:13:22,508 INFO L210 NwaCegarLoop]: Found error trace [2025-02-05 20:13:22,508 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] [2025-02-05 20:13:22,508 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable9 [2025-02-05 20:13:22,508 INFO L396 AbstractCegarLoop]: === Iteration 11 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-02-05 20:13:22,509 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-02-05 20:13:22,509 INFO L85 PathProgramCache]: Analyzing trace with hash 2023308096, now seen corresponding path program 1 times [2025-02-05 20:13:22,509 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-02-05 20:13:22,509 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [866609051] [2025-02-05 20:13:22,509 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-02-05 20:13:22,510 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-02-05 20:13:22,554 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 201 statements into 1 equivalence classes. [2025-02-05 20:13:22,587 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 201 of 201 statements. [2025-02-05 20:13:22,587 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-02-05 20:13:22,587 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-02-05 20:13:22,995 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-05 20:13:22,995 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-02-05 20:13:22,995 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [866609051] [2025-02-05 20:13:22,995 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [866609051] provided 1 perfect and 0 imperfect interpolant sequences [2025-02-05 20:13:22,995 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-02-05 20:13:22,995 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [8] imperfect sequences [] total 8 [2025-02-05 20:13:22,995 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [577322925] [2025-02-05 20:13:22,995 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-02-05 20:13:22,995 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 8 states [2025-02-05 20:13:22,995 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-02-05 20:13:22,997 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2025-02-05 20:13:22,997 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=15, Invalid=41, Unknown=0, NotChecked=0, Total=56 [2025-02-05 20:13:22,997 INFO L87 Difference]: Start difference. First operand 1235 states and 1837 transitions. Second operand has 8 states, 8 states have (on average 25.125) internal successors, (201), 8 states have internal predecessors, (201), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-02-05 20:13:23,722 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-02-05 20:13:23,722 INFO L93 Difference]: Finished difference Result 2373 states and 3527 transitions. [2025-02-05 20:13:23,722 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2025-02-05 20:13:23,722 INFO L78 Accepts]: Start accepts. Automaton has has 8 states, 8 states have (on average 25.125) internal successors, (201), 8 states have internal predecessors, (201), 0 states have call successors, (0), 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 201 [2025-02-05 20:13:23,723 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-02-05 20:13:23,725 INFO L225 Difference]: With dead ends: 2373 [2025-02-05 20:13:23,725 INFO L226 Difference]: Without dead ends: 1280 [2025-02-05 20:13:23,726 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 8 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 6 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 2 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=15, Invalid=41, Unknown=0, NotChecked=0, Total=56 [2025-02-05 20:13:23,727 INFO L435 NwaCegarLoop]: 1429 mSDtfsCounter, 30 mSDsluCounter, 8555 mSDsCounter, 0 mSdLazyCounter, 2075 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.6s Time, 0 mProtectedPredicate, 0 mProtectedAction, 30 SdHoareTripleChecker+Valid, 9984 SdHoareTripleChecker+Invalid, 2075 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 2075 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.7s IncrementalHoareTripleChecker+Time [2025-02-05 20:13:23,727 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [30 Valid, 9984 Invalid, 2075 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 2075 Invalid, 0 Unknown, 0 Unchecked, 0.7s Time] [2025-02-05 20:13:23,729 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1280 states. [2025-02-05 20:13:23,737 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1280 to 1276. [2025-02-05 20:13:23,738 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 1276 states, 1275 states have (on average 1.4870588235294118) internal successors, (1896), 1275 states have internal predecessors, (1896), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-02-05 20:13:23,740 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1276 states to 1276 states and 1896 transitions. [2025-02-05 20:13:23,740 INFO L78 Accepts]: Start accepts. Automaton has 1276 states and 1896 transitions. Word has length 201 [2025-02-05 20:13:23,741 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-02-05 20:13:23,741 INFO L471 AbstractCegarLoop]: Abstraction has 1276 states and 1896 transitions. [2025-02-05 20:13:23,741 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 8 states, 8 states have (on average 25.125) internal successors, (201), 8 states have internal predecessors, (201), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-02-05 20:13:23,742 INFO L276 IsEmpty]: Start isEmpty. Operand 1276 states and 1896 transitions. [2025-02-05 20:13:23,743 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 202 [2025-02-05 20:13:23,743 INFO L210 NwaCegarLoop]: Found error trace [2025-02-05 20:13:23,744 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] [2025-02-05 20:13:23,744 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable10 [2025-02-05 20:13:23,744 INFO L396 AbstractCegarLoop]: === Iteration 12 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-02-05 20:13:23,744 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-02-05 20:13:23,744 INFO L85 PathProgramCache]: Analyzing trace with hash 1999929549, now seen corresponding path program 1 times [2025-02-05 20:13:23,744 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-02-05 20:13:23,744 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [656951060] [2025-02-05 20:13:23,744 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-02-05 20:13:23,744 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-02-05 20:13:23,779 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 201 statements into 1 equivalence classes. [2025-02-05 20:13:23,870 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 201 of 201 statements. [2025-02-05 20:13:23,870 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-02-05 20:13:23,870 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-02-05 20:13:24,225 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-05 20:13:24,225 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-02-05 20:13:24,225 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [656951060] [2025-02-05 20:13:24,225 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [656951060] provided 1 perfect and 0 imperfect interpolant sequences [2025-02-05 20:13:24,225 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-02-05 20:13:24,225 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2025-02-05 20:13:24,225 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1534215479] [2025-02-05 20:13:24,225 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-02-05 20:13:24,225 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2025-02-05 20:13:24,225 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-02-05 20:13:24,226 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2025-02-05 20:13:24,226 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=8, Invalid=12, Unknown=0, NotChecked=0, Total=20 [2025-02-05 20:13:24,226 INFO L87 Difference]: Start difference. First operand 1276 states and 1896 transitions. Second operand has 5 states, 5 states have (on average 40.2) internal successors, (201), 5 states have internal predecessors, (201), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-02-05 20:13:24,666 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-02-05 20:13:24,666 INFO L93 Difference]: Finished difference Result 2420 states and 3594 transitions. [2025-02-05 20:13:24,666 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2025-02-05 20:13:24,666 INFO L78 Accepts]: Start accepts. Automaton has has 5 states, 5 states have (on average 40.2) internal successors, (201), 5 states have internal predecessors, (201), 0 states have call successors, (0), 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 201 [2025-02-05 20:13:24,667 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-02-05 20:13:24,669 INFO L225 Difference]: With dead ends: 2420 [2025-02-05 20:13:24,669 INFO L226 Difference]: Without dead ends: 1286 [2025-02-05 20:13:24,670 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 8 GetRequests, 3 SyntacticMatches, 1 SemanticMatches, 4 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 2 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=12, Invalid=18, Unknown=0, NotChecked=0, Total=30 [2025-02-05 20:13:24,670 INFO L435 NwaCegarLoop]: 1402 mSDtfsCounter, 1624 mSDsluCounter, 2799 mSDsCounter, 0 mSdLazyCounter, 968 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.3s Time, 0 mProtectedPredicate, 0 mProtectedAction, 1624 SdHoareTripleChecker+Valid, 4201 SdHoareTripleChecker+Invalid, 968 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 968 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.4s IncrementalHoareTripleChecker+Time [2025-02-05 20:13:24,670 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [1624 Valid, 4201 Invalid, 968 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 968 Invalid, 0 Unknown, 0 Unchecked, 0.4s Time] [2025-02-05 20:13:24,671 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1286 states. [2025-02-05 20:13:24,680 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1286 to 1286. [2025-02-05 20:13:24,681 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 1286 states, 1285 states have (on average 1.4848249027237355) internal successors, (1908), 1285 states have internal predecessors, (1908), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-02-05 20:13:24,683 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1286 states to 1286 states and 1908 transitions. [2025-02-05 20:13:24,683 INFO L78 Accepts]: Start accepts. Automaton has 1286 states and 1908 transitions. Word has length 201 [2025-02-05 20:13:24,683 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-02-05 20:13:24,683 INFO L471 AbstractCegarLoop]: Abstraction has 1286 states and 1908 transitions. [2025-02-05 20:13:24,684 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 40.2) internal successors, (201), 5 states have internal predecessors, (201), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-02-05 20:13:24,684 INFO L276 IsEmpty]: Start isEmpty. Operand 1286 states and 1908 transitions. [2025-02-05 20:13:24,685 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 202 [2025-02-05 20:13:24,685 INFO L210 NwaCegarLoop]: Found error trace [2025-02-05 20:13:24,685 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] [2025-02-05 20:13:24,685 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable11 [2025-02-05 20:13:24,686 INFO L396 AbstractCegarLoop]: === Iteration 13 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-02-05 20:13:24,686 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-02-05 20:13:24,686 INFO L85 PathProgramCache]: Analyzing trace with hash -539845371, now seen corresponding path program 1 times [2025-02-05 20:13:24,686 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-02-05 20:13:24,686 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1058181817] [2025-02-05 20:13:24,686 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-02-05 20:13:24,686 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-02-05 20:13:24,721 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 201 statements into 1 equivalence classes. [2025-02-05 20:13:24,757 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 201 of 201 statements. [2025-02-05 20:13:24,757 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-02-05 20:13:24,757 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-02-05 20:13:24,917 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-05 20:13:24,917 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-02-05 20:13:24,917 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1058181817] [2025-02-05 20:13:24,918 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1058181817] provided 1 perfect and 0 imperfect interpolant sequences [2025-02-05 20:13:24,918 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-02-05 20:13:24,918 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2025-02-05 20:13:24,918 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1132675462] [2025-02-05 20:13:24,918 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-02-05 20:13:24,918 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2025-02-05 20:13:24,918 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-02-05 20:13:24,919 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2025-02-05 20:13:24,919 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2025-02-05 20:13:24,919 INFO L87 Difference]: Start difference. First operand 1286 states and 1908 transitions. Second operand has 4 states, 4 states have (on average 50.25) internal successors, (201), 4 states have internal predecessors, (201), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-02-05 20:13:25,251 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-02-05 20:13:25,251 INFO L93 Difference]: Finished difference Result 2434 states and 3610 transitions. [2025-02-05 20:13:25,251 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2025-02-05 20:13:25,251 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 4 states have (on average 50.25) internal successors, (201), 4 states have internal predecessors, (201), 0 states have call successors, (0), 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 201 [2025-02-05 20:13:25,252 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-02-05 20:13:25,254 INFO L225 Difference]: With dead ends: 2434 [2025-02-05 20:13:25,254 INFO L226 Difference]: Without dead ends: 1290 [2025-02-05 20:13:25,255 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 5 GetRequests, 3 SyntacticMatches, 0 SemanticMatches, 2 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2025-02-05 20:13:25,256 INFO L435 NwaCegarLoop]: 1435 mSDtfsCounter, 0 mSDsluCounter, 2862 mSDsCounter, 0 mSdLazyCounter, 871 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.3s Time, 0 mProtectedPredicate, 0 mProtectedAction, 0 SdHoareTripleChecker+Valid, 4297 SdHoareTripleChecker+Invalid, 871 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 871 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.3s IncrementalHoareTripleChecker+Time [2025-02-05 20:13:25,256 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [0 Valid, 4297 Invalid, 871 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 871 Invalid, 0 Unknown, 0 Unchecked, 0.3s Time] [2025-02-05 20:13:25,257 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1290 states. [2025-02-05 20:13:25,267 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1290 to 1290. [2025-02-05 20:13:25,268 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 1290 states, 1289 states have (on average 1.4833204034134988) internal successors, (1912), 1289 states have internal predecessors, (1912), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-02-05 20:13:25,270 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1290 states to 1290 states and 1912 transitions. [2025-02-05 20:13:25,270 INFO L78 Accepts]: Start accepts. Automaton has 1290 states and 1912 transitions. Word has length 201 [2025-02-05 20:13:25,270 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-02-05 20:13:25,270 INFO L471 AbstractCegarLoop]: Abstraction has 1290 states and 1912 transitions. [2025-02-05 20:13:25,270 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 50.25) internal successors, (201), 4 states have internal predecessors, (201), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-02-05 20:13:25,271 INFO L276 IsEmpty]: Start isEmpty. Operand 1290 states and 1912 transitions. [2025-02-05 20:13:25,272 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 202 [2025-02-05 20:13:25,272 INFO L210 NwaCegarLoop]: Found error trace [2025-02-05 20:13:25,272 INFO L218 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-02-05 20:13:25,272 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable12 [2025-02-05 20:13:25,272 INFO L396 AbstractCegarLoop]: === Iteration 14 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-02-05 20:13:25,272 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-02-05 20:13:25,273 INFO L85 PathProgramCache]: Analyzing trace with hash 649558516, now seen corresponding path program 1 times [2025-02-05 20:13:25,273 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-02-05 20:13:25,273 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [109500815] [2025-02-05 20:13:25,273 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-02-05 20:13:25,273 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-02-05 20:13:25,308 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 201 statements into 1 equivalence classes. [2025-02-05 20:13:25,336 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 201 of 201 statements. [2025-02-05 20:13:25,336 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-02-05 20:13:25,336 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-02-05 20:13:25,527 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-05 20:13:25,528 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-02-05 20:13:25,528 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [109500815] [2025-02-05 20:13:25,528 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [109500815] provided 1 perfect and 0 imperfect interpolant sequences [2025-02-05 20:13:25,528 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-02-05 20:13:25,528 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2025-02-05 20:13:25,528 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [405693754] [2025-02-05 20:13:25,528 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-02-05 20:13:25,529 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2025-02-05 20:13:25,529 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-02-05 20:13:25,529 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2025-02-05 20:13:25,529 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2025-02-05 20:13:25,529 INFO L87 Difference]: Start difference. First operand 1290 states and 1912 transitions. Second operand has 4 states, 4 states have (on average 50.25) internal successors, (201), 4 states have internal predecessors, (201), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-02-05 20:13:25,936 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-02-05 20:13:25,937 INFO L93 Difference]: Finished difference Result 2440 states and 3615 transitions. [2025-02-05 20:13:25,937 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2025-02-05 20:13:25,937 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 4 states have (on average 50.25) internal successors, (201), 4 states have internal predecessors, (201), 0 states have call successors, (0), 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 201 [2025-02-05 20:13:25,938 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-02-05 20:13:25,941 INFO L225 Difference]: With dead ends: 2440 [2025-02-05 20:13:25,941 INFO L226 Difference]: Without dead ends: 1292 [2025-02-05 20:13:25,943 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 5 GetRequests, 3 SyntacticMatches, 0 SemanticMatches, 2 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2025-02-05 20:13:25,943 INFO L435 NwaCegarLoop]: 1435 mSDtfsCounter, 0 mSDsluCounter, 2862 mSDsCounter, 0 mSdLazyCounter, 871 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.3s Time, 0 mProtectedPredicate, 0 mProtectedAction, 0 SdHoareTripleChecker+Valid, 4297 SdHoareTripleChecker+Invalid, 871 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 871 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.4s IncrementalHoareTripleChecker+Time [2025-02-05 20:13:25,943 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [0 Valid, 4297 Invalid, 871 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 871 Invalid, 0 Unknown, 0 Unchecked, 0.4s Time] [2025-02-05 20:13:25,945 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1292 states. [2025-02-05 20:13:25,956 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1292 to 1292. [2025-02-05 20:13:25,957 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 1292 states, 1291 states have (on average 1.482571649883811) internal successors, (1914), 1291 states have internal predecessors, (1914), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-02-05 20:13:25,959 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1292 states to 1292 states and 1914 transitions. [2025-02-05 20:13:25,959 INFO L78 Accepts]: Start accepts. Automaton has 1292 states and 1914 transitions. Word has length 201 [2025-02-05 20:13:25,960 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-02-05 20:13:25,960 INFO L471 AbstractCegarLoop]: Abstraction has 1292 states and 1914 transitions. [2025-02-05 20:13:25,960 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 50.25) internal successors, (201), 4 states have internal predecessors, (201), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-02-05 20:13:25,960 INFO L276 IsEmpty]: Start isEmpty. Operand 1292 states and 1914 transitions. [2025-02-05 20:13:25,961 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 203 [2025-02-05 20:13:25,961 INFO L210 NwaCegarLoop]: Found error trace [2025-02-05 20:13:25,961 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] [2025-02-05 20:13:25,962 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable13 [2025-02-05 20:13:25,962 INFO L396 AbstractCegarLoop]: === Iteration 15 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-02-05 20:13:25,962 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-02-05 20:13:25,962 INFO L85 PathProgramCache]: Analyzing trace with hash 566556323, now seen corresponding path program 1 times [2025-02-05 20:13:25,962 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-02-05 20:13:25,962 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1865884214] [2025-02-05 20:13:25,962 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-02-05 20:13:25,962 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-02-05 20:13:26,010 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 202 statements into 1 equivalence classes. [2025-02-05 20:13:26,253 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 202 of 202 statements. [2025-02-05 20:13:26,253 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-02-05 20:13:26,253 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-02-05 20:13:26,750 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-05 20:13:26,750 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-02-05 20:13:26,751 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1865884214] [2025-02-05 20:13:26,751 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1865884214] provided 1 perfect and 0 imperfect interpolant sequences [2025-02-05 20:13:26,751 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-02-05 20:13:26,751 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2025-02-05 20:13:26,751 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1793497065] [2025-02-05 20:13:26,751 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-02-05 20:13:26,751 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 7 states [2025-02-05 20:13:26,751 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-02-05 20:13:26,752 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2025-02-05 20:13:26,752 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=15, Invalid=27, Unknown=0, NotChecked=0, Total=42 [2025-02-05 20:13:26,752 INFO L87 Difference]: Start difference. First operand 1292 states and 1914 transitions. Second operand has 7 states, 7 states have (on average 28.857142857142858) internal successors, (202), 7 states have internal predecessors, (202), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-02-05 20:13:27,238 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-02-05 20:13:27,238 INFO L93 Difference]: Finished difference Result 2450 states and 3628 transitions. [2025-02-05 20:13:27,238 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2025-02-05 20:13:27,239 INFO L78 Accepts]: Start accepts. Automaton has has 7 states, 7 states have (on average 28.857142857142858) internal successors, (202), 7 states have internal predecessors, (202), 0 states have call successors, (0), 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 202 [2025-02-05 20:13:27,239 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-02-05 20:13:27,241 INFO L225 Difference]: With dead ends: 2450 [2025-02-05 20:13:27,241 INFO L226 Difference]: Without dead ends: 1300 [2025-02-05 20:13:27,242 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 8 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 6 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 4 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=19, Invalid=37, Unknown=0, NotChecked=0, Total=56 [2025-02-05 20:13:27,243 INFO L435 NwaCegarLoop]: 1402 mSDtfsCounter, 1595 mSDsluCounter, 4199 mSDsCounter, 0 mSdLazyCounter, 1295 mSolverCounterSat, 1 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.4s Time, 0 mProtectedPredicate, 0 mProtectedAction, 1595 SdHoareTripleChecker+Valid, 5601 SdHoareTripleChecker+Invalid, 1296 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 1 IncrementalHoareTripleChecker+Valid, 1295 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.5s IncrementalHoareTripleChecker+Time [2025-02-05 20:13:27,243 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [1595 Valid, 5601 Invalid, 1296 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [1 Valid, 1295 Invalid, 0 Unknown, 0 Unchecked, 0.5s Time] [2025-02-05 20:13:27,244 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1300 states. [2025-02-05 20:13:27,251 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1300 to 1297. [2025-02-05 20:13:27,252 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 1297 states, 1296 states have (on average 1.4814814814814814) internal successors, (1920), 1296 states have internal predecessors, (1920), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-02-05 20:13:27,253 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1297 states to 1297 states and 1920 transitions. [2025-02-05 20:13:27,253 INFO L78 Accepts]: Start accepts. Automaton has 1297 states and 1920 transitions. Word has length 202 [2025-02-05 20:13:27,254 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-02-05 20:13:27,254 INFO L471 AbstractCegarLoop]: Abstraction has 1297 states and 1920 transitions. [2025-02-05 20:13:27,257 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 7 states, 7 states have (on average 28.857142857142858) internal successors, (202), 7 states have internal predecessors, (202), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-02-05 20:13:27,258 INFO L276 IsEmpty]: Start isEmpty. Operand 1297 states and 1920 transitions. [2025-02-05 20:13:27,258 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 204 [2025-02-05 20:13:27,258 INFO L210 NwaCegarLoop]: Found error trace [2025-02-05 20:13:27,259 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] [2025-02-05 20:13:27,259 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable14 [2025-02-05 20:13:27,259 INFO L396 AbstractCegarLoop]: === Iteration 16 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-02-05 20:13:27,259 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-02-05 20:13:27,259 INFO L85 PathProgramCache]: Analyzing trace with hash -951337882, now seen corresponding path program 1 times [2025-02-05 20:13:27,259 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-02-05 20:13:27,259 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1477057633] [2025-02-05 20:13:27,259 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-02-05 20:13:27,259 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-02-05 20:13:27,296 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 203 statements into 1 equivalence classes. [2025-02-05 20:13:27,422 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 203 of 203 statements. [2025-02-05 20:13:27,422 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-02-05 20:13:27,422 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-02-05 20:13:27,628 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-02-05 20:13:27,628 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-02-05 20:13:27,628 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1477057633] [2025-02-05 20:13:27,628 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1477057633] provided 1 perfect and 0 imperfect interpolant sequences [2025-02-05 20:13:27,628 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-02-05 20:13:27,628 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2025-02-05 20:13:27,628 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1680293980] [2025-02-05 20:13:27,628 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-02-05 20:13:27,629 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2025-02-05 20:13:27,629 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-02-05 20:13:27,629 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2025-02-05 20:13:27,630 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=12, Invalid=18, Unknown=0, NotChecked=0, Total=30 [2025-02-05 20:13:27,631 INFO L87 Difference]: Start difference. First operand 1297 states and 1920 transitions. Second operand has 6 states, 6 states have (on average 33.833333333333336) internal successors, (203), 6 states have internal predecessors, (203), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-02-05 20:13:28,433 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-02-05 20:13:28,433 INFO L93 Difference]: Finished difference Result 2986 states and 4404 transitions. [2025-02-05 20:13:28,433 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2025-02-05 20:13:28,433 INFO L78 Accepts]: Start accepts. Automaton has has 6 states, 6 states have (on average 33.833333333333336) internal successors, (203), 6 states have internal predecessors, (203), 0 states have call successors, (0), 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 203 [2025-02-05 20:13:28,433 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-02-05 20:13:28,437 INFO L225 Difference]: With dead ends: 2986 [2025-02-05 20:13:28,437 INFO L226 Difference]: Without dead ends: 1831 [2025-02-05 20:13:28,438 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 8 GetRequests, 3 SyntacticMatches, 0 SemanticMatches, 5 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=17, Invalid=25, Unknown=0, NotChecked=0, Total=42 [2025-02-05 20:13:28,439 INFO L435 NwaCegarLoop]: 1167 mSDtfsCounter, 2164 mSDsluCounter, 3492 mSDsCounter, 0 mSdLazyCounter, 2233 mSolverCounterSat, 1 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.6s Time, 0 mProtectedPredicate, 0 mProtectedAction, 2164 SdHoareTripleChecker+Valid, 4659 SdHoareTripleChecker+Invalid, 2234 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 1 IncrementalHoareTripleChecker+Valid, 2233 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.8s IncrementalHoareTripleChecker+Time [2025-02-05 20:13:28,439 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [2164 Valid, 4659 Invalid, 2234 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [1 Valid, 2233 Invalid, 0 Unknown, 0 Unchecked, 0.8s Time] [2025-02-05 20:13:28,440 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1831 states. [2025-02-05 20:13:28,451 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1831 to 1671. [2025-02-05 20:13:28,453 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 1671 states, 1670 states have (on average 1.473053892215569) internal successors, (2460), 1670 states have internal predecessors, (2460), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-02-05 20:13:28,454 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1671 states to 1671 states and 2460 transitions. [2025-02-05 20:13:28,454 INFO L78 Accepts]: Start accepts. Automaton has 1671 states and 2460 transitions. Word has length 203 [2025-02-05 20:13:28,455 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-02-05 20:13:28,455 INFO L471 AbstractCegarLoop]: Abstraction has 1671 states and 2460 transitions. [2025-02-05 20:13:28,455 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 6 states have (on average 33.833333333333336) internal successors, (203), 6 states have internal predecessors, (203), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-02-05 20:13:28,455 INFO L276 IsEmpty]: Start isEmpty. Operand 1671 states and 2460 transitions. [2025-02-05 20:13:28,456 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 204 [2025-02-05 20:13:28,456 INFO L210 NwaCegarLoop]: Found error trace [2025-02-05 20:13:28,457 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] [2025-02-05 20:13:28,457 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable15 [2025-02-05 20:13:28,457 INFO L396 AbstractCegarLoop]: === Iteration 17 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-02-05 20:13:28,457 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-02-05 20:13:28,457 INFO L85 PathProgramCache]: Analyzing trace with hash -428128255, now seen corresponding path program 1 times [2025-02-05 20:13:28,457 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-02-05 20:13:28,457 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [978207704] [2025-02-05 20:13:28,458 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-02-05 20:13:28,458 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-02-05 20:13:28,495 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 203 statements into 1 equivalence classes. [2025-02-05 20:13:28,675 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 203 of 203 statements. [2025-02-05 20:13:28,675 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-02-05 20:13:28,675 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-02-05 20:13:28,921 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-05 20:13:28,921 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-02-05 20:13:28,921 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [978207704] [2025-02-05 20:13:28,921 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [978207704] provided 1 perfect and 0 imperfect interpolant sequences [2025-02-05 20:13:28,921 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-02-05 20:13:28,921 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2025-02-05 20:13:28,921 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2121271046] [2025-02-05 20:13:28,921 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-02-05 20:13:28,922 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2025-02-05 20:13:28,922 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-02-05 20:13:28,922 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2025-02-05 20:13:28,922 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=12, Invalid=18, Unknown=0, NotChecked=0, Total=30 [2025-02-05 20:13:28,923 INFO L87 Difference]: Start difference. First operand 1671 states and 2460 transitions. Second operand has 6 states, 6 states have (on average 33.833333333333336) internal successors, (203), 6 states have internal predecessors, (203), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-02-05 20:13:29,754 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-02-05 20:13:29,754 INFO L93 Difference]: Finished difference Result 3200 states and 4706 transitions. [2025-02-05 20:13:29,755 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2025-02-05 20:13:29,755 INFO L78 Accepts]: Start accepts. Automaton has has 6 states, 6 states have (on average 33.833333333333336) internal successors, (203), 6 states have internal predecessors, (203), 0 states have call successors, (0), 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 203 [2025-02-05 20:13:29,755 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-02-05 20:13:29,758 INFO L225 Difference]: With dead ends: 3200 [2025-02-05 20:13:29,758 INFO L226 Difference]: Without dead ends: 1831 [2025-02-05 20:13:29,760 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 8 GetRequests, 3 SyntacticMatches, 0 SemanticMatches, 5 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=17, Invalid=25, Unknown=0, NotChecked=0, Total=42 [2025-02-05 20:13:29,760 INFO L435 NwaCegarLoop]: 1168 mSDtfsCounter, 2215 mSDsluCounter, 3494 mSDsCounter, 0 mSdLazyCounter, 2235 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.6s Time, 0 mProtectedPredicate, 0 mProtectedAction, 2215 SdHoareTripleChecker+Valid, 4662 SdHoareTripleChecker+Invalid, 2235 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 2235 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.8s IncrementalHoareTripleChecker+Time [2025-02-05 20:13:29,760 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [2215 Valid, 4662 Invalid, 2235 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 2235 Invalid, 0 Unknown, 0 Unchecked, 0.8s Time] [2025-02-05 20:13:29,762 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1831 states. [2025-02-05 20:13:29,772 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1831 to 1671. [2025-02-05 20:13:29,774 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 1671 states, 1670 states have (on average 1.4718562874251497) internal successors, (2458), 1670 states have internal predecessors, (2458), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-02-05 20:13:29,776 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1671 states to 1671 states and 2458 transitions. [2025-02-05 20:13:29,776 INFO L78 Accepts]: Start accepts. Automaton has 1671 states and 2458 transitions. Word has length 203 [2025-02-05 20:13:29,776 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-02-05 20:13:29,776 INFO L471 AbstractCegarLoop]: Abstraction has 1671 states and 2458 transitions. [2025-02-05 20:13:29,777 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 6 states have (on average 33.833333333333336) internal successors, (203), 6 states have internal predecessors, (203), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-02-05 20:13:29,777 INFO L276 IsEmpty]: Start isEmpty. Operand 1671 states and 2458 transitions. [2025-02-05 20:13:29,778 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 204 [2025-02-05 20:13:29,778 INFO L210 NwaCegarLoop]: Found error trace [2025-02-05 20:13:29,778 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] [2025-02-05 20:13:29,779 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable16 [2025-02-05 20:13:29,779 INFO L396 AbstractCegarLoop]: === Iteration 18 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-02-05 20:13:29,779 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-02-05 20:13:29,779 INFO L85 PathProgramCache]: Analyzing trace with hash 1207245966, now seen corresponding path program 1 times [2025-02-05 20:13:29,779 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-02-05 20:13:29,779 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [499674823] [2025-02-05 20:13:29,779 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-02-05 20:13:29,779 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-02-05 20:13:29,824 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 203 statements into 1 equivalence classes. [2025-02-05 20:13:29,961 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 203 of 203 statements. [2025-02-05 20:13:29,961 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-02-05 20:13:29,962 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-02-05 20:13:30,291 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-05 20:13:30,291 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-02-05 20:13:30,291 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [499674823] [2025-02-05 20:13:30,291 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [499674823] provided 1 perfect and 0 imperfect interpolant sequences [2025-02-05 20:13:30,291 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-02-05 20:13:30,291 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2025-02-05 20:13:30,291 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1330034108] [2025-02-05 20:13:30,291 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-02-05 20:13:30,291 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 7 states [2025-02-05 20:13:30,291 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-02-05 20:13:30,292 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2025-02-05 20:13:30,292 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=14, Invalid=28, Unknown=0, NotChecked=0, Total=42 [2025-02-05 20:13:30,292 INFO L87 Difference]: Start difference. First operand 1671 states and 2458 transitions. Second operand has 7 states, 7 states have (on average 29.0) internal successors, (203), 7 states have internal predecessors, (203), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-02-05 20:13:30,901 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-02-05 20:13:30,901 INFO L93 Difference]: Finished difference Result 2833 states and 4177 transitions. [2025-02-05 20:13:30,901 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2025-02-05 20:13:30,902 INFO L78 Accepts]: Start accepts. Automaton has has 7 states, 7 states have (on average 29.0) internal successors, (203), 7 states have internal predecessors, (203), 0 states have call successors, (0), 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 203 [2025-02-05 20:13:30,902 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-02-05 20:13:30,905 INFO L225 Difference]: With dead ends: 2833 [2025-02-05 20:13:30,905 INFO L226 Difference]: Without dead ends: 1678 [2025-02-05 20:13:30,906 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 9 GetRequests, 3 SyntacticMatches, 0 SemanticMatches, 6 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 3 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=18, Invalid=38, Unknown=0, NotChecked=0, Total=56 [2025-02-05 20:13:30,907 INFO L435 NwaCegarLoop]: 1399 mSDtfsCounter, 1539 mSDsluCounter, 5584 mSDsCounter, 0 mSdLazyCounter, 1630 mSolverCounterSat, 2 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.5s Time, 0 mProtectedPredicate, 0 mProtectedAction, 1539 SdHoareTripleChecker+Valid, 6983 SdHoareTripleChecker+Invalid, 1632 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 2 IncrementalHoareTripleChecker+Valid, 1630 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.6s IncrementalHoareTripleChecker+Time [2025-02-05 20:13:30,907 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [1539 Valid, 6983 Invalid, 1632 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [2 Valid, 1630 Invalid, 0 Unknown, 0 Unchecked, 0.6s Time] [2025-02-05 20:13:30,908 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1678 states. [2025-02-05 20:13:30,918 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1678 to 1677. [2025-02-05 20:13:30,919 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 1677 states, 1676 states have (on average 1.470763723150358) internal successors, (2465), 1676 states have internal predecessors, (2465), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-02-05 20:13:30,921 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1677 states to 1677 states and 2465 transitions. [2025-02-05 20:13:30,921 INFO L78 Accepts]: Start accepts. Automaton has 1677 states and 2465 transitions. Word has length 203 [2025-02-05 20:13:30,921 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-02-05 20:13:30,921 INFO L471 AbstractCegarLoop]: Abstraction has 1677 states and 2465 transitions. [2025-02-05 20:13:30,921 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 7 states, 7 states have (on average 29.0) internal successors, (203), 7 states have internal predecessors, (203), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-02-05 20:13:30,921 INFO L276 IsEmpty]: Start isEmpty. Operand 1677 states and 2465 transitions. [2025-02-05 20:13:30,923 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 205 [2025-02-05 20:13:30,923 INFO L210 NwaCegarLoop]: Found error trace [2025-02-05 20:13:30,923 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] [2025-02-05 20:13:30,923 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable17 [2025-02-05 20:13:30,923 INFO L396 AbstractCegarLoop]: === Iteration 19 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-02-05 20:13:30,923 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-02-05 20:13:30,923 INFO L85 PathProgramCache]: Analyzing trace with hash -1308298762, now seen corresponding path program 1 times [2025-02-05 20:13:30,923 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-02-05 20:13:30,923 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1430771667] [2025-02-05 20:13:30,923 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-02-05 20:13:30,924 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-02-05 20:13:30,964 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 204 statements into 1 equivalence classes. [2025-02-05 20:13:31,090 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 204 of 204 statements. [2025-02-05 20:13:31,091 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-02-05 20:13:31,091 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-02-05 20:13:31,477 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-02-05 20:13:31,478 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-02-05 20:13:31,478 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1430771667] [2025-02-05 20:13:31,478 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1430771667] provided 1 perfect and 0 imperfect interpolant sequences [2025-02-05 20:13:31,478 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-02-05 20:13:31,478 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2025-02-05 20:13:31,478 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1822629394] [2025-02-05 20:13:31,478 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-02-05 20:13:31,479 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2025-02-05 20:13:31,479 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-02-05 20:13:31,479 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2025-02-05 20:13:31,479 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=12, Invalid=18, Unknown=0, NotChecked=0, Total=30 [2025-02-05 20:13:31,479 INFO L87 Difference]: Start difference. First operand 1677 states and 2465 transitions. Second operand has 6 states, 6 states have (on average 34.0) internal successors, (204), 6 states have internal predecessors, (204), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-02-05 20:13:32,388 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-02-05 20:13:32,388 INFO L93 Difference]: Finished difference Result 3130 states and 4601 transitions. [2025-02-05 20:13:32,388 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2025-02-05 20:13:32,388 INFO L78 Accepts]: Start accepts. Automaton has has 6 states, 6 states have (on average 34.0) internal successors, (204), 6 states have internal predecessors, (204), 0 states have call successors, (0), 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 204 [2025-02-05 20:13:32,389 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-02-05 20:13:32,395 INFO L225 Difference]: With dead ends: 3130 [2025-02-05 20:13:32,396 INFO L226 Difference]: Without dead ends: 1843 [2025-02-05 20:13:32,397 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 8 GetRequests, 3 SyntacticMatches, 0 SemanticMatches, 5 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=17, Invalid=25, Unknown=0, NotChecked=0, Total=42 [2025-02-05 20:13:32,397 INFO L435 NwaCegarLoop]: 1169 mSDtfsCounter, 2199 mSDsluCounter, 3494 mSDsCounter, 0 mSdLazyCounter, 2239 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.7s Time, 0 mProtectedPredicate, 0 mProtectedAction, 2199 SdHoareTripleChecker+Valid, 4663 SdHoareTripleChecker+Invalid, 2239 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 2239 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.9s IncrementalHoareTripleChecker+Time [2025-02-05 20:13:32,400 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [2199 Valid, 4663 Invalid, 2239 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 2239 Invalid, 0 Unknown, 0 Unchecked, 0.9s Time] [2025-02-05 20:13:32,401 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1843 states. [2025-02-05 20:13:32,416 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1843 to 1677. [2025-02-05 20:13:32,417 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 1677 states, 1676 states have (on average 1.4683770883054892) internal successors, (2461), 1676 states have internal predecessors, (2461), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-02-05 20:13:32,418 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1677 states to 1677 states and 2461 transitions. [2025-02-05 20:13:32,418 INFO L78 Accepts]: Start accepts. Automaton has 1677 states and 2461 transitions. Word has length 204 [2025-02-05 20:13:32,419 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-02-05 20:13:32,419 INFO L471 AbstractCegarLoop]: Abstraction has 1677 states and 2461 transitions. [2025-02-05 20:13:32,419 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 6 states have (on average 34.0) internal successors, (204), 6 states have internal predecessors, (204), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-02-05 20:13:32,419 INFO L276 IsEmpty]: Start isEmpty. Operand 1677 states and 2461 transitions. [2025-02-05 20:13:32,421 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 205 [2025-02-05 20:13:32,421 INFO L210 NwaCegarLoop]: Found error trace [2025-02-05 20:13:32,421 INFO L218 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-02-05 20:13:32,421 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable18 [2025-02-05 20:13:32,421 INFO L396 AbstractCegarLoop]: === Iteration 20 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-02-05 20:13:32,421 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-02-05 20:13:32,421 INFO L85 PathProgramCache]: Analyzing trace with hash 1590557566, now seen corresponding path program 1 times [2025-02-05 20:13:32,421 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-02-05 20:13:32,421 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1767405181] [2025-02-05 20:13:32,421 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-02-05 20:13:32,421 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-02-05 20:13:32,468 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 204 statements into 1 equivalence classes. [2025-02-05 20:13:32,667 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 204 of 204 statements. [2025-02-05 20:13:32,668 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-02-05 20:13:32,668 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-02-05 20:13:33,021 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-05 20:13:33,022 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-02-05 20:13:33,022 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1767405181] [2025-02-05 20:13:33,022 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1767405181] provided 1 perfect and 0 imperfect interpolant sequences [2025-02-05 20:13:33,022 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-02-05 20:13:33,022 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2025-02-05 20:13:33,022 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [170866449] [2025-02-05 20:13:33,022 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-02-05 20:13:33,022 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2025-02-05 20:13:33,022 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-02-05 20:13:33,023 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2025-02-05 20:13:33,023 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=8, Invalid=12, Unknown=0, NotChecked=0, Total=20 [2025-02-05 20:13:33,023 INFO L87 Difference]: Start difference. First operand 1677 states and 2461 transitions. Second operand has 5 states, 5 states have (on average 40.8) internal successors, (204), 5 states have internal predecessors, (204), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-02-05 20:13:33,452 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-02-05 20:13:33,452 INFO L93 Difference]: Finished difference Result 2887 states and 4245 transitions. [2025-02-05 20:13:33,452 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2025-02-05 20:13:33,452 INFO L78 Accepts]: Start accepts. Automaton has has 5 states, 5 states have (on average 40.8) internal successors, (204), 5 states have internal predecessors, (204), 0 states have call successors, (0), 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 204 [2025-02-05 20:13:33,452 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-02-05 20:13:33,455 INFO L225 Difference]: With dead ends: 2887 [2025-02-05 20:13:33,455 INFO L226 Difference]: Without dead ends: 1697 [2025-02-05 20:13:33,456 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 8 GetRequests, 3 SyntacticMatches, 1 SemanticMatches, 4 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 2 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=12, Invalid=18, Unknown=0, NotChecked=0, Total=30 [2025-02-05 20:13:33,456 INFO L435 NwaCegarLoop]: 1402 mSDtfsCounter, 1606 mSDsluCounter, 2799 mSDsCounter, 0 mSdLazyCounter, 968 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.3s Time, 0 mProtectedPredicate, 0 mProtectedAction, 1606 SdHoareTripleChecker+Valid, 4201 SdHoareTripleChecker+Invalid, 968 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 968 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.4s IncrementalHoareTripleChecker+Time [2025-02-05 20:13:33,456 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [1606 Valid, 4201 Invalid, 968 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 968 Invalid, 0 Unknown, 0 Unchecked, 0.4s Time] [2025-02-05 20:13:33,458 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1697 states. [2025-02-05 20:13:33,467 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1697 to 1697. [2025-02-05 20:13:33,468 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 1697 states, 1696 states have (on average 1.4652122641509433) internal successors, (2485), 1696 states have internal predecessors, (2485), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-02-05 20:13:33,469 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1697 states to 1697 states and 2485 transitions. [2025-02-05 20:13:33,469 INFO L78 Accepts]: Start accepts. Automaton has 1697 states and 2485 transitions. Word has length 204 [2025-02-05 20:13:33,469 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-02-05 20:13:33,469 INFO L471 AbstractCegarLoop]: Abstraction has 1697 states and 2485 transitions. [2025-02-05 20:13:33,469 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 40.8) internal successors, (204), 5 states have internal predecessors, (204), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-02-05 20:13:33,470 INFO L276 IsEmpty]: Start isEmpty. Operand 1697 states and 2485 transitions. [2025-02-05 20:13:33,471 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 205 [2025-02-05 20:13:33,471 INFO L210 NwaCegarLoop]: Found error trace [2025-02-05 20:13:33,471 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] [2025-02-05 20:13:33,471 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable19 [2025-02-05 20:13:33,471 INFO L396 AbstractCegarLoop]: === Iteration 21 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-02-05 20:13:33,471 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-02-05 20:13:33,471 INFO L85 PathProgramCache]: Analyzing trace with hash 112352455, now seen corresponding path program 1 times [2025-02-05 20:13:33,471 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-02-05 20:13:33,471 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1573438763] [2025-02-05 20:13:33,472 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-02-05 20:13:33,472 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-02-05 20:13:33,510 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 204 statements into 1 equivalence classes. [2025-02-05 20:13:33,534 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 204 of 204 statements. [2025-02-05 20:13:33,534 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-02-05 20:13:33,534 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-02-05 20:13:33,896 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-05 20:13:33,897 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-02-05 20:13:33,897 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1573438763] [2025-02-05 20:13:33,897 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1573438763] provided 1 perfect and 0 imperfect interpolant sequences [2025-02-05 20:13:33,897 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-02-05 20:13:33,897 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [8] imperfect sequences [] total 8 [2025-02-05 20:13:33,897 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1140769698] [2025-02-05 20:13:33,897 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-02-05 20:13:33,897 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 8 states [2025-02-05 20:13:33,898 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-02-05 20:13:33,898 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2025-02-05 20:13:33,898 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=15, Invalid=41, Unknown=0, NotChecked=0, Total=56 [2025-02-05 20:13:33,899 INFO L87 Difference]: Start difference. First operand 1697 states and 2485 transitions. Second operand has 8 states, 8 states have (on average 25.5) internal successors, (204), 8 states have internal predecessors, (204), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-02-05 20:13:34,404 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-02-05 20:13:34,404 INFO L93 Difference]: Finished difference Result 2930 states and 4301 transitions. [2025-02-05 20:13:34,404 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2025-02-05 20:13:34,404 INFO L78 Accepts]: Start accepts. Automaton has has 8 states, 8 states have (on average 25.5) internal successors, (204), 8 states have internal predecessors, (204), 0 states have call successors, (0), 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 204 [2025-02-05 20:13:34,404 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-02-05 20:13:34,407 INFO L225 Difference]: With dead ends: 2930 [2025-02-05 20:13:34,407 INFO L226 Difference]: Without dead ends: 1759 [2025-02-05 20:13:34,408 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 8 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 6 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 2 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=15, Invalid=41, Unknown=0, NotChecked=0, Total=56 [2025-02-05 20:13:34,408 INFO L435 NwaCegarLoop]: 1432 mSDtfsCounter, 31 mSDsluCounter, 5775 mSDsCounter, 0 mSdLazyCounter, 1502 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.4s Time, 0 mProtectedPredicate, 0 mProtectedAction, 31 SdHoareTripleChecker+Valid, 7207 SdHoareTripleChecker+Invalid, 1502 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 1502 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.5s IncrementalHoareTripleChecker+Time [2025-02-05 20:13:34,409 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [31 Valid, 7207 Invalid, 1502 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 1502 Invalid, 0 Unknown, 0 Unchecked, 0.5s Time] [2025-02-05 20:13:34,410 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1759 states. [2025-02-05 20:13:34,419 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1759 to 1755. [2025-02-05 20:13:34,420 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 1755 states, 1754 states have (on average 1.4640820980615736) internal successors, (2568), 1754 states have internal predecessors, (2568), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-02-05 20:13:34,421 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1755 states to 1755 states and 2568 transitions. [2025-02-05 20:13:34,422 INFO L78 Accepts]: Start accepts. Automaton has 1755 states and 2568 transitions. Word has length 204 [2025-02-05 20:13:34,422 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-02-05 20:13:34,422 INFO L471 AbstractCegarLoop]: Abstraction has 1755 states and 2568 transitions. [2025-02-05 20:13:34,422 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 8 states, 8 states have (on average 25.5) internal successors, (204), 8 states have internal predecessors, (204), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-02-05 20:13:34,422 INFO L276 IsEmpty]: Start isEmpty. Operand 1755 states and 2568 transitions. [2025-02-05 20:13:34,423 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 205 [2025-02-05 20:13:34,423 INFO L210 NwaCegarLoop]: Found error trace [2025-02-05 20:13:34,423 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] [2025-02-05 20:13:34,423 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable20 [2025-02-05 20:13:34,423 INFO L396 AbstractCegarLoop]: === Iteration 22 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-02-05 20:13:34,423 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-02-05 20:13:34,424 INFO L85 PathProgramCache]: Analyzing trace with hash 571042429, now seen corresponding path program 1 times [2025-02-05 20:13:34,424 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-02-05 20:13:34,424 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1196498711] [2025-02-05 20:13:34,424 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-02-05 20:13:34,424 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-02-05 20:13:34,461 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 204 statements into 1 equivalence classes. [2025-02-05 20:13:34,479 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 204 of 204 statements. [2025-02-05 20:13:34,479 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-02-05 20:13:34,479 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-02-05 20:13:34,641 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-05 20:13:34,641 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-02-05 20:13:34,641 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1196498711] [2025-02-05 20:13:34,641 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1196498711] provided 1 perfect and 0 imperfect interpolant sequences [2025-02-05 20:13:34,641 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-02-05 20:13:34,641 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2025-02-05 20:13:34,642 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1755796407] [2025-02-05 20:13:34,642 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-02-05 20:13:34,642 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2025-02-05 20:13:34,642 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-02-05 20:13:34,642 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2025-02-05 20:13:34,642 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2025-02-05 20:13:34,642 INFO L87 Difference]: Start difference. First operand 1755 states and 2568 transitions. Second operand has 5 states, 5 states have (on average 40.8) internal successors, (204), 5 states have internal predecessors, (204), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-02-05 20:13:35,027 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-02-05 20:13:35,027 INFO L93 Difference]: Finished difference Result 2992 states and 4390 transitions. [2025-02-05 20:13:35,027 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2025-02-05 20:13:35,028 INFO L78 Accepts]: Start accepts. Automaton has has 5 states, 5 states have (on average 40.8) internal successors, (204), 5 states have internal predecessors, (204), 0 states have call successors, (0), 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 204 [2025-02-05 20:13:35,028 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-02-05 20:13:35,030 INFO L225 Difference]: With dead ends: 2992 [2025-02-05 20:13:35,031 INFO L226 Difference]: Without dead ends: 1779 [2025-02-05 20:13:35,032 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 6 GetRequests, 3 SyntacticMatches, 0 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2025-02-05 20:13:35,033 INFO L435 NwaCegarLoop]: 1434 mSDtfsCounter, 4 mSDsluCounter, 4292 mSDsCounter, 0 mSdLazyCounter, 1165 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.3s Time, 0 mProtectedPredicate, 0 mProtectedAction, 4 SdHoareTripleChecker+Valid, 5726 SdHoareTripleChecker+Invalid, 1165 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 1165 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.4s IncrementalHoareTripleChecker+Time [2025-02-05 20:13:35,033 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [4 Valid, 5726 Invalid, 1165 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 1165 Invalid, 0 Unknown, 0 Unchecked, 0.4s Time] [2025-02-05 20:13:35,034 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1779 states. [2025-02-05 20:13:35,045 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1779 to 1779. [2025-02-05 20:13:35,047 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 1779 states, 1778 states have (on average 1.4623172103487063) internal successors, (2600), 1778 states have internal predecessors, (2600), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-02-05 20:13:35,048 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1779 states to 1779 states and 2600 transitions. [2025-02-05 20:13:35,048 INFO L78 Accepts]: Start accepts. Automaton has 1779 states and 2600 transitions. Word has length 204 [2025-02-05 20:13:35,048 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-02-05 20:13:35,049 INFO L471 AbstractCegarLoop]: Abstraction has 1779 states and 2600 transitions. [2025-02-05 20:13:35,049 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 40.8) internal successors, (204), 5 states have internal predecessors, (204), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-02-05 20:13:35,049 INFO L276 IsEmpty]: Start isEmpty. Operand 1779 states and 2600 transitions. [2025-02-05 20:13:35,050 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 205 [2025-02-05 20:13:35,050 INFO L210 NwaCegarLoop]: Found error trace [2025-02-05 20:13:35,050 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] [2025-02-05 20:13:35,050 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable21 [2025-02-05 20:13:35,051 INFO L396 AbstractCegarLoop]: === Iteration 23 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-02-05 20:13:35,051 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-02-05 20:13:35,051 INFO L85 PathProgramCache]: Analyzing trace with hash -22263390, now seen corresponding path program 1 times [2025-02-05 20:13:35,051 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-02-05 20:13:35,051 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1786426374] [2025-02-05 20:13:35,051 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-02-05 20:13:35,052 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-02-05 20:13:35,091 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 204 statements into 1 equivalence classes. [2025-02-05 20:13:35,111 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 204 of 204 statements. [2025-02-05 20:13:35,111 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-02-05 20:13:35,111 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-02-05 20:13:35,279 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-05 20:13:35,279 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-02-05 20:13:35,279 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1786426374] [2025-02-05 20:13:35,279 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1786426374] provided 1 perfect and 0 imperfect interpolant sequences [2025-02-05 20:13:35,280 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-02-05 20:13:35,280 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2025-02-05 20:13:35,280 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [393785371] [2025-02-05 20:13:35,280 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-02-05 20:13:35,280 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2025-02-05 20:13:35,280 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-02-05 20:13:35,280 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2025-02-05 20:13:35,281 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2025-02-05 20:13:35,281 INFO L87 Difference]: Start difference. First operand 1779 states and 2600 transitions. Second operand has 4 states, 4 states have (on average 51.0) internal successors, (204), 4 states have internal predecessors, (204), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-02-05 20:13:35,602 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-02-05 20:13:35,602 INFO L93 Difference]: Finished difference Result 3127 states and 4577 transitions. [2025-02-05 20:13:35,603 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2025-02-05 20:13:35,603 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 4 states have (on average 51.0) internal successors, (204), 4 states have internal predecessors, (204), 0 states have call successors, (0), 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 204 [2025-02-05 20:13:35,603 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-02-05 20:13:35,605 INFO L225 Difference]: With dead ends: 3127 [2025-02-05 20:13:35,605 INFO L226 Difference]: Without dead ends: 1787 [2025-02-05 20:13:35,607 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 5 GetRequests, 3 SyntacticMatches, 0 SemanticMatches, 2 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2025-02-05 20:13:35,607 INFO L435 NwaCegarLoop]: 1435 mSDtfsCounter, 0 mSDsluCounter, 2862 mSDsCounter, 0 mSdLazyCounter, 871 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 0 SdHoareTripleChecker+Valid, 4297 SdHoareTripleChecker+Invalid, 871 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 871 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.3s IncrementalHoareTripleChecker+Time [2025-02-05 20:13:35,607 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [0 Valid, 4297 Invalid, 871 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 871 Invalid, 0 Unknown, 0 Unchecked, 0.3s Time] [2025-02-05 20:13:35,609 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1787 states. [2025-02-05 20:13:35,620 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1787 to 1787. [2025-02-05 20:13:35,622 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 1787 states, 1786 states have (on average 1.4602463605823068) internal successors, (2608), 1786 states have internal predecessors, (2608), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-02-05 20:13:35,623 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1787 states to 1787 states and 2608 transitions. [2025-02-05 20:13:35,624 INFO L78 Accepts]: Start accepts. Automaton has 1787 states and 2608 transitions. Word has length 204 [2025-02-05 20:13:35,624 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-02-05 20:13:35,624 INFO L471 AbstractCegarLoop]: Abstraction has 1787 states and 2608 transitions. [2025-02-05 20:13:35,624 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 51.0) internal successors, (204), 4 states have internal predecessors, (204), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-02-05 20:13:35,624 INFO L276 IsEmpty]: Start isEmpty. Operand 1787 states and 2608 transitions. [2025-02-05 20:13:35,625 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 205 [2025-02-05 20:13:35,625 INFO L210 NwaCegarLoop]: Found error trace [2025-02-05 20:13:35,626 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] [2025-02-05 20:13:35,626 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable22 [2025-02-05 20:13:35,626 INFO L396 AbstractCegarLoop]: === Iteration 24 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-02-05 20:13:35,626 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-02-05 20:13:35,626 INFO L85 PathProgramCache]: Analyzing trace with hash -954469009, now seen corresponding path program 1 times [2025-02-05 20:13:35,626 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-02-05 20:13:35,626 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [552296510] [2025-02-05 20:13:35,627 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-02-05 20:13:35,627 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-02-05 20:13:35,664 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 204 statements into 1 equivalence classes. [2025-02-05 20:13:35,807 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 204 of 204 statements. [2025-02-05 20:13:35,808 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-02-05 20:13:35,808 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-02-05 20:13:36,315 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-05 20:13:36,315 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-02-05 20:13:36,315 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [552296510] [2025-02-05 20:13:36,315 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [552296510] provided 1 perfect and 0 imperfect interpolant sequences [2025-02-05 20:13:36,315 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-02-05 20:13:36,315 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [12] imperfect sequences [] total 12 [2025-02-05 20:13:36,315 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1110301880] [2025-02-05 20:13:36,315 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-02-05 20:13:36,316 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 12 states [2025-02-05 20:13:36,316 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-02-05 20:13:36,316 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 12 interpolants. [2025-02-05 20:13:36,316 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=25, Invalid=107, Unknown=0, NotChecked=0, Total=132 [2025-02-05 20:13:36,316 INFO L87 Difference]: Start difference. First operand 1787 states and 2608 transitions. Second operand has 12 states, 12 states have (on average 17.0) internal successors, (204), 12 states have internal predecessors, (204), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-02-05 20:13:37,206 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-02-05 20:13:37,206 INFO L93 Difference]: Finished difference Result 3234 states and 4717 transitions. [2025-02-05 20:13:37,206 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 12 states. [2025-02-05 20:13:37,207 INFO L78 Accepts]: Start accepts. Automaton has has 12 states, 12 states have (on average 17.0) internal successors, (204), 12 states have internal predecessors, (204), 0 states have call successors, (0), 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 204 [2025-02-05 20:13:37,207 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-02-05 20:13:37,209 INFO L225 Difference]: With dead ends: 3234 [2025-02-05 20:13:37,209 INFO L226 Difference]: Without dead ends: 1901 [2025-02-05 20:13:37,210 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 14 GetRequests, 4 SyntacticMatches, 0 SemanticMatches, 10 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 4 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=25, Invalid=107, Unknown=0, NotChecked=0, Total=132 [2025-02-05 20:13:37,211 INFO L435 NwaCegarLoop]: 1425 mSDtfsCounter, 43 mSDsluCounter, 11445 mSDsCounter, 0 mSdLazyCounter, 2728 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.7s Time, 0 mProtectedPredicate, 0 mProtectedAction, 43 SdHoareTripleChecker+Valid, 12870 SdHoareTripleChecker+Invalid, 2728 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 2728 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.8s IncrementalHoareTripleChecker+Time [2025-02-05 20:13:37,211 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [43 Valid, 12870 Invalid, 2728 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 2728 Invalid, 0 Unknown, 0 Unchecked, 0.8s Time] [2025-02-05 20:13:37,212 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1901 states. [2025-02-05 20:13:37,223 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1901 to 1867. [2025-02-05 20:13:37,224 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 1867 states, 1866 states have (on average 1.4560557341907825) internal successors, (2717), 1866 states have internal predecessors, (2717), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-02-05 20:13:37,225 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1867 states to 1867 states and 2717 transitions. [2025-02-05 20:13:37,226 INFO L78 Accepts]: Start accepts. Automaton has 1867 states and 2717 transitions. Word has length 204 [2025-02-05 20:13:37,226 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-02-05 20:13:37,226 INFO L471 AbstractCegarLoop]: Abstraction has 1867 states and 2717 transitions. [2025-02-05 20:13:37,226 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 12 states, 12 states have (on average 17.0) internal successors, (204), 12 states have internal predecessors, (204), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-02-05 20:13:37,226 INFO L276 IsEmpty]: Start isEmpty. Operand 1867 states and 2717 transitions. [2025-02-05 20:13:37,227 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 205 [2025-02-05 20:13:37,228 INFO L210 NwaCegarLoop]: Found error trace [2025-02-05 20:13:37,228 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] [2025-02-05 20:13:37,228 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable23 [2025-02-05 20:13:37,228 INFO L396 AbstractCegarLoop]: === Iteration 25 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-02-05 20:13:37,228 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-02-05 20:13:37,228 INFO L85 PathProgramCache]: Analyzing trace with hash -1902280806, now seen corresponding path program 1 times [2025-02-05 20:13:37,228 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-02-05 20:13:37,229 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2056355899] [2025-02-05 20:13:37,229 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-02-05 20:13:37,229 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-02-05 20:13:37,269 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 204 statements into 1 equivalence classes. [2025-02-05 20:13:37,289 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 204 of 204 statements. [2025-02-05 20:13:37,289 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-02-05 20:13:37,289 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-02-05 20:13:37,475 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-05 20:13:37,476 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-02-05 20:13:37,476 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2056355899] [2025-02-05 20:13:37,476 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [2056355899] provided 1 perfect and 0 imperfect interpolant sequences [2025-02-05 20:13:37,476 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-02-05 20:13:37,476 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2025-02-05 20:13:37,476 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [399878343] [2025-02-05 20:13:37,476 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-02-05 20:13:37,476 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2025-02-05 20:13:37,477 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-02-05 20:13:37,477 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2025-02-05 20:13:37,477 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2025-02-05 20:13:37,477 INFO L87 Difference]: Start difference. First operand 1867 states and 2717 transitions. Second operand has 4 states, 4 states have (on average 51.0) internal successors, (204), 4 states have internal predecessors, (204), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-02-05 20:13:37,828 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-02-05 20:13:37,828 INFO L93 Difference]: Finished difference Result 3413 states and 4963 transitions. [2025-02-05 20:13:37,829 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2025-02-05 20:13:37,829 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 4 states have (on average 51.0) internal successors, (204), 4 states have internal predecessors, (204), 0 states have call successors, (0), 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 204 [2025-02-05 20:13:37,829 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-02-05 20:13:37,832 INFO L225 Difference]: With dead ends: 3413 [2025-02-05 20:13:37,832 INFO L226 Difference]: Without dead ends: 1879 [2025-02-05 20:13:37,833 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 5 GetRequests, 3 SyntacticMatches, 0 SemanticMatches, 2 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2025-02-05 20:13:37,833 INFO L435 NwaCegarLoop]: 1435 mSDtfsCounter, 0 mSDsluCounter, 2862 mSDsCounter, 0 mSdLazyCounter, 871 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.3s Time, 0 mProtectedPredicate, 0 mProtectedAction, 0 SdHoareTripleChecker+Valid, 4297 SdHoareTripleChecker+Invalid, 871 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 871 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.3s IncrementalHoareTripleChecker+Time [2025-02-05 20:13:37,833 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [0 Valid, 4297 Invalid, 871 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 871 Invalid, 0 Unknown, 0 Unchecked, 0.3s Time] [2025-02-05 20:13:37,835 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1879 states. [2025-02-05 20:13:37,845 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1879 to 1879. [2025-02-05 20:13:37,846 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 1879 states, 1878 states have (on average 1.4531416400425985) internal successors, (2729), 1878 states have internal predecessors, (2729), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-02-05 20:13:37,847 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1879 states to 1879 states and 2729 transitions. [2025-02-05 20:13:37,847 INFO L78 Accepts]: Start accepts. Automaton has 1879 states and 2729 transitions. Word has length 204 [2025-02-05 20:13:37,847 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-02-05 20:13:37,847 INFO L471 AbstractCegarLoop]: Abstraction has 1879 states and 2729 transitions. [2025-02-05 20:13:37,848 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 51.0) internal successors, (204), 4 states have internal predecessors, (204), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-02-05 20:13:37,848 INFO L276 IsEmpty]: Start isEmpty. Operand 1879 states and 2729 transitions. [2025-02-05 20:13:37,849 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 205 [2025-02-05 20:13:37,849 INFO L210 NwaCegarLoop]: Found error trace [2025-02-05 20:13:37,849 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] [2025-02-05 20:13:37,849 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable24 [2025-02-05 20:13:37,849 INFO L396 AbstractCegarLoop]: === Iteration 26 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-02-05 20:13:37,849 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-02-05 20:13:37,849 INFO L85 PathProgramCache]: Analyzing trace with hash -900992264, now seen corresponding path program 1 times [2025-02-05 20:13:37,849 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-02-05 20:13:37,849 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [486269579] [2025-02-05 20:13:37,849 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-02-05 20:13:37,849 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-02-05 20:13:37,883 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 204 statements into 1 equivalence classes. [2025-02-05 20:13:37,930 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 204 of 204 statements. [2025-02-05 20:13:37,930 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-02-05 20:13:37,930 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-02-05 20:13:38,313 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-05 20:13:38,313 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-02-05 20:13:38,313 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [486269579] [2025-02-05 20:13:38,313 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [486269579] provided 1 perfect and 0 imperfect interpolant sequences [2025-02-05 20:13:38,313 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-02-05 20:13:38,313 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2025-02-05 20:13:38,313 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1564957961] [2025-02-05 20:13:38,313 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-02-05 20:13:38,314 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2025-02-05 20:13:38,314 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-02-05 20:13:38,314 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2025-02-05 20:13:38,314 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=11, Invalid=19, Unknown=0, NotChecked=0, Total=30 [2025-02-05 20:13:38,314 INFO L87 Difference]: Start difference. First operand 1879 states and 2729 transitions. Second operand has 6 states, 6 states have (on average 34.0) internal successors, (204), 6 states have internal predecessors, (204), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-02-05 20:13:38,784 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-02-05 20:13:38,784 INFO L93 Difference]: Finished difference Result 4353 states and 6281 transitions. [2025-02-05 20:13:38,784 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2025-02-05 20:13:38,784 INFO L78 Accepts]: Start accepts. Automaton has has 6 states, 6 states have (on average 34.0) internal successors, (204), 6 states have internal predecessors, (204), 0 states have call successors, (0), 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 204 [2025-02-05 20:13:38,784 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-02-05 20:13:38,788 INFO L225 Difference]: With dead ends: 4353 [2025-02-05 20:13:38,788 INFO L226 Difference]: Without dead ends: 2745 [2025-02-05 20:13:38,789 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 8 GetRequests, 3 SyntacticMatches, 0 SemanticMatches, 5 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 2 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=16, Invalid=26, Unknown=0, NotChecked=0, Total=42 [2025-02-05 20:13:38,789 INFO L435 NwaCegarLoop]: 1411 mSDtfsCounter, 2024 mSDsluCounter, 4225 mSDsCounter, 0 mSdLazyCounter, 1256 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.4s Time, 0 mProtectedPredicate, 0 mProtectedAction, 2024 SdHoareTripleChecker+Valid, 5636 SdHoareTripleChecker+Invalid, 1256 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 1256 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.4s IncrementalHoareTripleChecker+Time [2025-02-05 20:13:38,790 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [2024 Valid, 5636 Invalid, 1256 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 1256 Invalid, 0 Unknown, 0 Unchecked, 0.4s Time] [2025-02-05 20:13:38,791 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 2745 states. [2025-02-05 20:13:38,806 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 2745 to 2145. [2025-02-05 20:13:38,808 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 2145 states, 2144 states have (on average 1.4575559701492538) internal successors, (3125), 2144 states have internal predecessors, (3125), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-02-05 20:13:38,809 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 2145 states to 2145 states and 3125 transitions. [2025-02-05 20:13:38,810 INFO L78 Accepts]: Start accepts. Automaton has 2145 states and 3125 transitions. Word has length 204 [2025-02-05 20:13:38,810 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-02-05 20:13:38,810 INFO L471 AbstractCegarLoop]: Abstraction has 2145 states and 3125 transitions. [2025-02-05 20:13:38,810 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 6 states have (on average 34.0) internal successors, (204), 6 states have internal predecessors, (204), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-02-05 20:13:38,810 INFO L276 IsEmpty]: Start isEmpty. Operand 2145 states and 3125 transitions. [2025-02-05 20:13:38,812 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 206 [2025-02-05 20:13:38,812 INFO L210 NwaCegarLoop]: Found error trace [2025-02-05 20:13:38,812 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] [2025-02-05 20:13:38,812 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable25 [2025-02-05 20:13:38,813 INFO L396 AbstractCegarLoop]: === Iteration 27 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-02-05 20:13:38,813 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-02-05 20:13:38,813 INFO L85 PathProgramCache]: Analyzing trace with hash 583672697, now seen corresponding path program 1 times [2025-02-05 20:13:38,813 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-02-05 20:13:38,814 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2060148128] [2025-02-05 20:13:38,814 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-02-05 20:13:38,814 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-02-05 20:13:38,850 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 205 statements into 1 equivalence classes. [2025-02-05 20:13:39,080 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 205 of 205 statements. [2025-02-05 20:13:39,081 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-02-05 20:13:39,081 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-02-05 20:13:39,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-05 20:13:39,373 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-02-05 20:13:39,373 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2060148128] [2025-02-05 20:13:39,373 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [2060148128] provided 1 perfect and 0 imperfect interpolant sequences [2025-02-05 20:13:39,373 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-02-05 20:13:39,373 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2025-02-05 20:13:39,373 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [728127412] [2025-02-05 20:13:39,373 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-02-05 20:13:39,373 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2025-02-05 20:13:39,373 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-02-05 20:13:39,374 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2025-02-05 20:13:39,374 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2025-02-05 20:13:39,374 INFO L87 Difference]: Start difference. First operand 2145 states and 3125 transitions. Second operand has 5 states, 5 states have (on average 41.0) internal successors, (205), 5 states have internal predecessors, (205), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-02-05 20:13:39,788 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-02-05 20:13:39,788 INFO L93 Difference]: Finished difference Result 3423 states and 4999 transitions. [2025-02-05 20:13:39,788 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2025-02-05 20:13:39,788 INFO L78 Accepts]: Start accepts. Automaton has has 5 states, 5 states have (on average 41.0) internal successors, (205), 5 states have internal predecessors, (205), 0 states have call successors, (0), 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 205 [2025-02-05 20:13:39,789 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-02-05 20:13:39,791 INFO L225 Difference]: With dead ends: 3423 [2025-02-05 20:13:39,791 INFO L226 Difference]: Without dead ends: 2156 [2025-02-05 20:13:39,793 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 5 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2025-02-05 20:13:39,793 INFO L435 NwaCegarLoop]: 1432 mSDtfsCounter, 5 mSDsluCounter, 4288 mSDsCounter, 0 mSdLazyCounter, 1171 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.3s Time, 0 mProtectedPredicate, 0 mProtectedAction, 5 SdHoareTripleChecker+Valid, 5720 SdHoareTripleChecker+Invalid, 1171 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 1171 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.4s IncrementalHoareTripleChecker+Time [2025-02-05 20:13:39,793 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [5 Valid, 5720 Invalid, 1171 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 1171 Invalid, 0 Unknown, 0 Unchecked, 0.4s Time] [2025-02-05 20:13:39,795 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 2156 states. [2025-02-05 20:13:39,806 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 2156 to 2153. [2025-02-05 20:13:39,808 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 2153 states, 2152 states have (on average 1.4567843866171004) internal successors, (3135), 2152 states have internal predecessors, (3135), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-02-05 20:13:39,809 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 2153 states to 2153 states and 3135 transitions. [2025-02-05 20:13:39,810 INFO L78 Accepts]: Start accepts. Automaton has 2153 states and 3135 transitions. Word has length 205 [2025-02-05 20:13:39,810 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-02-05 20:13:39,810 INFO L471 AbstractCegarLoop]: Abstraction has 2153 states and 3135 transitions. [2025-02-05 20:13:39,810 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 41.0) internal successors, (205), 5 states have internal predecessors, (205), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-02-05 20:13:39,810 INFO L276 IsEmpty]: Start isEmpty. Operand 2153 states and 3135 transitions. [2025-02-05 20:13:39,812 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 206 [2025-02-05 20:13:39,812 INFO L210 NwaCegarLoop]: Found error trace [2025-02-05 20:13:39,812 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] [2025-02-05 20:13:39,812 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable26 [2025-02-05 20:13:39,812 INFO L396 AbstractCegarLoop]: === Iteration 28 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-02-05 20:13:39,812 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-02-05 20:13:39,812 INFO L85 PathProgramCache]: Analyzing trace with hash -376698050, now seen corresponding path program 1 times [2025-02-05 20:13:39,813 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-02-05 20:13:39,813 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1195487820] [2025-02-05 20:13:39,813 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-02-05 20:13:39,813 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-02-05 20:13:39,849 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 205 statements into 1 equivalence classes. [2025-02-05 20:13:40,010 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 205 of 205 statements. [2025-02-05 20:13:40,011 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-02-05 20:13:40,011 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-02-05 20:13:40,238 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-05 20:13:40,238 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-02-05 20:13:40,239 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1195487820] [2025-02-05 20:13:40,239 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1195487820] provided 1 perfect and 0 imperfect interpolant sequences [2025-02-05 20:13:40,239 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-02-05 20:13:40,239 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2025-02-05 20:13:40,239 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1149469267] [2025-02-05 20:13:40,239 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-02-05 20:13:40,239 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 7 states [2025-02-05 20:13:40,239 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-02-05 20:13:40,239 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2025-02-05 20:13:40,239 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=12, Invalid=30, Unknown=0, NotChecked=0, Total=42 [2025-02-05 20:13:40,240 INFO L87 Difference]: Start difference. First operand 2153 states and 3135 transitions. Second operand has 7 states, 7 states have (on average 29.285714285714285) internal successors, (205), 7 states have internal predecessors, (205), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-02-05 20:13:41,185 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-02-05 20:13:41,186 INFO L93 Difference]: Finished difference Result 4652 states and 6755 transitions. [2025-02-05 20:13:41,186 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2025-02-05 20:13:41,186 INFO L78 Accepts]: Start accepts. Automaton has has 7 states, 7 states have (on average 29.285714285714285) internal successors, (205), 7 states have internal predecessors, (205), 0 states have call successors, (0), 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 205 [2025-02-05 20:13:41,186 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-02-05 20:13:41,191 INFO L225 Difference]: With dead ends: 4652 [2025-02-05 20:13:41,191 INFO L226 Difference]: Without dead ends: 3377 [2025-02-05 20:13:41,192 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 8 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 6 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=17, Invalid=39, Unknown=0, NotChecked=0, Total=56 [2025-02-05 20:13:41,193 INFO L435 NwaCegarLoop]: 1950 mSDtfsCounter, 1116 mSDsluCounter, 7377 mSDsCounter, 0 mSdLazyCounter, 2520 mSolverCounterSat, 13 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.7s Time, 0 mProtectedPredicate, 0 mProtectedAction, 1116 SdHoareTripleChecker+Valid, 9327 SdHoareTripleChecker+Invalid, 2533 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 13 IncrementalHoareTripleChecker+Valid, 2520 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.9s IncrementalHoareTripleChecker+Time [2025-02-05 20:13:41,194 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [1116 Valid, 9327 Invalid, 2533 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [13 Valid, 2520 Invalid, 0 Unknown, 0 Unchecked, 0.9s Time] [2025-02-05 20:13:41,196 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 3377 states. [2025-02-05 20:13:41,213 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 3377 to 3007. [2025-02-05 20:13:41,215 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 3007 states, 3006 states have (on average 1.4464404524284764) internal successors, (4348), 3006 states have internal predecessors, (4348), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-02-05 20:13:41,218 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3007 states to 3007 states and 4348 transitions. [2025-02-05 20:13:41,218 INFO L78 Accepts]: Start accepts. Automaton has 3007 states and 4348 transitions. Word has length 205 [2025-02-05 20:13:41,218 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-02-05 20:13:41,218 INFO L471 AbstractCegarLoop]: Abstraction has 3007 states and 4348 transitions. [2025-02-05 20:13:41,218 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 7 states, 7 states have (on average 29.285714285714285) internal successors, (205), 7 states have internal predecessors, (205), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-02-05 20:13:41,219 INFO L276 IsEmpty]: Start isEmpty. Operand 3007 states and 4348 transitions. [2025-02-05 20:13:41,221 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 206 [2025-02-05 20:13:41,221 INFO L210 NwaCegarLoop]: Found error trace [2025-02-05 20:13:41,221 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] [2025-02-05 20:13:41,221 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable27 [2025-02-05 20:13:41,222 INFO L396 AbstractCegarLoop]: === Iteration 29 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-02-05 20:13:41,222 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-02-05 20:13:41,222 INFO L85 PathProgramCache]: Analyzing trace with hash 1421848621, now seen corresponding path program 1 times [2025-02-05 20:13:41,222 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-02-05 20:13:41,222 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2131986431] [2025-02-05 20:13:41,222 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-02-05 20:13:41,222 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-02-05 20:13:41,260 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 205 statements into 1 equivalence classes. [2025-02-05 20:13:41,403 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 205 of 205 statements. [2025-02-05 20:13:41,403 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-02-05 20:13:41,403 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-02-05 20:13:41,652 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-05 20:13:41,653 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-02-05 20:13:41,653 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2131986431] [2025-02-05 20:13:41,653 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [2131986431] provided 1 perfect and 0 imperfect interpolant sequences [2025-02-05 20:13:41,653 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-02-05 20:13:41,653 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2025-02-05 20:13:41,653 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2091389446] [2025-02-05 20:13:41,653 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-02-05 20:13:41,653 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2025-02-05 20:13:41,653 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-02-05 20:13:41,654 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2025-02-05 20:13:41,654 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2025-02-05 20:13:41,654 INFO L87 Difference]: Start difference. First operand 3007 states and 4348 transitions. Second operand has 5 states, 5 states have (on average 41.0) internal successors, (205), 5 states have internal predecessors, (205), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-02-05 20:13:42,076 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-02-05 20:13:42,077 INFO L93 Difference]: Finished difference Result 4763 states and 6888 transitions. [2025-02-05 20:13:42,077 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2025-02-05 20:13:42,077 INFO L78 Accepts]: Start accepts. Automaton has has 5 states, 5 states have (on average 41.0) internal successors, (205), 5 states have internal predecessors, (205), 0 states have call successors, (0), 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 205 [2025-02-05 20:13:42,077 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-02-05 20:13:42,081 INFO L225 Difference]: With dead ends: 4763 [2025-02-05 20:13:42,081 INFO L226 Difference]: Without dead ends: 3174 [2025-02-05 20:13:42,083 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 7 GetRequests, 3 SyntacticMatches, 0 SemanticMatches, 4 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=11, Invalid=19, Unknown=0, NotChecked=0, Total=30 [2025-02-05 20:13:42,084 INFO L435 NwaCegarLoop]: 1436 mSDtfsCounter, 501 mSDsluCounter, 4291 mSDsCounter, 0 mSdLazyCounter, 1194 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.3s Time, 0 mProtectedPredicate, 0 mProtectedAction, 501 SdHoareTripleChecker+Valid, 5727 SdHoareTripleChecker+Invalid, 1194 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 1194 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.4s IncrementalHoareTripleChecker+Time [2025-02-05 20:13:42,084 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [501 Valid, 5727 Invalid, 1194 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 1194 Invalid, 0 Unknown, 0 Unchecked, 0.4s Time] [2025-02-05 20:13:42,085 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 3174 states. [2025-02-05 20:13:42,104 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 3174 to 3000. [2025-02-05 20:13:42,106 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 3000 states, 2999 states have (on average 1.44648216072024) internal successors, (4338), 2999 states have internal predecessors, (4338), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-02-05 20:13:42,109 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3000 states to 3000 states and 4338 transitions. [2025-02-05 20:13:42,109 INFO L78 Accepts]: Start accepts. Automaton has 3000 states and 4338 transitions. Word has length 205 [2025-02-05 20:13:42,109 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-02-05 20:13:42,109 INFO L471 AbstractCegarLoop]: Abstraction has 3000 states and 4338 transitions. [2025-02-05 20:13:42,109 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 41.0) internal successors, (205), 5 states have internal predecessors, (205), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-02-05 20:13:42,110 INFO L276 IsEmpty]: Start isEmpty. Operand 3000 states and 4338 transitions. [2025-02-05 20:13:42,112 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 206 [2025-02-05 20:13:42,112 INFO L210 NwaCegarLoop]: Found error trace [2025-02-05 20:13:42,112 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] [2025-02-05 20:13:42,112 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable28 [2025-02-05 20:13:42,113 INFO L396 AbstractCegarLoop]: === Iteration 30 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-02-05 20:13:42,113 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-02-05 20:13:42,113 INFO L85 PathProgramCache]: Analyzing trace with hash -295651808, now seen corresponding path program 1 times [2025-02-05 20:13:42,113 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-02-05 20:13:42,113 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1929544156] [2025-02-05 20:13:42,113 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-02-05 20:13:42,113 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-02-05 20:13:42,153 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 205 statements into 1 equivalence classes. [2025-02-05 20:13:42,295 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 205 of 205 statements. [2025-02-05 20:13:42,296 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-02-05 20:13:42,296 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-02-05 20:13:42,609 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-05 20:13:42,609 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-02-05 20:13:42,609 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1929544156] [2025-02-05 20:13:42,609 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1929544156] provided 1 perfect and 0 imperfect interpolant sequences [2025-02-05 20:13:42,609 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-02-05 20:13:42,609 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2025-02-05 20:13:42,609 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1940356417] [2025-02-05 20:13:42,609 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-02-05 20:13:42,609 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2025-02-05 20:13:42,609 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-02-05 20:13:42,610 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2025-02-05 20:13:42,610 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2025-02-05 20:13:42,610 INFO L87 Difference]: Start difference. First operand 3000 states and 4338 transitions. Second operand has 5 states, 5 states have (on average 41.0) internal successors, (205), 5 states have internal predecessors, (205), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-02-05 20:13:43,056 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-02-05 20:13:43,056 INFO L93 Difference]: Finished difference Result 4617 states and 6690 transitions. [2025-02-05 20:13:43,056 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2025-02-05 20:13:43,056 INFO L78 Accepts]: Start accepts. Automaton has has 5 states, 5 states have (on average 41.0) internal successors, (205), 5 states have internal predecessors, (205), 0 states have call successors, (0), 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 205 [2025-02-05 20:13:43,056 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-02-05 20:13:43,060 INFO L225 Difference]: With dead ends: 4617 [2025-02-05 20:13:43,060 INFO L226 Difference]: Without dead ends: 3150 [2025-02-05 20:13:43,062 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 7 GetRequests, 3 SyntacticMatches, 0 SemanticMatches, 4 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=11, Invalid=19, Unknown=0, NotChecked=0, Total=30 [2025-02-05 20:13:43,062 INFO L435 NwaCegarLoop]: 1435 mSDtfsCounter, 481 mSDsluCounter, 4288 mSDsCounter, 0 mSdLazyCounter, 1192 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.3s Time, 0 mProtectedPredicate, 0 mProtectedAction, 481 SdHoareTripleChecker+Valid, 5723 SdHoareTripleChecker+Invalid, 1192 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 1192 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.4s IncrementalHoareTripleChecker+Time [2025-02-05 20:13:43,063 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [481 Valid, 5723 Invalid, 1192 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 1192 Invalid, 0 Unknown, 0 Unchecked, 0.4s Time] [2025-02-05 20:13:43,065 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 3150 states. [2025-02-05 20:13:43,089 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 3150 to 2976. [2025-02-05 20:13:43,091 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 2976 states, 2975 states have (on average 1.4467226890756302) internal successors, (4304), 2975 states have internal predecessors, (4304), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-02-05 20:13:43,095 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 2976 states to 2976 states and 4304 transitions. [2025-02-05 20:13:43,095 INFO L78 Accepts]: Start accepts. Automaton has 2976 states and 4304 transitions. Word has length 205 [2025-02-05 20:13:43,095 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-02-05 20:13:43,095 INFO L471 AbstractCegarLoop]: Abstraction has 2976 states and 4304 transitions. [2025-02-05 20:13:43,095 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 41.0) internal successors, (205), 5 states have internal predecessors, (205), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-02-05 20:13:43,096 INFO L276 IsEmpty]: Start isEmpty. Operand 2976 states and 4304 transitions. [2025-02-05 20:13:43,098 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 206 [2025-02-05 20:13:43,098 INFO L210 NwaCegarLoop]: Found error trace [2025-02-05 20:13:43,099 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] [2025-02-05 20:13:43,099 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable29 [2025-02-05 20:13:43,099 INFO L396 AbstractCegarLoop]: === Iteration 31 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-02-05 20:13:43,099 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-02-05 20:13:43,099 INFO L85 PathProgramCache]: Analyzing trace with hash 1194692706, now seen corresponding path program 1 times [2025-02-05 20:13:43,099 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-02-05 20:13:43,100 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [841761445] [2025-02-05 20:13:43,100 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-02-05 20:13:43,100 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-02-05 20:13:43,148 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 205 statements into 1 equivalence classes. [2025-02-05 20:13:43,420 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 205 of 205 statements. [2025-02-05 20:13:43,421 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-02-05 20:13:43,421 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-02-05 20:13:44,126 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-05 20:13:44,126 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-02-05 20:13:44,127 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [841761445] [2025-02-05 20:13:44,127 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [841761445] provided 1 perfect and 0 imperfect interpolant sequences [2025-02-05 20:13:44,127 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-02-05 20:13:44,127 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [8] imperfect sequences [] total 8 [2025-02-05 20:13:44,127 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1646623750] [2025-02-05 20:13:44,127 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-02-05 20:13:44,127 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 8 states [2025-02-05 20:13:44,127 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-02-05 20:13:44,128 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2025-02-05 20:13:44,128 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=16, Invalid=40, Unknown=0, NotChecked=0, Total=56 [2025-02-05 20:13:44,128 INFO L87 Difference]: Start difference. First operand 2976 states and 4304 transitions. Second operand has 8 states, 8 states have (on average 25.625) internal successors, (205), 8 states have internal predecessors, (205), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-02-05 20:13:44,789 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-02-05 20:13:44,790 INFO L93 Difference]: Finished difference Result 6435 states and 9293 transitions. [2025-02-05 20:13:44,790 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2025-02-05 20:13:44,790 INFO L78 Accepts]: Start accepts. Automaton has has 8 states, 8 states have (on average 25.625) internal successors, (205), 8 states have internal predecessors, (205), 0 states have call successors, (0), 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 205 [2025-02-05 20:13:44,790 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-02-05 20:13:44,795 INFO L225 Difference]: With dead ends: 6435 [2025-02-05 20:13:44,795 INFO L226 Difference]: Without dead ends: 5160 [2025-02-05 20:13:44,797 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 11 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 9 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 10 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=30, Invalid=80, Unknown=0, NotChecked=0, Total=110 [2025-02-05 20:13:44,798 INFO L435 NwaCegarLoop]: 1410 mSDtfsCounter, 2412 mSDsluCounter, 5898 mSDsCounter, 0 mSdLazyCounter, 1636 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.5s Time, 0 mProtectedPredicate, 0 mProtectedAction, 2412 SdHoareTripleChecker+Valid, 7308 SdHoareTripleChecker+Invalid, 1636 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 1636 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.6s IncrementalHoareTripleChecker+Time [2025-02-05 20:13:44,798 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [2412 Valid, 7308 Invalid, 1636 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 1636 Invalid, 0 Unknown, 0 Unchecked, 0.6s Time] [2025-02-05 20:13:44,800 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 5160 states. [2025-02-05 20:13:44,830 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 5160 to 5156. [2025-02-05 20:13:44,834 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 5156 states, 5155 states have (on average 1.4393792434529582) internal successors, (7420), 5155 states have internal predecessors, (7420), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-02-05 20:13:44,839 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5156 states to 5156 states and 7420 transitions. [2025-02-05 20:13:44,840 INFO L78 Accepts]: Start accepts. Automaton has 5156 states and 7420 transitions. Word has length 205 [2025-02-05 20:13:44,840 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-02-05 20:13:44,840 INFO L471 AbstractCegarLoop]: Abstraction has 5156 states and 7420 transitions. [2025-02-05 20:13:44,840 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 8 states, 8 states have (on average 25.625) internal successors, (205), 8 states have internal predecessors, (205), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-02-05 20:13:44,840 INFO L276 IsEmpty]: Start isEmpty. Operand 5156 states and 7420 transitions. [2025-02-05 20:13:44,845 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 206 [2025-02-05 20:13:44,845 INFO L210 NwaCegarLoop]: Found error trace [2025-02-05 20:13:44,845 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] [2025-02-05 20:13:44,845 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable30 [2025-02-05 20:13:44,846 INFO L396 AbstractCegarLoop]: === Iteration 32 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-02-05 20:13:44,846 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-02-05 20:13:44,846 INFO L85 PathProgramCache]: Analyzing trace with hash -1133692704, now seen corresponding path program 1 times [2025-02-05 20:13:44,846 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-02-05 20:13:44,846 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2018418181] [2025-02-05 20:13:44,846 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-02-05 20:13:44,846 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-02-05 20:13:44,884 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 205 statements into 1 equivalence classes. [2025-02-05 20:13:44,990 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 205 of 205 statements. [2025-02-05 20:13:44,990 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-02-05 20:13:44,990 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-02-05 20:13:45,411 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-02-05 20:13:45,411 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-02-05 20:13:45,411 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2018418181] [2025-02-05 20:13:45,411 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [2018418181] provided 1 perfect and 0 imperfect interpolant sequences [2025-02-05 20:13:45,411 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-02-05 20:13:45,411 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2025-02-05 20:13:45,411 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [212058645] [2025-02-05 20:13:45,411 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-02-05 20:13:45,411 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 7 states [2025-02-05 20:13:45,411 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-02-05 20:13:45,411 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2025-02-05 20:13:45,412 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=14, Invalid=28, Unknown=0, NotChecked=0, Total=42 [2025-02-05 20:13:45,412 INFO L87 Difference]: Start difference. First operand 5156 states and 7420 transitions. Second operand has 7 states, 7 states have (on average 29.285714285714285) internal successors, (205), 7 states have internal predecessors, (205), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-02-05 20:13:46,007 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-02-05 20:13:46,008 INFO L93 Difference]: Finished difference Result 6435 states and 9293 transitions. [2025-02-05 20:13:46,008 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2025-02-05 20:13:46,008 INFO L78 Accepts]: Start accepts. Automaton has has 7 states, 7 states have (on average 29.285714285714285) internal successors, (205), 7 states have internal predecessors, (205), 0 states have call successors, (0), 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 205 [2025-02-05 20:13:46,008 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-02-05 20:13:46,012 INFO L225 Difference]: With dead ends: 6435 [2025-02-05 20:13:46,012 INFO L226 Difference]: Without dead ends: 5160 [2025-02-05 20:13:46,014 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 10 GetRequests, 4 SyntacticMatches, 0 SemanticMatches, 6 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 3 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=18, Invalid=38, Unknown=0, NotChecked=0, Total=56 [2025-02-05 20:13:46,014 INFO L435 NwaCegarLoop]: 1399 mSDtfsCounter, 1746 mSDsluCounter, 5322 mSDsCounter, 0 mSdLazyCounter, 1559 mSolverCounterSat, 1 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.5s Time, 0 mProtectedPredicate, 0 mProtectedAction, 1746 SdHoareTripleChecker+Valid, 6721 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.6s IncrementalHoareTripleChecker+Time [2025-02-05 20:13:46,015 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [1746 Valid, 6721 Invalid, 1560 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [1 Valid, 1559 Invalid, 0 Unknown, 0 Unchecked, 0.6s Time] [2025-02-05 20:13:46,020 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 5160 states. [2025-02-05 20:13:46,052 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 5160 to 5156. [2025-02-05 20:13:46,057 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 5156 states, 5155 states have (on average 1.4393792434529582) internal successors, (7420), 5155 states have internal predecessors, (7420), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-02-05 20:13:46,062 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5156 states to 5156 states and 7420 transitions. [2025-02-05 20:13:46,063 INFO L78 Accepts]: Start accepts. Automaton has 5156 states and 7420 transitions. Word has length 205 [2025-02-05 20:13:46,063 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-02-05 20:13:46,063 INFO L471 AbstractCegarLoop]: Abstraction has 5156 states and 7420 transitions. [2025-02-05 20:13:46,063 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 7 states, 7 states have (on average 29.285714285714285) internal successors, (205), 7 states have internal predecessors, (205), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-02-05 20:13:46,063 INFO L276 IsEmpty]: Start isEmpty. Operand 5156 states and 7420 transitions. [2025-02-05 20:13:46,069 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 206 [2025-02-05 20:13:46,069 INFO L210 NwaCegarLoop]: Found error trace [2025-02-05 20:13:46,069 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] [2025-02-05 20:13:46,069 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable31 [2025-02-05 20:13:46,069 INFO L396 AbstractCegarLoop]: === Iteration 33 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-02-05 20:13:46,070 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-02-05 20:13:46,070 INFO L85 PathProgramCache]: Analyzing trace with hash 351987141, now seen corresponding path program 1 times [2025-02-05 20:13:46,070 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-02-05 20:13:46,070 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [311389816] [2025-02-05 20:13:46,070 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-02-05 20:13:46,070 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-02-05 20:13:46,106 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 205 statements into 1 equivalence classes. [2025-02-05 20:13:46,170 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 205 of 205 statements. [2025-02-05 20:13:46,171 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-02-05 20:13:46,171 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-02-05 20:13:46,330 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-05 20:13:46,330 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-02-05 20:13:46,330 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [311389816] [2025-02-05 20:13:46,330 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [311389816] provided 1 perfect and 0 imperfect interpolant sequences [2025-02-05 20:13:46,330 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-02-05 20:13:46,331 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2025-02-05 20:13:46,331 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [122848597] [2025-02-05 20:13:46,331 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-02-05 20:13:46,331 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2025-02-05 20:13:46,331 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-02-05 20:13:46,331 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2025-02-05 20:13:46,331 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2025-02-05 20:13:46,332 INFO L87 Difference]: Start difference. First operand 5156 states and 7420 transitions. Second operand has 5 states, 5 states have (on average 41.0) internal successors, (205), 5 states have internal predecessors, (205), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-02-05 20:13:46,708 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-02-05 20:13:46,708 INFO L93 Difference]: Finished difference Result 6475 states and 9353 transitions. [2025-02-05 20:13:46,708 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2025-02-05 20:13:46,708 INFO L78 Accepts]: Start accepts. Automaton has has 5 states, 5 states have (on average 41.0) internal successors, (205), 5 states have internal predecessors, (205), 0 states have call successors, (0), 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 205 [2025-02-05 20:13:46,708 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-02-05 20:13:46,712 INFO L225 Difference]: With dead ends: 6475 [2025-02-05 20:13:46,712 INFO L226 Difference]: Without dead ends: 5200 [2025-02-05 20:13:46,714 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 6 GetRequests, 3 SyntacticMatches, 0 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2025-02-05 20:13:46,714 INFO L435 NwaCegarLoop]: 1434 mSDtfsCounter, 20 mSDsluCounter, 4292 mSDsCounter, 0 mSdLazyCounter, 1165 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.3s Time, 0 mProtectedPredicate, 0 mProtectedAction, 20 SdHoareTripleChecker+Valid, 5726 SdHoareTripleChecker+Invalid, 1165 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 1165 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.3s IncrementalHoareTripleChecker+Time [2025-02-05 20:13:46,714 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [20 Valid, 5726 Invalid, 1165 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 1165 Invalid, 0 Unknown, 0 Unchecked, 0.3s Time] [2025-02-05 20:13:46,716 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 5200 states. [2025-02-05 20:13:46,746 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 5200 to 5200. [2025-02-05 20:13:46,750 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 5200 states, 5199 states have (on average 1.4395075976149259) internal successors, (7484), 5199 states have internal predecessors, (7484), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-02-05 20:13:46,754 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5200 states to 5200 states and 7484 transitions. [2025-02-05 20:13:46,754 INFO L78 Accepts]: Start accepts. Automaton has 5200 states and 7484 transitions. Word has length 205 [2025-02-05 20:13:46,755 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-02-05 20:13:46,755 INFO L471 AbstractCegarLoop]: Abstraction has 5200 states and 7484 transitions. [2025-02-05 20:13:46,755 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 41.0) internal successors, (205), 5 states have internal predecessors, (205), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-02-05 20:13:46,755 INFO L276 IsEmpty]: Start isEmpty. Operand 5200 states and 7484 transitions. [2025-02-05 20:13:46,759 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 207 [2025-02-05 20:13:46,760 INFO L210 NwaCegarLoop]: Found error trace [2025-02-05 20:13:46,760 INFO L218 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-02-05 20:13:46,760 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable32 [2025-02-05 20:13:46,760 INFO L396 AbstractCegarLoop]: === Iteration 34 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-02-05 20:13:46,760 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-02-05 20:13:46,760 INFO L85 PathProgramCache]: Analyzing trace with hash -862953500, now seen corresponding path program 1 times [2025-02-05 20:13:46,761 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-02-05 20:13:46,761 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [828597162] [2025-02-05 20:13:46,761 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-02-05 20:13:46,761 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-02-05 20:13:46,796 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 206 statements into 1 equivalence classes. [2025-02-05 20:13:46,984 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 206 of 206 statements. [2025-02-05 20:13:46,984 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-02-05 20:13:46,984 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-02-05 20:13:47,666 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-05 20:13:47,666 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-02-05 20:13:47,666 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [828597162] [2025-02-05 20:13:47,666 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [828597162] provided 1 perfect and 0 imperfect interpolant sequences [2025-02-05 20:13:47,666 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-02-05 20:13:47,666 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [11] imperfect sequences [] total 11 [2025-02-05 20:13:47,666 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [588767193] [2025-02-05 20:13:47,666 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-02-05 20:13:47,667 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 11 states [2025-02-05 20:13:47,667 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-02-05 20:13:47,667 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 11 interpolants. [2025-02-05 20:13:47,667 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=27, Invalid=83, Unknown=0, NotChecked=0, Total=110 [2025-02-05 20:13:47,667 INFO L87 Difference]: Start difference. First operand 5200 states and 7484 transitions. Second operand has 11 states, 11 states have (on average 18.727272727272727) internal successors, (206), 11 states have internal predecessors, (206), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-02-05 20:13:48,427 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-02-05 20:13:48,427 INFO L93 Difference]: Finished difference Result 8230 states and 11833 transitions. [2025-02-05 20:13:48,427 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 11 states. [2025-02-05 20:13:48,427 INFO L78 Accepts]: Start accepts. Automaton has has 11 states, 11 states have (on average 18.727272727272727) internal successors, (206), 11 states have internal predecessors, (206), 0 states have call successors, (0), 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 206 [2025-02-05 20:13:48,427 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-02-05 20:13:48,433 INFO L225 Difference]: With dead ends: 8230 [2025-02-05 20:13:48,433 INFO L226 Difference]: Without dead ends: 6835 [2025-02-05 20:13:48,435 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 14 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 12 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 18 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=44, Invalid=138, Unknown=0, NotChecked=0, Total=182 [2025-02-05 20:13:48,436 INFO L435 NwaCegarLoop]: 1411 mSDtfsCounter, 1995 mSDsluCounter, 7896 mSDsCounter, 0 mSdLazyCounter, 2181 mSolverCounterSat, 1 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.6s Time, 0 mProtectedPredicate, 0 mProtectedAction, 1995 SdHoareTripleChecker+Valid, 9307 SdHoareTripleChecker+Invalid, 2182 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 1 IncrementalHoareTripleChecker+Valid, 2181 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.7s IncrementalHoareTripleChecker+Time [2025-02-05 20:13:48,436 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [1995 Valid, 9307 Invalid, 2182 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [1 Valid, 2181 Invalid, 0 Unknown, 0 Unchecked, 0.7s Time] [2025-02-05 20:13:48,438 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 6835 states. [2025-02-05 20:13:48,477 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 6835 to 6530. [2025-02-05 20:13:48,482 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 6530 states, 6529 states have (on average 1.4305406647266043) internal successors, (9340), 6529 states have internal predecessors, (9340), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-02-05 20:13:48,487 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 6530 states to 6530 states and 9340 transitions. [2025-02-05 20:13:48,487 INFO L78 Accepts]: Start accepts. Automaton has 6530 states and 9340 transitions. Word has length 206 [2025-02-05 20:13:48,487 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-02-05 20:13:48,487 INFO L471 AbstractCegarLoop]: Abstraction has 6530 states and 9340 transitions. [2025-02-05 20:13:48,488 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 11 states, 11 states have (on average 18.727272727272727) internal successors, (206), 11 states have internal predecessors, (206), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-02-05 20:13:48,488 INFO L276 IsEmpty]: Start isEmpty. Operand 6530 states and 9340 transitions. [2025-02-05 20:13:48,493 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 207 [2025-02-05 20:13:48,494 INFO L210 NwaCegarLoop]: Found error trace [2025-02-05 20:13:48,494 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] [2025-02-05 20:13:48,494 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable33 [2025-02-05 20:13:48,494 INFO L396 AbstractCegarLoop]: === Iteration 35 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-02-05 20:13:48,494 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-02-05 20:13:48,494 INFO L85 PathProgramCache]: Analyzing trace with hash -377658689, now seen corresponding path program 1 times [2025-02-05 20:13:48,494 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-02-05 20:13:48,494 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2005579841] [2025-02-05 20:13:48,494 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-02-05 20:13:48,494 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-02-05 20:13:48,532 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 206 statements into 1 equivalence classes. [2025-02-05 20:13:48,616 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 206 of 206 statements. [2025-02-05 20:13:48,616 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-02-05 20:13:48,616 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-02-05 20:13:49,022 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-05 20:13:49,022 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-02-05 20:13:49,022 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2005579841] [2025-02-05 20:13:49,022 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [2005579841] provided 1 perfect and 0 imperfect interpolant sequences [2025-02-05 20:13:49,022 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-02-05 20:13:49,022 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2025-02-05 20:13:49,023 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [497437253] [2025-02-05 20:13:49,023 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-02-05 20:13:49,023 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2025-02-05 20:13:49,023 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-02-05 20:13:49,023 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2025-02-05 20:13:49,023 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=11, Invalid=19, Unknown=0, NotChecked=0, Total=30 [2025-02-05 20:13:49,023 INFO L87 Difference]: Start difference. First operand 6530 states and 9340 transitions. Second operand has 6 states, 6 states have (on average 34.333333333333336) internal successors, (206), 6 states have internal predecessors, (206), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-02-05 20:13:49,561 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-02-05 20:13:49,561 INFO L93 Difference]: Finished difference Result 13367 states and 19040 transitions. [2025-02-05 20:13:49,561 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2025-02-05 20:13:49,562 INFO L78 Accepts]: Start accepts. Automaton has has 6 states, 6 states have (on average 34.333333333333336) internal successors, (206), 6 states have internal predecessors, (206), 0 states have call successors, (0), 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 206 [2025-02-05 20:13:49,562 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-02-05 20:13:49,572 INFO L225 Difference]: With dead ends: 13367 [2025-02-05 20:13:49,572 INFO L226 Difference]: Without dead ends: 11272 [2025-02-05 20:13:49,576 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 8 GetRequests, 3 SyntacticMatches, 0 SemanticMatches, 5 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 2 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=16, Invalid=26, Unknown=0, NotChecked=0, Total=42 [2025-02-05 20:13:49,577 INFO L435 NwaCegarLoop]: 1411 mSDtfsCounter, 2313 mSDsluCounter, 4223 mSDsCounter, 0 mSdLazyCounter, 1256 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.4s Time, 0 mProtectedPredicate, 0 mProtectedAction, 2313 SdHoareTripleChecker+Valid, 5634 SdHoareTripleChecker+Invalid, 1256 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 1256 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.5s IncrementalHoareTripleChecker+Time [2025-02-05 20:13:49,577 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [2313 Valid, 5634 Invalid, 1256 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 1256 Invalid, 0 Unknown, 0 Unchecked, 0.5s Time] [2025-02-05 20:13:49,583 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 11272 states. [2025-02-05 20:13:49,674 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 11272 to 10792. [2025-02-05 20:13:49,682 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 10792 states, 10791 states have (on average 1.4208136409971273) internal successors, (15332), 10791 states have internal predecessors, (15332), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-02-05 20:13:49,696 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 10792 states to 10792 states and 15332 transitions. [2025-02-05 20:13:49,696 INFO L78 Accepts]: Start accepts. Automaton has 10792 states and 15332 transitions. Word has length 206 [2025-02-05 20:13:49,696 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-02-05 20:13:49,696 INFO L471 AbstractCegarLoop]: Abstraction has 10792 states and 15332 transitions. [2025-02-05 20:13:49,696 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 6 states have (on average 34.333333333333336) internal successors, (206), 6 states have internal predecessors, (206), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-02-05 20:13:49,696 INFO L276 IsEmpty]: Start isEmpty. Operand 10792 states and 15332 transitions. [2025-02-05 20:13:49,710 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 207 [2025-02-05 20:13:49,710 INFO L210 NwaCegarLoop]: Found error trace [2025-02-05 20:13:49,710 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] [2025-02-05 20:13:49,710 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable34 [2025-02-05 20:13:49,710 INFO L396 AbstractCegarLoop]: === Iteration 36 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-02-05 20:13:49,711 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-02-05 20:13:49,711 INFO L85 PathProgramCache]: Analyzing trace with hash 864404718, now seen corresponding path program 1 times [2025-02-05 20:13:49,711 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-02-05 20:13:49,711 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1554391006] [2025-02-05 20:13:49,711 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-02-05 20:13:49,711 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-02-05 20:13:49,759 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 206 statements into 1 equivalence classes. [2025-02-05 20:13:49,942 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 206 of 206 statements. [2025-02-05 20:13:49,943 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-02-05 20:13:49,943 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-02-05 20:13:50,561 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-05 20:13:50,561 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-02-05 20:13:50,561 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1554391006] [2025-02-05 20:13:50,561 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1554391006] provided 1 perfect and 0 imperfect interpolant sequences [2025-02-05 20:13:50,561 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-02-05 20:13:50,561 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [15] imperfect sequences [] total 15 [2025-02-05 20:13:50,562 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [76596400] [2025-02-05 20:13:50,562 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-02-05 20:13:50,562 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 15 states [2025-02-05 20:13:50,562 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-02-05 20:13:50,562 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 15 interpolants. [2025-02-05 20:13:50,562 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=31, Invalid=179, Unknown=0, NotChecked=0, Total=210 [2025-02-05 20:13:50,562 INFO L87 Difference]: Start difference. First operand 10792 states and 15332 transitions. Second operand has 15 states, 15 states have (on average 13.733333333333333) internal successors, (206), 15 states have internal predecessors, (206), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-02-05 20:13:51,804 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-02-05 20:13:51,804 INFO L93 Difference]: Finished difference Result 14705 states and 20872 transitions. [2025-02-05 20:13:51,804 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 15 states. [2025-02-05 20:13:51,804 INFO L78 Accepts]: Start accepts. Automaton has has 15 states, 15 states have (on average 13.733333333333333) internal successors, (206), 15 states have internal predecessors, (206), 0 states have call successors, (0), 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 206 [2025-02-05 20:13:51,804 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-02-05 20:13:51,815 INFO L225 Difference]: With dead ends: 14705 [2025-02-05 20:13:51,815 INFO L226 Difference]: Without dead ends: 12464 [2025-02-05 20:13:51,818 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 17 GetRequests, 4 SyntacticMatches, 0 SemanticMatches, 13 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 4 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=31, Invalid=179, Unknown=0, NotChecked=0, Total=210 [2025-02-05 20:13:51,818 INFO L435 NwaCegarLoop]: 1421 mSDtfsCounter, 75 mSDsluCounter, 17053 mSDsCounter, 0 mSdLazyCounter, 4009 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 1.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 75 SdHoareTripleChecker+Valid, 18474 SdHoareTripleChecker+Invalid, 4009 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 4009 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 1.2s IncrementalHoareTripleChecker+Time [2025-02-05 20:13:51,818 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [75 Valid, 18474 Invalid, 4009 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 4009 Invalid, 0 Unknown, 0 Unchecked, 1.2s Time] [2025-02-05 20:13:51,823 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 12464 states. [2025-02-05 20:13:51,923 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 12464 to 12076. [2025-02-05 20:13:51,932 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 12076 states, 12075 states have (on average 1.4161490683229814) internal successors, (17100), 12075 states have internal predecessors, (17100), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-02-05 20:13:51,944 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 12076 states to 12076 states and 17100 transitions. [2025-02-05 20:13:51,944 INFO L78 Accepts]: Start accepts. Automaton has 12076 states and 17100 transitions. Word has length 206 [2025-02-05 20:13:51,944 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-02-05 20:13:51,944 INFO L471 AbstractCegarLoop]: Abstraction has 12076 states and 17100 transitions. [2025-02-05 20:13:51,944 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 15 states, 15 states have (on average 13.733333333333333) internal successors, (206), 15 states have internal predecessors, (206), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-02-05 20:13:51,944 INFO L276 IsEmpty]: Start isEmpty. Operand 12076 states and 17100 transitions. [2025-02-05 20:13:51,955 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 207 [2025-02-05 20:13:51,955 INFO L210 NwaCegarLoop]: Found error trace [2025-02-05 20:13:51,955 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] [2025-02-05 20:13:51,955 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable35 [2025-02-05 20:13:51,955 INFO L396 AbstractCegarLoop]: === Iteration 37 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-02-05 20:13:51,956 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-02-05 20:13:51,956 INFO L85 PathProgramCache]: Analyzing trace with hash 1705581295, now seen corresponding path program 1 times [2025-02-05 20:13:51,956 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-02-05 20:13:51,956 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1659524539] [2025-02-05 20:13:51,956 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-02-05 20:13:51,956 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-02-05 20:13:51,989 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 206 statements into 1 equivalence classes. [2025-02-05 20:13:52,165 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 206 of 206 statements. [2025-02-05 20:13:52,165 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-02-05 20:13:52,165 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-02-05 20:13:52,436 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-05 20:13:52,436 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-02-05 20:13:52,437 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1659524539] [2025-02-05 20:13:52,437 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1659524539] provided 1 perfect and 0 imperfect interpolant sequences [2025-02-05 20:13:52,437 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-02-05 20:13:52,437 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2025-02-05 20:13:52,437 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2042506230] [2025-02-05 20:13:52,437 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-02-05 20:13:52,437 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2025-02-05 20:13:52,437 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-02-05 20:13:52,437 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2025-02-05 20:13:52,437 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=12, Invalid=18, Unknown=0, NotChecked=0, Total=30 [2025-02-05 20:13:52,437 INFO L87 Difference]: Start difference. First operand 12076 states and 17100 transitions. Second operand has 6 states, 6 states have (on average 34.333333333333336) internal successors, (206), 6 states have internal predecessors, (206), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-02-05 20:13:53,306 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-02-05 20:13:53,306 INFO L93 Difference]: Finished difference Result 14630 states and 20775 transitions. [2025-02-05 20:13:53,306 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2025-02-05 20:13:53,306 INFO L78 Accepts]: Start accepts. Automaton has has 6 states, 6 states have (on average 34.333333333333336) internal successors, (206), 6 states have internal predecessors, (206), 0 states have call successors, (0), 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 206 [2025-02-05 20:13:53,307 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-02-05 20:13:53,318 INFO L225 Difference]: With dead ends: 14630 [2025-02-05 20:13:53,318 INFO L226 Difference]: Without dead ends: 12451 [2025-02-05 20:13:53,323 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 8 GetRequests, 3 SyntacticMatches, 0 SemanticMatches, 5 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=17, Invalid=25, Unknown=0, NotChecked=0, Total=42 [2025-02-05 20:13:53,323 INFO L435 NwaCegarLoop]: 1174 mSDtfsCounter, 2172 mSDsluCounter, 3505 mSDsCounter, 0 mSdLazyCounter, 2248 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.7s Time, 0 mProtectedPredicate, 0 mProtectedAction, 2172 SdHoareTripleChecker+Valid, 4679 SdHoareTripleChecker+Invalid, 2248 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 2248 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.8s IncrementalHoareTripleChecker+Time [2025-02-05 20:13:53,324 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [2172 Valid, 4679 Invalid, 2248 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 2248 Invalid, 0 Unknown, 0 Unchecked, 0.8s Time] [2025-02-05 20:13:53,329 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 12451 states. [2025-02-05 20:13:53,397 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 12451 to 12076. [2025-02-05 20:13:53,408 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 12076 states, 12075 states have (on average 1.4144927536231884) internal successors, (17080), 12075 states have internal predecessors, (17080), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-02-05 20:13:53,419 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 12076 states to 12076 states and 17080 transitions. [2025-02-05 20:13:53,419 INFO L78 Accepts]: Start accepts. Automaton has 12076 states and 17080 transitions. Word has length 206 [2025-02-05 20:13:53,419 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-02-05 20:13:53,419 INFO L471 AbstractCegarLoop]: Abstraction has 12076 states and 17080 transitions. [2025-02-05 20:13:53,419 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 6 states have (on average 34.333333333333336) internal successors, (206), 6 states have internal predecessors, (206), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-02-05 20:13:53,419 INFO L276 IsEmpty]: Start isEmpty. Operand 12076 states and 17080 transitions. [2025-02-05 20:13:53,428 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 207 [2025-02-05 20:13:53,428 INFO L210 NwaCegarLoop]: Found error trace [2025-02-05 20:13:53,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] [2025-02-05 20:13:53,429 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable36 [2025-02-05 20:13:53,429 INFO L396 AbstractCegarLoop]: === Iteration 38 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-02-05 20:13:53,429 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-02-05 20:13:53,429 INFO L85 PathProgramCache]: Analyzing trace with hash -540440393, now seen corresponding path program 1 times [2025-02-05 20:13:53,429 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-02-05 20:13:53,429 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [201531485] [2025-02-05 20:13:53,429 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-02-05 20:13:53,429 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-02-05 20:13:53,463 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 206 statements into 1 equivalence classes. [2025-02-05 20:13:53,482 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 206 of 206 statements. [2025-02-05 20:13:53,482 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-02-05 20:13:53,482 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-02-05 20:13:53,645 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-05 20:13:53,646 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-02-05 20:13:53,646 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [201531485] [2025-02-05 20:13:53,646 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [201531485] provided 1 perfect and 0 imperfect interpolant sequences [2025-02-05 20:13:53,646 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-02-05 20:13:53,646 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2025-02-05 20:13:53,646 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [391668213] [2025-02-05 20:13:53,646 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-02-05 20:13:53,646 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2025-02-05 20:13:53,646 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-02-05 20:13:53,646 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2025-02-05 20:13:53,646 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2025-02-05 20:13:53,647 INFO L87 Difference]: Start difference. First operand 12076 states and 17080 transitions. Second operand has 4 states, 4 states have (on average 51.5) internal successors, (206), 4 states have internal predecessors, (206), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-02-05 20:13:53,965 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-02-05 20:13:53,965 INFO L93 Difference]: Finished difference Result 17337 states and 24522 transitions. [2025-02-05 20:13:53,966 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2025-02-05 20:13:53,966 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 4 states have (on average 51.5) internal successors, (206), 4 states have internal predecessors, (206), 0 states have call successors, (0), 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 206 [2025-02-05 20:13:53,966 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-02-05 20:13:53,977 INFO L225 Difference]: With dead ends: 17337 [2025-02-05 20:13:53,977 INFO L226 Difference]: Without dead ends: 12220 [2025-02-05 20:13:53,983 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 5 GetRequests, 3 SyntacticMatches, 0 SemanticMatches, 2 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2025-02-05 20:13:53,984 INFO L435 NwaCegarLoop]: 1435 mSDtfsCounter, 0 mSDsluCounter, 2862 mSDsCounter, 0 mSdLazyCounter, 871 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 0 SdHoareTripleChecker+Valid, 4297 SdHoareTripleChecker+Invalid, 871 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 871 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.3s IncrementalHoareTripleChecker+Time [2025-02-05 20:13:53,984 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [0 Valid, 4297 Invalid, 871 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 871 Invalid, 0 Unknown, 0 Unchecked, 0.3s Time] [2025-02-05 20:13:53,990 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 12220 states. [2025-02-05 20:13:54,059 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 12220 to 12220. [2025-02-05 20:13:54,069 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 12220 states, 12219 states have (on average 1.4096079875603569) internal successors, (17224), 12219 states have internal predecessors, (17224), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-02-05 20:13:54,080 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 12220 states to 12220 states and 17224 transitions. [2025-02-05 20:13:54,080 INFO L78 Accepts]: Start accepts. Automaton has 12220 states and 17224 transitions. Word has length 206 [2025-02-05 20:13:54,081 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-02-05 20:13:54,081 INFO L471 AbstractCegarLoop]: Abstraction has 12220 states and 17224 transitions. [2025-02-05 20:13:54,081 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 51.5) internal successors, (206), 4 states have internal predecessors, (206), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-02-05 20:13:54,081 INFO L276 IsEmpty]: Start isEmpty. Operand 12220 states and 17224 transitions. [2025-02-05 20:13:54,090 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 207 [2025-02-05 20:13:54,090 INFO L210 NwaCegarLoop]: Found error trace [2025-02-05 20:13:54,090 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] [2025-02-05 20:13:54,091 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable37 [2025-02-05 20:13:54,091 INFO L396 AbstractCegarLoop]: === Iteration 39 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-02-05 20:13:54,091 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-02-05 20:13:54,091 INFO L85 PathProgramCache]: Analyzing trace with hash 596427132, now seen corresponding path program 1 times [2025-02-05 20:13:54,091 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-02-05 20:13:54,091 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1802886841] [2025-02-05 20:13:54,091 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-02-05 20:13:54,091 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-02-05 20:13:54,153 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 206 statements into 1 equivalence classes. [2025-02-05 20:13:54,218 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 206 of 206 statements. [2025-02-05 20:13:54,218 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-02-05 20:13:54,218 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-02-05 20:13:54,605 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-05 20:13:54,605 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-02-05 20:13:54,605 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1802886841] [2025-02-05 20:13:54,605 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1802886841] provided 1 perfect and 0 imperfect interpolant sequences [2025-02-05 20:13:54,605 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-02-05 20:13:54,605 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2025-02-05 20:13:54,605 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [315459521] [2025-02-05 20:13:54,605 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-02-05 20:13:54,605 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 7 states [2025-02-05 20:13:54,605 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-02-05 20:13:54,606 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2025-02-05 20:13:54,606 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=13, Invalid=29, Unknown=0, NotChecked=0, Total=42 [2025-02-05 20:13:54,606 INFO L87 Difference]: Start difference. First operand 12220 states and 17224 transitions. Second operand has 7 states, 7 states have (on average 29.428571428571427) internal successors, (206), 7 states have internal predecessors, (206), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-02-05 20:13:55,227 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-02-05 20:13:55,228 INFO L93 Difference]: Finished difference Result 30275 states and 42298 transitions. [2025-02-05 20:13:55,228 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2025-02-05 20:13:55,228 INFO L78 Accepts]: Start accepts. Automaton has has 7 states, 7 states have (on average 29.428571428571427) internal successors, (206), 7 states have internal predecessors, (206), 0 states have call successors, (0), 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 206 [2025-02-05 20:13:55,228 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-02-05 20:13:55,249 INFO L225 Difference]: With dead ends: 30275 [2025-02-05 20:13:55,249 INFO L226 Difference]: Without dead ends: 21474 [2025-02-05 20:13:55,261 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 8 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 6 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 4 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=18, Invalid=38, Unknown=0, NotChecked=0, Total=56 [2025-02-05 20:13:55,262 INFO L435 NwaCegarLoop]: 1411 mSDtfsCounter, 2013 mSDsluCounter, 5631 mSDsCounter, 0 mSdLazyCounter, 1573 mSolverCounterSat, 1 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.4s Time, 0 mProtectedPredicate, 0 mProtectedAction, 2013 SdHoareTripleChecker+Valid, 7042 SdHoareTripleChecker+Invalid, 1574 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 1 IncrementalHoareTripleChecker+Valid, 1573 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.5s IncrementalHoareTripleChecker+Time [2025-02-05 20:13:55,262 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [2013 Valid, 7042 Invalid, 1574 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [1 Valid, 1573 Invalid, 0 Unknown, 0 Unchecked, 0.5s Time] [2025-02-05 20:13:55,273 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 21474 states. [2025-02-05 20:13:55,383 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 21474 to 15452. [2025-02-05 20:13:55,395 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 15452 states, 15451 states have (on average 1.417642871011585) internal successors, (21904), 15451 states have internal predecessors, (21904), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-02-05 20:13:55,410 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 15452 states to 15452 states and 21904 transitions. [2025-02-05 20:13:55,410 INFO L78 Accepts]: Start accepts. Automaton has 15452 states and 21904 transitions. Word has length 206 [2025-02-05 20:13:55,410 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-02-05 20:13:55,410 INFO L471 AbstractCegarLoop]: Abstraction has 15452 states and 21904 transitions. [2025-02-05 20:13:55,410 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 7 states, 7 states have (on average 29.428571428571427) internal successors, (206), 7 states have internal predecessors, (206), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-02-05 20:13:55,411 INFO L276 IsEmpty]: Start isEmpty. Operand 15452 states and 21904 transitions. [2025-02-05 20:13:55,424 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 207 [2025-02-05 20:13:55,424 INFO L210 NwaCegarLoop]: Found error trace [2025-02-05 20:13:55,424 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] [2025-02-05 20:13:55,424 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable38 [2025-02-05 20:13:55,424 INFO L396 AbstractCegarLoop]: === Iteration 40 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-02-05 20:13:55,425 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-02-05 20:13:55,425 INFO L85 PathProgramCache]: Analyzing trace with hash -1723218556, now seen corresponding path program 1 times [2025-02-05 20:13:55,425 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-02-05 20:13:55,425 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [119851793] [2025-02-05 20:13:55,425 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-02-05 20:13:55,425 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-02-05 20:13:55,462 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 206 statements into 1 equivalence classes. [2025-02-05 20:13:55,491 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 206 of 206 statements. [2025-02-05 20:13:55,492 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-02-05 20:13:55,492 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-02-05 20:13:55,656 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-05 20:13:55,657 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-02-05 20:13:55,657 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [119851793] [2025-02-05 20:13:55,657 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [119851793] provided 1 perfect and 0 imperfect interpolant sequences [2025-02-05 20:13:55,657 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-02-05 20:13:55,657 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2025-02-05 20:13:55,657 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [240896768] [2025-02-05 20:13:55,657 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-02-05 20:13:55,657 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2025-02-05 20:13:55,658 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-02-05 20:13:55,658 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2025-02-05 20:13:55,658 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=8, Invalid=12, Unknown=0, NotChecked=0, Total=20 [2025-02-05 20:13:55,658 INFO L87 Difference]: Start difference. First operand 15452 states and 21904 transitions. Second operand has 5 states, 5 states have (on average 41.2) internal successors, (206), 5 states have internal predecessors, (206), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-02-05 20:13:56,040 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-02-05 20:13:56,040 INFO L93 Difference]: Finished difference Result 25883 states and 36332 transitions. [2025-02-05 20:13:56,040 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2025-02-05 20:13:56,040 INFO L78 Accepts]: Start accepts. Automaton has has 5 states, 5 states have (on average 41.2) internal successors, (206), 5 states have internal predecessors, (206), 0 states have call successors, (0), 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 206 [2025-02-05 20:13:56,041 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-02-05 20:13:56,053 INFO L225 Difference]: With dead ends: 25883 [2025-02-05 20:13:56,053 INFO L226 Difference]: Without dead ends: 15580 [2025-02-05 20:13:56,056 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 5 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=8, Invalid=12, Unknown=0, NotChecked=0, Total=20 [2025-02-05 20:13:56,056 INFO L435 NwaCegarLoop]: 1435 mSDtfsCounter, 0 mSDsluCounter, 2862 mSDsCounter, 0 mSdLazyCounter, 872 mSolverCounterSat, 1 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 0 SdHoareTripleChecker+Valid, 4297 SdHoareTripleChecker+Invalid, 873 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 1 IncrementalHoareTripleChecker+Valid, 872 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.3s IncrementalHoareTripleChecker+Time [2025-02-05 20:13:56,056 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [0 Valid, 4297 Invalid, 873 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [1 Valid, 872 Invalid, 0 Unknown, 0 Unchecked, 0.3s Time] [2025-02-05 20:13:56,062 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 15580 states. [2025-02-05 20:13:56,141 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 15580 to 15452. [2025-02-05 20:13:56,155 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 15452 states, 15451 states have (on average 1.417642871011585) internal successors, (21904), 15451 states have internal predecessors, (21904), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-02-05 20:13:56,172 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 15452 states to 15452 states and 21904 transitions. [2025-02-05 20:13:56,172 INFO L78 Accepts]: Start accepts. Automaton has 15452 states and 21904 transitions. Word has length 206 [2025-02-05 20:13:56,172 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-02-05 20:13:56,172 INFO L471 AbstractCegarLoop]: Abstraction has 15452 states and 21904 transitions. [2025-02-05 20:13:56,172 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 41.2) internal successors, (206), 5 states have internal predecessors, (206), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-02-05 20:13:56,172 INFO L276 IsEmpty]: Start isEmpty. Operand 15452 states and 21904 transitions. [2025-02-05 20:13:56,186 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 208 [2025-02-05 20:13:56,186 INFO L210 NwaCegarLoop]: Found error trace [2025-02-05 20:13:56,186 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] [2025-02-05 20:13:56,186 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable39 [2025-02-05 20:13:56,186 INFO L396 AbstractCegarLoop]: === Iteration 41 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-02-05 20:13:56,187 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-02-05 20:13:56,187 INFO L85 PathProgramCache]: Analyzing trace with hash 581023355, now seen corresponding path program 1 times [2025-02-05 20:13:56,187 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-02-05 20:13:56,187 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [807485650] [2025-02-05 20:13:56,187 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-02-05 20:13:56,187 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-02-05 20:13:56,224 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 207 statements into 1 equivalence classes. [2025-02-05 20:13:56,341 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 207 of 207 statements. [2025-02-05 20:13:56,341 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-02-05 20:13:56,341 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-02-05 20:13:56,570 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-05 20:13:56,570 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-02-05 20:13:56,570 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [807485650] [2025-02-05 20:13:56,570 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [807485650] provided 1 perfect and 0 imperfect interpolant sequences [2025-02-05 20:13:56,570 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-02-05 20:13:56,570 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2025-02-05 20:13:56,570 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1270881155] [2025-02-05 20:13:56,570 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-02-05 20:13:56,570 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2025-02-05 20:13:56,571 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-02-05 20:13:56,571 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2025-02-05 20:13:56,571 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=9, Invalid=21, Unknown=0, NotChecked=0, Total=30 [2025-02-05 20:13:56,571 INFO L87 Difference]: Start difference. First operand 15452 states and 21904 transitions. Second operand has 6 states, 6 states have (on average 34.5) internal successors, (207), 6 states have internal predecessors, (207), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-02-05 20:13:57,656 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-02-05 20:13:57,656 INFO L93 Difference]: Finished difference Result 17888 states and 25419 transitions. [2025-02-05 20:13:57,656 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2025-02-05 20:13:57,657 INFO L78 Accepts]: Start accepts. Automaton has has 6 states, 6 states have (on average 34.5) internal successors, (207), 6 states have internal predecessors, (207), 0 states have call successors, (0), 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 207 [2025-02-05 20:13:57,657 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-02-05 20:13:57,671 INFO L225 Difference]: With dead ends: 17888 [2025-02-05 20:13:57,671 INFO L226 Difference]: Without dead ends: 15927 [2025-02-05 20:13:57,676 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 8 GetRequests, 3 SyntacticMatches, 0 SemanticMatches, 5 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=13, Invalid=29, Unknown=0, NotChecked=0, Total=42 [2025-02-05 20:13:57,677 INFO L435 NwaCegarLoop]: 1832 mSDtfsCounter, 483 mSDsluCounter, 5867 mSDsCounter, 0 mSdLazyCounter, 3092 mSolverCounterSat, 1 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.8s Time, 0 mProtectedPredicate, 0 mProtectedAction, 483 SdHoareTripleChecker+Valid, 7699 SdHoareTripleChecker+Invalid, 3093 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 1 IncrementalHoareTripleChecker+Valid, 3092 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 1.0s IncrementalHoareTripleChecker+Time [2025-02-05 20:13:57,677 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [483 Valid, 7699 Invalid, 3093 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [1 Valid, 3092 Invalid, 0 Unknown, 0 Unchecked, 1.0s Time] [2025-02-05 20:13:57,685 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 15927 states. [2025-02-05 20:13:57,769 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 15927 to 14068. [2025-02-05 20:13:57,781 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 14068 states, 14067 states have (on average 1.4220516101514182) internal successors, (20004), 14067 states have internal predecessors, (20004), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-02-05 20:13:57,795 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 14068 states to 14068 states and 20004 transitions. [2025-02-05 20:13:57,795 INFO L78 Accepts]: Start accepts. Automaton has 14068 states and 20004 transitions. Word has length 207 [2025-02-05 20:13:57,795 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-02-05 20:13:57,796 INFO L471 AbstractCegarLoop]: Abstraction has 14068 states and 20004 transitions. [2025-02-05 20:13:57,796 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 6 states have (on average 34.5) internal successors, (207), 6 states have internal predecessors, (207), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-02-05 20:13:57,796 INFO L276 IsEmpty]: Start isEmpty. Operand 14068 states and 20004 transitions. [2025-02-05 20:13:57,808 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 208 [2025-02-05 20:13:57,808 INFO L210 NwaCegarLoop]: Found error trace [2025-02-05 20:13:57,808 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] [2025-02-05 20:13:57,808 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable40 [2025-02-05 20:13:57,808 INFO L396 AbstractCegarLoop]: === Iteration 42 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-02-05 20:13:57,809 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-02-05 20:13:57,809 INFO L85 PathProgramCache]: Analyzing trace with hash -338827132, now seen corresponding path program 1 times [2025-02-05 20:13:57,809 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-02-05 20:13:57,809 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [63466141] [2025-02-05 20:13:57,809 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-02-05 20:13:57,809 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-02-05 20:13:57,846 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 207 statements into 1 equivalence classes. [2025-02-05 20:13:58,033 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 207 of 207 statements. [2025-02-05 20:13:58,033 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-02-05 20:13:58,034 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-02-05 20:13:58,391 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-05 20:13:58,392 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-02-05 20:13:58,392 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [63466141] [2025-02-05 20:13:58,392 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [63466141] provided 1 perfect and 0 imperfect interpolant sequences [2025-02-05 20:13:58,392 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-02-05 20:13:58,392 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2025-02-05 20:13:58,392 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [919164515] [2025-02-05 20:13:58,392 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-02-05 20:13:58,392 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2025-02-05 20:13:58,392 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-02-05 20:13:58,393 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2025-02-05 20:13:58,393 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=12, Invalid=18, Unknown=0, NotChecked=0, Total=30 [2025-02-05 20:13:58,393 INFO L87 Difference]: Start difference. First operand 14068 states and 20004 transitions. Second operand has 6 states, 6 states have (on average 34.5) internal successors, (207), 6 states have internal predecessors, (207), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-02-05 20:13:59,421 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-02-05 20:13:59,422 INFO L93 Difference]: Finished difference Result 20777 states and 29399 transitions. [2025-02-05 20:13:59,422 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2025-02-05 20:13:59,422 INFO L78 Accepts]: Start accepts. Automaton has has 6 states, 6 states have (on average 34.5) internal successors, (207), 6 states have internal predecessors, (207), 0 states have call successors, (0), 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 207 [2025-02-05 20:13:59,422 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-02-05 20:13:59,439 INFO L225 Difference]: With dead ends: 20777 [2025-02-05 20:13:59,439 INFO L226 Difference]: Without dead ends: 17233 [2025-02-05 20:13:59,445 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 9 GetRequests, 4 SyntacticMatches, 0 SemanticMatches, 5 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=17, Invalid=25, Unknown=0, NotChecked=0, Total=42 [2025-02-05 20:13:59,446 INFO L435 NwaCegarLoop]: 1433 mSDtfsCounter, 1983 mSDsluCounter, 4010 mSDsCounter, 0 mSdLazyCounter, 2525 mSolverCounterSat, 1 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.8s Time, 0 mProtectedPredicate, 0 mProtectedAction, 1983 SdHoareTripleChecker+Valid, 5443 SdHoareTripleChecker+Invalid, 2526 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 1 IncrementalHoareTripleChecker+Valid, 2525 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 1.0s IncrementalHoareTripleChecker+Time [2025-02-05 20:13:59,446 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [1983 Valid, 5443 Invalid, 2526 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [1 Valid, 2525 Invalid, 0 Unknown, 0 Unchecked, 1.0s Time] [2025-02-05 20:13:59,454 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 17233 states. [2025-02-05 20:13:59,546 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 17233 to 15092. [2025-02-05 20:13:59,557 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 15092 states, 15091 states have (on average 1.4156782188059107) internal successors, (21364), 15091 states have internal predecessors, (21364), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-02-05 20:13:59,573 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 15092 states to 15092 states and 21364 transitions. [2025-02-05 20:13:59,573 INFO L78 Accepts]: Start accepts. Automaton has 15092 states and 21364 transitions. Word has length 207 [2025-02-05 20:13:59,574 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-02-05 20:13:59,574 INFO L471 AbstractCegarLoop]: Abstraction has 15092 states and 21364 transitions. [2025-02-05 20:13:59,574 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 6 states have (on average 34.5) internal successors, (207), 6 states have internal predecessors, (207), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-02-05 20:13:59,574 INFO L276 IsEmpty]: Start isEmpty. Operand 15092 states and 21364 transitions. [2025-02-05 20:13:59,586 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 208 [2025-02-05 20:13:59,586 INFO L210 NwaCegarLoop]: Found error trace [2025-02-05 20:13:59,586 INFO L218 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-02-05 20:13:59,586 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable41 [2025-02-05 20:13:59,586 INFO L396 AbstractCegarLoop]: === Iteration 43 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-02-05 20:13:59,586 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-02-05 20:13:59,586 INFO L85 PathProgramCache]: Analyzing trace with hash -702231087, now seen corresponding path program 1 times [2025-02-05 20:13:59,586 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-02-05 20:13:59,586 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1599629096] [2025-02-05 20:13:59,587 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-02-05 20:13:59,587 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-02-05 20:13:59,620 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 207 statements into 1 equivalence classes. [2025-02-05 20:13:59,792 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 207 of 207 statements. [2025-02-05 20:13:59,792 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-02-05 20:13:59,792 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-02-05 20:14:00,111 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-05 20:14:00,111 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-02-05 20:14:00,112 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1599629096] [2025-02-05 20:14:00,112 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1599629096] provided 1 perfect and 0 imperfect interpolant sequences [2025-02-05 20:14:00,112 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-02-05 20:14:00,112 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2025-02-05 20:14:00,112 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1867770784] [2025-02-05 20:14:00,112 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-02-05 20:14:00,112 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2025-02-05 20:14:00,112 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-02-05 20:14:00,112 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2025-02-05 20:14:00,112 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=12, Invalid=18, Unknown=0, NotChecked=0, Total=30 [2025-02-05 20:14:00,112 INFO L87 Difference]: Start difference. First operand 15092 states and 21364 transitions. Second operand has 6 states, 6 states have (on average 34.5) internal successors, (207), 6 states have internal predecessors, (207), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-02-05 20:14:01,127 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-02-05 20:14:01,127 INFO L93 Difference]: Finished difference Result 21953 states and 30957 transitions. [2025-02-05 20:14:01,127 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2025-02-05 20:14:01,127 INFO L78 Accepts]: Start accepts. Automaton has has 6 states, 6 states have (on average 34.5) internal successors, (207), 6 states have internal predecessors, (207), 0 states have call successors, (0), 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 207 [2025-02-05 20:14:01,127 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-02-05 20:14:01,141 INFO L225 Difference]: With dead ends: 21953 [2025-02-05 20:14:01,141 INFO L226 Difference]: Without dead ends: 18815 [2025-02-05 20:14:01,144 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 9 GetRequests, 4 SyntacticMatches, 0 SemanticMatches, 5 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=17, Invalid=25, Unknown=0, NotChecked=0, Total=42 [2025-02-05 20:14:01,144 INFO L435 NwaCegarLoop]: 1405 mSDtfsCounter, 1924 mSDsluCounter, 3954 mSDsCounter, 0 mSdLazyCounter, 2475 mSolverCounterSat, 1 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.8s Time, 0 mProtectedPredicate, 0 mProtectedAction, 1924 SdHoareTripleChecker+Valid, 5359 SdHoareTripleChecker+Invalid, 2476 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 1 IncrementalHoareTripleChecker+Valid, 2475 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.9s IncrementalHoareTripleChecker+Time [2025-02-05 20:14:01,145 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [1924 Valid, 5359 Invalid, 2476 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [1 Valid, 2475 Invalid, 0 Unknown, 0 Unchecked, 0.9s Time] [2025-02-05 20:14:01,151 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 18815 states. [2025-02-05 20:14:01,244 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 18815 to 17252. [2025-02-05 20:14:01,257 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 17252 states, 17251 states have (on average 1.4062952872297259) internal successors, (24260), 17251 states have internal predecessors, (24260), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-02-05 20:14:01,274 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 17252 states to 17252 states and 24260 transitions. [2025-02-05 20:14:01,274 INFO L78 Accepts]: Start accepts. Automaton has 17252 states and 24260 transitions. Word has length 207 [2025-02-05 20:14:01,274 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-02-05 20:14:01,274 INFO L471 AbstractCegarLoop]: Abstraction has 17252 states and 24260 transitions. [2025-02-05 20:14:01,274 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 6 states have (on average 34.5) internal successors, (207), 6 states have internal predecessors, (207), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-02-05 20:14:01,274 INFO L276 IsEmpty]: Start isEmpty. Operand 17252 states and 24260 transitions. [2025-02-05 20:14:01,288 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 208 [2025-02-05 20:14:01,288 INFO L210 NwaCegarLoop]: Found error trace [2025-02-05 20:14:01,288 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] [2025-02-05 20:14:01,288 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable42 [2025-02-05 20:14:01,288 INFO L396 AbstractCegarLoop]: === Iteration 44 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-02-05 20:14:01,288 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-02-05 20:14:01,288 INFO L85 PathProgramCache]: Analyzing trace with hash -185143263, now seen corresponding path program 1 times [2025-02-05 20:14:01,288 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-02-05 20:14:01,288 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [90638609] [2025-02-05 20:14:01,289 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-02-05 20:14:01,289 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-02-05 20:14:01,322 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 207 statements into 1 equivalence classes. [2025-02-05 20:14:01,475 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 207 of 207 statements. [2025-02-05 20:14:01,476 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-02-05 20:14:01,476 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-02-05 20:14:02,124 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-05 20:14:02,124 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-02-05 20:14:02,124 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [90638609] [2025-02-05 20:14:02,124 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [90638609] provided 1 perfect and 0 imperfect interpolant sequences [2025-02-05 20:14:02,124 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-02-05 20:14:02,124 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [20] imperfect sequences [] total 20 [2025-02-05 20:14:02,124 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1851673865] [2025-02-05 20:14:02,124 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-02-05 20:14:02,125 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 20 states [2025-02-05 20:14:02,125 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-02-05 20:14:02,125 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 20 interpolants. [2025-02-05 20:14:02,125 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=38, Invalid=342, Unknown=0, NotChecked=0, Total=380 [2025-02-05 20:14:02,125 INFO L87 Difference]: Start difference. First operand 17252 states and 24260 transitions. Second operand has 20 states, 20 states have (on average 10.35) internal successors, (207), 20 states have internal predecessors, (207), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-02-05 20:14:04,154 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-02-05 20:14:04,154 INFO L93 Difference]: Finished difference Result 20616 states and 28995 transitions. [2025-02-05 20:14:04,154 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 19 states. [2025-02-05 20:14:04,154 INFO L78 Accepts]: Start accepts. Automaton has has 20 states, 20 states have (on average 10.35) internal successors, (207), 20 states have internal predecessors, (207), 0 states have call successors, (0), 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 207 [2025-02-05 20:14:04,155 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-02-05 20:14:04,168 INFO L225 Difference]: With dead ends: 20616 [2025-02-05 20:14:04,169 INFO L226 Difference]: Without dead ends: 18354 [2025-02-05 20:14:04,172 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 22 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 20 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=46, Invalid=416, Unknown=0, NotChecked=0, Total=462 [2025-02-05 20:14:04,173 INFO L435 NwaCegarLoop]: 1411 mSDtfsCounter, 115 mSDsluCounter, 25354 mSDsCounter, 0 mSdLazyCounter, 6085 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 1.5s Time, 0 mProtectedPredicate, 0 mProtectedAction, 115 SdHoareTripleChecker+Valid, 26765 SdHoareTripleChecker+Invalid, 6085 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 6085 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 1.9s IncrementalHoareTripleChecker+Time [2025-02-05 20:14:04,173 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [115 Valid, 26765 Invalid, 6085 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 6085 Invalid, 0 Unknown, 0 Unchecked, 1.9s Time] [2025-02-05 20:14:04,179 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 18354 states. [2025-02-05 20:14:04,330 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 18354 to 18254. [2025-02-05 20:14:04,344 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 18254 states, 18253 states have (on average 1.4060154495151482) internal successors, (25664), 18253 states have internal predecessors, (25664), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-02-05 20:14:04,369 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 18254 states to 18254 states and 25664 transitions. [2025-02-05 20:14:04,369 INFO L78 Accepts]: Start accepts. Automaton has 18254 states and 25664 transitions. Word has length 207 [2025-02-05 20:14:04,369 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-02-05 20:14:04,369 INFO L471 AbstractCegarLoop]: Abstraction has 18254 states and 25664 transitions. [2025-02-05 20:14:04,370 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 20 states, 20 states have (on average 10.35) internal successors, (207), 20 states have internal predecessors, (207), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-02-05 20:14:04,370 INFO L276 IsEmpty]: Start isEmpty. Operand 18254 states and 25664 transitions. [2025-02-05 20:14:04,388 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 208 [2025-02-05 20:14:04,388 INFO L210 NwaCegarLoop]: Found error trace [2025-02-05 20:14:04,388 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] [2025-02-05 20:14:04,388 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable43 [2025-02-05 20:14:04,388 INFO L396 AbstractCegarLoop]: === Iteration 45 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-02-05 20:14:04,389 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-02-05 20:14:04,389 INFO L85 PathProgramCache]: Analyzing trace with hash -759412691, now seen corresponding path program 1 times [2025-02-05 20:14:04,389 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-02-05 20:14:04,389 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [11417019] [2025-02-05 20:14:04,389 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-02-05 20:14:04,389 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-02-05 20:14:04,435 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 207 statements into 1 equivalence classes. [2025-02-05 20:14:04,594 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 207 of 207 statements. [2025-02-05 20:14:04,595 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-02-05 20:14:04,595 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-02-05 20:14:05,206 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-05 20:14:05,206 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-02-05 20:14:05,206 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [11417019] [2025-02-05 20:14:05,206 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [11417019] provided 1 perfect and 0 imperfect interpolant sequences [2025-02-05 20:14:05,206 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-02-05 20:14:05,206 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [18] imperfect sequences [] total 18 [2025-02-05 20:14:05,206 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [641098872] [2025-02-05 20:14:05,206 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-02-05 20:14:05,207 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 18 states [2025-02-05 20:14:05,207 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-02-05 20:14:05,207 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 18 interpolants. [2025-02-05 20:14:05,207 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=37, Invalid=269, Unknown=0, NotChecked=0, Total=306 [2025-02-05 20:14:05,207 INFO L87 Difference]: Start difference. First operand 18254 states and 25664 transitions. Second operand has 18 states, 18 states have (on average 11.5) internal successors, (207), 18 states have internal predecessors, (207), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-02-05 20:14:06,780 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-02-05 20:14:06,780 INFO L93 Difference]: Finished difference Result 20832 states and 29304 transitions. [2025-02-05 20:14:06,781 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 18 states. [2025-02-05 20:14:06,781 INFO L78 Accepts]: Start accepts. Automaton has has 18 states, 18 states have (on average 11.5) internal successors, (207), 18 states have internal predecessors, (207), 0 states have call successors, (0), 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 207 [2025-02-05 20:14:06,781 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-02-05 20:14:06,796 INFO L225 Difference]: With dead ends: 20832 [2025-02-05 20:14:06,797 INFO L226 Difference]: Without dead ends: 18362 [2025-02-05 20:14:06,800 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 20 GetRequests, 4 SyntacticMatches, 0 SemanticMatches, 16 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 4 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=37, Invalid=269, Unknown=0, NotChecked=0, Total=306 [2025-02-05 20:14:06,800 INFO L435 NwaCegarLoop]: 1415 mSDtfsCounter, 99 mSDsluCounter, 21224 mSDsCounter, 0 mSdLazyCounter, 5026 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 1.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 99 SdHoareTripleChecker+Valid, 22639 SdHoareTripleChecker+Invalid, 5026 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 5026 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 1.5s IncrementalHoareTripleChecker+Time [2025-02-05 20:14:06,800 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [99 Valid, 22639 Invalid, 5026 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 5026 Invalid, 0 Unknown, 0 Unchecked, 1.5s Time] [2025-02-05 20:14:06,808 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 18362 states. [2025-02-05 20:14:06,913 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 18362 to 18270. [2025-02-05 20:14:06,928 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 18270 states, 18269 states have (on average 1.4058788111007718) internal successors, (25684), 18269 states have internal predecessors, (25684), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-02-05 20:14:06,948 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 18270 states to 18270 states and 25684 transitions. [2025-02-05 20:14:06,948 INFO L78 Accepts]: Start accepts. Automaton has 18270 states and 25684 transitions. Word has length 207 [2025-02-05 20:14:06,948 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-02-05 20:14:06,948 INFO L471 AbstractCegarLoop]: Abstraction has 18270 states and 25684 transitions. [2025-02-05 20:14:06,948 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 18 states, 18 states have (on average 11.5) internal successors, (207), 18 states have internal predecessors, (207), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-02-05 20:14:06,948 INFO L276 IsEmpty]: Start isEmpty. Operand 18270 states and 25684 transitions. [2025-02-05 20:14:06,963 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 208 [2025-02-05 20:14:06,963 INFO L210 NwaCegarLoop]: Found error trace [2025-02-05 20:14:06,963 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] [2025-02-05 20:14:06,963 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable44 [2025-02-05 20:14:06,963 INFO L396 AbstractCegarLoop]: === Iteration 46 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-02-05 20:14:06,963 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-02-05 20:14:06,963 INFO L85 PathProgramCache]: Analyzing trace with hash 560333683, now seen corresponding path program 1 times [2025-02-05 20:14:06,963 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-02-05 20:14:06,963 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [991540339] [2025-02-05 20:14:06,964 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-02-05 20:14:06,964 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-02-05 20:14:06,999 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 207 statements into 1 equivalence classes. [2025-02-05 20:14:07,141 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 207 of 207 statements. [2025-02-05 20:14:07,141 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-02-05 20:14:07,141 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-02-05 20:14:07,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-05 20:14:07,403 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-02-05 20:14:07,403 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [991540339] [2025-02-05 20:14:07,403 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [991540339] provided 1 perfect and 0 imperfect interpolant sequences [2025-02-05 20:14:07,403 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-02-05 20:14:07,403 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2025-02-05 20:14:07,403 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2100412682] [2025-02-05 20:14:07,403 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-02-05 20:14:07,403 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2025-02-05 20:14:07,403 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-02-05 20:14:07,404 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2025-02-05 20:14:07,404 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2025-02-05 20:14:07,404 INFO L87 Difference]: Start difference. First operand 18270 states and 25684 transitions. Second operand has 5 states, 5 states have (on average 41.4) internal successors, (207), 5 states have internal predecessors, (207), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-02-05 20:14:07,865 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-02-05 20:14:07,865 INFO L93 Difference]: Finished difference Result 21566 states and 30370 transitions. [2025-02-05 20:14:07,866 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2025-02-05 20:14:07,866 INFO L78 Accepts]: Start accepts. Automaton has has 5 states, 5 states have (on average 41.4) internal successors, (207), 5 states have internal predecessors, (207), 0 states have call successors, (0), 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 207 [2025-02-05 20:14:07,866 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-02-05 20:14:07,881 INFO L225 Difference]: With dead ends: 21566 [2025-02-05 20:14:07,881 INFO L226 Difference]: Without dead ends: 18597 [2025-02-05 20:14:07,886 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 7 GetRequests, 3 SyntacticMatches, 0 SemanticMatches, 4 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=11, Invalid=19, Unknown=0, NotChecked=0, Total=30 [2025-02-05 20:14:07,886 INFO L435 NwaCegarLoop]: 1436 mSDtfsCounter, 457 mSDsluCounter, 4290 mSDsCounter, 0 mSdLazyCounter, 1195 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.3s Time, 0 mProtectedPredicate, 0 mProtectedAction, 457 SdHoareTripleChecker+Valid, 5726 SdHoareTripleChecker+Invalid, 1195 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 1195 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.4s IncrementalHoareTripleChecker+Time [2025-02-05 20:14:07,886 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [457 Valid, 5726 Invalid, 1195 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 1195 Invalid, 0 Unknown, 0 Unchecked, 0.4s Time] [2025-02-05 20:14:07,892 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 18597 states. [2025-02-05 20:14:07,983 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 18597 to 18150. [2025-02-05 20:14:07,995 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 18150 states, 18149 states have (on average 1.4056972835968924) internal successors, (25512), 18149 states have internal predecessors, (25512), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-02-05 20:14:08,012 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 18150 states to 18150 states and 25512 transitions. [2025-02-05 20:14:08,013 INFO L78 Accepts]: Start accepts. Automaton has 18150 states and 25512 transitions. Word has length 207 [2025-02-05 20:14:08,013 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-02-05 20:14:08,013 INFO L471 AbstractCegarLoop]: Abstraction has 18150 states and 25512 transitions. [2025-02-05 20:14:08,013 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 41.4) internal successors, (207), 5 states have internal predecessors, (207), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-02-05 20:14:08,013 INFO L276 IsEmpty]: Start isEmpty. Operand 18150 states and 25512 transitions. [2025-02-05 20:14:08,026 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 208 [2025-02-05 20:14:08,026 INFO L210 NwaCegarLoop]: Found error trace [2025-02-05 20:14:08,027 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] [2025-02-05 20:14:08,027 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable45 [2025-02-05 20:14:08,027 INFO L396 AbstractCegarLoop]: === Iteration 47 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-02-05 20:14:08,027 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-02-05 20:14:08,027 INFO L85 PathProgramCache]: Analyzing trace with hash -2027572887, now seen corresponding path program 1 times [2025-02-05 20:14:08,027 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-02-05 20:14:08,027 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1960931885] [2025-02-05 20:14:08,027 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-02-05 20:14:08,027 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-02-05 20:14:08,063 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 207 statements into 1 equivalence classes. [2025-02-05 20:14:08,111 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 207 of 207 statements. [2025-02-05 20:14:08,111 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-02-05 20:14:08,111 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-02-05 20:14:08,517 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-05 20:14:08,518 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-02-05 20:14:08,518 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1960931885] [2025-02-05 20:14:08,518 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1960931885] provided 1 perfect and 0 imperfect interpolant sequences [2025-02-05 20:14:08,518 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-02-05 20:14:08,518 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2025-02-05 20:14:08,518 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1710148453] [2025-02-05 20:14:08,518 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-02-05 20:14:08,518 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 7 states [2025-02-05 20:14:08,518 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-02-05 20:14:08,518 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2025-02-05 20:14:08,518 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=13, Invalid=29, Unknown=0, NotChecked=0, Total=42 [2025-02-05 20:14:08,518 INFO L87 Difference]: Start difference. First operand 18150 states and 25512 transitions. Second operand has 7 states, 7 states have (on average 29.571428571428573) internal successors, (207), 7 states have internal predecessors, (207), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-02-05 20:14:09,164 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-02-05 20:14:09,164 INFO L93 Difference]: Finished difference Result 39866 states and 55666 transitions. [2025-02-05 20:14:09,165 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2025-02-05 20:14:09,165 INFO L78 Accepts]: Start accepts. Automaton has has 7 states, 7 states have (on average 29.571428571428573) internal successors, (207), 7 states have internal predecessors, (207), 0 states have call successors, (0), 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 207 [2025-02-05 20:14:09,165 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-02-05 20:14:09,195 INFO L225 Difference]: With dead ends: 39866 [2025-02-05 20:14:09,195 INFO L226 Difference]: Without dead ends: 32254 [2025-02-05 20:14:09,208 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 8 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 6 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 4 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=18, Invalid=38, Unknown=0, NotChecked=0, Total=56 [2025-02-05 20:14:09,208 INFO L435 NwaCegarLoop]: 1411 mSDtfsCounter, 2315 mSDsluCounter, 5630 mSDsCounter, 0 mSdLazyCounter, 1573 mSolverCounterSat, 1 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.5s Time, 0 mProtectedPredicate, 0 mProtectedAction, 2315 SdHoareTripleChecker+Valid, 7041 SdHoareTripleChecker+Invalid, 1574 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 1 IncrementalHoareTripleChecker+Valid, 1573 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.5s IncrementalHoareTripleChecker+Time [2025-02-05 20:14:09,209 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [2315 Valid, 7041 Invalid, 1574 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [1 Valid, 1573 Invalid, 0 Unknown, 0 Unchecked, 0.5s Time] [2025-02-05 20:14:09,223 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 32254 states. [2025-02-05 20:14:09,402 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 32254 to 28574. [2025-02-05 20:14:09,424 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 28574 states, 28573 states have (on average 1.4059426731529765) internal successors, (40172), 28573 states have internal predecessors, (40172), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-02-05 20:14:09,455 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 28574 states to 28574 states and 40172 transitions. [2025-02-05 20:14:09,455 INFO L78 Accepts]: Start accepts. Automaton has 28574 states and 40172 transitions. Word has length 207 [2025-02-05 20:14:09,455 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-02-05 20:14:09,455 INFO L471 AbstractCegarLoop]: Abstraction has 28574 states and 40172 transitions. [2025-02-05 20:14:09,456 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 7 states, 7 states have (on average 29.571428571428573) internal successors, (207), 7 states have internal predecessors, (207), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-02-05 20:14:09,456 INFO L276 IsEmpty]: Start isEmpty. Operand 28574 states and 40172 transitions. [2025-02-05 20:14:09,483 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 208 [2025-02-05 20:14:09,484 INFO L210 NwaCegarLoop]: Found error trace [2025-02-05 20:14:09,484 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] [2025-02-05 20:14:09,484 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable46 [2025-02-05 20:14:09,484 INFO L396 AbstractCegarLoop]: === Iteration 48 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-02-05 20:14:09,484 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-02-05 20:14:09,484 INFO L85 PathProgramCache]: Analyzing trace with hash -1293574370, now seen corresponding path program 1 times [2025-02-05 20:14:09,484 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-02-05 20:14:09,484 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1500743307] [2025-02-05 20:14:09,484 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-02-05 20:14:09,484 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-02-05 20:14:09,521 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 207 statements into 1 equivalence classes. [2025-02-05 20:14:09,604 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 207 of 207 statements. [2025-02-05 20:14:09,604 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-02-05 20:14:09,604 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-02-05 20:14:09,802 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-05 20:14:09,802 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-02-05 20:14:09,802 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1500743307] [2025-02-05 20:14:09,802 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1500743307] provided 1 perfect and 0 imperfect interpolant sequences [2025-02-05 20:14:09,802 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-02-05 20:14:09,802 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2025-02-05 20:14:09,802 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1867739368] [2025-02-05 20:14:09,802 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-02-05 20:14:09,802 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 7 states [2025-02-05 20:14:09,802 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-02-05 20:14:09,803 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2025-02-05 20:14:09,803 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=11, Invalid=31, Unknown=0, NotChecked=0, Total=42 [2025-02-05 20:14:09,803 INFO L87 Difference]: Start difference. First operand 28574 states and 40172 transitions. Second operand has 7 states, 7 states have (on average 29.571428571428573) internal successors, (207), 7 states have internal predecessors, (207), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-02-05 20:14:10,446 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-02-05 20:14:10,446 INFO L93 Difference]: Finished difference Result 31698 states and 44576 transitions. [2025-02-05 20:14:10,446 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2025-02-05 20:14:10,446 INFO L78 Accepts]: Start accepts. Automaton has has 7 states, 7 states have (on average 29.571428571428573) internal successors, (207), 7 states have internal predecessors, (207), 0 states have call successors, (0), 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 207 [2025-02-05 20:14:10,447 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-02-05 20:14:10,475 INFO L225 Difference]: With dead ends: 31698 [2025-02-05 20:14:10,475 INFO L226 Difference]: Without dead ends: 28694 [2025-02-05 20:14:10,487 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 8 GetRequests, 3 SyntacticMatches, 0 SemanticMatches, 5 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=11, Invalid=31, Unknown=0, NotChecked=0, Total=42 [2025-02-05 20:14:10,488 INFO L435 NwaCegarLoop]: 1432 mSDtfsCounter, 4 mSDsluCounter, 7143 mSDsCounter, 0 mSdLazyCounter, 1761 mSolverCounterSat, 3 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.4s Time, 0 mProtectedPredicate, 0 mProtectedAction, 4 SdHoareTripleChecker+Valid, 8575 SdHoareTripleChecker+Invalid, 1764 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 3 IncrementalHoareTripleChecker+Valid, 1761 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.5s IncrementalHoareTripleChecker+Time [2025-02-05 20:14:10,488 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [4 Valid, 8575 Invalid, 1764 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [3 Valid, 1761 Invalid, 0 Unknown, 0 Unchecked, 0.5s Time] [2025-02-05 20:14:10,504 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 28694 states. [2025-02-05 20:14:10,681 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 28694 to 28574. [2025-02-05 20:14:10,706 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 28574 states, 28573 states have (on average 1.4059426731529765) internal successors, (40172), 28573 states have internal predecessors, (40172), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-02-05 20:14:10,741 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 28574 states to 28574 states and 40172 transitions. [2025-02-05 20:14:10,741 INFO L78 Accepts]: Start accepts. Automaton has 28574 states and 40172 transitions. Word has length 207 [2025-02-05 20:14:10,741 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-02-05 20:14:10,741 INFO L471 AbstractCegarLoop]: Abstraction has 28574 states and 40172 transitions. [2025-02-05 20:14:10,742 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 7 states, 7 states have (on average 29.571428571428573) internal successors, (207), 7 states have internal predecessors, (207), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-02-05 20:14:10,742 INFO L276 IsEmpty]: Start isEmpty. Operand 28574 states and 40172 transitions. [2025-02-05 20:14:10,768 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 208 [2025-02-05 20:14:10,768 INFO L210 NwaCegarLoop]: Found error trace [2025-02-05 20:14:10,768 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] [2025-02-05 20:14:10,768 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable47 [2025-02-05 20:14:10,769 INFO L396 AbstractCegarLoop]: === Iteration 49 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-02-05 20:14:10,769 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-02-05 20:14:10,769 INFO L85 PathProgramCache]: Analyzing trace with hash -1236055886, now seen corresponding path program 1 times [2025-02-05 20:14:10,769 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-02-05 20:14:10,769 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2025796512] [2025-02-05 20:14:10,769 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-02-05 20:14:10,769 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-02-05 20:14:10,806 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 207 statements into 1 equivalence classes. [2025-02-05 20:14:10,860 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 207 of 207 statements. [2025-02-05 20:14:10,861 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-02-05 20:14:10,861 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-02-05 20:14:11,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-05 20:14:11,278 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-02-05 20:14:11,278 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2025796512] [2025-02-05 20:14:11,278 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [2025796512] provided 1 perfect and 0 imperfect interpolant sequences [2025-02-05 20:14:11,278 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-02-05 20:14:11,278 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2025-02-05 20:14:11,278 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1579141585] [2025-02-05 20:14:11,278 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-02-05 20:14:11,278 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2025-02-05 20:14:11,278 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-02-05 20:14:11,279 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2025-02-05 20:14:11,279 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=11, Invalid=19, Unknown=0, NotChecked=0, Total=30 [2025-02-05 20:14:11,279 INFO L87 Difference]: Start difference. First operand 28574 states and 40172 transitions. Second operand has 6 states, 6 states have (on average 34.5) internal successors, (207), 6 states have internal predecessors, (207), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-02-05 20:14:11,851 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-02-05 20:14:11,851 INFO L93 Difference]: Finished difference Result 67526 states and 94033 transitions. [2025-02-05 20:14:11,851 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2025-02-05 20:14:11,851 INFO L78 Accepts]: Start accepts. Automaton has has 6 states, 6 states have (on average 34.5) internal successors, (207), 6 states have internal predecessors, (207), 0 states have call successors, (0), 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 207 [2025-02-05 20:14:11,852 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-02-05 20:14:11,904 INFO L225 Difference]: With dead ends: 67526 [2025-02-05 20:14:11,904 INFO L226 Difference]: Without dead ends: 51454 [2025-02-05 20:14:11,927 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 8 GetRequests, 3 SyntacticMatches, 0 SemanticMatches, 5 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 2 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=16, Invalid=26, Unknown=0, NotChecked=0, Total=42 [2025-02-05 20:14:11,927 INFO L435 NwaCegarLoop]: 1411 mSDtfsCounter, 2006 mSDsluCounter, 4224 mSDsCounter, 0 mSdLazyCounter, 1256 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.4s Time, 0 mProtectedPredicate, 0 mProtectedAction, 2006 SdHoareTripleChecker+Valid, 5635 SdHoareTripleChecker+Invalid, 1256 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 1256 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.4s IncrementalHoareTripleChecker+Time [2025-02-05 20:14:11,927 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [2006 Valid, 5635 Invalid, 1256 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 1256 Invalid, 0 Unknown, 0 Unchecked, 0.4s Time] [2025-02-05 20:14:11,956 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 51454 states. [2025-02-05 20:14:12,201 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 51454 to 28574. [2025-02-05 20:14:12,223 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 28574 states, 28573 states have (on average 1.4059426731529765) internal successors, (40172), 28573 states have internal predecessors, (40172), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-02-05 20:14:12,251 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 28574 states to 28574 states and 40172 transitions. [2025-02-05 20:14:12,252 INFO L78 Accepts]: Start accepts. Automaton has 28574 states and 40172 transitions. Word has length 207 [2025-02-05 20:14:12,252 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-02-05 20:14:12,252 INFO L471 AbstractCegarLoop]: Abstraction has 28574 states and 40172 transitions. [2025-02-05 20:14:12,252 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 6 states have (on average 34.5) internal successors, (207), 6 states have internal predecessors, (207), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-02-05 20:14:12,252 INFO L276 IsEmpty]: Start isEmpty. Operand 28574 states and 40172 transitions. [2025-02-05 20:14:12,276 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 208 [2025-02-05 20:14:12,276 INFO L210 NwaCegarLoop]: Found error trace [2025-02-05 20:14:12,276 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] [2025-02-05 20:14:12,276 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable48 [2025-02-05 20:14:12,276 INFO L396 AbstractCegarLoop]: === Iteration 50 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-02-05 20:14:12,277 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-02-05 20:14:12,277 INFO L85 PathProgramCache]: Analyzing trace with hash 1007579073, now seen corresponding path program 1 times [2025-02-05 20:14:12,277 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-02-05 20:14:12,277 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2034409920] [2025-02-05 20:14:12,277 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-02-05 20:14:12,277 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-02-05 20:14:12,311 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 207 statements into 1 equivalence classes. [2025-02-05 20:14:12,351 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 207 of 207 statements. [2025-02-05 20:14:12,351 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-02-05 20:14:12,351 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-02-05 20:14:12,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-05 20:14:12,694 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-02-05 20:14:12,694 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2034409920] [2025-02-05 20:14:12,694 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [2034409920] provided 1 perfect and 0 imperfect interpolant sequences [2025-02-05 20:14:12,694 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-02-05 20:14:12,694 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2025-02-05 20:14:12,694 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1948329211] [2025-02-05 20:14:12,694 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-02-05 20:14:12,695 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 7 states [2025-02-05 20:14:12,695 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-02-05 20:14:12,695 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2025-02-05 20:14:12,695 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=13, Invalid=29, Unknown=0, NotChecked=0, Total=42 [2025-02-05 20:14:12,695 INFO L87 Difference]: Start difference. First operand 28574 states and 40172 transitions. Second operand has 7 states, 7 states have (on average 29.571428571428573) internal successors, (207), 7 states have internal predecessors, (207), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-02-05 20:14:13,421 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-02-05 20:14:13,421 INFO L93 Difference]: Finished difference Result 68927 states and 96126 transitions. [2025-02-05 20:14:13,422 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2025-02-05 20:14:13,422 INFO L78 Accepts]: Start accepts. Automaton has has 7 states, 7 states have (on average 29.571428571428573) internal successors, (207), 7 states have internal predecessors, (207), 0 states have call successors, (0), 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 207 [2025-02-05 20:14:13,422 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-02-05 20:14:13,475 INFO L225 Difference]: With dead ends: 68927 [2025-02-05 20:14:13,475 INFO L226 Difference]: Without dead ends: 49396 [2025-02-05 20:14:13,499 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 8 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 6 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 4 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=18, Invalid=38, Unknown=0, NotChecked=0, Total=56 [2025-02-05 20:14:13,499 INFO L435 NwaCegarLoop]: 1413 mSDtfsCounter, 2332 mSDsluCounter, 5635 mSDsCounter, 0 mSdLazyCounter, 1577 mSolverCounterSat, 1 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.5s Time, 0 mProtectedPredicate, 0 mProtectedAction, 2332 SdHoareTripleChecker+Valid, 7048 SdHoareTripleChecker+Invalid, 1578 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 1 IncrementalHoareTripleChecker+Valid, 1577 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.6s IncrementalHoareTripleChecker+Time [2025-02-05 20:14:13,499 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [2332 Valid, 7048 Invalid, 1578 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [1 Valid, 1577 Invalid, 0 Unknown, 0 Unchecked, 0.6s Time] [2025-02-05 20:14:13,528 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 49396 states. [2025-02-05 20:14:13,796 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 49396 to 33102. [2025-02-05 20:14:13,823 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 33102 states, 33101 states have (on average 1.4166339385517055) internal successors, (46892), 33101 states have internal predecessors, (46892), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-02-05 20:14:13,859 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 33102 states to 33102 states and 46892 transitions. [2025-02-05 20:14:13,860 INFO L78 Accepts]: Start accepts. Automaton has 33102 states and 46892 transitions. Word has length 207 [2025-02-05 20:14:13,860 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-02-05 20:14:13,860 INFO L471 AbstractCegarLoop]: Abstraction has 33102 states and 46892 transitions. [2025-02-05 20:14:13,860 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 7 states, 7 states have (on average 29.571428571428573) internal successors, (207), 7 states have internal predecessors, (207), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-02-05 20:14:13,860 INFO L276 IsEmpty]: Start isEmpty. Operand 33102 states and 46892 transitions. [2025-02-05 20:14:13,889 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 209 [2025-02-05 20:14:13,889 INFO L210 NwaCegarLoop]: Found error trace [2025-02-05 20:14:13,889 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] [2025-02-05 20:14:13,889 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable49 [2025-02-05 20:14:13,890 INFO L396 AbstractCegarLoop]: === Iteration 51 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-02-05 20:14:13,890 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-02-05 20:14:13,890 INFO L85 PathProgramCache]: Analyzing trace with hash -805701779, now seen corresponding path program 1 times [2025-02-05 20:14:13,890 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-02-05 20:14:13,890 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1950344375] [2025-02-05 20:14:13,890 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-02-05 20:14:13,890 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-02-05 20:14:13,926 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 208 statements into 1 equivalence classes. [2025-02-05 20:14:13,973 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 208 of 208 statements. [2025-02-05 20:14:13,973 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-02-05 20:14:13,973 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-02-05 20:14:14,349 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-05 20:14:14,349 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-02-05 20:14:14,349 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1950344375] [2025-02-05 20:14:14,349 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1950344375] provided 1 perfect and 0 imperfect interpolant sequences [2025-02-05 20:14:14,349 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-02-05 20:14:14,349 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2025-02-05 20:14:14,349 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2045680781] [2025-02-05 20:14:14,349 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-02-05 20:14:14,349 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 7 states [2025-02-05 20:14:14,349 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-02-05 20:14:14,350 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2025-02-05 20:14:14,350 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=13, Invalid=29, Unknown=0, NotChecked=0, Total=42 [2025-02-05 20:14:14,350 INFO L87 Difference]: Start difference. First operand 33102 states and 46892 transitions. Second operand has 7 states, 7 states have (on average 29.714285714285715) internal successors, (208), 7 states have internal predecessors, (208), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-02-05 20:14:15,077 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-02-05 20:14:15,077 INFO L93 Difference]: Finished difference Result 77529 states and 109026 transitions. [2025-02-05 20:14:15,077 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2025-02-05 20:14:15,077 INFO L78 Accepts]: Start accepts. Automaton has has 7 states, 7 states have (on average 29.714285714285715) internal successors, (208), 7 states have internal predecessors, (208), 0 states have call successors, (0), 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 208 [2025-02-05 20:14:15,078 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-02-05 20:14:15,139 INFO L225 Difference]: With dead ends: 77529 [2025-02-05 20:14:15,139 INFO L226 Difference]: Without dead ends: 58940 [2025-02-05 20:14:15,166 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 8 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 6 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 4 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=18, Invalid=38, Unknown=0, NotChecked=0, Total=56 [2025-02-05 20:14:15,166 INFO L435 NwaCegarLoop]: 1411 mSDtfsCounter, 2333 mSDsluCounter, 5629 mSDsCounter, 0 mSdLazyCounter, 1573 mSolverCounterSat, 1 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.5s Time, 0 mProtectedPredicate, 0 mProtectedAction, 2333 SdHoareTripleChecker+Valid, 7040 SdHoareTripleChecker+Invalid, 1574 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 1 IncrementalHoareTripleChecker+Valid, 1573 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.6s IncrementalHoareTripleChecker+Time [2025-02-05 20:14:15,166 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [2333 Valid, 7040 Invalid, 1574 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [1 Valid, 1573 Invalid, 0 Unknown, 0 Unchecked, 0.6s Time] [2025-02-05 20:14:15,200 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 58940 states. [2025-02-05 20:14:15,712 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 58940 to 37894. [2025-02-05 20:14:15,745 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 37894 states, 37893 states have (on average 1.4265431610059907) internal successors, (54056), 37893 states have internal predecessors, (54056), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-02-05 20:14:15,799 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 37894 states to 37894 states and 54056 transitions. [2025-02-05 20:14:15,800 INFO L78 Accepts]: Start accepts. Automaton has 37894 states and 54056 transitions. Word has length 208 [2025-02-05 20:14:15,800 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-02-05 20:14:15,800 INFO L471 AbstractCegarLoop]: Abstraction has 37894 states and 54056 transitions. [2025-02-05 20:14:15,800 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 7 states, 7 states have (on average 29.714285714285715) internal successors, (208), 7 states have internal predecessors, (208), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-02-05 20:14:15,800 INFO L276 IsEmpty]: Start isEmpty. Operand 37894 states and 54056 transitions. [2025-02-05 20:14:15,846 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 209 [2025-02-05 20:14:15,846 INFO L210 NwaCegarLoop]: Found error trace [2025-02-05 20:14:15,846 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] [2025-02-05 20:14:15,846 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable50 [2025-02-05 20:14:15,846 INFO L396 AbstractCegarLoop]: === Iteration 52 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-02-05 20:14:15,847 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-02-05 20:14:15,847 INFO L85 PathProgramCache]: Analyzing trace with hash -1530512232, now seen corresponding path program 1 times [2025-02-05 20:14:15,847 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-02-05 20:14:15,847 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1382931308] [2025-02-05 20:14:15,847 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-02-05 20:14:15,847 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-02-05 20:14:15,899 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 208 statements into 1 equivalence classes. [2025-02-05 20:14:16,151 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 208 of 208 statements. [2025-02-05 20:14:16,151 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-02-05 20:14:16,151 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-02-05 20:14:16,652 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-05 20:14:16,652 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-02-05 20:14:16,652 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1382931308] [2025-02-05 20:14:16,652 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1382931308] provided 1 perfect and 0 imperfect interpolant sequences [2025-02-05 20:14:16,652 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-02-05 20:14:16,652 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [10] imperfect sequences [] total 10 [2025-02-05 20:14:16,652 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [512437278] [2025-02-05 20:14:16,652 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-02-05 20:14:16,653 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 10 states [2025-02-05 20:14:16,653 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-02-05 20:14:16,653 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 10 interpolants. [2025-02-05 20:14:16,653 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=20, Invalid=70, Unknown=0, NotChecked=0, Total=90 [2025-02-05 20:14:16,653 INFO L87 Difference]: Start difference. First operand 37894 states and 54056 transitions. Second operand has 10 states, 10 states have (on average 20.8) internal successors, (208), 10 states have internal predecessors, (208), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-02-05 20:14:18,454 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-02-05 20:14:18,454 INFO L93 Difference]: Finished difference Result 44167 states and 62836 transitions. [2025-02-05 20:14:18,454 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2025-02-05 20:14:18,454 INFO L78 Accepts]: Start accepts. Automaton has has 10 states, 10 states have (on average 20.8) internal successors, (208), 10 states have internal predecessors, (208), 0 states have call successors, (0), 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 208 [2025-02-05 20:14:18,455 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-02-05 20:14:18,489 INFO L225 Difference]: With dead ends: 44167 [2025-02-05 20:14:18,489 INFO L226 Difference]: Without dead ends: 39576 [2025-02-05 20:14:18,502 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 14 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 12 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 15 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=42, Invalid=140, Unknown=0, NotChecked=0, Total=182 [2025-02-05 20:14:18,503 INFO L435 NwaCegarLoop]: 1679 mSDtfsCounter, 892 mSDsluCounter, 11918 mSDsCounter, 0 mSdLazyCounter, 4193 mSolverCounterSat, 2 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 1.3s Time, 0 mProtectedPredicate, 0 mProtectedAction, 892 SdHoareTripleChecker+Valid, 13597 SdHoareTripleChecker+Invalid, 4195 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 2 IncrementalHoareTripleChecker+Valid, 4193 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 1.6s IncrementalHoareTripleChecker+Time [2025-02-05 20:14:18,503 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [892 Valid, 13597 Invalid, 4195 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [2 Valid, 4193 Invalid, 0 Unknown, 0 Unchecked, 1.6s Time] [2025-02-05 20:14:18,525 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 39576 states. [2025-02-05 20:14:18,868 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 39576 to 37809. [2025-02-05 20:14:18,898 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 37809 states, 37808 states have (on average 1.4254919593736775) internal successors, (53895), 37808 states have internal predecessors, (53895), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-02-05 20:14:18,937 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 37809 states to 37809 states and 53895 transitions. [2025-02-05 20:14:18,938 INFO L78 Accepts]: Start accepts. Automaton has 37809 states and 53895 transitions. Word has length 208 [2025-02-05 20:14:18,938 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-02-05 20:14:18,938 INFO L471 AbstractCegarLoop]: Abstraction has 37809 states and 53895 transitions. [2025-02-05 20:14:18,938 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 10 states, 10 states have (on average 20.8) internal successors, (208), 10 states have internal predecessors, (208), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-02-05 20:14:18,938 INFO L276 IsEmpty]: Start isEmpty. Operand 37809 states and 53895 transitions. [2025-02-05 20:14:18,969 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 209 [2025-02-05 20:14:18,969 INFO L210 NwaCegarLoop]: Found error trace [2025-02-05 20:14:18,969 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] [2025-02-05 20:14:18,969 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable51 [2025-02-05 20:14:18,969 INFO L396 AbstractCegarLoop]: === Iteration 53 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-02-05 20:14:18,970 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-02-05 20:14:18,970 INFO L85 PathProgramCache]: Analyzing trace with hash 1061549317, now seen corresponding path program 1 times [2025-02-05 20:14:18,970 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-02-05 20:14:18,970 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2105650935] [2025-02-05 20:14:18,970 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-02-05 20:14:18,970 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-02-05 20:14:19,006 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 208 statements into 1 equivalence classes. [2025-02-05 20:14:19,202 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 208 of 208 statements. [2025-02-05 20:14:19,202 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-02-05 20:14:19,202 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-02-05 20:14:19,616 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-05 20:14:19,616 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-02-05 20:14:19,616 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2105650935] [2025-02-05 20:14:19,616 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [2105650935] provided 1 perfect and 0 imperfect interpolant sequences [2025-02-05 20:14:19,616 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-02-05 20:14:19,616 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [9] imperfect sequences [] total 9 [2025-02-05 20:14:19,616 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [149456349] [2025-02-05 20:14:19,616 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-02-05 20:14:19,616 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 9 states [2025-02-05 20:14:19,616 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-02-05 20:14:19,617 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2025-02-05 20:14:19,617 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=17, Invalid=55, Unknown=0, NotChecked=0, Total=72 [2025-02-05 20:14:19,617 INFO L87 Difference]: Start difference. First operand 37809 states and 53895 transitions. Second operand has 9 states, 9 states have (on average 23.11111111111111) internal successors, (208), 9 states have internal predecessors, (208), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-02-05 20:14:21,024 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-02-05 20:14:21,024 INFO L93 Difference]: Finished difference Result 44404 states and 63131 transitions. [2025-02-05 20:14:21,025 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2025-02-05 20:14:21,025 INFO L78 Accepts]: Start accepts. Automaton has has 9 states, 9 states have (on average 23.11111111111111) internal successors, (208), 9 states have internal predecessors, (208), 0 states have call successors, (0), 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 208 [2025-02-05 20:14:21,025 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-02-05 20:14:21,063 INFO L225 Difference]: With dead ends: 44404 [2025-02-05 20:14:21,063 INFO L226 Difference]: Without dead ends: 41786 [2025-02-05 20:14:21,078 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 14 GetRequests, 3 SyntacticMatches, 0 SemanticMatches, 11 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 9 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=39, Invalid=117, Unknown=0, NotChecked=0, Total=156 [2025-02-05 20:14:21,078 INFO L435 NwaCegarLoop]: 1649 mSDtfsCounter, 816 mSDsluCounter, 8965 mSDsCounter, 0 mSdLazyCounter, 3128 mSolverCounterSat, 2 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 1.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 816 SdHoareTripleChecker+Valid, 10614 SdHoareTripleChecker+Invalid, 3130 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 2 IncrementalHoareTripleChecker+Valid, 3128 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 1.2s IncrementalHoareTripleChecker+Time [2025-02-05 20:14:21,079 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [816 Valid, 10614 Invalid, 3130 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [2 Valid, 3128 Invalid, 0 Unknown, 0 Unchecked, 1.2s Time] [2025-02-05 20:14:21,098 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 41786 states. [2025-02-05 20:14:21,339 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 41786 to 39660. [2025-02-05 20:14:21,369 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 39660 states, 39659 states have (on average 1.4226531178294965) internal successors, (56421), 39659 states have internal predecessors, (56421), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-02-05 20:14:21,580 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 39660 states to 39660 states and 56421 transitions. [2025-02-05 20:14:21,581 INFO L78 Accepts]: Start accepts. Automaton has 39660 states and 56421 transitions. Word has length 208 [2025-02-05 20:14:21,581 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-02-05 20:14:21,581 INFO L471 AbstractCegarLoop]: Abstraction has 39660 states and 56421 transitions. [2025-02-05 20:14:21,581 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 9 states, 9 states have (on average 23.11111111111111) internal successors, (208), 9 states have internal predecessors, (208), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-02-05 20:14:21,581 INFO L276 IsEmpty]: Start isEmpty. Operand 39660 states and 56421 transitions.