./Ultimate.py --spec ../sv-benchmarks/c/properties/unreach-call.prp --file ../sv-benchmarks/c/eca-rers2012/Problem16_label17.c --full-output --architecture 32bit -------------------------------------------------------------------------------- Checking for ERROR reachability Using default analysis Version c00e63dc Calling Ultimate with: /root/.sdkman/candidates/java/21.0.5-tem/bin/java -Dosgi.configuration.area=/storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/data/config -Xmx15G -Xms4m -jar /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/plugins/org.eclipse.equinox.launcher_1.6.800.v20240513-1750.jar -data @noDefault -ultimatedata /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/data -tc /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/config/AutomizerReach.xml -i ../sv-benchmarks/c/eca-rers2012/Problem16_label17.c -s /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/config/svcomp-Reach-32bit-Automizer_Default.epf --cacsl2boogietranslator.entry.function main --witnessprinter.witness.directory /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux --witnessprinter.witness.filename witness --witnessprinter.write.witness.besides.input.file false --witnessprinter.graph.data.specification CHECK( init(main()), LTL(G ! call(reach_error())) ) --witnessprinter.graph.data.producer Automizer --witnessprinter.graph.data.architecture 32bit --witnessprinter.graph.data.programhash 2d1627f871329627aa5e3c4bb03691b2c1776c373457e4d479d53574c4f3c2af --- Real Ultimate output --- This is Ultimate 0.3.0-?-c00e63d-m [2025-02-05 11:57:36,366 INFO L188 SettingsManager]: Resetting all preferences to default values... [2025-02-05 11:57:36,431 INFO L114 SettingsManager]: Loading settings from /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/config/svcomp-Reach-32bit-Automizer_Default.epf [2025-02-05 11:57:36,438 WARN L101 SettingsManager]: Preference file contains the following unknown settings: [2025-02-05 11:57:36,439 WARN L103 SettingsManager]: * de.uni_freiburg.informatik.ultimate.core.Log level for class [2025-02-05 11:57:36,453 INFO L130 SettingsManager]: Preferences different from defaults after loading the file: [2025-02-05 11:57:36,453 INFO L151 SettingsManager]: Preferences of UltimateCore differ from their defaults: [2025-02-05 11:57:36,453 INFO L153 SettingsManager]: * Log level for class=de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher=ERROR; [2025-02-05 11:57:36,453 INFO L151 SettingsManager]: Preferences of Boogie Preprocessor differ from their defaults: [2025-02-05 11:57:36,453 INFO L153 SettingsManager]: * Use memory slicer=true [2025-02-05 11:57:36,454 INFO L151 SettingsManager]: Preferences of Boogie Procedure Inliner differ from their defaults: [2025-02-05 11:57:36,454 INFO L153 SettingsManager]: * Ignore calls to procedures called more than once=ONLY_FOR_SEQUENTIAL_PROGRAMS [2025-02-05 11:57:36,454 INFO L151 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2025-02-05 11:57:36,454 INFO L153 SettingsManager]: * Create parallel compositions if possible=false [2025-02-05 11:57:36,454 INFO L153 SettingsManager]: * Use SBE=true [2025-02-05 11:57:36,454 INFO L151 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2025-02-05 11:57:36,454 INFO L153 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2025-02-05 11:57:36,454 INFO L153 SettingsManager]: * sizeof long=4 [2025-02-05 11:57:36,454 INFO L153 SettingsManager]: * Overapproximate operations on floating types=true [2025-02-05 11:57:36,454 INFO L153 SettingsManager]: * sizeof POINTER=4 [2025-02-05 11:57:36,454 INFO L153 SettingsManager]: * Check division by zero=IGNORE [2025-02-05 11:57:36,454 INFO L153 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2025-02-05 11:57:36,454 INFO L153 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2025-02-05 11:57:36,454 INFO L153 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2025-02-05 11:57:36,454 INFO L153 SettingsManager]: * sizeof long double=12 [2025-02-05 11:57:36,454 INFO L153 SettingsManager]: * Check if freed pointer was valid=false [2025-02-05 11:57:36,454 INFO L153 SettingsManager]: * Behaviour of calls to undefined functions=OVERAPPROXIMATE_BEHAVIOUR [2025-02-05 11:57:36,455 INFO L153 SettingsManager]: * Use constant arrays=true [2025-02-05 11:57:36,455 INFO L151 SettingsManager]: Preferences of IcfgBuilder differ from their defaults: [2025-02-05 11:57:36,455 INFO L153 SettingsManager]: * Size of a code block=SequenceOfStatements [2025-02-05 11:57:36,455 INFO L153 SettingsManager]: * Only consider context switches at boundaries of atomic blocks=true [2025-02-05 11:57:36,455 INFO L153 SettingsManager]: * SMT solver=External_DefaultMode [2025-02-05 11:57:36,455 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2025-02-05 11:57:36,455 INFO L151 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2025-02-05 11:57:36,455 INFO L153 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2025-02-05 11:57:36,455 INFO L153 SettingsManager]: * Compute procedure contracts=false [2025-02-05 11:57:36,455 INFO L153 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopHeads [2025-02-05 11:57:36,455 INFO L153 SettingsManager]: * Trace refinement strategy=CAMEL [2025-02-05 11:57:36,455 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2025-02-05 11:57:36,455 INFO L153 SettingsManager]: * Apply one-shot large block encoding in concurrent analysis=false [2025-02-05 11:57:36,455 INFO L153 SettingsManager]: * Automaton type used in concurrency analysis=PETRI_NET [2025-02-05 11:57:36,455 INFO L153 SettingsManager]: * Order on configurations for Petri net unfoldings=DBO [2025-02-05 11:57:36,455 INFO L153 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode [2025-02-05 11:57:36,455 INFO L153 SettingsManager]: * Looper check in Petri net analysis=SEMANTIC Applying setting for plugin de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator: Entry function -> main Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Witness directory -> /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Witness filename -> witness Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Write witness besides input file -> false Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Graph data specification -> CHECK( init(main()), LTL(G ! call(reach_error())) ) Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Graph data producer -> Automizer Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Graph data architecture -> 32bit Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Graph data programhash -> 2d1627f871329627aa5e3c4bb03691b2c1776c373457e4d479d53574c4f3c2af [2025-02-05 11:57:36,653 INFO L75 nceAwareModelManager]: Repository-Root is: /tmp [2025-02-05 11:57:36,660 INFO L261 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2025-02-05 11:57:36,662 INFO L217 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2025-02-05 11:57:36,663 INFO L270 PluginConnector]: Initializing CDTParser... [2025-02-05 11:57:36,663 INFO L274 PluginConnector]: CDTParser initialized [2025-02-05 11:57:36,665 INFO L431 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/../sv-benchmarks/c/eca-rers2012/Problem16_label17.c [2025-02-05 11:57:37,837 INFO L533 CDTParser]: Created temporary CDT project at /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/data/34b89f6c2/68a3908e2ee54d92bfb246ae6d0c67ba/FLAG77ea2fdc5 [2025-02-05 11:57:38,260 INFO L384 CDTParser]: Found 1 translation units. [2025-02-05 11:57:38,260 INFO L180 CDTParser]: Scanning /storage/repos/ultimate-jdk21/releaseScripts/default/sv-benchmarks/c/eca-rers2012/Problem16_label17.c [2025-02-05 11:57:38,295 INFO L427 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/data/34b89f6c2/68a3908e2ee54d92bfb246ae6d0c67ba/FLAG77ea2fdc5 [2025-02-05 11:57:38,324 INFO L435 CDTParser]: Successfully deleted /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/data/34b89f6c2/68a3908e2ee54d92bfb246ae6d0c67ba [2025-02-05 11:57:38,330 INFO L299 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2025-02-05 11:57:38,332 INFO L133 ToolchainWalker]: Walking toolchain with 6 elements. [2025-02-05 11:57:38,336 INFO L112 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2025-02-05 11:57:38,337 INFO L270 PluginConnector]: Initializing CACSL2BoogieTranslator... [2025-02-05 11:57:38,340 INFO L274 PluginConnector]: CACSL2BoogieTranslator initialized [2025-02-05 11:57:38,344 INFO L184 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 05.02 11:57:38" (1/1) ... [2025-02-05 11:57:38,345 INFO L204 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@49bb72c6 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 05.02 11:57:38, skipping insertion in model container [2025-02-05 11:57:38,345 INFO L184 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 05.02 11:57:38" (1/1) ... [2025-02-05 11:57:38,422 INFO L175 MainTranslator]: Built tables and reachable declarations [2025-02-05 11:57:38,630 WARN L250 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate-jdk21/releaseScripts/default/sv-benchmarks/c/eca-rers2012/Problem16_label17.c[6102,6115] [2025-02-05 11:57:38,866 INFO L210 PostProcessor]: Analyzing one entry point: main [2025-02-05 11:57:38,874 INFO L200 MainTranslator]: Completed pre-run [2025-02-05 11:57:38,888 WARN L250 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate-jdk21/releaseScripts/default/sv-benchmarks/c/eca-rers2012/Problem16_label17.c[6102,6115] [2025-02-05 11:57:38,979 INFO L210 PostProcessor]: Analyzing one entry point: main [2025-02-05 11:57:38,991 INFO L204 MainTranslator]: Completed translation [2025-02-05 11:57:38,992 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 05.02 11:57:38 WrapperNode [2025-02-05 11:57:38,992 INFO L131 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2025-02-05 11:57:38,994 INFO L112 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2025-02-05 11:57:38,994 INFO L270 PluginConnector]: Initializing Boogie Procedure Inliner... [2025-02-05 11:57:38,994 INFO L274 PluginConnector]: Boogie Procedure Inliner initialized [2025-02-05 11:57:38,998 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 05.02 11:57:38" (1/1) ... [2025-02-05 11:57:39,023 INFO L184 PluginConnector]: Executing the observer Inliner from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 05.02 11:57:38" (1/1) ... [2025-02-05 11:57:39,133 INFO L138 Inliner]: procedures = 15, calls = 9, calls flagged for inlining = 4, calls inlined = 4, statements flattened = 1767 [2025-02-05 11:57:39,133 INFO L131 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2025-02-05 11:57:39,134 INFO L112 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2025-02-05 11:57:39,134 INFO L270 PluginConnector]: Initializing Boogie Preprocessor... [2025-02-05 11:57:39,134 INFO L274 PluginConnector]: Boogie Preprocessor initialized [2025-02-05 11:57:39,140 INFO L184 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 05.02 11:57:38" (1/1) ... [2025-02-05 11:57:39,141 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 05.02 11:57:38" (1/1) ... [2025-02-05 11:57:39,164 INFO L184 PluginConnector]: Executing the observer MemorySlicer from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 05.02 11:57:38" (1/1) ... [2025-02-05 11:57:39,213 INFO L175 MemorySlicer]: Split 2 memory accesses to 1 slices as follows [2]. 100 percent of accesses are in the largest equivalence class. The 2 initializations are split as follows [2]. The 0 writes are split as follows [0]. [2025-02-05 11:57:39,213 INFO L184 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 05.02 11:57:38" (1/1) ... [2025-02-05 11:57:39,213 INFO L184 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 05.02 11:57:38" (1/1) ... [2025-02-05 11:57:39,260 INFO L184 PluginConnector]: Executing the observer ReplaceArrayAssignments from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 05.02 11:57:38" (1/1) ... [2025-02-05 11:57:39,265 INFO L184 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 05.02 11:57:38" (1/1) ... [2025-02-05 11:57:39,278 INFO L184 PluginConnector]: Executing the observer LTLStepAnnotator from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 05.02 11:57:38" (1/1) ... [2025-02-05 11:57:39,287 INFO L184 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 05.02 11:57:38" (1/1) ... [2025-02-05 11:57:39,299 INFO L131 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2025-02-05 11:57:39,300 INFO L112 PluginConnector]: ------------------------IcfgBuilder---------------------------- [2025-02-05 11:57:39,301 INFO L270 PluginConnector]: Initializing IcfgBuilder... [2025-02-05 11:57:39,301 INFO L274 PluginConnector]: IcfgBuilder initialized [2025-02-05 11:57:39,301 INFO L184 PluginConnector]: Executing the observer IcfgBuilderObserver from plugin IcfgBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 05.02 11:57:38" (1/1) ... [2025-02-05 11:57:39,306 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2025-02-05 11:57:39,315 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 [2025-02-05 11:57:39,326 INFO L229 MonitoredProcess]: Starting monitored process 1 with /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 (exit command is (exit), workingDir is null) [2025-02-05 11:57:39,333 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 (1)] Waiting until timeout for monitored process [2025-02-05 11:57:39,348 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocInit [2025-02-05 11:57:39,349 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int#0 [2025-02-05 11:57:39,349 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2025-02-05 11:57:39,349 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2025-02-05 11:57:39,389 INFO L257 CfgBuilder]: Building ICFG [2025-02-05 11:57:39,391 INFO L287 CfgBuilder]: Building CFG for each procedure with an implementation [2025-02-05 11:57:40,983 INFO L1309 $ProcedureCfgBuilder]: dead code at ProgramPoint L1501: havoc calculate_output_#t~ret7#1; [2025-02-05 11:57:41,043 INFO L? ?]: Removed 276 outVars from TransFormulas that were not future-live. [2025-02-05 11:57:41,043 INFO L308 CfgBuilder]: Performing block encoding [2025-02-05 11:57:41,055 INFO L332 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2025-02-05 11:57:41,055 INFO L337 CfgBuilder]: Removed 0 assume(true) statements. [2025-02-05 11:57:41,056 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.icfgbuilder CFG 05.02 11:57:41 BoogieIcfgContainer [2025-02-05 11:57:41,056 INFO L131 PluginConnector]: ------------------------ END IcfgBuilder---------------------------- [2025-02-05 11:57:41,058 INFO L112 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2025-02-05 11:57:41,058 INFO L270 PluginConnector]: Initializing TraceAbstraction... [2025-02-05 11:57:41,061 INFO L274 PluginConnector]: TraceAbstraction initialized [2025-02-05 11:57:41,062 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 05.02 11:57:38" (1/3) ... [2025-02-05 11:57:41,062 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@3a53b1c5 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 05.02 11:57:41, skipping insertion in model container [2025-02-05 11:57:41,062 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 05.02 11:57:38" (2/3) ... [2025-02-05 11:57:41,062 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@3a53b1c5 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 05.02 11:57:41, skipping insertion in model container [2025-02-05 11:57:41,062 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.icfgbuilder CFG 05.02 11:57:41" (3/3) ... [2025-02-05 11:57:41,063 INFO L128 eAbstractionObserver]: Analyzing ICFG Problem16_label17.c [2025-02-05 11:57:41,074 INFO L216 ceAbstractionStarter]: Automizer settings: Hoare:LoopHeads NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2025-02-05 11:57:41,076 INFO L151 ceAbstractionStarter]: Applying trace abstraction to ICFG Problem16_label17.c that has 1 procedures, 396 locations, 1 initial locations, 1 loop locations, and 1 error locations. [2025-02-05 11:57:41,127 INFO L332 AbstractCegarLoop]: ======== Iteration 0 == of CEGAR loop == AllErrorsAtOnce ======== [2025-02-05 11:57:41,135 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;@4e1de62, mLbeIndependenceSettings=[IndependenceType=SEMANTIC, AbstractionType=NONE, UseConditional=false, UseSemiCommutativity=true, Solver=Z3, SolverTimeout=1000ms] [2025-02-05 11:57:41,135 INFO L334 AbstractCegarLoop]: Starting to check reachability of 1 error locations. [2025-02-05 11:57:41,139 INFO L276 IsEmpty]: Start isEmpty. Operand has 396 states, 394 states have (on average 1.83248730964467) internal successors, (722), 395 states have internal predecessors, (722), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-02-05 11:57:41,144 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 59 [2025-02-05 11:57:41,144 INFO L210 NwaCegarLoop]: Found error trace [2025-02-05 11:57:41,144 INFO L218 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-02-05 11:57:41,145 INFO L396 AbstractCegarLoop]: === Iteration 1 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-02-05 11:57:41,148 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-02-05 11:57:41,149 INFO L85 PathProgramCache]: Analyzing trace with hash 1155124880, now seen corresponding path program 1 times [2025-02-05 11:57:41,154 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-02-05 11:57:41,154 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [565653632] [2025-02-05 11:57:41,154 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-02-05 11:57:41,155 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-02-05 11:57:41,207 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 58 statements into 1 equivalence classes. [2025-02-05 11:57:41,234 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 58 of 58 statements. [2025-02-05 11:57:41,234 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-02-05 11:57:41,234 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-02-05 11:57:41,385 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-02-05 11:57:41,385 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-02-05 11:57:41,385 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [565653632] [2025-02-05 11:57:41,386 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [565653632] provided 1 perfect and 0 imperfect interpolant sequences [2025-02-05 11:57:41,386 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-02-05 11:57:41,386 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2025-02-05 11:57:41,387 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1661168393] [2025-02-05 11:57:41,387 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-02-05 11:57:41,389 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2025-02-05 11:57:41,390 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-02-05 11:57:41,400 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2025-02-05 11:57:41,401 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-02-05 11:57:41,402 INFO L87 Difference]: Start difference. First operand has 396 states, 394 states have (on average 1.83248730964467) internal successors, (722), 395 states have internal predecessors, (722), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Second operand has 3 states, 3 states have (on average 19.333333333333332) internal successors, (58), 2 states have internal predecessors, (58), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-02-05 11:57:42,706 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-02-05 11:57:42,707 INFO L93 Difference]: Finished difference Result 1122 states and 2100 transitions. [2025-02-05 11:57:42,708 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2025-02-05 11:57:42,709 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 19.333333333333332) internal successors, (58), 2 states have internal predecessors, (58), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 58 [2025-02-05 11:57:42,709 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-02-05 11:57:42,725 INFO L225 Difference]: With dead ends: 1122 [2025-02-05 11:57:42,725 INFO L226 Difference]: Without dead ends: 662 [2025-02-05 11:57:42,733 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 2 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-02-05 11:57:42,735 INFO L435 NwaCegarLoop]: 246 mSDtfsCounter, 329 mSDsluCounter, 8 mSDsCounter, 0 mSdLazyCounter, 864 mSolverCounterSat, 450 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 1.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 329 SdHoareTripleChecker+Valid, 254 SdHoareTripleChecker+Invalid, 1314 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 450 IncrementalHoareTripleChecker+Valid, 864 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 1.2s IncrementalHoareTripleChecker+Time [2025-02-05 11:57:42,735 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [329 Valid, 254 Invalid, 1314 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [450 Valid, 864 Invalid, 0 Unknown, 0 Unchecked, 1.2s Time] [2025-02-05 11:57:42,751 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 662 states. [2025-02-05 11:57:42,807 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 662 to 662. [2025-02-05 11:57:42,809 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 662 states, 661 states have (on average 1.518910741301059) internal successors, (1004), 661 states have internal predecessors, (1004), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-02-05 11:57:42,815 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 662 states to 662 states and 1004 transitions. [2025-02-05 11:57:42,817 INFO L78 Accepts]: Start accepts. Automaton has 662 states and 1004 transitions. Word has length 58 [2025-02-05 11:57:42,817 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-02-05 11:57:42,817 INFO L471 AbstractCegarLoop]: Abstraction has 662 states and 1004 transitions. [2025-02-05 11:57:42,817 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 19.333333333333332) internal successors, (58), 2 states have internal predecessors, (58), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-02-05 11:57:42,818 INFO L276 IsEmpty]: Start isEmpty. Operand 662 states and 1004 transitions. [2025-02-05 11:57:42,822 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 127 [2025-02-05 11:57:42,822 INFO L210 NwaCegarLoop]: Found error trace [2025-02-05 11:57:42,822 INFO L218 NwaCegarLoop]: trace histogram [2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 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] [2025-02-05 11:57:42,823 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable0 [2025-02-05 11:57:42,823 INFO L396 AbstractCegarLoop]: === Iteration 2 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-02-05 11:57:42,824 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-02-05 11:57:42,824 INFO L85 PathProgramCache]: Analyzing trace with hash -79623876, now seen corresponding path program 1 times [2025-02-05 11:57:42,824 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-02-05 11:57:42,824 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1704718019] [2025-02-05 11:57:42,824 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-02-05 11:57:42,824 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-02-05 11:57:42,851 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 126 statements into 1 equivalence classes. [2025-02-05 11:57:42,899 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 126 of 126 statements. [2025-02-05 11:57:42,899 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-02-05 11:57:42,899 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-02-05 11:57:43,248 INFO L134 CoverageAnalysis]: Checked inductivity of 55 backedges. 55 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-02-05 11:57:43,248 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-02-05 11:57:43,248 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1704718019] [2025-02-05 11:57:43,248 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1704718019] provided 1 perfect and 0 imperfect interpolant sequences [2025-02-05 11:57:43,248 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-02-05 11:57:43,248 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2025-02-05 11:57:43,249 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1677804338] [2025-02-05 11:57:43,249 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-02-05 11:57:43,249 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2025-02-05 11:57:43,250 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-02-05 11:57:43,250 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2025-02-05 11:57:43,250 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2025-02-05 11:57:43,250 INFO L87 Difference]: Start difference. First operand 662 states and 1004 transitions. Second operand has 4 states, 4 states have (on average 31.5) internal successors, (126), 3 states have internal predecessors, (126), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-02-05 11:57:44,928 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-02-05 11:57:44,928 INFO L93 Difference]: Finished difference Result 2309 states and 3414 transitions. [2025-02-05 11:57:44,928 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2025-02-05 11:57:44,928 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 4 states have (on average 31.5) internal successors, (126), 3 states have internal predecessors, (126), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 126 [2025-02-05 11:57:44,929 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-02-05 11:57:44,934 INFO L225 Difference]: With dead ends: 2309 [2025-02-05 11:57:44,934 INFO L226 Difference]: Without dead ends: 1649 [2025-02-05 11:57:44,935 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 4 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=9, Invalid=11, Unknown=0, NotChecked=0, Total=20 [2025-02-05 11:57:44,936 INFO L435 NwaCegarLoop]: 33 mSDtfsCounter, 1008 mSDsluCounter, 9 mSDsCounter, 0 mSdLazyCounter, 1496 mSolverCounterSat, 489 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 1.3s Time, 0 mProtectedPredicate, 0 mProtectedAction, 1008 SdHoareTripleChecker+Valid, 42 SdHoareTripleChecker+Invalid, 1985 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 489 IncrementalHoareTripleChecker+Valid, 1496 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 1.6s IncrementalHoareTripleChecker+Time [2025-02-05 11:57:44,936 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [1008 Valid, 42 Invalid, 1985 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [489 Valid, 1496 Invalid, 0 Unknown, 0 Unchecked, 1.6s Time] [2025-02-05 11:57:44,938 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1649 states. [2025-02-05 11:57:44,985 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1649 to 1649. [2025-02-05 11:57:44,987 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 1649 states, 1648 states have (on average 1.4016990291262137) internal successors, (2310), 1648 states have internal predecessors, (2310), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-02-05 11:57:44,991 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1649 states to 1649 states and 2310 transitions. [2025-02-05 11:57:44,991 INFO L78 Accepts]: Start accepts. Automaton has 1649 states and 2310 transitions. Word has length 126 [2025-02-05 11:57:44,992 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-02-05 11:57:44,992 INFO L471 AbstractCegarLoop]: Abstraction has 1649 states and 2310 transitions. [2025-02-05 11:57:44,992 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 31.5) internal successors, (126), 3 states have internal predecessors, (126), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-02-05 11:57:44,992 INFO L276 IsEmpty]: Start isEmpty. Operand 1649 states and 2310 transitions. [2025-02-05 11:57:44,998 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 190 [2025-02-05 11:57:44,998 INFO L210 NwaCegarLoop]: Found error trace [2025-02-05 11:57:44,999 INFO L218 NwaCegarLoop]: trace histogram [2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 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] [2025-02-05 11:57:44,999 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable1 [2025-02-05 11:57:44,999 INFO L396 AbstractCegarLoop]: === Iteration 3 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-02-05 11:57:44,999 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-02-05 11:57:44,999 INFO L85 PathProgramCache]: Analyzing trace with hash 310207582, now seen corresponding path program 1 times [2025-02-05 11:57:45,000 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-02-05 11:57:45,000 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [194898626] [2025-02-05 11:57:45,000 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-02-05 11:57:45,000 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-02-05 11:57:45,016 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 189 statements into 1 equivalence classes. [2025-02-05 11:57:45,028 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 189 of 189 statements. [2025-02-05 11:57:45,029 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-02-05 11:57:45,029 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-02-05 11:57:45,132 INFO L134 CoverageAnalysis]: Checked inductivity of 55 backedges. 55 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-02-05 11:57:45,133 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-02-05 11:57:45,133 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [194898626] [2025-02-05 11:57:45,133 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [194898626] provided 1 perfect and 0 imperfect interpolant sequences [2025-02-05 11:57:45,133 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-02-05 11:57:45,133 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2025-02-05 11:57:45,133 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [483322241] [2025-02-05 11:57:45,133 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-02-05 11:57:45,134 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2025-02-05 11:57:45,134 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-02-05 11:57:45,134 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2025-02-05 11:57:45,134 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-02-05 11:57:45,134 INFO L87 Difference]: Start difference. First operand 1649 states and 2310 transitions. Second operand has 3 states, 3 states have (on average 63.0) internal successors, (189), 2 states have internal predecessors, (189), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-02-05 11:57:46,251 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-02-05 11:57:46,252 INFO L93 Difference]: Finished difference Result 3625 states and 5242 transitions. [2025-02-05 11:57:46,252 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2025-02-05 11:57:46,253 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 63.0) internal successors, (189), 2 states have internal predecessors, (189), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 189 [2025-02-05 11:57:46,253 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-02-05 11:57:46,260 INFO L225 Difference]: With dead ends: 3625 [2025-02-05 11:57:46,261 INFO L226 Difference]: Without dead ends: 2307 [2025-02-05 11:57:46,262 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 2 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-02-05 11:57:46,264 INFO L435 NwaCegarLoop]: 73 mSDtfsCounter, 278 mSDsluCounter, 4 mSDsCounter, 0 mSdLazyCounter, 882 mSolverCounterSat, 380 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.9s Time, 0 mProtectedPredicate, 0 mProtectedAction, 278 SdHoareTripleChecker+Valid, 77 SdHoareTripleChecker+Invalid, 1262 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 380 IncrementalHoareTripleChecker+Valid, 882 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 1.1s IncrementalHoareTripleChecker+Time [2025-02-05 11:57:46,265 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [278 Valid, 77 Invalid, 1262 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [380 Valid, 882 Invalid, 0 Unknown, 0 Unchecked, 1.1s Time] [2025-02-05 11:57:46,268 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 2307 states. [2025-02-05 11:57:46,301 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 2307 to 2307. [2025-02-05 11:57:46,303 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 2307 states, 2306 states have (on average 1.349956634865568) internal successors, (3113), 2306 states have internal predecessors, (3113), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-02-05 11:57:46,310 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 2307 states to 2307 states and 3113 transitions. [2025-02-05 11:57:46,310 INFO L78 Accepts]: Start accepts. Automaton has 2307 states and 3113 transitions. Word has length 189 [2025-02-05 11:57:46,311 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-02-05 11:57:46,311 INFO L471 AbstractCegarLoop]: Abstraction has 2307 states and 3113 transitions. [2025-02-05 11:57:46,312 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 63.0) internal successors, (189), 2 states have internal predecessors, (189), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-02-05 11:57:46,312 INFO L276 IsEmpty]: Start isEmpty. Operand 2307 states and 3113 transitions. [2025-02-05 11:57:46,315 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 225 [2025-02-05 11:57:46,315 INFO L210 NwaCegarLoop]: Found error trace [2025-02-05 11:57:46,316 INFO L218 NwaCegarLoop]: trace histogram [3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 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] [2025-02-05 11:57:46,316 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable2 [2025-02-05 11:57:46,316 INFO L396 AbstractCegarLoop]: === Iteration 4 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-02-05 11:57:46,317 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-02-05 11:57:46,318 INFO L85 PathProgramCache]: Analyzing trace with hash -1523648476, now seen corresponding path program 1 times [2025-02-05 11:57:46,318 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-02-05 11:57:46,319 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1453041536] [2025-02-05 11:57:46,319 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-02-05 11:57:46,319 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-02-05 11:57:46,353 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 224 statements into 1 equivalence classes. [2025-02-05 11:57:46,379 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 224 of 224 statements. [2025-02-05 11:57:46,380 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-02-05 11:57:46,380 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-02-05 11:57:46,500 INFO L134 CoverageAnalysis]: Checked inductivity of 189 backedges. 111 proven. 0 refuted. 0 times theorem prover too weak. 78 trivial. 0 not checked. [2025-02-05 11:57:46,500 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-02-05 11:57:46,500 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1453041536] [2025-02-05 11:57:46,500 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1453041536] provided 1 perfect and 0 imperfect interpolant sequences [2025-02-05 11:57:46,500 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-02-05 11:57:46,500 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2025-02-05 11:57:46,501 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1835920488] [2025-02-05 11:57:46,501 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-02-05 11:57:46,501 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2025-02-05 11:57:46,501 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-02-05 11:57:46,502 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2025-02-05 11:57:46,502 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-02-05 11:57:46,502 INFO L87 Difference]: Start difference. First operand 2307 states and 3113 transitions. Second operand has 3 states, 3 states have (on average 49.0) internal successors, (147), 2 states have internal predecessors, (147), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-02-05 11:57:47,442 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-02-05 11:57:47,442 INFO L93 Difference]: Finished difference Result 5599 states and 7699 transitions. [2025-02-05 11:57:47,443 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2025-02-05 11:57:47,443 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 49.0) internal successors, (147), 2 states have internal predecessors, (147), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 224 [2025-02-05 11:57:47,443 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-02-05 11:57:47,452 INFO L225 Difference]: With dead ends: 5599 [2025-02-05 11:57:47,452 INFO L226 Difference]: Without dead ends: 3623 [2025-02-05 11:57:47,454 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 2 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-02-05 11:57:47,455 INFO L435 NwaCegarLoop]: 151 mSDtfsCounter, 359 mSDsluCounter, 4 mSDsCounter, 0 mSdLazyCounter, 811 mSolverCounterSat, 307 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.7s Time, 0 mProtectedPredicate, 0 mProtectedAction, 359 SdHoareTripleChecker+Valid, 155 SdHoareTripleChecker+Invalid, 1118 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 307 IncrementalHoareTripleChecker+Valid, 811 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.9s IncrementalHoareTripleChecker+Time [2025-02-05 11:57:47,455 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [359 Valid, 155 Invalid, 1118 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [307 Valid, 811 Invalid, 0 Unknown, 0 Unchecked, 0.9s Time] [2025-02-05 11:57:47,457 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 3623 states. [2025-02-05 11:57:47,520 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 3623 to 2965. [2025-02-05 11:57:47,523 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 2965 states, 2964 states have (on average 1.2442645074224021) internal successors, (3688), 2964 states have internal predecessors, (3688), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-02-05 11:57:47,527 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 2965 states to 2965 states and 3688 transitions. [2025-02-05 11:57:47,527 INFO L78 Accepts]: Start accepts. Automaton has 2965 states and 3688 transitions. Word has length 224 [2025-02-05 11:57:47,528 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-02-05 11:57:47,528 INFO L471 AbstractCegarLoop]: Abstraction has 2965 states and 3688 transitions. [2025-02-05 11:57:47,528 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 49.0) internal successors, (147), 2 states have internal predecessors, (147), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-02-05 11:57:47,528 INFO L276 IsEmpty]: Start isEmpty. Operand 2965 states and 3688 transitions. [2025-02-05 11:57:47,530 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 242 [2025-02-05 11:57:47,530 INFO L210 NwaCegarLoop]: Found error trace [2025-02-05 11:57:47,530 INFO L218 NwaCegarLoop]: trace histogram [3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 2, 2, 2, 2, 2, 2, 2, 2, 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] [2025-02-05 11:57:47,530 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable3 [2025-02-05 11:57:47,530 INFO L396 AbstractCegarLoop]: === Iteration 5 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-02-05 11:57:47,531 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-02-05 11:57:47,531 INFO L85 PathProgramCache]: Analyzing trace with hash 608302962, now seen corresponding path program 1 times [2025-02-05 11:57:47,531 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-02-05 11:57:47,531 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [803771645] [2025-02-05 11:57:47,531 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-02-05 11:57:47,531 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-02-05 11:57:47,547 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 241 statements into 1 equivalence classes. [2025-02-05 11:57:47,559 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 241 of 241 statements. [2025-02-05 11:57:47,559 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-02-05 11:57:47,559 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-02-05 11:57:47,653 INFO L134 CoverageAnalysis]: Checked inductivity of 197 backedges. 197 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-02-05 11:57:47,653 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-02-05 11:57:47,653 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [803771645] [2025-02-05 11:57:47,653 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [803771645] provided 1 perfect and 0 imperfect interpolant sequences [2025-02-05 11:57:47,654 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-02-05 11:57:47,654 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2025-02-05 11:57:47,654 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [975381007] [2025-02-05 11:57:47,654 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-02-05 11:57:47,654 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2025-02-05 11:57:47,654 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-02-05 11:57:47,655 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2025-02-05 11:57:47,655 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-02-05 11:57:47,655 INFO L87 Difference]: Start difference. First operand 2965 states and 3688 transitions. Second operand has 3 states, 3 states have (on average 80.33333333333333) internal successors, (241), 3 states have internal predecessors, (241), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-02-05 11:57:48,574 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-02-05 11:57:48,574 INFO L93 Difference]: Finished difference Result 6915 states and 8657 transitions. [2025-02-05 11:57:48,574 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2025-02-05 11:57:48,575 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 80.33333333333333) internal successors, (241), 3 states have internal predecessors, (241), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 241 [2025-02-05 11:57:48,575 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-02-05 11:57:48,584 INFO L225 Difference]: With dead ends: 6915 [2025-02-05 11:57:48,584 INFO L226 Difference]: Without dead ends: 3952 [2025-02-05 11:57:48,587 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 3 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-02-05 11:57:48,588 INFO L435 NwaCegarLoop]: 534 mSDtfsCounter, 287 mSDsluCounter, 5 mSDsCounter, 0 mSdLazyCounter, 796 mSolverCounterSat, 298 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.7s Time, 0 mProtectedPredicate, 0 mProtectedAction, 287 SdHoareTripleChecker+Valid, 539 SdHoareTripleChecker+Invalid, 1094 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 298 IncrementalHoareTripleChecker+Valid, 796 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.9s IncrementalHoareTripleChecker+Time [2025-02-05 11:57:48,589 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [287 Valid, 539 Invalid, 1094 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [298 Valid, 796 Invalid, 0 Unknown, 0 Unchecked, 0.9s Time] [2025-02-05 11:57:48,593 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 3952 states. [2025-02-05 11:57:48,630 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 3952 to 3952. [2025-02-05 11:57:48,634 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 3952 states, 3951 states have (on average 1.0736522399392558) internal successors, (4242), 3951 states have internal predecessors, (4242), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-02-05 11:57:48,639 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3952 states to 3952 states and 4242 transitions. [2025-02-05 11:57:48,639 INFO L78 Accepts]: Start accepts. Automaton has 3952 states and 4242 transitions. Word has length 241 [2025-02-05 11:57:48,639 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-02-05 11:57:48,639 INFO L471 AbstractCegarLoop]: Abstraction has 3952 states and 4242 transitions. [2025-02-05 11:57:48,640 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 80.33333333333333) internal successors, (241), 3 states have internal predecessors, (241), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-02-05 11:57:48,640 INFO L276 IsEmpty]: Start isEmpty. Operand 3952 states and 4242 transitions. [2025-02-05 11:57:48,641 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 294 [2025-02-05 11:57:48,641 INFO L210 NwaCegarLoop]: Found error trace [2025-02-05 11:57:48,642 INFO L218 NwaCegarLoop]: trace histogram [2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 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] [2025-02-05 11:57:48,642 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable4 [2025-02-05 11:57:48,642 INFO L396 AbstractCegarLoop]: === Iteration 6 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-02-05 11:57:48,642 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-02-05 11:57:48,643 INFO L85 PathProgramCache]: Analyzing trace with hash -579281318, now seen corresponding path program 1 times [2025-02-05 11:57:48,643 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-02-05 11:57:48,643 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2084160339] [2025-02-05 11:57:48,643 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-02-05 11:57:48,643 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-02-05 11:57:48,694 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 293 statements into 1 equivalence classes. [2025-02-05 11:57:48,716 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 293 of 293 statements. [2025-02-05 11:57:48,718 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-02-05 11:57:48,718 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-02-05 11:57:48,874 INFO L134 CoverageAnalysis]: Checked inductivity of 55 backedges. 55 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-02-05 11:57:48,875 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-02-05 11:57:48,875 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2084160339] [2025-02-05 11:57:48,876 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [2084160339] provided 1 perfect and 0 imperfect interpolant sequences [2025-02-05 11:57:48,876 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-02-05 11:57:48,876 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2025-02-05 11:57:48,876 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [86646961] [2025-02-05 11:57:48,876 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-02-05 11:57:48,876 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2025-02-05 11:57:48,879 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-02-05 11:57:48,879 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2025-02-05 11:57:48,879 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-02-05 11:57:48,880 INFO L87 Difference]: Start difference. First operand 3952 states and 4242 transitions. Second operand has 3 states, 3 states have (on average 97.66666666666667) internal successors, (293), 3 states have internal predecessors, (293), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-02-05 11:57:49,584 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-02-05 11:57:49,584 INFO L93 Difference]: Finished difference Result 9218 states and 9926 transitions. [2025-02-05 11:57:49,585 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2025-02-05 11:57:49,585 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 97.66666666666667) internal successors, (293), 3 states have internal predecessors, (293), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 293 [2025-02-05 11:57:49,585 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-02-05 11:57:49,597 INFO L225 Difference]: With dead ends: 9218 [2025-02-05 11:57:49,597 INFO L226 Difference]: Without dead ends: 5268 [2025-02-05 11:57:49,601 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 3 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-02-05 11:57:49,603 INFO L435 NwaCegarLoop]: 418 mSDtfsCounter, 279 mSDsluCounter, 6 mSDsCounter, 0 mSdLazyCounter, 772 mSolverCounterSat, 91 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.5s Time, 0 mProtectedPredicate, 0 mProtectedAction, 279 SdHoareTripleChecker+Valid, 424 SdHoareTripleChecker+Invalid, 863 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 91 IncrementalHoareTripleChecker+Valid, 772 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.7s IncrementalHoareTripleChecker+Time [2025-02-05 11:57:49,604 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [279 Valid, 424 Invalid, 863 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [91 Valid, 772 Invalid, 0 Unknown, 0 Unchecked, 0.7s Time] [2025-02-05 11:57:49,609 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 5268 states. [2025-02-05 11:57:49,700 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 5268 to 5268. [2025-02-05 11:57:49,706 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 5268 states, 5267 states have (on average 1.0493639643060566) internal successors, (5527), 5267 states have internal predecessors, (5527), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-02-05 11:57:49,713 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5268 states to 5268 states and 5527 transitions. [2025-02-05 11:57:49,713 INFO L78 Accepts]: Start accepts. Automaton has 5268 states and 5527 transitions. Word has length 293 [2025-02-05 11:57:49,713 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-02-05 11:57:49,713 INFO L471 AbstractCegarLoop]: Abstraction has 5268 states and 5527 transitions. [2025-02-05 11:57:49,714 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 97.66666666666667) internal successors, (293), 3 states have internal predecessors, (293), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-02-05 11:57:49,714 INFO L276 IsEmpty]: Start isEmpty. Operand 5268 states and 5527 transitions. [2025-02-05 11:57:49,720 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 398 [2025-02-05 11:57:49,720 INFO L210 NwaCegarLoop]: Found error trace [2025-02-05 11:57:49,721 INFO L218 NwaCegarLoop]: trace histogram [3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 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] [2025-02-05 11:57:49,721 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable5 [2025-02-05 11:57:49,721 INFO L396 AbstractCegarLoop]: === Iteration 7 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-02-05 11:57:49,721 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-02-05 11:57:49,721 INFO L85 PathProgramCache]: Analyzing trace with hash 2033380972, now seen corresponding path program 1 times [2025-02-05 11:57:49,722 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-02-05 11:57:49,722 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1745611038] [2025-02-05 11:57:49,722 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-02-05 11:57:49,722 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-02-05 11:57:49,749 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 397 statements into 1 equivalence classes. [2025-02-05 11:57:49,771 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 397 of 397 statements. [2025-02-05 11:57:49,772 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-02-05 11:57:49,772 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-02-05 11:57:49,959 INFO L134 CoverageAnalysis]: Checked inductivity of 206 backedges. 111 proven. 0 refuted. 0 times theorem prover too weak. 95 trivial. 0 not checked. [2025-02-05 11:57:49,959 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-02-05 11:57:49,959 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1745611038] [2025-02-05 11:57:49,959 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1745611038] provided 1 perfect and 0 imperfect interpolant sequences [2025-02-05 11:57:49,959 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-02-05 11:57:49,959 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2025-02-05 11:57:49,959 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1463540135] [2025-02-05 11:57:49,960 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-02-05 11:57:49,960 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2025-02-05 11:57:49,960 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-02-05 11:57:49,961 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2025-02-05 11:57:49,962 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-02-05 11:57:49,962 INFO L87 Difference]: Start difference. First operand 5268 states and 5527 transitions. Second operand has 3 states, 3 states have (on average 101.0) internal successors, (303), 3 states have internal predecessors, (303), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-02-05 11:57:50,720 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-02-05 11:57:50,721 INFO L93 Difference]: Finished difference Result 11850 states and 12495 transitions. [2025-02-05 11:57:50,721 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2025-02-05 11:57:50,721 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 101.0) internal successors, (303), 3 states have internal predecessors, (303), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 397 [2025-02-05 11:57:50,722 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-02-05 11:57:50,736 INFO L225 Difference]: With dead ends: 11850 [2025-02-05 11:57:50,736 INFO L226 Difference]: Without dead ends: 6584 [2025-02-05 11:57:50,741 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 3 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-02-05 11:57:50,742 INFO L435 NwaCegarLoop]: 34 mSDtfsCounter, 290 mSDsluCounter, 5 mSDsCounter, 0 mSdLazyCounter, 766 mSolverCounterSat, 99 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.5s Time, 0 mProtectedPredicate, 0 mProtectedAction, 290 SdHoareTripleChecker+Valid, 39 SdHoareTripleChecker+Invalid, 865 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 99 IncrementalHoareTripleChecker+Valid, 766 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.7s IncrementalHoareTripleChecker+Time [2025-02-05 11:57:50,742 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [290 Valid, 39 Invalid, 865 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [99 Valid, 766 Invalid, 0 Unknown, 0 Unchecked, 0.7s Time] [2025-02-05 11:57:50,748 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 6584 states. [2025-02-05 11:57:50,816 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 6584 to 6584. [2025-02-05 11:57:50,823 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 6584 states, 6583 states have (on average 1.052863436123348) internal successors, (6931), 6583 states have internal predecessors, (6931), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-02-05 11:57:50,838 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 6584 states to 6584 states and 6931 transitions. [2025-02-05 11:57:50,838 INFO L78 Accepts]: Start accepts. Automaton has 6584 states and 6931 transitions. Word has length 397 [2025-02-05 11:57:50,839 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-02-05 11:57:50,839 INFO L471 AbstractCegarLoop]: Abstraction has 6584 states and 6931 transitions. [2025-02-05 11:57:50,839 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 101.0) internal successors, (303), 3 states have internal predecessors, (303), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-02-05 11:57:50,839 INFO L276 IsEmpty]: Start isEmpty. Operand 6584 states and 6931 transitions. [2025-02-05 11:57:50,844 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 452 [2025-02-05 11:57:50,844 INFO L210 NwaCegarLoop]: Found error trace [2025-02-05 11:57:50,846 INFO L218 NwaCegarLoop]: trace histogram [3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 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] [2025-02-05 11:57:50,846 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable6 [2025-02-05 11:57:50,846 INFO L396 AbstractCegarLoop]: === Iteration 8 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-02-05 11:57:50,847 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-02-05 11:57:50,847 INFO L85 PathProgramCache]: Analyzing trace with hash 1787591109, now seen corresponding path program 1 times [2025-02-05 11:57:50,847 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-02-05 11:57:50,847 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [172977218] [2025-02-05 11:57:50,847 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-02-05 11:57:50,847 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-02-05 11:57:50,891 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 451 statements into 1 equivalence classes. [2025-02-05 11:57:50,917 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 451 of 451 statements. [2025-02-05 11:57:50,918 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-02-05 11:57:50,918 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-02-05 11:57:51,245 INFO L134 CoverageAnalysis]: Checked inductivity of 268 backedges. 0 proven. 36 refuted. 0 times theorem prover too weak. 232 trivial. 0 not checked. [2025-02-05 11:57:51,246 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-02-05 11:57:51,246 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [172977218] [2025-02-05 11:57:51,246 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [172977218] provided 0 perfect and 1 imperfect interpolant sequences [2025-02-05 11:57:51,246 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [662860385] [2025-02-05 11:57:51,246 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-02-05 11:57:51,246 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-02-05 11:57:51,246 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 [2025-02-05 11:57:51,249 INFO L229 MonitoredProcess]: Starting monitored process 2 with /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2025-02-05 11:57:51,252 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (2)] Waiting until timeout for monitored process [2025-02-05 11:57:51,308 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 451 statements into 1 equivalence classes. [2025-02-05 11:57:51,367 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 451 of 451 statements. [2025-02-05 11:57:51,368 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-02-05 11:57:51,368 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-02-05 11:57:51,371 INFO L256 TraceCheckSpWp]: Trace formula consists of 545 conjuncts, 2 conjuncts are in the unsatisfiable core [2025-02-05 11:57:51,378 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-02-05 11:57:51,825 INFO L134 CoverageAnalysis]: Checked inductivity of 268 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 268 trivial. 0 not checked. [2025-02-05 11:57:51,825 INFO L308 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2025-02-05 11:57:51,825 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [662860385] provided 1 perfect and 0 imperfect interpolant sequences [2025-02-05 11:57:51,825 INFO L185 FreeRefinementEngine]: Found 1 perfect and 1 imperfect interpolant sequences. [2025-02-05 11:57:51,825 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [3] total 4 [2025-02-05 11:57:51,825 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [658387303] [2025-02-05 11:57:51,825 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-02-05 11:57:51,826 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2025-02-05 11:57:51,826 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-02-05 11:57:51,826 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2025-02-05 11:57:51,826 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=8, Invalid=12, Unknown=0, NotChecked=0, Total=20 [2025-02-05 11:57:51,826 INFO L87 Difference]: Start difference. First operand 6584 states and 6931 transitions. Second operand has 3 states, 3 states have (on average 80.0) internal successors, (240), 2 states have internal predecessors, (240), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-02-05 11:57:52,498 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-02-05 11:57:52,498 INFO L93 Difference]: Finished difference Result 7902 states and 8284 transitions. [2025-02-05 11:57:52,499 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2025-02-05 11:57:52,499 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 80.0) internal successors, (240), 2 states have internal predecessors, (240), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 451 [2025-02-05 11:57:52,500 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-02-05 11:57:52,516 INFO L225 Difference]: With dead ends: 7902 [2025-02-05 11:57:52,517 INFO L226 Difference]: Without dead ends: 7900 [2025-02-05 11:57:52,519 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 453 GetRequests, 450 SyntacticMatches, 0 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=8, Invalid=12, Unknown=0, NotChecked=0, Total=20 [2025-02-05 11:57:52,520 INFO L435 NwaCegarLoop]: 73 mSDtfsCounter, 116 mSDsluCounter, 5 mSDsCounter, 0 mSdLazyCounter, 743 mSolverCounterSat, 32 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.5s Time, 0 mProtectedPredicate, 0 mProtectedAction, 116 SdHoareTripleChecker+Valid, 78 SdHoareTripleChecker+Invalid, 775 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 32 IncrementalHoareTripleChecker+Valid, 743 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.6s IncrementalHoareTripleChecker+Time [2025-02-05 11:57:52,520 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [116 Valid, 78 Invalid, 775 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [32 Valid, 743 Invalid, 0 Unknown, 0 Unchecked, 0.6s Time] [2025-02-05 11:57:52,525 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 7900 states. [2025-02-05 11:57:52,585 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 7900 to 6913. [2025-02-05 11:57:52,596 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 6913 states, 6912 states have (on average 1.0522280092592593) internal successors, (7273), 6912 states have internal predecessors, (7273), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-02-05 11:57:52,643 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 6913 states to 6913 states and 7273 transitions. [2025-02-05 11:57:52,643 INFO L78 Accepts]: Start accepts. Automaton has 6913 states and 7273 transitions. Word has length 451 [2025-02-05 11:57:52,643 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-02-05 11:57:52,643 INFO L471 AbstractCegarLoop]: Abstraction has 6913 states and 7273 transitions. [2025-02-05 11:57:52,644 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 80.0) internal successors, (240), 2 states have internal predecessors, (240), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-02-05 11:57:52,644 INFO L276 IsEmpty]: Start isEmpty. Operand 6913 states and 7273 transitions. [2025-02-05 11:57:52,678 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 861 [2025-02-05 11:57:52,679 INFO L210 NwaCegarLoop]: Found error trace [2025-02-05 11:57:52,680 INFO L218 NwaCegarLoop]: trace histogram [6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 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] [2025-02-05 11:57:52,696 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (2)] Forceful destruction successful, exit code 0 [2025-02-05 11:57:52,881 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable7,2 /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-02-05 11:57:52,881 INFO L396 AbstractCegarLoop]: === Iteration 9 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-02-05 11:57:52,886 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-02-05 11:57:52,886 INFO L85 PathProgramCache]: Analyzing trace with hash 960338517, now seen corresponding path program 1 times [2025-02-05 11:57:52,886 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-02-05 11:57:52,886 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1671814672] [2025-02-05 11:57:52,887 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-02-05 11:57:52,887 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-02-05 11:57:52,958 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 860 statements into 1 equivalence classes. [2025-02-05 11:57:52,988 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 860 of 860 statements. [2025-02-05 11:57:52,988 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-02-05 11:57:52,989 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-02-05 11:57:53,315 INFO L134 CoverageAnalysis]: Checked inductivity of 1387 backedges. 960 proven. 0 refuted. 0 times theorem prover too weak. 427 trivial. 0 not checked. [2025-02-05 11:57:53,315 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-02-05 11:57:53,315 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1671814672] [2025-02-05 11:57:53,315 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1671814672] provided 1 perfect and 0 imperfect interpolant sequences [2025-02-05 11:57:53,315 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-02-05 11:57:53,316 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2025-02-05 11:57:53,316 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1578781174] [2025-02-05 11:57:53,316 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-02-05 11:57:53,316 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2025-02-05 11:57:53,316 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-02-05 11:57:53,317 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2025-02-05 11:57:53,317 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-02-05 11:57:53,317 INFO L87 Difference]: Start difference. First operand 6913 states and 7273 transitions. Second operand has 3 states, 3 states have (on average 166.66666666666666) internal successors, (500), 3 states have internal predecessors, (500), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-02-05 11:57:54,190 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-02-05 11:57:54,190 INFO L93 Difference]: Finished difference Result 15469 states and 16329 transitions. [2025-02-05 11:57:54,191 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2025-02-05 11:57:54,191 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 166.66666666666666) internal successors, (500), 3 states have internal predecessors, (500), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 860 [2025-02-05 11:57:54,192 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-02-05 11:57:54,206 INFO L225 Difference]: With dead ends: 15469 [2025-02-05 11:57:54,206 INFO L226 Difference]: Without dead ends: 8558 [2025-02-05 11:57:54,211 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 3 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-02-05 11:57:54,215 INFO L435 NwaCegarLoop]: 428 mSDtfsCounter, 220 mSDsluCounter, 6 mSDsCounter, 0 mSdLazyCounter, 755 mSolverCounterSat, 80 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.7s Time, 0 mProtectedPredicate, 0 mProtectedAction, 220 SdHoareTripleChecker+Valid, 434 SdHoareTripleChecker+Invalid, 835 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 80 IncrementalHoareTripleChecker+Valid, 755 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.8s IncrementalHoareTripleChecker+Time [2025-02-05 11:57:54,215 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [220 Valid, 434 Invalid, 835 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [80 Valid, 755 Invalid, 0 Unknown, 0 Unchecked, 0.8s Time] [2025-02-05 11:57:54,222 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 8558 states. [2025-02-05 11:57:54,312 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 8558 to 8229. [2025-02-05 11:57:54,325 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 8229 states, 8228 states have (on average 1.0469129800680603) internal successors, (8614), 8228 states have internal predecessors, (8614), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-02-05 11:57:54,333 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 8229 states to 8229 states and 8614 transitions. [2025-02-05 11:57:54,334 INFO L78 Accepts]: Start accepts. Automaton has 8229 states and 8614 transitions. Word has length 860 [2025-02-05 11:57:54,334 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-02-05 11:57:54,334 INFO L471 AbstractCegarLoop]: Abstraction has 8229 states and 8614 transitions. [2025-02-05 11:57:54,335 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 166.66666666666666) internal successors, (500), 3 states have internal predecessors, (500), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-02-05 11:57:54,335 INFO L276 IsEmpty]: Start isEmpty. Operand 8229 states and 8614 transitions. [2025-02-05 11:57:54,343 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 908 [2025-02-05 11:57:54,343 INFO L210 NwaCegarLoop]: Found error trace [2025-02-05 11:57:54,344 INFO L218 NwaCegarLoop]: trace histogram [6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 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] [2025-02-05 11:57:54,344 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable8 [2025-02-05 11:57:54,344 INFO L396 AbstractCegarLoop]: === Iteration 10 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-02-05 11:57:54,345 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-02-05 11:57:54,345 INFO L85 PathProgramCache]: Analyzing trace with hash 1453777806, now seen corresponding path program 1 times [2025-02-05 11:57:54,345 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-02-05 11:57:54,348 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1374427257] [2025-02-05 11:57:54,348 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-02-05 11:57:54,348 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-02-05 11:57:54,409 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 907 statements into 1 equivalence classes. [2025-02-05 11:57:54,454 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 907 of 907 statements. [2025-02-05 11:57:54,454 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-02-05 11:57:54,454 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-02-05 11:57:55,712 INFO L134 CoverageAnalysis]: Checked inductivity of 1483 backedges. 767 proven. 0 refuted. 0 times theorem prover too weak. 716 trivial. 0 not checked. [2025-02-05 11:57:55,712 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-02-05 11:57:55,712 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1374427257] [2025-02-05 11:57:55,713 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1374427257] provided 1 perfect and 0 imperfect interpolant sequences [2025-02-05 11:57:55,713 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-02-05 11:57:55,713 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2025-02-05 11:57:55,713 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1483207121] [2025-02-05 11:57:55,713 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-02-05 11:57:55,713 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2025-02-05 11:57:55,714 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-02-05 11:57:55,714 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2025-02-05 11:57:55,714 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-02-05 11:57:55,714 INFO L87 Difference]: Start difference. First operand 8229 states and 8614 transitions. Second operand has 3 states, 3 states have (on average 145.33333333333334) internal successors, (436), 3 states have internal predecessors, (436), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-02-05 11:57:56,517 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-02-05 11:57:56,518 INFO L93 Difference]: Finished difference Result 16127 states and 16895 transitions. [2025-02-05 11:57:56,520 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2025-02-05 11:57:56,520 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 145.33333333333334) internal successors, (436), 3 states have internal predecessors, (436), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 907 [2025-02-05 11:57:56,521 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-02-05 11:57:56,531 INFO L225 Difference]: With dead ends: 16127 [2025-02-05 11:57:56,532 INFO L226 Difference]: Without dead ends: 8229 [2025-02-05 11:57:56,537 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 9 GetRequests, 8 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-02-05 11:57:56,538 INFO L435 NwaCegarLoop]: 371 mSDtfsCounter, 180 mSDsluCounter, 6 mSDsCounter, 0 mSdLazyCounter, 774 mSolverCounterSat, 18 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.6s Time, 0 mProtectedPredicate, 0 mProtectedAction, 180 SdHoareTripleChecker+Valid, 377 SdHoareTripleChecker+Invalid, 792 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 18 IncrementalHoareTripleChecker+Valid, 774 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.8s IncrementalHoareTripleChecker+Time [2025-02-05 11:57:56,538 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [180 Valid, 377 Invalid, 792 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [18 Valid, 774 Invalid, 0 Unknown, 0 Unchecked, 0.8s Time] [2025-02-05 11:57:56,543 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 8229 states. [2025-02-05 11:57:56,585 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 8229 to 8229. [2025-02-05 11:57:56,592 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 8229 states, 8228 states have (on average 1.0408361691784151) internal successors, (8564), 8228 states have internal predecessors, (8564), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-02-05 11:57:56,634 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 8229 states to 8229 states and 8564 transitions. [2025-02-05 11:57:56,635 INFO L78 Accepts]: Start accepts. Automaton has 8229 states and 8564 transitions. Word has length 907 [2025-02-05 11:57:56,636 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-02-05 11:57:56,636 INFO L471 AbstractCegarLoop]: Abstraction has 8229 states and 8564 transitions. [2025-02-05 11:57:56,636 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 145.33333333333334) internal successors, (436), 3 states have internal predecessors, (436), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-02-05 11:57:56,636 INFO L276 IsEmpty]: Start isEmpty. Operand 8229 states and 8564 transitions. [2025-02-05 11:57:56,650 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 1324 [2025-02-05 11:57:56,650 INFO L210 NwaCegarLoop]: Found error trace [2025-02-05 11:57:56,651 INFO L218 NwaCegarLoop]: trace histogram [9, 9, 9, 9, 9, 9, 9, 9, 9, 9, 9, 9, 9, 9, 9, 9, 9, 9, 9, 9, 9, 9, 9, 9, 9, 9, 9, 9, 9, 9, 9, 9, 9, 9, 9, 9, 9, 9, 9, 9, 9, 9, 9, 9, 9, 9, 9, 9, 9, 9, 9, 9, 9, 9, 8, 8, 8, 8, 8, 8, 8, 8, 8, 8, 8, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 6, 6, 6, 6, 6, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 4, 4, 4, 4, 4, 4, 4, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 2, 2, 2, 2, 2, 2, 2, 2, 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] [2025-02-05 11:57:56,651 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable9 [2025-02-05 11:57:56,651 INFO L396 AbstractCegarLoop]: === Iteration 11 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-02-05 11:57:56,652 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-02-05 11:57:56,652 INFO L85 PathProgramCache]: Analyzing trace with hash -1168540621, now seen corresponding path program 1 times [2025-02-05 11:57:56,652 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-02-05 11:57:56,652 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1612726300] [2025-02-05 11:57:56,653 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-02-05 11:57:56,653 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-02-05 11:57:56,718 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 1323 statements into 1 equivalence classes. [2025-02-05 11:57:56,752 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 1323 of 1323 statements. [2025-02-05 11:57:56,752 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-02-05 11:57:56,752 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-02-05 11:57:57,318 INFO L134 CoverageAnalysis]: Checked inductivity of 3745 backedges. 2560 proven. 0 refuted. 0 times theorem prover too weak. 1185 trivial. 0 not checked. [2025-02-05 11:57:57,318 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-02-05 11:57:57,319 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1612726300] [2025-02-05 11:57:57,319 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1612726300] provided 1 perfect and 0 imperfect interpolant sequences [2025-02-05 11:57:57,319 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-02-05 11:57:57,319 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2025-02-05 11:57:57,320 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1358005952] [2025-02-05 11:57:57,320 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-02-05 11:57:57,321 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2025-02-05 11:57:57,321 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-02-05 11:57:57,322 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2025-02-05 11:57:57,322 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-02-05 11:57:57,322 INFO L87 Difference]: Start difference. First operand 8229 states and 8564 transitions. Second operand has 3 states, 3 states have (on average 201.0) internal successors, (603), 3 states have internal predecessors, (603), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-02-05 11:57:57,972 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-02-05 11:57:57,972 INFO L93 Difference]: Finished difference Result 16127 states and 16795 transitions. [2025-02-05 11:57:57,973 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2025-02-05 11:57:57,973 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 201.0) internal successors, (603), 3 states have internal predecessors, (603), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 1323 [2025-02-05 11:57:57,974 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-02-05 11:57:57,985 INFO L225 Difference]: With dead ends: 16127 [2025-02-05 11:57:57,985 INFO L226 Difference]: Without dead ends: 8229 [2025-02-05 11:57:57,991 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 3 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-02-05 11:57:57,992 INFO L435 NwaCegarLoop]: 422 mSDtfsCounter, 192 mSDsluCounter, 6 mSDsCounter, 0 mSdLazyCounter, 757 mSolverCounterSat, 47 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.5s Time, 0 mProtectedPredicate, 0 mProtectedAction, 192 SdHoareTripleChecker+Valid, 428 SdHoareTripleChecker+Invalid, 804 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 47 IncrementalHoareTripleChecker+Valid, 757 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.6s IncrementalHoareTripleChecker+Time [2025-02-05 11:57:57,992 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [192 Valid, 428 Invalid, 804 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [47 Valid, 757 Invalid, 0 Unknown, 0 Unchecked, 0.6s Time] [2025-02-05 11:57:58,000 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 8229 states. [2025-02-05 11:57:58,046 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 8229 to 8229. [2025-02-05 11:57:58,052 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 8229 states, 8228 states have (on average 1.0342732134175985) internal successors, (8510), 8228 states have internal predecessors, (8510), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-02-05 11:57:58,058 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 8229 states to 8229 states and 8510 transitions. [2025-02-05 11:57:58,058 INFO L78 Accepts]: Start accepts. Automaton has 8229 states and 8510 transitions. Word has length 1323 [2025-02-05 11:57:58,059 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-02-05 11:57:58,059 INFO L471 AbstractCegarLoop]: Abstraction has 8229 states and 8510 transitions. [2025-02-05 11:57:58,059 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 201.0) internal successors, (603), 3 states have internal predecessors, (603), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-02-05 11:57:58,059 INFO L276 IsEmpty]: Start isEmpty. Operand 8229 states and 8510 transitions. [2025-02-05 11:57:58,073 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 1352 [2025-02-05 11:57:58,073 INFO L210 NwaCegarLoop]: Found error trace [2025-02-05 11:57:58,074 INFO L218 NwaCegarLoop]: trace histogram [9, 9, 9, 9, 9, 9, 9, 9, 9, 9, 9, 9, 9, 9, 9, 9, 9, 9, 9, 9, 9, 9, 9, 9, 9, 9, 9, 9, 9, 9, 9, 9, 9, 9, 9, 9, 9, 9, 9, 9, 9, 9, 9, 9, 9, 9, 9, 9, 9, 9, 9, 9, 9, 9, 8, 8, 8, 8, 8, 8, 8, 8, 8, 8, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 5, 5, 4, 4, 4, 4, 4, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 2, 2, 2, 2, 2, 2, 2, 2, 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] [2025-02-05 11:57:58,074 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable10 [2025-02-05 11:57:58,075 INFO L396 AbstractCegarLoop]: === Iteration 12 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-02-05 11:57:58,075 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-02-05 11:57:58,075 INFO L85 PathProgramCache]: Analyzing trace with hash 499973135, now seen corresponding path program 1 times [2025-02-05 11:57:58,075 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-02-05 11:57:58,075 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1212990161] [2025-02-05 11:57:58,076 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-02-05 11:57:58,076 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-02-05 11:57:58,164 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 1351 statements into 1 equivalence classes. [2025-02-05 11:57:58,195 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 1351 of 1351 statements. [2025-02-05 11:57:58,195 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-02-05 11:57:58,195 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-02-05 11:57:59,153 INFO L134 CoverageAnalysis]: Checked inductivity of 3881 backedges. 2431 proven. 0 refuted. 0 times theorem prover too weak. 1450 trivial. 0 not checked. [2025-02-05 11:57:59,154 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-02-05 11:57:59,154 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1212990161] [2025-02-05 11:57:59,154 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1212990161] provided 1 perfect and 0 imperfect interpolant sequences [2025-02-05 11:57:59,154 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-02-05 11:57:59,154 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2025-02-05 11:57:59,154 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [567391262] [2025-02-05 11:57:59,154 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-02-05 11:57:59,155 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2025-02-05 11:57:59,155 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-02-05 11:57:59,156 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2025-02-05 11:57:59,156 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-02-05 11:57:59,156 INFO L87 Difference]: Start difference. First operand 8229 states and 8510 transitions. Second operand has 3 states, 3 states have (on average 190.33333333333334) internal successors, (571), 3 states have internal predecessors, (571), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-02-05 11:57:59,790 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-02-05 11:57:59,791 INFO L93 Difference]: Finished difference Result 17114 states and 17689 transitions. [2025-02-05 11:57:59,791 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2025-02-05 11:57:59,791 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 190.33333333333334) internal successors, (571), 3 states have internal predecessors, (571), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 1351 [2025-02-05 11:57:59,792 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-02-05 11:57:59,804 INFO L225 Difference]: With dead ends: 17114 [2025-02-05 11:57:59,804 INFO L226 Difference]: Without dead ends: 9216 [2025-02-05 11:57:59,811 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 3 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-02-05 11:57:59,811 INFO L435 NwaCegarLoop]: 435 mSDtfsCounter, 224 mSDsluCounter, 6 mSDsCounter, 0 mSdLazyCounter, 757 mSolverCounterSat, 8 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.5s Time, 0 mProtectedPredicate, 0 mProtectedAction, 224 SdHoareTripleChecker+Valid, 441 SdHoareTripleChecker+Invalid, 765 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 8 IncrementalHoareTripleChecker+Valid, 757 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.6s IncrementalHoareTripleChecker+Time [2025-02-05 11:57:59,811 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [224 Valid, 441 Invalid, 765 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [8 Valid, 757 Invalid, 0 Unknown, 0 Unchecked, 0.6s Time] [2025-02-05 11:57:59,816 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 9216 states. [2025-02-05 11:57:59,859 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 9216 to 9216. [2025-02-05 11:57:59,867 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 9216 states, 9215 states have (on average 1.0313619099294629) internal successors, (9504), 9215 states have internal predecessors, (9504), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-02-05 11:57:59,875 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 9216 states to 9216 states and 9504 transitions. [2025-02-05 11:57:59,875 INFO L78 Accepts]: Start accepts. Automaton has 9216 states and 9504 transitions. Word has length 1351 [2025-02-05 11:57:59,876 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-02-05 11:57:59,876 INFO L471 AbstractCegarLoop]: Abstraction has 9216 states and 9504 transitions. [2025-02-05 11:57:59,876 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 190.33333333333334) internal successors, (571), 3 states have internal predecessors, (571), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-02-05 11:57:59,876 INFO L276 IsEmpty]: Start isEmpty. Operand 9216 states and 9504 transitions. [2025-02-05 11:57:59,890 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 1370 [2025-02-05 11:57:59,891 INFO L210 NwaCegarLoop]: Found error trace [2025-02-05 11:57:59,891 INFO L218 NwaCegarLoop]: trace histogram [9, 9, 9, 9, 9, 9, 9, 9, 9, 9, 9, 9, 9, 9, 9, 9, 9, 9, 9, 9, 9, 9, 9, 9, 9, 9, 9, 9, 9, 9, 9, 9, 9, 9, 9, 9, 9, 9, 9, 9, 9, 9, 9, 9, 9, 9, 9, 9, 9, 9, 9, 9, 9, 9, 8, 8, 8, 8, 8, 8, 8, 8, 8, 8, 8, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 6, 6, 6, 6, 6, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 2, 2, 2, 2, 2, 2, 2, 2, 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] [2025-02-05 11:57:59,891 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable11 [2025-02-05 11:57:59,891 INFO L396 AbstractCegarLoop]: === Iteration 13 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-02-05 11:57:59,892 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-02-05 11:57:59,892 INFO L85 PathProgramCache]: Analyzing trace with hash -206926496, now seen corresponding path program 1 times [2025-02-05 11:57:59,892 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-02-05 11:57:59,892 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1548897797] [2025-02-05 11:57:59,892 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-02-05 11:57:59,893 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-02-05 11:57:59,959 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 1369 statements into 1 equivalence classes. [2025-02-05 11:58:00,001 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 1369 of 1369 statements. [2025-02-05 11:58:00,002 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-02-05 11:58:00,002 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-02-05 11:58:00,806 INFO L134 CoverageAnalysis]: Checked inductivity of 3890 backedges. 447 proven. 0 refuted. 0 times theorem prover too weak. 3443 trivial. 0 not checked. [2025-02-05 11:58:00,806 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-02-05 11:58:00,807 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1548897797] [2025-02-05 11:58:00,807 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1548897797] provided 1 perfect and 0 imperfect interpolant sequences [2025-02-05 11:58:00,807 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-02-05 11:58:00,807 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2025-02-05 11:58:00,807 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1791942638] [2025-02-05 11:58:00,807 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-02-05 11:58:00,808 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2025-02-05 11:58:00,808 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-02-05 11:58:00,808 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2025-02-05 11:58:00,808 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-02-05 11:58:00,809 INFO L87 Difference]: Start difference. First operand 9216 states and 9504 transitions. Second operand has 3 states, 3 states have (on average 103.66666666666667) internal successors, (311), 3 states have internal predecessors, (311), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-02-05 11:58:01,222 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-02-05 11:58:01,222 INFO L93 Difference]: Finished difference Result 9552 states and 9840 transitions. [2025-02-05 11:58:01,223 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2025-02-05 11:58:01,223 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 103.66666666666667) internal successors, (311), 3 states have internal predecessors, (311), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 1369 [2025-02-05 11:58:01,224 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-02-05 11:58:01,237 INFO L225 Difference]: With dead ends: 9552 [2025-02-05 11:58:01,237 INFO L226 Difference]: Without dead ends: 9216 [2025-02-05 11:58:01,240 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 3 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-02-05 11:58:01,240 INFO L435 NwaCegarLoop]: 434 mSDtfsCounter, 0 mSDsluCounter, 6 mSDsCounter, 0 mSdLazyCounter, 425 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.3s Time, 0 mProtectedPredicate, 0 mProtectedAction, 0 SdHoareTripleChecker+Valid, 440 SdHoareTripleChecker+Invalid, 425 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 425 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.4s IncrementalHoareTripleChecker+Time [2025-02-05 11:58:01,241 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [0 Valid, 440 Invalid, 425 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 425 Invalid, 0 Unknown, 0 Unchecked, 0.4s Time] [2025-02-05 11:58:01,246 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 9216 states. [2025-02-05 11:58:01,312 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 9216 to 9216. [2025-02-05 11:58:01,319 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 9216 states, 9215 states have (on average 1.0312533912099837) internal successors, (9503), 9215 states have internal predecessors, (9503), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-02-05 11:58:01,329 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 9216 states to 9216 states and 9503 transitions. [2025-02-05 11:58:01,329 INFO L78 Accepts]: Start accepts. Automaton has 9216 states and 9503 transitions. Word has length 1369 [2025-02-05 11:58:01,330 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-02-05 11:58:01,330 INFO L471 AbstractCegarLoop]: Abstraction has 9216 states and 9503 transitions. [2025-02-05 11:58:01,330 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 103.66666666666667) internal successors, (311), 3 states have internal predecessors, (311), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-02-05 11:58:01,330 INFO L276 IsEmpty]: Start isEmpty. Operand 9216 states and 9503 transitions. [2025-02-05 11:58:01,349 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 1641 [2025-02-05 11:58:01,350 INFO L210 NwaCegarLoop]: Found error trace [2025-02-05 11:58:01,350 INFO L218 NwaCegarLoop]: trace histogram [9, 9, 9, 9, 9, 9, 9, 9, 9, 9, 9, 9, 9, 9, 9, 9, 9, 9, 9, 9, 9, 9, 9, 9, 9, 9, 9, 9, 9, 9, 9, 9, 9, 9, 9, 9, 9, 9, 9, 9, 9, 9, 9, 9, 9, 9, 9, 9, 9, 9, 9, 9, 9, 9, 8, 8, 8, 8, 8, 8, 8, 8, 8, 8, 8, 8, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 6, 6, 6, 6, 6, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 3, 3, 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] [2025-02-05 11:58:01,350 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable12 [2025-02-05 11:58:01,351 INFO L396 AbstractCegarLoop]: === Iteration 14 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-02-05 11:58:01,351 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-02-05 11:58:01,351 INFO L85 PathProgramCache]: Analyzing trace with hash -1441763384, now seen corresponding path program 1 times [2025-02-05 11:58:01,352 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-02-05 11:58:01,352 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1105652943] [2025-02-05 11:58:01,352 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-02-05 11:58:01,352 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-02-05 11:58:01,428 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 1640 statements into 1 equivalence classes. [2025-02-05 11:58:01,458 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 1640 of 1640 statements. [2025-02-05 11:58:01,458 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-02-05 11:58:01,458 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-02-05 11:58:02,907 INFO L134 CoverageAnalysis]: Checked inductivity of 4883 backedges. 3362 proven. 0 refuted. 0 times theorem prover too weak. 1521 trivial. 0 not checked. [2025-02-05 11:58:02,908 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-02-05 11:58:02,908 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1105652943] [2025-02-05 11:58:02,908 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1105652943] provided 1 perfect and 0 imperfect interpolant sequences [2025-02-05 11:58:02,908 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-02-05 11:58:02,908 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2025-02-05 11:58:02,908 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1150151486] [2025-02-05 11:58:02,908 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-02-05 11:58:02,909 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2025-02-05 11:58:02,909 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-02-05 11:58:02,910 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2025-02-05 11:58:02,910 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2025-02-05 11:58:02,910 INFO L87 Difference]: Start difference. First operand 9216 states and 9503 transitions. Second operand has 4 states, 4 states have (on average 193.25) internal successors, (773), 4 states have internal predecessors, (773), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-02-05 11:58:03,763 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-02-05 11:58:03,764 INFO L93 Difference]: Finished difference Result 18109 states and 18681 transitions. [2025-02-05 11:58:03,764 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2025-02-05 11:58:03,764 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 4 states have (on average 193.25) internal successors, (773), 4 states have internal predecessors, (773), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 1640 [2025-02-05 11:58:03,765 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-02-05 11:58:03,774 INFO L225 Difference]: With dead ends: 18109 [2025-02-05 11:58:03,774 INFO L226 Difference]: Without dead ends: 9224 [2025-02-05 11:58:03,780 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-02-05 11:58:03,781 INFO L435 NwaCegarLoop]: 431 mSDtfsCounter, 218 mSDsluCounter, 13 mSDsCounter, 0 mSdLazyCounter, 1331 mSolverCounterSat, 25 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.7s Time, 0 mProtectedPredicate, 0 mProtectedAction, 218 SdHoareTripleChecker+Valid, 444 SdHoareTripleChecker+Invalid, 1356 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 25 IncrementalHoareTripleChecker+Valid, 1331 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.8s IncrementalHoareTripleChecker+Time [2025-02-05 11:58:03,781 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [218 Valid, 444 Invalid, 1356 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [25 Valid, 1331 Invalid, 0 Unknown, 0 Unchecked, 0.8s Time] [2025-02-05 11:58:03,786 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 9224 states. [2025-02-05 11:58:03,825 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 9224 to 9216. [2025-02-05 11:58:03,832 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 9216 states, 9215 states have (on average 1.0310363537710254) internal successors, (9501), 9215 states have internal predecessors, (9501), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-02-05 11:58:03,840 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 9216 states to 9216 states and 9501 transitions. [2025-02-05 11:58:03,841 INFO L78 Accepts]: Start accepts. Automaton has 9216 states and 9501 transitions. Word has length 1640 [2025-02-05 11:58:03,841 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-02-05 11:58:03,841 INFO L471 AbstractCegarLoop]: Abstraction has 9216 states and 9501 transitions. [2025-02-05 11:58:03,841 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 193.25) internal successors, (773), 4 states have internal predecessors, (773), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-02-05 11:58:03,841 INFO L276 IsEmpty]: Start isEmpty. Operand 9216 states and 9501 transitions. [2025-02-05 11:58:03,859 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 1724 [2025-02-05 11:58:03,859 INFO L210 NwaCegarLoop]: Found error trace [2025-02-05 11:58:03,859 INFO L218 NwaCegarLoop]: trace histogram [10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 9, 9, 9, 9, 9, 9, 9, 9, 9, 9, 9, 8, 8, 8, 8, 8, 8, 8, 8, 8, 8, 8, 8, 8, 8, 8, 8, 8, 8, 8, 8, 8, 8, 8, 8, 8, 8, 8, 8, 8, 8, 8, 8, 8, 8, 8, 8, 8, 8, 8, 8, 7, 7, 7, 7, 7, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 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] [2025-02-05 11:58:03,859 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable13 [2025-02-05 11:58:03,860 INFO L396 AbstractCegarLoop]: === Iteration 15 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-02-05 11:58:03,860 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-02-05 11:58:03,860 INFO L85 PathProgramCache]: Analyzing trace with hash -2143855361, now seen corresponding path program 1 times [2025-02-05 11:58:03,860 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-02-05 11:58:03,860 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [879822998] [2025-02-05 11:58:03,861 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-02-05 11:58:03,861 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-02-05 11:58:03,938 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 1723 statements into 1 equivalence classes. [2025-02-05 11:58:04,017 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 1723 of 1723 statements. [2025-02-05 11:58:04,017 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-02-05 11:58:04,017 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-02-05 11:58:05,217 INFO L134 CoverageAnalysis]: Checked inductivity of 5386 backedges. 503 proven. 0 refuted. 0 times theorem prover too weak. 4883 trivial. 0 not checked. [2025-02-05 11:58:05,217 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-02-05 11:58:05,217 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [879822998] [2025-02-05 11:58:05,217 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [879822998] provided 1 perfect and 0 imperfect interpolant sequences [2025-02-05 11:58:05,217 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-02-05 11:58:05,218 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2025-02-05 11:58:05,219 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1436562137] [2025-02-05 11:58:05,219 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-02-05 11:58:05,219 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2025-02-05 11:58:05,220 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-02-05 11:58:05,220 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2025-02-05 11:58:05,220 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=15, Invalid=15, Unknown=0, NotChecked=0, Total=30 [2025-02-05 11:58:05,221 INFO L87 Difference]: Start difference. First operand 9216 states and 9501 transitions. Second operand has 6 states, 6 states have (on average 65.83333333333333) internal successors, (395), 6 states have internal predecessors, (395), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-02-05 11:58:05,701 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-02-05 11:58:05,701 INFO L93 Difference]: Finished difference Result 17820 states and 18373 transitions. [2025-02-05 11:58:05,701 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2025-02-05 11:58:05,701 INFO L78 Accepts]: Start accepts. Automaton has has 6 states, 6 states have (on average 65.83333333333333) internal successors, (395), 6 states have internal predecessors, (395), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 1723 [2025-02-05 11:58:05,703 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-02-05 11:58:05,713 INFO L225 Difference]: With dead ends: 17820 [2025-02-05 11:58:05,713 INFO L226 Difference]: Without dead ends: 8887 [2025-02-05 11:58:05,721 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 6 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 4 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=15, Invalid=15, Unknown=0, NotChecked=0, Total=30 [2025-02-05 11:58:05,722 INFO L435 NwaCegarLoop]: 436 mSDtfsCounter, 8 mSDsluCounter, 15 mSDsCounter, 0 mSdLazyCounter, 507 mSolverCounterSat, 2 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.4s Time, 0 mProtectedPredicate, 0 mProtectedAction, 8 SdHoareTripleChecker+Valid, 451 SdHoareTripleChecker+Invalid, 509 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 2 IncrementalHoareTripleChecker+Valid, 507 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.4s IncrementalHoareTripleChecker+Time [2025-02-05 11:58:05,722 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [8 Valid, 451 Invalid, 509 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [2 Valid, 507 Invalid, 0 Unknown, 0 Unchecked, 0.4s Time] [2025-02-05 11:58:05,727 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 8887 states. [2025-02-05 11:58:05,790 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 8887 to 8887. [2025-02-05 11:58:05,797 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 8887 states, 8886 states have (on average 1.0302723385100157) internal successors, (9155), 8886 states have internal predecessors, (9155), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-02-05 11:58:05,804 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 8887 states to 8887 states and 9155 transitions. [2025-02-05 11:58:05,804 INFO L78 Accepts]: Start accepts. Automaton has 8887 states and 9155 transitions. Word has length 1723 [2025-02-05 11:58:05,805 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-02-05 11:58:05,805 INFO L471 AbstractCegarLoop]: Abstraction has 8887 states and 9155 transitions. [2025-02-05 11:58:05,805 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 6 states have (on average 65.83333333333333) internal successors, (395), 6 states have internal predecessors, (395), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-02-05 11:58:05,806 INFO L276 IsEmpty]: Start isEmpty. Operand 8887 states and 9155 transitions. [2025-02-05 11:58:05,825 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 1790 [2025-02-05 11:58:05,825 INFO L210 NwaCegarLoop]: Found error trace [2025-02-05 11:58:05,826 INFO L218 NwaCegarLoop]: trace histogram [11, 11, 11, 11, 11, 11, 11, 11, 11, 11, 11, 11, 11, 11, 11, 11, 11, 11, 11, 11, 11, 11, 11, 11, 11, 11, 11, 11, 11, 11, 11, 11, 11, 11, 11, 11, 11, 11, 11, 11, 11, 11, 11, 11, 11, 11, 11, 11, 11, 11, 11, 11, 11, 11, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 9, 9, 9, 9, 9, 9, 9, 9, 9, 9, 9, 9, 9, 9, 9, 9, 9, 9, 9, 9, 9, 9, 9, 9, 9, 9, 9, 9, 9, 9, 9, 9, 9, 9, 9, 9, 9, 9, 9, 9, 8, 8, 8, 8, 8, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 6, 6, 6, 6, 6, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-02-05 11:58:05,826 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable14 [2025-02-05 11:58:05,826 INFO L396 AbstractCegarLoop]: === Iteration 16 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-02-05 11:58:05,827 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-02-05 11:58:05,827 INFO L85 PathProgramCache]: Analyzing trace with hash -1117552482, now seen corresponding path program 1 times [2025-02-05 11:58:05,827 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-02-05 11:58:05,827 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1085853748] [2025-02-05 11:58:05,828 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-02-05 11:58:05,828 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-02-05 11:58:05,910 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 1789 statements into 1 equivalence classes. [2025-02-05 11:58:05,961 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 1789 of 1789 statements. [2025-02-05 11:58:05,961 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-02-05 11:58:05,961 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-02-05 11:58:08,463 INFO L134 CoverageAnalysis]: Checked inductivity of 6610 backedges. 5141 proven. 110 refuted. 0 times theorem prover too weak. 1359 trivial. 0 not checked. [2025-02-05 11:58:08,463 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-02-05 11:58:08,466 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1085853748] [2025-02-05 11:58:08,466 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1085853748] provided 0 perfect and 1 imperfect interpolant sequences [2025-02-05 11:58:08,466 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [367599426] [2025-02-05 11:58:08,467 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-02-05 11:58:08,467 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-02-05 11:58:08,467 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 [2025-02-05 11:58:08,469 INFO L229 MonitoredProcess]: Starting monitored process 3 with /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2025-02-05 11:58:08,471 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (3)] Waiting until timeout for monitored process [2025-02-05 11:58:08,588 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 1789 statements into 1 equivalence classes. [2025-02-05 11:58:08,852 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 1789 of 1789 statements. [2025-02-05 11:58:08,852 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-02-05 11:58:08,852 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-02-05 11:58:08,858 INFO L256 TraceCheckSpWp]: Trace formula consists of 2068 conjuncts, 7 conjuncts are in the unsatisfiable core [2025-02-05 11:58:08,877 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-02-05 11:58:11,055 INFO L134 CoverageAnalysis]: Checked inductivity of 6610 backedges. 2581 proven. 201 refuted. 0 times theorem prover too weak. 3828 trivial. 0 not checked. [2025-02-05 11:58:11,055 INFO L312 TraceCheckSpWp]: Computing backward predicates... [2025-02-05 11:58:14,901 INFO L134 CoverageAnalysis]: Checked inductivity of 6610 backedges. 2581 proven. 201 refuted. 0 times theorem prover too weak. 3828 trivial. 0 not checked. [2025-02-05 11:58:14,902 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [367599426] provided 0 perfect and 2 imperfect interpolant sequences [2025-02-05 11:58:14,902 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2025-02-05 11:58:14,902 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [6, 3, 3] total 10 [2025-02-05 11:58:14,903 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [914989738] [2025-02-05 11:58:14,903 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2025-02-05 11:58:14,905 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 10 states [2025-02-05 11:58:14,905 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-02-05 11:58:14,906 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 10 interpolants. [2025-02-05 11:58:14,906 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=27, Invalid=63, Unknown=0, NotChecked=0, Total=90 [2025-02-05 11:58:14,906 INFO L87 Difference]: Start difference. First operand 8887 states and 9155 transitions. Second operand has 10 states, 10 states have (on average 181.8) internal successors, (1818), 10 states have internal predecessors, (1818), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-02-05 11:58:18,101 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-02-05 11:58:18,101 INFO L93 Difference]: Finished difference Result 18109 states and 18662 transitions. [2025-02-05 11:58:18,101 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 11 states. [2025-02-05 11:58:18,102 INFO L78 Accepts]: Start accepts. Automaton has has 10 states, 10 states have (on average 181.8) internal successors, (1818), 10 states have internal predecessors, (1818), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 1789 [2025-02-05 11:58:18,102 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-02-05 11:58:18,111 INFO L225 Difference]: With dead ends: 18109 [2025-02-05 11:58:18,114 INFO L226 Difference]: Without dead ends: 9553 [2025-02-05 11:58:18,118 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 3596 GetRequests, 3582 SyntacticMatches, 0 SemanticMatches, 14 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 19 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=72, Invalid=168, Unknown=0, NotChecked=0, Total=240 [2025-02-05 11:58:18,120 INFO L435 NwaCegarLoop]: 19 mSDtfsCounter, 1143 mSDsluCounter, 84 mSDsCounter, 0 mSdLazyCounter, 6665 mSolverCounterSat, 158 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 2.5s Time, 0 mProtectedPredicate, 0 mProtectedAction, 1143 SdHoareTripleChecker+Valid, 103 SdHoareTripleChecker+Invalid, 6823 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 158 IncrementalHoareTripleChecker+Valid, 6665 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 3.0s IncrementalHoareTripleChecker+Time [2025-02-05 11:58:18,120 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [1143 Valid, 103 Invalid, 6823 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [158 Valid, 6665 Invalid, 0 Unknown, 0 Unchecked, 3.0s Time] [2025-02-05 11:58:18,124 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 9553 states. [2025-02-05 11:58:18,163 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 9553 to 9216. [2025-02-05 11:58:18,168 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 9216 states, 9215 states have (on average 1.028540423223006) internal successors, (9478), 9215 states have internal predecessors, (9478), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-02-05 11:58:18,176 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 9216 states to 9216 states and 9478 transitions. [2025-02-05 11:58:18,177 INFO L78 Accepts]: Start accepts. Automaton has 9216 states and 9478 transitions. Word has length 1789 [2025-02-05 11:58:18,177 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-02-05 11:58:18,177 INFO L471 AbstractCegarLoop]: Abstraction has 9216 states and 9478 transitions. [2025-02-05 11:58:18,178 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 10 states, 10 states have (on average 181.8) internal successors, (1818), 10 states have internal predecessors, (1818), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-02-05 11:58:18,178 INFO L276 IsEmpty]: Start isEmpty. Operand 9216 states and 9478 transitions. [2025-02-05 11:58:18,258 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 1841 [2025-02-05 11:58:18,259 INFO L210 NwaCegarLoop]: Found error trace [2025-02-05 11:58:18,259 INFO L218 NwaCegarLoop]: trace histogram [12, 12, 12, 12, 12, 12, 12, 12, 12, 12, 12, 12, 12, 12, 12, 12, 12, 12, 12, 12, 12, 12, 12, 12, 12, 12, 12, 12, 12, 12, 12, 12, 12, 12, 12, 12, 12, 12, 12, 12, 12, 12, 12, 12, 12, 12, 12, 12, 12, 12, 12, 12, 12, 12, 11, 11, 11, 11, 11, 11, 11, 11, 11, 11, 11, 10, 9, 9, 9, 9, 9, 9, 9, 9, 9, 9, 9, 9, 9, 9, 9, 9, 9, 9, 9, 9, 9, 9, 9, 9, 9, 9, 9, 9, 9, 9, 9, 9, 9, 9, 9, 9, 9, 9, 9, 9, 9, 9, 9, 9, 8, 8, 8, 8, 8, 8, 8, 8, 8, 8, 8, 8, 8, 8, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 6, 6, 5, 5, 5, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 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] [2025-02-05 11:58:18,268 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (3)] Ended with exit code 0 [2025-02-05 11:58:18,460 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 3 /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable15 [2025-02-05 11:58:18,460 INFO L396 AbstractCegarLoop]: === Iteration 17 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-02-05 11:58:18,461 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-02-05 11:58:18,462 INFO L85 PathProgramCache]: Analyzing trace with hash -343361388, now seen corresponding path program 1 times [2025-02-05 11:58:18,462 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-02-05 11:58:18,462 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1705467931] [2025-02-05 11:58:18,462 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-02-05 11:58:18,462 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-02-05 11:58:18,576 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 1840 statements into 1 equivalence classes. [2025-02-05 11:58:18,594 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 1840 of 1840 statements. [2025-02-05 11:58:18,594 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-02-05 11:58:18,595 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-02-05 11:58:20,261 INFO L134 CoverageAnalysis]: Checked inductivity of 7273 backedges. 2756 proven. 0 refuted. 0 times theorem prover too weak. 4517 trivial. 0 not checked. [2025-02-05 11:58:20,262 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-02-05 11:58:20,262 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1705467931] [2025-02-05 11:58:20,262 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1705467931] provided 1 perfect and 0 imperfect interpolant sequences [2025-02-05 11:58:20,262 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-02-05 11:58:20,262 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2025-02-05 11:58:20,262 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [806139509] [2025-02-05 11:58:20,262 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-02-05 11:58:20,267 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2025-02-05 11:58:20,267 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-02-05 11:58:20,267 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2025-02-05 11:58:20,267 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=6, Invalid=6, Unknown=0, NotChecked=0, Total=12 [2025-02-05 11:58:20,268 INFO L87 Difference]: Start difference. First operand 9216 states and 9478 transitions. Second operand has 4 states, 4 states have (on average 168.25) internal successors, (673), 3 states have internal predecessors, (673), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-02-05 11:58:20,921 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-02-05 11:58:20,921 INFO L93 Difference]: Finished difference Result 18430 states and 18957 transitions. [2025-02-05 11:58:20,921 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2025-02-05 11:58:20,921 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 4 states have (on average 168.25) internal successors, (673), 3 states have internal predecessors, (673), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 1840 [2025-02-05 11:58:20,922 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-02-05 11:58:20,928 INFO L225 Difference]: With dead ends: 18430 [2025-02-05 11:58:20,929 INFO L226 Difference]: Without dead ends: 9545 [2025-02-05 11:58:20,933 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 3 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 2 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=6, Invalid=6, Unknown=0, NotChecked=0, Total=12 [2025-02-05 11:58:20,934 INFO L435 NwaCegarLoop]: 99 mSDtfsCounter, 268 mSDsluCounter, 5 mSDsCounter, 0 mSdLazyCounter, 750 mSolverCounterSat, 3 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.5s Time, 0 mProtectedPredicate, 0 mProtectedAction, 268 SdHoareTripleChecker+Valid, 104 SdHoareTripleChecker+Invalid, 753 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 3 IncrementalHoareTripleChecker+Valid, 750 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.6s IncrementalHoareTripleChecker+Time [2025-02-05 11:58:20,934 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [268 Valid, 104 Invalid, 753 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [3 Valid, 750 Invalid, 0 Unknown, 0 Unchecked, 0.6s Time] [2025-02-05 11:58:20,938 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 9545 states. [2025-02-05 11:58:20,978 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 9545 to 9545. [2025-02-05 11:58:20,983 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 9545 states, 9544 states have (on average 1.0277661357921206) internal successors, (9809), 9544 states have internal predecessors, (9809), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-02-05 11:58:20,991 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 9545 states to 9545 states and 9809 transitions. [2025-02-05 11:58:20,991 INFO L78 Accepts]: Start accepts. Automaton has 9545 states and 9809 transitions. Word has length 1840 [2025-02-05 11:58:20,991 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-02-05 11:58:20,992 INFO L471 AbstractCegarLoop]: Abstraction has 9545 states and 9809 transitions. [2025-02-05 11:58:20,992 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 168.25) internal successors, (673), 3 states have internal predecessors, (673), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-02-05 11:58:20,992 INFO L276 IsEmpty]: Start isEmpty. Operand 9545 states and 9809 transitions. [2025-02-05 11:58:21,010 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 1904 [2025-02-05 11:58:21,010 INFO L210 NwaCegarLoop]: Found error trace [2025-02-05 11:58:21,011 INFO L218 NwaCegarLoop]: trace histogram [12, 12, 12, 12, 12, 12, 12, 12, 12, 12, 12, 12, 12, 12, 12, 12, 12, 12, 12, 12, 12, 12, 12, 12, 12, 12, 12, 12, 12, 12, 12, 12, 12, 12, 12, 12, 12, 12, 12, 12, 12, 12, 12, 12, 12, 12, 12, 12, 12, 12, 12, 12, 12, 12, 11, 11, 11, 11, 11, 11, 11, 11, 11, 11, 11, 10, 9, 9, 9, 9, 9, 9, 9, 9, 9, 9, 9, 9, 9, 9, 9, 9, 9, 9, 9, 9, 9, 9, 9, 9, 9, 9, 9, 9, 9, 9, 9, 9, 9, 9, 9, 9, 9, 9, 9, 9, 9, 9, 9, 9, 8, 8, 8, 8, 8, 8, 8, 8, 8, 8, 8, 8, 8, 8, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 6, 6, 6, 6, 6, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 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] [2025-02-05 11:58:21,011 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable16 [2025-02-05 11:58:21,011 INFO L396 AbstractCegarLoop]: === Iteration 18 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-02-05 11:58:21,012 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-02-05 11:58:21,012 INFO L85 PathProgramCache]: Analyzing trace with hash -1619316634, now seen corresponding path program 1 times [2025-02-05 11:58:21,012 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-02-05 11:58:21,012 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1115153097] [2025-02-05 11:58:21,013 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-02-05 11:58:21,013 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-02-05 11:58:21,143 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 1903 statements into 1 equivalence classes. [2025-02-05 11:58:21,196 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 1903 of 1903 statements. [2025-02-05 11:58:21,197 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-02-05 11:58:21,197 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-02-05 11:58:24,662 INFO L134 CoverageAnalysis]: Checked inductivity of 7491 backedges. 3605 proven. 186 refuted. 0 times theorem prover too weak. 3700 trivial. 0 not checked. [2025-02-05 11:58:24,663 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-02-05 11:58:24,663 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1115153097] [2025-02-05 11:58:24,663 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1115153097] provided 0 perfect and 1 imperfect interpolant sequences [2025-02-05 11:58:24,663 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1566465564] [2025-02-05 11:58:24,663 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-02-05 11:58:24,663 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-02-05 11:58:24,663 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 [2025-02-05 11:58:24,665 INFO L229 MonitoredProcess]: Starting monitored process 4 with /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2025-02-05 11:58:24,666 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (4)] Waiting until timeout for monitored process [2025-02-05 11:58:24,805 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 1903 statements into 1 equivalence classes. [2025-02-05 11:58:25,028 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 1903 of 1903 statements. [2025-02-05 11:58:25,028 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-02-05 11:58:25,028 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-02-05 11:58:25,034 INFO L256 TraceCheckSpWp]: Trace formula consists of 2200 conjuncts, 3 conjuncts are in the unsatisfiable core [2025-02-05 11:58:25,050 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-02-05 11:58:25,152 INFO L134 CoverageAnalysis]: Checked inductivity of 7491 backedges. 4429 proven. 0 refuted. 0 times theorem prover too weak. 3062 trivial. 0 not checked. [2025-02-05 11:58:25,153 INFO L308 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2025-02-05 11:58:25,153 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1566465564] provided 1 perfect and 0 imperfect interpolant sequences [2025-02-05 11:58:25,153 INFO L185 FreeRefinementEngine]: Found 1 perfect and 1 imperfect interpolant sequences. [2025-02-05 11:58:25,153 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [5] total 7 [2025-02-05 11:58:25,153 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1391901641] [2025-02-05 11:58:25,153 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-02-05 11:58:25,154 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2025-02-05 11:58:25,154 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-02-05 11:58:25,155 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2025-02-05 11:58:25,155 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=12, Invalid=30, Unknown=0, NotChecked=0, Total=42 [2025-02-05 11:58:25,155 INFO L87 Difference]: Start difference. First operand 9545 states and 9809 transitions. Second operand has 3 states, 3 states have (on average 209.0) internal successors, (627), 3 states have internal predecessors, (627), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-02-05 11:58:25,758 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-02-05 11:58:25,758 INFO L93 Difference]: Finished difference Result 22378 states and 23036 transitions. [2025-02-05 11:58:25,759 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2025-02-05 11:58:25,759 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 209.0) internal successors, (627), 3 states have internal predecessors, (627), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 1903 [2025-02-05 11:58:25,759 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-02-05 11:58:25,770 INFO L225 Difference]: With dead ends: 22378 [2025-02-05 11:58:25,770 INFO L226 Difference]: Without dead ends: 13493 [2025-02-05 11:58:25,777 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 1912 GetRequests, 1907 SyntacticMatches, 0 SemanticMatches, 5 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 3 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=12, Invalid=30, Unknown=0, NotChecked=0, Total=42 [2025-02-05 11:58:25,777 INFO L435 NwaCegarLoop]: 427 mSDtfsCounter, 221 mSDsluCounter, 6 mSDsCounter, 0 mSdLazyCounter, 805 mSolverCounterSat, 53 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.5s Time, 0 mProtectedPredicate, 0 mProtectedAction, 221 SdHoareTripleChecker+Valid, 433 SdHoareTripleChecker+Invalid, 858 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 53 IncrementalHoareTripleChecker+Valid, 805 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.6s IncrementalHoareTripleChecker+Time [2025-02-05 11:58:25,777 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [221 Valid, 433 Invalid, 858 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [53 Valid, 805 Invalid, 0 Unknown, 0 Unchecked, 0.6s Time] [2025-02-05 11:58:25,784 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 13493 states. [2025-02-05 11:58:25,845 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 13493 to 13164. [2025-02-05 11:58:25,853 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 13164 states, 13163 states have (on average 1.0253741548279267) internal successors, (13497), 13163 states have internal predecessors, (13497), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-02-05 11:58:25,863 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 13164 states to 13164 states and 13497 transitions. [2025-02-05 11:58:25,864 INFO L78 Accepts]: Start accepts. Automaton has 13164 states and 13497 transitions. Word has length 1903 [2025-02-05 11:58:25,865 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-02-05 11:58:25,865 INFO L471 AbstractCegarLoop]: Abstraction has 13164 states and 13497 transitions. [2025-02-05 11:58:25,865 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 209.0) internal successors, (627), 3 states have internal predecessors, (627), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-02-05 11:58:25,865 INFO L276 IsEmpty]: Start isEmpty. Operand 13164 states and 13497 transitions. [2025-02-05 11:58:25,885 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 1997 [2025-02-05 11:58:25,886 INFO L210 NwaCegarLoop]: Found error trace [2025-02-05 11:58:25,886 INFO L218 NwaCegarLoop]: trace histogram [12, 12, 12, 12, 12, 12, 12, 12, 12, 12, 12, 12, 12, 12, 12, 12, 12, 12, 12, 12, 12, 12, 12, 12, 12, 12, 12, 12, 12, 12, 12, 12, 12, 12, 12, 12, 12, 12, 12, 12, 12, 12, 12, 12, 12, 12, 12, 12, 12, 12, 12, 12, 12, 12, 11, 11, 11, 11, 11, 11, 11, 11, 11, 11, 11, 11, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 9, 9, 9, 9, 9, 9, 9, 9, 9, 9, 9, 9, 9, 9, 9, 9, 9, 9, 9, 9, 9, 9, 9, 9, 9, 9, 9, 9, 9, 9, 9, 9, 9, 9, 9, 9, 9, 9, 9, 9, 9, 9, 9, 9, 9, 9, 8, 8, 8, 8, 8, 8, 8, 8, 8, 8, 8, 8, 8, 8, 8, 8, 8, 8, 8, 8, 8, 8, 8, 8, 8, 8, 8, 8, 8, 8, 8, 7, 7, 7, 7, 7, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 5, 5, 5, 5, 5, 5, 5, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 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] [2025-02-05 11:58:25,894 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (4)] Forceful destruction successful, exit code 0 [2025-02-05 11:58:26,087 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable17,4 /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-02-05 11:58:26,087 INFO L396 AbstractCegarLoop]: === Iteration 19 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-02-05 11:58:26,088 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-02-05 11:58:26,088 INFO L85 PathProgramCache]: Analyzing trace with hash -892344311, now seen corresponding path program 1 times [2025-02-05 11:58:26,088 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-02-05 11:58:26,088 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1954730411] [2025-02-05 11:58:26,088 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-02-05 11:58:26,088 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-02-05 11:58:26,173 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 1996 statements into 1 equivalence classes. [2025-02-05 11:58:26,229 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 1996 of 1996 statements. [2025-02-05 11:58:26,230 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-02-05 11:58:26,230 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-02-05 11:58:28,123 INFO L134 CoverageAnalysis]: Checked inductivity of 8111 backedges. 3892 proven. 0 refuted. 0 times theorem prover too weak. 4219 trivial. 0 not checked. [2025-02-05 11:58:28,123 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-02-05 11:58:28,123 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1954730411] [2025-02-05 11:58:28,123 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1954730411] provided 1 perfect and 0 imperfect interpolant sequences [2025-02-05 11:58:28,123 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-02-05 11:58:28,124 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2025-02-05 11:58:28,124 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1890262478] [2025-02-05 11:58:28,124 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-02-05 11:58:28,125 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2025-02-05 11:58:28,125 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-02-05 11:58:28,125 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2025-02-05 11:58:28,125 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-02-05 11:58:28,126 INFO L87 Difference]: Start difference. First operand 13164 states and 13497 transitions. Second operand has 3 states, 3 states have (on average 213.66666666666666) internal successors, (641), 3 states have internal predecessors, (641), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-02-05 11:58:28,744 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-02-05 11:58:28,744 INFO L93 Difference]: Finished difference Result 28958 states and 29687 transitions. [2025-02-05 11:58:28,744 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2025-02-05 11:58:28,744 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 213.66666666666666) internal successors, (641), 3 states have internal predecessors, (641), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 1996 [2025-02-05 11:58:28,745 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-02-05 11:58:28,758 INFO L225 Difference]: With dead ends: 28958 [2025-02-05 11:58:28,759 INFO L226 Difference]: Without dead ends: 16454 [2025-02-05 11:58:28,778 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 3 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-02-05 11:58:28,778 INFO L435 NwaCegarLoop]: 46 mSDtfsCounter, 207 mSDsluCounter, 5 mSDsCounter, 0 mSdLazyCounter, 773 mSolverCounterSat, 93 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.5s Time, 0 mProtectedPredicate, 0 mProtectedAction, 207 SdHoareTripleChecker+Valid, 51 SdHoareTripleChecker+Invalid, 866 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 93 IncrementalHoareTripleChecker+Valid, 773 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.6s IncrementalHoareTripleChecker+Time [2025-02-05 11:58:28,783 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [207 Valid, 51 Invalid, 866 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [93 Valid, 773 Invalid, 0 Unknown, 0 Unchecked, 0.6s Time] [2025-02-05 11:58:28,793 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 16454 states. [2025-02-05 11:58:28,875 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 16454 to 14151. [2025-02-05 11:58:28,884 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 14151 states, 14150 states have (on average 1.0250883392226149) internal successors, (14505), 14150 states have internal predecessors, (14505), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-02-05 11:58:28,896 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 14151 states to 14151 states and 14505 transitions. [2025-02-05 11:58:28,896 INFO L78 Accepts]: Start accepts. Automaton has 14151 states and 14505 transitions. Word has length 1996 [2025-02-05 11:58:28,897 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-02-05 11:58:28,897 INFO L471 AbstractCegarLoop]: Abstraction has 14151 states and 14505 transitions. [2025-02-05 11:58:28,897 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 213.66666666666666) internal successors, (641), 3 states have internal predecessors, (641), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-02-05 11:58:28,897 INFO L276 IsEmpty]: Start isEmpty. Operand 14151 states and 14505 transitions. [2025-02-05 11:58:28,918 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 2022 [2025-02-05 11:58:28,919 INFO L210 NwaCegarLoop]: Found error trace [2025-02-05 11:58:28,921 INFO L218 NwaCegarLoop]: trace histogram [12, 12, 12, 12, 12, 12, 12, 12, 12, 12, 12, 12, 12, 12, 12, 12, 12, 12, 12, 12, 12, 12, 12, 12, 12, 12, 12, 12, 12, 12, 12, 12, 12, 12, 12, 12, 12, 12, 12, 12, 12, 12, 12, 12, 12, 12, 12, 12, 12, 12, 12, 12, 12, 12, 11, 11, 11, 11, 11, 11, 11, 11, 11, 11, 11, 11, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 9, 9, 9, 9, 9, 9, 9, 9, 9, 9, 9, 9, 9, 9, 9, 9, 9, 8, 8, 8, 8, 8, 8, 8, 8, 8, 8, 8, 8, 8, 8, 8, 8, 8, 8, 8, 8, 8, 8, 8, 8, 8, 8, 8, 8, 7, 7, 7, 7, 7, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 5, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 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] [2025-02-05 11:58:28,921 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable18 [2025-02-05 11:58:28,921 INFO L396 AbstractCegarLoop]: === Iteration 20 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-02-05 11:58:28,923 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-02-05 11:58:28,924 INFO L85 PathProgramCache]: Analyzing trace with hash -1039149323, now seen corresponding path program 1 times [2025-02-05 11:58:28,924 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-02-05 11:58:28,925 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [887591945] [2025-02-05 11:58:28,925 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-02-05 11:58:28,925 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-02-05 11:58:29,029 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 2021 statements into 1 equivalence classes. [2025-02-05 11:58:29,113 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 2021 of 2021 statements. [2025-02-05 11:58:29,113 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-02-05 11:58:29,113 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-02-05 11:58:31,233 INFO L134 CoverageAnalysis]: Checked inductivity of 8384 backedges. 5986 proven. 91 refuted. 0 times theorem prover too weak. 2307 trivial. 0 not checked. [2025-02-05 11:58:31,236 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-02-05 11:58:31,236 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [887591945] [2025-02-05 11:58:31,237 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [887591945] provided 0 perfect and 1 imperfect interpolant sequences [2025-02-05 11:58:31,237 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1319541528] [2025-02-05 11:58:31,237 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-02-05 11:58:31,237 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-02-05 11:58:31,237 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 [2025-02-05 11:58:31,242 INFO L229 MonitoredProcess]: Starting monitored process 5 with /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2025-02-05 11:58:31,246 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (5)] Waiting until timeout for monitored process [2025-02-05 11:58:31,360 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 2021 statements into 1 equivalence classes. [2025-02-05 11:58:31,597 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 2021 of 2021 statements. [2025-02-05 11:58:31,597 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-02-05 11:58:31,597 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-02-05 11:58:31,603 INFO L256 TraceCheckSpWp]: Trace formula consists of 2319 conjuncts, 3 conjuncts are in the unsatisfiable core [2025-02-05 11:58:31,615 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-02-05 11:58:32,381 INFO L134 CoverageAnalysis]: Checked inductivity of 8384 backedges. 615 proven. 0 refuted. 0 times theorem prover too weak. 7769 trivial. 0 not checked. [2025-02-05 11:58:32,381 INFO L308 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2025-02-05 11:58:32,381 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1319541528] provided 1 perfect and 0 imperfect interpolant sequences [2025-02-05 11:58:32,381 INFO L185 FreeRefinementEngine]: Found 1 perfect and 1 imperfect interpolant sequences. [2025-02-05 11:58:32,381 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [6] total 7 [2025-02-05 11:58:32,381 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2120197311] [2025-02-05 11:58:32,381 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-02-05 11:58:32,382 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2025-02-05 11:58:32,382 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-02-05 11:58:32,382 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2025-02-05 11:58:32,382 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=12, Invalid=30, Unknown=0, NotChecked=0, Total=42 [2025-02-05 11:58:32,383 INFO L87 Difference]: Start difference. First operand 14151 states and 14505 transitions. Second operand has 3 states, 3 states have (on average 112.66666666666667) internal successors, (338), 3 states have internal predecessors, (338), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-02-05 11:58:33,289 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-02-05 11:58:33,289 INFO L93 Difference]: Finished difference Result 28298 states and 29012 transitions. [2025-02-05 11:58:33,289 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2025-02-05 11:58:33,289 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 112.66666666666667) internal successors, (338), 3 states have internal predecessors, (338), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 2021 [2025-02-05 11:58:33,290 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-02-05 11:58:33,290 INFO L225 Difference]: With dead ends: 28298 [2025-02-05 11:58:33,291 INFO L226 Difference]: Without dead ends: 0 [2025-02-05 11:58:33,299 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 2026 GetRequests, 2021 SyntacticMatches, 0 SemanticMatches, 5 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 3 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=12, Invalid=30, Unknown=0, NotChecked=0, Total=42 [2025-02-05 11:58:33,299 INFO L435 NwaCegarLoop]: 430 mSDtfsCounter, 275 mSDsluCounter, 5 mSDsCounter, 0 mSdLazyCounter, 756 mSolverCounterSat, 4 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.7s Time, 0 mProtectedPredicate, 0 mProtectedAction, 275 SdHoareTripleChecker+Valid, 435 SdHoareTripleChecker+Invalid, 760 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 4 IncrementalHoareTripleChecker+Valid, 756 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.9s IncrementalHoareTripleChecker+Time [2025-02-05 11:58:33,300 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [275 Valid, 435 Invalid, 760 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [4 Valid, 756 Invalid, 0 Unknown, 0 Unchecked, 0.9s Time] [2025-02-05 11:58:33,300 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 0 states. [2025-02-05 11:58:33,300 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 0 to 0. [2025-02-05 11:58:33,300 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 0 states, 0 states have (on average 0.0) internal successors, (0), 0 states have internal predecessors, (0), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-02-05 11:58:33,300 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 0 states to 0 states and 0 transitions. [2025-02-05 11:58:33,300 INFO L78 Accepts]: Start accepts. Automaton has 0 states and 0 transitions. Word has length 2021 [2025-02-05 11:58:33,300 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-02-05 11:58:33,301 INFO L471 AbstractCegarLoop]: Abstraction has 0 states and 0 transitions. [2025-02-05 11:58:33,301 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 112.66666666666667) internal successors, (338), 3 states have internal predecessors, (338), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-02-05 11:58:33,301 INFO L276 IsEmpty]: Start isEmpty. Operand 0 states and 0 transitions. [2025-02-05 11:58:33,301 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2025-02-05 11:58:33,303 INFO L782 garLoopResultBuilder]: Registering result SAFE for location ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION (0 of 1 remaining) [2025-02-05 11:58:33,312 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (5)] Ended with exit code 0 [2025-02-05 11:58:33,503 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable19,5 /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-02-05 11:58:33,506 INFO L422 BasicCegarLoop]: Path program histogram: [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-02-05 11:58:33,507 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends 0 states and 0 transitions. [2025-02-05 11:58:34,089 INFO L170 ceAbstractionStarter]: Computing trace abstraction results [2025-02-05 11:58:34,104 WARN L970 BoogieBacktranslator]: Unfinished Backtranslation: Expression type not yet supported in backtranslation: QuantifierExpression [2025-02-05 11:58:34,112 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction CFG 05.02 11:58:34 BoogieIcfgContainer [2025-02-05 11:58:34,112 INFO L131 PluginConnector]: ------------------------ END TraceAbstraction---------------------------- [2025-02-05 11:58:34,113 INFO L112 PluginConnector]: ------------------------Witness Printer---------------------------- [2025-02-05 11:58:34,113 INFO L270 PluginConnector]: Initializing Witness Printer... [2025-02-05 11:58:34,113 INFO L274 PluginConnector]: Witness Printer initialized [2025-02-05 11:58:34,114 INFO L184 PluginConnector]: Executing the observer RCFGCatcher from plugin Witness Printer for "de.uni_freiburg.informatik.ultimate.plugins.generator.icfgbuilder CFG 05.02 11:57:41" (3/4) ... [2025-02-05 11:58:34,115 INFO L146 WitnessPrinter]: Generating witness for correct program [2025-02-05 11:58:34,141 INFO L919 BoogieBacktranslator]: Reduced CFG by removing 12 nodes and edges [2025-02-05 11:58:34,142 INFO L919 BoogieBacktranslator]: Reduced CFG by removing 4 nodes and edges [2025-02-05 11:58:34,144 INFO L919 BoogieBacktranslator]: Reduced CFG by removing 3 nodes and edges [2025-02-05 11:58:34,145 INFO L919 BoogieBacktranslator]: Reduced CFG by removing 1 nodes and edges [2025-02-05 11:58:34,287 INFO L149 WitnessManager]: Wrote witness to /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/witness.graphml [2025-02-05 11:58:34,288 INFO L149 WitnessManager]: Wrote witness to /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/witness.yml [2025-02-05 11:58:34,288 INFO L131 PluginConnector]: ------------------------ END Witness Printer---------------------------- [2025-02-05 11:58:34,289 INFO L158 Benchmark]: Toolchain (without parser) took 55956.95ms. Allocated memory was 142.6MB in the beginning and 1.7GB in the end (delta: 1.5GB). Free memory was 101.1MB in the beginning and 1.0GB in the end (delta: -899.8MB). Peak memory consumption was 614.3MB. Max. memory is 16.1GB. [2025-02-05 11:58:34,289 INFO L158 Benchmark]: CDTParser took 0.17ms. Allocated memory is still 201.3MB. Free memory is still 127.8MB. There was no memory consumed. Max. memory is 16.1GB. [2025-02-05 11:58:34,290 INFO L158 Benchmark]: CACSL2BoogieTranslator took 656.96ms. Allocated memory is still 142.6MB. Free memory was 101.1MB in the beginning and 43.3MB in the end (delta: 57.7MB). Peak memory consumption was 50.3MB. Max. memory is 16.1GB. [2025-02-05 11:58:34,290 INFO L158 Benchmark]: Boogie Procedure Inliner took 139.34ms. Allocated memory is still 142.6MB. Free memory was 43.3MB in the beginning and 83.6MB in the end (delta: -40.3MB). Peak memory consumption was 28.4MB. Max. memory is 16.1GB. [2025-02-05 11:58:34,291 INFO L158 Benchmark]: Boogie Preprocessor took 165.62ms. Allocated memory is still 142.6MB. Free memory was 83.6MB in the beginning and 50.9MB in the end (delta: 32.8MB). Peak memory consumption was 33.6MB. Max. memory is 16.1GB. [2025-02-05 11:58:34,291 INFO L158 Benchmark]: IcfgBuilder took 1755.49ms. Allocated memory was 142.6MB in the beginning and 318.8MB in the end (delta: 176.2MB). Free memory was 50.9MB in the beginning and 126.4MB in the end (delta: -75.5MB). Peak memory consumption was 109.1MB. Max. memory is 16.1GB. [2025-02-05 11:58:34,291 INFO L158 Benchmark]: TraceAbstraction took 53054.40ms. Allocated memory was 318.8MB in the beginning and 1.7GB in the end (delta: 1.3GB). Free memory was 125.5MB in the beginning and 1.0GB in the end (delta: -896.3MB). Peak memory consumption was 435.9MB. Max. memory is 16.1GB. [2025-02-05 11:58:34,291 INFO L158 Benchmark]: Witness Printer took 175.32ms. Allocated memory is still 1.7GB. Free memory was 1.0GB in the beginning and 1.0GB in the end (delta: 21.0MB). Peak memory consumption was 25.2MB. Max. memory is 16.1GB. [2025-02-05 11:58:34,293 INFO L338 ainManager$Toolchain]: ####################### End [Toolchain 1] ####################### --- Results --- * Results from de.uni_freiburg.informatik.ultimate.core: - StatisticsResult: Toolchain Benchmarks Benchmark results are: * CDTParser took 0.17ms. Allocated memory is still 201.3MB. Free memory is still 127.8MB. There was no memory consumed. Max. memory is 16.1GB. * CACSL2BoogieTranslator took 656.96ms. Allocated memory is still 142.6MB. Free memory was 101.1MB in the beginning and 43.3MB in the end (delta: 57.7MB). Peak memory consumption was 50.3MB. Max. memory is 16.1GB. * Boogie Procedure Inliner took 139.34ms. Allocated memory is still 142.6MB. Free memory was 43.3MB in the beginning and 83.6MB in the end (delta: -40.3MB). Peak memory consumption was 28.4MB. Max. memory is 16.1GB. * Boogie Preprocessor took 165.62ms. Allocated memory is still 142.6MB. Free memory was 83.6MB in the beginning and 50.9MB in the end (delta: 32.8MB). Peak memory consumption was 33.6MB. Max. memory is 16.1GB. * IcfgBuilder took 1755.49ms. Allocated memory was 142.6MB in the beginning and 318.8MB in the end (delta: 176.2MB). Free memory was 50.9MB in the beginning and 126.4MB in the end (delta: -75.5MB). Peak memory consumption was 109.1MB. Max. memory is 16.1GB. * TraceAbstraction took 53054.40ms. Allocated memory was 318.8MB in the beginning and 1.7GB in the end (delta: 1.3GB). Free memory was 125.5MB in the beginning and 1.0GB in the end (delta: -896.3MB). Peak memory consumption was 435.9MB. Max. memory is 16.1GB. * Witness Printer took 175.32ms. Allocated memory is still 1.7GB. Free memory was 1.0GB in the beginning and 1.0GB in the end (delta: 21.0MB). Peak memory consumption was 25.2MB. Max. memory is 16.1GB. * Results from de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator: - GenericResult: Unfinished Backtranslation Unfinished Backtranslation: Expression type not yet supported in backtranslation: QuantifierExpression * Results from de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction: - StatisticsResult: ErrorAutomatonStatistics NumberErrorTraces: 0, NumberStatementsAllTraces: 0, NumberRelevantStatements: 0, 0.0s ErrorAutomatonConstructionTimeTotal, 0.0s FaulLocalizationTime, NumberStatementsFirstTrace: -1, TraceLengthAvg: 0, 0.0s ErrorAutomatonConstructionTimeAvg, 0.0s ErrorAutomatonDifferenceTimeAvg, 0.0s ErrorAutomatonDifferenceTimeTotal, NumberOfNoEnhancement: 0, NumberOfFiniteEnhancement: 0, NumberOfInfiniteEnhancement: 0 - PositiveResult [Line: 191]: a call to reach_error is unreachable For all program executions holds that a call to reach_error is unreachable at this location - StatisticsResult: Ultimate Automizer benchmark data CFG has 1 procedures, 396 locations, 1 error locations. Started 1 CEGAR loops. OverallTime: 52.4s, OverallIterations: 20, TraceHistogramMax: 12, PathProgramHistogramMax: 1, EmptinessCheckTime: 0.3s, AutomataDifference: 19.2s, DeadEndRemovalTime: 0.0s, HoareAnnotationTime: 0.0s, InitialAbstractionConstructionTime: 0.0s, HoareTripleCheckerStatistics: 0 mSolverCounterUnknown, 6102 SdHoareTripleChecker+Valid, 17.6s IncrementalHoareTripleChecker+Time, 0 mSdLazyCounter, 6102 mSDsluCounter, 5749 SdHoareTripleChecker+Invalid, 14.7s Time, 0 mProtectedAction, 0 SdHoareTripleChecker+Unchecked, 0 IncrementalHoareTripleChecker+Unchecked, 209 mSDsCounter, 2637 IncrementalHoareTripleChecker+Valid, 0 mProtectedPredicate, 22185 IncrementalHoareTripleChecker+Invalid, 24822 SdHoareTripleChecker+Unknown, 0 mSolverCounterNotChecked, 2637 mSolverCounterUnsat, 5540 mSDtfsCounter, 22185 mSolverCounterSat, 0.1s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Unknown, PredicateUnifierStatistics: 0 DeclaredPredicates, 8045 GetRequests, 7994 SyntacticMatches, 0 SemanticMatches, 51 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 25 ImplicationChecksByTransitivity, 0.3s Time, 0.0s BasicInterpolantAutomatonTime, BiggestAbstraction: size=14151occurred in iteration=19, InterpolantAutomatonStates: 74, traceCheckStatistics: No data available, InterpolantConsolidationStatistics: No data available, PathInvariantsStatistics: No data available, 0/0 InterpolantCoveringCapability, TotalInterpolationStatistics: No data available, 0.0s DumpTime, AutomataMinimizationStatistics: 1.5s AutomataMinimizationTime, 20 MinimizatonAttempts, 4951 StatesRemovedByMinimization, 7 NontrivialMinimizations, HoareAnnotationStatistics: No data available, RefinementEngineStatistics: TRACE_CHECK: 0.5s SsaConstructionTime, 1.6s SatisfiabilityAnalysisTime, 27.1s InterpolantComputationTime, 26865 NumberOfCodeBlocks, 26865 NumberOfCodeBlocksAsserted, 24 NumberOfCheckSat, 28629 ConstructedInterpolants, 56 QuantifiedInterpolants, 70831 SizeOfPredicates, 3 NumberOfNonLiveVariables, 7132 ConjunctsInSsa, 15 ConjunctsInUnsatCore, 25 InterpolantComputations, 19 PerfectInterpolantSequences, 92087/92912 InterpolantCoveringCapability, INVARIANT_SYNTHESIS: No data available, INTERPOLANT_CONSOLIDATION: No data available, ABSTRACT_INTERPRETATION: No data available, PDR: No data available, ACCELERATED_INTERPOLATION: No data available, SIFA: No data available, ReuseStatistics: No data available, ConComCheckerStatistics: No data available - AllSpecificationsHoldResult: All specifications hold 1 specifications checked. All of them hold - InvariantResult [Line: 1783]: Location Invariant Derived location invariant: (((((((((((((((a12 <= 5) && (a15 == 4)) && (158 <= a18)) && (a16 <= 11)) || (((a15 <= 3) && (a16 <= 11)) && (7 == a12))) || ((((a12 == 9) && (a16 == 8)) && (135 <= a18)) && (a15 == 3))) || (((a15 <= 3) && (a12 == 6)) && (a16 <= 11))) || (((a15 == 4) && (a12 == 6)) && (a16 <= 11))) || (((a12 <= 5) && (a15 <= 3)) && (a16 <= 11))) || ((a16 <= 8) && (a15 <= 3))) || (((a15 <= 3) && (a12 == 8)) && (a16 <= 11))) || (((a12 == 9) && (a16 == 9)) && (a15 == 3))) || (((a15 <= 3) && (11 <= a16)) && (((5 != a12) || (0 < ((long long) a18 + 156))) || (a16 != 12)))) || ((((a12 <= 5) && (a15 == 4)) && (a18 <= 132)) && (a16 <= 11))) || ((((a16 != 10) && (a15 == 4)) && ((a12 != 9) || (a16 != 11))) && (a16 <= 11))) RESULT: Ultimate proved your program to be correct! [2025-02-05 11:58:34,329 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 (1)] Ended with exit code 0 Received shutdown request... --- End real Ultimate output --- Execution finished normally Writing output log to file Ultimate.log Result: TRUE