./Ultimate.py --spec ../sv-benchmarks/c/properties/unreach-call.prp --file ../sv-benchmarks/c/hardware-verification-bv/btor2c-lazyMod.circular_pointer_top_w8_d16_e0.c --full-output --architecture 64bit -------------------------------------------------------------------------------- Checking for ERROR reachability Using default analysis Version 8fc3dc66 Calling Ultimate with: /root/.sdkman/candidates/java/21.0.5-tem/bin/java -Dosgi.configuration.area=/storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/config -Xmx15G -Xms4m -jar /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/plugins/org.eclipse.equinox.launcher_1.6.800.v20240513-1750.jar -data @noDefault -ultimatedata /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data -tc /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/config/AutomizerReach.xml -i ../sv-benchmarks/c/hardware-verification-bv/btor2c-lazyMod.circular_pointer_top_w8_d16_e0.c -s /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/config/svcomp-Reach-64bit-Automizer_Default.epf --cacsl2boogietranslator.entry.function main --witnessprinter.witness.directory /storage/repos/ultimate/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 5b1736736c06966e3b4f5adb4865787ef8bbb0ebdf6c77cc2a8afb60cf5fc8db --- Real Ultimate output --- This is Ultimate 0.3.0-?-8fc3dc6-m [2025-03-16 21:38:05,805 INFO L188 SettingsManager]: Resetting all preferences to default values... [2025-03-16 21:38:05,844 INFO L114 SettingsManager]: Loading settings from /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/config/svcomp-Reach-64bit-Automizer_Default.epf [2025-03-16 21:38:05,848 WARN L101 SettingsManager]: Preference file contains the following unknown settings: [2025-03-16 21:38:05,848 WARN L103 SettingsManager]: * de.uni_freiburg.informatik.ultimate.core.Log level for class [2025-03-16 21:38:05,866 INFO L130 SettingsManager]: Preferences different from defaults after loading the file: [2025-03-16 21:38:05,867 INFO L151 SettingsManager]: Preferences of UltimateCore differ from their defaults: [2025-03-16 21:38:05,867 INFO L153 SettingsManager]: * Log level for class=de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher=ERROR; [2025-03-16 21:38:05,867 INFO L151 SettingsManager]: Preferences of Boogie Preprocessor differ from their defaults: [2025-03-16 21:38:05,867 INFO L153 SettingsManager]: * Use memory slicer=true [2025-03-16 21:38:05,867 INFO L151 SettingsManager]: Preferences of Boogie Procedure Inliner differ from their defaults: [2025-03-16 21:38:05,867 INFO L153 SettingsManager]: * Ignore calls to procedures called more than once=ONLY_FOR_SEQUENTIAL_PROGRAMS [2025-03-16 21:38:05,867 INFO L151 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2025-03-16 21:38:05,868 INFO L153 SettingsManager]: * Create parallel compositions if possible=false [2025-03-16 21:38:05,868 INFO L153 SettingsManager]: * Use SBE=true [2025-03-16 21:38:05,868 INFO L151 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2025-03-16 21:38:05,868 INFO L153 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2025-03-16 21:38:05,868 INFO L153 SettingsManager]: * Overapproximate operations on floating types=true [2025-03-16 21:38:05,868 INFO L153 SettingsManager]: * Check division by zero=IGNORE [2025-03-16 21:38:05,868 INFO L153 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2025-03-16 21:38:05,868 INFO L153 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2025-03-16 21:38:05,868 INFO L153 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2025-03-16 21:38:05,868 INFO L153 SettingsManager]: * Check if freed pointer was valid=false [2025-03-16 21:38:05,868 INFO L153 SettingsManager]: * Behaviour of calls to undefined functions=OVERAPPROXIMATE_BEHAVIOUR [2025-03-16 21:38:05,868 INFO L153 SettingsManager]: * Use constant arrays=true [2025-03-16 21:38:05,868 INFO L151 SettingsManager]: Preferences of IcfgBuilder differ from their defaults: [2025-03-16 21:38:05,868 INFO L153 SettingsManager]: * Size of a code block=SequenceOfStatements [2025-03-16 21:38:05,868 INFO L153 SettingsManager]: * Only consider context switches at boundaries of atomic blocks=true [2025-03-16 21:38:05,868 INFO L153 SettingsManager]: * SMT solver=External_DefaultMode [2025-03-16 21:38:05,868 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2025-03-16 21:38:05,868 INFO L151 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2025-03-16 21:38:05,869 INFO L153 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2025-03-16 21:38:05,869 INFO L153 SettingsManager]: * Compute procedure contracts=false [2025-03-16 21:38:05,869 INFO L153 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopHeads [2025-03-16 21:38:05,869 INFO L153 SettingsManager]: * Trace refinement strategy=CAMEL [2025-03-16 21:38:05,869 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2025-03-16 21:38:05,869 INFO L153 SettingsManager]: * Apply one-shot large block encoding in concurrent analysis=false [2025-03-16 21:38:05,869 INFO L153 SettingsManager]: * Automaton type used in concurrency analysis=PETRI_NET [2025-03-16 21:38:05,869 INFO L153 SettingsManager]: * Order on configurations for Petri net unfoldings=DBO [2025-03-16 21:38:05,869 INFO L153 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode [2025-03-16 21:38:05,869 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/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 -> 5b1736736c06966e3b4f5adb4865787ef8bbb0ebdf6c77cc2a8afb60cf5fc8db [2025-03-16 21:38:06,095 INFO L75 nceAwareModelManager]: Repository-Root is: /tmp [2025-03-16 21:38:06,103 INFO L261 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2025-03-16 21:38:06,105 INFO L217 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2025-03-16 21:38:06,106 INFO L270 PluginConnector]: Initializing CDTParser... [2025-03-16 21:38:06,106 INFO L274 PluginConnector]: CDTParser initialized [2025-03-16 21:38:06,107 INFO L431 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/../sv-benchmarks/c/hardware-verification-bv/btor2c-lazyMod.circular_pointer_top_w8_d16_e0.c [2025-03-16 21:38:07,272 INFO L533 CDTParser]: Created temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/bef979f75/f7f403f8c15a4d14ac1f53081036674f/FLAG4a0b80e00 [2025-03-16 21:38:07,582 INFO L384 CDTParser]: Found 1 translation units. [2025-03-16 21:38:07,585 INFO L180 CDTParser]: Scanning /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/hardware-verification-bv/btor2c-lazyMod.circular_pointer_top_w8_d16_e0.c [2025-03-16 21:38:07,596 INFO L427 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/bef979f75/f7f403f8c15a4d14ac1f53081036674f/FLAG4a0b80e00 [2025-03-16 21:38:07,853 INFO L435 CDTParser]: Successfully deleted /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/bef979f75/f7f403f8c15a4d14ac1f53081036674f [2025-03-16 21:38:07,855 INFO L299 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2025-03-16 21:38:07,856 INFO L133 ToolchainWalker]: Walking toolchain with 6 elements. [2025-03-16 21:38:07,857 INFO L112 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2025-03-16 21:38:07,857 INFO L270 PluginConnector]: Initializing CACSL2BoogieTranslator... [2025-03-16 21:38:07,861 INFO L274 PluginConnector]: CACSL2BoogieTranslator initialized [2025-03-16 21:38:07,861 INFO L184 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 16.03 09:38:07" (1/1) ... [2025-03-16 21:38:07,862 INFO L204 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@1ace293c and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 16.03 09:38:07, skipping insertion in model container [2025-03-16 21:38:07,862 INFO L184 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 16.03 09:38:07" (1/1) ... [2025-03-16 21:38:07,897 INFO L175 MainTranslator]: Built tables and reachable declarations [2025-03-16 21:38:08,016 WARN L250 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/hardware-verification-bv/btor2c-lazyMod.circular_pointer_top_w8_d16_e0.c[1279,1292] [2025-03-16 21:38:08,200 INFO L210 PostProcessor]: Analyzing one entry point: main [2025-03-16 21:38:08,208 INFO L200 MainTranslator]: Completed pre-run [2025-03-16 21:38:08,216 WARN L250 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/hardware-verification-bv/btor2c-lazyMod.circular_pointer_top_w8_d16_e0.c[1279,1292] [2025-03-16 21:38:08,303 INFO L210 PostProcessor]: Analyzing one entry point: main [2025-03-16 21:38:08,315 INFO L204 MainTranslator]: Completed translation [2025-03-16 21:38:08,315 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 16.03 09:38:08 WrapperNode [2025-03-16 21:38:08,316 INFO L131 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2025-03-16 21:38:08,316 INFO L112 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2025-03-16 21:38:08,316 INFO L270 PluginConnector]: Initializing Boogie Procedure Inliner... [2025-03-16 21:38:08,316 INFO L274 PluginConnector]: Boogie Procedure Inliner initialized [2025-03-16 21:38:08,320 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 16.03 09:38:08" (1/1) ... [2025-03-16 21:38:08,346 INFO L184 PluginConnector]: Executing the observer Inliner from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 16.03 09:38:08" (1/1) ... [2025-03-16 21:38:08,510 INFO L138 Inliner]: procedures = 17, calls = 11, calls flagged for inlining = 3, calls inlined = 3, statements flattened = 1976 [2025-03-16 21:38:08,510 INFO L131 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2025-03-16 21:38:08,511 INFO L112 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2025-03-16 21:38:08,511 INFO L270 PluginConnector]: Initializing Boogie Preprocessor... [2025-03-16 21:38:08,511 INFO L274 PluginConnector]: Boogie Preprocessor initialized [2025-03-16 21:38:08,517 INFO L184 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 16.03 09:38:08" (1/1) ... [2025-03-16 21:38:08,518 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 16.03 09:38:08" (1/1) ... [2025-03-16 21:38:08,592 INFO L184 PluginConnector]: Executing the observer MemorySlicer from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 16.03 09:38:08" (1/1) ... [2025-03-16 21:38:08,651 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-03-16 21:38:08,652 INFO L184 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 16.03 09:38:08" (1/1) ... [2025-03-16 21:38:08,652 INFO L184 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 16.03 09:38:08" (1/1) ... [2025-03-16 21:38:08,693 INFO L184 PluginConnector]: Executing the observer ReplaceArrayAssignments from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 16.03 09:38:08" (1/1) ... [2025-03-16 21:38:08,704 INFO L184 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 16.03 09:38:08" (1/1) ... [2025-03-16 21:38:08,717 INFO L184 PluginConnector]: Executing the observer LTLStepAnnotator from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 16.03 09:38:08" (1/1) ... [2025-03-16 21:38:08,729 INFO L184 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 16.03 09:38:08" (1/1) ... [2025-03-16 21:38:08,748 INFO L131 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2025-03-16 21:38:08,750 INFO L112 PluginConnector]: ------------------------IcfgBuilder---------------------------- [2025-03-16 21:38:08,750 INFO L270 PluginConnector]: Initializing IcfgBuilder... [2025-03-16 21:38:08,750 INFO L274 PluginConnector]: IcfgBuilder initialized [2025-03-16 21:38:08,750 INFO L184 PluginConnector]: Executing the observer IcfgBuilderObserver from plugin IcfgBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 16.03 09:38:08" (1/1) ... [2025-03-16 21:38:08,754 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2025-03-16 21:38:08,762 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2025-03-16 21:38:08,774 INFO L229 MonitoredProcess]: Starting monitored process 1 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 (exit command is (exit), workingDir is null) [2025-03-16 21:38:08,776 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 (1)] Waiting until timeout for monitored process [2025-03-16 21:38:08,793 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocInit [2025-03-16 21:38:08,793 INFO L130 BoogieDeclarations]: Found specification of procedure assume_abort_if_not [2025-03-16 21:38:08,794 INFO L138 BoogieDeclarations]: Found implementation of procedure assume_abort_if_not [2025-03-16 21:38:08,794 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int#0 [2025-03-16 21:38:08,794 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2025-03-16 21:38:08,794 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2025-03-16 21:38:08,986 INFO L256 CfgBuilder]: Building ICFG [2025-03-16 21:38:08,988 INFO L286 CfgBuilder]: Building CFG for each procedure with an implementation [2025-03-16 21:38:10,612 INFO L? ?]: Removed 1089 outVars from TransFormulas that were not future-live. [2025-03-16 21:38:10,612 INFO L307 CfgBuilder]: Performing block encoding [2025-03-16 21:38:10,703 INFO L331 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2025-03-16 21:38:10,704 INFO L336 CfgBuilder]: Removed 0 assume(true) statements. [2025-03-16 21:38:10,704 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.icfgbuilder CFG 16.03 09:38:10 BoogieIcfgContainer [2025-03-16 21:38:10,704 INFO L131 PluginConnector]: ------------------------ END IcfgBuilder---------------------------- [2025-03-16 21:38:10,706 INFO L112 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2025-03-16 21:38:10,707 INFO L270 PluginConnector]: Initializing TraceAbstraction... [2025-03-16 21:38:10,710 INFO L274 PluginConnector]: TraceAbstraction initialized [2025-03-16 21:38:10,710 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 16.03 09:38:07" (1/3) ... [2025-03-16 21:38:10,711 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@2194ef88 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 16.03 09:38:10, skipping insertion in model container [2025-03-16 21:38:10,711 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 16.03 09:38:08" (2/3) ... [2025-03-16 21:38:10,712 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@2194ef88 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 16.03 09:38:10, skipping insertion in model container [2025-03-16 21:38:10,712 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.icfgbuilder CFG 16.03 09:38:10" (3/3) ... [2025-03-16 21:38:10,713 INFO L128 eAbstractionObserver]: Analyzing ICFG btor2c-lazyMod.circular_pointer_top_w8_d16_e0.c [2025-03-16 21:38:10,725 INFO L216 ceAbstractionStarter]: Automizer settings: Hoare:LoopHeads NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2025-03-16 21:38:10,727 INFO L151 ceAbstractionStarter]: Applying trace abstraction to ICFG btor2c-lazyMod.circular_pointer_top_w8_d16_e0.c that has 2 procedures, 550 locations, 1 initial locations, 1 loop locations, and 1 error locations. [2025-03-16 21:38:10,788 INFO L332 AbstractCegarLoop]: ======== Iteration 0 == of CEGAR loop == AllErrorsAtOnce ======== [2025-03-16 21:38:10,796 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;@bf36e66, mLbeIndependenceSettings=[IndependenceType=SEMANTIC, AbstractionType=NONE, UseConditional=false, UseSemiCommutativity=true, Solver=Z3, SolverTimeout=1000ms] [2025-03-16 21:38:10,796 INFO L334 AbstractCegarLoop]: Starting to check reachability of 1 error locations. [2025-03-16 21:38:10,801 INFO L276 IsEmpty]: Start isEmpty. Operand has 550 states, 544 states have (on average 1.4963235294117647) internal successors, (814), 545 states have internal predecessors, (814), 3 states have call successors, (3), 1 states have call predecessors, (3), 1 states have return successors, (3), 3 states have call predecessors, (3), 3 states have call successors, (3) [2025-03-16 21:38:10,815 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 149 [2025-03-16 21:38:10,816 INFO L210 NwaCegarLoop]: Found error trace [2025-03-16 21:38:10,817 INFO L218 NwaCegarLoop]: trace histogram [3, 3, 3, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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-03-16 21:38:10,818 INFO L396 AbstractCegarLoop]: === Iteration 1 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-03-16 21:38:10,822 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-16 21:38:10,822 INFO L85 PathProgramCache]: Analyzing trace with hash 75293469, now seen corresponding path program 1 times [2025-03-16 21:38:10,827 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-16 21:38:10,829 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [606896725] [2025-03-16 21:38:10,829 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-16 21:38:10,830 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-16 21:38:10,944 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 148 statements into 1 equivalence classes. [2025-03-16 21:38:10,990 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 148 of 148 statements. [2025-03-16 21:38:10,991 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-16 21:38:10,991 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-16 21:38:11,212 INFO L134 CoverageAnalysis]: Checked inductivity of 12 backedges. 0 proven. 4 refuted. 0 times theorem prover too weak. 8 trivial. 0 not checked. [2025-03-16 21:38:11,212 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-16 21:38:11,212 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [606896725] [2025-03-16 21:38:11,213 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [606896725] provided 0 perfect and 1 imperfect interpolant sequences [2025-03-16 21:38:11,213 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [148555154] [2025-03-16 21:38:11,213 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-16 21:38:11,213 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-03-16 21:38:11,213 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2025-03-16 21:38:11,216 INFO L229 MonitoredProcess]: Starting monitored process 2 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2025-03-16 21:38:11,218 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (2)] Waiting until timeout for monitored process [2025-03-16 21:38:11,487 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 148 statements into 1 equivalence classes. [2025-03-16 21:38:11,594 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 148 of 148 statements. [2025-03-16 21:38:11,595 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-16 21:38:11,595 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-16 21:38:11,600 INFO L256 TraceCheckSpWp]: Trace formula consists of 929 conjuncts, 1 conjuncts are in the unsatisfiable core [2025-03-16 21:38:11,610 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-03-16 21:38:11,628 INFO L134 CoverageAnalysis]: Checked inductivity of 12 backedges. 4 proven. 0 refuted. 0 times theorem prover too weak. 8 trivial. 0 not checked. [2025-03-16 21:38:11,629 INFO L308 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2025-03-16 21:38:11,629 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [148555154] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-16 21:38:11,629 INFO L185 FreeRefinementEngine]: Found 1 perfect and 1 imperfect interpolant sequences. [2025-03-16 21:38:11,629 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [2] total 2 [2025-03-16 21:38:11,631 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [246439806] [2025-03-16 21:38:11,631 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-16 21:38:11,634 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 2 states [2025-03-16 21:38:11,634 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-16 21:38:11,650 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 2 interpolants. [2025-03-16 21:38:11,651 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=1, Invalid=1, Unknown=0, NotChecked=0, Total=2 [2025-03-16 21:38:11,653 INFO L87 Difference]: Start difference. First operand has 550 states, 544 states have (on average 1.4963235294117647) internal successors, (814), 545 states have internal predecessors, (814), 3 states have call successors, (3), 1 states have call predecessors, (3), 1 states have return successors, (3), 3 states have call predecessors, (3), 3 states have call successors, (3) Second operand has 2 states, 2 states have (on average 69.0) internal successors, (138), 2 states have internal predecessors, (138), 2 states have call successors, (3), 2 states have call predecessors, (3), 1 states have return successors, (3), 1 states have call predecessors, (3), 2 states have call successors, (3) [2025-03-16 21:38:11,854 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-16 21:38:11,855 INFO L93 Difference]: Finished difference Result 997 states and 1491 transitions. [2025-03-16 21:38:11,856 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 2 states. [2025-03-16 21:38:11,857 INFO L78 Accepts]: Start accepts. Automaton has has 2 states, 2 states have (on average 69.0) internal successors, (138), 2 states have internal predecessors, (138), 2 states have call successors, (3), 2 states have call predecessors, (3), 1 states have return successors, (3), 1 states have call predecessors, (3), 2 states have call successors, (3) Word has length 148 [2025-03-16 21:38:11,857 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-16 21:38:11,868 INFO L225 Difference]: With dead ends: 997 [2025-03-16 21:38:11,868 INFO L226 Difference]: Without dead ends: 548 [2025-03-16 21:38:11,874 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 149 GetRequests, 149 SyntacticMatches, 0 SemanticMatches, 0 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=1, Invalid=1, Unknown=0, NotChecked=0, Total=2 [2025-03-16 21:38:11,877 INFO L435 NwaCegarLoop]: 683 mSDtfsCounter, 0 mSDsluCounter, 0 mSDsCounter, 0 mSdLazyCounter, 133 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 0 SdHoareTripleChecker+Valid, 683 SdHoareTripleChecker+Invalid, 133 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 133 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.2s IncrementalHoareTripleChecker+Time [2025-03-16 21:38:11,877 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [0 Valid, 683 Invalid, 133 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 133 Invalid, 0 Unknown, 0 Unchecked, 0.2s Time] [2025-03-16 21:38:11,891 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 548 states. [2025-03-16 21:38:11,920 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 548 to 548. [2025-03-16 21:38:11,922 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 548 states, 543 states have (on average 1.4917127071823204) internal successors, (810), 543 states have internal predecessors, (810), 3 states have call successors, (3), 1 states have call predecessors, (3), 1 states have return successors, (3), 3 states have call predecessors, (3), 3 states have call successors, (3) [2025-03-16 21:38:11,925 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 548 states to 548 states and 816 transitions. [2025-03-16 21:38:11,930 INFO L78 Accepts]: Start accepts. Automaton has 548 states and 816 transitions. Word has length 148 [2025-03-16 21:38:11,931 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-16 21:38:11,931 INFO L471 AbstractCegarLoop]: Abstraction has 548 states and 816 transitions. [2025-03-16 21:38:11,931 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 2 states, 2 states have (on average 69.0) internal successors, (138), 2 states have internal predecessors, (138), 2 states have call successors, (3), 2 states have call predecessors, (3), 1 states have return successors, (3), 1 states have call predecessors, (3), 2 states have call successors, (3) [2025-03-16 21:38:11,931 INFO L276 IsEmpty]: Start isEmpty. Operand 548 states and 816 transitions. [2025-03-16 21:38:11,934 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 149 [2025-03-16 21:38:11,934 INFO L210 NwaCegarLoop]: Found error trace [2025-03-16 21:38:11,935 INFO L218 NwaCegarLoop]: trace histogram [3, 3, 3, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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-03-16 21:38:11,943 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (2)] Ended with exit code 0 [2025-03-16 21:38:12,138 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 2 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable0 [2025-03-16 21:38:12,138 INFO L396 AbstractCegarLoop]: === Iteration 2 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-03-16 21:38:12,139 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-16 21:38:12,139 INFO L85 PathProgramCache]: Analyzing trace with hash 361194170, now seen corresponding path program 1 times [2025-03-16 21:38:12,139 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-16 21:38:12,139 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [292405081] [2025-03-16 21:38:12,139 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-16 21:38:12,139 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-16 21:38:12,181 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 148 statements into 1 equivalence classes. [2025-03-16 21:38:12,289 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 148 of 148 statements. [2025-03-16 21:38:12,290 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-16 21:38:12,290 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-16 21:38:12,873 INFO L134 CoverageAnalysis]: Checked inductivity of 12 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 12 trivial. 0 not checked. [2025-03-16 21:38:12,873 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-16 21:38:12,873 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [292405081] [2025-03-16 21:38:12,873 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [292405081] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-16 21:38:12,873 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-16 21:38:12,873 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2025-03-16 21:38:12,873 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [337484449] [2025-03-16 21:38:12,873 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-16 21:38:12,875 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2025-03-16 21:38:12,875 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-16 21:38:12,876 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2025-03-16 21:38:12,876 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2025-03-16 21:38:12,876 INFO L87 Difference]: Start difference. First operand 548 states and 816 transitions. Second operand has 4 states, 4 states have (on average 34.0) internal successors, (136), 4 states have internal predecessors, (136), 1 states have call successors, (3), 1 states have call predecessors, (3), 1 states have return successors, (3), 1 states have call predecessors, (3), 1 states have call successors, (3) [2025-03-16 21:38:13,120 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-16 21:38:13,121 INFO L93 Difference]: Finished difference Result 552 states and 820 transitions. [2025-03-16 21:38:13,121 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2025-03-16 21:38:13,121 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 4 states have (on average 34.0) internal successors, (136), 4 states have internal predecessors, (136), 1 states have call successors, (3), 1 states have call predecessors, (3), 1 states have return successors, (3), 1 states have call predecessors, (3), 1 states have call successors, (3) Word has length 148 [2025-03-16 21:38:13,122 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-16 21:38:13,124 INFO L225 Difference]: With dead ends: 552 [2025-03-16 21:38:13,124 INFO L226 Difference]: Without dead ends: 550 [2025-03-16 21:38:13,124 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-03-16 21:38:13,125 INFO L435 NwaCegarLoop]: 681 mSDtfsCounter, 0 mSDsluCounter, 1357 mSDsCounter, 0 mSdLazyCounter, 409 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 0 SdHoareTripleChecker+Valid, 2038 SdHoareTripleChecker+Invalid, 409 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 409 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.2s IncrementalHoareTripleChecker+Time [2025-03-16 21:38:13,125 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [0 Valid, 2038 Invalid, 409 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 409 Invalid, 0 Unknown, 0 Unchecked, 0.2s Time] [2025-03-16 21:38:13,126 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 550 states. [2025-03-16 21:38:13,138 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 550 to 550. [2025-03-16 21:38:13,141 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 550 states, 545 states have (on average 1.489908256880734) internal successors, (812), 545 states have internal predecessors, (812), 3 states have call successors, (3), 1 states have call predecessors, (3), 1 states have return successors, (3), 3 states have call predecessors, (3), 3 states have call successors, (3) [2025-03-16 21:38:13,143 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 550 states to 550 states and 818 transitions. [2025-03-16 21:38:13,143 INFO L78 Accepts]: Start accepts. Automaton has 550 states and 818 transitions. Word has length 148 [2025-03-16 21:38:13,145 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-16 21:38:13,146 INFO L471 AbstractCegarLoop]: Abstraction has 550 states and 818 transitions. [2025-03-16 21:38:13,146 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 34.0) internal successors, (136), 4 states have internal predecessors, (136), 1 states have call successors, (3), 1 states have call predecessors, (3), 1 states have return successors, (3), 1 states have call predecessors, (3), 1 states have call successors, (3) [2025-03-16 21:38:13,146 INFO L276 IsEmpty]: Start isEmpty. Operand 550 states and 818 transitions. [2025-03-16 21:38:13,147 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 150 [2025-03-16 21:38:13,148 INFO L210 NwaCegarLoop]: Found error trace [2025-03-16 21:38:13,148 INFO L218 NwaCegarLoop]: trace histogram [3, 3, 3, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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-03-16 21:38:13,148 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable1 [2025-03-16 21:38:13,149 INFO L396 AbstractCegarLoop]: === Iteration 3 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-03-16 21:38:13,149 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-16 21:38:13,149 INFO L85 PathProgramCache]: Analyzing trace with hash -1683202985, now seen corresponding path program 1 times [2025-03-16 21:38:13,150 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-16 21:38:13,150 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [817580593] [2025-03-16 21:38:13,150 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-16 21:38:13,150 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-16 21:38:13,187 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 149 statements into 1 equivalence classes. [2025-03-16 21:38:13,257 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 149 of 149 statements. [2025-03-16 21:38:13,257 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-16 21:38:13,257 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-16 21:38:13,567 INFO L134 CoverageAnalysis]: Checked inductivity of 12 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 12 trivial. 0 not checked. [2025-03-16 21:38:13,569 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-16 21:38:13,569 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [817580593] [2025-03-16 21:38:13,569 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [817580593] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-16 21:38:13,569 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-16 21:38:13,569 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2025-03-16 21:38:13,569 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [122865636] [2025-03-16 21:38:13,569 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-16 21:38:13,570 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2025-03-16 21:38:13,570 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-16 21:38:13,570 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2025-03-16 21:38:13,570 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2025-03-16 21:38:13,571 INFO L87 Difference]: Start difference. First operand 550 states and 818 transitions. Second operand has 5 states, 5 states have (on average 27.4) internal successors, (137), 5 states have internal predecessors, (137), 1 states have call successors, (3), 1 states have call predecessors, (3), 1 states have return successors, (3), 1 states have call predecessors, (3), 1 states have call successors, (3) [2025-03-16 21:38:14,119 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-16 21:38:14,120 INFO L93 Difference]: Finished difference Result 1370 states and 2040 transitions. [2025-03-16 21:38:14,120 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2025-03-16 21:38:14,120 INFO L78 Accepts]: Start accepts. Automaton has has 5 states, 5 states have (on average 27.4) internal successors, (137), 5 states have internal predecessors, (137), 1 states have call successors, (3), 1 states have call predecessors, (3), 1 states have return successors, (3), 1 states have call predecessors, (3), 1 states have call successors, (3) Word has length 149 [2025-03-16 21:38:14,121 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-16 21:38:14,122 INFO L225 Difference]: With dead ends: 1370 [2025-03-16 21:38:14,122 INFO L226 Difference]: Without dead ends: 550 [2025-03-16 21:38:14,123 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 8 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 6 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=22, Invalid=34, Unknown=0, NotChecked=0, Total=56 [2025-03-16 21:38:14,124 INFO L435 NwaCegarLoop]: 716 mSDtfsCounter, 1618 mSDsluCounter, 1248 mSDsCounter, 0 mSdLazyCounter, 685 mSolverCounterSat, 37 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.4s Time, 0 mProtectedPredicate, 0 mProtectedAction, 1618 SdHoareTripleChecker+Valid, 1964 SdHoareTripleChecker+Invalid, 722 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 37 IncrementalHoareTripleChecker+Valid, 685 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.5s IncrementalHoareTripleChecker+Time [2025-03-16 21:38:14,124 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [1618 Valid, 1964 Invalid, 722 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [37 Valid, 685 Invalid, 0 Unknown, 0 Unchecked, 0.5s Time] [2025-03-16 21:38:14,125 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 550 states. [2025-03-16 21:38:14,131 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 550 to 550. [2025-03-16 21:38:14,132 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 550 states, 545 states have (on average 1.4880733944954128) internal successors, (811), 545 states have internal predecessors, (811), 3 states have call successors, (3), 1 states have call predecessors, (3), 1 states have return successors, (3), 3 states have call predecessors, (3), 3 states have call successors, (3) [2025-03-16 21:38:14,133 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 550 states to 550 states and 817 transitions. [2025-03-16 21:38:14,133 INFO L78 Accepts]: Start accepts. Automaton has 550 states and 817 transitions. Word has length 149 [2025-03-16 21:38:14,134 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-16 21:38:14,134 INFO L471 AbstractCegarLoop]: Abstraction has 550 states and 817 transitions. [2025-03-16 21:38:14,134 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 27.4) internal successors, (137), 5 states have internal predecessors, (137), 1 states have call successors, (3), 1 states have call predecessors, (3), 1 states have return successors, (3), 1 states have call predecessors, (3), 1 states have call successors, (3) [2025-03-16 21:38:14,134 INFO L276 IsEmpty]: Start isEmpty. Operand 550 states and 817 transitions. [2025-03-16 21:38:14,135 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 151 [2025-03-16 21:38:14,135 INFO L210 NwaCegarLoop]: Found error trace [2025-03-16 21:38:14,135 INFO L218 NwaCegarLoop]: trace histogram [3, 3, 3, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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-03-16 21:38:14,135 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable2 [2025-03-16 21:38:14,135 INFO L396 AbstractCegarLoop]: === Iteration 4 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-03-16 21:38:14,136 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-16 21:38:14,136 INFO L85 PathProgramCache]: Analyzing trace with hash 1457131840, now seen corresponding path program 1 times [2025-03-16 21:38:14,136 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-16 21:38:14,136 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [825708389] [2025-03-16 21:38:14,136 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-16 21:38:14,136 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-16 21:38:14,171 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 150 statements into 1 equivalence classes. [2025-03-16 21:38:14,225 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 150 of 150 statements. [2025-03-16 21:38:14,225 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-16 21:38:14,225 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-16 21:38:14,488 INFO L134 CoverageAnalysis]: Checked inductivity of 12 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 12 trivial. 0 not checked. [2025-03-16 21:38:14,489 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-16 21:38:14,489 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [825708389] [2025-03-16 21:38:14,489 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [825708389] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-16 21:38:14,489 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-16 21:38:14,489 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2025-03-16 21:38:14,489 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [731883484] [2025-03-16 21:38:14,489 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-16 21:38:14,490 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2025-03-16 21:38:14,490 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-16 21:38:14,491 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2025-03-16 21:38:14,491 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2025-03-16 21:38:14,491 INFO L87 Difference]: Start difference. First operand 550 states and 817 transitions. Second operand has 4 states, 4 states have (on average 34.5) internal successors, (138), 4 states have internal predecessors, (138), 1 states have call successors, (3), 1 states have call predecessors, (3), 1 states have return successors, (3), 1 states have call predecessors, (3), 1 states have call successors, (3) [2025-03-16 21:38:14,725 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-16 21:38:14,725 INFO L93 Difference]: Finished difference Result 1001 states and 1486 transitions. [2025-03-16 21:38:14,725 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2025-03-16 21:38:14,725 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 4 states have (on average 34.5) internal successors, (138), 4 states have internal predecessors, (138), 1 states have call successors, (3), 1 states have call predecessors, (3), 1 states have return successors, (3), 1 states have call predecessors, (3), 1 states have call successors, (3) Word has length 150 [2025-03-16 21:38:14,727 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-16 21:38:14,728 INFO L225 Difference]: With dead ends: 1001 [2025-03-16 21:38:14,728 INFO L226 Difference]: Without dead ends: 552 [2025-03-16 21:38:14,729 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-03-16 21:38:14,730 INFO L435 NwaCegarLoop]: 680 mSDtfsCounter, 0 mSDsluCounter, 1352 mSDsCounter, 0 mSdLazyCounter, 412 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 0 SdHoareTripleChecker+Valid, 2032 SdHoareTripleChecker+Invalid, 412 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 412 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.2s IncrementalHoareTripleChecker+Time [2025-03-16 21:38:14,730 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [0 Valid, 2032 Invalid, 412 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 412 Invalid, 0 Unknown, 0 Unchecked, 0.2s Time] [2025-03-16 21:38:14,731 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 552 states. [2025-03-16 21:38:14,741 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 552 to 552. [2025-03-16 21:38:14,742 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 552 states, 547 states have (on average 1.4862888482632541) internal successors, (813), 547 states have internal predecessors, (813), 3 states have call successors, (3), 1 states have call predecessors, (3), 1 states have return successors, (3), 3 states have call predecessors, (3), 3 states have call successors, (3) [2025-03-16 21:38:14,744 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 552 states to 552 states and 819 transitions. [2025-03-16 21:38:14,744 INFO L78 Accepts]: Start accepts. Automaton has 552 states and 819 transitions. Word has length 150 [2025-03-16 21:38:14,745 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-16 21:38:14,745 INFO L471 AbstractCegarLoop]: Abstraction has 552 states and 819 transitions. [2025-03-16 21:38:14,745 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 34.5) internal successors, (138), 4 states have internal predecessors, (138), 1 states have call successors, (3), 1 states have call predecessors, (3), 1 states have return successors, (3), 1 states have call predecessors, (3), 1 states have call successors, (3) [2025-03-16 21:38:14,745 INFO L276 IsEmpty]: Start isEmpty. Operand 552 states and 819 transitions. [2025-03-16 21:38:14,746 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 152 [2025-03-16 21:38:14,746 INFO L210 NwaCegarLoop]: Found error trace [2025-03-16 21:38:14,746 INFO L218 NwaCegarLoop]: trace histogram [3, 3, 3, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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-03-16 21:38:14,747 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable3 [2025-03-16 21:38:14,747 INFO L396 AbstractCegarLoop]: === Iteration 5 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-03-16 21:38:14,747 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-16 21:38:14,748 INFO L85 PathProgramCache]: Analyzing trace with hash -142043508, now seen corresponding path program 1 times [2025-03-16 21:38:14,748 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-16 21:38:14,748 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [711677913] [2025-03-16 21:38:14,748 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-16 21:38:14,748 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-16 21:38:14,789 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 151 statements into 1 equivalence classes. [2025-03-16 21:38:14,846 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 151 of 151 statements. [2025-03-16 21:38:14,846 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-16 21:38:14,846 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-16 21:38:15,233 INFO L134 CoverageAnalysis]: Checked inductivity of 12 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 12 trivial. 0 not checked. [2025-03-16 21:38:15,233 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-16 21:38:15,233 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [711677913] [2025-03-16 21:38:15,234 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [711677913] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-16 21:38:15,234 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-16 21:38:15,234 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2025-03-16 21:38:15,234 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2124644418] [2025-03-16 21:38:15,234 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-16 21:38:15,235 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2025-03-16 21:38:15,235 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-16 21:38:15,235 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2025-03-16 21:38:15,235 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2025-03-16 21:38:15,235 INFO L87 Difference]: Start difference. First operand 552 states and 819 transitions. Second operand has 4 states, 4 states have (on average 34.75) internal successors, (139), 4 states have internal predecessors, (139), 1 states have call successors, (3), 1 states have call predecessors, (3), 1 states have return successors, (3), 1 states have call predecessors, (3), 1 states have call successors, (3) [2025-03-16 21:38:15,509 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-16 21:38:15,509 INFO L93 Difference]: Finished difference Result 1003 states and 1487 transitions. [2025-03-16 21:38:15,509 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2025-03-16 21:38:15,510 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 4 states have (on average 34.75) internal successors, (139), 4 states have internal predecessors, (139), 1 states have call successors, (3), 1 states have call predecessors, (3), 1 states have return successors, (3), 1 states have call predecessors, (3), 1 states have call successors, (3) Word has length 151 [2025-03-16 21:38:15,510 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-16 21:38:15,511 INFO L225 Difference]: With dead ends: 1003 [2025-03-16 21:38:15,512 INFO L226 Difference]: Without dead ends: 552 [2025-03-16 21:38:15,512 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 7 GetRequests, 4 SyntacticMatches, 0 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=9, Invalid=11, Unknown=0, NotChecked=0, Total=20 [2025-03-16 21:38:15,514 INFO L435 NwaCegarLoop]: 616 mSDtfsCounter, 691 mSDsluCounter, 617 mSDsCounter, 0 mSdLazyCounter, 396 mSolverCounterSat, 1 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 691 SdHoareTripleChecker+Valid, 1233 SdHoareTripleChecker+Invalid, 397 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 1 IncrementalHoareTripleChecker+Valid, 396 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.2s IncrementalHoareTripleChecker+Time [2025-03-16 21:38:15,514 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [691 Valid, 1233 Invalid, 397 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [1 Valid, 396 Invalid, 0 Unknown, 0 Unchecked, 0.2s Time] [2025-03-16 21:38:15,515 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 552 states. [2025-03-16 21:38:15,522 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 552 to 552. [2025-03-16 21:38:15,525 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 552 states, 547 states have (on average 1.482632541133455) internal successors, (811), 547 states have internal predecessors, (811), 3 states have call successors, (3), 1 states have call predecessors, (3), 1 states have return successors, (3), 3 states have call predecessors, (3), 3 states have call successors, (3) [2025-03-16 21:38:15,527 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 552 states to 552 states and 817 transitions. [2025-03-16 21:38:15,527 INFO L78 Accepts]: Start accepts. Automaton has 552 states and 817 transitions. Word has length 151 [2025-03-16 21:38:15,527 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-16 21:38:15,527 INFO L471 AbstractCegarLoop]: Abstraction has 552 states and 817 transitions. [2025-03-16 21:38:15,527 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 34.75) internal successors, (139), 4 states have internal predecessors, (139), 1 states have call successors, (3), 1 states have call predecessors, (3), 1 states have return successors, (3), 1 states have call predecessors, (3), 1 states have call successors, (3) [2025-03-16 21:38:15,528 INFO L276 IsEmpty]: Start isEmpty. Operand 552 states and 817 transitions. [2025-03-16 21:38:15,528 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 154 [2025-03-16 21:38:15,528 INFO L210 NwaCegarLoop]: Found error trace [2025-03-16 21:38:15,529 INFO L218 NwaCegarLoop]: trace histogram [3, 3, 3, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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-03-16 21:38:15,529 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable4 [2025-03-16 21:38:15,529 INFO L396 AbstractCegarLoop]: === Iteration 6 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-03-16 21:38:15,529 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-16 21:38:15,529 INFO L85 PathProgramCache]: Analyzing trace with hash -775926310, now seen corresponding path program 1 times [2025-03-16 21:38:15,529 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-16 21:38:15,529 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1236340956] [2025-03-16 21:38:15,530 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-16 21:38:15,530 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-16 21:38:15,563 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 153 statements into 1 equivalence classes. [2025-03-16 21:38:15,622 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 153 of 153 statements. [2025-03-16 21:38:15,623 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-16 21:38:15,623 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-16 21:38:15,815 INFO L134 CoverageAnalysis]: Checked inductivity of 12 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 12 trivial. 0 not checked. [2025-03-16 21:38:15,815 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-16 21:38:15,816 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1236340956] [2025-03-16 21:38:15,816 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1236340956] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-16 21:38:15,816 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-16 21:38:15,816 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2025-03-16 21:38:15,816 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [688090610] [2025-03-16 21:38:15,816 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-16 21:38:15,816 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2025-03-16 21:38:15,816 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-16 21:38:15,817 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2025-03-16 21:38:15,817 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2025-03-16 21:38:15,817 INFO L87 Difference]: Start difference. First operand 552 states and 817 transitions. Second operand has 5 states, 5 states have (on average 28.2) internal successors, (141), 5 states have internal predecessors, (141), 1 states have call successors, (3), 1 states have call predecessors, (3), 1 states have return successors, (3), 1 states have call predecessors, (3), 1 states have call successors, (3) [2025-03-16 21:38:16,109 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-16 21:38:16,109 INFO L93 Difference]: Finished difference Result 1011 states and 1494 transitions. [2025-03-16 21:38:16,109 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2025-03-16 21:38:16,110 INFO L78 Accepts]: Start accepts. Automaton has has 5 states, 5 states have (on average 28.2) internal successors, (141), 5 states have internal predecessors, (141), 1 states have call successors, (3), 1 states have call predecessors, (3), 1 states have return successors, (3), 1 states have call predecessors, (3), 1 states have call successors, (3) Word has length 153 [2025-03-16 21:38:16,110 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-16 21:38:16,112 INFO L225 Difference]: With dead ends: 1011 [2025-03-16 21:38:16,112 INFO L226 Difference]: Without dead ends: 552 [2025-03-16 21:38:16,112 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 7 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 5 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=15, Invalid=27, Unknown=0, NotChecked=0, Total=42 [2025-03-16 21:38:16,113 INFO L435 NwaCegarLoop]: 671 mSDtfsCounter, 706 mSDsluCounter, 1290 mSDsCounter, 0 mSdLazyCounter, 480 mSolverCounterSat, 3 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 706 SdHoareTripleChecker+Valid, 1961 SdHoareTripleChecker+Invalid, 483 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 3 IncrementalHoareTripleChecker+Valid, 480 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.3s IncrementalHoareTripleChecker+Time [2025-03-16 21:38:16,113 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [706 Valid, 1961 Invalid, 483 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [3 Valid, 480 Invalid, 0 Unknown, 0 Unchecked, 0.3s Time] [2025-03-16 21:38:16,114 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 552 states. [2025-03-16 21:38:16,120 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 552 to 552. [2025-03-16 21:38:16,121 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 552 states, 547 states have (on average 1.4808043875685557) internal successors, (810), 547 states have internal predecessors, (810), 3 states have call successors, (3), 1 states have call predecessors, (3), 1 states have return successors, (3), 3 states have call predecessors, (3), 3 states have call successors, (3) [2025-03-16 21:38:16,122 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 552 states to 552 states and 816 transitions. [2025-03-16 21:38:16,123 INFO L78 Accepts]: Start accepts. Automaton has 552 states and 816 transitions. Word has length 153 [2025-03-16 21:38:16,123 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-16 21:38:16,123 INFO L471 AbstractCegarLoop]: Abstraction has 552 states and 816 transitions. [2025-03-16 21:38:16,123 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 28.2) internal successors, (141), 5 states have internal predecessors, (141), 1 states have call successors, (3), 1 states have call predecessors, (3), 1 states have return successors, (3), 1 states have call predecessors, (3), 1 states have call successors, (3) [2025-03-16 21:38:16,123 INFO L276 IsEmpty]: Start isEmpty. Operand 552 states and 816 transitions. [2025-03-16 21:38:16,124 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 155 [2025-03-16 21:38:16,124 INFO L210 NwaCegarLoop]: Found error trace [2025-03-16 21:38:16,124 INFO L218 NwaCegarLoop]: trace histogram [3, 3, 3, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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-03-16 21:38:16,124 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable5 [2025-03-16 21:38:16,124 INFO L396 AbstractCegarLoop]: === Iteration 7 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-03-16 21:38:16,125 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-16 21:38:16,125 INFO L85 PathProgramCache]: Analyzing trace with hash 1472752064, now seen corresponding path program 1 times [2025-03-16 21:38:16,125 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-16 21:38:16,125 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [242175478] [2025-03-16 21:38:16,125 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-16 21:38:16,125 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-16 21:38:16,154 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 154 statements into 1 equivalence classes. [2025-03-16 21:38:16,185 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 154 of 154 statements. [2025-03-16 21:38:16,185 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-16 21:38:16,185 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-16 21:38:16,392 INFO L134 CoverageAnalysis]: Checked inductivity of 12 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 12 trivial. 0 not checked. [2025-03-16 21:38:16,393 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-16 21:38:16,393 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [242175478] [2025-03-16 21:38:16,393 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [242175478] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-16 21:38:16,393 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-16 21:38:16,393 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2025-03-16 21:38:16,393 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [755030161] [2025-03-16 21:38:16,393 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-16 21:38:16,393 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2025-03-16 21:38:16,394 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-16 21:38:16,394 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2025-03-16 21:38:16,394 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=8, Invalid=12, Unknown=0, NotChecked=0, Total=20 [2025-03-16 21:38:16,394 INFO L87 Difference]: Start difference. First operand 552 states and 816 transitions. Second operand has 5 states, 5 states have (on average 28.4) internal successors, (142), 5 states have internal predecessors, (142), 1 states have call successors, (3), 1 states have call predecessors, (3), 1 states have return successors, (3), 1 states have call predecessors, (3), 1 states have call successors, (3) [2025-03-16 21:38:16,673 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-16 21:38:16,673 INFO L93 Difference]: Finished difference Result 1003 states and 1481 transitions. [2025-03-16 21:38:16,673 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2025-03-16 21:38:16,674 INFO L78 Accepts]: Start accepts. Automaton has has 5 states, 5 states have (on average 28.4) internal successors, (142), 5 states have internal predecessors, (142), 1 states have call successors, (3), 1 states have call predecessors, (3), 1 states have return successors, (3), 1 states have call predecessors, (3), 1 states have call successors, (3) Word has length 154 [2025-03-16 21:38:16,674 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-16 21:38:16,676 INFO L225 Difference]: With dead ends: 1003 [2025-03-16 21:38:16,676 INFO L226 Difference]: Without dead ends: 552 [2025-03-16 21:38:16,676 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 6 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 4 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=13, Invalid=17, Unknown=0, NotChecked=0, Total=30 [2025-03-16 21:38:16,677 INFO L435 NwaCegarLoop]: 616 mSDtfsCounter, 801 mSDsluCounter, 623 mSDsCounter, 0 mSdLazyCounter, 392 mSolverCounterSat, 1 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 804 SdHoareTripleChecker+Valid, 1239 SdHoareTripleChecker+Invalid, 393 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 1 IncrementalHoareTripleChecker+Valid, 392 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.2s IncrementalHoareTripleChecker+Time [2025-03-16 21:38:16,677 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [804 Valid, 1239 Invalid, 393 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [1 Valid, 392 Invalid, 0 Unknown, 0 Unchecked, 0.2s Time] [2025-03-16 21:38:16,677 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 552 states. [2025-03-16 21:38:16,685 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 552 to 552. [2025-03-16 21:38:16,686 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 552 states, 547 states have (on average 1.4789762340036563) internal successors, (809), 547 states have internal predecessors, (809), 3 states have call successors, (3), 1 states have call predecessors, (3), 1 states have return successors, (3), 3 states have call predecessors, (3), 3 states have call successors, (3) [2025-03-16 21:38:16,688 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 552 states to 552 states and 815 transitions. [2025-03-16 21:38:16,689 INFO L78 Accepts]: Start accepts. Automaton has 552 states and 815 transitions. Word has length 154 [2025-03-16 21:38:16,689 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-16 21:38:16,689 INFO L471 AbstractCegarLoop]: Abstraction has 552 states and 815 transitions. [2025-03-16 21:38:16,689 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 28.4) internal successors, (142), 5 states have internal predecessors, (142), 1 states have call successors, (3), 1 states have call predecessors, (3), 1 states have return successors, (3), 1 states have call predecessors, (3), 1 states have call successors, (3) [2025-03-16 21:38:16,689 INFO L276 IsEmpty]: Start isEmpty. Operand 552 states and 815 transitions. [2025-03-16 21:38:16,691 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 156 [2025-03-16 21:38:16,692 INFO L210 NwaCegarLoop]: Found error trace [2025-03-16 21:38:16,692 INFO L218 NwaCegarLoop]: trace histogram [3, 3, 3, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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-03-16 21:38:16,693 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable6 [2025-03-16 21:38:16,693 INFO L396 AbstractCegarLoop]: === Iteration 8 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-03-16 21:38:16,693 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-16 21:38:16,693 INFO L85 PathProgramCache]: Analyzing trace with hash -262165259, now seen corresponding path program 1 times [2025-03-16 21:38:16,693 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-16 21:38:16,693 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1887805159] [2025-03-16 21:38:16,693 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-16 21:38:16,693 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-16 21:38:16,734 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 155 statements into 1 equivalence classes. [2025-03-16 21:38:16,766 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 155 of 155 statements. [2025-03-16 21:38:16,767 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-16 21:38:16,767 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-16 21:38:16,957 INFO L134 CoverageAnalysis]: Checked inductivity of 12 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 12 trivial. 0 not checked. [2025-03-16 21:38:16,957 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-16 21:38:16,957 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1887805159] [2025-03-16 21:38:16,958 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1887805159] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-16 21:38:16,958 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-16 21:38:16,958 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2025-03-16 21:38:16,958 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1841020383] [2025-03-16 21:38:16,958 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-16 21:38:16,958 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2025-03-16 21:38:16,958 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-16 21:38:16,959 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2025-03-16 21:38:16,959 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=8, Invalid=12, Unknown=0, NotChecked=0, Total=20 [2025-03-16 21:38:16,959 INFO L87 Difference]: Start difference. First operand 552 states and 815 transitions. Second operand has 5 states, 5 states have (on average 28.6) internal successors, (143), 5 states have internal predecessors, (143), 1 states have call successors, (3), 1 states have call predecessors, (3), 1 states have return successors, (3), 1 states have call predecessors, (3), 1 states have call successors, (3) [2025-03-16 21:38:17,231 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-16 21:38:17,231 INFO L93 Difference]: Finished difference Result 1003 states and 1479 transitions. [2025-03-16 21:38:17,231 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2025-03-16 21:38:17,231 INFO L78 Accepts]: Start accepts. Automaton has has 5 states, 5 states have (on average 28.6) internal successors, (143), 5 states have internal predecessors, (143), 1 states have call successors, (3), 1 states have call predecessors, (3), 1 states have return successors, (3), 1 states have call predecessors, (3), 1 states have call successors, (3) Word has length 155 [2025-03-16 21:38:17,232 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-16 21:38:17,234 INFO L225 Difference]: With dead ends: 1003 [2025-03-16 21:38:17,235 INFO L226 Difference]: Without dead ends: 552 [2025-03-16 21:38:17,236 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 6 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 4 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=13, Invalid=17, Unknown=0, NotChecked=0, Total=30 [2025-03-16 21:38:17,236 INFO L435 NwaCegarLoop]: 616 mSDtfsCounter, 797 mSDsluCounter, 623 mSDsCounter, 0 mSdLazyCounter, 390 mSolverCounterSat, 1 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 800 SdHoareTripleChecker+Valid, 1239 SdHoareTripleChecker+Invalid, 391 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 1 IncrementalHoareTripleChecker+Valid, 390 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.2s IncrementalHoareTripleChecker+Time [2025-03-16 21:38:17,237 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [800 Valid, 1239 Invalid, 391 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [1 Valid, 390 Invalid, 0 Unknown, 0 Unchecked, 0.2s Time] [2025-03-16 21:38:17,237 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 552 states. [2025-03-16 21:38:17,247 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 552 to 552. [2025-03-16 21:38:17,248 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 552 states, 547 states have (on average 1.477148080438757) internal successors, (808), 547 states have internal predecessors, (808), 3 states have call successors, (3), 1 states have call predecessors, (3), 1 states have return successors, (3), 3 states have call predecessors, (3), 3 states have call successors, (3) [2025-03-16 21:38:17,250 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 552 states to 552 states and 814 transitions. [2025-03-16 21:38:17,250 INFO L78 Accepts]: Start accepts. Automaton has 552 states and 814 transitions. Word has length 155 [2025-03-16 21:38:17,250 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-16 21:38:17,251 INFO L471 AbstractCegarLoop]: Abstraction has 552 states and 814 transitions. [2025-03-16 21:38:17,251 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 28.6) internal successors, (143), 5 states have internal predecessors, (143), 1 states have call successors, (3), 1 states have call predecessors, (3), 1 states have return successors, (3), 1 states have call predecessors, (3), 1 states have call successors, (3) [2025-03-16 21:38:17,251 INFO L276 IsEmpty]: Start isEmpty. Operand 552 states and 814 transitions. [2025-03-16 21:38:17,252 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 157 [2025-03-16 21:38:17,252 INFO L210 NwaCegarLoop]: Found error trace [2025-03-16 21:38:17,252 INFO L218 NwaCegarLoop]: trace histogram [3, 3, 3, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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-03-16 21:38:17,252 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable7 [2025-03-16 21:38:17,252 INFO L396 AbstractCegarLoop]: === Iteration 9 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-03-16 21:38:17,252 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-16 21:38:17,253 INFO L85 PathProgramCache]: Analyzing trace with hash -2096657029, now seen corresponding path program 1 times [2025-03-16 21:38:17,253 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-16 21:38:17,253 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [844365318] [2025-03-16 21:38:17,253 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-16 21:38:17,253 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-16 21:38:17,285 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 156 statements into 1 equivalence classes. [2025-03-16 21:38:17,319 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 156 of 156 statements. [2025-03-16 21:38:17,319 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-16 21:38:17,319 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-16 21:38:17,539 INFO L134 CoverageAnalysis]: Checked inductivity of 12 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 12 trivial. 0 not checked. [2025-03-16 21:38:17,539 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-16 21:38:17,539 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [844365318] [2025-03-16 21:38:17,539 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [844365318] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-16 21:38:17,539 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-16 21:38:17,539 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2025-03-16 21:38:17,540 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1718961617] [2025-03-16 21:38:17,540 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-16 21:38:17,540 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2025-03-16 21:38:17,540 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-16 21:38:17,540 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2025-03-16 21:38:17,540 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=8, Invalid=12, Unknown=0, NotChecked=0, Total=20 [2025-03-16 21:38:17,541 INFO L87 Difference]: Start difference. First operand 552 states and 814 transitions. Second operand has 5 states, 5 states have (on average 28.8) internal successors, (144), 5 states have internal predecessors, (144), 1 states have call successors, (3), 1 states have call predecessors, (3), 1 states have return successors, (3), 1 states have call predecessors, (3), 1 states have call successors, (3) [2025-03-16 21:38:17,813 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-16 21:38:17,813 INFO L93 Difference]: Finished difference Result 1003 states and 1477 transitions. [2025-03-16 21:38:17,813 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2025-03-16 21:38:17,814 INFO L78 Accepts]: Start accepts. Automaton has has 5 states, 5 states have (on average 28.8) internal successors, (144), 5 states have internal predecessors, (144), 1 states have call successors, (3), 1 states have call predecessors, (3), 1 states have return successors, (3), 1 states have call predecessors, (3), 1 states have call successors, (3) Word has length 156 [2025-03-16 21:38:17,814 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-16 21:38:17,816 INFO L225 Difference]: With dead ends: 1003 [2025-03-16 21:38:17,816 INFO L226 Difference]: Without dead ends: 552 [2025-03-16 21:38:17,817 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 6 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 4 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=13, Invalid=17, Unknown=0, NotChecked=0, Total=30 [2025-03-16 21:38:17,817 INFO L435 NwaCegarLoop]: 616 mSDtfsCounter, 1477 mSDsluCounter, 617 mSDsCounter, 0 mSdLazyCounter, 388 mSolverCounterSat, 1 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 1480 SdHoareTripleChecker+Valid, 1233 SdHoareTripleChecker+Invalid, 389 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 1 IncrementalHoareTripleChecker+Valid, 388 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.2s IncrementalHoareTripleChecker+Time [2025-03-16 21:38:17,817 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [1480 Valid, 1233 Invalid, 389 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [1 Valid, 388 Invalid, 0 Unknown, 0 Unchecked, 0.2s Time] [2025-03-16 21:38:17,818 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 552 states. [2025-03-16 21:38:17,824 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 552 to 552. [2025-03-16 21:38:17,825 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 552 states, 547 states have (on average 1.4753199268738575) internal successors, (807), 547 states have internal predecessors, (807), 3 states have call successors, (3), 1 states have call predecessors, (3), 1 states have return successors, (3), 3 states have call predecessors, (3), 3 states have call successors, (3) [2025-03-16 21:38:17,827 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 552 states to 552 states and 813 transitions. [2025-03-16 21:38:17,827 INFO L78 Accepts]: Start accepts. Automaton has 552 states and 813 transitions. Word has length 156 [2025-03-16 21:38:17,827 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-16 21:38:17,827 INFO L471 AbstractCegarLoop]: Abstraction has 552 states and 813 transitions. [2025-03-16 21:38:17,827 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 28.8) internal successors, (144), 5 states have internal predecessors, (144), 1 states have call successors, (3), 1 states have call predecessors, (3), 1 states have return successors, (3), 1 states have call predecessors, (3), 1 states have call successors, (3) [2025-03-16 21:38:17,827 INFO L276 IsEmpty]: Start isEmpty. Operand 552 states and 813 transitions. [2025-03-16 21:38:17,828 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 158 [2025-03-16 21:38:17,828 INFO L210 NwaCegarLoop]: Found error trace [2025-03-16 21:38:17,829 INFO L218 NwaCegarLoop]: trace histogram [3, 3, 3, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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-03-16 21:38:17,829 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable8 [2025-03-16 21:38:17,829 INFO L396 AbstractCegarLoop]: === Iteration 10 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-03-16 21:38:17,829 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-16 21:38:17,829 INFO L85 PathProgramCache]: Analyzing trace with hash -1696266864, now seen corresponding path program 1 times [2025-03-16 21:38:17,829 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-16 21:38:17,830 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1263864128] [2025-03-16 21:38:17,830 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-16 21:38:17,830 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-16 21:38:17,862 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 157 statements into 1 equivalence classes. [2025-03-16 21:38:17,896 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 157 of 157 statements. [2025-03-16 21:38:17,896 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-16 21:38:17,896 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-16 21:38:18,079 INFO L134 CoverageAnalysis]: Checked inductivity of 12 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 12 trivial. 0 not checked. [2025-03-16 21:38:18,080 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-16 21:38:18,080 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1263864128] [2025-03-16 21:38:18,080 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1263864128] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-16 21:38:18,080 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-16 21:38:18,080 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2025-03-16 21:38:18,080 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1298306344] [2025-03-16 21:38:18,080 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-16 21:38:18,081 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2025-03-16 21:38:18,081 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-16 21:38:18,082 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2025-03-16 21:38:18,082 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=8, Invalid=12, Unknown=0, NotChecked=0, Total=20 [2025-03-16 21:38:18,082 INFO L87 Difference]: Start difference. First operand 552 states and 813 transitions. Second operand has 5 states, 5 states have (on average 29.0) internal successors, (145), 5 states have internal predecessors, (145), 1 states have call successors, (3), 1 states have call predecessors, (3), 1 states have return successors, (3), 1 states have call predecessors, (3), 1 states have call successors, (3) [2025-03-16 21:38:18,346 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-16 21:38:18,346 INFO L93 Difference]: Finished difference Result 1003 states and 1475 transitions. [2025-03-16 21:38:18,346 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2025-03-16 21:38:18,347 INFO L78 Accepts]: Start accepts. Automaton has has 5 states, 5 states have (on average 29.0) internal successors, (145), 5 states have internal predecessors, (145), 1 states have call successors, (3), 1 states have call predecessors, (3), 1 states have return successors, (3), 1 states have call predecessors, (3), 1 states have call successors, (3) Word has length 157 [2025-03-16 21:38:18,347 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-16 21:38:18,348 INFO L225 Difference]: With dead ends: 1003 [2025-03-16 21:38:18,348 INFO L226 Difference]: Without dead ends: 552 [2025-03-16 21:38:18,349 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 6 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 4 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=13, Invalid=17, Unknown=0, NotChecked=0, Total=30 [2025-03-16 21:38:18,349 INFO L435 NwaCegarLoop]: 616 mSDtfsCounter, 1461 mSDsluCounter, 617 mSDsCounter, 0 mSdLazyCounter, 386 mSolverCounterSat, 1 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 1464 SdHoareTripleChecker+Valid, 1233 SdHoareTripleChecker+Invalid, 387 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 1 IncrementalHoareTripleChecker+Valid, 386 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.2s IncrementalHoareTripleChecker+Time [2025-03-16 21:38:18,351 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [1464 Valid, 1233 Invalid, 387 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [1 Valid, 386 Invalid, 0 Unknown, 0 Unchecked, 0.2s Time] [2025-03-16 21:38:18,352 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 552 states. [2025-03-16 21:38:18,357 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 552 to 552. [2025-03-16 21:38:18,358 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 552 states, 547 states have (on average 1.4734917733089579) internal successors, (806), 547 states have internal predecessors, (806), 3 states have call successors, (3), 1 states have call predecessors, (3), 1 states have return successors, (3), 3 states have call predecessors, (3), 3 states have call successors, (3) [2025-03-16 21:38:18,360 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 552 states to 552 states and 812 transitions. [2025-03-16 21:38:18,360 INFO L78 Accepts]: Start accepts. Automaton has 552 states and 812 transitions. Word has length 157 [2025-03-16 21:38:18,361 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-16 21:38:18,361 INFO L471 AbstractCegarLoop]: Abstraction has 552 states and 812 transitions. [2025-03-16 21:38:18,361 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 29.0) internal successors, (145), 5 states have internal predecessors, (145), 1 states have call successors, (3), 1 states have call predecessors, (3), 1 states have return successors, (3), 1 states have call predecessors, (3), 1 states have call successors, (3) [2025-03-16 21:38:18,361 INFO L276 IsEmpty]: Start isEmpty. Operand 552 states and 812 transitions. [2025-03-16 21:38:18,362 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 159 [2025-03-16 21:38:18,362 INFO L210 NwaCegarLoop]: Found error trace [2025-03-16 21:38:18,362 INFO L218 NwaCegarLoop]: trace histogram [3, 3, 3, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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-03-16 21:38:18,363 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable9 [2025-03-16 21:38:18,363 INFO L396 AbstractCegarLoop]: === Iteration 11 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-03-16 21:38:18,363 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-16 21:38:18,363 INFO L85 PathProgramCache]: Analyzing trace with hash -1045437835, now seen corresponding path program 1 times [2025-03-16 21:38:18,363 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-16 21:38:18,363 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [38851463] [2025-03-16 21:38:18,364 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-16 21:38:18,364 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-16 21:38:18,405 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 158 statements into 1 equivalence classes. [2025-03-16 21:38:18,443 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 158 of 158 statements. [2025-03-16 21:38:18,443 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-16 21:38:18,443 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-16 21:38:18,669 INFO L134 CoverageAnalysis]: Checked inductivity of 12 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 12 trivial. 0 not checked. [2025-03-16 21:38:18,669 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-16 21:38:18,669 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [38851463] [2025-03-16 21:38:18,669 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [38851463] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-16 21:38:18,669 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-16 21:38:18,669 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2025-03-16 21:38:18,670 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1658481810] [2025-03-16 21:38:18,670 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-16 21:38:18,671 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2025-03-16 21:38:18,671 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-16 21:38:18,671 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2025-03-16 21:38:18,671 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=8, Invalid=12, Unknown=0, NotChecked=0, Total=20 [2025-03-16 21:38:18,671 INFO L87 Difference]: Start difference. First operand 552 states and 812 transitions. Second operand has 5 states, 5 states have (on average 29.2) internal successors, (146), 5 states have internal predecessors, (146), 1 states have call successors, (3), 1 states have call predecessors, (3), 1 states have return successors, (3), 1 states have call predecessors, (3), 1 states have call successors, (3) [2025-03-16 21:38:18,943 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-16 21:38:18,943 INFO L93 Difference]: Finished difference Result 1003 states and 1473 transitions. [2025-03-16 21:38:18,943 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2025-03-16 21:38:18,943 INFO L78 Accepts]: Start accepts. Automaton has has 5 states, 5 states have (on average 29.2) internal successors, (146), 5 states have internal predecessors, (146), 1 states have call successors, (3), 1 states have call predecessors, (3), 1 states have return successors, (3), 1 states have call predecessors, (3), 1 states have call successors, (3) Word has length 158 [2025-03-16 21:38:18,944 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-16 21:38:18,946 INFO L225 Difference]: With dead ends: 1003 [2025-03-16 21:38:18,946 INFO L226 Difference]: Without dead ends: 552 [2025-03-16 21:38:18,946 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 6 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 4 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=13, Invalid=17, Unknown=0, NotChecked=0, Total=30 [2025-03-16 21:38:18,947 INFO L435 NwaCegarLoop]: 616 mSDtfsCounter, 1453 mSDsluCounter, 617 mSDsCounter, 0 mSdLazyCounter, 384 mSolverCounterSat, 1 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 1456 SdHoareTripleChecker+Valid, 1233 SdHoareTripleChecker+Invalid, 385 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 1 IncrementalHoareTripleChecker+Valid, 384 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.2s IncrementalHoareTripleChecker+Time [2025-03-16 21:38:18,948 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [1456 Valid, 1233 Invalid, 385 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [1 Valid, 384 Invalid, 0 Unknown, 0 Unchecked, 0.2s Time] [2025-03-16 21:38:18,949 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 552 states. [2025-03-16 21:38:18,955 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 552 to 552. [2025-03-16 21:38:18,956 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 552 states, 547 states have (on average 1.4716636197440585) internal successors, (805), 547 states have internal predecessors, (805), 3 states have call successors, (3), 1 states have call predecessors, (3), 1 states have return successors, (3), 3 states have call predecessors, (3), 3 states have call successors, (3) [2025-03-16 21:38:18,957 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 552 states to 552 states and 811 transitions. [2025-03-16 21:38:18,958 INFO L78 Accepts]: Start accepts. Automaton has 552 states and 811 transitions. Word has length 158 [2025-03-16 21:38:18,958 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-16 21:38:18,958 INFO L471 AbstractCegarLoop]: Abstraction has 552 states and 811 transitions. [2025-03-16 21:38:18,958 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 29.2) internal successors, (146), 5 states have internal predecessors, (146), 1 states have call successors, (3), 1 states have call predecessors, (3), 1 states have return successors, (3), 1 states have call predecessors, (3), 1 states have call successors, (3) [2025-03-16 21:38:18,958 INFO L276 IsEmpty]: Start isEmpty. Operand 552 states and 811 transitions. [2025-03-16 21:38:18,959 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 160 [2025-03-16 21:38:18,959 INFO L210 NwaCegarLoop]: Found error trace [2025-03-16 21:38:18,959 INFO L218 NwaCegarLoop]: trace histogram [3, 3, 3, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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-03-16 21:38:18,959 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable10 [2025-03-16 21:38:18,960 INFO L396 AbstractCegarLoop]: === Iteration 12 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-03-16 21:38:18,960 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-16 21:38:18,961 INFO L85 PathProgramCache]: Analyzing trace with hash 2008085771, now seen corresponding path program 1 times [2025-03-16 21:38:18,961 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-16 21:38:18,961 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1668459010] [2025-03-16 21:38:18,961 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-16 21:38:18,961 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-16 21:38:18,995 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 159 statements into 1 equivalence classes. [2025-03-16 21:38:19,021 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 159 of 159 statements. [2025-03-16 21:38:19,022 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-16 21:38:19,022 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-16 21:38:19,186 INFO L134 CoverageAnalysis]: Checked inductivity of 12 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 12 trivial. 0 not checked. [2025-03-16 21:38:19,186 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-16 21:38:19,186 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1668459010] [2025-03-16 21:38:19,186 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1668459010] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-16 21:38:19,186 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-16 21:38:19,186 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2025-03-16 21:38:19,186 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1761050108] [2025-03-16 21:38:19,186 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-16 21:38:19,187 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2025-03-16 21:38:19,187 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-16 21:38:19,187 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2025-03-16 21:38:19,187 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=8, Invalid=12, Unknown=0, NotChecked=0, Total=20 [2025-03-16 21:38:19,187 INFO L87 Difference]: Start difference. First operand 552 states and 811 transitions. Second operand has 5 states, 5 states have (on average 29.4) internal successors, (147), 5 states have internal predecessors, (147), 1 states have call successors, (3), 1 states have call predecessors, (3), 1 states have return successors, (3), 1 states have call predecessors, (3), 1 states have call successors, (3) [2025-03-16 21:38:19,452 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-16 21:38:19,452 INFO L93 Difference]: Finished difference Result 1003 states and 1471 transitions. [2025-03-16 21:38:19,453 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2025-03-16 21:38:19,453 INFO L78 Accepts]: Start accepts. Automaton has has 5 states, 5 states have (on average 29.4) internal successors, (147), 5 states have internal predecessors, (147), 1 states have call successors, (3), 1 states have call predecessors, (3), 1 states have return successors, (3), 1 states have call predecessors, (3), 1 states have call successors, (3) Word has length 159 [2025-03-16 21:38:19,453 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-16 21:38:19,455 INFO L225 Difference]: With dead ends: 1003 [2025-03-16 21:38:19,455 INFO L226 Difference]: Without dead ends: 552 [2025-03-16 21:38:19,456 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 6 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 4 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=13, Invalid=17, Unknown=0, NotChecked=0, Total=30 [2025-03-16 21:38:19,457 INFO L435 NwaCegarLoop]: 616 mSDtfsCounter, 777 mSDsluCounter, 623 mSDsCounter, 0 mSdLazyCounter, 382 mSolverCounterSat, 1 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 780 SdHoareTripleChecker+Valid, 1239 SdHoareTripleChecker+Invalid, 383 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 1 IncrementalHoareTripleChecker+Valid, 382 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.2s IncrementalHoareTripleChecker+Time [2025-03-16 21:38:19,457 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [780 Valid, 1239 Invalid, 383 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [1 Valid, 382 Invalid, 0 Unknown, 0 Unchecked, 0.2s Time] [2025-03-16 21:38:19,458 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 552 states. [2025-03-16 21:38:19,482 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 552 to 552. [2025-03-16 21:38:19,483 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 552 states, 547 states have (on average 1.469835466179159) internal successors, (804), 547 states have internal predecessors, (804), 3 states have call successors, (3), 1 states have call predecessors, (3), 1 states have return successors, (3), 3 states have call predecessors, (3), 3 states have call successors, (3) [2025-03-16 21:38:19,484 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 552 states to 552 states and 810 transitions. [2025-03-16 21:38:19,485 INFO L78 Accepts]: Start accepts. Automaton has 552 states and 810 transitions. Word has length 159 [2025-03-16 21:38:19,485 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-16 21:38:19,485 INFO L471 AbstractCegarLoop]: Abstraction has 552 states and 810 transitions. [2025-03-16 21:38:19,485 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 29.4) internal successors, (147), 5 states have internal predecessors, (147), 1 states have call successors, (3), 1 states have call predecessors, (3), 1 states have return successors, (3), 1 states have call predecessors, (3), 1 states have call successors, (3) [2025-03-16 21:38:19,485 INFO L276 IsEmpty]: Start isEmpty. Operand 552 states and 810 transitions. [2025-03-16 21:38:19,487 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 161 [2025-03-16 21:38:19,487 INFO L210 NwaCegarLoop]: Found error trace [2025-03-16 21:38:19,487 INFO L218 NwaCegarLoop]: trace histogram [3, 3, 3, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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-03-16 21:38:19,487 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable11 [2025-03-16 21:38:19,487 INFO L396 AbstractCegarLoop]: === Iteration 13 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-03-16 21:38:19,488 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-16 21:38:19,488 INFO L85 PathProgramCache]: Analyzing trace with hash -1285586224, now seen corresponding path program 1 times [2025-03-16 21:38:19,488 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-16 21:38:19,488 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [131608988] [2025-03-16 21:38:19,488 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-16 21:38:19,488 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-16 21:38:19,523 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 160 statements into 1 equivalence classes. [2025-03-16 21:38:19,558 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 160 of 160 statements. [2025-03-16 21:38:19,558 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-16 21:38:19,558 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-16 21:38:19,785 INFO L134 CoverageAnalysis]: Checked inductivity of 12 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 12 trivial. 0 not checked. [2025-03-16 21:38:19,786 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-16 21:38:19,786 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [131608988] [2025-03-16 21:38:19,786 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [131608988] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-16 21:38:19,786 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-16 21:38:19,786 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2025-03-16 21:38:19,786 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [236146163] [2025-03-16 21:38:19,786 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-16 21:38:19,787 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2025-03-16 21:38:19,787 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-16 21:38:19,787 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2025-03-16 21:38:19,787 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2025-03-16 21:38:19,788 INFO L87 Difference]: Start difference. First operand 552 states and 810 transitions. Second operand has 4 states, 4 states have (on average 37.0) internal successors, (148), 4 states have internal predecessors, (148), 1 states have call successors, (3), 1 states have call predecessors, (3), 1 states have return successors, (3), 1 states have call predecessors, (3), 1 states have call successors, (3) [2025-03-16 21:38:20,026 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-16 21:38:20,026 INFO L93 Difference]: Finished difference Result 1003 states and 1469 transitions. [2025-03-16 21:38:20,027 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2025-03-16 21:38:20,027 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 4 states have (on average 37.0) internal successors, (148), 4 states have internal predecessors, (148), 1 states have call successors, (3), 1 states have call predecessors, (3), 1 states have return successors, (3), 1 states have call predecessors, (3), 1 states have call successors, (3) Word has length 160 [2025-03-16 21:38:20,027 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-16 21:38:20,029 INFO L225 Difference]: With dead ends: 1003 [2025-03-16 21:38:20,029 INFO L226 Difference]: Without dead ends: 552 [2025-03-16 21:38:20,029 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 6 GetRequests, 3 SyntacticMatches, 0 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=9, Invalid=11, Unknown=0, NotChecked=0, Total=20 [2025-03-16 21:38:20,030 INFO L435 NwaCegarLoop]: 639 mSDtfsCounter, 699 mSDsluCounter, 640 mSDsCounter, 0 mSdLazyCounter, 334 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 699 SdHoareTripleChecker+Valid, 1279 SdHoareTripleChecker+Invalid, 334 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 334 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.2s IncrementalHoareTripleChecker+Time [2025-03-16 21:38:20,030 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [699 Valid, 1279 Invalid, 334 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 334 Invalid, 0 Unknown, 0 Unchecked, 0.2s Time] [2025-03-16 21:38:20,031 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 552 states. [2025-03-16 21:38:20,038 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 552 to 552. [2025-03-16 21:38:20,039 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 552 states, 547 states have (on average 1.4680073126142597) internal successors, (803), 547 states have internal predecessors, (803), 3 states have call successors, (3), 1 states have call predecessors, (3), 1 states have return successors, (3), 3 states have call predecessors, (3), 3 states have call successors, (3) [2025-03-16 21:38:20,041 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 552 states to 552 states and 809 transitions. [2025-03-16 21:38:20,041 INFO L78 Accepts]: Start accepts. Automaton has 552 states and 809 transitions. Word has length 160 [2025-03-16 21:38:20,041 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-16 21:38:20,042 INFO L471 AbstractCegarLoop]: Abstraction has 552 states and 809 transitions. [2025-03-16 21:38:20,042 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 37.0) internal successors, (148), 4 states have internal predecessors, (148), 1 states have call successors, (3), 1 states have call predecessors, (3), 1 states have return successors, (3), 1 states have call predecessors, (3), 1 states have call successors, (3) [2025-03-16 21:38:20,042 INFO L276 IsEmpty]: Start isEmpty. Operand 552 states and 809 transitions. [2025-03-16 21:38:20,043 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 162 [2025-03-16 21:38:20,043 INFO L210 NwaCegarLoop]: Found error trace [2025-03-16 21:38:20,043 INFO L218 NwaCegarLoop]: trace histogram [3, 3, 3, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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-03-16 21:38:20,043 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable12 [2025-03-16 21:38:20,043 INFO L396 AbstractCegarLoop]: === Iteration 14 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-03-16 21:38:20,044 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-16 21:38:20,044 INFO L85 PathProgramCache]: Analyzing trace with hash 237197206, now seen corresponding path program 1 times [2025-03-16 21:38:20,044 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-16 21:38:20,045 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1484715214] [2025-03-16 21:38:20,045 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-16 21:38:20,045 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-16 21:38:20,078 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 161 statements into 1 equivalence classes. [2025-03-16 21:38:20,109 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 161 of 161 statements. [2025-03-16 21:38:20,109 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-16 21:38:20,109 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-16 21:38:20,289 INFO L134 CoverageAnalysis]: Checked inductivity of 12 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 12 trivial. 0 not checked. [2025-03-16 21:38:20,289 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-16 21:38:20,289 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1484715214] [2025-03-16 21:38:20,289 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1484715214] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-16 21:38:20,289 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-16 21:38:20,289 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2025-03-16 21:38:20,289 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [113280060] [2025-03-16 21:38:20,290 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-16 21:38:20,290 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2025-03-16 21:38:20,290 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-16 21:38:20,290 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2025-03-16 21:38:20,290 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=8, Invalid=12, Unknown=0, NotChecked=0, Total=20 [2025-03-16 21:38:20,291 INFO L87 Difference]: Start difference. First operand 552 states and 809 transitions. Second operand has 5 states, 5 states have (on average 29.8) internal successors, (149), 5 states have internal predecessors, (149), 1 states have call successors, (3), 1 states have call predecessors, (3), 1 states have return successors, (3), 1 states have call predecessors, (3), 1 states have call successors, (3) [2025-03-16 21:38:20,532 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-16 21:38:20,532 INFO L93 Difference]: Finished difference Result 1003 states and 1467 transitions. [2025-03-16 21:38:20,532 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2025-03-16 21:38:20,533 INFO L78 Accepts]: Start accepts. Automaton has has 5 states, 5 states have (on average 29.8) internal successors, (149), 5 states have internal predecessors, (149), 1 states have call successors, (3), 1 states have call predecessors, (3), 1 states have return successors, (3), 1 states have call predecessors, (3), 1 states have call successors, (3) Word has length 161 [2025-03-16 21:38:20,533 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-16 21:38:20,535 INFO L225 Difference]: With dead ends: 1003 [2025-03-16 21:38:20,535 INFO L226 Difference]: Without dead ends: 552 [2025-03-16 21:38:20,536 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 6 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 4 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=13, Invalid=17, Unknown=0, NotChecked=0, Total=30 [2025-03-16 21:38:20,536 INFO L435 NwaCegarLoop]: 639 mSDtfsCounter, 794 mSDsluCounter, 646 mSDsCounter, 0 mSdLazyCounter, 332 mSolverCounterSat, 1 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 797 SdHoareTripleChecker+Valid, 1285 SdHoareTripleChecker+Invalid, 333 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 1 IncrementalHoareTripleChecker+Valid, 332 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.2s IncrementalHoareTripleChecker+Time [2025-03-16 21:38:20,536 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [797 Valid, 1285 Invalid, 333 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [1 Valid, 332 Invalid, 0 Unknown, 0 Unchecked, 0.2s Time] [2025-03-16 21:38:20,537 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 552 states. [2025-03-16 21:38:20,546 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 552 to 552. [2025-03-16 21:38:20,547 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 552 states, 547 states have (on average 1.4661791590493602) internal successors, (802), 547 states have internal predecessors, (802), 3 states have call successors, (3), 1 states have call predecessors, (3), 1 states have return successors, (3), 3 states have call predecessors, (3), 3 states have call successors, (3) [2025-03-16 21:38:20,549 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 552 states to 552 states and 808 transitions. [2025-03-16 21:38:20,549 INFO L78 Accepts]: Start accepts. Automaton has 552 states and 808 transitions. Word has length 161 [2025-03-16 21:38:20,549 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-16 21:38:20,549 INFO L471 AbstractCegarLoop]: Abstraction has 552 states and 808 transitions. [2025-03-16 21:38:20,549 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 29.8) internal successors, (149), 5 states have internal predecessors, (149), 1 states have call successors, (3), 1 states have call predecessors, (3), 1 states have return successors, (3), 1 states have call predecessors, (3), 1 states have call successors, (3) [2025-03-16 21:38:20,550 INFO L276 IsEmpty]: Start isEmpty. Operand 552 states and 808 transitions. [2025-03-16 21:38:20,551 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 163 [2025-03-16 21:38:20,551 INFO L210 NwaCegarLoop]: Found error trace [2025-03-16 21:38:20,551 INFO L218 NwaCegarLoop]: trace histogram [3, 3, 3, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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-03-16 21:38:20,552 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable13 [2025-03-16 21:38:20,552 INFO L396 AbstractCegarLoop]: === Iteration 15 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-03-16 21:38:20,552 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-16 21:38:20,552 INFO L85 PathProgramCache]: Analyzing trace with hash 1503123413, now seen corresponding path program 1 times [2025-03-16 21:38:20,552 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-16 21:38:20,552 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1232629413] [2025-03-16 21:38:20,552 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-16 21:38:20,552 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-16 21:38:20,589 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 162 statements into 1 equivalence classes. [2025-03-16 21:38:20,628 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 162 of 162 statements. [2025-03-16 21:38:20,629 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-16 21:38:20,629 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-16 21:38:20,780 INFO L134 CoverageAnalysis]: Checked inductivity of 12 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 12 trivial. 0 not checked. [2025-03-16 21:38:20,780 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-16 21:38:20,780 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1232629413] [2025-03-16 21:38:20,780 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1232629413] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-16 21:38:20,780 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-16 21:38:20,781 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2025-03-16 21:38:20,781 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1306725981] [2025-03-16 21:38:20,781 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-16 21:38:20,782 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2025-03-16 21:38:20,782 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-16 21:38:20,782 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2025-03-16 21:38:20,782 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=8, Invalid=12, Unknown=0, NotChecked=0, Total=20 [2025-03-16 21:38:20,782 INFO L87 Difference]: Start difference. First operand 552 states and 808 transitions. Second operand has 5 states, 5 states have (on average 30.0) internal successors, (150), 5 states have internal predecessors, (150), 1 states have call successors, (3), 1 states have call predecessors, (3), 1 states have return successors, (3), 1 states have call predecessors, (3), 1 states have call successors, (3) [2025-03-16 21:38:21,031 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-16 21:38:21,031 INFO L93 Difference]: Finished difference Result 1003 states and 1465 transitions. [2025-03-16 21:38:21,031 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2025-03-16 21:38:21,032 INFO L78 Accepts]: Start accepts. Automaton has has 5 states, 5 states have (on average 30.0) internal successors, (150), 5 states have internal predecessors, (150), 1 states have call successors, (3), 1 states have call predecessors, (3), 1 states have return successors, (3), 1 states have call predecessors, (3), 1 states have call successors, (3) Word has length 162 [2025-03-16 21:38:21,032 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-16 21:38:21,033 INFO L225 Difference]: With dead ends: 1003 [2025-03-16 21:38:21,034 INFO L226 Difference]: Without dead ends: 552 [2025-03-16 21:38:21,034 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 6 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 4 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=13, Invalid=17, Unknown=0, NotChecked=0, Total=30 [2025-03-16 21:38:21,036 INFO L435 NwaCegarLoop]: 639 mSDtfsCounter, 1479 mSDsluCounter, 640 mSDsCounter, 0 mSdLazyCounter, 330 mSolverCounterSat, 1 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 1482 SdHoareTripleChecker+Valid, 1279 SdHoareTripleChecker+Invalid, 331 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 1 IncrementalHoareTripleChecker+Valid, 330 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.2s IncrementalHoareTripleChecker+Time [2025-03-16 21:38:21,036 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [1482 Valid, 1279 Invalid, 331 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [1 Valid, 330 Invalid, 0 Unknown, 0 Unchecked, 0.2s Time] [2025-03-16 21:38:21,037 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 552 states. [2025-03-16 21:38:21,043 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 552 to 552. [2025-03-16 21:38:21,043 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 552 states, 547 states have (on average 1.4643510054844606) internal successors, (801), 547 states have internal predecessors, (801), 3 states have call successors, (3), 1 states have call predecessors, (3), 1 states have return successors, (3), 3 states have call predecessors, (3), 3 states have call successors, (3) [2025-03-16 21:38:21,045 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 552 states to 552 states and 807 transitions. [2025-03-16 21:38:21,045 INFO L78 Accepts]: Start accepts. Automaton has 552 states and 807 transitions. Word has length 162 [2025-03-16 21:38:21,045 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-16 21:38:21,045 INFO L471 AbstractCegarLoop]: Abstraction has 552 states and 807 transitions. [2025-03-16 21:38:21,046 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 30.0) internal successors, (150), 5 states have internal predecessors, (150), 1 states have call successors, (3), 1 states have call predecessors, (3), 1 states have return successors, (3), 1 states have call predecessors, (3), 1 states have call successors, (3) [2025-03-16 21:38:21,046 INFO L276 IsEmpty]: Start isEmpty. Operand 552 states and 807 transitions. [2025-03-16 21:38:21,046 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 164 [2025-03-16 21:38:21,047 INFO L210 NwaCegarLoop]: Found error trace [2025-03-16 21:38:21,047 INFO L218 NwaCegarLoop]: trace histogram [3, 3, 3, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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-03-16 21:38:21,047 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable14 [2025-03-16 21:38:21,047 INFO L396 AbstractCegarLoop]: === Iteration 16 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-03-16 21:38:21,047 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-16 21:38:21,047 INFO L85 PathProgramCache]: Analyzing trace with hash 1758292219, now seen corresponding path program 1 times [2025-03-16 21:38:21,047 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-16 21:38:21,047 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [302334814] [2025-03-16 21:38:21,048 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-16 21:38:21,048 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-16 21:38:21,082 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 163 statements into 1 equivalence classes. [2025-03-16 21:38:21,117 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 163 of 163 statements. [2025-03-16 21:38:21,117 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-16 21:38:21,117 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-16 21:38:21,308 INFO L134 CoverageAnalysis]: Checked inductivity of 12 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 12 trivial. 0 not checked. [2025-03-16 21:38:21,308 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-16 21:38:21,308 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [302334814] [2025-03-16 21:38:21,308 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [302334814] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-16 21:38:21,308 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-16 21:38:21,309 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2025-03-16 21:38:21,309 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2147262548] [2025-03-16 21:38:21,309 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-16 21:38:21,309 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2025-03-16 21:38:21,309 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-16 21:38:21,309 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2025-03-16 21:38:21,309 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=8, Invalid=12, Unknown=0, NotChecked=0, Total=20 [2025-03-16 21:38:21,309 INFO L87 Difference]: Start difference. First operand 552 states and 807 transitions. Second operand has 5 states, 5 states have (on average 30.2) internal successors, (151), 5 states have internal predecessors, (151), 1 states have call successors, (3), 1 states have call predecessors, (3), 1 states have return successors, (3), 1 states have call predecessors, (3), 1 states have call successors, (3) [2025-03-16 21:38:21,546 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-16 21:38:21,546 INFO L93 Difference]: Finished difference Result 1003 states and 1463 transitions. [2025-03-16 21:38:21,547 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2025-03-16 21:38:21,547 INFO L78 Accepts]: Start accepts. Automaton has has 5 states, 5 states have (on average 30.2) internal successors, (151), 5 states have internal predecessors, (151), 1 states have call successors, (3), 1 states have call predecessors, (3), 1 states have return successors, (3), 1 states have call predecessors, (3), 1 states have call successors, (3) Word has length 163 [2025-03-16 21:38:21,547 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-16 21:38:21,549 INFO L225 Difference]: With dead ends: 1003 [2025-03-16 21:38:21,549 INFO L226 Difference]: Without dead ends: 552 [2025-03-16 21:38:21,550 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 6 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 4 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=13, Invalid=17, Unknown=0, NotChecked=0, Total=30 [2025-03-16 21:38:21,550 INFO L435 NwaCegarLoop]: 639 mSDtfsCounter, 1471 mSDsluCounter, 640 mSDsCounter, 0 mSdLazyCounter, 328 mSolverCounterSat, 1 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 1474 SdHoareTripleChecker+Valid, 1279 SdHoareTripleChecker+Invalid, 329 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 1 IncrementalHoareTripleChecker+Valid, 328 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.2s IncrementalHoareTripleChecker+Time [2025-03-16 21:38:21,550 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [1474 Valid, 1279 Invalid, 329 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [1 Valid, 328 Invalid, 0 Unknown, 0 Unchecked, 0.2s Time] [2025-03-16 21:38:21,552 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 552 states. [2025-03-16 21:38:21,558 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 552 to 552. [2025-03-16 21:38:21,559 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 552 states, 547 states have (on average 1.4625228519195612) internal successors, (800), 547 states have internal predecessors, (800), 3 states have call successors, (3), 1 states have call predecessors, (3), 1 states have return successors, (3), 3 states have call predecessors, (3), 3 states have call successors, (3) [2025-03-16 21:38:21,560 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 552 states to 552 states and 806 transitions. [2025-03-16 21:38:21,560 INFO L78 Accepts]: Start accepts. Automaton has 552 states and 806 transitions. Word has length 163 [2025-03-16 21:38:21,561 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-16 21:38:21,561 INFO L471 AbstractCegarLoop]: Abstraction has 552 states and 806 transitions. [2025-03-16 21:38:21,561 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 30.2) internal successors, (151), 5 states have internal predecessors, (151), 1 states have call successors, (3), 1 states have call predecessors, (3), 1 states have return successors, (3), 1 states have call predecessors, (3), 1 states have call successors, (3) [2025-03-16 21:38:21,561 INFO L276 IsEmpty]: Start isEmpty. Operand 552 states and 806 transitions. [2025-03-16 21:38:21,562 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 165 [2025-03-16 21:38:21,562 INFO L210 NwaCegarLoop]: Found error trace [2025-03-16 21:38:21,562 INFO L218 NwaCegarLoop]: trace histogram [3, 3, 3, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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-03-16 21:38:21,562 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable15 [2025-03-16 21:38:21,562 INFO L396 AbstractCegarLoop]: === Iteration 17 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-03-16 21:38:21,563 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-16 21:38:21,563 INFO L85 PathProgramCache]: Analyzing trace with hash 1945281370, now seen corresponding path program 1 times [2025-03-16 21:38:21,563 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-16 21:38:21,563 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1608987004] [2025-03-16 21:38:21,563 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-16 21:38:21,563 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-16 21:38:21,594 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 164 statements into 1 equivalence classes. [2025-03-16 21:38:21,624 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 164 of 164 statements. [2025-03-16 21:38:21,624 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-16 21:38:21,624 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-16 21:38:21,808 INFO L134 CoverageAnalysis]: Checked inductivity of 12 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 12 trivial. 0 not checked. [2025-03-16 21:38:21,809 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-16 21:38:21,809 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1608987004] [2025-03-16 21:38:21,809 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1608987004] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-16 21:38:21,809 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-16 21:38:21,809 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2025-03-16 21:38:21,809 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [377806000] [2025-03-16 21:38:21,810 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-16 21:38:21,810 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2025-03-16 21:38:21,810 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-16 21:38:21,810 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2025-03-16 21:38:21,810 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2025-03-16 21:38:21,810 INFO L87 Difference]: Start difference. First operand 552 states and 806 transitions. Second operand has 4 states, 4 states have (on average 38.0) internal successors, (152), 4 states have internal predecessors, (152), 1 states have call successors, (3), 1 states have call predecessors, (3), 1 states have return successors, (3), 1 states have call predecessors, (3), 1 states have call successors, (3) [2025-03-16 21:38:22,012 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-16 21:38:22,012 INFO L93 Difference]: Finished difference Result 1003 states and 1461 transitions. [2025-03-16 21:38:22,013 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2025-03-16 21:38:22,013 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 4 states have (on average 38.0) internal successors, (152), 4 states have internal predecessors, (152), 1 states have call successors, (3), 1 states have call predecessors, (3), 1 states have return successors, (3), 1 states have call predecessors, (3), 1 states have call successors, (3) Word has length 164 [2025-03-16 21:38:22,013 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-16 21:38:22,015 INFO L225 Difference]: With dead ends: 1003 [2025-03-16 21:38:22,015 INFO L226 Difference]: Without dead ends: 552 [2025-03-16 21:38:22,015 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 6 GetRequests, 3 SyntacticMatches, 0 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=9, Invalid=11, Unknown=0, NotChecked=0, Total=20 [2025-03-16 21:38:22,016 INFO L435 NwaCegarLoop]: 651 mSDtfsCounter, 699 mSDsluCounter, 652 mSDsCounter, 0 mSdLazyCounter, 302 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 699 SdHoareTripleChecker+Valid, 1303 SdHoareTripleChecker+Invalid, 302 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 302 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.2s IncrementalHoareTripleChecker+Time [2025-03-16 21:38:22,016 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [699 Valid, 1303 Invalid, 302 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 302 Invalid, 0 Unknown, 0 Unchecked, 0.2s Time] [2025-03-16 21:38:22,017 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 552 states. [2025-03-16 21:38:22,025 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 552 to 552. [2025-03-16 21:38:22,026 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 552 states, 547 states have (on average 1.4606946983546618) internal successors, (799), 547 states have internal predecessors, (799), 3 states have call successors, (3), 1 states have call predecessors, (3), 1 states have return successors, (3), 3 states have call predecessors, (3), 3 states have call successors, (3) [2025-03-16 21:38:22,028 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 552 states to 552 states and 805 transitions. [2025-03-16 21:38:22,028 INFO L78 Accepts]: Start accepts. Automaton has 552 states and 805 transitions. Word has length 164 [2025-03-16 21:38:22,028 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-16 21:38:22,028 INFO L471 AbstractCegarLoop]: Abstraction has 552 states and 805 transitions. [2025-03-16 21:38:22,028 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 38.0) internal successors, (152), 4 states have internal predecessors, (152), 1 states have call successors, (3), 1 states have call predecessors, (3), 1 states have return successors, (3), 1 states have call predecessors, (3), 1 states have call successors, (3) [2025-03-16 21:38:22,029 INFO L276 IsEmpty]: Start isEmpty. Operand 552 states and 805 transitions. [2025-03-16 21:38:22,029 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 166 [2025-03-16 21:38:22,029 INFO L210 NwaCegarLoop]: Found error trace [2025-03-16 21:38:22,030 INFO L218 NwaCegarLoop]: trace histogram [3, 3, 3, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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-03-16 21:38:22,030 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable16 [2025-03-16 21:38:22,030 INFO L396 AbstractCegarLoop]: === Iteration 18 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-03-16 21:38:22,030 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-16 21:38:22,030 INFO L85 PathProgramCache]: Analyzing trace with hash 1364216150, now seen corresponding path program 1 times [2025-03-16 21:38:22,030 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-16 21:38:22,030 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [864096494] [2025-03-16 21:38:22,030 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-16 21:38:22,030 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-16 21:38:22,062 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 165 statements into 1 equivalence classes. [2025-03-16 21:38:22,088 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 165 of 165 statements. [2025-03-16 21:38:22,088 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-16 21:38:22,088 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-16 21:38:22,346 INFO L134 CoverageAnalysis]: Checked inductivity of 12 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 12 trivial. 0 not checked. [2025-03-16 21:38:22,346 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-16 21:38:22,346 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [864096494] [2025-03-16 21:38:22,346 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [864096494] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-16 21:38:22,346 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-16 21:38:22,346 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2025-03-16 21:38:22,346 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [70993122] [2025-03-16 21:38:22,346 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-16 21:38:22,347 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2025-03-16 21:38:22,347 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-16 21:38:22,347 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2025-03-16 21:38:22,347 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=8, Invalid=12, Unknown=0, NotChecked=0, Total=20 [2025-03-16 21:38:22,347 INFO L87 Difference]: Start difference. First operand 552 states and 805 transitions. Second operand has 5 states, 5 states have (on average 30.6) internal successors, (153), 5 states have internal predecessors, (153), 1 states have call successors, (3), 1 states have call predecessors, (3), 1 states have return successors, (3), 1 states have call predecessors, (3), 1 states have call successors, (3) [2025-03-16 21:38:22,598 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-16 21:38:22,599 INFO L93 Difference]: Finished difference Result 1003 states and 1459 transitions. [2025-03-16 21:38:22,599 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2025-03-16 21:38:22,599 INFO L78 Accepts]: Start accepts. Automaton has has 5 states, 5 states have (on average 30.6) internal successors, (153), 5 states have internal predecessors, (153), 1 states have call successors, (3), 1 states have call predecessors, (3), 1 states have return successors, (3), 1 states have call predecessors, (3), 1 states have call successors, (3) Word has length 165 [2025-03-16 21:38:22,600 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-16 21:38:22,602 INFO L225 Difference]: With dead ends: 1003 [2025-03-16 21:38:22,602 INFO L226 Difference]: Without dead ends: 552 [2025-03-16 21:38:22,603 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 6 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 4 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=13, Invalid=17, Unknown=0, NotChecked=0, Total=30 [2025-03-16 21:38:22,603 INFO L435 NwaCegarLoop]: 651 mSDtfsCounter, 790 mSDsluCounter, 658 mSDsCounter, 0 mSdLazyCounter, 300 mSolverCounterSat, 1 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 793 SdHoareTripleChecker+Valid, 1309 SdHoareTripleChecker+Invalid, 301 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 1 IncrementalHoareTripleChecker+Valid, 300 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.2s IncrementalHoareTripleChecker+Time [2025-03-16 21:38:22,603 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [793 Valid, 1309 Invalid, 301 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [1 Valid, 300 Invalid, 0 Unknown, 0 Unchecked, 0.2s Time] [2025-03-16 21:38:22,604 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 552 states. [2025-03-16 21:38:22,612 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 552 to 552. [2025-03-16 21:38:22,613 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 552 states, 547 states have (on average 1.4588665447897624) internal successors, (798), 547 states have internal predecessors, (798), 3 states have call successors, (3), 1 states have call predecessors, (3), 1 states have return successors, (3), 3 states have call predecessors, (3), 3 states have call successors, (3) [2025-03-16 21:38:22,615 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 552 states to 552 states and 804 transitions. [2025-03-16 21:38:22,615 INFO L78 Accepts]: Start accepts. Automaton has 552 states and 804 transitions. Word has length 165 [2025-03-16 21:38:22,616 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-16 21:38:22,616 INFO L471 AbstractCegarLoop]: Abstraction has 552 states and 804 transitions. [2025-03-16 21:38:22,616 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 30.6) internal successors, (153), 5 states have internal predecessors, (153), 1 states have call successors, (3), 1 states have call predecessors, (3), 1 states have return successors, (3), 1 states have call predecessors, (3), 1 states have call successors, (3) [2025-03-16 21:38:22,616 INFO L276 IsEmpty]: Start isEmpty. Operand 552 states and 804 transitions. [2025-03-16 21:38:22,617 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 167 [2025-03-16 21:38:22,617 INFO L210 NwaCegarLoop]: Found error trace [2025-03-16 21:38:22,617 INFO L218 NwaCegarLoop]: trace histogram [3, 3, 3, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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-03-16 21:38:22,617 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable17 [2025-03-16 21:38:22,617 INFO L396 AbstractCegarLoop]: === Iteration 19 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-03-16 21:38:22,618 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-16 21:38:22,618 INFO L85 PathProgramCache]: Analyzing trace with hash -1738864097, now seen corresponding path program 1 times [2025-03-16 21:38:22,618 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-16 21:38:22,618 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1946718489] [2025-03-16 21:38:22,618 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-16 21:38:22,618 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-16 21:38:22,655 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 166 statements into 1 equivalence classes. [2025-03-16 21:38:22,694 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 166 of 166 statements. [2025-03-16 21:38:22,694 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-16 21:38:22,694 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-16 21:38:22,916 INFO L134 CoverageAnalysis]: Checked inductivity of 12 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 12 trivial. 0 not checked. [2025-03-16 21:38:22,916 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-16 21:38:22,916 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1946718489] [2025-03-16 21:38:22,916 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1946718489] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-16 21:38:22,917 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-16 21:38:22,917 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2025-03-16 21:38:22,917 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1446887836] [2025-03-16 21:38:22,917 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-16 21:38:22,917 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2025-03-16 21:38:22,917 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-16 21:38:22,917 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2025-03-16 21:38:22,917 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2025-03-16 21:38:22,918 INFO L87 Difference]: Start difference. First operand 552 states and 804 transitions. Second operand has 4 states, 4 states have (on average 38.5) internal successors, (154), 4 states have internal predecessors, (154), 2 states have call successors, (3), 1 states have call predecessors, (3), 1 states have return successors, (3), 2 states have call predecessors, (3), 2 states have call successors, (3) [2025-03-16 21:38:23,144 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-16 21:38:23,144 INFO L93 Difference]: Finished difference Result 1003 states and 1457 transitions. [2025-03-16 21:38:23,145 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2025-03-16 21:38:23,145 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 4 states have (on average 38.5) internal successors, (154), 4 states have internal predecessors, (154), 2 states have call successors, (3), 1 states have call predecessors, (3), 1 states have return successors, (3), 2 states have call predecessors, (3), 2 states have call successors, (3) Word has length 166 [2025-03-16 21:38:23,145 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-16 21:38:23,147 INFO L225 Difference]: With dead ends: 1003 [2025-03-16 21:38:23,147 INFO L226 Difference]: Without dead ends: 552 [2025-03-16 21:38:23,147 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 6 GetRequests, 3 SyntacticMatches, 0 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=9, Invalid=11, Unknown=0, NotChecked=0, Total=20 [2025-03-16 21:38:23,147 INFO L435 NwaCegarLoop]: 654 mSDtfsCounter, 734 mSDsluCounter, 655 mSDsCounter, 0 mSdLazyCounter, 292 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 736 SdHoareTripleChecker+Valid, 1309 SdHoareTripleChecker+Invalid, 292 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 292 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.2s IncrementalHoareTripleChecker+Time [2025-03-16 21:38:23,147 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [736 Valid, 1309 Invalid, 292 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 292 Invalid, 0 Unknown, 0 Unchecked, 0.2s Time] [2025-03-16 21:38:23,148 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 552 states. [2025-03-16 21:38:23,156 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 552 to 552. [2025-03-16 21:38:23,156 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 552 states, 547 states have (on average 1.4570383912248628) internal successors, (797), 547 states have internal predecessors, (797), 3 states have call successors, (3), 1 states have call predecessors, (3), 1 states have return successors, (3), 3 states have call predecessors, (3), 3 states have call successors, (3) [2025-03-16 21:38:23,158 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 552 states to 552 states and 803 transitions. [2025-03-16 21:38:23,158 INFO L78 Accepts]: Start accepts. Automaton has 552 states and 803 transitions. Word has length 166 [2025-03-16 21:38:23,158 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-16 21:38:23,158 INFO L471 AbstractCegarLoop]: Abstraction has 552 states and 803 transitions. [2025-03-16 21:38:23,158 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 38.5) internal successors, (154), 4 states have internal predecessors, (154), 2 states have call successors, (3), 1 states have call predecessors, (3), 1 states have return successors, (3), 2 states have call predecessors, (3), 2 states have call successors, (3) [2025-03-16 21:38:23,158 INFO L276 IsEmpty]: Start isEmpty. Operand 552 states and 803 transitions. [2025-03-16 21:38:23,159 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 168 [2025-03-16 21:38:23,159 INFO L210 NwaCegarLoop]: Found error trace [2025-03-16 21:38:23,160 INFO L218 NwaCegarLoop]: trace histogram [3, 3, 3, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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-03-16 21:38:23,160 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable18 [2025-03-16 21:38:23,160 INFO L396 AbstractCegarLoop]: === Iteration 20 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-03-16 21:38:23,160 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-16 21:38:23,160 INFO L85 PathProgramCache]: Analyzing trace with hash -140520540, now seen corresponding path program 1 times [2025-03-16 21:38:23,160 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-16 21:38:23,160 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [765140640] [2025-03-16 21:38:23,161 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-16 21:38:23,161 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-16 21:38:23,188 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 167 statements into 1 equivalence classes. [2025-03-16 21:38:23,286 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 167 of 167 statements. [2025-03-16 21:38:23,286 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-16 21:38:23,286 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-16 21:38:23,479 INFO L134 CoverageAnalysis]: Checked inductivity of 12 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 12 trivial. 0 not checked. [2025-03-16 21:38:23,479 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-16 21:38:23,479 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [765140640] [2025-03-16 21:38:23,479 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [765140640] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-16 21:38:23,480 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-16 21:38:23,480 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2025-03-16 21:38:23,480 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2103823234] [2025-03-16 21:38:23,480 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-16 21:38:23,480 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2025-03-16 21:38:23,480 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-16 21:38:23,481 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2025-03-16 21:38:23,481 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2025-03-16 21:38:23,481 INFO L87 Difference]: Start difference. First operand 552 states and 803 transitions. Second operand has 4 states, 4 states have (on average 38.75) internal successors, (155), 4 states have internal predecessors, (155), 2 states have call successors, (3), 1 states have call predecessors, (3), 1 states have return successors, (3), 2 states have call predecessors, (3), 2 states have call successors, (3) [2025-03-16 21:38:23,699 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-16 21:38:23,699 INFO L93 Difference]: Finished difference Result 1003 states and 1455 transitions. [2025-03-16 21:38:23,700 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2025-03-16 21:38:23,700 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 4 states have (on average 38.75) internal successors, (155), 4 states have internal predecessors, (155), 2 states have call successors, (3), 1 states have call predecessors, (3), 1 states have return successors, (3), 2 states have call predecessors, (3), 2 states have call successors, (3) Word has length 167 [2025-03-16 21:38:23,700 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-16 21:38:23,702 INFO L225 Difference]: With dead ends: 1003 [2025-03-16 21:38:23,702 INFO L226 Difference]: Without dead ends: 552 [2025-03-16 21:38:23,702 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 7 GetRequests, 4 SyntacticMatches, 0 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=9, Invalid=11, Unknown=0, NotChecked=0, Total=20 [2025-03-16 21:38:23,703 INFO L435 NwaCegarLoop]: 654 mSDtfsCounter, 732 mSDsluCounter, 655 mSDsCounter, 0 mSdLazyCounter, 290 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 734 SdHoareTripleChecker+Valid, 1309 SdHoareTripleChecker+Invalid, 290 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 290 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.2s IncrementalHoareTripleChecker+Time [2025-03-16 21:38:23,703 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [734 Valid, 1309 Invalid, 290 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 290 Invalid, 0 Unknown, 0 Unchecked, 0.2s Time] [2025-03-16 21:38:23,703 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 552 states. [2025-03-16 21:38:23,711 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 552 to 552. [2025-03-16 21:38:23,712 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 552 states, 547 states have (on average 1.4552102376599634) internal successors, (796), 547 states have internal predecessors, (796), 3 states have call successors, (3), 1 states have call predecessors, (3), 1 states have return successors, (3), 3 states have call predecessors, (3), 3 states have call successors, (3) [2025-03-16 21:38:23,714 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 552 states to 552 states and 802 transitions. [2025-03-16 21:38:23,715 INFO L78 Accepts]: Start accepts. Automaton has 552 states and 802 transitions. Word has length 167 [2025-03-16 21:38:23,715 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-16 21:38:23,715 INFO L471 AbstractCegarLoop]: Abstraction has 552 states and 802 transitions. [2025-03-16 21:38:23,715 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 38.75) internal successors, (155), 4 states have internal predecessors, (155), 2 states have call successors, (3), 1 states have call predecessors, (3), 1 states have return successors, (3), 2 states have call predecessors, (3), 2 states have call successors, (3) [2025-03-16 21:38:23,715 INFO L276 IsEmpty]: Start isEmpty. Operand 552 states and 802 transitions. [2025-03-16 21:38:23,716 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 169 [2025-03-16 21:38:23,716 INFO L210 NwaCegarLoop]: Found error trace [2025-03-16 21:38:23,716 INFO L218 NwaCegarLoop]: trace histogram [3, 3, 3, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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-03-16 21:38:23,716 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable19 [2025-03-16 21:38:23,717 INFO L396 AbstractCegarLoop]: === Iteration 21 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-03-16 21:38:23,717 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-16 21:38:23,718 INFO L85 PathProgramCache]: Analyzing trace with hash 1504434712, now seen corresponding path program 1 times [2025-03-16 21:38:23,718 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-16 21:38:23,718 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [812994499] [2025-03-16 21:38:23,718 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-16 21:38:23,718 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-16 21:38:23,748 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 168 statements into 1 equivalence classes. [2025-03-16 21:38:23,863 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 168 of 168 statements. [2025-03-16 21:38:23,863 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-16 21:38:23,863 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-16 21:38:24,098 INFO L134 CoverageAnalysis]: Checked inductivity of 12 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 12 trivial. 0 not checked. [2025-03-16 21:38:24,099 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-16 21:38:24,099 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [812994499] [2025-03-16 21:38:24,099 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [812994499] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-16 21:38:24,099 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-16 21:38:24,099 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2025-03-16 21:38:24,099 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [19523951] [2025-03-16 21:38:24,099 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-16 21:38:24,100 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2025-03-16 21:38:24,100 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-16 21:38:24,101 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2025-03-16 21:38:24,101 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=8, Invalid=12, Unknown=0, NotChecked=0, Total=20 [2025-03-16 21:38:24,101 INFO L87 Difference]: Start difference. First operand 552 states and 802 transitions. Second operand has 5 states, 5 states have (on average 31.2) internal successors, (156), 5 states have internal predecessors, (156), 1 states have call successors, (3), 1 states have call predecessors, (3), 1 states have return successors, (3), 1 states have call predecessors, (3), 1 states have call successors, (3) [2025-03-16 21:38:24,405 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-16 21:38:24,405 INFO L93 Difference]: Finished difference Result 1003 states and 1453 transitions. [2025-03-16 21:38:24,405 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2025-03-16 21:38:24,405 INFO L78 Accepts]: Start accepts. Automaton has has 5 states, 5 states have (on average 31.2) internal successors, (156), 5 states have internal predecessors, (156), 1 states have call successors, (3), 1 states have call predecessors, (3), 1 states have return successors, (3), 1 states have call predecessors, (3), 1 states have call successors, (3) Word has length 168 [2025-03-16 21:38:24,406 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-16 21:38:24,407 INFO L225 Difference]: With dead ends: 1003 [2025-03-16 21:38:24,407 INFO L226 Difference]: Without dead ends: 552 [2025-03-16 21:38:24,408 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 7 GetRequests, 3 SyntacticMatches, 0 SemanticMatches, 4 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=13, Invalid=17, Unknown=0, NotChecked=0, Total=30 [2025-03-16 21:38:24,409 INFO L435 NwaCegarLoop]: 608 mSDtfsCounter, 676 mSDsluCounter, 609 mSDsCounter, 0 mSdLazyCounter, 380 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 676 SdHoareTripleChecker+Valid, 1217 SdHoareTripleChecker+Invalid, 380 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 380 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.3s IncrementalHoareTripleChecker+Time [2025-03-16 21:38:24,409 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [676 Valid, 1217 Invalid, 380 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 380 Invalid, 0 Unknown, 0 Unchecked, 0.3s Time] [2025-03-16 21:38:24,410 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 552 states. [2025-03-16 21:38:24,418 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 552 to 552. [2025-03-16 21:38:24,419 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 552 states, 547 states have (on average 1.453382084095064) internal successors, (795), 547 states have internal predecessors, (795), 3 states have call successors, (3), 1 states have call predecessors, (3), 1 states have return successors, (3), 3 states have call predecessors, (3), 3 states have call successors, (3) [2025-03-16 21:38:24,420 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 552 states to 552 states and 801 transitions. [2025-03-16 21:38:24,420 INFO L78 Accepts]: Start accepts. Automaton has 552 states and 801 transitions. Word has length 168 [2025-03-16 21:38:24,420 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-16 21:38:24,420 INFO L471 AbstractCegarLoop]: Abstraction has 552 states and 801 transitions. [2025-03-16 21:38:24,421 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 31.2) internal successors, (156), 5 states have internal predecessors, (156), 1 states have call successors, (3), 1 states have call predecessors, (3), 1 states have return successors, (3), 1 states have call predecessors, (3), 1 states have call successors, (3) [2025-03-16 21:38:24,421 INFO L276 IsEmpty]: Start isEmpty. Operand 552 states and 801 transitions. [2025-03-16 21:38:24,422 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 170 [2025-03-16 21:38:24,422 INFO L210 NwaCegarLoop]: Found error trace [2025-03-16 21:38:24,422 INFO L218 NwaCegarLoop]: trace histogram [3, 3, 3, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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-03-16 21:38:24,423 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable20 [2025-03-16 21:38:24,423 INFO L396 AbstractCegarLoop]: === Iteration 22 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-03-16 21:38:24,423 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-16 21:38:24,423 INFO L85 PathProgramCache]: Analyzing trace with hash -1849417884, now seen corresponding path program 1 times [2025-03-16 21:38:24,424 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-16 21:38:24,424 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [978690626] [2025-03-16 21:38:24,424 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-16 21:38:24,424 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-16 21:38:24,453 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 169 statements into 1 equivalence classes. [2025-03-16 21:38:24,568 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 169 of 169 statements. [2025-03-16 21:38:24,568 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-16 21:38:24,568 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-16 21:38:24,810 INFO L134 CoverageAnalysis]: Checked inductivity of 12 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 12 trivial. 0 not checked. [2025-03-16 21:38:24,810 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-16 21:38:24,810 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [978690626] [2025-03-16 21:38:24,810 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [978690626] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-16 21:38:24,810 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-16 21:38:24,810 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2025-03-16 21:38:24,811 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1344509339] [2025-03-16 21:38:24,811 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-16 21:38:24,811 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2025-03-16 21:38:24,811 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-16 21:38:24,811 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2025-03-16 21:38:24,811 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=8, Invalid=12, Unknown=0, NotChecked=0, Total=20 [2025-03-16 21:38:24,811 INFO L87 Difference]: Start difference. First operand 552 states and 801 transitions. Second operand has 5 states, 5 states have (on average 31.4) internal successors, (157), 5 states have internal predecessors, (157), 1 states have call successors, (3), 1 states have call predecessors, (3), 1 states have return successors, (3), 1 states have call predecessors, (3), 1 states have call successors, (3) [2025-03-16 21:38:25,118 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-16 21:38:25,118 INFO L93 Difference]: Finished difference Result 1003 states and 1451 transitions. [2025-03-16 21:38:25,120 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2025-03-16 21:38:25,120 INFO L78 Accepts]: Start accepts. Automaton has has 5 states, 5 states have (on average 31.4) internal successors, (157), 5 states have internal predecessors, (157), 1 states have call successors, (3), 1 states have call predecessors, (3), 1 states have return successors, (3), 1 states have call predecessors, (3), 1 states have call successors, (3) Word has length 169 [2025-03-16 21:38:25,121 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-16 21:38:25,122 INFO L225 Difference]: With dead ends: 1003 [2025-03-16 21:38:25,122 INFO L226 Difference]: Without dead ends: 552 [2025-03-16 21:38:25,123 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 7 GetRequests, 3 SyntacticMatches, 0 SemanticMatches, 4 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=13, Invalid=17, Unknown=0, NotChecked=0, Total=30 [2025-03-16 21:38:25,126 INFO L435 NwaCegarLoop]: 608 mSDtfsCounter, 1340 mSDsluCounter, 609 mSDsCounter, 0 mSdLazyCounter, 378 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 1340 SdHoareTripleChecker+Valid, 1217 SdHoareTripleChecker+Invalid, 378 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 378 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.3s IncrementalHoareTripleChecker+Time [2025-03-16 21:38:25,128 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [1340 Valid, 1217 Invalid, 378 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 378 Invalid, 0 Unknown, 0 Unchecked, 0.3s Time] [2025-03-16 21:38:25,129 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 552 states. [2025-03-16 21:38:25,135 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 552 to 552. [2025-03-16 21:38:25,136 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 552 states, 547 states have (on average 1.4515539305301646) internal successors, (794), 547 states have internal predecessors, (794), 3 states have call successors, (3), 1 states have call predecessors, (3), 1 states have return successors, (3), 3 states have call predecessors, (3), 3 states have call successors, (3) [2025-03-16 21:38:25,136 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 552 states to 552 states and 800 transitions. [2025-03-16 21:38:25,137 INFO L78 Accepts]: Start accepts. Automaton has 552 states and 800 transitions. Word has length 169 [2025-03-16 21:38:25,137 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-16 21:38:25,137 INFO L471 AbstractCegarLoop]: Abstraction has 552 states and 800 transitions. [2025-03-16 21:38:25,137 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 31.4) internal successors, (157), 5 states have internal predecessors, (157), 1 states have call successors, (3), 1 states have call predecessors, (3), 1 states have return successors, (3), 1 states have call predecessors, (3), 1 states have call successors, (3) [2025-03-16 21:38:25,137 INFO L276 IsEmpty]: Start isEmpty. Operand 552 states and 800 transitions. [2025-03-16 21:38:25,138 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 171 [2025-03-16 21:38:25,138 INFO L210 NwaCegarLoop]: Found error trace [2025-03-16 21:38:25,139 INFO L218 NwaCegarLoop]: trace histogram [3, 3, 3, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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-03-16 21:38:25,139 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable21 [2025-03-16 21:38:25,139 INFO L396 AbstractCegarLoop]: === Iteration 23 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-03-16 21:38:25,139 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-16 21:38:25,140 INFO L85 PathProgramCache]: Analyzing trace with hash 40840582, now seen corresponding path program 1 times [2025-03-16 21:38:25,140 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-16 21:38:25,140 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [122041397] [2025-03-16 21:38:25,140 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-16 21:38:25,140 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-16 21:38:25,170 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 170 statements into 1 equivalence classes. [2025-03-16 21:38:25,242 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 170 of 170 statements. [2025-03-16 21:38:25,242 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-16 21:38:25,242 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-16 21:38:25,491 INFO L134 CoverageAnalysis]: Checked inductivity of 12 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 12 trivial. 0 not checked. [2025-03-16 21:38:25,492 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-16 21:38:25,492 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [122041397] [2025-03-16 21:38:25,492 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [122041397] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-16 21:38:25,492 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-16 21:38:25,492 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2025-03-16 21:38:25,492 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [441700586] [2025-03-16 21:38:25,492 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-16 21:38:25,493 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2025-03-16 21:38:25,493 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-16 21:38:25,493 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2025-03-16 21:38:25,493 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=8, Invalid=12, Unknown=0, NotChecked=0, Total=20 [2025-03-16 21:38:25,493 INFO L87 Difference]: Start difference. First operand 552 states and 800 transitions. Second operand has 5 states, 5 states have (on average 31.6) internal successors, (158), 5 states have internal predecessors, (158), 1 states have call successors, (3), 1 states have call predecessors, (3), 1 states have return successors, (3), 1 states have call predecessors, (3), 1 states have call successors, (3) [2025-03-16 21:38:25,798 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-16 21:38:25,799 INFO L93 Difference]: Finished difference Result 1003 states and 1449 transitions. [2025-03-16 21:38:25,799 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2025-03-16 21:38:25,799 INFO L78 Accepts]: Start accepts. Automaton has has 5 states, 5 states have (on average 31.6) internal successors, (158), 5 states have internal predecessors, (158), 1 states have call successors, (3), 1 states have call predecessors, (3), 1 states have return successors, (3), 1 states have call predecessors, (3), 1 states have call successors, (3) Word has length 170 [2025-03-16 21:38:25,799 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-16 21:38:25,801 INFO L225 Difference]: With dead ends: 1003 [2025-03-16 21:38:25,801 INFO L226 Difference]: Without dead ends: 552 [2025-03-16 21:38:25,801 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 7 GetRequests, 3 SyntacticMatches, 0 SemanticMatches, 4 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=13, Invalid=17, Unknown=0, NotChecked=0, Total=30 [2025-03-16 21:38:25,802 INFO L435 NwaCegarLoop]: 608 mSDtfsCounter, 1334 mSDsluCounter, 609 mSDsCounter, 0 mSdLazyCounter, 376 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 1334 SdHoareTripleChecker+Valid, 1217 SdHoareTripleChecker+Invalid, 376 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 376 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.3s IncrementalHoareTripleChecker+Time [2025-03-16 21:38:25,802 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [1334 Valid, 1217 Invalid, 376 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 376 Invalid, 0 Unknown, 0 Unchecked, 0.3s Time] [2025-03-16 21:38:25,803 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 552 states. [2025-03-16 21:38:25,808 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 552 to 552. [2025-03-16 21:38:25,808 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 552 states, 547 states have (on average 1.4497257769652652) internal successors, (793), 547 states have internal predecessors, (793), 3 states have call successors, (3), 1 states have call predecessors, (3), 1 states have return successors, (3), 3 states have call predecessors, (3), 3 states have call successors, (3) [2025-03-16 21:38:25,809 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 552 states to 552 states and 799 transitions. [2025-03-16 21:38:25,809 INFO L78 Accepts]: Start accepts. Automaton has 552 states and 799 transitions. Word has length 170 [2025-03-16 21:38:25,810 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-16 21:38:25,810 INFO L471 AbstractCegarLoop]: Abstraction has 552 states and 799 transitions. [2025-03-16 21:38:25,810 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 31.6) internal successors, (158), 5 states have internal predecessors, (158), 1 states have call successors, (3), 1 states have call predecessors, (3), 1 states have return successors, (3), 1 states have call predecessors, (3), 1 states have call successors, (3) [2025-03-16 21:38:25,810 INFO L276 IsEmpty]: Start isEmpty. Operand 552 states and 799 transitions. [2025-03-16 21:38:25,811 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 172 [2025-03-16 21:38:25,811 INFO L210 NwaCegarLoop]: Found error trace [2025-03-16 21:38:25,811 INFO L218 NwaCegarLoop]: trace histogram [3, 3, 3, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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-03-16 21:38:25,811 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable22 [2025-03-16 21:38:25,811 INFO L396 AbstractCegarLoop]: === Iteration 24 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-03-16 21:38:25,811 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-16 21:38:25,811 INFO L85 PathProgramCache]: Analyzing trace with hash 1595281987, now seen corresponding path program 1 times [2025-03-16 21:38:25,812 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-16 21:38:25,812 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [244305238] [2025-03-16 21:38:25,812 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-16 21:38:25,812 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-16 21:38:25,840 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 171 statements into 1 equivalence classes. [2025-03-16 21:38:25,904 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 171 of 171 statements. [2025-03-16 21:38:25,904 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-16 21:38:25,904 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-16 21:38:26,291 INFO L134 CoverageAnalysis]: Checked inductivity of 12 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 12 trivial. 0 not checked. [2025-03-16 21:38:26,291 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-16 21:38:26,291 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [244305238] [2025-03-16 21:38:26,291 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [244305238] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-16 21:38:26,291 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-16 21:38:26,292 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2025-03-16 21:38:26,292 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [78302466] [2025-03-16 21:38:26,292 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-16 21:38:26,292 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2025-03-16 21:38:26,292 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-16 21:38:26,293 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2025-03-16 21:38:26,293 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2025-03-16 21:38:26,293 INFO L87 Difference]: Start difference. First operand 552 states and 799 transitions. Second operand has 5 states, 5 states have (on average 31.8) internal successors, (159), 5 states have internal predecessors, (159), 1 states have call successors, (3), 1 states have call predecessors, (3), 1 states have return successors, (3), 1 states have call predecessors, (3), 1 states have call successors, (3) [2025-03-16 21:38:26,662 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-16 21:38:26,662 INFO L93 Difference]: Finished difference Result 1009 states and 1455 transitions. [2025-03-16 21:38:26,662 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2025-03-16 21:38:26,662 INFO L78 Accepts]: Start accepts. Automaton has has 5 states, 5 states have (on average 31.8) internal successors, (159), 5 states have internal predecessors, (159), 1 states have call successors, (3), 1 states have call predecessors, (3), 1 states have return successors, (3), 1 states have call predecessors, (3), 1 states have call successors, (3) Word has length 171 [2025-03-16 21:38:26,663 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-16 21:38:26,665 INFO L225 Difference]: With dead ends: 1009 [2025-03-16 21:38:26,665 INFO L226 Difference]: Without dead ends: 556 [2025-03-16 21:38:26,665 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-03-16 21:38:26,666 INFO L435 NwaCegarLoop]: 657 mSDtfsCounter, 2 mSDsluCounter, 1816 mSDsCounter, 0 mSdLazyCounter, 706 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.3s Time, 0 mProtectedPredicate, 0 mProtectedAction, 2 SdHoareTripleChecker+Valid, 2473 SdHoareTripleChecker+Invalid, 706 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 706 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.4s IncrementalHoareTripleChecker+Time [2025-03-16 21:38:26,666 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [2 Valid, 2473 Invalid, 706 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 706 Invalid, 0 Unknown, 0 Unchecked, 0.4s Time] [2025-03-16 21:38:26,667 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 556 states. [2025-03-16 21:38:26,675 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 556 to 554. [2025-03-16 21:38:26,676 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 554 states, 549 states have (on average 1.4480874316939891) internal successors, (795), 549 states have internal predecessors, (795), 3 states have call successors, (3), 1 states have call predecessors, (3), 1 states have return successors, (3), 3 states have call predecessors, (3), 3 states have call successors, (3) [2025-03-16 21:38:26,677 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 554 states to 554 states and 801 transitions. [2025-03-16 21:38:26,677 INFO L78 Accepts]: Start accepts. Automaton has 554 states and 801 transitions. Word has length 171 [2025-03-16 21:38:26,677 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-16 21:38:26,678 INFO L471 AbstractCegarLoop]: Abstraction has 554 states and 801 transitions. [2025-03-16 21:38:26,678 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 31.8) internal successors, (159), 5 states have internal predecessors, (159), 1 states have call successors, (3), 1 states have call predecessors, (3), 1 states have return successors, (3), 1 states have call predecessors, (3), 1 states have call successors, (3) [2025-03-16 21:38:26,678 INFO L276 IsEmpty]: Start isEmpty. Operand 554 states and 801 transitions. [2025-03-16 21:38:26,679 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 173 [2025-03-16 21:38:26,679 INFO L210 NwaCegarLoop]: Found error trace [2025-03-16 21:38:26,679 INFO L218 NwaCegarLoop]: trace histogram [3, 3, 3, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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-03-16 21:38:26,679 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable23 [2025-03-16 21:38:26,679 INFO L396 AbstractCegarLoop]: === Iteration 25 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-03-16 21:38:26,679 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-16 21:38:26,680 INFO L85 PathProgramCache]: Analyzing trace with hash -395287052, now seen corresponding path program 1 times [2025-03-16 21:38:26,680 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-16 21:38:26,680 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [556858854] [2025-03-16 21:38:26,680 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-16 21:38:26,680 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-16 21:38:26,716 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 172 statements into 1 equivalence classes. [2025-03-16 21:38:26,864 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 172 of 172 statements. [2025-03-16 21:38:26,865 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-16 21:38:26,865 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-16 21:38:26,998 INFO L134 CoverageAnalysis]: Checked inductivity of 12 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 12 trivial. 0 not checked. [2025-03-16 21:38:26,998 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-16 21:38:26,998 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [556858854] [2025-03-16 21:38:26,998 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [556858854] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-16 21:38:26,998 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-16 21:38:26,998 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2025-03-16 21:38:26,998 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1104328311] [2025-03-16 21:38:26,998 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-16 21:38:26,999 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2025-03-16 21:38:26,999 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-16 21:38:26,999 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2025-03-16 21:38:26,999 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2025-03-16 21:38:26,999 INFO L87 Difference]: Start difference. First operand 554 states and 801 transitions. Second operand has 4 states, 4 states have (on average 40.0) internal successors, (160), 4 states have internal predecessors, (160), 1 states have call successors, (3), 1 states have call predecessors, (3), 1 states have return successors, (3), 1 states have call predecessors, (3), 1 states have call successors, (3) [2025-03-16 21:38:27,196 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-16 21:38:27,196 INFO L93 Difference]: Finished difference Result 1007 states and 1451 transitions. [2025-03-16 21:38:27,196 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2025-03-16 21:38:27,196 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 4 states have (on average 40.0) internal successors, (160), 4 states have internal predecessors, (160), 1 states have call successors, (3), 1 states have call predecessors, (3), 1 states have return successors, (3), 1 states have call predecessors, (3), 1 states have call successors, (3) Word has length 172 [2025-03-16 21:38:27,197 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-16 21:38:27,198 INFO L225 Difference]: With dead ends: 1007 [2025-03-16 21:38:27,198 INFO L226 Difference]: Without dead ends: 554 [2025-03-16 21:38:27,199 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 6 GetRequests, 3 SyntacticMatches, 0 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=9, Invalid=11, Unknown=0, NotChecked=0, Total=20 [2025-03-16 21:38:27,199 INFO L435 NwaCegarLoop]: 646 mSDtfsCounter, 688 mSDsluCounter, 647 mSDsCounter, 0 mSdLazyCounter, 298 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 688 SdHoareTripleChecker+Valid, 1293 SdHoareTripleChecker+Invalid, 298 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 298 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.2s IncrementalHoareTripleChecker+Time [2025-03-16 21:38:27,199 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [688 Valid, 1293 Invalid, 298 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 298 Invalid, 0 Unknown, 0 Unchecked, 0.2s Time] [2025-03-16 21:38:27,200 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 554 states. [2025-03-16 21:38:27,205 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 554 to 554. [2025-03-16 21:38:27,206 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 554 states, 549 states have (on average 1.4462659380692167) internal successors, (794), 549 states have internal predecessors, (794), 3 states have call successors, (3), 1 states have call predecessors, (3), 1 states have return successors, (3), 3 states have call predecessors, (3), 3 states have call successors, (3) [2025-03-16 21:38:27,207 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 554 states to 554 states and 800 transitions. [2025-03-16 21:38:27,207 INFO L78 Accepts]: Start accepts. Automaton has 554 states and 800 transitions. Word has length 172 [2025-03-16 21:38:27,207 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-16 21:38:27,207 INFO L471 AbstractCegarLoop]: Abstraction has 554 states and 800 transitions. [2025-03-16 21:38:27,208 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 40.0) internal successors, (160), 4 states have internal predecessors, (160), 1 states have call successors, (3), 1 states have call predecessors, (3), 1 states have return successors, (3), 1 states have call predecessors, (3), 1 states have call successors, (3) [2025-03-16 21:38:27,208 INFO L276 IsEmpty]: Start isEmpty. Operand 554 states and 800 transitions. [2025-03-16 21:38:27,208 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 174 [2025-03-16 21:38:27,208 INFO L210 NwaCegarLoop]: Found error trace [2025-03-16 21:38:27,208 INFO L218 NwaCegarLoop]: trace histogram [3, 3, 3, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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-03-16 21:38:27,208 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable24 [2025-03-16 21:38:27,209 INFO L396 AbstractCegarLoop]: === Iteration 26 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-03-16 21:38:27,209 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-16 21:38:27,209 INFO L85 PathProgramCache]: Analyzing trace with hash 1230165711, now seen corresponding path program 1 times [2025-03-16 21:38:27,209 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-16 21:38:27,209 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [926104705] [2025-03-16 21:38:27,209 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-16 21:38:27,209 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-16 21:38:27,238 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 173 statements into 1 equivalence classes. [2025-03-16 21:38:27,296 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 173 of 173 statements. [2025-03-16 21:38:27,296 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-16 21:38:27,296 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-16 21:38:27,511 INFO L134 CoverageAnalysis]: Checked inductivity of 12 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 12 trivial. 0 not checked. [2025-03-16 21:38:27,511 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-16 21:38:27,512 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [926104705] [2025-03-16 21:38:27,512 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [926104705] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-16 21:38:27,512 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-16 21:38:27,512 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2025-03-16 21:38:27,512 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [536481973] [2025-03-16 21:38:27,512 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-16 21:38:27,512 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2025-03-16 21:38:27,512 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-16 21:38:27,513 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2025-03-16 21:38:27,513 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2025-03-16 21:38:27,513 INFO L87 Difference]: Start difference. First operand 554 states and 800 transitions. Second operand has 4 states, 4 states have (on average 40.25) internal successors, (161), 4 states have internal predecessors, (161), 1 states have call successors, (3), 1 states have call predecessors, (3), 1 states have return successors, (3), 1 states have call predecessors, (3), 1 states have call successors, (3) [2025-03-16 21:38:27,799 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-16 21:38:27,799 INFO L93 Difference]: Finished difference Result 1009 states and 1451 transitions. [2025-03-16 21:38:27,800 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2025-03-16 21:38:27,800 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 4 states have (on average 40.25) internal successors, (161), 4 states have internal predecessors, (161), 1 states have call successors, (3), 1 states have call predecessors, (3), 1 states have return successors, (3), 1 states have call predecessors, (3), 1 states have call successors, (3) Word has length 173 [2025-03-16 21:38:27,800 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-16 21:38:27,801 INFO L225 Difference]: With dead ends: 1009 [2025-03-16 21:38:27,801 INFO L226 Difference]: Without dead ends: 554 [2025-03-16 21:38:27,802 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-03-16 21:38:27,802 INFO L435 NwaCegarLoop]: 657 mSDtfsCounter, 2 mSDsluCounter, 1161 mSDsCounter, 0 mSdLazyCounter, 560 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 2 SdHoareTripleChecker+Valid, 1818 SdHoareTripleChecker+Invalid, 560 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 560 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.3s IncrementalHoareTripleChecker+Time [2025-03-16 21:38:27,802 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [2 Valid, 1818 Invalid, 560 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 560 Invalid, 0 Unknown, 0 Unchecked, 0.3s Time] [2025-03-16 21:38:27,803 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 554 states. [2025-03-16 21:38:27,810 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 554 to 552. [2025-03-16 21:38:27,810 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 552 states, 547 states have (on average 1.4460694698354661) internal successors, (791), 547 states have internal predecessors, (791), 3 states have call successors, (3), 1 states have call predecessors, (3), 1 states have return successors, (3), 3 states have call predecessors, (3), 3 states have call successors, (3) [2025-03-16 21:38:27,811 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 552 states to 552 states and 797 transitions. [2025-03-16 21:38:27,811 INFO L78 Accepts]: Start accepts. Automaton has 552 states and 797 transitions. Word has length 173 [2025-03-16 21:38:27,811 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-16 21:38:27,812 INFO L471 AbstractCegarLoop]: Abstraction has 552 states and 797 transitions. [2025-03-16 21:38:27,812 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 40.25) internal successors, (161), 4 states have internal predecessors, (161), 1 states have call successors, (3), 1 states have call predecessors, (3), 1 states have return successors, (3), 1 states have call predecessors, (3), 1 states have call successors, (3) [2025-03-16 21:38:27,812 INFO L276 IsEmpty]: Start isEmpty. Operand 552 states and 797 transitions. [2025-03-16 21:38:27,812 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 174 [2025-03-16 21:38:27,812 INFO L210 NwaCegarLoop]: Found error trace [2025-03-16 21:38:27,813 INFO L218 NwaCegarLoop]: trace histogram [3, 3, 3, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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-03-16 21:38:27,813 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable25 [2025-03-16 21:38:27,813 INFO L396 AbstractCegarLoop]: === Iteration 27 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-03-16 21:38:27,813 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-16 21:38:27,814 INFO L85 PathProgramCache]: Analyzing trace with hash 1523443626, now seen corresponding path program 1 times [2025-03-16 21:38:27,814 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-16 21:38:27,814 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1224063285] [2025-03-16 21:38:27,814 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-16 21:38:27,814 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-16 21:38:27,843 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 173 statements into 1 equivalence classes. [2025-03-16 21:38:27,900 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 173 of 173 statements. [2025-03-16 21:38:27,900 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-16 21:38:27,900 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-16 21:38:28,118 INFO L134 CoverageAnalysis]: Checked inductivity of 12 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 12 trivial. 0 not checked. [2025-03-16 21:38:28,118 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-16 21:38:28,118 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1224063285] [2025-03-16 21:38:28,118 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1224063285] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-16 21:38:28,118 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-16 21:38:28,118 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2025-03-16 21:38:28,118 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [196717005] [2025-03-16 21:38:28,118 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-16 21:38:28,119 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2025-03-16 21:38:28,119 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-16 21:38:28,120 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2025-03-16 21:38:28,120 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=8, Invalid=12, Unknown=0, NotChecked=0, Total=20 [2025-03-16 21:38:28,120 INFO L87 Difference]: Start difference. First operand 552 states and 797 transitions. Second operand has 5 states, 5 states have (on average 32.2) internal successors, (161), 5 states have internal predecessors, (161), 1 states have call successors, (3), 1 states have call predecessors, (3), 1 states have return successors, (3), 1 states have call predecessors, (3), 1 states have call successors, (3) [2025-03-16 21:38:28,412 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-16 21:38:28,412 INFO L93 Difference]: Finished difference Result 1003 states and 1443 transitions. [2025-03-16 21:38:28,412 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2025-03-16 21:38:28,412 INFO L78 Accepts]: Start accepts. Automaton has has 5 states, 5 states have (on average 32.2) internal successors, (161), 5 states have internal predecessors, (161), 1 states have call successors, (3), 1 states have call predecessors, (3), 1 states have return successors, (3), 1 states have call predecessors, (3), 1 states have call successors, (3) Word has length 173 [2025-03-16 21:38:28,412 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-16 21:38:28,414 INFO L225 Difference]: With dead ends: 1003 [2025-03-16 21:38:28,414 INFO L226 Difference]: Without dead ends: 552 [2025-03-16 21:38:28,415 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 7 GetRequests, 3 SyntacticMatches, 0 SemanticMatches, 4 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=13, Invalid=17, Unknown=0, NotChecked=0, Total=30 [2025-03-16 21:38:28,415 INFO L435 NwaCegarLoop]: 606 mSDtfsCounter, 1320 mSDsluCounter, 607 mSDsCounter, 0 mSdLazyCounter, 374 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 1320 SdHoareTripleChecker+Valid, 1213 SdHoareTripleChecker+Invalid, 374 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 374 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.3s IncrementalHoareTripleChecker+Time [2025-03-16 21:38:28,415 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [1320 Valid, 1213 Invalid, 374 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 374 Invalid, 0 Unknown, 0 Unchecked, 0.3s Time] [2025-03-16 21:38:28,417 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 552 states. [2025-03-16 21:38:28,422 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 552 to 552. [2025-03-16 21:38:28,423 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 552 states, 547 states have (on average 1.4442413162705667) internal successors, (790), 547 states have internal predecessors, (790), 3 states have call successors, (3), 1 states have call predecessors, (3), 1 states have return successors, (3), 3 states have call predecessors, (3), 3 states have call successors, (3) [2025-03-16 21:38:28,423 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 552 states to 552 states and 796 transitions. [2025-03-16 21:38:28,424 INFO L78 Accepts]: Start accepts. Automaton has 552 states and 796 transitions. Word has length 173 [2025-03-16 21:38:28,424 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-16 21:38:28,424 INFO L471 AbstractCegarLoop]: Abstraction has 552 states and 796 transitions. [2025-03-16 21:38:28,424 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 32.2) internal successors, (161), 5 states have internal predecessors, (161), 1 states have call successors, (3), 1 states have call predecessors, (3), 1 states have return successors, (3), 1 states have call predecessors, (3), 1 states have call successors, (3) [2025-03-16 21:38:28,424 INFO L276 IsEmpty]: Start isEmpty. Operand 552 states and 796 transitions. [2025-03-16 21:38:28,425 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 175 [2025-03-16 21:38:28,425 INFO L210 NwaCegarLoop]: Found error trace [2025-03-16 21:38:28,425 INFO L218 NwaCegarLoop]: trace histogram [3, 3, 3, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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-03-16 21:38:28,425 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable26 [2025-03-16 21:38:28,425 INFO L396 AbstractCegarLoop]: === Iteration 28 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-03-16 21:38:28,426 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-16 21:38:28,426 INFO L85 PathProgramCache]: Analyzing trace with hash 99699803, now seen corresponding path program 1 times [2025-03-16 21:38:28,426 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-16 21:38:28,426 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1737266692] [2025-03-16 21:38:28,426 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-16 21:38:28,426 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-16 21:38:28,454 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 174 statements into 1 equivalence classes. [2025-03-16 21:38:28,512 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 174 of 174 statements. [2025-03-16 21:38:28,513 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-16 21:38:28,513 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-16 21:38:28,749 INFO L134 CoverageAnalysis]: Checked inductivity of 12 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 12 trivial. 0 not checked. [2025-03-16 21:38:28,749 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-16 21:38:28,749 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1737266692] [2025-03-16 21:38:28,749 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1737266692] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-16 21:38:28,749 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-16 21:38:28,749 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2025-03-16 21:38:28,749 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [728209227] [2025-03-16 21:38:28,749 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-16 21:38:28,750 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2025-03-16 21:38:28,750 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-16 21:38:28,750 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2025-03-16 21:38:28,750 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=8, Invalid=12, Unknown=0, NotChecked=0, Total=20 [2025-03-16 21:38:28,751 INFO L87 Difference]: Start difference. First operand 552 states and 796 transitions. Second operand has 5 states, 5 states have (on average 32.4) internal successors, (162), 5 states have internal predecessors, (162), 1 states have call successors, (3), 1 states have call predecessors, (3), 1 states have return successors, (3), 1 states have call predecessors, (3), 1 states have call successors, (3) [2025-03-16 21:38:29,013 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-16 21:38:29,013 INFO L93 Difference]: Finished difference Result 1003 states and 1441 transitions. [2025-03-16 21:38:29,013 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2025-03-16 21:38:29,013 INFO L78 Accepts]: Start accepts. Automaton has has 5 states, 5 states have (on average 32.4) internal successors, (162), 5 states have internal predecessors, (162), 1 states have call successors, (3), 1 states have call predecessors, (3), 1 states have return successors, (3), 1 states have call predecessors, (3), 1 states have call successors, (3) Word has length 174 [2025-03-16 21:38:29,014 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-16 21:38:29,015 INFO L225 Difference]: With dead ends: 1003 [2025-03-16 21:38:29,015 INFO L226 Difference]: Without dead ends: 552 [2025-03-16 21:38:29,015 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 7 GetRequests, 3 SyntacticMatches, 0 SemanticMatches, 4 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=13, Invalid=17, Unknown=0, NotChecked=0, Total=30 [2025-03-16 21:38:29,016 INFO L435 NwaCegarLoop]: 606 mSDtfsCounter, 665 mSDsluCounter, 613 mSDsCounter, 0 mSdLazyCounter, 372 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 665 SdHoareTripleChecker+Valid, 1219 SdHoareTripleChecker+Invalid, 372 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 372 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.2s IncrementalHoareTripleChecker+Time [2025-03-16 21:38:29,016 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [665 Valid, 1219 Invalid, 372 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 372 Invalid, 0 Unknown, 0 Unchecked, 0.2s Time] [2025-03-16 21:38:29,016 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 552 states. [2025-03-16 21:38:29,021 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 552 to 552. [2025-03-16 21:38:29,022 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 552 states, 547 states have (on average 1.4424131627056673) internal successors, (789), 547 states have internal predecessors, (789), 3 states have call successors, (3), 1 states have call predecessors, (3), 1 states have return successors, (3), 3 states have call predecessors, (3), 3 states have call successors, (3) [2025-03-16 21:38:29,022 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 552 states to 552 states and 795 transitions. [2025-03-16 21:38:29,023 INFO L78 Accepts]: Start accepts. Automaton has 552 states and 795 transitions. Word has length 174 [2025-03-16 21:38:29,023 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-16 21:38:29,023 INFO L471 AbstractCegarLoop]: Abstraction has 552 states and 795 transitions. [2025-03-16 21:38:29,023 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 32.4) internal successors, (162), 5 states have internal predecessors, (162), 1 states have call successors, (3), 1 states have call predecessors, (3), 1 states have return successors, (3), 1 states have call predecessors, (3), 1 states have call successors, (3) [2025-03-16 21:38:29,023 INFO L276 IsEmpty]: Start isEmpty. Operand 552 states and 795 transitions. [2025-03-16 21:38:29,024 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 176 [2025-03-16 21:38:29,024 INFO L210 NwaCegarLoop]: Found error trace [2025-03-16 21:38:29,024 INFO L218 NwaCegarLoop]: trace histogram [3, 3, 3, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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-03-16 21:38:29,024 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable27 [2025-03-16 21:38:29,024 INFO L396 AbstractCegarLoop]: === Iteration 29 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-03-16 21:38:29,024 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-16 21:38:29,024 INFO L85 PathProgramCache]: Analyzing trace with hash -1868515603, now seen corresponding path program 1 times [2025-03-16 21:38:29,025 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-16 21:38:29,025 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [306174183] [2025-03-16 21:38:29,025 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-16 21:38:29,025 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-16 21:38:29,053 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 175 statements into 1 equivalence classes. [2025-03-16 21:38:29,105 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 175 of 175 statements. [2025-03-16 21:38:29,106 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-16 21:38:29,106 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-16 21:38:29,290 INFO L134 CoverageAnalysis]: Checked inductivity of 12 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 12 trivial. 0 not checked. [2025-03-16 21:38:29,290 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-16 21:38:29,290 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [306174183] [2025-03-16 21:38:29,291 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [306174183] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-16 21:38:29,291 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-16 21:38:29,291 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2025-03-16 21:38:29,291 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [155758274] [2025-03-16 21:38:29,291 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-16 21:38:29,291 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2025-03-16 21:38:29,291 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-16 21:38:29,291 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2025-03-16 21:38:29,291 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=8, Invalid=12, Unknown=0, NotChecked=0, Total=20 [2025-03-16 21:38:29,292 INFO L87 Difference]: Start difference. First operand 552 states and 795 transitions. Second operand has 5 states, 5 states have (on average 32.6) internal successors, (163), 5 states have internal predecessors, (163), 1 states have call successors, (3), 1 states have call predecessors, (3), 1 states have return successors, (3), 1 states have call predecessors, (3), 1 states have call successors, (3) [2025-03-16 21:38:29,516 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-16 21:38:29,516 INFO L93 Difference]: Finished difference Result 1003 states and 1439 transitions. [2025-03-16 21:38:29,516 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2025-03-16 21:38:29,517 INFO L78 Accepts]: Start accepts. Automaton has has 5 states, 5 states have (on average 32.6) internal successors, (163), 5 states have internal predecessors, (163), 1 states have call successors, (3), 1 states have call predecessors, (3), 1 states have return successors, (3), 1 states have call predecessors, (3), 1 states have call successors, (3) Word has length 175 [2025-03-16 21:38:29,517 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-16 21:38:29,518 INFO L225 Difference]: With dead ends: 1003 [2025-03-16 21:38:29,518 INFO L226 Difference]: Without dead ends: 552 [2025-03-16 21:38:29,519 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 7 GetRequests, 3 SyntacticMatches, 0 SemanticMatches, 4 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=13, Invalid=17, Unknown=0, NotChecked=0, Total=30 [2025-03-16 21:38:29,519 INFO L435 NwaCegarLoop]: 606 mSDtfsCounter, 1304 mSDsluCounter, 607 mSDsCounter, 0 mSdLazyCounter, 370 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 1304 SdHoareTripleChecker+Valid, 1213 SdHoareTripleChecker+Invalid, 370 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 370 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.2s IncrementalHoareTripleChecker+Time [2025-03-16 21:38:29,519 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [1304 Valid, 1213 Invalid, 370 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 370 Invalid, 0 Unknown, 0 Unchecked, 0.2s Time] [2025-03-16 21:38:29,520 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 552 states. [2025-03-16 21:38:29,525 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 552 to 552. [2025-03-16 21:38:29,525 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 552 states, 547 states have (on average 1.440585009140768) internal successors, (788), 547 states have internal predecessors, (788), 3 states have call successors, (3), 1 states have call predecessors, (3), 1 states have return successors, (3), 3 states have call predecessors, (3), 3 states have call successors, (3) [2025-03-16 21:38:29,526 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 552 states to 552 states and 794 transitions. [2025-03-16 21:38:29,526 INFO L78 Accepts]: Start accepts. Automaton has 552 states and 794 transitions. Word has length 175 [2025-03-16 21:38:29,526 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-16 21:38:29,526 INFO L471 AbstractCegarLoop]: Abstraction has 552 states and 794 transitions. [2025-03-16 21:38:29,526 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 32.6) internal successors, (163), 5 states have internal predecessors, (163), 1 states have call successors, (3), 1 states have call predecessors, (3), 1 states have return successors, (3), 1 states have call predecessors, (3), 1 states have call successors, (3) [2025-03-16 21:38:29,526 INFO L276 IsEmpty]: Start isEmpty. Operand 552 states and 794 transitions. [2025-03-16 21:38:29,527 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 177 [2025-03-16 21:38:29,527 INFO L210 NwaCegarLoop]: Found error trace [2025-03-16 21:38:29,527 INFO L218 NwaCegarLoop]: trace histogram [3, 3, 3, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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-03-16 21:38:29,527 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable28 [2025-03-16 21:38:29,527 INFO L396 AbstractCegarLoop]: === Iteration 30 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-03-16 21:38:29,528 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-16 21:38:29,528 INFO L85 PathProgramCache]: Analyzing trace with hash -1166205226, now seen corresponding path program 1 times [2025-03-16 21:38:29,528 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-16 21:38:29,528 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [25901565] [2025-03-16 21:38:29,528 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-16 21:38:29,528 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-16 21:38:29,557 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 176 statements into 1 equivalence classes. [2025-03-16 21:38:29,632 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 176 of 176 statements. [2025-03-16 21:38:29,632 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-16 21:38:29,632 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-16 21:38:29,990 INFO L134 CoverageAnalysis]: Checked inductivity of 12 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 12 trivial. 0 not checked. [2025-03-16 21:38:29,991 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-16 21:38:29,991 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [25901565] [2025-03-16 21:38:29,991 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [25901565] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-16 21:38:29,992 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-16 21:38:29,992 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2025-03-16 21:38:29,992 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [558474769] [2025-03-16 21:38:29,993 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-16 21:38:29,993 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2025-03-16 21:38:29,993 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-16 21:38:29,993 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2025-03-16 21:38:29,993 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=9, Invalid=11, Unknown=0, NotChecked=0, Total=20 [2025-03-16 21:38:29,994 INFO L87 Difference]: Start difference. First operand 552 states and 794 transitions. Second operand has 5 states, 5 states have (on average 32.8) internal successors, (164), 5 states have internal predecessors, (164), 1 states have call successors, (3), 1 states have call predecessors, (3), 1 states have return successors, (3), 1 states have call predecessors, (3), 1 states have call successors, (3) [2025-03-16 21:38:30,365 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-16 21:38:30,365 INFO L93 Difference]: Finished difference Result 1007 states and 1442 transitions. [2025-03-16 21:38:30,365 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2025-03-16 21:38:30,365 INFO L78 Accepts]: Start accepts. Automaton has has 5 states, 5 states have (on average 32.8) internal successors, (164), 5 states have internal predecessors, (164), 1 states have call successors, (3), 1 states have call predecessors, (3), 1 states have return successors, (3), 1 states have call predecessors, (3), 1 states have call successors, (3) Word has length 176 [2025-03-16 21:38:30,366 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-16 21:38:30,367 INFO L225 Difference]: With dead ends: 1007 [2025-03-16 21:38:30,367 INFO L226 Difference]: Without dead ends: 556 [2025-03-16 21:38:30,367 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 8 GetRequests, 5 SyntacticMatches, 0 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=9, Invalid=11, Unknown=0, NotChecked=0, Total=20 [2025-03-16 21:38:30,368 INFO L435 NwaCegarLoop]: 506 mSDtfsCounter, 692 mSDsluCounter, 993 mSDsCounter, 0 mSdLazyCounter, 864 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.3s Time, 0 mProtectedPredicate, 0 mProtectedAction, 692 SdHoareTripleChecker+Valid, 1499 SdHoareTripleChecker+Invalid, 864 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 864 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.4s IncrementalHoareTripleChecker+Time [2025-03-16 21:38:30,368 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [692 Valid, 1499 Invalid, 864 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 864 Invalid, 0 Unknown, 0 Unchecked, 0.4s Time] [2025-03-16 21:38:30,369 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 556 states. [2025-03-16 21:38:30,374 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 556 to 555. [2025-03-16 21:38:30,374 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 555 states, 550 states have (on average 1.4381818181818182) internal successors, (791), 550 states have internal predecessors, (791), 3 states have call successors, (3), 1 states have call predecessors, (3), 1 states have return successors, (3), 3 states have call predecessors, (3), 3 states have call successors, (3) [2025-03-16 21:38:30,375 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 555 states to 555 states and 797 transitions. [2025-03-16 21:38:30,375 INFO L78 Accepts]: Start accepts. Automaton has 555 states and 797 transitions. Word has length 176 [2025-03-16 21:38:30,375 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-16 21:38:30,375 INFO L471 AbstractCegarLoop]: Abstraction has 555 states and 797 transitions. [2025-03-16 21:38:30,376 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 32.8) internal successors, (164), 5 states have internal predecessors, (164), 1 states have call successors, (3), 1 states have call predecessors, (3), 1 states have return successors, (3), 1 states have call predecessors, (3), 1 states have call successors, (3) [2025-03-16 21:38:30,376 INFO L276 IsEmpty]: Start isEmpty. Operand 555 states and 797 transitions. [2025-03-16 21:38:30,376 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 178 [2025-03-16 21:38:30,376 INFO L210 NwaCegarLoop]: Found error trace [2025-03-16 21:38:30,376 INFO L218 NwaCegarLoop]: trace histogram [3, 3, 3, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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-03-16 21:38:30,376 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable29 [2025-03-16 21:38:30,376 INFO L396 AbstractCegarLoop]: === Iteration 31 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-03-16 21:38:30,377 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-16 21:38:30,377 INFO L85 PathProgramCache]: Analyzing trace with hash -911707707, now seen corresponding path program 1 times [2025-03-16 21:38:30,377 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-16 21:38:30,377 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [496609070] [2025-03-16 21:38:30,377 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-16 21:38:30,377 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-16 21:38:30,406 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 177 statements into 1 equivalence classes. [2025-03-16 21:38:30,480 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 177 of 177 statements. [2025-03-16 21:38:30,480 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-16 21:38:30,480 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-16 21:38:30,833 INFO L134 CoverageAnalysis]: Checked inductivity of 12 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 12 trivial. 0 not checked. [2025-03-16 21:38:30,833 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-16 21:38:30,833 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [496609070] [2025-03-16 21:38:30,833 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [496609070] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-16 21:38:30,834 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-16 21:38:30,834 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2025-03-16 21:38:30,834 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1603431256] [2025-03-16 21:38:30,834 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-16 21:38:30,834 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2025-03-16 21:38:30,835 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-16 21:38:30,835 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2025-03-16 21:38:30,835 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=12, Invalid=18, Unknown=0, NotChecked=0, Total=30 [2025-03-16 21:38:30,835 INFO L87 Difference]: Start difference. First operand 555 states and 797 transitions. Second operand has 6 states, 6 states have (on average 27.5) internal successors, (165), 6 states have internal predecessors, (165), 1 states have call successors, (3), 1 states have call predecessors, (3), 1 states have return successors, (3), 1 states have call predecessors, (3), 1 states have call successors, (3) [2025-03-16 21:38:31,401 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-16 21:38:31,401 INFO L93 Difference]: Finished difference Result 1459 states and 2086 transitions. [2025-03-16 21:38:31,402 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2025-03-16 21:38:31,402 INFO L78 Accepts]: Start accepts. Automaton has has 6 states, 6 states have (on average 27.5) internal successors, (165), 6 states have internal predecessors, (165), 1 states have call successors, (3), 1 states have call predecessors, (3), 1 states have return successors, (3), 1 states have call predecessors, (3), 1 states have call successors, (3) Word has length 177 [2025-03-16 21:38:31,402 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-16 21:38:31,404 INFO L225 Difference]: With dead ends: 1459 [2025-03-16 21:38:31,404 INFO L226 Difference]: Without dead ends: 1005 [2025-03-16 21:38:31,405 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 9 GetRequests, 4 SyntacticMatches, 0 SemanticMatches, 5 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 2 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=18, Invalid=24, Unknown=0, NotChecked=0, Total=42 [2025-03-16 21:38:31,405 INFO L435 NwaCegarLoop]: 1027 mSDtfsCounter, 1939 mSDsluCounter, 1381 mSDsCounter, 0 mSdLazyCounter, 1235 mSolverCounterSat, 3 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.4s Time, 0 mProtectedPredicate, 0 mProtectedAction, 1942 SdHoareTripleChecker+Valid, 2408 SdHoareTripleChecker+Invalid, 1238 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 3 IncrementalHoareTripleChecker+Valid, 1235 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.5s IncrementalHoareTripleChecker+Time [2025-03-16 21:38:31,405 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [1942 Valid, 2408 Invalid, 1238 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [3 Valid, 1235 Invalid, 0 Unknown, 0 Unchecked, 0.5s Time] [2025-03-16 21:38:31,406 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1005 states. [2025-03-16 21:38:31,418 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1005 to 1003. [2025-03-16 21:38:31,419 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 1003 states, 995 states have (on average 1.4331658291457285) internal successors, (1426), 995 states have internal predecessors, (1426), 6 states have call successors, (6), 1 states have call predecessors, (6), 1 states have return successors, (6), 6 states have call predecessors, (6), 6 states have call successors, (6) [2025-03-16 21:38:31,420 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1003 states to 1003 states and 1438 transitions. [2025-03-16 21:38:31,420 INFO L78 Accepts]: Start accepts. Automaton has 1003 states and 1438 transitions. Word has length 177 [2025-03-16 21:38:31,420 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-16 21:38:31,420 INFO L471 AbstractCegarLoop]: Abstraction has 1003 states and 1438 transitions. [2025-03-16 21:38:31,420 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 6 states have (on average 27.5) internal successors, (165), 6 states have internal predecessors, (165), 1 states have call successors, (3), 1 states have call predecessors, (3), 1 states have return successors, (3), 1 states have call predecessors, (3), 1 states have call successors, (3) [2025-03-16 21:38:31,420 INFO L276 IsEmpty]: Start isEmpty. Operand 1003 states and 1438 transitions. [2025-03-16 21:38:31,421 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 178 [2025-03-16 21:38:31,421 INFO L210 NwaCegarLoop]: Found error trace [2025-03-16 21:38:31,421 INFO L218 NwaCegarLoop]: trace histogram [3, 3, 3, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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-03-16 21:38:31,421 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable30 [2025-03-16 21:38:31,421 INFO L396 AbstractCegarLoop]: === Iteration 32 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-03-16 21:38:31,422 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-16 21:38:31,422 INFO L85 PathProgramCache]: Analyzing trace with hash -1805615693, now seen corresponding path program 1 times [2025-03-16 21:38:31,422 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-16 21:38:31,422 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1305790063] [2025-03-16 21:38:31,422 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-16 21:38:31,422 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-16 21:38:31,450 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 177 statements into 1 equivalence classes. [2025-03-16 21:38:31,521 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 177 of 177 statements. [2025-03-16 21:38:31,522 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-16 21:38:31,522 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-16 21:38:31,634 INFO L134 CoverageAnalysis]: Checked inductivity of 12 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 12 trivial. 0 not checked. [2025-03-16 21:38:31,634 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-16 21:38:31,634 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1305790063] [2025-03-16 21:38:31,634 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1305790063] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-16 21:38:31,634 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-16 21:38:31,634 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2025-03-16 21:38:31,634 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1853707414] [2025-03-16 21:38:31,634 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-16 21:38:31,635 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2025-03-16 21:38:31,636 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-16 21:38:31,636 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2025-03-16 21:38:31,636 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2025-03-16 21:38:31,636 INFO L87 Difference]: Start difference. First operand 1003 states and 1438 transitions. Second operand has 4 states, 4 states have (on average 41.25) internal successors, (165), 4 states have internal predecessors, (165), 1 states have call successors, (3), 1 states have call predecessors, (3), 1 states have return successors, (3), 1 states have call predecessors, (3), 1 states have call successors, (3) [2025-03-16 21:38:31,833 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-16 21:38:31,833 INFO L93 Difference]: Finished difference Result 1905 states and 2725 transitions. [2025-03-16 21:38:31,833 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2025-03-16 21:38:31,833 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 4 states have (on average 41.25) internal successors, (165), 4 states have internal predecessors, (165), 1 states have call successors, (3), 1 states have call predecessors, (3), 1 states have return successors, (3), 1 states have call predecessors, (3), 1 states have call successors, (3) Word has length 177 [2025-03-16 21:38:31,833 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-16 21:38:31,835 INFO L225 Difference]: With dead ends: 1905 [2025-03-16 21:38:31,836 INFO L226 Difference]: Without dead ends: 1003 [2025-03-16 21:38:31,836 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 5 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=9, Invalid=11, Unknown=0, NotChecked=0, Total=20 [2025-03-16 21:38:31,837 INFO L435 NwaCegarLoop]: 627 mSDtfsCounter, 675 mSDsluCounter, 628 mSDsCounter, 0 mSdLazyCounter, 326 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 675 SdHoareTripleChecker+Valid, 1255 SdHoareTripleChecker+Invalid, 326 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 326 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.2s IncrementalHoareTripleChecker+Time [2025-03-16 21:38:31,837 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [675 Valid, 1255 Invalid, 326 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 326 Invalid, 0 Unknown, 0 Unchecked, 0.2s Time] [2025-03-16 21:38:31,839 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1003 states. [2025-03-16 21:38:31,850 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1003 to 1003. [2025-03-16 21:38:31,851 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 1003 states, 995 states have (on average 1.4311557788944724) internal successors, (1424), 995 states have internal predecessors, (1424), 6 states have call successors, (6), 1 states have call predecessors, (6), 1 states have return successors, (6), 6 states have call predecessors, (6), 6 states have call successors, (6) [2025-03-16 21:38:31,852 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1003 states to 1003 states and 1436 transitions. [2025-03-16 21:38:31,852 INFO L78 Accepts]: Start accepts. Automaton has 1003 states and 1436 transitions. Word has length 177 [2025-03-16 21:38:31,853 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-16 21:38:31,853 INFO L471 AbstractCegarLoop]: Abstraction has 1003 states and 1436 transitions. [2025-03-16 21:38:31,853 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 41.25) internal successors, (165), 4 states have internal predecessors, (165), 1 states have call successors, (3), 1 states have call predecessors, (3), 1 states have return successors, (3), 1 states have call predecessors, (3), 1 states have call successors, (3) [2025-03-16 21:38:31,853 INFO L276 IsEmpty]: Start isEmpty. Operand 1003 states and 1436 transitions. [2025-03-16 21:38:31,854 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 179 [2025-03-16 21:38:31,854 INFO L210 NwaCegarLoop]: Found error trace [2025-03-16 21:38:31,854 INFO L218 NwaCegarLoop]: trace histogram [3, 3, 3, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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-03-16 21:38:31,854 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable31 [2025-03-16 21:38:31,854 INFO L396 AbstractCegarLoop]: === Iteration 33 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-03-16 21:38:31,854 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-16 21:38:31,854 INFO L85 PathProgramCache]: Analyzing trace with hash 587501139, now seen corresponding path program 1 times [2025-03-16 21:38:31,855 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-16 21:38:31,855 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1320762087] [2025-03-16 21:38:31,855 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-16 21:38:31,855 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-16 21:38:31,882 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 178 statements into 1 equivalence classes. [2025-03-16 21:38:31,933 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 178 of 178 statements. [2025-03-16 21:38:31,933 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-16 21:38:31,933 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-16 21:38:32,121 INFO L134 CoverageAnalysis]: Checked inductivity of 12 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 12 trivial. 0 not checked. [2025-03-16 21:38:32,121 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-16 21:38:32,121 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1320762087] [2025-03-16 21:38:32,121 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1320762087] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-16 21:38:32,122 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-16 21:38:32,122 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2025-03-16 21:38:32,122 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [532743324] [2025-03-16 21:38:32,122 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-16 21:38:32,122 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2025-03-16 21:38:32,122 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-16 21:38:32,122 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2025-03-16 21:38:32,123 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=8, Invalid=12, Unknown=0, NotChecked=0, Total=20 [2025-03-16 21:38:32,123 INFO L87 Difference]: Start difference. First operand 1003 states and 1436 transitions. Second operand has 5 states, 5 states have (on average 33.2) internal successors, (166), 5 states have internal predecessors, (166), 1 states have call successors, (3), 1 states have call predecessors, (3), 1 states have return successors, (3), 1 states have call predecessors, (3), 1 states have call successors, (3) [2025-03-16 21:38:32,326 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-16 21:38:32,326 INFO L93 Difference]: Finished difference Result 1905 states and 2721 transitions. [2025-03-16 21:38:32,326 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2025-03-16 21:38:32,327 INFO L78 Accepts]: Start accepts. Automaton has has 5 states, 5 states have (on average 33.2) internal successors, (166), 5 states have internal predecessors, (166), 1 states have call successors, (3), 1 states have call predecessors, (3), 1 states have return successors, (3), 1 states have call predecessors, (3), 1 states have call successors, (3) Word has length 178 [2025-03-16 21:38:32,327 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-16 21:38:32,329 INFO L225 Difference]: With dead ends: 1905 [2025-03-16 21:38:32,329 INFO L226 Difference]: Without dead ends: 1003 [2025-03-16 21:38:32,330 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 7 GetRequests, 3 SyntacticMatches, 0 SemanticMatches, 4 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=13, Invalid=17, Unknown=0, NotChecked=0, Total=30 [2025-03-16 21:38:32,330 INFO L435 NwaCegarLoop]: 627 mSDtfsCounter, 673 mSDsluCounter, 634 mSDsCounter, 0 mSdLazyCounter, 324 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 673 SdHoareTripleChecker+Valid, 1261 SdHoareTripleChecker+Invalid, 324 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 324 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.2s IncrementalHoareTripleChecker+Time [2025-03-16 21:38:32,330 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [673 Valid, 1261 Invalid, 324 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 324 Invalid, 0 Unknown, 0 Unchecked, 0.2s Time] [2025-03-16 21:38:32,331 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1003 states. [2025-03-16 21:38:32,341 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1003 to 1003. [2025-03-16 21:38:32,342 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 1003 states, 995 states have (on average 1.429145728643216) internal successors, (1422), 995 states have internal predecessors, (1422), 6 states have call successors, (6), 1 states have call predecessors, (6), 1 states have return successors, (6), 6 states have call predecessors, (6), 6 states have call successors, (6) [2025-03-16 21:38:32,343 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1003 states to 1003 states and 1434 transitions. [2025-03-16 21:38:32,343 INFO L78 Accepts]: Start accepts. Automaton has 1003 states and 1434 transitions. Word has length 178 [2025-03-16 21:38:32,343 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-16 21:38:32,344 INFO L471 AbstractCegarLoop]: Abstraction has 1003 states and 1434 transitions. [2025-03-16 21:38:32,344 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 33.2) internal successors, (166), 5 states have internal predecessors, (166), 1 states have call successors, (3), 1 states have call predecessors, (3), 1 states have return successors, (3), 1 states have call predecessors, (3), 1 states have call successors, (3) [2025-03-16 21:38:32,344 INFO L276 IsEmpty]: Start isEmpty. Operand 1003 states and 1434 transitions. [2025-03-16 21:38:32,344 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 180 [2025-03-16 21:38:32,345 INFO L210 NwaCegarLoop]: Found error trace [2025-03-16 21:38:32,345 INFO L218 NwaCegarLoop]: trace histogram [3, 3, 3, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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-03-16 21:38:32,345 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable32 [2025-03-16 21:38:32,345 INFO L396 AbstractCegarLoop]: === Iteration 34 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-03-16 21:38:32,345 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-16 21:38:32,345 INFO L85 PathProgramCache]: Analyzing trace with hash -1390143063, now seen corresponding path program 1 times [2025-03-16 21:38:32,345 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-16 21:38:32,345 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [939333785] [2025-03-16 21:38:32,346 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-16 21:38:32,346 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-16 21:38:32,375 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 179 statements into 1 equivalence classes. [2025-03-16 21:38:32,423 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 179 of 179 statements. [2025-03-16 21:38:32,423 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-16 21:38:32,423 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-16 21:38:32,678 INFO L134 CoverageAnalysis]: Checked inductivity of 12 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 12 trivial. 0 not checked. [2025-03-16 21:38:32,679 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-16 21:38:32,679 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [939333785] [2025-03-16 21:38:32,679 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [939333785] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-16 21:38:32,679 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-16 21:38:32,679 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2025-03-16 21:38:32,679 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1335049850] [2025-03-16 21:38:32,679 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-16 21:38:32,680 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2025-03-16 21:38:32,680 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-16 21:38:32,680 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2025-03-16 21:38:32,681 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=8, Invalid=12, Unknown=0, NotChecked=0, Total=20 [2025-03-16 21:38:32,681 INFO L87 Difference]: Start difference. First operand 1003 states and 1434 transitions. Second operand has 5 states, 5 states have (on average 33.4) internal successors, (167), 5 states have internal predecessors, (167), 1 states have call successors, (3), 1 states have call predecessors, (3), 1 states have return successors, (3), 1 states have call predecessors, (3), 1 states have call successors, (3) [2025-03-16 21:38:32,947 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-16 21:38:32,948 INFO L93 Difference]: Finished difference Result 1905 states and 2717 transitions. [2025-03-16 21:38:32,948 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2025-03-16 21:38:32,948 INFO L78 Accepts]: Start accepts. Automaton has has 5 states, 5 states have (on average 33.4) internal successors, (167), 5 states have internal predecessors, (167), 1 states have call successors, (3), 1 states have call predecessors, (3), 1 states have return successors, (3), 1 states have call predecessors, (3), 1 states have call successors, (3) Word has length 179 [2025-03-16 21:38:32,949 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-16 21:38:32,951 INFO L225 Difference]: With dead ends: 1905 [2025-03-16 21:38:32,951 INFO L226 Difference]: Without dead ends: 1003 [2025-03-16 21:38:32,952 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 7 GetRequests, 3 SyntacticMatches, 0 SemanticMatches, 4 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=13, Invalid=17, Unknown=0, NotChecked=0, Total=30 [2025-03-16 21:38:32,953 INFO L435 NwaCegarLoop]: 627 mSDtfsCounter, 672 mSDsluCounter, 634 mSDsCounter, 0 mSdLazyCounter, 322 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 672 SdHoareTripleChecker+Valid, 1261 SdHoareTripleChecker+Invalid, 322 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 322 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.2s IncrementalHoareTripleChecker+Time [2025-03-16 21:38:32,953 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [672 Valid, 1261 Invalid, 322 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 322 Invalid, 0 Unknown, 0 Unchecked, 0.2s Time] [2025-03-16 21:38:32,954 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1003 states. [2025-03-16 21:38:32,967 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1003 to 1003. [2025-03-16 21:38:32,968 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 1003 states, 995 states have (on average 1.4271356783919598) internal successors, (1420), 995 states have internal predecessors, (1420), 6 states have call successors, (6), 1 states have call predecessors, (6), 1 states have return successors, (6), 6 states have call predecessors, (6), 6 states have call successors, (6) [2025-03-16 21:38:32,969 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1003 states to 1003 states and 1432 transitions. [2025-03-16 21:38:32,969 INFO L78 Accepts]: Start accepts. Automaton has 1003 states and 1432 transitions. Word has length 179 [2025-03-16 21:38:32,969 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-16 21:38:32,969 INFO L471 AbstractCegarLoop]: Abstraction has 1003 states and 1432 transitions. [2025-03-16 21:38:32,970 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 33.4) internal successors, (167), 5 states have internal predecessors, (167), 1 states have call successors, (3), 1 states have call predecessors, (3), 1 states have return successors, (3), 1 states have call predecessors, (3), 1 states have call successors, (3) [2025-03-16 21:38:32,970 INFO L276 IsEmpty]: Start isEmpty. Operand 1003 states and 1432 transitions. [2025-03-16 21:38:32,970 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 181 [2025-03-16 21:38:32,970 INFO L210 NwaCegarLoop]: Found error trace [2025-03-16 21:38:32,970 INFO L218 NwaCegarLoop]: trace histogram [3, 3, 3, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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-03-16 21:38:32,971 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable33 [2025-03-16 21:38:32,971 INFO L396 AbstractCegarLoop]: === Iteration 35 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-03-16 21:38:32,971 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-16 21:38:32,971 INFO L85 PathProgramCache]: Analyzing trace with hash 256212706, now seen corresponding path program 1 times [2025-03-16 21:38:32,971 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-16 21:38:32,971 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [47410053] [2025-03-16 21:38:32,972 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-16 21:38:32,972 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-16 21:38:33,003 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 180 statements into 1 equivalence classes. [2025-03-16 21:38:33,076 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 180 of 180 statements. [2025-03-16 21:38:33,076 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-16 21:38:33,076 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-16 21:38:33,512 INFO L134 CoverageAnalysis]: Checked inductivity of 12 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 12 trivial. 0 not checked. [2025-03-16 21:38:33,512 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-16 21:38:33,512 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [47410053] [2025-03-16 21:38:33,512 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [47410053] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-16 21:38:33,512 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-16 21:38:33,512 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2025-03-16 21:38:33,512 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1841085930] [2025-03-16 21:38:33,512 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-16 21:38:33,513 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2025-03-16 21:38:33,513 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-16 21:38:33,513 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2025-03-16 21:38:33,513 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2025-03-16 21:38:33,513 INFO L87 Difference]: Start difference. First operand 1003 states and 1432 transitions. Second operand has 5 states, 5 states have (on average 33.6) internal successors, (168), 5 states have internal predecessors, (168), 1 states have call successors, (3), 1 states have call predecessors, (3), 1 states have return successors, (3), 1 states have call predecessors, (3), 1 states have call successors, (3) [2025-03-16 21:38:33,795 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-16 21:38:33,795 INFO L93 Difference]: Finished difference Result 2063 states and 2892 transitions. [2025-03-16 21:38:33,796 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2025-03-16 21:38:33,796 INFO L78 Accepts]: Start accepts. Automaton has has 5 states, 5 states have (on average 33.6) internal successors, (168), 5 states have internal predecessors, (168), 1 states have call successors, (3), 1 states have call predecessors, (3), 1 states have return successors, (3), 1 states have call predecessors, (3), 1 states have call successors, (3) Word has length 180 [2025-03-16 21:38:33,796 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-16 21:38:33,798 INFO L225 Difference]: With dead ends: 2063 [2025-03-16 21:38:33,798 INFO L226 Difference]: Without dead ends: 1161 [2025-03-16 21:38:33,800 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-03-16 21:38:33,801 INFO L435 NwaCegarLoop]: 649 mSDtfsCounter, 19 mSDsluCounter, 1939 mSDsCounter, 0 mSdLazyCounter, 559 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 19 SdHoareTripleChecker+Valid, 2588 SdHoareTripleChecker+Invalid, 559 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 559 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.3s IncrementalHoareTripleChecker+Time [2025-03-16 21:38:33,801 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [19 Valid, 2588 Invalid, 559 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 559 Invalid, 0 Unknown, 0 Unchecked, 0.3s Time] [2025-03-16 21:38:33,802 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1161 states. [2025-03-16 21:38:33,816 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1161 to 1157. [2025-03-16 21:38:33,817 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 1157 states, 1149 states have (on average 1.3846823324630113) internal successors, (1591), 1149 states have internal predecessors, (1591), 6 states have call successors, (6), 1 states have call predecessors, (6), 1 states have return successors, (6), 6 states have call predecessors, (6), 6 states have call successors, (6) [2025-03-16 21:38:33,818 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1157 states to 1157 states and 1603 transitions. [2025-03-16 21:38:33,818 INFO L78 Accepts]: Start accepts. Automaton has 1157 states and 1603 transitions. Word has length 180 [2025-03-16 21:38:33,819 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-16 21:38:33,819 INFO L471 AbstractCegarLoop]: Abstraction has 1157 states and 1603 transitions. [2025-03-16 21:38:33,819 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 33.6) internal successors, (168), 5 states have internal predecessors, (168), 1 states have call successors, (3), 1 states have call predecessors, (3), 1 states have return successors, (3), 1 states have call predecessors, (3), 1 states have call successors, (3) [2025-03-16 21:38:33,819 INFO L276 IsEmpty]: Start isEmpty. Operand 1157 states and 1603 transitions. [2025-03-16 21:38:33,820 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 182 [2025-03-16 21:38:33,820 INFO L210 NwaCegarLoop]: Found error trace [2025-03-16 21:38:33,820 INFO L218 NwaCegarLoop]: trace histogram [3, 3, 3, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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-03-16 21:38:33,820 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable34 [2025-03-16 21:38:33,820 INFO L396 AbstractCegarLoop]: === Iteration 36 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-03-16 21:38:33,821 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-16 21:38:33,821 INFO L85 PathProgramCache]: Analyzing trace with hash 1241022287, now seen corresponding path program 1 times [2025-03-16 21:38:33,821 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-16 21:38:33,821 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1146707808] [2025-03-16 21:38:33,821 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-16 21:38:33,821 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-16 21:38:33,907 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 181 statements into 1 equivalence classes. [2025-03-16 21:38:33,992 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 181 of 181 statements. [2025-03-16 21:38:33,992 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-16 21:38:33,993 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-16 21:38:34,264 INFO L134 CoverageAnalysis]: Checked inductivity of 12 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 12 trivial. 0 not checked. [2025-03-16 21:38:34,268 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-16 21:38:34,269 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1146707808] [2025-03-16 21:38:34,269 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1146707808] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-16 21:38:34,269 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-16 21:38:34,269 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2025-03-16 21:38:34,269 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [417271426] [2025-03-16 21:38:34,269 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-16 21:38:34,269 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 7 states [2025-03-16 21:38:34,269 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-16 21:38:34,270 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2025-03-16 21:38:34,270 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=11, Invalid=31, Unknown=0, NotChecked=0, Total=42 [2025-03-16 21:38:34,270 INFO L87 Difference]: Start difference. First operand 1157 states and 1603 transitions. Second operand has 7 states, 7 states have (on average 24.142857142857142) internal successors, (169), 7 states have internal predecessors, (169), 1 states have call successors, (3), 1 states have call predecessors, (3), 1 states have return successors, (3), 1 states have call predecessors, (3), 1 states have call successors, (3) [2025-03-16 21:38:34,779 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-16 21:38:34,779 INFO L93 Difference]: Finished difference Result 2361 states and 3265 transitions. [2025-03-16 21:38:34,779 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2025-03-16 21:38:34,780 INFO L78 Accepts]: Start accepts. Automaton has has 7 states, 7 states have (on average 24.142857142857142) internal successors, (169), 7 states have internal predecessors, (169), 1 states have call successors, (3), 1 states have call predecessors, (3), 1 states have return successors, (3), 1 states have call predecessors, (3), 1 states have call successors, (3) Word has length 181 [2025-03-16 21:38:34,780 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-16 21:38:34,782 INFO L225 Difference]: With dead ends: 2361 [2025-03-16 21:38:34,783 INFO L226 Difference]: Without dead ends: 1165 [2025-03-16 21:38:34,784 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 11 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 9 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 6 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=27, Invalid=83, Unknown=0, NotChecked=0, Total=110 [2025-03-16 21:38:34,784 INFO L435 NwaCegarLoop]: 647 mSDtfsCounter, 835 mSDsluCounter, 2434 mSDsCounter, 0 mSdLazyCounter, 921 mSolverCounterSat, 7 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.4s Time, 0 mProtectedPredicate, 0 mProtectedAction, 838 SdHoareTripleChecker+Valid, 3081 SdHoareTripleChecker+Invalid, 928 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 7 IncrementalHoareTripleChecker+Valid, 921 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.5s IncrementalHoareTripleChecker+Time [2025-03-16 21:38:34,784 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [838 Valid, 3081 Invalid, 928 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [7 Valid, 921 Invalid, 0 Unknown, 0 Unchecked, 0.5s Time] [2025-03-16 21:38:34,785 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1165 states. [2025-03-16 21:38:34,796 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1165 to 1161. [2025-03-16 21:38:34,797 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 1161 states, 1153 states have (on average 1.3816131830008673) internal successors, (1593), 1153 states have internal predecessors, (1593), 6 states have call successors, (6), 1 states have call predecessors, (6), 1 states have return successors, (6), 6 states have call predecessors, (6), 6 states have call successors, (6) [2025-03-16 21:38:34,798 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1161 states to 1161 states and 1605 transitions. [2025-03-16 21:38:34,798 INFO L78 Accepts]: Start accepts. Automaton has 1161 states and 1605 transitions. Word has length 181 [2025-03-16 21:38:34,799 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-16 21:38:34,799 INFO L471 AbstractCegarLoop]: Abstraction has 1161 states and 1605 transitions. [2025-03-16 21:38:34,799 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 7 states, 7 states have (on average 24.142857142857142) internal successors, (169), 7 states have internal predecessors, (169), 1 states have call successors, (3), 1 states have call predecessors, (3), 1 states have return successors, (3), 1 states have call predecessors, (3), 1 states have call successors, (3) [2025-03-16 21:38:34,799 INFO L276 IsEmpty]: Start isEmpty. Operand 1161 states and 1605 transitions. [2025-03-16 21:38:34,800 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 183 [2025-03-16 21:38:34,800 INFO L210 NwaCegarLoop]: Found error trace [2025-03-16 21:38:34,800 INFO L218 NwaCegarLoop]: trace histogram [3, 3, 3, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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-03-16 21:38:34,800 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable35 [2025-03-16 21:38:34,800 INFO L396 AbstractCegarLoop]: === Iteration 37 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-03-16 21:38:34,801 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-16 21:38:34,801 INFO L85 PathProgramCache]: Analyzing trace with hash -1662005937, now seen corresponding path program 1 times [2025-03-16 21:38:34,801 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-16 21:38:34,801 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1635493201] [2025-03-16 21:38:34,801 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-16 21:38:34,801 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-16 21:38:34,830 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 182 statements into 1 equivalence classes. [2025-03-16 21:38:34,915 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 182 of 182 statements. [2025-03-16 21:38:34,915 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-16 21:38:34,915 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-16 21:38:35,129 INFO L134 CoverageAnalysis]: Checked inductivity of 12 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 12 trivial. 0 not checked. [2025-03-16 21:38:35,130 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-16 21:38:35,130 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1635493201] [2025-03-16 21:38:35,130 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1635493201] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-16 21:38:35,130 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-16 21:38:35,130 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2025-03-16 21:38:35,130 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [637177798] [2025-03-16 21:38:35,130 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-16 21:38:35,130 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 7 states [2025-03-16 21:38:35,130 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-16 21:38:35,131 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2025-03-16 21:38:35,131 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=12, Invalid=30, Unknown=0, NotChecked=0, Total=42 [2025-03-16 21:38:35,131 INFO L87 Difference]: Start difference. First operand 1161 states and 1605 transitions. Second operand has 7 states, 7 states have (on average 24.285714285714285) internal successors, (170), 7 states have internal predecessors, (170), 2 states have call successors, (3), 1 states have call predecessors, (3), 1 states have return successors, (3), 2 states have call predecessors, (3), 2 states have call successors, (3) [2025-03-16 21:38:35,614 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-16 21:38:35,614 INFO L93 Difference]: Finished difference Result 2229 states and 3071 transitions. [2025-03-16 21:38:35,615 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2025-03-16 21:38:35,615 INFO L78 Accepts]: Start accepts. Automaton has has 7 states, 7 states have (on average 24.285714285714285) internal successors, (170), 7 states have internal predecessors, (170), 2 states have call successors, (3), 1 states have call predecessors, (3), 1 states have return successors, (3), 2 states have call predecessors, (3), 2 states have call successors, (3) Word has length 182 [2025-03-16 21:38:35,615 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-16 21:38:35,618 INFO L225 Difference]: With dead ends: 2229 [2025-03-16 21:38:35,618 INFO L226 Difference]: Without dead ends: 1169 [2025-03-16 21:38:35,619 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 10 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 8 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 6 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=27, Invalid=63, Unknown=0, NotChecked=0, Total=90 [2025-03-16 21:38:35,619 INFO L435 NwaCegarLoop]: 490 mSDtfsCounter, 1477 mSDsluCounter, 1462 mSDsCounter, 0 mSdLazyCounter, 1190 mSolverCounterSat, 3 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.4s Time, 0 mProtectedPredicate, 0 mProtectedAction, 1478 SdHoareTripleChecker+Valid, 1952 SdHoareTripleChecker+Invalid, 1193 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 3 IncrementalHoareTripleChecker+Valid, 1190 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.4s IncrementalHoareTripleChecker+Time [2025-03-16 21:38:35,620 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [1478 Valid, 1952 Invalid, 1193 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [3 Valid, 1190 Invalid, 0 Unknown, 0 Unchecked, 0.4s Time] [2025-03-16 21:38:35,620 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1169 states. [2025-03-16 21:38:35,631 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1169 to 1165. [2025-03-16 21:38:35,632 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 1165 states, 1157 states have (on average 1.3785652549697494) internal successors, (1595), 1157 states have internal predecessors, (1595), 6 states have call successors, (6), 1 states have call predecessors, (6), 1 states have return successors, (6), 6 states have call predecessors, (6), 6 states have call successors, (6) [2025-03-16 21:38:35,633 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1165 states to 1165 states and 1607 transitions. [2025-03-16 21:38:35,634 INFO L78 Accepts]: Start accepts. Automaton has 1165 states and 1607 transitions. Word has length 182 [2025-03-16 21:38:35,634 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-16 21:38:35,634 INFO L471 AbstractCegarLoop]: Abstraction has 1165 states and 1607 transitions. [2025-03-16 21:38:35,634 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 7 states, 7 states have (on average 24.285714285714285) internal successors, (170), 7 states have internal predecessors, (170), 2 states have call successors, (3), 1 states have call predecessors, (3), 1 states have return successors, (3), 2 states have call predecessors, (3), 2 states have call successors, (3) [2025-03-16 21:38:35,635 INFO L276 IsEmpty]: Start isEmpty. Operand 1165 states and 1607 transitions. [2025-03-16 21:38:35,635 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 184 [2025-03-16 21:38:35,636 INFO L210 NwaCegarLoop]: Found error trace [2025-03-16 21:38:35,636 INFO L218 NwaCegarLoop]: trace histogram [3, 3, 3, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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-03-16 21:38:35,636 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable36 [2025-03-16 21:38:35,636 INFO L396 AbstractCegarLoop]: === Iteration 38 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-03-16 21:38:35,637 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-16 21:38:35,639 INFO L85 PathProgramCache]: Analyzing trace with hash -1554093188, now seen corresponding path program 1 times [2025-03-16 21:38:35,639 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-16 21:38:35,639 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [759973257] [2025-03-16 21:38:35,639 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-16 21:38:35,639 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-16 21:38:35,670 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 183 statements into 1 equivalence classes. [2025-03-16 21:38:35,781 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 183 of 183 statements. [2025-03-16 21:38:35,782 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-16 21:38:35,782 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-16 21:38:36,093 INFO L134 CoverageAnalysis]: Checked inductivity of 12 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 12 trivial. 0 not checked. [2025-03-16 21:38:36,093 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-16 21:38:36,094 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [759973257] [2025-03-16 21:38:36,094 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [759973257] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-16 21:38:36,094 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-16 21:38:36,094 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2025-03-16 21:38:36,094 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1533978728] [2025-03-16 21:38:36,094 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-16 21:38:36,094 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2025-03-16 21:38:36,094 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-16 21:38:36,095 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2025-03-16 21:38:36,095 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=9, Invalid=21, Unknown=0, NotChecked=0, Total=30 [2025-03-16 21:38:36,095 INFO L87 Difference]: Start difference. First operand 1165 states and 1607 transitions. Second operand has 6 states, 6 states have (on average 28.5) internal successors, (171), 6 states have internal predecessors, (171), 1 states have call successors, (3), 1 states have call predecessors, (3), 1 states have return successors, (3), 1 states have call predecessors, (3), 1 states have call successors, (3) [2025-03-16 21:38:36,614 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-16 21:38:36,614 INFO L93 Difference]: Finished difference Result 2233 states and 3069 transitions. [2025-03-16 21:38:36,614 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2025-03-16 21:38:36,614 INFO L78 Accepts]: Start accepts. Automaton has has 6 states, 6 states have (on average 28.5) internal successors, (171), 6 states have internal predecessors, (171), 1 states have call successors, (3), 1 states have call predecessors, (3), 1 states have return successors, (3), 1 states have call predecessors, (3), 1 states have call successors, (3) Word has length 183 [2025-03-16 21:38:36,614 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-16 21:38:36,617 INFO L225 Difference]: With dead ends: 2233 [2025-03-16 21:38:36,617 INFO L226 Difference]: Without dead ends: 1169 [2025-03-16 21:38:36,618 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 10 GetRequests, 3 SyntacticMatches, 0 SemanticMatches, 7 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 3 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=21, Invalid=51, Unknown=0, NotChecked=0, Total=72 [2025-03-16 21:38:36,619 INFO L435 NwaCegarLoop]: 490 mSDtfsCounter, 730 mSDsluCounter, 1462 mSDsCounter, 0 mSdLazyCounter, 1190 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.4s Time, 0 mProtectedPredicate, 0 mProtectedAction, 733 SdHoareTripleChecker+Valid, 1952 SdHoareTripleChecker+Invalid, 1190 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 1190 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.5s IncrementalHoareTripleChecker+Time [2025-03-16 21:38:36,619 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [733 Valid, 1952 Invalid, 1190 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 1190 Invalid, 0 Unknown, 0 Unchecked, 0.5s Time] [2025-03-16 21:38:36,620 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1169 states. [2025-03-16 21:38:36,631 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1169 to 1167. [2025-03-16 21:38:36,633 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 1167 states, 1159 states have (on average 1.377911993097498) internal successors, (1597), 1159 states have internal predecessors, (1597), 6 states have call successors, (6), 1 states have call predecessors, (6), 1 states have return successors, (6), 6 states have call predecessors, (6), 6 states have call successors, (6) [2025-03-16 21:38:36,634 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1167 states to 1167 states and 1609 transitions. [2025-03-16 21:38:36,634 INFO L78 Accepts]: Start accepts. Automaton has 1167 states and 1609 transitions. Word has length 183 [2025-03-16 21:38:36,634 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-16 21:38:36,634 INFO L471 AbstractCegarLoop]: Abstraction has 1167 states and 1609 transitions. [2025-03-16 21:38:36,634 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 6 states have (on average 28.5) internal successors, (171), 6 states have internal predecessors, (171), 1 states have call successors, (3), 1 states have call predecessors, (3), 1 states have return successors, (3), 1 states have call predecessors, (3), 1 states have call successors, (3) [2025-03-16 21:38:36,635 INFO L276 IsEmpty]: Start isEmpty. Operand 1167 states and 1609 transitions. [2025-03-16 21:38:36,635 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 185 [2025-03-16 21:38:36,636 INFO L210 NwaCegarLoop]: Found error trace [2025-03-16 21:38:36,636 INFO L218 NwaCegarLoop]: trace histogram [3, 3, 3, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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-03-16 21:38:36,636 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable37 [2025-03-16 21:38:36,636 INFO L396 AbstractCegarLoop]: === Iteration 39 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-03-16 21:38:36,636 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-16 21:38:36,636 INFO L85 PathProgramCache]: Analyzing trace with hash 559965933, now seen corresponding path program 1 times [2025-03-16 21:38:36,637 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-16 21:38:36,637 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [767246770] [2025-03-16 21:38:36,637 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-16 21:38:36,637 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-16 21:38:36,668 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 184 statements into 1 equivalence classes. [2025-03-16 21:38:36,762 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 184 of 184 statements. [2025-03-16 21:38:36,763 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-16 21:38:36,763 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-16 21:38:37,103 INFO L134 CoverageAnalysis]: Checked inductivity of 12 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 12 trivial. 0 not checked. [2025-03-16 21:38:37,104 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-16 21:38:37,104 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [767246770] [2025-03-16 21:38:37,104 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [767246770] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-16 21:38:37,104 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-16 21:38:37,104 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [8] imperfect sequences [] total 8 [2025-03-16 21:38:37,104 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [55135442] [2025-03-16 21:38:37,104 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-16 21:38:37,104 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 8 states [2025-03-16 21:38:37,105 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-16 21:38:37,105 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2025-03-16 21:38:37,105 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=17, Invalid=39, Unknown=0, NotChecked=0, Total=56 [2025-03-16 21:38:37,105 INFO L87 Difference]: Start difference. First operand 1167 states and 1609 transitions. Second operand has 8 states, 8 states have (on average 21.5) internal successors, (172), 8 states have internal predecessors, (172), 2 states have call successors, (3), 1 states have call predecessors, (3), 1 states have return successors, (3), 2 states have call predecessors, (3), 2 states have call successors, (3) [2025-03-16 21:38:38,144 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-16 21:38:38,144 INFO L93 Difference]: Finished difference Result 3303 states and 4534 transitions. [2025-03-16 21:38:38,144 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 11 states. [2025-03-16 21:38:38,144 INFO L78 Accepts]: Start accepts. Automaton has has 8 states, 8 states have (on average 21.5) internal successors, (172), 8 states have internal predecessors, (172), 2 states have call successors, (3), 1 states have call predecessors, (3), 1 states have return successors, (3), 2 states have call predecessors, (3), 2 states have call successors, (3) Word has length 184 [2025-03-16 21:38:38,145 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-16 21:38:38,151 INFO L225 Difference]: With dead ends: 3303 [2025-03-16 21:38:38,151 INFO L226 Difference]: Without dead ends: 2237 [2025-03-16 21:38:38,152 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 14 GetRequests, 4 SyntacticMatches, 0 SemanticMatches, 10 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 10 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=37, Invalid=95, Unknown=0, NotChecked=0, Total=132 [2025-03-16 21:38:38,155 INFO L435 NwaCegarLoop]: 1009 mSDtfsCounter, 1314 mSDsluCounter, 4321 mSDsCounter, 0 mSdLazyCounter, 2487 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.8s Time, 0 mProtectedPredicate, 0 mProtectedAction, 1317 SdHoareTripleChecker+Valid, 5330 SdHoareTripleChecker+Invalid, 2487 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 2487 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 1.0s IncrementalHoareTripleChecker+Time [2025-03-16 21:38:38,155 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [1317 Valid, 5330 Invalid, 2487 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 2487 Invalid, 0 Unknown, 0 Unchecked, 1.0s Time] [2025-03-16 21:38:38,156 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 2237 states. [2025-03-16 21:38:38,183 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 2237 to 1168. [2025-03-16 21:38:38,184 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 1168 states, 1160 states have (on average 1.3784482758620689) internal successors, (1599), 1160 states have internal predecessors, (1599), 6 states have call successors, (6), 1 states have call predecessors, (6), 1 states have return successors, (6), 6 states have call predecessors, (6), 6 states have call successors, (6) [2025-03-16 21:38:38,185 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1168 states to 1168 states and 1611 transitions. [2025-03-16 21:38:38,186 INFO L78 Accepts]: Start accepts. Automaton has 1168 states and 1611 transitions. Word has length 184 [2025-03-16 21:38:38,186 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-16 21:38:38,186 INFO L471 AbstractCegarLoop]: Abstraction has 1168 states and 1611 transitions. [2025-03-16 21:38:38,186 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 8 states, 8 states have (on average 21.5) internal successors, (172), 8 states have internal predecessors, (172), 2 states have call successors, (3), 1 states have call predecessors, (3), 1 states have return successors, (3), 2 states have call predecessors, (3), 2 states have call successors, (3) [2025-03-16 21:38:38,186 INFO L276 IsEmpty]: Start isEmpty. Operand 1168 states and 1611 transitions. [2025-03-16 21:38:38,187 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 186 [2025-03-16 21:38:38,187 INFO L210 NwaCegarLoop]: Found error trace [2025-03-16 21:38:38,188 INFO L218 NwaCegarLoop]: trace histogram [3, 3, 3, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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-03-16 21:38:38,188 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable38 [2025-03-16 21:38:38,188 INFO L396 AbstractCegarLoop]: === Iteration 40 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-03-16 21:38:38,188 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-16 21:38:38,188 INFO L85 PathProgramCache]: Analyzing trace with hash -1185971981, now seen corresponding path program 1 times [2025-03-16 21:38:38,188 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-16 21:38:38,188 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1475679341] [2025-03-16 21:38:38,189 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-16 21:38:38,189 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-16 21:38:38,225 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 185 statements into 1 equivalence classes. [2025-03-16 21:38:38,407 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 185 of 185 statements. [2025-03-16 21:38:38,408 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-16 21:38:38,408 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-16 21:38:38,820 INFO L134 CoverageAnalysis]: Checked inductivity of 12 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 12 trivial. 0 not checked. [2025-03-16 21:38:38,820 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-16 21:38:38,820 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1475679341] [2025-03-16 21:38:38,820 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1475679341] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-16 21:38:38,820 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-16 21:38:38,820 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [8] imperfect sequences [] total 8 [2025-03-16 21:38:38,820 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [20127583] [2025-03-16 21:38:38,820 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-16 21:38:38,821 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 8 states [2025-03-16 21:38:38,821 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-16 21:38:38,821 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2025-03-16 21:38:38,821 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=18, Invalid=38, Unknown=0, NotChecked=0, Total=56 [2025-03-16 21:38:38,821 INFO L87 Difference]: Start difference. First operand 1168 states and 1611 transitions. Second operand has 8 states, 8 states have (on average 21.625) internal successors, (173), 8 states have internal predecessors, (173), 2 states have call successors, (3), 1 states have call predecessors, (3), 1 states have return successors, (3), 2 states have call predecessors, (3), 2 states have call successors, (3) [2025-03-16 21:38:39,396 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-16 21:38:39,397 INFO L93 Difference]: Finished difference Result 2251 states and 3095 transitions. [2025-03-16 21:38:39,397 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2025-03-16 21:38:39,397 INFO L78 Accepts]: Start accepts. Automaton has has 8 states, 8 states have (on average 21.625) internal successors, (173), 8 states have internal predecessors, (173), 2 states have call successors, (3), 1 states have call predecessors, (3), 1 states have return successors, (3), 2 states have call predecessors, (3), 2 states have call successors, (3) Word has length 185 [2025-03-16 21:38:39,397 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-16 21:38:39,399 INFO L225 Difference]: With dead ends: 2251 [2025-03-16 21:38:39,399 INFO L226 Difference]: Without dead ends: 1184 [2025-03-16 21:38:39,400 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 8 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 6 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=18, Invalid=38, Unknown=0, NotChecked=0, Total=56 [2025-03-16 21:38:39,400 INFO L435 NwaCegarLoop]: 494 mSDtfsCounter, 775 mSDsluCounter, 2439 mSDsCounter, 0 mSdLazyCounter, 1766 mSolverCounterSat, 3 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.5s Time, 0 mProtectedPredicate, 0 mProtectedAction, 777 SdHoareTripleChecker+Valid, 2933 SdHoareTripleChecker+Invalid, 1769 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 3 IncrementalHoareTripleChecker+Valid, 1766 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.6s IncrementalHoareTripleChecker+Time [2025-03-16 21:38:39,400 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [777 Valid, 2933 Invalid, 1769 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [3 Valid, 1766 Invalid, 0 Unknown, 0 Unchecked, 0.6s Time] [2025-03-16 21:38:39,401 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1184 states. [2025-03-16 21:38:39,411 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1184 to 1178. [2025-03-16 21:38:39,411 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 1178 states, 1170 states have (on average 1.3786324786324786) internal successors, (1613), 1170 states have internal predecessors, (1613), 6 states have call successors, (6), 1 states have call predecessors, (6), 1 states have return successors, (6), 6 states have call predecessors, (6), 6 states have call successors, (6) [2025-03-16 21:38:39,412 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1178 states to 1178 states and 1625 transitions. [2025-03-16 21:38:39,412 INFO L78 Accepts]: Start accepts. Automaton has 1178 states and 1625 transitions. Word has length 185 [2025-03-16 21:38:39,413 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-16 21:38:39,413 INFO L471 AbstractCegarLoop]: Abstraction has 1178 states and 1625 transitions. [2025-03-16 21:38:39,413 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 8 states, 8 states have (on average 21.625) internal successors, (173), 8 states have internal predecessors, (173), 2 states have call successors, (3), 1 states have call predecessors, (3), 1 states have return successors, (3), 2 states have call predecessors, (3), 2 states have call successors, (3) [2025-03-16 21:38:39,413 INFO L276 IsEmpty]: Start isEmpty. Operand 1178 states and 1625 transitions. [2025-03-16 21:38:39,414 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 187 [2025-03-16 21:38:39,414 INFO L210 NwaCegarLoop]: Found error trace [2025-03-16 21:38:39,414 INFO L218 NwaCegarLoop]: trace histogram [3, 3, 3, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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-03-16 21:38:39,414 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable39 [2025-03-16 21:38:39,414 INFO L396 AbstractCegarLoop]: === Iteration 41 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-03-16 21:38:39,414 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-16 21:38:39,414 INFO L85 PathProgramCache]: Analyzing trace with hash -1859418639, now seen corresponding path program 1 times [2025-03-16 21:38:39,414 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-16 21:38:39,414 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [196564419] [2025-03-16 21:38:39,414 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-16 21:38:39,414 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-16 21:38:39,444 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 186 statements into 1 equivalence classes. [2025-03-16 21:38:39,546 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 186 of 186 statements. [2025-03-16 21:38:39,546 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-16 21:38:39,547 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-16 21:38:39,809 INFO L134 CoverageAnalysis]: Checked inductivity of 12 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 12 trivial. 0 not checked. [2025-03-16 21:38:39,809 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-16 21:38:39,809 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [196564419] [2025-03-16 21:38:39,810 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [196564419] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-16 21:38:39,810 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-16 21:38:39,810 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2025-03-16 21:38:39,810 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1112635307] [2025-03-16 21:38:39,810 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-16 21:38:39,810 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2025-03-16 21:38:39,810 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-16 21:38:39,811 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2025-03-16 21:38:39,811 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=9, Invalid=21, Unknown=0, NotChecked=0, Total=30 [2025-03-16 21:38:39,811 INFO L87 Difference]: Start difference. First operand 1178 states and 1625 transitions. Second operand has 6 states, 6 states have (on average 29.0) internal successors, (174), 6 states have internal predecessors, (174), 2 states have call successors, (3), 1 states have call predecessors, (3), 1 states have return successors, (3), 2 states have call predecessors, (3), 2 states have call successors, (3) [2025-03-16 21:38:40,304 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-16 21:38:40,305 INFO L93 Difference]: Finished difference Result 2263 states and 3111 transitions. [2025-03-16 21:38:40,305 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2025-03-16 21:38:40,306 INFO L78 Accepts]: Start accepts. Automaton has has 6 states, 6 states have (on average 29.0) internal successors, (174), 6 states have internal predecessors, (174), 2 states have call successors, (3), 1 states have call predecessors, (3), 1 states have return successors, (3), 2 states have call predecessors, (3), 2 states have call successors, (3) Word has length 186 [2025-03-16 21:38:40,306 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-16 21:38:40,308 INFO L225 Difference]: With dead ends: 2263 [2025-03-16 21:38:40,309 INFO L226 Difference]: Without dead ends: 1186 [2025-03-16 21:38:40,310 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 10 GetRequests, 3 SyntacticMatches, 0 SemanticMatches, 7 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 3 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=21, Invalid=51, Unknown=0, NotChecked=0, Total=72 [2025-03-16 21:38:40,310 INFO L435 NwaCegarLoop]: 489 mSDtfsCounter, 716 mSDsluCounter, 1459 mSDsCounter, 0 mSdLazyCounter, 1190 mSolverCounterSat, 2 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.4s Time, 0 mProtectedPredicate, 0 mProtectedAction, 718 SdHoareTripleChecker+Valid, 1948 SdHoareTripleChecker+Invalid, 1192 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 2 IncrementalHoareTripleChecker+Valid, 1190 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.5s IncrementalHoareTripleChecker+Time [2025-03-16 21:38:40,310 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [718 Valid, 1948 Invalid, 1192 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [2 Valid, 1190 Invalid, 0 Unknown, 0 Unchecked, 0.5s Time] [2025-03-16 21:38:40,311 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1186 states. [2025-03-16 21:38:40,320 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1186 to 1174. [2025-03-16 21:38:40,321 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 1174 states, 1166 states have (on average 1.3747855917667238) internal successors, (1603), 1166 states have internal predecessors, (1603), 6 states have call successors, (6), 1 states have call predecessors, (6), 1 states have return successors, (6), 6 states have call predecessors, (6), 6 states have call successors, (6) [2025-03-16 21:38:40,322 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1174 states to 1174 states and 1615 transitions. [2025-03-16 21:38:40,322 INFO L78 Accepts]: Start accepts. Automaton has 1174 states and 1615 transitions. Word has length 186 [2025-03-16 21:38:40,322 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-16 21:38:40,322 INFO L471 AbstractCegarLoop]: Abstraction has 1174 states and 1615 transitions. [2025-03-16 21:38:40,322 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 6 states have (on average 29.0) internal successors, (174), 6 states have internal predecessors, (174), 2 states have call successors, (3), 1 states have call predecessors, (3), 1 states have return successors, (3), 2 states have call predecessors, (3), 2 states have call successors, (3) [2025-03-16 21:38:40,322 INFO L276 IsEmpty]: Start isEmpty. Operand 1174 states and 1615 transitions. [2025-03-16 21:38:40,323 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 188 [2025-03-16 21:38:40,323 INFO L210 NwaCegarLoop]: Found error trace [2025-03-16 21:38:40,323 INFO L218 NwaCegarLoop]: trace histogram [3, 3, 3, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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-03-16 21:38:40,323 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable40 [2025-03-16 21:38:40,324 INFO L396 AbstractCegarLoop]: === Iteration 42 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-03-16 21:38:40,324 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-16 21:38:40,324 INFO L85 PathProgramCache]: Analyzing trace with hash 388318668, now seen corresponding path program 1 times [2025-03-16 21:38:40,324 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-16 21:38:40,324 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [602287292] [2025-03-16 21:38:40,324 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-16 21:38:40,324 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-16 21:38:40,356 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 187 statements into 1 equivalence classes. [2025-03-16 21:38:40,501 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 187 of 187 statements. [2025-03-16 21:38:40,501 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-16 21:38:40,501 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-16 21:38:40,951 INFO L134 CoverageAnalysis]: Checked inductivity of 12 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 12 trivial. 0 not checked. [2025-03-16 21:38:40,952 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-16 21:38:40,952 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [602287292] [2025-03-16 21:38:40,952 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [602287292] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-16 21:38:40,952 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-16 21:38:40,952 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2025-03-16 21:38:40,952 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1143160292] [2025-03-16 21:38:40,952 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-16 21:38:40,953 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 7 states [2025-03-16 21:38:40,953 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-16 21:38:40,953 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2025-03-16 21:38:40,953 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=11, Invalid=31, Unknown=0, NotChecked=0, Total=42 [2025-03-16 21:38:40,954 INFO L87 Difference]: Start difference. First operand 1174 states and 1615 transitions. Second operand has 7 states, 7 states have (on average 25.0) internal successors, (175), 7 states have internal predecessors, (175), 1 states have call successors, (3), 1 states have call predecessors, (3), 1 states have return successors, (3), 1 states have call predecessors, (3), 1 states have call successors, (3) [2025-03-16 21:38:41,332 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-16 21:38:41,332 INFO L93 Difference]: Finished difference Result 2676 states and 3596 transitions. [2025-03-16 21:38:41,332 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2025-03-16 21:38:41,332 INFO L78 Accepts]: Start accepts. Automaton has has 7 states, 7 states have (on average 25.0) internal successors, (175), 7 states have internal predecessors, (175), 1 states have call successors, (3), 1 states have call predecessors, (3), 1 states have return successors, (3), 1 states have call predecessors, (3), 1 states have call successors, (3) Word has length 187 [2025-03-16 21:38:41,333 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-16 21:38:41,335 INFO L225 Difference]: With dead ends: 2676 [2025-03-16 21:38:41,335 INFO L226 Difference]: Without dead ends: 1603 [2025-03-16 21:38:41,335 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 10 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 8 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 2 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=25, Invalid=65, Unknown=0, NotChecked=0, Total=90 [2025-03-16 21:38:41,336 INFO L435 NwaCegarLoop]: 639 mSDtfsCounter, 1118 mSDsluCounter, 2545 mSDsCounter, 0 mSdLazyCounter, 741 mSolverCounterSat, 4 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.3s Time, 0 mProtectedPredicate, 0 mProtectedAction, 1121 SdHoareTripleChecker+Valid, 3184 SdHoareTripleChecker+Invalid, 745 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 4 IncrementalHoareTripleChecker+Valid, 741 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.3s IncrementalHoareTripleChecker+Time [2025-03-16 21:38:41,336 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [1121 Valid, 3184 Invalid, 745 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [4 Valid, 741 Invalid, 0 Unknown, 0 Unchecked, 0.3s Time] [2025-03-16 21:38:41,337 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1603 states. [2025-03-16 21:38:41,360 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1603 to 1603. [2025-03-16 21:38:41,361 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 1603 states, 1591 states have (on average 1.3262099308610937) internal successors, (2110), 1591 states have internal predecessors, (2110), 10 states have call successors, (10), 1 states have call predecessors, (10), 1 states have return successors, (10), 10 states have call predecessors, (10), 10 states have call successors, (10) [2025-03-16 21:38:41,363 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1603 states to 1603 states and 2130 transitions. [2025-03-16 21:38:41,363 INFO L78 Accepts]: Start accepts. Automaton has 1603 states and 2130 transitions. Word has length 187 [2025-03-16 21:38:41,364 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-16 21:38:41,364 INFO L471 AbstractCegarLoop]: Abstraction has 1603 states and 2130 transitions. [2025-03-16 21:38:41,364 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 7 states, 7 states have (on average 25.0) internal successors, (175), 7 states have internal predecessors, (175), 1 states have call successors, (3), 1 states have call predecessors, (3), 1 states have return successors, (3), 1 states have call predecessors, (3), 1 states have call successors, (3) [2025-03-16 21:38:41,364 INFO L276 IsEmpty]: Start isEmpty. Operand 1603 states and 2130 transitions. [2025-03-16 21:38:41,368 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 462 [2025-03-16 21:38:41,368 INFO L210 NwaCegarLoop]: Found error trace [2025-03-16 21:38:41,368 INFO L218 NwaCegarLoop]: trace histogram [6, 6, 6, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-03-16 21:38:41,368 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable41 [2025-03-16 21:38:41,368 INFO L396 AbstractCegarLoop]: === Iteration 43 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-03-16 21:38:41,369 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-16 21:38:41,369 INFO L85 PathProgramCache]: Analyzing trace with hash -81282242, now seen corresponding path program 1 times [2025-03-16 21:38:41,369 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-16 21:38:41,369 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1311116589] [2025-03-16 21:38:41,369 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-16 21:38:41,369 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-16 21:38:41,481 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 461 statements into 1 equivalence classes. [2025-03-16 21:38:41,641 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 461 of 461 statements. [2025-03-16 21:38:41,641 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-16 21:38:41,641 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-16 21:38:42,064 INFO L134 CoverageAnalysis]: Checked inductivity of 181 backedges. 121 proven. 0 refuted. 0 times theorem prover too weak. 60 trivial. 0 not checked. [2025-03-16 21:38:42,065 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-16 21:38:42,065 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1311116589] [2025-03-16 21:38:42,065 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1311116589] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-16 21:38:42,065 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-16 21:38:42,065 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2025-03-16 21:38:42,065 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1207938270] [2025-03-16 21:38:42,065 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-16 21:38:42,066 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2025-03-16 21:38:42,066 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-16 21:38:42,066 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2025-03-16 21:38:42,067 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=8, Invalid=12, Unknown=0, NotChecked=0, Total=20 [2025-03-16 21:38:42,067 INFO L87 Difference]: Start difference. First operand 1603 states and 2130 transitions. Second operand has 5 states, 5 states have (on average 86.8) internal successors, (434), 5 states have internal predecessors, (434), 2 states have call successors, (6), 1 states have call predecessors, (6), 1 states have return successors, (6), 2 states have call predecessors, (6), 2 states have call successors, (6) [2025-03-16 21:38:42,313 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-16 21:38:42,313 INFO L93 Difference]: Finished difference Result 2676 states and 3594 transitions. [2025-03-16 21:38:42,313 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2025-03-16 21:38:42,313 INFO L78 Accepts]: Start accepts. Automaton has has 5 states, 5 states have (on average 86.8) internal successors, (434), 5 states have internal predecessors, (434), 2 states have call successors, (6), 1 states have call predecessors, (6), 1 states have return successors, (6), 2 states have call predecessors, (6), 2 states have call successors, (6) Word has length 461 [2025-03-16 21:38:42,314 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-16 21:38:42,316 INFO L225 Difference]: With dead ends: 2676 [2025-03-16 21:38:42,316 INFO L226 Difference]: Without dead ends: 1603 [2025-03-16 21:38:42,317 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 6 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 4 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=13, Invalid=17, Unknown=0, NotChecked=0, Total=30 [2025-03-16 21:38:42,317 INFO L435 NwaCegarLoop]: 600 mSDtfsCounter, 720 mSDsluCounter, 607 mSDsCounter, 0 mSdLazyCounter, 368 mSolverCounterSat, 1 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 723 SdHoareTripleChecker+Valid, 1207 SdHoareTripleChecker+Invalid, 369 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 1 IncrementalHoareTripleChecker+Valid, 368 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.2s IncrementalHoareTripleChecker+Time [2025-03-16 21:38:42,317 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [723 Valid, 1207 Invalid, 369 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [1 Valid, 368 Invalid, 0 Unknown, 0 Unchecked, 0.2s Time] [2025-03-16 21:38:42,318 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1603 states. [2025-03-16 21:38:42,332 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1603 to 1603. [2025-03-16 21:38:42,333 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 1603 states, 1591 states have (on average 1.3249528598365807) internal successors, (2108), 1591 states have internal predecessors, (2108), 10 states have call successors, (10), 1 states have call predecessors, (10), 1 states have return successors, (10), 10 states have call predecessors, (10), 10 states have call successors, (10) [2025-03-16 21:38:42,334 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1603 states to 1603 states and 2128 transitions. [2025-03-16 21:38:42,335 INFO L78 Accepts]: Start accepts. Automaton has 1603 states and 2128 transitions. Word has length 461 [2025-03-16 21:38:42,335 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-16 21:38:42,336 INFO L471 AbstractCegarLoop]: Abstraction has 1603 states and 2128 transitions. [2025-03-16 21:38:42,337 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 86.8) internal successors, (434), 5 states have internal predecessors, (434), 2 states have call successors, (6), 1 states have call predecessors, (6), 1 states have return successors, (6), 2 states have call predecessors, (6), 2 states have call successors, (6) [2025-03-16 21:38:42,337 INFO L276 IsEmpty]: Start isEmpty. Operand 1603 states and 2128 transitions. [2025-03-16 21:38:42,340 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 463 [2025-03-16 21:38:42,340 INFO L210 NwaCegarLoop]: Found error trace [2025-03-16 21:38:42,340 INFO L218 NwaCegarLoop]: trace histogram [6, 6, 6, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-03-16 21:38:42,340 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable42 [2025-03-16 21:38:42,340 INFO L396 AbstractCegarLoop]: === Iteration 44 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-03-16 21:38:42,341 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-16 21:38:42,341 INFO L85 PathProgramCache]: Analyzing trace with hash -220261208, now seen corresponding path program 1 times [2025-03-16 21:38:42,342 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-16 21:38:42,342 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2038542043] [2025-03-16 21:38:42,342 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-16 21:38:42,342 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-16 21:38:42,417 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 462 statements into 1 equivalence classes. [2025-03-16 21:38:42,516 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 462 of 462 statements. [2025-03-16 21:38:42,516 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-16 21:38:42,516 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-16 21:38:42,900 INFO L134 CoverageAnalysis]: Checked inductivity of 181 backedges. 121 proven. 0 refuted. 0 times theorem prover too weak. 60 trivial. 0 not checked. [2025-03-16 21:38:42,900 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-16 21:38:42,900 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2038542043] [2025-03-16 21:38:42,900 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [2038542043] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-16 21:38:42,901 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-16 21:38:42,901 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2025-03-16 21:38:42,901 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1160513587] [2025-03-16 21:38:42,901 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-16 21:38:42,901 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2025-03-16 21:38:42,901 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-16 21:38:42,902 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2025-03-16 21:38:42,902 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=8, Invalid=12, Unknown=0, NotChecked=0, Total=20 [2025-03-16 21:38:42,902 INFO L87 Difference]: Start difference. First operand 1603 states and 2128 transitions. Second operand has 5 states, 5 states have (on average 87.0) internal successors, (435), 5 states have internal predecessors, (435), 2 states have call successors, (6), 1 states have call predecessors, (6), 1 states have return successors, (6), 2 states have call predecessors, (6), 2 states have call successors, (6) [2025-03-16 21:38:43,120 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-16 21:38:43,120 INFO L93 Difference]: Finished difference Result 2676 states and 3590 transitions. [2025-03-16 21:38:43,120 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2025-03-16 21:38:43,120 INFO L78 Accepts]: Start accepts. Automaton has has 5 states, 5 states have (on average 87.0) internal successors, (435), 5 states have internal predecessors, (435), 2 states have call successors, (6), 1 states have call predecessors, (6), 1 states have return successors, (6), 2 states have call predecessors, (6), 2 states have call successors, (6) Word has length 462 [2025-03-16 21:38:43,120 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-16 21:38:43,122 INFO L225 Difference]: With dead ends: 2676 [2025-03-16 21:38:43,122 INFO L226 Difference]: Without dead ends: 1603 [2025-03-16 21:38:43,123 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 6 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 4 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=13, Invalid=17, Unknown=0, NotChecked=0, Total=30 [2025-03-16 21:38:43,124 INFO L435 NwaCegarLoop]: 600 mSDtfsCounter, 712 mSDsluCounter, 607 mSDsCounter, 0 mSdLazyCounter, 366 mSolverCounterSat, 1 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 715 SdHoareTripleChecker+Valid, 1207 SdHoareTripleChecker+Invalid, 367 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 1 IncrementalHoareTripleChecker+Valid, 366 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.2s IncrementalHoareTripleChecker+Time [2025-03-16 21:38:43,124 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [715 Valid, 1207 Invalid, 367 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [1 Valid, 366 Invalid, 0 Unknown, 0 Unchecked, 0.2s Time] [2025-03-16 21:38:43,125 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1603 states. [2025-03-16 21:38:43,137 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1603 to 1603. [2025-03-16 21:38:43,138 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 1603 states, 1591 states have (on average 1.323695788812068) internal successors, (2106), 1591 states have internal predecessors, (2106), 10 states have call successors, (10), 1 states have call predecessors, (10), 1 states have return successors, (10), 10 states have call predecessors, (10), 10 states have call successors, (10) [2025-03-16 21:38:43,140 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1603 states to 1603 states and 2126 transitions. [2025-03-16 21:38:43,140 INFO L78 Accepts]: Start accepts. Automaton has 1603 states and 2126 transitions. Word has length 462 [2025-03-16 21:38:43,140 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-16 21:38:43,140 INFO L471 AbstractCegarLoop]: Abstraction has 1603 states and 2126 transitions. [2025-03-16 21:38:43,140 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 87.0) internal successors, (435), 5 states have internal predecessors, (435), 2 states have call successors, (6), 1 states have call predecessors, (6), 1 states have return successors, (6), 2 states have call predecessors, (6), 2 states have call successors, (6) [2025-03-16 21:38:43,140 INFO L276 IsEmpty]: Start isEmpty. Operand 1603 states and 2126 transitions. [2025-03-16 21:38:43,143 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 464 [2025-03-16 21:38:43,143 INFO L210 NwaCegarLoop]: Found error trace [2025-03-16 21:38:43,143 INFO L218 NwaCegarLoop]: trace histogram [6, 6, 6, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-03-16 21:38:43,143 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable43 [2025-03-16 21:38:43,143 INFO L396 AbstractCegarLoop]: === Iteration 45 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-03-16 21:38:43,144 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-16 21:38:43,144 INFO L85 PathProgramCache]: Analyzing trace with hash -296201521, now seen corresponding path program 1 times [2025-03-16 21:38:43,144 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-16 21:38:43,144 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [124928644] [2025-03-16 21:38:43,144 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-16 21:38:43,144 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-16 21:38:43,217 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 463 statements into 1 equivalence classes. [2025-03-16 21:38:43,318 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 463 of 463 statements. [2025-03-16 21:38:43,319 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-16 21:38:43,319 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-16 21:38:43,668 INFO L134 CoverageAnalysis]: Checked inductivity of 181 backedges. 121 proven. 0 refuted. 0 times theorem prover too weak. 60 trivial. 0 not checked. [2025-03-16 21:38:43,669 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-16 21:38:43,669 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [124928644] [2025-03-16 21:38:43,669 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [124928644] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-16 21:38:43,669 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-16 21:38:43,669 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2025-03-16 21:38:43,669 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2057375683] [2025-03-16 21:38:43,669 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-16 21:38:43,669 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2025-03-16 21:38:43,669 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-16 21:38:43,670 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2025-03-16 21:38:43,670 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=8, Invalid=12, Unknown=0, NotChecked=0, Total=20 [2025-03-16 21:38:43,670 INFO L87 Difference]: Start difference. First operand 1603 states and 2126 transitions. Second operand has 5 states, 5 states have (on average 87.2) internal successors, (436), 5 states have internal predecessors, (436), 2 states have call successors, (6), 1 states have call predecessors, (6), 1 states have return successors, (6), 2 states have call predecessors, (6), 2 states have call successors, (6) [2025-03-16 21:38:43,884 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-16 21:38:43,884 INFO L93 Difference]: Finished difference Result 2676 states and 3586 transitions. [2025-03-16 21:38:43,884 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2025-03-16 21:38:43,884 INFO L78 Accepts]: Start accepts. Automaton has has 5 states, 5 states have (on average 87.2) internal successors, (436), 5 states have internal predecessors, (436), 2 states have call successors, (6), 1 states have call predecessors, (6), 1 states have return successors, (6), 2 states have call predecessors, (6), 2 states have call successors, (6) Word has length 463 [2025-03-16 21:38:43,884 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-16 21:38:43,886 INFO L225 Difference]: With dead ends: 2676 [2025-03-16 21:38:43,886 INFO L226 Difference]: Without dead ends: 1603 [2025-03-16 21:38:43,887 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 6 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 4 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=13, Invalid=17, Unknown=0, NotChecked=0, Total=30 [2025-03-16 21:38:43,887 INFO L435 NwaCegarLoop]: 600 mSDtfsCounter, 1279 mSDsluCounter, 601 mSDsCounter, 0 mSdLazyCounter, 364 mSolverCounterSat, 1 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 1282 SdHoareTripleChecker+Valid, 1201 SdHoareTripleChecker+Invalid, 365 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 1 IncrementalHoareTripleChecker+Valid, 364 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.2s IncrementalHoareTripleChecker+Time [2025-03-16 21:38:43,887 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [1282 Valid, 1201 Invalid, 365 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [1 Valid, 364 Invalid, 0 Unknown, 0 Unchecked, 0.2s Time] [2025-03-16 21:38:43,888 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1603 states. [2025-03-16 21:38:43,900 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1603 to 1603. [2025-03-16 21:38:43,901 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 1603 states, 1591 states have (on average 1.322438717787555) internal successors, (2104), 1591 states have internal predecessors, (2104), 10 states have call successors, (10), 1 states have call predecessors, (10), 1 states have return successors, (10), 10 states have call predecessors, (10), 10 states have call successors, (10) [2025-03-16 21:38:43,902 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1603 states to 1603 states and 2124 transitions. [2025-03-16 21:38:43,902 INFO L78 Accepts]: Start accepts. Automaton has 1603 states and 2124 transitions. Word has length 463 [2025-03-16 21:38:43,903 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-16 21:38:43,903 INFO L471 AbstractCegarLoop]: Abstraction has 1603 states and 2124 transitions. [2025-03-16 21:38:43,903 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 87.2) internal successors, (436), 5 states have internal predecessors, (436), 2 states have call successors, (6), 1 states have call predecessors, (6), 1 states have return successors, (6), 2 states have call predecessors, (6), 2 states have call successors, (6) [2025-03-16 21:38:43,903 INFO L276 IsEmpty]: Start isEmpty. Operand 1603 states and 2124 transitions. [2025-03-16 21:38:43,905 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 465 [2025-03-16 21:38:43,905 INFO L210 NwaCegarLoop]: Found error trace [2025-03-16 21:38:43,905 INFO L218 NwaCegarLoop]: trace histogram [6, 6, 6, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-03-16 21:38:43,905 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable44 [2025-03-16 21:38:43,906 INFO L396 AbstractCegarLoop]: === Iteration 46 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-03-16 21:38:43,906 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-16 21:38:43,906 INFO L85 PathProgramCache]: Analyzing trace with hash 804951193, now seen corresponding path program 1 times [2025-03-16 21:38:43,906 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-16 21:38:43,906 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2017144585] [2025-03-16 21:38:43,906 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-16 21:38:43,906 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-16 21:38:43,973 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 464 statements into 1 equivalence classes. [2025-03-16 21:38:44,070 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 464 of 464 statements. [2025-03-16 21:38:44,070 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-16 21:38:44,070 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-16 21:38:44,642 INFO L134 CoverageAnalysis]: Checked inductivity of 181 backedges. 121 proven. 0 refuted. 0 times theorem prover too weak. 60 trivial. 0 not checked. [2025-03-16 21:38:44,642 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-16 21:38:44,642 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2017144585] [2025-03-16 21:38:44,642 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [2017144585] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-16 21:38:44,642 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-16 21:38:44,642 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2025-03-16 21:38:44,642 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [99344175] [2025-03-16 21:38:44,642 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-16 21:38:44,643 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2025-03-16 21:38:44,643 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-16 21:38:44,643 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2025-03-16 21:38:44,643 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=8, Invalid=12, Unknown=0, NotChecked=0, Total=20 [2025-03-16 21:38:44,643 INFO L87 Difference]: Start difference. First operand 1603 states and 2124 transitions. Second operand has 5 states, 5 states have (on average 87.4) internal successors, (437), 5 states have internal predecessors, (437), 2 states have call successors, (6), 1 states have call predecessors, (6), 1 states have return successors, (6), 2 states have call predecessors, (6), 2 states have call successors, (6) [2025-03-16 21:38:44,827 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-16 21:38:44,827 INFO L93 Difference]: Finished difference Result 2676 states and 3582 transitions. [2025-03-16 21:38:44,827 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2025-03-16 21:38:44,827 INFO L78 Accepts]: Start accepts. Automaton has has 5 states, 5 states have (on average 87.4) internal successors, (437), 5 states have internal predecessors, (437), 2 states have call successors, (6), 1 states have call predecessors, (6), 1 states have return successors, (6), 2 states have call predecessors, (6), 2 states have call successors, (6) Word has length 464 [2025-03-16 21:38:44,828 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-16 21:38:44,830 INFO L225 Difference]: With dead ends: 2676 [2025-03-16 21:38:44,830 INFO L226 Difference]: Without dead ends: 1603 [2025-03-16 21:38:44,831 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 6 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 4 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=13, Invalid=17, Unknown=0, NotChecked=0, Total=30 [2025-03-16 21:38:44,831 INFO L435 NwaCegarLoop]: 600 mSDtfsCounter, 1263 mSDsluCounter, 601 mSDsCounter, 0 mSdLazyCounter, 362 mSolverCounterSat, 1 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 1266 SdHoareTripleChecker+Valid, 1201 SdHoareTripleChecker+Invalid, 363 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 1 IncrementalHoareTripleChecker+Valid, 362 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.2s IncrementalHoareTripleChecker+Time [2025-03-16 21:38:44,831 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [1266 Valid, 1201 Invalid, 363 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [1 Valid, 362 Invalid, 0 Unknown, 0 Unchecked, 0.2s Time] [2025-03-16 21:38:44,832 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1603 states. [2025-03-16 21:38:44,846 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1603 to 1603. [2025-03-16 21:38:44,847 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 1603 states, 1591 states have (on average 1.3211816467630422) internal successors, (2102), 1591 states have internal predecessors, (2102), 10 states have call successors, (10), 1 states have call predecessors, (10), 1 states have return successors, (10), 10 states have call predecessors, (10), 10 states have call successors, (10) [2025-03-16 21:38:44,848 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1603 states to 1603 states and 2122 transitions. [2025-03-16 21:38:44,848 INFO L78 Accepts]: Start accepts. Automaton has 1603 states and 2122 transitions. Word has length 464 [2025-03-16 21:38:44,848 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-16 21:38:44,848 INFO L471 AbstractCegarLoop]: Abstraction has 1603 states and 2122 transitions. [2025-03-16 21:38:44,849 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 87.4) internal successors, (437), 5 states have internal predecessors, (437), 2 states have call successors, (6), 1 states have call predecessors, (6), 1 states have return successors, (6), 2 states have call predecessors, (6), 2 states have call successors, (6) [2025-03-16 21:38:44,849 INFO L276 IsEmpty]: Start isEmpty. Operand 1603 states and 2122 transitions. [2025-03-16 21:38:44,851 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 466 [2025-03-16 21:38:44,851 INFO L210 NwaCegarLoop]: Found error trace [2025-03-16 21:38:44,851 INFO L218 NwaCegarLoop]: trace histogram [6, 6, 6, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-03-16 21:38:44,851 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable45 [2025-03-16 21:38:44,851 INFO L396 AbstractCegarLoop]: === Iteration 47 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-03-16 21:38:44,851 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-16 21:38:44,852 INFO L85 PathProgramCache]: Analyzing trace with hash -193058848, now seen corresponding path program 1 times [2025-03-16 21:38:44,852 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-16 21:38:44,852 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1001957294] [2025-03-16 21:38:44,852 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-16 21:38:44,852 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-16 21:38:44,924 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 465 statements into 1 equivalence classes. [2025-03-16 21:38:45,045 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 465 of 465 statements. [2025-03-16 21:38:45,045 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-16 21:38:45,045 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-16 21:38:45,418 INFO L134 CoverageAnalysis]: Checked inductivity of 181 backedges. 121 proven. 0 refuted. 0 times theorem prover too weak. 60 trivial. 0 not checked. [2025-03-16 21:38:45,418 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-16 21:38:45,418 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1001957294] [2025-03-16 21:38:45,419 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1001957294] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-16 21:38:45,419 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-16 21:38:45,419 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2025-03-16 21:38:45,419 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1314528089] [2025-03-16 21:38:45,419 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-16 21:38:45,419 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2025-03-16 21:38:45,419 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-16 21:38:45,420 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2025-03-16 21:38:45,420 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=8, Invalid=12, Unknown=0, NotChecked=0, Total=20 [2025-03-16 21:38:45,420 INFO L87 Difference]: Start difference. First operand 1603 states and 2122 transitions. Second operand has 5 states, 5 states have (on average 87.6) internal successors, (438), 5 states have internal predecessors, (438), 2 states have call successors, (6), 1 states have call predecessors, (6), 1 states have return successors, (6), 2 states have call predecessors, (6), 2 states have call successors, (6) [2025-03-16 21:38:45,615 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-16 21:38:45,615 INFO L93 Difference]: Finished difference Result 2676 states and 3578 transitions. [2025-03-16 21:38:45,615 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2025-03-16 21:38:45,616 INFO L78 Accepts]: Start accepts. Automaton has has 5 states, 5 states have (on average 87.6) internal successors, (438), 5 states have internal predecessors, (438), 2 states have call successors, (6), 1 states have call predecessors, (6), 1 states have return successors, (6), 2 states have call predecessors, (6), 2 states have call successors, (6) Word has length 465 [2025-03-16 21:38:45,616 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-16 21:38:45,618 INFO L225 Difference]: With dead ends: 2676 [2025-03-16 21:38:45,618 INFO L226 Difference]: Without dead ends: 1603 [2025-03-16 21:38:45,619 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 6 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 4 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=13, Invalid=17, Unknown=0, NotChecked=0, Total=30 [2025-03-16 21:38:45,619 INFO L435 NwaCegarLoop]: 600 mSDtfsCounter, 688 mSDsluCounter, 607 mSDsCounter, 0 mSdLazyCounter, 360 mSolverCounterSat, 1 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 691 SdHoareTripleChecker+Valid, 1207 SdHoareTripleChecker+Invalid, 361 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 1 IncrementalHoareTripleChecker+Valid, 360 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.2s IncrementalHoareTripleChecker+Time [2025-03-16 21:38:45,620 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [691 Valid, 1207 Invalid, 361 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [1 Valid, 360 Invalid, 0 Unknown, 0 Unchecked, 0.2s Time] [2025-03-16 21:38:45,620 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1603 states. [2025-03-16 21:38:45,635 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1603 to 1603. [2025-03-16 21:38:45,637 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 1603 states, 1591 states have (on average 1.3199245757385292) internal successors, (2100), 1591 states have internal predecessors, (2100), 10 states have call successors, (10), 1 states have call predecessors, (10), 1 states have return successors, (10), 10 states have call predecessors, (10), 10 states have call successors, (10) [2025-03-16 21:38:45,639 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1603 states to 1603 states and 2120 transitions. [2025-03-16 21:38:45,639 INFO L78 Accepts]: Start accepts. Automaton has 1603 states and 2120 transitions. Word has length 465 [2025-03-16 21:38:45,639 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-16 21:38:45,639 INFO L471 AbstractCegarLoop]: Abstraction has 1603 states and 2120 transitions. [2025-03-16 21:38:45,639 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 87.6) internal successors, (438), 5 states have internal predecessors, (438), 2 states have call successors, (6), 1 states have call predecessors, (6), 1 states have return successors, (6), 2 states have call predecessors, (6), 2 states have call successors, (6) [2025-03-16 21:38:45,640 INFO L276 IsEmpty]: Start isEmpty. Operand 1603 states and 2120 transitions. [2025-03-16 21:38:45,642 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 467 [2025-03-16 21:38:45,642 INFO L210 NwaCegarLoop]: Found error trace [2025-03-16 21:38:45,642 INFO L218 NwaCegarLoop]: trace histogram [6, 6, 6, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-03-16 21:38:45,642 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable46 [2025-03-16 21:38:45,643 INFO L396 AbstractCegarLoop]: === Iteration 48 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-03-16 21:38:45,643 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-16 21:38:45,643 INFO L85 PathProgramCache]: Analyzing trace with hash -1067709942, now seen corresponding path program 1 times [2025-03-16 21:38:45,643 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-16 21:38:45,643 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [377642842] [2025-03-16 21:38:45,643 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-16 21:38:45,643 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-16 21:38:45,717 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 466 statements into 1 equivalence classes. [2025-03-16 21:38:45,818 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 466 of 466 statements. [2025-03-16 21:38:45,819 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-16 21:38:45,819 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-16 21:38:46,230 INFO L134 CoverageAnalysis]: Checked inductivity of 181 backedges. 121 proven. 0 refuted. 0 times theorem prover too weak. 60 trivial. 0 not checked. [2025-03-16 21:38:46,230 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-16 21:38:46,230 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [377642842] [2025-03-16 21:38:46,230 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [377642842] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-16 21:38:46,230 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-16 21:38:46,230 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2025-03-16 21:38:46,230 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1022749910] [2025-03-16 21:38:46,230 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-16 21:38:46,231 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2025-03-16 21:38:46,231 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-16 21:38:46,231 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2025-03-16 21:38:46,231 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=8, Invalid=12, Unknown=0, NotChecked=0, Total=20 [2025-03-16 21:38:46,232 INFO L87 Difference]: Start difference. First operand 1603 states and 2120 transitions. Second operand has 5 states, 5 states have (on average 87.8) internal successors, (439), 5 states have internal predecessors, (439), 2 states have call successors, (6), 1 states have call predecessors, (6), 1 states have return successors, (6), 2 states have call predecessors, (6), 2 states have call successors, (6) [2025-03-16 21:38:46,436 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-16 21:38:46,436 INFO L93 Difference]: Finished difference Result 2676 states and 3574 transitions. [2025-03-16 21:38:46,436 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2025-03-16 21:38:46,436 INFO L78 Accepts]: Start accepts. Automaton has has 5 states, 5 states have (on average 87.8) internal successors, (439), 5 states have internal predecessors, (439), 2 states have call successors, (6), 1 states have call predecessors, (6), 1 states have return successors, (6), 2 states have call predecessors, (6), 2 states have call successors, (6) Word has length 466 [2025-03-16 21:38:46,437 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-16 21:38:46,439 INFO L225 Difference]: With dead ends: 2676 [2025-03-16 21:38:46,439 INFO L226 Difference]: Without dead ends: 1603 [2025-03-16 21:38:46,440 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 6 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 4 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=13, Invalid=17, Unknown=0, NotChecked=0, Total=30 [2025-03-16 21:38:46,440 INFO L435 NwaCegarLoop]: 600 mSDtfsCounter, 680 mSDsluCounter, 607 mSDsCounter, 0 mSdLazyCounter, 358 mSolverCounterSat, 1 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 683 SdHoareTripleChecker+Valid, 1207 SdHoareTripleChecker+Invalid, 359 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 1 IncrementalHoareTripleChecker+Valid, 358 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.2s IncrementalHoareTripleChecker+Time [2025-03-16 21:38:46,440 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [683 Valid, 1207 Invalid, 359 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [1 Valid, 358 Invalid, 0 Unknown, 0 Unchecked, 0.2s Time] [2025-03-16 21:38:46,441 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1603 states. [2025-03-16 21:38:46,455 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1603 to 1603. [2025-03-16 21:38:46,456 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 1603 states, 1591 states have (on average 1.3186675047140164) internal successors, (2098), 1591 states have internal predecessors, (2098), 10 states have call successors, (10), 1 states have call predecessors, (10), 1 states have return successors, (10), 10 states have call predecessors, (10), 10 states have call successors, (10) [2025-03-16 21:38:46,457 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1603 states to 1603 states and 2118 transitions. [2025-03-16 21:38:46,458 INFO L78 Accepts]: Start accepts. Automaton has 1603 states and 2118 transitions. Word has length 466 [2025-03-16 21:38:46,458 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-16 21:38:46,458 INFO L471 AbstractCegarLoop]: Abstraction has 1603 states and 2118 transitions. [2025-03-16 21:38:46,458 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 87.8) internal successors, (439), 5 states have internal predecessors, (439), 2 states have call successors, (6), 1 states have call predecessors, (6), 1 states have return successors, (6), 2 states have call predecessors, (6), 2 states have call successors, (6) [2025-03-16 21:38:46,459 INFO L276 IsEmpty]: Start isEmpty. Operand 1603 states and 2118 transitions. [2025-03-16 21:38:46,461 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 468 [2025-03-16 21:38:46,461 INFO L210 NwaCegarLoop]: Found error trace [2025-03-16 21:38:46,461 INFO L218 NwaCegarLoop]: trace histogram [6, 6, 6, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-03-16 21:38:46,461 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable47 [2025-03-16 21:38:46,462 INFO L396 AbstractCegarLoop]: === Iteration 49 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-03-16 21:38:46,462 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-16 21:38:46,462 INFO L85 PathProgramCache]: Analyzing trace with hash 558791281, now seen corresponding path program 1 times [2025-03-16 21:38:46,462 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-16 21:38:46,462 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [715204172] [2025-03-16 21:38:46,462 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-16 21:38:46,462 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-16 21:38:46,538 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 467 statements into 1 equivalence classes. [2025-03-16 21:38:46,644 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 467 of 467 statements. [2025-03-16 21:38:46,644 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-16 21:38:46,644 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-16 21:38:47,015 INFO L134 CoverageAnalysis]: Checked inductivity of 181 backedges. 121 proven. 0 refuted. 0 times theorem prover too weak. 60 trivial. 0 not checked. [2025-03-16 21:38:47,016 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-16 21:38:47,016 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [715204172] [2025-03-16 21:38:47,016 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [715204172] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-16 21:38:47,016 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-16 21:38:47,016 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2025-03-16 21:38:47,016 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [565279983] [2025-03-16 21:38:47,016 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-16 21:38:47,016 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2025-03-16 21:38:47,016 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-16 21:38:47,017 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2025-03-16 21:38:47,017 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=8, Invalid=12, Unknown=0, NotChecked=0, Total=20 [2025-03-16 21:38:47,017 INFO L87 Difference]: Start difference. First operand 1603 states and 2118 transitions. Second operand has 5 states, 5 states have (on average 88.0) internal successors, (440), 5 states have internal predecessors, (440), 2 states have call successors, (6), 1 states have call predecessors, (6), 1 states have return successors, (6), 2 states have call predecessors, (6), 2 states have call successors, (6) [2025-03-16 21:38:47,208 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-16 21:38:47,208 INFO L93 Difference]: Finished difference Result 2676 states and 3570 transitions. [2025-03-16 21:38:47,208 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2025-03-16 21:38:47,209 INFO L78 Accepts]: Start accepts. Automaton has has 5 states, 5 states have (on average 88.0) internal successors, (440), 5 states have internal predecessors, (440), 2 states have call successors, (6), 1 states have call predecessors, (6), 1 states have return successors, (6), 2 states have call predecessors, (6), 2 states have call successors, (6) Word has length 467 [2025-03-16 21:38:47,209 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-16 21:38:47,211 INFO L225 Difference]: With dead ends: 2676 [2025-03-16 21:38:47,211 INFO L226 Difference]: Without dead ends: 1603 [2025-03-16 21:38:47,212 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 6 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 4 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=13, Invalid=17, Unknown=0, NotChecked=0, Total=30 [2025-03-16 21:38:47,212 INFO L435 NwaCegarLoop]: 600 mSDtfsCounter, 672 mSDsluCounter, 607 mSDsCounter, 0 mSdLazyCounter, 356 mSolverCounterSat, 1 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 675 SdHoareTripleChecker+Valid, 1207 SdHoareTripleChecker+Invalid, 357 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 1 IncrementalHoareTripleChecker+Valid, 356 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.2s IncrementalHoareTripleChecker+Time [2025-03-16 21:38:47,213 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [675 Valid, 1207 Invalid, 357 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [1 Valid, 356 Invalid, 0 Unknown, 0 Unchecked, 0.2s Time] [2025-03-16 21:38:47,213 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1603 states. [2025-03-16 21:38:47,228 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1603 to 1603. [2025-03-16 21:38:47,229 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 1603 states, 1591 states have (on average 1.3174104336895034) internal successors, (2096), 1591 states have internal predecessors, (2096), 10 states have call successors, (10), 1 states have call predecessors, (10), 1 states have return successors, (10), 10 states have call predecessors, (10), 10 states have call successors, (10) [2025-03-16 21:38:47,230 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1603 states to 1603 states and 2116 transitions. [2025-03-16 21:38:47,231 INFO L78 Accepts]: Start accepts. Automaton has 1603 states and 2116 transitions. Word has length 467 [2025-03-16 21:38:47,231 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-16 21:38:47,231 INFO L471 AbstractCegarLoop]: Abstraction has 1603 states and 2116 transitions. [2025-03-16 21:38:47,231 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 88.0) internal successors, (440), 5 states have internal predecessors, (440), 2 states have call successors, (6), 1 states have call predecessors, (6), 1 states have return successors, (6), 2 states have call predecessors, (6), 2 states have call successors, (6) [2025-03-16 21:38:47,231 INFO L276 IsEmpty]: Start isEmpty. Operand 1603 states and 2116 transitions. [2025-03-16 21:38:47,233 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 469 [2025-03-16 21:38:47,234 INFO L210 NwaCegarLoop]: Found error trace [2025-03-16 21:38:47,234 INFO L218 NwaCegarLoop]: trace histogram [6, 6, 6, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-03-16 21:38:47,234 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable48 [2025-03-16 21:38:47,234 INFO L396 AbstractCegarLoop]: === Iteration 50 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-03-16 21:38:47,234 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-16 21:38:47,235 INFO L85 PathProgramCache]: Analyzing trace with hash 1038267643, now seen corresponding path program 1 times [2025-03-16 21:38:47,235 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-16 21:38:47,235 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2116241604] [2025-03-16 21:38:47,235 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-16 21:38:47,235 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-16 21:38:47,315 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 468 statements into 1 equivalence classes. [2025-03-16 21:38:47,420 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 468 of 468 statements. [2025-03-16 21:38:47,420 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-16 21:38:47,420 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-16 21:38:47,840 INFO L134 CoverageAnalysis]: Checked inductivity of 181 backedges. 121 proven. 0 refuted. 0 times theorem prover too weak. 60 trivial. 0 not checked. [2025-03-16 21:38:47,841 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-16 21:38:47,841 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2116241604] [2025-03-16 21:38:47,841 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [2116241604] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-16 21:38:47,841 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-16 21:38:47,841 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2025-03-16 21:38:47,841 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1819647869] [2025-03-16 21:38:47,841 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-16 21:38:47,841 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2025-03-16 21:38:47,841 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-16 21:38:47,842 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2025-03-16 21:38:47,842 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=8, Invalid=12, Unknown=0, NotChecked=0, Total=20 [2025-03-16 21:38:47,842 INFO L87 Difference]: Start difference. First operand 1603 states and 2116 transitions. Second operand has 5 states, 5 states have (on average 88.2) internal successors, (441), 5 states have internal predecessors, (441), 2 states have call successors, (6), 1 states have call predecessors, (6), 1 states have return successors, (6), 2 states have call predecessors, (6), 2 states have call successors, (6) [2025-03-16 21:38:48,071 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-16 21:38:48,071 INFO L93 Difference]: Finished difference Result 2676 states and 3566 transitions. [2025-03-16 21:38:48,071 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2025-03-16 21:38:48,071 INFO L78 Accepts]: Start accepts. Automaton has has 5 states, 5 states have (on average 88.2) internal successors, (441), 5 states have internal predecessors, (441), 2 states have call successors, (6), 1 states have call predecessors, (6), 1 states have return successors, (6), 2 states have call predecessors, (6), 2 states have call successors, (6) Word has length 468 [2025-03-16 21:38:48,072 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-16 21:38:48,074 INFO L225 Difference]: With dead ends: 2676 [2025-03-16 21:38:48,074 INFO L226 Difference]: Without dead ends: 1603 [2025-03-16 21:38:48,075 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 6 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 4 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=13, Invalid=17, Unknown=0, NotChecked=0, Total=30 [2025-03-16 21:38:48,075 INFO L435 NwaCegarLoop]: 600 mSDtfsCounter, 1199 mSDsluCounter, 601 mSDsCounter, 0 mSdLazyCounter, 354 mSolverCounterSat, 1 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 1202 SdHoareTripleChecker+Valid, 1201 SdHoareTripleChecker+Invalid, 355 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 1 IncrementalHoareTripleChecker+Valid, 354 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.2s IncrementalHoareTripleChecker+Time [2025-03-16 21:38:48,075 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [1202 Valid, 1201 Invalid, 355 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [1 Valid, 354 Invalid, 0 Unknown, 0 Unchecked, 0.2s Time] [2025-03-16 21:38:48,076 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1603 states. [2025-03-16 21:38:48,102 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1603 to 1603. [2025-03-16 21:38:48,103 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 1603 states, 1591 states have (on average 1.3161533626649906) internal successors, (2094), 1591 states have internal predecessors, (2094), 10 states have call successors, (10), 1 states have call predecessors, (10), 1 states have return successors, (10), 10 states have call predecessors, (10), 10 states have call successors, (10) [2025-03-16 21:38:48,105 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1603 states to 1603 states and 2114 transitions. [2025-03-16 21:38:48,105 INFO L78 Accepts]: Start accepts. Automaton has 1603 states and 2114 transitions. Word has length 468 [2025-03-16 21:38:48,105 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-16 21:38:48,105 INFO L471 AbstractCegarLoop]: Abstraction has 1603 states and 2114 transitions. [2025-03-16 21:38:48,106 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 88.2) internal successors, (441), 5 states have internal predecessors, (441), 2 states have call successors, (6), 1 states have call predecessors, (6), 1 states have return successors, (6), 2 states have call predecessors, (6), 2 states have call successors, (6) [2025-03-16 21:38:48,106 INFO L276 IsEmpty]: Start isEmpty. Operand 1603 states and 2114 transitions. [2025-03-16 21:38:48,110 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 470 [2025-03-16 21:38:48,111 INFO L210 NwaCegarLoop]: Found error trace [2025-03-16 21:38:48,111 INFO L218 NwaCegarLoop]: trace histogram [6, 6, 6, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-03-16 21:38:48,111 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable49 [2025-03-16 21:38:48,111 INFO L396 AbstractCegarLoop]: === Iteration 51 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-03-16 21:38:48,112 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-16 21:38:48,112 INFO L85 PathProgramCache]: Analyzing trace with hash 421431938, now seen corresponding path program 1 times [2025-03-16 21:38:48,112 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-16 21:38:48,112 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1367756949] [2025-03-16 21:38:48,112 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-16 21:38:48,112 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-16 21:38:48,213 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 469 statements into 1 equivalence classes. [2025-03-16 21:38:48,374 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 469 of 469 statements. [2025-03-16 21:38:48,374 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-16 21:38:48,374 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-16 21:38:48,823 INFO L134 CoverageAnalysis]: Checked inductivity of 181 backedges. 121 proven. 0 refuted. 0 times theorem prover too weak. 60 trivial. 0 not checked. [2025-03-16 21:38:48,823 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-16 21:38:48,824 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1367756949] [2025-03-16 21:38:48,824 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1367756949] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-16 21:38:48,824 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-16 21:38:48,824 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2025-03-16 21:38:48,824 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1893138384] [2025-03-16 21:38:48,824 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-16 21:38:48,824 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2025-03-16 21:38:48,824 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-16 21:38:48,825 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2025-03-16 21:38:48,825 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=8, Invalid=12, Unknown=0, NotChecked=0, Total=20 [2025-03-16 21:38:48,825 INFO L87 Difference]: Start difference. First operand 1603 states and 2114 transitions. Second operand has 5 states, 5 states have (on average 88.4) internal successors, (442), 5 states have internal predecessors, (442), 2 states have call successors, (6), 1 states have call predecessors, (6), 1 states have return successors, (6), 2 states have call predecessors, (6), 2 states have call successors, (6) [2025-03-16 21:38:49,004 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-16 21:38:49,004 INFO L93 Difference]: Finished difference Result 2676 states and 3562 transitions. [2025-03-16 21:38:49,005 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2025-03-16 21:38:49,005 INFO L78 Accepts]: Start accepts. Automaton has has 5 states, 5 states have (on average 88.4) internal successors, (442), 5 states have internal predecessors, (442), 2 states have call successors, (6), 1 states have call predecessors, (6), 1 states have return successors, (6), 2 states have call predecessors, (6), 2 states have call successors, (6) Word has length 469 [2025-03-16 21:38:49,005 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-16 21:38:49,007 INFO L225 Difference]: With dead ends: 2676 [2025-03-16 21:38:49,008 INFO L226 Difference]: Without dead ends: 1603 [2025-03-16 21:38:49,009 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 6 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 4 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=13, Invalid=17, Unknown=0, NotChecked=0, Total=30 [2025-03-16 21:38:49,009 INFO L435 NwaCegarLoop]: 616 mSDtfsCounter, 1168 mSDsluCounter, 617 mSDsCounter, 0 mSdLazyCounter, 320 mSolverCounterSat, 1 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 1171 SdHoareTripleChecker+Valid, 1233 SdHoareTripleChecker+Invalid, 321 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 1 IncrementalHoareTripleChecker+Valid, 320 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.2s IncrementalHoareTripleChecker+Time [2025-03-16 21:38:49,009 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [1171 Valid, 1233 Invalid, 321 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [1 Valid, 320 Invalid, 0 Unknown, 0 Unchecked, 0.2s Time] [2025-03-16 21:38:49,010 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1603 states. [2025-03-16 21:38:49,024 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1603 to 1603. [2025-03-16 21:38:49,025 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 1603 states, 1591 states have (on average 1.3148962916404776) internal successors, (2092), 1591 states have internal predecessors, (2092), 10 states have call successors, (10), 1 states have call predecessors, (10), 1 states have return successors, (10), 10 states have call predecessors, (10), 10 states have call successors, (10) [2025-03-16 21:38:49,026 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1603 states to 1603 states and 2112 transitions. [2025-03-16 21:38:49,026 INFO L78 Accepts]: Start accepts. Automaton has 1603 states and 2112 transitions. Word has length 469 [2025-03-16 21:38:49,026 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-16 21:38:49,026 INFO L471 AbstractCegarLoop]: Abstraction has 1603 states and 2112 transitions. [2025-03-16 21:38:49,027 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 88.4) internal successors, (442), 5 states have internal predecessors, (442), 2 states have call successors, (6), 1 states have call predecessors, (6), 1 states have return successors, (6), 2 states have call predecessors, (6), 2 states have call successors, (6) [2025-03-16 21:38:49,027 INFO L276 IsEmpty]: Start isEmpty. Operand 1603 states and 2112 transitions. [2025-03-16 21:38:49,029 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 471 [2025-03-16 21:38:49,029 INFO L210 NwaCegarLoop]: Found error trace [2025-03-16 21:38:49,030 INFO L218 NwaCegarLoop]: trace histogram [6, 6, 6, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-03-16 21:38:49,030 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable50 [2025-03-16 21:38:49,030 INFO L396 AbstractCegarLoop]: === Iteration 52 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-03-16 21:38:49,030 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-16 21:38:49,030 INFO L85 PathProgramCache]: Analyzing trace with hash 1687016812, now seen corresponding path program 1 times [2025-03-16 21:38:49,030 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-16 21:38:49,031 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1380102960] [2025-03-16 21:38:49,031 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-16 21:38:49,031 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-16 21:38:49,109 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 470 statements into 1 equivalence classes. [2025-03-16 21:38:49,216 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 470 of 470 statements. [2025-03-16 21:38:49,216 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-16 21:38:49,216 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-16 21:38:49,591 INFO L134 CoverageAnalysis]: Checked inductivity of 181 backedges. 121 proven. 0 refuted. 0 times theorem prover too weak. 60 trivial. 0 not checked. [2025-03-16 21:38:49,592 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-16 21:38:49,592 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1380102960] [2025-03-16 21:38:49,592 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1380102960] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-16 21:38:49,592 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-16 21:38:49,592 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2025-03-16 21:38:49,592 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [354010459] [2025-03-16 21:38:49,592 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-16 21:38:49,592 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2025-03-16 21:38:49,592 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-16 21:38:49,593 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2025-03-16 21:38:49,593 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=8, Invalid=12, Unknown=0, NotChecked=0, Total=20 [2025-03-16 21:38:49,593 INFO L87 Difference]: Start difference. First operand 1603 states and 2112 transitions. Second operand has 5 states, 5 states have (on average 88.6) internal successors, (443), 5 states have internal predecessors, (443), 2 states have call successors, (6), 1 states have call predecessors, (6), 1 states have return successors, (6), 2 states have call predecessors, (6), 2 states have call successors, (6) [2025-03-16 21:38:49,766 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-16 21:38:49,766 INFO L93 Difference]: Finished difference Result 2676 states and 3558 transitions. [2025-03-16 21:38:49,767 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2025-03-16 21:38:49,767 INFO L78 Accepts]: Start accepts. Automaton has has 5 states, 5 states have (on average 88.6) internal successors, (443), 5 states have internal predecessors, (443), 2 states have call successors, (6), 1 states have call predecessors, (6), 1 states have return successors, (6), 2 states have call predecessors, (6), 2 states have call successors, (6) Word has length 470 [2025-03-16 21:38:49,767 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-16 21:38:49,769 INFO L225 Difference]: With dead ends: 2676 [2025-03-16 21:38:49,769 INFO L226 Difference]: Without dead ends: 1603 [2025-03-16 21:38:49,770 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 6 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 4 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=13, Invalid=17, Unknown=0, NotChecked=0, Total=30 [2025-03-16 21:38:49,770 INFO L435 NwaCegarLoop]: 616 mSDtfsCounter, 1152 mSDsluCounter, 617 mSDsCounter, 0 mSdLazyCounter, 318 mSolverCounterSat, 1 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 1155 SdHoareTripleChecker+Valid, 1233 SdHoareTripleChecker+Invalid, 319 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 1 IncrementalHoareTripleChecker+Valid, 318 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.2s IncrementalHoareTripleChecker+Time [2025-03-16 21:38:49,770 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [1155 Valid, 1233 Invalid, 319 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [1 Valid, 318 Invalid, 0 Unknown, 0 Unchecked, 0.2s Time] [2025-03-16 21:38:49,771 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1603 states. [2025-03-16 21:38:49,786 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1603 to 1603. [2025-03-16 21:38:49,787 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 1603 states, 1591 states have (on average 1.3136392206159648) internal successors, (2090), 1591 states have internal predecessors, (2090), 10 states have call successors, (10), 1 states have call predecessors, (10), 1 states have return successors, (10), 10 states have call predecessors, (10), 10 states have call successors, (10) [2025-03-16 21:38:49,788 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1603 states to 1603 states and 2110 transitions. [2025-03-16 21:38:49,789 INFO L78 Accepts]: Start accepts. Automaton has 1603 states and 2110 transitions. Word has length 470 [2025-03-16 21:38:49,789 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-16 21:38:49,789 INFO L471 AbstractCegarLoop]: Abstraction has 1603 states and 2110 transitions. [2025-03-16 21:38:49,789 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 88.6) internal successors, (443), 5 states have internal predecessors, (443), 2 states have call successors, (6), 1 states have call predecessors, (6), 1 states have return successors, (6), 2 states have call predecessors, (6), 2 states have call successors, (6) [2025-03-16 21:38:49,789 INFO L276 IsEmpty]: Start isEmpty. Operand 1603 states and 2110 transitions. [2025-03-16 21:38:49,791 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 472 [2025-03-16 21:38:49,792 INFO L210 NwaCegarLoop]: Found error trace [2025-03-16 21:38:49,792 INFO L218 NwaCegarLoop]: trace histogram [6, 6, 6, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-03-16 21:38:49,792 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable51 [2025-03-16 21:38:49,792 INFO L396 AbstractCegarLoop]: === Iteration 53 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-03-16 21:38:49,792 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-16 21:38:49,792 INFO L85 PathProgramCache]: Analyzing trace with hash 1357092883, now seen corresponding path program 1 times [2025-03-16 21:38:49,793 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-16 21:38:49,793 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1678948128] [2025-03-16 21:38:49,793 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-16 21:38:49,793 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-16 21:38:49,866 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 471 statements into 1 equivalence classes. [2025-03-16 21:38:49,971 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 471 of 471 statements. [2025-03-16 21:38:49,971 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-16 21:38:49,971 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-16 21:38:50,331 INFO L134 CoverageAnalysis]: Checked inductivity of 181 backedges. 121 proven. 0 refuted. 0 times theorem prover too weak. 60 trivial. 0 not checked. [2025-03-16 21:38:50,331 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-16 21:38:50,331 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1678948128] [2025-03-16 21:38:50,331 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1678948128] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-16 21:38:50,331 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-16 21:38:50,331 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2025-03-16 21:38:50,331 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [16152276] [2025-03-16 21:38:50,331 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-16 21:38:50,331 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2025-03-16 21:38:50,332 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-16 21:38:50,332 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2025-03-16 21:38:50,332 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=8, Invalid=12, Unknown=0, NotChecked=0, Total=20 [2025-03-16 21:38:50,332 INFO L87 Difference]: Start difference. First operand 1603 states and 2110 transitions. Second operand has 5 states, 5 states have (on average 88.8) internal successors, (444), 5 states have internal predecessors, (444), 2 states have call successors, (6), 1 states have call predecessors, (6), 1 states have return successors, (6), 2 states have call predecessors, (6), 2 states have call successors, (6) [2025-03-16 21:38:50,535 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-16 21:38:50,535 INFO L93 Difference]: Finished difference Result 2676 states and 3554 transitions. [2025-03-16 21:38:50,536 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2025-03-16 21:38:50,536 INFO L78 Accepts]: Start accepts. Automaton has has 5 states, 5 states have (on average 88.8) internal successors, (444), 5 states have internal predecessors, (444), 2 states have call successors, (6), 1 states have call predecessors, (6), 1 states have return successors, (6), 2 states have call predecessors, (6), 2 states have call successors, (6) Word has length 471 [2025-03-16 21:38:50,536 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-16 21:38:50,538 INFO L225 Difference]: With dead ends: 2676 [2025-03-16 21:38:50,539 INFO L226 Difference]: Without dead ends: 1603 [2025-03-16 21:38:50,540 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 6 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 4 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=13, Invalid=17, Unknown=0, NotChecked=0, Total=30 [2025-03-16 21:38:50,540 INFO L435 NwaCegarLoop]: 616 mSDtfsCounter, 1136 mSDsluCounter, 617 mSDsCounter, 0 mSdLazyCounter, 316 mSolverCounterSat, 1 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 1139 SdHoareTripleChecker+Valid, 1233 SdHoareTripleChecker+Invalid, 317 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 1 IncrementalHoareTripleChecker+Valid, 316 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.2s IncrementalHoareTripleChecker+Time [2025-03-16 21:38:50,541 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [1139 Valid, 1233 Invalid, 317 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [1 Valid, 316 Invalid, 0 Unknown, 0 Unchecked, 0.2s Time] [2025-03-16 21:38:50,541 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1603 states. [2025-03-16 21:38:50,558 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1603 to 1603. [2025-03-16 21:38:50,559 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 1603 states, 1591 states have (on average 1.3123821495914518) internal successors, (2088), 1591 states have internal predecessors, (2088), 10 states have call successors, (10), 1 states have call predecessors, (10), 1 states have return successors, (10), 10 states have call predecessors, (10), 10 states have call successors, (10) [2025-03-16 21:38:50,560 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1603 states to 1603 states and 2108 transitions. [2025-03-16 21:38:50,560 INFO L78 Accepts]: Start accepts. Automaton has 1603 states and 2108 transitions. Word has length 471 [2025-03-16 21:38:50,561 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-16 21:38:50,561 INFO L471 AbstractCegarLoop]: Abstraction has 1603 states and 2108 transitions. [2025-03-16 21:38:50,561 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 88.8) internal successors, (444), 5 states have internal predecessors, (444), 2 states have call successors, (6), 1 states have call predecessors, (6), 1 states have return successors, (6), 2 states have call predecessors, (6), 2 states have call successors, (6) [2025-03-16 21:38:50,561 INFO L276 IsEmpty]: Start isEmpty. Operand 1603 states and 2108 transitions. [2025-03-16 21:38:50,563 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 473 [2025-03-16 21:38:50,564 INFO L210 NwaCegarLoop]: Found error trace [2025-03-16 21:38:50,564 INFO L218 NwaCegarLoop]: trace histogram [6, 6, 6, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-03-16 21:38:50,564 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable52 [2025-03-16 21:38:50,564 INFO L396 AbstractCegarLoop]: === Iteration 54 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-03-16 21:38:50,564 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-16 21:38:50,565 INFO L85 PathProgramCache]: Analyzing trace with hash -226710691, now seen corresponding path program 1 times [2025-03-16 21:38:50,565 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-16 21:38:50,565 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [888566618] [2025-03-16 21:38:50,565 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-16 21:38:50,565 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-16 21:38:50,649 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 472 statements into 1 equivalence classes. [2025-03-16 21:38:50,764 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 472 of 472 statements. [2025-03-16 21:38:50,764 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-16 21:38:50,764 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-16 21:38:51,141 INFO L134 CoverageAnalysis]: Checked inductivity of 181 backedges. 121 proven. 0 refuted. 0 times theorem prover too weak. 60 trivial. 0 not checked. [2025-03-16 21:38:51,141 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-16 21:38:51,141 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [888566618] [2025-03-16 21:38:51,141 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [888566618] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-16 21:38:51,141 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-16 21:38:51,141 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2025-03-16 21:38:51,141 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [572705540] [2025-03-16 21:38:51,141 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-16 21:38:51,142 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2025-03-16 21:38:51,142 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-16 21:38:51,142 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2025-03-16 21:38:51,142 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=8, Invalid=12, Unknown=0, NotChecked=0, Total=20 [2025-03-16 21:38:51,142 INFO L87 Difference]: Start difference. First operand 1603 states and 2108 transitions. Second operand has 5 states, 5 states have (on average 89.0) internal successors, (445), 5 states have internal predecessors, (445), 2 states have call successors, (6), 1 states have call predecessors, (6), 1 states have return successors, (6), 2 states have call predecessors, (6), 2 states have call successors, (6) [2025-03-16 21:38:51,315 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-16 21:38:51,315 INFO L93 Difference]: Finished difference Result 2676 states and 3550 transitions. [2025-03-16 21:38:51,315 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2025-03-16 21:38:51,316 INFO L78 Accepts]: Start accepts. Automaton has has 5 states, 5 states have (on average 89.0) internal successors, (445), 5 states have internal predecessors, (445), 2 states have call successors, (6), 1 states have call predecessors, (6), 1 states have return successors, (6), 2 states have call predecessors, (6), 2 states have call successors, (6) Word has length 472 [2025-03-16 21:38:51,316 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-16 21:38:51,318 INFO L225 Difference]: With dead ends: 2676 [2025-03-16 21:38:51,318 INFO L226 Difference]: Without dead ends: 1603 [2025-03-16 21:38:51,318 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 6 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 4 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=13, Invalid=17, Unknown=0, NotChecked=0, Total=30 [2025-03-16 21:38:51,319 INFO L435 NwaCegarLoop]: 616 mSDtfsCounter, 1120 mSDsluCounter, 617 mSDsCounter, 0 mSdLazyCounter, 314 mSolverCounterSat, 1 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 1123 SdHoareTripleChecker+Valid, 1233 SdHoareTripleChecker+Invalid, 315 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 1 IncrementalHoareTripleChecker+Valid, 314 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.2s IncrementalHoareTripleChecker+Time [2025-03-16 21:38:51,319 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [1123 Valid, 1233 Invalid, 315 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [1 Valid, 314 Invalid, 0 Unknown, 0 Unchecked, 0.2s Time] [2025-03-16 21:38:51,319 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1603 states. [2025-03-16 21:38:51,332 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1603 to 1603. [2025-03-16 21:38:51,333 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 1603 states, 1591 states have (on average 1.311125078566939) internal successors, (2086), 1591 states have internal predecessors, (2086), 10 states have call successors, (10), 1 states have call predecessors, (10), 1 states have return successors, (10), 10 states have call predecessors, (10), 10 states have call successors, (10) [2025-03-16 21:38:51,334 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1603 states to 1603 states and 2106 transitions. [2025-03-16 21:38:51,335 INFO L78 Accepts]: Start accepts. Automaton has 1603 states and 2106 transitions. Word has length 472 [2025-03-16 21:38:51,335 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-16 21:38:51,335 INFO L471 AbstractCegarLoop]: Abstraction has 1603 states and 2106 transitions. [2025-03-16 21:38:51,335 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 89.0) internal successors, (445), 5 states have internal predecessors, (445), 2 states have call successors, (6), 1 states have call predecessors, (6), 1 states have return successors, (6), 2 states have call predecessors, (6), 2 states have call successors, (6) [2025-03-16 21:38:51,335 INFO L276 IsEmpty]: Start isEmpty. Operand 1603 states and 2106 transitions. [2025-03-16 21:38:51,337 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 474 [2025-03-16 21:38:51,337 INFO L210 NwaCegarLoop]: Found error trace [2025-03-16 21:38:51,338 INFO L218 NwaCegarLoop]: trace histogram [6, 6, 6, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-03-16 21:38:51,338 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable53 [2025-03-16 21:38:51,338 INFO L396 AbstractCegarLoop]: === Iteration 55 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-03-16 21:38:51,338 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-16 21:38:51,338 INFO L85 PathProgramCache]: Analyzing trace with hash 1311957796, now seen corresponding path program 1 times [2025-03-16 21:38:51,338 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-16 21:38:51,338 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1835537070] [2025-03-16 21:38:51,339 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-16 21:38:51,339 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-16 21:38:51,419 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 473 statements into 1 equivalence classes. [2025-03-16 21:38:51,540 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 473 of 473 statements. [2025-03-16 21:38:51,540 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-16 21:38:51,540 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-16 21:38:51,980 INFO L134 CoverageAnalysis]: Checked inductivity of 181 backedges. 121 proven. 0 refuted. 0 times theorem prover too weak. 60 trivial. 0 not checked. [2025-03-16 21:38:51,981 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-16 21:38:51,981 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1835537070] [2025-03-16 21:38:51,981 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1835537070] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-16 21:38:51,981 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-16 21:38:51,981 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2025-03-16 21:38:51,981 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [612426385] [2025-03-16 21:38:51,981 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-16 21:38:51,981 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2025-03-16 21:38:51,981 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-16 21:38:51,982 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2025-03-16 21:38:51,982 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=8, Invalid=12, Unknown=0, NotChecked=0, Total=20 [2025-03-16 21:38:51,982 INFO L87 Difference]: Start difference. First operand 1603 states and 2106 transitions. Second operand has 5 states, 5 states have (on average 89.2) internal successors, (446), 5 states have internal predecessors, (446), 2 states have call successors, (6), 1 states have call predecessors, (6), 1 states have return successors, (6), 2 states have call predecessors, (6), 2 states have call successors, (6) [2025-03-16 21:38:52,139 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-16 21:38:52,139 INFO L93 Difference]: Finished difference Result 2676 states and 3546 transitions. [2025-03-16 21:38:52,139 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2025-03-16 21:38:52,140 INFO L78 Accepts]: Start accepts. Automaton has has 5 states, 5 states have (on average 89.2) internal successors, (446), 5 states have internal predecessors, (446), 2 states have call successors, (6), 1 states have call predecessors, (6), 1 states have return successors, (6), 2 states have call predecessors, (6), 2 states have call successors, (6) Word has length 473 [2025-03-16 21:38:52,140 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-16 21:38:52,141 INFO L225 Difference]: With dead ends: 2676 [2025-03-16 21:38:52,141 INFO L226 Difference]: Without dead ends: 1603 [2025-03-16 21:38:52,142 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 6 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 4 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=13, Invalid=17, Unknown=0, NotChecked=0, Total=30 [2025-03-16 21:38:52,143 INFO L435 NwaCegarLoop]: 624 mSDtfsCounter, 1097 mSDsluCounter, 625 mSDsCounter, 0 mSdLazyCounter, 296 mSolverCounterSat, 1 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 1100 SdHoareTripleChecker+Valid, 1249 SdHoareTripleChecker+Invalid, 297 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 1 IncrementalHoareTripleChecker+Valid, 296 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2025-03-16 21:38:52,143 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [1100 Valid, 1249 Invalid, 297 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [1 Valid, 296 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2025-03-16 21:38:52,143 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1603 states. [2025-03-16 21:38:52,156 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1603 to 1603. [2025-03-16 21:38:52,157 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 1603 states, 1591 states have (on average 1.309868007542426) internal successors, (2084), 1591 states have internal predecessors, (2084), 10 states have call successors, (10), 1 states have call predecessors, (10), 1 states have return successors, (10), 10 states have call predecessors, (10), 10 states have call successors, (10) [2025-03-16 21:38:52,158 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1603 states to 1603 states and 2104 transitions. [2025-03-16 21:38:52,158 INFO L78 Accepts]: Start accepts. Automaton has 1603 states and 2104 transitions. Word has length 473 [2025-03-16 21:38:52,159 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-16 21:38:52,159 INFO L471 AbstractCegarLoop]: Abstraction has 1603 states and 2104 transitions. [2025-03-16 21:38:52,159 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 89.2) internal successors, (446), 5 states have internal predecessors, (446), 2 states have call successors, (6), 1 states have call predecessors, (6), 1 states have return successors, (6), 2 states have call predecessors, (6), 2 states have call successors, (6) [2025-03-16 21:38:52,159 INFO L276 IsEmpty]: Start isEmpty. Operand 1603 states and 2104 transitions. [2025-03-16 21:38:52,161 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 475 [2025-03-16 21:38:52,161 INFO L210 NwaCegarLoop]: Found error trace [2025-03-16 21:38:52,161 INFO L218 NwaCegarLoop]: trace histogram [6, 6, 6, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-03-16 21:38:52,161 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable54 [2025-03-16 21:38:52,161 INFO L396 AbstractCegarLoop]: === Iteration 56 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-03-16 21:38:52,162 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-16 21:38:52,162 INFO L85 PathProgramCache]: Analyzing trace with hash -2014415154, now seen corresponding path program 1 times [2025-03-16 21:38:52,162 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-16 21:38:52,162 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2052215187] [2025-03-16 21:38:52,162 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-16 21:38:52,162 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-16 21:38:52,230 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 474 statements into 1 equivalence classes. [2025-03-16 21:38:52,356 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 474 of 474 statements. [2025-03-16 21:38:52,357 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-16 21:38:52,357 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-16 21:38:52,773 INFO L134 CoverageAnalysis]: Checked inductivity of 181 backedges. 121 proven. 0 refuted. 0 times theorem prover too weak. 60 trivial. 0 not checked. [2025-03-16 21:38:52,773 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-16 21:38:52,773 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2052215187] [2025-03-16 21:38:52,773 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [2052215187] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-16 21:38:52,773 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-16 21:38:52,773 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2025-03-16 21:38:52,773 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2122754467] [2025-03-16 21:38:52,773 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-16 21:38:52,773 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2025-03-16 21:38:52,774 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-16 21:38:52,774 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2025-03-16 21:38:52,774 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=8, Invalid=12, Unknown=0, NotChecked=0, Total=20 [2025-03-16 21:38:52,774 INFO L87 Difference]: Start difference. First operand 1603 states and 2104 transitions. Second operand has 5 states, 5 states have (on average 89.4) internal successors, (447), 5 states have internal predecessors, (447), 2 states have call successors, (6), 1 states have call predecessors, (6), 1 states have return successors, (6), 2 states have call predecessors, (6), 2 states have call successors, (6) [2025-03-16 21:38:52,962 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-16 21:38:52,963 INFO L93 Difference]: Finished difference Result 2676 states and 3542 transitions. [2025-03-16 21:38:52,963 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2025-03-16 21:38:52,963 INFO L78 Accepts]: Start accepts. Automaton has has 5 states, 5 states have (on average 89.4) internal successors, (447), 5 states have internal predecessors, (447), 2 states have call successors, (6), 1 states have call predecessors, (6), 1 states have return successors, (6), 2 states have call predecessors, (6), 2 states have call successors, (6) Word has length 474 [2025-03-16 21:38:52,963 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-16 21:38:52,965 INFO L225 Difference]: With dead ends: 2676 [2025-03-16 21:38:52,965 INFO L226 Difference]: Without dead ends: 1603 [2025-03-16 21:38:52,965 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 6 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 4 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=13, Invalid=17, Unknown=0, NotChecked=0, Total=30 [2025-03-16 21:38:52,966 INFO L435 NwaCegarLoop]: 624 mSDtfsCounter, 594 mSDsluCounter, 631 mSDsCounter, 0 mSdLazyCounter, 294 mSolverCounterSat, 1 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 597 SdHoareTripleChecker+Valid, 1255 SdHoareTripleChecker+Invalid, 295 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 1 IncrementalHoareTripleChecker+Valid, 294 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.2s IncrementalHoareTripleChecker+Time [2025-03-16 21:38:52,966 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [597 Valid, 1255 Invalid, 295 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [1 Valid, 294 Invalid, 0 Unknown, 0 Unchecked, 0.2s Time] [2025-03-16 21:38:52,967 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1603 states. [2025-03-16 21:38:52,988 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1603 to 1603. [2025-03-16 21:38:52,989 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 1603 states, 1591 states have (on average 1.3086109365179133) internal successors, (2082), 1591 states have internal predecessors, (2082), 10 states have call successors, (10), 1 states have call predecessors, (10), 1 states have return successors, (10), 10 states have call predecessors, (10), 10 states have call successors, (10) [2025-03-16 21:38:52,991 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1603 states to 1603 states and 2102 transitions. [2025-03-16 21:38:52,991 INFO L78 Accepts]: Start accepts. Automaton has 1603 states and 2102 transitions. Word has length 474 [2025-03-16 21:38:52,991 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-16 21:38:52,991 INFO L471 AbstractCegarLoop]: Abstraction has 1603 states and 2102 transitions. [2025-03-16 21:38:52,991 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 89.4) internal successors, (447), 5 states have internal predecessors, (447), 2 states have call successors, (6), 1 states have call predecessors, (6), 1 states have return successors, (6), 2 states have call predecessors, (6), 2 states have call successors, (6) [2025-03-16 21:38:52,991 INFO L276 IsEmpty]: Start isEmpty. Operand 1603 states and 2102 transitions. [2025-03-16 21:38:52,995 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 476 [2025-03-16 21:38:52,995 INFO L210 NwaCegarLoop]: Found error trace [2025-03-16 21:38:52,995 INFO L218 NwaCegarLoop]: trace histogram [6, 6, 6, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-03-16 21:38:52,995 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable55 [2025-03-16 21:38:52,995 INFO L396 AbstractCegarLoop]: === Iteration 57 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-03-16 21:38:52,996 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-16 21:38:52,996 INFO L85 PathProgramCache]: Analyzing trace with hash -415126603, now seen corresponding path program 1 times [2025-03-16 21:38:52,996 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-16 21:38:52,996 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [227986577] [2025-03-16 21:38:52,996 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-16 21:38:52,996 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-16 21:38:53,089 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 475 statements into 1 equivalence classes. [2025-03-16 21:38:53,254 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 475 of 475 statements. [2025-03-16 21:38:53,254 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-16 21:38:53,254 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-16 21:38:53,731 INFO L134 CoverageAnalysis]: Checked inductivity of 181 backedges. 121 proven. 0 refuted. 0 times theorem prover too weak. 60 trivial. 0 not checked. [2025-03-16 21:38:53,731 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-16 21:38:53,731 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [227986577] [2025-03-16 21:38:53,731 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [227986577] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-16 21:38:53,731 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-16 21:38:53,731 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2025-03-16 21:38:53,731 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [223287912] [2025-03-16 21:38:53,731 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-16 21:38:53,731 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2025-03-16 21:38:53,731 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-16 21:38:53,732 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2025-03-16 21:38:53,732 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=8, Invalid=12, Unknown=0, NotChecked=0, Total=20 [2025-03-16 21:38:53,732 INFO L87 Difference]: Start difference. First operand 1603 states and 2102 transitions. Second operand has 5 states, 5 states have (on average 89.6) internal successors, (448), 5 states have internal predecessors, (448), 2 states have call successors, (6), 1 states have call predecessors, (6), 1 states have return successors, (6), 2 states have call predecessors, (6), 2 states have call successors, (6) [2025-03-16 21:38:53,997 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-16 21:38:53,998 INFO L93 Difference]: Finished difference Result 2676 states and 3538 transitions. [2025-03-16 21:38:53,998 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2025-03-16 21:38:53,998 INFO L78 Accepts]: Start accepts. Automaton has has 5 states, 5 states have (on average 89.6) internal successors, (448), 5 states have internal predecessors, (448), 2 states have call successors, (6), 1 states have call predecessors, (6), 1 states have return successors, (6), 2 states have call predecessors, (6), 2 states have call successors, (6) Word has length 475 [2025-03-16 21:38:53,998 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-16 21:38:53,999 INFO L225 Difference]: With dead ends: 2676 [2025-03-16 21:38:53,999 INFO L226 Difference]: Without dead ends: 1603 [2025-03-16 21:38:54,000 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 6 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 4 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=13, Invalid=17, Unknown=0, NotChecked=0, Total=30 [2025-03-16 21:38:54,001 INFO L435 NwaCegarLoop]: 479 mSDtfsCounter, 536 mSDsluCounter, 486 mSDsCounter, 0 mSdLazyCounter, 582 mSolverCounterSat, 1 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 536 SdHoareTripleChecker+Valid, 965 SdHoareTripleChecker+Invalid, 583 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 1 IncrementalHoareTripleChecker+Valid, 582 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.2s IncrementalHoareTripleChecker+Time [2025-03-16 21:38:54,001 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [536 Valid, 965 Invalid, 583 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [1 Valid, 582 Invalid, 0 Unknown, 0 Unchecked, 0.2s Time] [2025-03-16 21:38:54,001 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1603 states. [2025-03-16 21:38:54,013 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1603 to 1603. [2025-03-16 21:38:54,014 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 1603 states, 1591 states have (on average 1.3073538654934003) internal successors, (2080), 1591 states have internal predecessors, (2080), 10 states have call successors, (10), 1 states have call predecessors, (10), 1 states have return successors, (10), 10 states have call predecessors, (10), 10 states have call successors, (10) [2025-03-16 21:38:54,015 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1603 states to 1603 states and 2100 transitions. [2025-03-16 21:38:54,015 INFO L78 Accepts]: Start accepts. Automaton has 1603 states and 2100 transitions. Word has length 475 [2025-03-16 21:38:54,015 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-16 21:38:54,015 INFO L471 AbstractCegarLoop]: Abstraction has 1603 states and 2100 transitions. [2025-03-16 21:38:54,015 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 89.6) internal successors, (448), 5 states have internal predecessors, (448), 2 states have call successors, (6), 1 states have call predecessors, (6), 1 states have return successors, (6), 2 states have call predecessors, (6), 2 states have call successors, (6) [2025-03-16 21:38:54,016 INFO L276 IsEmpty]: Start isEmpty. Operand 1603 states and 2100 transitions. [2025-03-16 21:38:54,018 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 477 [2025-03-16 21:38:54,018 INFO L210 NwaCegarLoop]: Found error trace [2025-03-16 21:38:54,018 INFO L218 NwaCegarLoop]: trace histogram [6, 6, 6, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-03-16 21:38:54,018 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable56 [2025-03-16 21:38:54,018 INFO L396 AbstractCegarLoop]: === Iteration 58 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-03-16 21:38:54,018 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-16 21:38:54,018 INFO L85 PathProgramCache]: Analyzing trace with hash -2025687105, now seen corresponding path program 1 times [2025-03-16 21:38:54,018 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-16 21:38:54,019 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [110642856] [2025-03-16 21:38:54,019 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-16 21:38:54,019 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-16 21:38:54,087 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 476 statements into 1 equivalence classes. [2025-03-16 21:38:54,501 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 476 of 476 statements. [2025-03-16 21:38:54,501 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-16 21:38:54,501 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-16 21:38:55,061 INFO L134 CoverageAnalysis]: Checked inductivity of 181 backedges. 121 proven. 0 refuted. 0 times theorem prover too weak. 60 trivial. 0 not checked. [2025-03-16 21:38:55,061 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-16 21:38:55,061 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [110642856] [2025-03-16 21:38:55,061 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [110642856] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-16 21:38:55,061 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-16 21:38:55,061 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2025-03-16 21:38:55,061 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1299750358] [2025-03-16 21:38:55,061 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-16 21:38:55,062 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2025-03-16 21:38:55,062 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-16 21:38:55,062 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2025-03-16 21:38:55,062 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=8, Invalid=12, Unknown=0, NotChecked=0, Total=20 [2025-03-16 21:38:55,062 INFO L87 Difference]: Start difference. First operand 1603 states and 2100 transitions. Second operand has 5 states, 5 states have (on average 89.8) internal successors, (449), 5 states have internal predecessors, (449), 2 states have call successors, (6), 1 states have call predecessors, (6), 1 states have return successors, (6), 2 states have call predecessors, (6), 2 states have call successors, (6) [2025-03-16 21:38:55,212 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-16 21:38:55,212 INFO L93 Difference]: Finished difference Result 2676 states and 3534 transitions. [2025-03-16 21:38:55,212 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2025-03-16 21:38:55,213 INFO L78 Accepts]: Start accepts. Automaton has has 5 states, 5 states have (on average 89.8) internal successors, (449), 5 states have internal predecessors, (449), 2 states have call successors, (6), 1 states have call predecessors, (6), 1 states have return successors, (6), 2 states have call predecessors, (6), 2 states have call successors, (6) Word has length 476 [2025-03-16 21:38:55,213 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-16 21:38:55,214 INFO L225 Difference]: With dead ends: 2676 [2025-03-16 21:38:55,214 INFO L226 Difference]: Without dead ends: 1603 [2025-03-16 21:38:55,215 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 7 GetRequests, 3 SyntacticMatches, 0 SemanticMatches, 4 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=13, Invalid=17, Unknown=0, NotChecked=0, Total=30 [2025-03-16 21:38:55,215 INFO L435 NwaCegarLoop]: 623 mSDtfsCounter, 654 mSDsluCounter, 630 mSDsCounter, 0 mSdLazyCounter, 292 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 654 SdHoareTripleChecker+Valid, 1253 SdHoareTripleChecker+Invalid, 292 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 292 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2025-03-16 21:38:55,215 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [654 Valid, 1253 Invalid, 292 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 292 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2025-03-16 21:38:55,216 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1603 states. [2025-03-16 21:38:55,229 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1603 to 1603. [2025-03-16 21:38:55,230 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 1603 states, 1591 states have (on average 1.3060967944688875) internal successors, (2078), 1591 states have internal predecessors, (2078), 10 states have call successors, (10), 1 states have call predecessors, (10), 1 states have return successors, (10), 10 states have call predecessors, (10), 10 states have call successors, (10) [2025-03-16 21:38:55,231 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1603 states to 1603 states and 2098 transitions. [2025-03-16 21:38:55,231 INFO L78 Accepts]: Start accepts. Automaton has 1603 states and 2098 transitions. Word has length 476 [2025-03-16 21:38:55,231 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-16 21:38:55,231 INFO L471 AbstractCegarLoop]: Abstraction has 1603 states and 2098 transitions. [2025-03-16 21:38:55,232 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 89.8) internal successors, (449), 5 states have internal predecessors, (449), 2 states have call successors, (6), 1 states have call predecessors, (6), 1 states have return successors, (6), 2 states have call predecessors, (6), 2 states have call successors, (6) [2025-03-16 21:38:55,232 INFO L276 IsEmpty]: Start isEmpty. Operand 1603 states and 2098 transitions. [2025-03-16 21:38:55,234 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 478 [2025-03-16 21:38:55,234 INFO L210 NwaCegarLoop]: Found error trace [2025-03-16 21:38:55,234 INFO L218 NwaCegarLoop]: trace histogram [6, 6, 6, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-03-16 21:38:55,235 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable57 [2025-03-16 21:38:55,235 INFO L396 AbstractCegarLoop]: === Iteration 59 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-03-16 21:38:55,235 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-16 21:38:55,235 INFO L85 PathProgramCache]: Analyzing trace with hash -1796280268, now seen corresponding path program 1 times [2025-03-16 21:38:55,235 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-16 21:38:55,235 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1523896650] [2025-03-16 21:38:55,236 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-16 21:38:55,236 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-16 21:38:55,309 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 477 statements into 1 equivalence classes. [2025-03-16 21:38:55,752 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 477 of 477 statements. [2025-03-16 21:38:55,753 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-16 21:38:55,753 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-16 21:38:56,282 INFO L134 CoverageAnalysis]: Checked inductivity of 181 backedges. 121 proven. 0 refuted. 0 times theorem prover too weak. 60 trivial. 0 not checked. [2025-03-16 21:38:56,283 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-16 21:38:56,283 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1523896650] [2025-03-16 21:38:56,283 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1523896650] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-16 21:38:56,283 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-16 21:38:56,283 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2025-03-16 21:38:56,283 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [657086258] [2025-03-16 21:38:56,283 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-16 21:38:56,283 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2025-03-16 21:38:56,283 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-16 21:38:56,284 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2025-03-16 21:38:56,284 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=8, Invalid=12, Unknown=0, NotChecked=0, Total=20 [2025-03-16 21:38:56,284 INFO L87 Difference]: Start difference. First operand 1603 states and 2098 transitions. Second operand has 5 states, 5 states have (on average 90.0) internal successors, (450), 5 states have internal predecessors, (450), 2 states have call successors, (6), 1 states have call predecessors, (6), 1 states have return successors, (6), 2 states have call predecessors, (6), 2 states have call successors, (6) [2025-03-16 21:38:56,480 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-16 21:38:56,480 INFO L93 Difference]: Finished difference Result 2676 states and 3530 transitions. [2025-03-16 21:38:56,480 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2025-03-16 21:38:56,480 INFO L78 Accepts]: Start accepts. Automaton has has 5 states, 5 states have (on average 90.0) internal successors, (450), 5 states have internal predecessors, (450), 2 states have call successors, (6), 1 states have call predecessors, (6), 1 states have return successors, (6), 2 states have call predecessors, (6), 2 states have call successors, (6) Word has length 477 [2025-03-16 21:38:56,481 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-16 21:38:56,482 INFO L225 Difference]: With dead ends: 2676 [2025-03-16 21:38:56,482 INFO L226 Difference]: Without dead ends: 1603 [2025-03-16 21:38:56,483 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 7 GetRequests, 3 SyntacticMatches, 0 SemanticMatches, 4 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=13, Invalid=17, Unknown=0, NotChecked=0, Total=30 [2025-03-16 21:38:56,483 INFO L435 NwaCegarLoop]: 612 mSDtfsCounter, 1158 mSDsluCounter, 613 mSDsCounter, 0 mSdLazyCounter, 312 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 1158 SdHoareTripleChecker+Valid, 1225 SdHoareTripleChecker+Invalid, 312 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 312 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.2s IncrementalHoareTripleChecker+Time [2025-03-16 21:38:56,484 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [1158 Valid, 1225 Invalid, 312 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 312 Invalid, 0 Unknown, 0 Unchecked, 0.2s Time] [2025-03-16 21:38:56,484 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1603 states. [2025-03-16 21:38:56,497 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1603 to 1603. [2025-03-16 21:38:56,498 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 1603 states, 1591 states have (on average 1.3048397234443747) internal successors, (2076), 1591 states have internal predecessors, (2076), 10 states have call successors, (10), 1 states have call predecessors, (10), 1 states have return successors, (10), 10 states have call predecessors, (10), 10 states have call successors, (10) [2025-03-16 21:38:56,499 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1603 states to 1603 states and 2096 transitions. [2025-03-16 21:38:56,499 INFO L78 Accepts]: Start accepts. Automaton has 1603 states and 2096 transitions. Word has length 477 [2025-03-16 21:38:56,499 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-16 21:38:56,499 INFO L471 AbstractCegarLoop]: Abstraction has 1603 states and 2096 transitions. [2025-03-16 21:38:56,500 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 90.0) internal successors, (450), 5 states have internal predecessors, (450), 2 states have call successors, (6), 1 states have call predecessors, (6), 1 states have return successors, (6), 2 states have call predecessors, (6), 2 states have call successors, (6) [2025-03-16 21:38:56,500 INFO L276 IsEmpty]: Start isEmpty. Operand 1603 states and 2096 transitions. [2025-03-16 21:38:56,502 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 479 [2025-03-16 21:38:56,502 INFO L210 NwaCegarLoop]: Found error trace [2025-03-16 21:38:56,502 INFO L218 NwaCegarLoop]: trace histogram [6, 6, 6, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-03-16 21:38:56,502 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable58 [2025-03-16 21:38:56,502 INFO L396 AbstractCegarLoop]: === Iteration 60 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-03-16 21:38:56,503 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-16 21:38:56,503 INFO L85 PathProgramCache]: Analyzing trace with hash -2114020608, now seen corresponding path program 1 times [2025-03-16 21:38:56,503 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-16 21:38:56,503 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [161132441] [2025-03-16 21:38:56,503 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-16 21:38:56,503 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-16 21:38:56,578 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 478 statements into 1 equivalence classes. [2025-03-16 21:38:56,972 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 478 of 478 statements. [2025-03-16 21:38:56,972 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-16 21:38:56,972 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-16 21:38:57,520 INFO L134 CoverageAnalysis]: Checked inductivity of 181 backedges. 121 proven. 0 refuted. 0 times theorem prover too weak. 60 trivial. 0 not checked. [2025-03-16 21:38:57,520 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-16 21:38:57,520 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [161132441] [2025-03-16 21:38:57,520 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [161132441] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-16 21:38:57,520 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-16 21:38:57,521 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2025-03-16 21:38:57,521 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [861881427] [2025-03-16 21:38:57,521 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-16 21:38:57,521 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2025-03-16 21:38:57,521 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-16 21:38:57,521 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2025-03-16 21:38:57,521 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=8, Invalid=12, Unknown=0, NotChecked=0, Total=20 [2025-03-16 21:38:57,521 INFO L87 Difference]: Start difference. First operand 1603 states and 2096 transitions. Second operand has 5 states, 5 states have (on average 90.2) internal successors, (451), 5 states have internal predecessors, (451), 2 states have call successors, (6), 1 states have call predecessors, (6), 1 states have return successors, (6), 2 states have call predecessors, (6), 2 states have call successors, (6) [2025-03-16 21:38:57,722 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-16 21:38:57,722 INFO L93 Difference]: Finished difference Result 2676 states and 3526 transitions. [2025-03-16 21:38:57,723 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2025-03-16 21:38:57,723 INFO L78 Accepts]: Start accepts. Automaton has has 5 states, 5 states have (on average 90.2) internal successors, (451), 5 states have internal predecessors, (451), 2 states have call successors, (6), 1 states have call predecessors, (6), 1 states have return successors, (6), 2 states have call predecessors, (6), 2 states have call successors, (6) Word has length 478 [2025-03-16 21:38:57,723 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-16 21:38:57,725 INFO L225 Difference]: With dead ends: 2676 [2025-03-16 21:38:57,725 INFO L226 Difference]: Without dead ends: 1603 [2025-03-16 21:38:57,726 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 7 GetRequests, 3 SyntacticMatches, 0 SemanticMatches, 4 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=13, Invalid=17, Unknown=0, NotChecked=0, Total=30 [2025-03-16 21:38:57,726 INFO L435 NwaCegarLoop]: 612 mSDtfsCounter, 645 mSDsluCounter, 619 mSDsCounter, 0 mSdLazyCounter, 310 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 645 SdHoareTripleChecker+Valid, 1231 SdHoareTripleChecker+Invalid, 310 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 310 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.2s IncrementalHoareTripleChecker+Time [2025-03-16 21:38:57,726 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [645 Valid, 1231 Invalid, 310 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 310 Invalid, 0 Unknown, 0 Unchecked, 0.2s Time] [2025-03-16 21:38:57,727 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1603 states. [2025-03-16 21:38:57,741 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1603 to 1603. [2025-03-16 21:38:57,742 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 1603 states, 1591 states have (on average 1.3035826524198617) internal successors, (2074), 1591 states have internal predecessors, (2074), 10 states have call successors, (10), 1 states have call predecessors, (10), 1 states have return successors, (10), 10 states have call predecessors, (10), 10 states have call successors, (10) [2025-03-16 21:38:57,743 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1603 states to 1603 states and 2094 transitions. [2025-03-16 21:38:57,743 INFO L78 Accepts]: Start accepts. Automaton has 1603 states and 2094 transitions. Word has length 478 [2025-03-16 21:38:57,744 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-16 21:38:57,744 INFO L471 AbstractCegarLoop]: Abstraction has 1603 states and 2094 transitions. [2025-03-16 21:38:57,744 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 90.2) internal successors, (451), 5 states have internal predecessors, (451), 2 states have call successors, (6), 1 states have call predecessors, (6), 1 states have return successors, (6), 2 states have call predecessors, (6), 2 states have call successors, (6) [2025-03-16 21:38:57,744 INFO L276 IsEmpty]: Start isEmpty. Operand 1603 states and 2094 transitions. [2025-03-16 21:38:57,746 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 480 [2025-03-16 21:38:57,746 INFO L210 NwaCegarLoop]: Found error trace [2025-03-16 21:38:57,747 INFO L218 NwaCegarLoop]: trace histogram [6, 6, 6, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-03-16 21:38:57,747 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable59 [2025-03-16 21:38:57,747 INFO L396 AbstractCegarLoop]: === Iteration 61 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-03-16 21:38:57,747 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-16 21:38:57,748 INFO L85 PathProgramCache]: Analyzing trace with hash -1554872803, now seen corresponding path program 1 times [2025-03-16 21:38:57,748 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-16 21:38:57,748 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [46084785] [2025-03-16 21:38:57,748 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-16 21:38:57,748 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-16 21:38:57,824 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 479 statements into 1 equivalence classes. [2025-03-16 21:38:58,279 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 479 of 479 statements. [2025-03-16 21:38:58,279 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-16 21:38:58,279 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-16 21:38:58,789 INFO L134 CoverageAnalysis]: Checked inductivity of 181 backedges. 121 proven. 0 refuted. 0 times theorem prover too weak. 60 trivial. 0 not checked. [2025-03-16 21:38:58,789 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-16 21:38:58,789 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [46084785] [2025-03-16 21:38:58,789 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [46084785] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-16 21:38:58,789 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-16 21:38:58,789 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2025-03-16 21:38:58,789 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1042526960] [2025-03-16 21:38:58,789 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-16 21:38:58,789 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2025-03-16 21:38:58,789 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-16 21:38:58,790 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2025-03-16 21:38:58,790 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2025-03-16 21:38:58,790 INFO L87 Difference]: Start difference. First operand 1603 states and 2094 transitions. Second operand has 4 states, 4 states have (on average 113.0) internal successors, (452), 4 states have internal predecessors, (452), 2 states have call successors, (6), 1 states have call predecessors, (6), 1 states have return successors, (6), 2 states have call predecessors, (6), 2 states have call successors, (6) [2025-03-16 21:38:58,979 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-16 21:38:58,979 INFO L93 Difference]: Finished difference Result 2676 states and 3522 transitions. [2025-03-16 21:38:58,979 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2025-03-16 21:38:58,979 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 4 states have (on average 113.0) internal successors, (452), 4 states have internal predecessors, (452), 2 states have call successors, (6), 1 states have call predecessors, (6), 1 states have return successors, (6), 2 states have call predecessors, (6), 2 states have call successors, (6) Word has length 479 [2025-03-16 21:38:58,980 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-16 21:38:58,981 INFO L225 Difference]: With dead ends: 2676 [2025-03-16 21:38:58,981 INFO L226 Difference]: Without dead ends: 1603 [2025-03-16 21:38:58,982 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 8 GetRequests, 5 SyntacticMatches, 0 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=9, Invalid=11, Unknown=0, NotChecked=0, Total=20 [2025-03-16 21:38:58,982 INFO L435 NwaCegarLoop]: 612 mSDtfsCounter, 495 mSDsluCounter, 613 mSDsCounter, 0 mSdLazyCounter, 308 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 495 SdHoareTripleChecker+Valid, 1225 SdHoareTripleChecker+Invalid, 308 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 308 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.2s IncrementalHoareTripleChecker+Time [2025-03-16 21:38:58,982 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [495 Valid, 1225 Invalid, 308 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 308 Invalid, 0 Unknown, 0 Unchecked, 0.2s Time] [2025-03-16 21:38:58,983 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1603 states. [2025-03-16 21:38:58,998 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1603 to 1603. [2025-03-16 21:38:58,999 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 1603 states, 1591 states have (on average 1.302325581395349) internal successors, (2072), 1591 states have internal predecessors, (2072), 10 states have call successors, (10), 1 states have call predecessors, (10), 1 states have return successors, (10), 10 states have call predecessors, (10), 10 states have call successors, (10) [2025-03-16 21:38:59,039 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1603 states to 1603 states and 2092 transitions. [2025-03-16 21:38:59,040 INFO L78 Accepts]: Start accepts. Automaton has 1603 states and 2092 transitions. Word has length 479 [2025-03-16 21:38:59,040 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-16 21:38:59,040 INFO L471 AbstractCegarLoop]: Abstraction has 1603 states and 2092 transitions. [2025-03-16 21:38:59,040 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 113.0) internal successors, (452), 4 states have internal predecessors, (452), 2 states have call successors, (6), 1 states have call predecessors, (6), 1 states have return successors, (6), 2 states have call predecessors, (6), 2 states have call successors, (6) [2025-03-16 21:38:59,040 INFO L276 IsEmpty]: Start isEmpty. Operand 1603 states and 2092 transitions. [2025-03-16 21:38:59,043 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 481 [2025-03-16 21:38:59,043 INFO L210 NwaCegarLoop]: Found error trace [2025-03-16 21:38:59,043 INFO L218 NwaCegarLoop]: trace histogram [6, 6, 6, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-03-16 21:38:59,043 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable60 [2025-03-16 21:38:59,043 INFO L396 AbstractCegarLoop]: === Iteration 62 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-03-16 21:38:59,044 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-16 21:38:59,044 INFO L85 PathProgramCache]: Analyzing trace with hash 212816851, now seen corresponding path program 1 times [2025-03-16 21:38:59,044 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-16 21:38:59,044 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1045980593] [2025-03-16 21:38:59,044 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-16 21:38:59,044 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-16 21:38:59,118 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 480 statements into 1 equivalence classes. [2025-03-16 21:38:59,603 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 480 of 480 statements. [2025-03-16 21:38:59,603 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-16 21:38:59,603 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-16 21:39:00,114 INFO L134 CoverageAnalysis]: Checked inductivity of 181 backedges. 121 proven. 0 refuted. 0 times theorem prover too weak. 60 trivial. 0 not checked. [2025-03-16 21:39:00,114 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-16 21:39:00,114 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1045980593] [2025-03-16 21:39:00,114 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1045980593] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-16 21:39:00,114 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-16 21:39:00,114 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2025-03-16 21:39:00,114 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [440366922] [2025-03-16 21:39:00,114 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-16 21:39:00,114 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2025-03-16 21:39:00,114 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-16 21:39:00,115 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2025-03-16 21:39:00,115 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=8, Invalid=12, Unknown=0, NotChecked=0, Total=20 [2025-03-16 21:39:00,115 INFO L87 Difference]: Start difference. First operand 1603 states and 2092 transitions. Second operand has 5 states, 5 states have (on average 90.6) internal successors, (453), 5 states have internal predecessors, (453), 2 states have call successors, (6), 1 states have call predecessors, (6), 1 states have return successors, (6), 2 states have call predecessors, (6), 2 states have call successors, (6) [2025-03-16 21:39:00,335 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-16 21:39:00,336 INFO L93 Difference]: Finished difference Result 2676 states and 3518 transitions. [2025-03-16 21:39:00,336 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2025-03-16 21:39:00,336 INFO L78 Accepts]: Start accepts. Automaton has has 5 states, 5 states have (on average 90.6) internal successors, (453), 5 states have internal predecessors, (453), 2 states have call successors, (6), 1 states have call predecessors, (6), 1 states have return successors, (6), 2 states have call predecessors, (6), 2 states have call successors, (6) Word has length 480 [2025-03-16 21:39:00,336 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-16 21:39:00,337 INFO L225 Difference]: With dead ends: 2676 [2025-03-16 21:39:00,337 INFO L226 Difference]: Without dead ends: 1603 [2025-03-16 21:39:00,338 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 7 GetRequests, 3 SyntacticMatches, 0 SemanticMatches, 4 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=13, Invalid=17, Unknown=0, NotChecked=0, Total=30 [2025-03-16 21:39:00,339 INFO L435 NwaCegarLoop]: 589 mSDtfsCounter, 1193 mSDsluCounter, 590 mSDsCounter, 0 mSdLazyCounter, 352 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 1193 SdHoareTripleChecker+Valid, 1179 SdHoareTripleChecker+Invalid, 352 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 352 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.2s IncrementalHoareTripleChecker+Time [2025-03-16 21:39:00,339 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [1193 Valid, 1179 Invalid, 352 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 352 Invalid, 0 Unknown, 0 Unchecked, 0.2s Time] [2025-03-16 21:39:00,339 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1603 states. [2025-03-16 21:39:00,352 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1603 to 1603. [2025-03-16 21:39:00,353 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 1603 states, 1591 states have (on average 1.301068510370836) internal successors, (2070), 1591 states have internal predecessors, (2070), 10 states have call successors, (10), 1 states have call predecessors, (10), 1 states have return successors, (10), 10 states have call predecessors, (10), 10 states have call successors, (10) [2025-03-16 21:39:00,354 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1603 states to 1603 states and 2090 transitions. [2025-03-16 21:39:00,355 INFO L78 Accepts]: Start accepts. Automaton has 1603 states and 2090 transitions. Word has length 480 [2025-03-16 21:39:00,355 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-16 21:39:00,355 INFO L471 AbstractCegarLoop]: Abstraction has 1603 states and 2090 transitions. [2025-03-16 21:39:00,355 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 90.6) internal successors, (453), 5 states have internal predecessors, (453), 2 states have call successors, (6), 1 states have call predecessors, (6), 1 states have return successors, (6), 2 states have call predecessors, (6), 2 states have call successors, (6) [2025-03-16 21:39:00,355 INFO L276 IsEmpty]: Start isEmpty. Operand 1603 states and 2090 transitions. [2025-03-16 21:39:00,357 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 482 [2025-03-16 21:39:00,357 INFO L210 NwaCegarLoop]: Found error trace [2025-03-16 21:39:00,357 INFO L218 NwaCegarLoop]: trace histogram [6, 6, 6, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-03-16 21:39:00,357 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable61 [2025-03-16 21:39:00,358 INFO L396 AbstractCegarLoop]: === Iteration 63 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-03-16 21:39:00,358 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-16 21:39:00,358 INFO L85 PathProgramCache]: Analyzing trace with hash 1793931418, now seen corresponding path program 1 times [2025-03-16 21:39:00,358 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-16 21:39:00,358 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [470225758] [2025-03-16 21:39:00,358 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-16 21:39:00,358 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-16 21:39:00,432 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 481 statements into 1 equivalence classes. [2025-03-16 21:39:00,953 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 481 of 481 statements. [2025-03-16 21:39:00,953 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-16 21:39:00,953 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-16 21:39:01,554 INFO L134 CoverageAnalysis]: Checked inductivity of 181 backedges. 121 proven. 0 refuted. 0 times theorem prover too weak. 60 trivial. 0 not checked. [2025-03-16 21:39:01,554 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-16 21:39:01,554 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [470225758] [2025-03-16 21:39:01,554 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [470225758] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-16 21:39:01,554 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-16 21:39:01,554 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2025-03-16 21:39:01,554 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1172876835] [2025-03-16 21:39:01,554 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-16 21:39:01,555 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2025-03-16 21:39:01,555 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-16 21:39:01,555 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2025-03-16 21:39:01,555 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=8, Invalid=12, Unknown=0, NotChecked=0, Total=20 [2025-03-16 21:39:01,555 INFO L87 Difference]: Start difference. First operand 1603 states and 2090 transitions. Second operand has 5 states, 5 states have (on average 90.8) internal successors, (454), 5 states have internal predecessors, (454), 2 states have call successors, (6), 1 states have call predecessors, (6), 1 states have return successors, (6), 2 states have call predecessors, (6), 2 states have call successors, (6) [2025-03-16 21:39:01,768 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-16 21:39:01,768 INFO L93 Difference]: Finished difference Result 2676 states and 3514 transitions. [2025-03-16 21:39:01,769 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2025-03-16 21:39:01,769 INFO L78 Accepts]: Start accepts. Automaton has has 5 states, 5 states have (on average 90.8) internal successors, (454), 5 states have internal predecessors, (454), 2 states have call successors, (6), 1 states have call predecessors, (6), 1 states have return successors, (6), 2 states have call predecessors, (6), 2 states have call successors, (6) Word has length 481 [2025-03-16 21:39:01,769 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-16 21:39:01,770 INFO L225 Difference]: With dead ends: 2676 [2025-03-16 21:39:01,770 INFO L226 Difference]: Without dead ends: 1603 [2025-03-16 21:39:01,771 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 7 GetRequests, 3 SyntacticMatches, 0 SemanticMatches, 4 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=13, Invalid=17, Unknown=0, NotChecked=0, Total=30 [2025-03-16 21:39:01,772 INFO L435 NwaCegarLoop]: 589 mSDtfsCounter, 627 mSDsluCounter, 596 mSDsCounter, 0 mSdLazyCounter, 350 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 627 SdHoareTripleChecker+Valid, 1185 SdHoareTripleChecker+Invalid, 350 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 350 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.2s IncrementalHoareTripleChecker+Time [2025-03-16 21:39:01,772 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [627 Valid, 1185 Invalid, 350 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 350 Invalid, 0 Unknown, 0 Unchecked, 0.2s Time] [2025-03-16 21:39:01,772 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1603 states. [2025-03-16 21:39:01,785 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1603 to 1603. [2025-03-16 21:39:01,786 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 1603 states, 1591 states have (on average 1.2998114393463231) internal successors, (2068), 1591 states have internal predecessors, (2068), 10 states have call successors, (10), 1 states have call predecessors, (10), 1 states have return successors, (10), 10 states have call predecessors, (10), 10 states have call successors, (10) [2025-03-16 21:39:01,787 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1603 states to 1603 states and 2088 transitions. [2025-03-16 21:39:01,787 INFO L78 Accepts]: Start accepts. Automaton has 1603 states and 2088 transitions. Word has length 481 [2025-03-16 21:39:01,787 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-16 21:39:01,787 INFO L471 AbstractCegarLoop]: Abstraction has 1603 states and 2088 transitions. [2025-03-16 21:39:01,787 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 90.8) internal successors, (454), 5 states have internal predecessors, (454), 2 states have call successors, (6), 1 states have call predecessors, (6), 1 states have return successors, (6), 2 states have call predecessors, (6), 2 states have call successors, (6) [2025-03-16 21:39:01,787 INFO L276 IsEmpty]: Start isEmpty. Operand 1603 states and 2088 transitions. [2025-03-16 21:39:01,790 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 483 [2025-03-16 21:39:01,790 INFO L210 NwaCegarLoop]: Found error trace [2025-03-16 21:39:01,790 INFO L218 NwaCegarLoop]: trace histogram [6, 6, 6, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-03-16 21:39:01,790 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable62 [2025-03-16 21:39:01,790 INFO L396 AbstractCegarLoop]: === Iteration 64 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-03-16 21:39:01,791 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-16 21:39:01,791 INFO L85 PathProgramCache]: Analyzing trace with hash -535015382, now seen corresponding path program 1 times [2025-03-16 21:39:01,791 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-16 21:39:01,791 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [104655402] [2025-03-16 21:39:01,791 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-16 21:39:01,791 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-16 21:39:01,871 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 482 statements into 1 equivalence classes. [2025-03-16 21:39:02,314 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 482 of 482 statements. [2025-03-16 21:39:02,314 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-16 21:39:02,314 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-16 21:39:02,905 INFO L134 CoverageAnalysis]: Checked inductivity of 181 backedges. 121 proven. 0 refuted. 0 times theorem prover too weak. 60 trivial. 0 not checked. [2025-03-16 21:39:02,906 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-16 21:39:02,906 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [104655402] [2025-03-16 21:39:02,906 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [104655402] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-16 21:39:02,906 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-16 21:39:02,906 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2025-03-16 21:39:02,906 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1498695136] [2025-03-16 21:39:02,906 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-16 21:39:02,906 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2025-03-16 21:39:02,906 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-16 21:39:02,907 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2025-03-16 21:39:02,907 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2025-03-16 21:39:02,907 INFO L87 Difference]: Start difference. First operand 1603 states and 2088 transitions. Second operand has 4 states, 4 states have (on average 113.75) internal successors, (455), 4 states have internal predecessors, (455), 2 states have call successors, (6), 1 states have call predecessors, (6), 1 states have return successors, (6), 2 states have call predecessors, (6), 2 states have call successors, (6) [2025-03-16 21:39:03,083 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-16 21:39:03,083 INFO L93 Difference]: Finished difference Result 2676 states and 3510 transitions. [2025-03-16 21:39:03,083 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2025-03-16 21:39:03,084 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 4 states have (on average 113.75) internal successors, (455), 4 states have internal predecessors, (455), 2 states have call successors, (6), 1 states have call predecessors, (6), 1 states have return successors, (6), 2 states have call predecessors, (6), 2 states have call successors, (6) Word has length 482 [2025-03-16 21:39:03,084 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-16 21:39:03,085 INFO L225 Difference]: With dead ends: 2676 [2025-03-16 21:39:03,085 INFO L226 Difference]: Without dead ends: 1603 [2025-03-16 21:39:03,086 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 7 GetRequests, 4 SyntacticMatches, 0 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=9, Invalid=11, Unknown=0, NotChecked=0, Total=20 [2025-03-16 21:39:03,086 INFO L435 NwaCegarLoop]: 589 mSDtfsCounter, 548 mSDsluCounter, 590 mSDsCounter, 0 mSdLazyCounter, 348 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 548 SdHoareTripleChecker+Valid, 1179 SdHoareTripleChecker+Invalid, 348 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 348 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.2s IncrementalHoareTripleChecker+Time [2025-03-16 21:39:03,086 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [548 Valid, 1179 Invalid, 348 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 348 Invalid, 0 Unknown, 0 Unchecked, 0.2s Time] [2025-03-16 21:39:03,087 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1603 states. [2025-03-16 21:39:03,098 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1603 to 1603. [2025-03-16 21:39:03,099 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 1603 states, 1591 states have (on average 1.2985543683218101) internal successors, (2066), 1591 states have internal predecessors, (2066), 10 states have call successors, (10), 1 states have call predecessors, (10), 1 states have return successors, (10), 10 states have call predecessors, (10), 10 states have call successors, (10) [2025-03-16 21:39:03,100 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1603 states to 1603 states and 2086 transitions. [2025-03-16 21:39:03,100 INFO L78 Accepts]: Start accepts. Automaton has 1603 states and 2086 transitions. Word has length 482 [2025-03-16 21:39:03,101 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-16 21:39:03,101 INFO L471 AbstractCegarLoop]: Abstraction has 1603 states and 2086 transitions. [2025-03-16 21:39:03,101 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 113.75) internal successors, (455), 4 states have internal predecessors, (455), 2 states have call successors, (6), 1 states have call predecessors, (6), 1 states have return successors, (6), 2 states have call predecessors, (6), 2 states have call successors, (6) [2025-03-16 21:39:03,101 INFO L276 IsEmpty]: Start isEmpty. Operand 1603 states and 2086 transitions. [2025-03-16 21:39:03,103 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 484 [2025-03-16 21:39:03,103 INFO L210 NwaCegarLoop]: Found error trace [2025-03-16 21:39:03,103 INFO L218 NwaCegarLoop]: trace histogram [6, 6, 6, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-03-16 21:39:03,103 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable63 [2025-03-16 21:39:03,103 INFO L396 AbstractCegarLoop]: === Iteration 65 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-03-16 21:39:03,104 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-16 21:39:03,104 INFO L85 PathProgramCache]: Analyzing trace with hash -2042291143, now seen corresponding path program 1 times [2025-03-16 21:39:03,104 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-16 21:39:03,104 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [442213440] [2025-03-16 21:39:03,104 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-16 21:39:03,104 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-16 21:39:03,173 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 483 statements into 1 equivalence classes. [2025-03-16 21:39:03,625 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 483 of 483 statements. [2025-03-16 21:39:03,625 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-16 21:39:03,625 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-16 21:39:04,143 INFO L134 CoverageAnalysis]: Checked inductivity of 181 backedges. 121 proven. 0 refuted. 0 times theorem prover too weak. 60 trivial. 0 not checked. [2025-03-16 21:39:04,143 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-16 21:39:04,143 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [442213440] [2025-03-16 21:39:04,143 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [442213440] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-16 21:39:04,143 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-16 21:39:04,143 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2025-03-16 21:39:04,143 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [732027677] [2025-03-16 21:39:04,143 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-16 21:39:04,144 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2025-03-16 21:39:04,144 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-16 21:39:04,144 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2025-03-16 21:39:04,144 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=8, Invalid=12, Unknown=0, NotChecked=0, Total=20 [2025-03-16 21:39:04,144 INFO L87 Difference]: Start difference. First operand 1603 states and 2086 transitions. Second operand has 5 states, 5 states have (on average 91.2) internal successors, (456), 5 states have internal predecessors, (456), 2 states have call successors, (6), 1 states have call predecessors, (6), 1 states have return successors, (6), 2 states have call predecessors, (6), 2 states have call successors, (6) [2025-03-16 21:39:04,352 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-16 21:39:04,352 INFO L93 Difference]: Finished difference Result 2676 states and 3506 transitions. [2025-03-16 21:39:04,352 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2025-03-16 21:39:04,352 INFO L78 Accepts]: Start accepts. Automaton has has 5 states, 5 states have (on average 91.2) internal successors, (456), 5 states have internal predecessors, (456), 2 states have call successors, (6), 1 states have call predecessors, (6), 1 states have return successors, (6), 2 states have call predecessors, (6), 2 states have call successors, (6) Word has length 483 [2025-03-16 21:39:04,353 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-16 21:39:04,354 INFO L225 Difference]: With dead ends: 2676 [2025-03-16 21:39:04,354 INFO L226 Difference]: Without dead ends: 1603 [2025-03-16 21:39:04,355 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 7 GetRequests, 3 SyntacticMatches, 0 SemanticMatches, 4 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=13, Invalid=17, Unknown=0, NotChecked=0, Total=30 [2025-03-16 21:39:04,355 INFO L435 NwaCegarLoop]: 589 mSDtfsCounter, 1163 mSDsluCounter, 590 mSDsCounter, 0 mSdLazyCounter, 346 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 1163 SdHoareTripleChecker+Valid, 1179 SdHoareTripleChecker+Invalid, 346 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 346 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.2s IncrementalHoareTripleChecker+Time [2025-03-16 21:39:04,355 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [1163 Valid, 1179 Invalid, 346 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 346 Invalid, 0 Unknown, 0 Unchecked, 0.2s Time] [2025-03-16 21:39:04,356 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1603 states. [2025-03-16 21:39:04,398 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1603 to 1603. [2025-03-16 21:39:04,399 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 1603 states, 1591 states have (on average 1.2972972972972974) internal successors, (2064), 1591 states have internal predecessors, (2064), 10 states have call successors, (10), 1 states have call predecessors, (10), 1 states have return successors, (10), 10 states have call predecessors, (10), 10 states have call successors, (10) [2025-03-16 21:39:04,400 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1603 states to 1603 states and 2084 transitions. [2025-03-16 21:39:04,400 INFO L78 Accepts]: Start accepts. Automaton has 1603 states and 2084 transitions. Word has length 483 [2025-03-16 21:39:04,401 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-16 21:39:04,401 INFO L471 AbstractCegarLoop]: Abstraction has 1603 states and 2084 transitions. [2025-03-16 21:39:04,401 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 91.2) internal successors, (456), 5 states have internal predecessors, (456), 2 states have call successors, (6), 1 states have call predecessors, (6), 1 states have return successors, (6), 2 states have call predecessors, (6), 2 states have call successors, (6) [2025-03-16 21:39:04,401 INFO L276 IsEmpty]: Start isEmpty. Operand 1603 states and 2084 transitions. [2025-03-16 21:39:04,403 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 485 [2025-03-16 21:39:04,403 INFO L210 NwaCegarLoop]: Found error trace [2025-03-16 21:39:04,403 INFO L218 NwaCegarLoop]: trace histogram [6, 6, 6, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-03-16 21:39:04,404 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable64 [2025-03-16 21:39:04,404 INFO L396 AbstractCegarLoop]: === Iteration 66 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-03-16 21:39:04,404 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-16 21:39:04,404 INFO L85 PathProgramCache]: Analyzing trace with hash -539192662, now seen corresponding path program 1 times [2025-03-16 21:39:04,404 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-16 21:39:04,404 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [667522870] [2025-03-16 21:39:04,404 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-16 21:39:04,404 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-16 21:39:04,482 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 484 statements into 1 equivalence classes. [2025-03-16 21:39:04,923 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 484 of 484 statements. [2025-03-16 21:39:04,924 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-16 21:39:04,924 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-16 21:39:05,442 INFO L134 CoverageAnalysis]: Checked inductivity of 181 backedges. 121 proven. 0 refuted. 0 times theorem prover too weak. 60 trivial. 0 not checked. [2025-03-16 21:39:05,442 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-16 21:39:05,442 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [667522870] [2025-03-16 21:39:05,442 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [667522870] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-16 21:39:05,442 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-16 21:39:05,442 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2025-03-16 21:39:05,442 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1057760454] [2025-03-16 21:39:05,442 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-16 21:39:05,442 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2025-03-16 21:39:05,443 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-16 21:39:05,443 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2025-03-16 21:39:05,443 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=8, Invalid=12, Unknown=0, NotChecked=0, Total=20 [2025-03-16 21:39:05,443 INFO L87 Difference]: Start difference. First operand 1603 states and 2084 transitions. Second operand has 5 states, 5 states have (on average 91.4) internal successors, (457), 5 states have internal predecessors, (457), 2 states have call successors, (6), 1 states have call predecessors, (6), 1 states have return successors, (6), 2 states have call predecessors, (6), 2 states have call successors, (6) [2025-03-16 21:39:05,679 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-16 21:39:05,679 INFO L93 Difference]: Finished difference Result 2676 states and 3502 transitions. [2025-03-16 21:39:05,680 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2025-03-16 21:39:05,680 INFO L78 Accepts]: Start accepts. Automaton has has 5 states, 5 states have (on average 91.4) internal successors, (457), 5 states have internal predecessors, (457), 2 states have call successors, (6), 1 states have call predecessors, (6), 1 states have return successors, (6), 2 states have call predecessors, (6), 2 states have call successors, (6) Word has length 484 [2025-03-16 21:39:05,680 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-16 21:39:05,681 INFO L225 Difference]: With dead ends: 2676 [2025-03-16 21:39:05,681 INFO L226 Difference]: Without dead ends: 1603 [2025-03-16 21:39:05,682 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 7 GetRequests, 3 SyntacticMatches, 0 SemanticMatches, 4 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=13, Invalid=17, Unknown=0, NotChecked=0, Total=30 [2025-03-16 21:39:05,683 INFO L435 NwaCegarLoop]: 589 mSDtfsCounter, 1153 mSDsluCounter, 590 mSDsCounter, 0 mSdLazyCounter, 344 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 1153 SdHoareTripleChecker+Valid, 1179 SdHoareTripleChecker+Invalid, 344 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 344 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.2s IncrementalHoareTripleChecker+Time [2025-03-16 21:39:05,683 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [1153 Valid, 1179 Invalid, 344 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 344 Invalid, 0 Unknown, 0 Unchecked, 0.2s Time] [2025-03-16 21:39:05,684 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1603 states. [2025-03-16 21:39:05,698 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1603 to 1603. [2025-03-16 21:39:05,699 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 1603 states, 1591 states have (on average 1.2960402262727844) internal successors, (2062), 1591 states have internal predecessors, (2062), 10 states have call successors, (10), 1 states have call predecessors, (10), 1 states have return successors, (10), 10 states have call predecessors, (10), 10 states have call successors, (10) [2025-03-16 21:39:05,700 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1603 states to 1603 states and 2082 transitions. [2025-03-16 21:39:05,700 INFO L78 Accepts]: Start accepts. Automaton has 1603 states and 2082 transitions. Word has length 484 [2025-03-16 21:39:05,700 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-16 21:39:05,701 INFO L471 AbstractCegarLoop]: Abstraction has 1603 states and 2082 transitions. [2025-03-16 21:39:05,701 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 91.4) internal successors, (457), 5 states have internal predecessors, (457), 2 states have call successors, (6), 1 states have call predecessors, (6), 1 states have return successors, (6), 2 states have call predecessors, (6), 2 states have call successors, (6) [2025-03-16 21:39:05,701 INFO L276 IsEmpty]: Start isEmpty. Operand 1603 states and 2082 transitions. [2025-03-16 21:39:05,703 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 486 [2025-03-16 21:39:05,703 INFO L210 NwaCegarLoop]: Found error trace [2025-03-16 21:39:05,704 INFO L218 NwaCegarLoop]: trace histogram [6, 6, 6, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-03-16 21:39:05,704 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable65 [2025-03-16 21:39:05,704 INFO L396 AbstractCegarLoop]: === Iteration 67 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-03-16 21:39:05,704 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-16 21:39:05,704 INFO L85 PathProgramCache]: Analyzing trace with hash 1602237396, now seen corresponding path program 1 times [2025-03-16 21:39:05,704 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-16 21:39:05,704 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [199319785] [2025-03-16 21:39:05,704 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-16 21:39:05,705 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-16 21:39:05,781 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 485 statements into 1 equivalence classes. [2025-03-16 21:39:06,258 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 485 of 485 statements. [2025-03-16 21:39:06,258 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-16 21:39:06,258 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-16 21:39:06,810 INFO L134 CoverageAnalysis]: Checked inductivity of 181 backedges. 121 proven. 0 refuted. 0 times theorem prover too weak. 60 trivial. 0 not checked. [2025-03-16 21:39:06,810 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-16 21:39:06,810 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [199319785] [2025-03-16 21:39:06,810 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [199319785] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-16 21:39:06,810 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-16 21:39:06,810 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2025-03-16 21:39:06,810 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1959520342] [2025-03-16 21:39:06,810 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-16 21:39:06,811 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2025-03-16 21:39:06,811 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-16 21:39:06,811 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2025-03-16 21:39:06,811 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=8, Invalid=12, Unknown=0, NotChecked=0, Total=20 [2025-03-16 21:39:06,811 INFO L87 Difference]: Start difference. First operand 1603 states and 2082 transitions. Second operand has 5 states, 5 states have (on average 91.6) internal successors, (458), 5 states have internal predecessors, (458), 2 states have call successors, (6), 1 states have call predecessors, (6), 1 states have return successors, (6), 2 states have call predecessors, (6), 2 states have call successors, (6) [2025-03-16 21:39:07,027 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-16 21:39:07,027 INFO L93 Difference]: Finished difference Result 2676 states and 3498 transitions. [2025-03-16 21:39:07,027 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2025-03-16 21:39:07,028 INFO L78 Accepts]: Start accepts. Automaton has has 5 states, 5 states have (on average 91.6) internal successors, (458), 5 states have internal predecessors, (458), 2 states have call successors, (6), 1 states have call predecessors, (6), 1 states have return successors, (6), 2 states have call predecessors, (6), 2 states have call successors, (6) Word has length 485 [2025-03-16 21:39:07,028 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-16 21:39:07,029 INFO L225 Difference]: With dead ends: 2676 [2025-03-16 21:39:07,029 INFO L226 Difference]: Without dead ends: 1603 [2025-03-16 21:39:07,030 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 7 GetRequests, 3 SyntacticMatches, 0 SemanticMatches, 4 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=13, Invalid=17, Unknown=0, NotChecked=0, Total=30 [2025-03-16 21:39:07,030 INFO L435 NwaCegarLoop]: 589 mSDtfsCounter, 1143 mSDsluCounter, 590 mSDsCounter, 0 mSdLazyCounter, 342 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 1143 SdHoareTripleChecker+Valid, 1179 SdHoareTripleChecker+Invalid, 342 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 342 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.2s IncrementalHoareTripleChecker+Time [2025-03-16 21:39:07,030 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [1143 Valid, 1179 Invalid, 342 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 342 Invalid, 0 Unknown, 0 Unchecked, 0.2s Time] [2025-03-16 21:39:07,031 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1603 states. [2025-03-16 21:39:07,042 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1603 to 1603. [2025-03-16 21:39:07,043 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 1603 states, 1591 states have (on average 1.2947831552482716) internal successors, (2060), 1591 states have internal predecessors, (2060), 10 states have call successors, (10), 1 states have call predecessors, (10), 1 states have return successors, (10), 10 states have call predecessors, (10), 10 states have call successors, (10) [2025-03-16 21:39:07,044 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1603 states to 1603 states and 2080 transitions. [2025-03-16 21:39:07,044 INFO L78 Accepts]: Start accepts. Automaton has 1603 states and 2080 transitions. Word has length 485 [2025-03-16 21:39:07,044 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-16 21:39:07,044 INFO L471 AbstractCegarLoop]: Abstraction has 1603 states and 2080 transitions. [2025-03-16 21:39:07,044 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 91.6) internal successors, (458), 5 states have internal predecessors, (458), 2 states have call successors, (6), 1 states have call predecessors, (6), 1 states have return successors, (6), 2 states have call predecessors, (6), 2 states have call successors, (6) [2025-03-16 21:39:07,044 INFO L276 IsEmpty]: Start isEmpty. Operand 1603 states and 2080 transitions. [2025-03-16 21:39:07,047 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 487 [2025-03-16 21:39:07,047 INFO L210 NwaCegarLoop]: Found error trace [2025-03-16 21:39:07,047 INFO L218 NwaCegarLoop]: trace histogram [6, 6, 6, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-03-16 21:39:07,047 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable66 [2025-03-16 21:39:07,047 INFO L396 AbstractCegarLoop]: === Iteration 68 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-03-16 21:39:07,047 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-16 21:39:07,047 INFO L85 PathProgramCache]: Analyzing trace with hash 359999154, now seen corresponding path program 1 times [2025-03-16 21:39:07,047 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-16 21:39:07,048 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2063885165] [2025-03-16 21:39:07,048 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-16 21:39:07,048 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-16 21:39:07,126 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 486 statements into 1 equivalence classes. [2025-03-16 21:39:07,635 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 486 of 486 statements. [2025-03-16 21:39:07,635 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-16 21:39:07,635 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-16 21:39:08,164 INFO L134 CoverageAnalysis]: Checked inductivity of 181 backedges. 121 proven. 0 refuted. 0 times theorem prover too weak. 60 trivial. 0 not checked. [2025-03-16 21:39:08,164 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-16 21:39:08,164 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2063885165] [2025-03-16 21:39:08,164 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [2063885165] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-16 21:39:08,164 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-16 21:39:08,164 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2025-03-16 21:39:08,164 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1892014019] [2025-03-16 21:39:08,164 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-16 21:39:08,165 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2025-03-16 21:39:08,165 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-16 21:39:08,165 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2025-03-16 21:39:08,165 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2025-03-16 21:39:08,165 INFO L87 Difference]: Start difference. First operand 1603 states and 2080 transitions. Second operand has 4 states, 4 states have (on average 114.75) internal successors, (459), 4 states have internal predecessors, (459), 2 states have call successors, (6), 1 states have call predecessors, (6), 1 states have return successors, (6), 2 states have call predecessors, (6), 2 states have call successors, (6) [2025-03-16 21:39:08,351 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-16 21:39:08,351 INFO L93 Difference]: Finished difference Result 2676 states and 3494 transitions. [2025-03-16 21:39:08,352 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2025-03-16 21:39:08,352 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 4 states have (on average 114.75) internal successors, (459), 4 states have internal predecessors, (459), 2 states have call successors, (6), 1 states have call predecessors, (6), 1 states have return successors, (6), 2 states have call predecessors, (6), 2 states have call successors, (6) Word has length 486 [2025-03-16 21:39:08,352 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-16 21:39:08,353 INFO L225 Difference]: With dead ends: 2676 [2025-03-16 21:39:08,353 INFO L226 Difference]: Without dead ends: 1603 [2025-03-16 21:39:08,354 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 8 GetRequests, 5 SyntacticMatches, 0 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=9, Invalid=11, Unknown=0, NotChecked=0, Total=20 [2025-03-16 21:39:08,354 INFO L435 NwaCegarLoop]: 589 mSDtfsCounter, 512 mSDsluCounter, 590 mSDsCounter, 0 mSdLazyCounter, 340 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 512 SdHoareTripleChecker+Valid, 1179 SdHoareTripleChecker+Invalid, 340 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 340 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.2s IncrementalHoareTripleChecker+Time [2025-03-16 21:39:08,354 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [512 Valid, 1179 Invalid, 340 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 340 Invalid, 0 Unknown, 0 Unchecked, 0.2s Time] [2025-03-16 21:39:08,355 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1603 states. [2025-03-16 21:39:08,366 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1603 to 1603. [2025-03-16 21:39:08,367 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 1603 states, 1591 states have (on average 1.2935260842237586) internal successors, (2058), 1591 states have internal predecessors, (2058), 10 states have call successors, (10), 1 states have call predecessors, (10), 1 states have return successors, (10), 10 states have call predecessors, (10), 10 states have call successors, (10) [2025-03-16 21:39:08,368 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1603 states to 1603 states and 2078 transitions. [2025-03-16 21:39:08,368 INFO L78 Accepts]: Start accepts. Automaton has 1603 states and 2078 transitions. Word has length 486 [2025-03-16 21:39:08,369 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-16 21:39:08,369 INFO L471 AbstractCegarLoop]: Abstraction has 1603 states and 2078 transitions. [2025-03-16 21:39:08,369 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 114.75) internal successors, (459), 4 states have internal predecessors, (459), 2 states have call successors, (6), 1 states have call predecessors, (6), 1 states have return successors, (6), 2 states have call predecessors, (6), 2 states have call successors, (6) [2025-03-16 21:39:08,369 INFO L276 IsEmpty]: Start isEmpty. Operand 1603 states and 2078 transitions. [2025-03-16 21:39:08,371 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 488 [2025-03-16 21:39:08,371 INFO L210 NwaCegarLoop]: Found error trace [2025-03-16 21:39:08,371 INFO L218 NwaCegarLoop]: trace histogram [6, 6, 6, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-03-16 21:39:08,371 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable67 [2025-03-16 21:39:08,371 INFO L396 AbstractCegarLoop]: === Iteration 69 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-03-16 21:39:08,372 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-16 21:39:08,372 INFO L85 PathProgramCache]: Analyzing trace with hash -1370090068, now seen corresponding path program 1 times [2025-03-16 21:39:08,372 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-16 21:39:08,372 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2100875346] [2025-03-16 21:39:08,372 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-16 21:39:08,372 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-16 21:39:08,449 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 487 statements into 1 equivalence classes. [2025-03-16 21:39:09,313 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 487 of 487 statements. [2025-03-16 21:39:09,313 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-16 21:39:09,313 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-16 21:39:09,824 INFO L134 CoverageAnalysis]: Checked inductivity of 181 backedges. 121 proven. 0 refuted. 0 times theorem prover too weak. 60 trivial. 0 not checked. [2025-03-16 21:39:09,824 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-16 21:39:09,824 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2100875346] [2025-03-16 21:39:09,824 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [2100875346] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-16 21:39:09,824 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-16 21:39:09,824 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2025-03-16 21:39:09,825 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [188359943] [2025-03-16 21:39:09,825 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-16 21:39:09,825 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2025-03-16 21:39:09,825 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-16 21:39:09,825 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2025-03-16 21:39:09,825 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=10, Invalid=20, Unknown=0, NotChecked=0, Total=30 [2025-03-16 21:39:09,826 INFO L87 Difference]: Start difference. First operand 1603 states and 2078 transitions. Second operand has 6 states, 6 states have (on average 76.66666666666667) internal successors, (460), 6 states have internal predecessors, (460), 2 states have call successors, (6), 1 states have call predecessors, (6), 1 states have return successors, (6), 2 states have call predecessors, (6), 2 states have call successors, (6) [2025-03-16 21:39:10,276 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-16 21:39:10,276 INFO L93 Difference]: Finished difference Result 3739 states and 4886 transitions. [2025-03-16 21:39:10,277 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2025-03-16 21:39:10,277 INFO L78 Accepts]: Start accepts. Automaton has has 6 states, 6 states have (on average 76.66666666666667) internal successors, (460), 6 states have internal predecessors, (460), 2 states have call successors, (6), 1 states have call predecessors, (6), 1 states have return successors, (6), 2 states have call predecessors, (6), 2 states have call successors, (6) Word has length 487 [2025-03-16 21:39:10,277 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-16 21:39:10,279 INFO L225 Difference]: With dead ends: 3739 [2025-03-16 21:39:10,279 INFO L226 Difference]: Without dead ends: 2666 [2025-03-16 21:39:10,280 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 7 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 5 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=15, Invalid=27, Unknown=0, NotChecked=0, Total=42 [2025-03-16 21:39:10,280 INFO L435 NwaCegarLoop]: 533 mSDtfsCounter, 697 mSDsluCounter, 1722 mSDsCounter, 0 mSdLazyCounter, 1029 mSolverCounterSat, 8 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.3s Time, 0 mProtectedPredicate, 0 mProtectedAction, 700 SdHoareTripleChecker+Valid, 2255 SdHoareTripleChecker+Invalid, 1037 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 8 IncrementalHoareTripleChecker+Valid, 1029 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.4s IncrementalHoareTripleChecker+Time [2025-03-16 21:39:10,280 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [700 Valid, 2255 Invalid, 1037 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [8 Valid, 1029 Invalid, 0 Unknown, 0 Unchecked, 0.4s Time] [2025-03-16 21:39:10,281 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 2666 states. [2025-03-16 21:39:10,299 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 2666 to 2521. [2025-03-16 21:39:10,301 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 2521 states, 2505 states have (on average 1.2934131736526946) internal successors, (3240), 2505 states have internal predecessors, (3240), 14 states have call successors, (14), 1 states have call predecessors, (14), 1 states have return successors, (14), 14 states have call predecessors, (14), 14 states have call successors, (14) [2025-03-16 21:39:10,303 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 2521 states to 2521 states and 3268 transitions. [2025-03-16 21:39:10,303 INFO L78 Accepts]: Start accepts. Automaton has 2521 states and 3268 transitions. Word has length 487 [2025-03-16 21:39:10,303 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-16 21:39:10,303 INFO L471 AbstractCegarLoop]: Abstraction has 2521 states and 3268 transitions. [2025-03-16 21:39:10,303 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 6 states have (on average 76.66666666666667) internal successors, (460), 6 states have internal predecessors, (460), 2 states have call successors, (6), 1 states have call predecessors, (6), 1 states have return successors, (6), 2 states have call predecessors, (6), 2 states have call successors, (6) [2025-03-16 21:39:10,304 INFO L276 IsEmpty]: Start isEmpty. Operand 2521 states and 3268 transitions. [2025-03-16 21:39:10,307 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 489 [2025-03-16 21:39:10,307 INFO L210 NwaCegarLoop]: Found error trace [2025-03-16 21:39:10,307 INFO L218 NwaCegarLoop]: trace histogram [6, 6, 6, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-03-16 21:39:10,307 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable68 [2025-03-16 21:39:10,307 INFO L396 AbstractCegarLoop]: === Iteration 70 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-03-16 21:39:10,308 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-16 21:39:10,308 INFO L85 PathProgramCache]: Analyzing trace with hash 2021978240, now seen corresponding path program 1 times [2025-03-16 21:39:10,308 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-16 21:39:10,308 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1031936295] [2025-03-16 21:39:10,308 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-16 21:39:10,308 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-16 21:39:10,388 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 488 statements into 1 equivalence classes. [2025-03-16 21:39:11,149 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 488 of 488 statements. [2025-03-16 21:39:11,149 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-16 21:39:11,149 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-16 21:39:11,801 INFO L134 CoverageAnalysis]: Checked inductivity of 181 backedges. 121 proven. 0 refuted. 0 times theorem prover too weak. 60 trivial. 0 not checked. [2025-03-16 21:39:11,801 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-16 21:39:11,801 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1031936295] [2025-03-16 21:39:11,801 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1031936295] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-16 21:39:11,801 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-16 21:39:11,801 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2025-03-16 21:39:11,801 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [115266197] [2025-03-16 21:39:11,801 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-16 21:39:11,802 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2025-03-16 21:39:11,802 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-16 21:39:11,802 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2025-03-16 21:39:11,802 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=12, Invalid=18, Unknown=0, NotChecked=0, Total=30 [2025-03-16 21:39:11,802 INFO L87 Difference]: Start difference. First operand 2521 states and 3268 transitions. Second operand has 6 states, 6 states have (on average 76.83333333333333) internal successors, (461), 6 states have internal predecessors, (461), 2 states have call successors, (6), 1 states have call predecessors, (6), 1 states have return successors, (6), 2 states have call predecessors, (6), 2 states have call successors, (6) [2025-03-16 21:39:12,319 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-16 21:39:12,319 INFO L93 Difference]: Finished difference Result 3640 states and 4748 transitions. [2025-03-16 21:39:12,320 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2025-03-16 21:39:12,320 INFO L78 Accepts]: Start accepts. Automaton has has 6 states, 6 states have (on average 76.83333333333333) internal successors, (461), 6 states have internal predecessors, (461), 2 states have call successors, (6), 1 states have call predecessors, (6), 1 states have return successors, (6), 2 states have call predecessors, (6), 2 states have call successors, (6) Word has length 488 [2025-03-16 21:39:12,320 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-16 21:39:12,322 INFO L225 Difference]: With dead ends: 3640 [2025-03-16 21:39:12,322 INFO L226 Difference]: Without dead ends: 2567 [2025-03-16 21:39:12,323 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-03-16 21:39:12,323 INFO L435 NwaCegarLoop]: 469 mSDtfsCounter, 1016 mSDsluCounter, 1397 mSDsCounter, 0 mSdLazyCounter, 1171 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.4s Time, 0 mProtectedPredicate, 0 mProtectedAction, 1019 SdHoareTripleChecker+Valid, 1866 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-03-16 21:39:12,323 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [1019 Valid, 1866 Invalid, 1171 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 1171 Invalid, 0 Unknown, 0 Unchecked, 0.5s Time] [2025-03-16 21:39:12,324 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 2567 states. [2025-03-16 21:39:12,343 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 2567 to 2523. [2025-03-16 21:39:12,344 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 2523 states, 2507 states have (on average 1.2931790985241325) internal successors, (3242), 2507 states have internal predecessors, (3242), 14 states have call successors, (14), 1 states have call predecessors, (14), 1 states have return successors, (14), 14 states have call predecessors, (14), 14 states have call successors, (14) [2025-03-16 21:39:12,346 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 2523 states to 2523 states and 3270 transitions. [2025-03-16 21:39:12,346 INFO L78 Accepts]: Start accepts. Automaton has 2523 states and 3270 transitions. Word has length 488 [2025-03-16 21:39:12,346 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-16 21:39:12,347 INFO L471 AbstractCegarLoop]: Abstraction has 2523 states and 3270 transitions. [2025-03-16 21:39:12,347 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 6 states have (on average 76.83333333333333) internal successors, (461), 6 states have internal predecessors, (461), 2 states have call successors, (6), 1 states have call predecessors, (6), 1 states have return successors, (6), 2 states have call predecessors, (6), 2 states have call successors, (6) [2025-03-16 21:39:12,347 INFO L276 IsEmpty]: Start isEmpty. Operand 2523 states and 3270 transitions. [2025-03-16 21:39:12,350 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 489 [2025-03-16 21:39:12,350 INFO L210 NwaCegarLoop]: Found error trace [2025-03-16 21:39:12,351 INFO L218 NwaCegarLoop]: trace histogram [6, 6, 6, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-03-16 21:39:12,351 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable69 [2025-03-16 21:39:12,351 INFO L396 AbstractCegarLoop]: === Iteration 71 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-03-16 21:39:12,351 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-16 21:39:12,351 INFO L85 PathProgramCache]: Analyzing trace with hash -1722450563, now seen corresponding path program 1 times [2025-03-16 21:39:12,351 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-16 21:39:12,351 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [874665341] [2025-03-16 21:39:12,352 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-16 21:39:12,352 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-16 21:39:12,424 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 488 statements into 1 equivalence classes. [2025-03-16 21:39:13,029 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 488 of 488 statements. [2025-03-16 21:39:13,029 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-16 21:39:13,029 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-16 21:39:13,821 INFO L134 CoverageAnalysis]: Checked inductivity of 181 backedges. 36 proven. 0 refuted. 0 times theorem prover too weak. 145 trivial. 0 not checked. [2025-03-16 21:39:13,821 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-16 21:39:13,821 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [874665341] [2025-03-16 21:39:13,821 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [874665341] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-16 21:39:13,821 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-16 21:39:13,821 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [8] imperfect sequences [] total 8 [2025-03-16 21:39:13,821 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [532201859] [2025-03-16 21:39:13,821 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-16 21:39:13,821 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 8 states [2025-03-16 21:39:13,821 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-16 21:39:13,822 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2025-03-16 21:39:13,822 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=15, Invalid=41, Unknown=0, NotChecked=0, Total=56 [2025-03-16 21:39:13,822 INFO L87 Difference]: Start difference. First operand 2523 states and 3270 transitions. Second operand has 8 states, 8 states have (on average 47.375) internal successors, (379), 8 states have internal predecessors, (379), 2 states have call successors, (6), 1 states have call predecessors, (6), 1 states have return successors, (6), 2 states have call predecessors, (6), 2 states have call successors, (6) [2025-03-16 21:39:14,484 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-16 21:39:14,484 INFO L93 Difference]: Finished difference Result 5868 states and 7598 transitions. [2025-03-16 21:39:14,484 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2025-03-16 21:39:14,484 INFO L78 Accepts]: Start accepts. Automaton has has 8 states, 8 states have (on average 47.375) internal successors, (379), 8 states have internal predecessors, (379), 2 states have call successors, (6), 1 states have call predecessors, (6), 1 states have return successors, (6), 2 states have call predecessors, (6), 2 states have call successors, (6) Word has length 488 [2025-03-16 21:39:14,485 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-16 21:39:14,488 INFO L225 Difference]: With dead ends: 5868 [2025-03-16 21:39:14,488 INFO L226 Difference]: Without dead ends: 4431 [2025-03-16 21:39:14,490 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 9 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 7 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 2 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=20, Invalid=52, Unknown=0, NotChecked=0, Total=72 [2025-03-16 21:39:14,490 INFO L435 NwaCegarLoop]: 1507 mSDtfsCounter, 1124 mSDsluCounter, 7076 mSDsCounter, 0 mSdLazyCounter, 2032 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.5s Time, 0 mProtectedPredicate, 0 mProtectedAction, 1127 SdHoareTripleChecker+Valid, 8583 SdHoareTripleChecker+Invalid, 2032 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 2032 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.6s IncrementalHoareTripleChecker+Time [2025-03-16 21:39:14,490 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [1127 Valid, 8583 Invalid, 2032 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 2032 Invalid, 0 Unknown, 0 Unchecked, 0.6s Time] [2025-03-16 21:39:14,491 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 4431 states. [2025-03-16 21:39:14,516 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 4431 to 2603. [2025-03-16 21:39:14,517 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 2603 states, 2583 states have (on average 1.2942315137437088) internal successors, (3343), 2583 states have internal predecessors, (3343), 18 states have call successors, (18), 1 states have call predecessors, (18), 1 states have return successors, (18), 18 states have call predecessors, (18), 18 states have call successors, (18) [2025-03-16 21:39:14,519 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 2603 states to 2603 states and 3379 transitions. [2025-03-16 21:39:14,519 INFO L78 Accepts]: Start accepts. Automaton has 2603 states and 3379 transitions. Word has length 488 [2025-03-16 21:39:14,519 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-16 21:39:14,519 INFO L471 AbstractCegarLoop]: Abstraction has 2603 states and 3379 transitions. [2025-03-16 21:39:14,520 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 8 states, 8 states have (on average 47.375) internal successors, (379), 8 states have internal predecessors, (379), 2 states have call successors, (6), 1 states have call predecessors, (6), 1 states have return successors, (6), 2 states have call predecessors, (6), 2 states have call successors, (6) [2025-03-16 21:39:14,520 INFO L276 IsEmpty]: Start isEmpty. Operand 2603 states and 3379 transitions. [2025-03-16 21:39:14,522 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 490 [2025-03-16 21:39:14,522 INFO L210 NwaCegarLoop]: Found error trace [2025-03-16 21:39:14,523 INFO L218 NwaCegarLoop]: trace histogram [6, 6, 6, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-03-16 21:39:14,523 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable70 [2025-03-16 21:39:14,523 INFO L396 AbstractCegarLoop]: === Iteration 72 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-03-16 21:39:14,523 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-16 21:39:14,523 INFO L85 PathProgramCache]: Analyzing trace with hash 1399983961, now seen corresponding path program 1 times [2025-03-16 21:39:14,523 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-16 21:39:14,523 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1592405984] [2025-03-16 21:39:14,523 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-16 21:39:14,523 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-16 21:39:14,617 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 489 statements into 1 equivalence classes. [2025-03-16 21:39:15,949 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 489 of 489 statements. [2025-03-16 21:39:15,949 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-16 21:39:15,949 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-16 21:39:17,397 INFO L134 CoverageAnalysis]: Checked inductivity of 181 backedges. 40 proven. 0 refuted. 0 times theorem prover too weak. 141 trivial. 0 not checked. [2025-03-16 21:39:17,398 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-16 21:39:17,398 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1592405984] [2025-03-16 21:39:17,398 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1592405984] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-16 21:39:17,398 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-16 21:39:17,398 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [10] imperfect sequences [] total 10 [2025-03-16 21:39:17,398 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1058426750] [2025-03-16 21:39:17,398 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-16 21:39:17,398 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 10 states [2025-03-16 21:39:17,398 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-16 21:39:17,399 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 10 interpolants. [2025-03-16 21:39:17,399 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=23, Invalid=67, Unknown=0, NotChecked=0, Total=90 [2025-03-16 21:39:17,399 INFO L87 Difference]: Start difference. First operand 2603 states and 3379 transitions. Second operand has 10 states, 10 states have (on average 38.4) internal successors, (384), 10 states have internal predecessors, (384), 3 states have call successors, (6), 1 states have call predecessors, (6), 1 states have return successors, (6), 3 states have call predecessors, (6), 3 states have call successors, (6) [2025-03-16 21:39:18,200 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-16 21:39:18,200 INFO L93 Difference]: Finished difference Result 5460 states and 7100 transitions. [2025-03-16 21:39:18,200 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 10 states. [2025-03-16 21:39:18,201 INFO L78 Accepts]: Start accepts. Automaton has has 10 states, 10 states have (on average 38.4) internal successors, (384), 10 states have internal predecessors, (384), 3 states have call successors, (6), 1 states have call predecessors, (6), 1 states have return successors, (6), 3 states have call predecessors, (6), 3 states have call successors, (6) Word has length 489 [2025-03-16 21:39:18,201 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-16 21:39:18,204 INFO L225 Difference]: With dead ends: 5460 [2025-03-16 21:39:18,204 INFO L226 Difference]: Without dead ends: 3569 [2025-03-16 21:39:18,206 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 13 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 11 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 14 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=40, Invalid=116, Unknown=0, NotChecked=0, Total=156 [2025-03-16 21:39:18,206 INFO L435 NwaCegarLoop]: 961 mSDtfsCounter, 1810 mSDsluCounter, 5603 mSDsCounter, 0 mSdLazyCounter, 1986 mSolverCounterSat, 3 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.6s Time, 0 mProtectedPredicate, 0 mProtectedAction, 1815 SdHoareTripleChecker+Valid, 6564 SdHoareTripleChecker+Invalid, 1989 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 3 IncrementalHoareTripleChecker+Valid, 1986 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.7s IncrementalHoareTripleChecker+Time [2025-03-16 21:39:18,206 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [1815 Valid, 6564 Invalid, 1989 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [3 Valid, 1986 Invalid, 0 Unknown, 0 Unchecked, 0.7s Time] [2025-03-16 21:39:18,207 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 3569 states. [2025-03-16 21:39:18,233 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 3569 to 2657. [2025-03-16 21:39:18,235 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 2657 states, 2634 states have (on average 1.2953682611996962) internal successors, (3412), 2634 states have internal predecessors, (3412), 21 states have call successors, (21), 1 states have call predecessors, (21), 1 states have return successors, (21), 21 states have call predecessors, (21), 21 states have call successors, (21) [2025-03-16 21:39:18,236 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 2657 states to 2657 states and 3454 transitions. [2025-03-16 21:39:18,237 INFO L78 Accepts]: Start accepts. Automaton has 2657 states and 3454 transitions. Word has length 489 [2025-03-16 21:39:18,237 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-16 21:39:18,237 INFO L471 AbstractCegarLoop]: Abstraction has 2657 states and 3454 transitions. [2025-03-16 21:39:18,237 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 10 states, 10 states have (on average 38.4) internal successors, (384), 10 states have internal predecessors, (384), 3 states have call successors, (6), 1 states have call predecessors, (6), 1 states have return successors, (6), 3 states have call predecessors, (6), 3 states have call successors, (6) [2025-03-16 21:39:18,237 INFO L276 IsEmpty]: Start isEmpty. Operand 2657 states and 3454 transitions. [2025-03-16 21:39:18,240 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 490 [2025-03-16 21:39:18,240 INFO L210 NwaCegarLoop]: Found error trace [2025-03-16 21:39:18,240 INFO L218 NwaCegarLoop]: trace histogram [6, 6, 6, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-03-16 21:39:18,240 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable71 [2025-03-16 21:39:18,240 INFO L396 AbstractCegarLoop]: === Iteration 73 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-03-16 21:39:18,240 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-16 21:39:18,240 INFO L85 PathProgramCache]: Analyzing trace with hash -1966181970, now seen corresponding path program 1 times [2025-03-16 21:39:18,240 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-16 21:39:18,240 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1025118219] [2025-03-16 21:39:18,241 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-16 21:39:18,241 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-16 21:39:18,317 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 489 statements into 1 equivalence classes. [2025-03-16 21:39:20,384 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 489 of 489 statements. [2025-03-16 21:39:20,384 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-16 21:39:20,384 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-16 21:39:24,544 INFO L134 CoverageAnalysis]: Checked inductivity of 179 backedges. 81 proven. 36 refuted. 0 times theorem prover too weak. 62 trivial. 0 not checked. [2025-03-16 21:39:24,544 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-16 21:39:24,544 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1025118219] [2025-03-16 21:39:24,544 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1025118219] provided 0 perfect and 1 imperfect interpolant sequences [2025-03-16 21:39:24,544 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [2009598212] [2025-03-16 21:39:24,544 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-16 21:39:24,544 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-03-16 21:39:24,544 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2025-03-16 21:39:24,546 INFO L229 MonitoredProcess]: Starting monitored process 3 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2025-03-16 21:39:24,547 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (3)] Waiting until timeout for monitored process