./Ultimate.py --spec ../sv-benchmarks/c/properties/unreach-call.prp --file ../sv-benchmarks/c/eca-rers2012/Problem13_label04.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/Problem13_label04.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 2adccaef3712b0295c8f7cfd3e1ed73b8b25a6bf1026bcea89334476cfd41a2b --- Real Ultimate output --- This is Ultimate 0.3.0-?-c00e63d-m [2025-02-05 11:41:22,255 INFO L188 SettingsManager]: Resetting all preferences to default values... [2025-02-05 11:41:22,315 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:41:22,321 WARN L101 SettingsManager]: Preference file contains the following unknown settings: [2025-02-05 11:41:22,323 WARN L103 SettingsManager]: * de.uni_freiburg.informatik.ultimate.core.Log level for class [2025-02-05 11:41:22,345 INFO L130 SettingsManager]: Preferences different from defaults after loading the file: [2025-02-05 11:41:22,346 INFO L151 SettingsManager]: Preferences of UltimateCore differ from their defaults: [2025-02-05 11:41:22,347 INFO L153 SettingsManager]: * Log level for class=de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher=ERROR; [2025-02-05 11:41:22,347 INFO L151 SettingsManager]: Preferences of Boogie Preprocessor differ from their defaults: [2025-02-05 11:41:22,347 INFO L153 SettingsManager]: * Use memory slicer=true [2025-02-05 11:41:22,348 INFO L151 SettingsManager]: Preferences of Boogie Procedure Inliner differ from their defaults: [2025-02-05 11:41:22,348 INFO L153 SettingsManager]: * Ignore calls to procedures called more than once=ONLY_FOR_SEQUENTIAL_PROGRAMS [2025-02-05 11:41:22,348 INFO L151 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2025-02-05 11:41:22,348 INFO L153 SettingsManager]: * Create parallel compositions if possible=false [2025-02-05 11:41:22,348 INFO L153 SettingsManager]: * Use SBE=true [2025-02-05 11:41:22,348 INFO L151 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2025-02-05 11:41:22,348 INFO L153 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2025-02-05 11:41:22,349 INFO L153 SettingsManager]: * sizeof long=4 [2025-02-05 11:41:22,349 INFO L153 SettingsManager]: * Overapproximate operations on floating types=true [2025-02-05 11:41:22,349 INFO L153 SettingsManager]: * sizeof POINTER=4 [2025-02-05 11:41:22,349 INFO L153 SettingsManager]: * Check division by zero=IGNORE [2025-02-05 11:41:22,349 INFO L153 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2025-02-05 11:41:22,349 INFO L153 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2025-02-05 11:41:22,349 INFO L153 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2025-02-05 11:41:22,349 INFO L153 SettingsManager]: * sizeof long double=12 [2025-02-05 11:41:22,349 INFO L153 SettingsManager]: * Check if freed pointer was valid=false [2025-02-05 11:41:22,350 INFO L153 SettingsManager]: * Behaviour of calls to undefined functions=OVERAPPROXIMATE_BEHAVIOUR [2025-02-05 11:41:22,350 INFO L153 SettingsManager]: * Use constant arrays=true [2025-02-05 11:41:22,350 INFO L151 SettingsManager]: Preferences of IcfgBuilder differ from their defaults: [2025-02-05 11:41:22,350 INFO L153 SettingsManager]: * Size of a code block=SequenceOfStatements [2025-02-05 11:41:22,350 INFO L153 SettingsManager]: * Only consider context switches at boundaries of atomic blocks=true [2025-02-05 11:41:22,350 INFO L153 SettingsManager]: * SMT solver=External_DefaultMode [2025-02-05 11:41:22,350 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2025-02-05 11:41:22,350 INFO L151 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2025-02-05 11:41:22,350 INFO L153 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2025-02-05 11:41:22,350 INFO L153 SettingsManager]: * Compute procedure contracts=false [2025-02-05 11:41:22,350 INFO L153 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopHeads [2025-02-05 11:41:22,350 INFO L153 SettingsManager]: * Trace refinement strategy=CAMEL [2025-02-05 11:41:22,350 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2025-02-05 11:41:22,350 INFO L153 SettingsManager]: * Apply one-shot large block encoding in concurrent analysis=false [2025-02-05 11:41:22,350 INFO L153 SettingsManager]: * Automaton type used in concurrency analysis=PETRI_NET [2025-02-05 11:41:22,350 INFO L153 SettingsManager]: * Order on configurations for Petri net unfoldings=DBO [2025-02-05 11:41:22,350 INFO L153 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode [2025-02-05 11:41:22,350 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 -> 2adccaef3712b0295c8f7cfd3e1ed73b8b25a6bf1026bcea89334476cfd41a2b [2025-02-05 11:41:22,594 INFO L75 nceAwareModelManager]: Repository-Root is: /tmp [2025-02-05 11:41:22,602 INFO L261 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2025-02-05 11:41:22,603 INFO L217 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2025-02-05 11:41:22,604 INFO L270 PluginConnector]: Initializing CDTParser... [2025-02-05 11:41:22,604 INFO L274 PluginConnector]: CDTParser initialized [2025-02-05 11:41:22,609 INFO L431 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/../sv-benchmarks/c/eca-rers2012/Problem13_label04.c [2025-02-05 11:41:23,730 INFO L533 CDTParser]: Created temporary CDT project at /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/data/700cc8023/bb2dfcda07a9460484d0c838be70e805/FLAG4dbd29c38 [2025-02-05 11:41:24,264 INFO L384 CDTParser]: Found 1 translation units. [2025-02-05 11:41:24,265 INFO L180 CDTParser]: Scanning /storage/repos/ultimate-jdk21/releaseScripts/default/sv-benchmarks/c/eca-rers2012/Problem13_label04.c [2025-02-05 11:41:24,293 INFO L427 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/data/700cc8023/bb2dfcda07a9460484d0c838be70e805/FLAG4dbd29c38 [2025-02-05 11:41:24,317 INFO L435 CDTParser]: Successfully deleted /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/data/700cc8023/bb2dfcda07a9460484d0c838be70e805 [2025-02-05 11:41:24,319 INFO L299 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2025-02-05 11:41:24,321 INFO L133 ToolchainWalker]: Walking toolchain with 6 elements. [2025-02-05 11:41:24,321 INFO L112 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2025-02-05 11:41:24,322 INFO L270 PluginConnector]: Initializing CACSL2BoogieTranslator... [2025-02-05 11:41:24,325 INFO L274 PluginConnector]: CACSL2BoogieTranslator initialized [2025-02-05 11:41:24,326 INFO L184 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 05.02 11:41:24" (1/1) ... [2025-02-05 11:41:24,328 INFO L204 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@14d91769 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 05.02 11:41:24, skipping insertion in model container [2025-02-05 11:41:24,328 INFO L184 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 05.02 11:41:24" (1/1) ... [2025-02-05 11:41:24,408 INFO L175 MainTranslator]: Built tables and reachable declarations [2025-02-05 11:41:24,582 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/Problem13_label04.c[2611,2624] [2025-02-05 11:41:25,068 INFO L210 PostProcessor]: Analyzing one entry point: main [2025-02-05 11:41:25,078 INFO L200 MainTranslator]: Completed pre-run [2025-02-05 11:41:25,090 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/Problem13_label04.c[2611,2624] [2025-02-05 11:41:25,423 INFO L210 PostProcessor]: Analyzing one entry point: main [2025-02-05 11:41:25,456 INFO L204 MainTranslator]: Completed translation [2025-02-05 11:41:25,457 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 05.02 11:41:25 WrapperNode [2025-02-05 11:41:25,457 INFO L131 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2025-02-05 11:41:25,462 INFO L112 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2025-02-05 11:41:25,462 INFO L270 PluginConnector]: Initializing Boogie Procedure Inliner... [2025-02-05 11:41:25,462 INFO L274 PluginConnector]: Boogie Procedure Inliner initialized [2025-02-05 11:41:25,470 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:41:25" (1/1) ... [2025-02-05 11:41:25,539 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:41:25" (1/1) ... [2025-02-05 11:41:25,930 INFO L138 Inliner]: procedures = 17, calls = 11, calls flagged for inlining = 6, calls inlined = 6, statements flattened = 5584 [2025-02-05 11:41:25,931 INFO L131 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2025-02-05 11:41:25,931 INFO L112 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2025-02-05 11:41:25,931 INFO L270 PluginConnector]: Initializing Boogie Preprocessor... [2025-02-05 11:41:25,931 INFO L274 PluginConnector]: Boogie Preprocessor initialized [2025-02-05 11:41:25,937 INFO L184 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 05.02 11:41:25" (1/1) ... [2025-02-05 11:41:25,938 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 05.02 11:41:25" (1/1) ... [2025-02-05 11:41:26,007 INFO L184 PluginConnector]: Executing the observer MemorySlicer from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 05.02 11:41:25" (1/1) ... [2025-02-05 11:41:26,257 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:41:26,258 INFO L184 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 05.02 11:41:25" (1/1) ... [2025-02-05 11:41:26,258 INFO L184 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 05.02 11:41:25" (1/1) ... [2025-02-05 11:41:26,396 INFO L184 PluginConnector]: Executing the observer ReplaceArrayAssignments from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 05.02 11:41:25" (1/1) ... [2025-02-05 11:41:26,437 INFO L184 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 05.02 11:41:25" (1/1) ... [2025-02-05 11:41:26,465 INFO L184 PluginConnector]: Executing the observer LTLStepAnnotator from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 05.02 11:41:25" (1/1) ... [2025-02-05 11:41:26,480 INFO L184 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 05.02 11:41:25" (1/1) ... [2025-02-05 11:41:26,523 INFO L131 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2025-02-05 11:41:26,524 INFO L112 PluginConnector]: ------------------------IcfgBuilder---------------------------- [2025-02-05 11:41:26,524 INFO L270 PluginConnector]: Initializing IcfgBuilder... [2025-02-05 11:41:26,524 INFO L274 PluginConnector]: IcfgBuilder initialized [2025-02-05 11:41:26,524 INFO L184 PluginConnector]: Executing the observer IcfgBuilderObserver from plugin IcfgBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 05.02 11:41:25" (1/1) ... [2025-02-05 11:41:26,528 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2025-02-05 11:41:26,535 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 [2025-02-05 11:41:26,546 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:41:26,550 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:41:26,563 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocInit [2025-02-05 11:41:26,564 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int#0 [2025-02-05 11:41:26,564 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2025-02-05 11:41:26,564 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2025-02-05 11:41:26,606 INFO L257 CfgBuilder]: Building ICFG [2025-02-05 11:41:26,608 INFO L287 CfgBuilder]: Building CFG for each procedure with an implementation [2025-02-05 11:41:30,336 INFO L1309 $ProcedureCfgBuilder]: dead code at ProgramPoint L1894: havoc calculate_output_#t~ret9#1; [2025-02-05 11:41:30,337 INFO L1309 $ProcedureCfgBuilder]: dead code at ProgramPoint L3629: havoc calculate_output2_#t~ret10#1; [2025-02-05 11:41:30,337 INFO L1309 $ProcedureCfgBuilder]: dead code at ProgramPoint L5351: havoc calculate_output3_#t~ret11#1; [2025-02-05 11:41:30,470 INFO L? ?]: Removed 738 outVars from TransFormulas that were not future-live. [2025-02-05 11:41:30,471 INFO L308 CfgBuilder]: Performing block encoding [2025-02-05 11:41:30,492 INFO L332 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2025-02-05 11:41:30,493 INFO L337 CfgBuilder]: Removed 0 assume(true) statements. [2025-02-05 11:41:30,493 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.icfgbuilder CFG 05.02 11:41:30 BoogieIcfgContainer [2025-02-05 11:41:30,493 INFO L131 PluginConnector]: ------------------------ END IcfgBuilder---------------------------- [2025-02-05 11:41:30,494 INFO L112 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2025-02-05 11:41:30,495 INFO L270 PluginConnector]: Initializing TraceAbstraction... [2025-02-05 11:41:30,497 INFO L274 PluginConnector]: TraceAbstraction initialized [2025-02-05 11:41:30,497 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 05.02 11:41:24" (1/3) ... [2025-02-05 11:41:30,498 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@258b7022 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 05.02 11:41:30, skipping insertion in model container [2025-02-05 11:41:30,498 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 05.02 11:41:25" (2/3) ... [2025-02-05 11:41:30,498 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@258b7022 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 05.02 11:41:30, skipping insertion in model container [2025-02-05 11:41:30,498 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.icfgbuilder CFG 05.02 11:41:30" (3/3) ... [2025-02-05 11:41:30,499 INFO L128 eAbstractionObserver]: Analyzing ICFG Problem13_label04.c [2025-02-05 11:41:30,507 INFO L216 ceAbstractionStarter]: Automizer settings: Hoare:LoopHeads NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2025-02-05 11:41:30,508 INFO L151 ceAbstractionStarter]: Applying trace abstraction to ICFG Problem13_label04.c that has 1 procedures, 1098 locations, 1 initial locations, 1 loop locations, and 1 error locations. [2025-02-05 11:41:30,557 INFO L332 AbstractCegarLoop]: ======== Iteration 0 == of CEGAR loop == AllErrorsAtOnce ======== [2025-02-05 11:41:30,564 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;@294ebf29, mLbeIndependenceSettings=[IndependenceType=SEMANTIC, AbstractionType=NONE, UseConditional=false, UseSemiCommutativity=true, Solver=Z3, SolverTimeout=1000ms] [2025-02-05 11:41:30,564 INFO L334 AbstractCegarLoop]: Starting to check reachability of 1 error locations. [2025-02-05 11:41:30,568 INFO L276 IsEmpty]: Start isEmpty. Operand has 1098 states, 1096 states have (on average 1.8266423357664234) internal successors, (2002), 1097 states have internal predecessors, (2002), 0 states have call successors, (0), 0 states 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:41:30,571 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 17 [2025-02-05 11:41:30,571 INFO L210 NwaCegarLoop]: Found error trace [2025-02-05 11:41:30,572 INFO L218 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-02-05 11:41:30,572 INFO L396 AbstractCegarLoop]: === Iteration 1 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-02-05 11:41:30,575 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-02-05 11:41:30,575 INFO L85 PathProgramCache]: Analyzing trace with hash 394783727, now seen corresponding path program 1 times [2025-02-05 11:41:30,579 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-02-05 11:41:30,580 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [754980022] [2025-02-05 11:41:30,580 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-02-05 11:41:30,580 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-02-05 11:41:30,622 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 16 statements into 1 equivalence classes. [2025-02-05 11:41:30,635 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 16 of 16 statements. [2025-02-05 11:41:30,635 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-02-05 11:41:30,636 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-02-05 11:41:30,712 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:41:30,712 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-02-05 11:41:30,712 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [754980022] [2025-02-05 11:41:30,713 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [754980022] provided 1 perfect and 0 imperfect interpolant sequences [2025-02-05 11:41:30,713 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-02-05 11:41:30,713 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2025-02-05 11:41:30,714 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [783927355] [2025-02-05 11:41:30,714 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-02-05 11:41:30,716 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2025-02-05 11:41:30,716 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-02-05 11:41:30,726 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2025-02-05 11:41:30,726 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-02-05 11:41:30,729 INFO L87 Difference]: Start difference. First operand has 1098 states, 1096 states have (on average 1.8266423357664234) internal successors, (2002), 1097 states have internal predecessors, (2002), 0 states have call successors, (0), 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 5.333333333333333) internal successors, (16), 2 states have internal predecessors, (16), 0 states have call successors, (0), 0 states 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:41:34,162 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-02-05 11:41:34,163 INFO L93 Difference]: Finished difference Result 3035 states and 5640 transitions. [2025-02-05 11:41:34,164 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2025-02-05 11:41:34,165 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 5.333333333333333) internal successors, (16), 2 states have internal predecessors, (16), 0 states have call successors, (0), 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 16 [2025-02-05 11:41:34,165 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-02-05 11:41:34,177 INFO L225 Difference]: With dead ends: 3035 [2025-02-05 11:41:34,178 INFO L226 Difference]: Without dead ends: 1873 [2025-02-05 11:41:34,182 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:41:34,183 INFO L435 NwaCegarLoop]: 991 mSDtfsCounter, 889 mSDsluCounter, 154 mSDsCounter, 0 mSdLazyCounter, 2505 mSolverCounterSat, 858 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 2.8s Time, 0 mProtectedPredicate, 0 mProtectedAction, 889 SdHoareTripleChecker+Valid, 1145 SdHoareTripleChecker+Invalid, 3363 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 858 IncrementalHoareTripleChecker+Valid, 2505 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 3.3s IncrementalHoareTripleChecker+Time [2025-02-05 11:41:34,184 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [889 Valid, 1145 Invalid, 3363 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [858 Valid, 2505 Invalid, 0 Unknown, 0 Unchecked, 3.3s Time] [2025-02-05 11:41:34,197 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1873 states. [2025-02-05 11:41:34,253 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1873 to 1859. [2025-02-05 11:41:34,257 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 1859 states, 1858 states have (on average 1.5441334768568353) internal successors, (2869), 1858 states have internal predecessors, (2869), 0 states have call successors, (0), 0 states 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:41:34,264 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1859 states to 1859 states and 2869 transitions. [2025-02-05 11:41:34,266 INFO L78 Accepts]: Start accepts. Automaton has 1859 states and 2869 transitions. Word has length 16 [2025-02-05 11:41:34,266 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-02-05 11:41:34,267 INFO L471 AbstractCegarLoop]: Abstraction has 1859 states and 2869 transitions. [2025-02-05 11:41:34,267 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 5.333333333333333) internal successors, (16), 2 states have internal predecessors, (16), 0 states have call successors, (0), 0 states 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:41:34,267 INFO L276 IsEmpty]: Start isEmpty. Operand 1859 states and 2869 transitions. [2025-02-05 11:41:34,268 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 89 [2025-02-05 11:41:34,269 INFO L210 NwaCegarLoop]: Found error trace [2025-02-05 11:41:34,269 INFO L218 NwaCegarLoop]: trace histogram [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] [2025-02-05 11:41:34,269 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable0 [2025-02-05 11:41:34,269 INFO L396 AbstractCegarLoop]: === Iteration 2 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-02-05 11:41:34,270 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-02-05 11:41:34,271 INFO L85 PathProgramCache]: Analyzing trace with hash 814857988, now seen corresponding path program 1 times [2025-02-05 11:41:34,271 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-02-05 11:41:34,271 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [8263789] [2025-02-05 11:41:34,271 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-02-05 11:41:34,271 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-02-05 11:41:34,289 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 88 statements into 1 equivalence classes. [2025-02-05 11:41:34,346 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 88 of 88 statements. [2025-02-05 11:41:34,350 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-02-05 11:41:34,350 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-02-05 11:41:34,571 INFO L134 CoverageAnalysis]: Checked inductivity of 13 backedges. 13 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-02-05 11:41:34,572 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-02-05 11:41:34,572 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [8263789] [2025-02-05 11:41:34,572 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [8263789] provided 1 perfect and 0 imperfect interpolant sequences [2025-02-05 11:41:34,572 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-02-05 11:41:34,572 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2025-02-05 11:41:34,572 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1182456718] [2025-02-05 11:41:34,572 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-02-05 11:41:34,573 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2025-02-05 11:41:34,576 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-02-05 11:41:34,577 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2025-02-05 11:41:34,577 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-02-05 11:41:34,577 INFO L87 Difference]: Start difference. First operand 1859 states and 2869 transitions. Second operand has 3 states, 3 states have (on average 29.333333333333332) internal successors, (88), 2 states have internal predecessors, (88), 0 states have call successors, (0), 0 states 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:41:38,117 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-02-05 11:41:38,118 INFO L93 Difference]: Finished difference Result 5317 states and 8229 transitions. [2025-02-05 11:41:38,120 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2025-02-05 11:41:38,120 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 29.333333333333332) internal successors, (88), 2 states have internal predecessors, (88), 0 states have call successors, (0), 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 88 [2025-02-05 11:41:38,120 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-02-05 11:41:38,138 INFO L225 Difference]: With dead ends: 5317 [2025-02-05 11:41:38,145 INFO L226 Difference]: Without dead ends: 3460 [2025-02-05 11:41:38,148 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:41:38,151 INFO L435 NwaCegarLoop]: 1039 mSDtfsCounter, 826 mSDsluCounter, 153 mSDsCounter, 0 mSdLazyCounter, 2402 mSolverCounterSat, 877 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 2.9s Time, 0 mProtectedPredicate, 0 mProtectedAction, 826 SdHoareTripleChecker+Valid, 1192 SdHoareTripleChecker+Invalid, 3279 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 877 IncrementalHoareTripleChecker+Valid, 2402 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 3.4s IncrementalHoareTripleChecker+Time [2025-02-05 11:41:38,151 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [826 Valid, 1192 Invalid, 3279 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [877 Valid, 2402 Invalid, 0 Unknown, 0 Unchecked, 3.4s Time] [2025-02-05 11:41:38,159 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 3460 states. [2025-02-05 11:41:38,261 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 3460 to 3459. [2025-02-05 11:41:38,265 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 3459 states, 3458 states have (on average 1.3805668016194332) internal successors, (4774), 3458 states have internal predecessors, (4774), 0 states have call successors, (0), 0 states 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:41:38,270 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3459 states to 3459 states and 4774 transitions. [2025-02-05 11:41:38,270 INFO L78 Accepts]: Start accepts. Automaton has 3459 states and 4774 transitions. Word has length 88 [2025-02-05 11:41:38,271 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-02-05 11:41:38,271 INFO L471 AbstractCegarLoop]: Abstraction has 3459 states and 4774 transitions. [2025-02-05 11:41:38,271 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 29.333333333333332) internal successors, (88), 2 states have internal predecessors, (88), 0 states have call successors, (0), 0 states 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:41:38,272 INFO L276 IsEmpty]: Start isEmpty. Operand 3459 states and 4774 transitions. [2025-02-05 11:41:38,275 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 103 [2025-02-05 11:41:38,276 INFO L210 NwaCegarLoop]: Found error trace [2025-02-05 11:41:38,276 INFO L218 NwaCegarLoop]: trace histogram [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] [2025-02-05 11:41:38,277 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable1 [2025-02-05 11:41:38,277 INFO L396 AbstractCegarLoop]: === Iteration 3 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-02-05 11:41:38,277 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-02-05 11:41:38,280 INFO L85 PathProgramCache]: Analyzing trace with hash 2000316236, now seen corresponding path program 1 times [2025-02-05 11:41:38,280 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-02-05 11:41:38,280 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1824877836] [2025-02-05 11:41:38,280 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-02-05 11:41:38,280 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-02-05 11:41:38,297 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 102 statements into 1 equivalence classes. [2025-02-05 11:41:38,314 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 102 of 102 statements. [2025-02-05 11:41:38,315 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-02-05 11:41:38,315 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-02-05 11:41:38,446 INFO L134 CoverageAnalysis]: Checked inductivity of 13 backedges. 13 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-02-05 11:41:38,446 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-02-05 11:41:38,446 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1824877836] [2025-02-05 11:41:38,446 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1824877836] provided 1 perfect and 0 imperfect interpolant sequences [2025-02-05 11:41:38,446 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-02-05 11:41:38,446 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2025-02-05 11:41:38,447 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [803912336] [2025-02-05 11:41:38,447 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-02-05 11:41:38,447 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2025-02-05 11:41:38,448 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-02-05 11:41:38,448 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2025-02-05 11:41:38,448 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-02-05 11:41:38,449 INFO L87 Difference]: Start difference. First operand 3459 states and 4774 transitions. Second operand has 3 states, 3 states have (on average 34.0) internal successors, (102), 2 states have internal predecessors, (102), 0 states have call successors, (0), 0 states 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:41:41,511 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-02-05 11:41:41,511 INFO L93 Difference]: Finished difference Result 10095 states and 13939 transitions. [2025-02-05 11:41:41,512 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2025-02-05 11:41:41,512 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 34.0) internal successors, (102), 2 states have internal predecessors, (102), 0 states have call successors, (0), 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 102 [2025-02-05 11:41:41,512 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-02-05 11:41:41,542 INFO L225 Difference]: With dead ends: 10095 [2025-02-05 11:41:41,543 INFO L226 Difference]: Without dead ends: 6638 [2025-02-05 11:41:41,547 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:41:41,549 INFO L435 NwaCegarLoop]: 771 mSDtfsCounter, 932 mSDsluCounter, 132 mSDsCounter, 0 mSdLazyCounter, 2551 mSolverCounterSat, 764 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 2.5s Time, 0 mProtectedPredicate, 0 mProtectedAction, 932 SdHoareTripleChecker+Valid, 903 SdHoareTripleChecker+Invalid, 3315 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 764 IncrementalHoareTripleChecker+Valid, 2551 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 3.0s IncrementalHoareTripleChecker+Time [2025-02-05 11:41:41,550 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [932 Valid, 903 Invalid, 3315 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [764 Valid, 2551 Invalid, 0 Unknown, 0 Unchecked, 3.0s Time] [2025-02-05 11:41:41,556 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 6638 states. [2025-02-05 11:41:41,617 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 6638 to 6631. [2025-02-05 11:41:41,623 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 6631 states, 6630 states have (on average 1.2722473604826545) internal successors, (8435), 6630 states have internal predecessors, (8435), 0 states have call successors, (0), 0 states 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:41:41,634 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 6631 states to 6631 states and 8435 transitions. [2025-02-05 11:41:41,634 INFO L78 Accepts]: Start accepts. Automaton has 6631 states and 8435 transitions. Word has length 102 [2025-02-05 11:41:41,635 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-02-05 11:41:41,635 INFO L471 AbstractCegarLoop]: Abstraction has 6631 states and 8435 transitions. [2025-02-05 11:41:41,635 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 34.0) internal successors, (102), 2 states have internal predecessors, (102), 0 states have call successors, (0), 0 states 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:41:41,635 INFO L276 IsEmpty]: Start isEmpty. Operand 6631 states and 8435 transitions. [2025-02-05 11:41:41,637 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 106 [2025-02-05 11:41:41,637 INFO L210 NwaCegarLoop]: Found error trace [2025-02-05 11:41:41,637 INFO L218 NwaCegarLoop]: trace histogram [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:41:41,638 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable2 [2025-02-05 11:41:41,638 INFO L396 AbstractCegarLoop]: === Iteration 4 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-02-05 11:41:41,638 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-02-05 11:41:41,640 INFO L85 PathProgramCache]: Analyzing trace with hash 1522211782, now seen corresponding path program 1 times [2025-02-05 11:41:41,640 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-02-05 11:41:41,640 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [53711779] [2025-02-05 11:41:41,640 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-02-05 11:41:41,640 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-02-05 11:41:41,658 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 105 statements into 1 equivalence classes. [2025-02-05 11:41:41,669 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 105 of 105 statements. [2025-02-05 11:41:41,670 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-02-05 11:41:41,670 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-02-05 11:41:41,759 INFO L134 CoverageAnalysis]: Checked inductivity of 13 backedges. 13 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-02-05 11:41:41,760 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-02-05 11:41:41,760 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [53711779] [2025-02-05 11:41:41,760 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [53711779] provided 1 perfect and 0 imperfect interpolant sequences [2025-02-05 11:41:41,760 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-02-05 11:41:41,760 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2025-02-05 11:41:41,761 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [420104923] [2025-02-05 11:41:41,761 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-02-05 11:41:41,761 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2025-02-05 11:41:41,761 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-02-05 11:41:41,761 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2025-02-05 11:41:41,762 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-02-05 11:41:41,762 INFO L87 Difference]: Start difference. First operand 6631 states and 8435 transitions. Second operand has 3 states, 3 states have (on average 35.0) internal successors, (105), 3 states have internal predecessors, (105), 0 states have call successors, (0), 0 states 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:41:45,107 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-02-05 11:41:45,107 INFO L93 Difference]: Finished difference Result 16421 states and 21400 transitions. [2025-02-05 11:41:45,108 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2025-02-05 11:41:45,108 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 35.0) internal successors, (105), 3 states have internal predecessors, (105), 0 states have call successors, (0), 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 105 [2025-02-05 11:41:45,108 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-02-05 11:41:45,130 INFO L225 Difference]: With dead ends: 16421 [2025-02-05 11:41:45,130 INFO L226 Difference]: Without dead ends: 9792 [2025-02-05 11:41:45,137 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:41:45,138 INFO L435 NwaCegarLoop]: 1592 mSDtfsCounter, 981 mSDsluCounter, 98 mSDsCounter, 0 mSdLazyCounter, 2556 mSolverCounterSat, 812 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 2.8s Time, 0 mProtectedPredicate, 0 mProtectedAction, 981 SdHoareTripleChecker+Valid, 1690 SdHoareTripleChecker+Invalid, 3368 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 812 IncrementalHoareTripleChecker+Valid, 2556 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 3.2s IncrementalHoareTripleChecker+Time [2025-02-05 11:41:45,138 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [981 Valid, 1690 Invalid, 3368 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [812 Valid, 2556 Invalid, 0 Unknown, 0 Unchecked, 3.2s Time] [2025-02-05 11:41:45,145 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 9792 states. [2025-02-05 11:41:45,229 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 9792 to 9783. [2025-02-05 11:41:45,240 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 9783 states, 9782 states have (on average 1.275914945818851) internal successors, (12481), 9782 states have internal predecessors, (12481), 0 states have call successors, (0), 0 states 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:41:45,256 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 9783 states to 9783 states and 12481 transitions. [2025-02-05 11:41:45,256 INFO L78 Accepts]: Start accepts. Automaton has 9783 states and 12481 transitions. Word has length 105 [2025-02-05 11:41:45,256 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-02-05 11:41:45,256 INFO L471 AbstractCegarLoop]: Abstraction has 9783 states and 12481 transitions. [2025-02-05 11:41:45,256 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 35.0) internal successors, (105), 3 states have internal predecessors, (105), 0 states have call successors, (0), 0 states 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:41:45,256 INFO L276 IsEmpty]: Start isEmpty. Operand 9783 states and 12481 transitions. [2025-02-05 11:41:45,257 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 113 [2025-02-05 11:41:45,257 INFO L210 NwaCegarLoop]: Found error trace [2025-02-05 11:41:45,257 INFO L218 NwaCegarLoop]: trace histogram [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] [2025-02-05 11:41:45,257 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable3 [2025-02-05 11:41:45,257 INFO L396 AbstractCegarLoop]: === Iteration 5 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-02-05 11:41:45,257 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-02-05 11:41:45,258 INFO L85 PathProgramCache]: Analyzing trace with hash 579601922, now seen corresponding path program 1 times [2025-02-05 11:41:45,258 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-02-05 11:41:45,258 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1284202670] [2025-02-05 11:41:45,258 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-02-05 11:41:45,258 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-02-05 11:41:45,274 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 112 statements into 1 equivalence classes. [2025-02-05 11:41:45,286 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 112 of 112 statements. [2025-02-05 11:41:45,287 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-02-05 11:41:45,287 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-02-05 11:41:45,411 INFO L134 CoverageAnalysis]: Checked inductivity of 13 backedges. 13 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-02-05 11:41:45,411 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-02-05 11:41:45,411 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1284202670] [2025-02-05 11:41:45,411 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1284202670] provided 1 perfect and 0 imperfect interpolant sequences [2025-02-05 11:41:45,413 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-02-05 11:41:45,413 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2025-02-05 11:41:45,413 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [416215724] [2025-02-05 11:41:45,413 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-02-05 11:41:45,413 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2025-02-05 11:41:45,413 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-02-05 11:41:45,414 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2025-02-05 11:41:45,414 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=6, Invalid=6, Unknown=0, NotChecked=0, Total=12 [2025-02-05 11:41:45,414 INFO L87 Difference]: Start difference. First operand 9783 states and 12481 transitions. Second operand has 4 states, 4 states have (on average 28.0) internal successors, (112), 3 states have internal predecessors, (112), 0 states have call successors, (0), 0 states 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:41:51,027 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-02-05 11:41:51,027 INFO L93 Difference]: Finished difference Result 38673 states and 49385 transitions. [2025-02-05 11:41:51,027 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2025-02-05 11:41:51,027 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 4 states have (on average 28.0) internal successors, (112), 3 states have internal predecessors, (112), 0 states have call successors, (0), 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 112 [2025-02-05 11:41:51,028 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-02-05 11:41:51,117 INFO L225 Difference]: With dead ends: 38673 [2025-02-05 11:41:51,121 INFO L226 Difference]: Without dead ends: 28892 [2025-02-05 11:41:51,139 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:41:51,140 INFO L435 NwaCegarLoop]: 755 mSDtfsCounter, 1811 mSDsluCounter, 206 mSDsCounter, 0 mSdLazyCounter, 6295 mSolverCounterSat, 1071 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 4.6s Time, 0 mProtectedPredicate, 0 mProtectedAction, 1811 SdHoareTripleChecker+Valid, 961 SdHoareTripleChecker+Invalid, 7366 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 1071 IncrementalHoareTripleChecker+Valid, 6295 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 5.4s IncrementalHoareTripleChecker+Time [2025-02-05 11:41:51,140 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [1811 Valid, 961 Invalid, 7366 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [1071 Valid, 6295 Invalid, 0 Unknown, 0 Unchecked, 5.4s Time] [2025-02-05 11:41:51,166 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 28892 states. [2025-02-05 11:41:51,443 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 28892 to 28771. [2025-02-05 11:41:51,471 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 28771 states, 28770 states have (on average 1.2262078554049356) internal successors, (35278), 28770 states have internal predecessors, (35278), 0 states have call successors, (0), 0 states 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:41:51,504 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 28771 states to 28771 states and 35278 transitions. [2025-02-05 11:41:51,504 INFO L78 Accepts]: Start accepts. Automaton has 28771 states and 35278 transitions. Word has length 112 [2025-02-05 11:41:51,505 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-02-05 11:41:51,505 INFO L471 AbstractCegarLoop]: Abstraction has 28771 states and 35278 transitions. [2025-02-05 11:41:51,505 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 28.0) internal successors, (112), 3 states have internal predecessors, (112), 0 states have call successors, (0), 0 states 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:41:51,505 INFO L276 IsEmpty]: Start isEmpty. Operand 28771 states and 35278 transitions. [2025-02-05 11:41:51,506 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 133 [2025-02-05 11:41:51,506 INFO L210 NwaCegarLoop]: Found error trace [2025-02-05 11:41:51,506 INFO L218 NwaCegarLoop]: trace histogram [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] [2025-02-05 11:41:51,507 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable4 [2025-02-05 11:41:51,507 INFO L396 AbstractCegarLoop]: === Iteration 6 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-02-05 11:41:51,507 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-02-05 11:41:51,507 INFO L85 PathProgramCache]: Analyzing trace with hash -1578622147, now seen corresponding path program 1 times [2025-02-05 11:41:51,507 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-02-05 11:41:51,507 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1722699760] [2025-02-05 11:41:51,507 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-02-05 11:41:51,507 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-02-05 11:41:51,523 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 132 statements into 1 equivalence classes. [2025-02-05 11:41:51,533 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 132 of 132 statements. [2025-02-05 11:41:51,533 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-02-05 11:41:51,533 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-02-05 11:41:51,740 INFO L134 CoverageAnalysis]: Checked inductivity of 13 backedges. 13 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-02-05 11:41:51,741 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-02-05 11:41:51,741 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1722699760] [2025-02-05 11:41:51,741 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1722699760] provided 1 perfect and 0 imperfect interpolant sequences [2025-02-05 11:41:51,741 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-02-05 11:41:51,741 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2025-02-05 11:41:51,741 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1294845768] [2025-02-05 11:41:51,741 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-02-05 11:41:51,741 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2025-02-05 11:41:51,741 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-02-05 11:41:51,742 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2025-02-05 11:41:51,742 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-02-05 11:41:51,742 INFO L87 Difference]: Start difference. First operand 28771 states and 35278 transitions. Second operand has 3 states, 3 states have (on average 44.0) internal successors, (132), 2 states have internal predecessors, (132), 0 states have call successors, (0), 0 states 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:41:54,422 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-02-05 11:41:54,423 INFO L93 Difference]: Finished difference Result 58328 states and 71357 transitions. [2025-02-05 11:41:54,423 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2025-02-05 11:41:54,423 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 44.0) internal successors, (132), 2 states have internal predecessors, (132), 0 states have call successors, (0), 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 132 [2025-02-05 11:41:54,424 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-02-05 11:41:54,466 INFO L225 Difference]: With dead ends: 58328 [2025-02-05 11:41:54,466 INFO L226 Difference]: Without dead ends: 29559 [2025-02-05 11:41:54,479 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:41:54,480 INFO L435 NwaCegarLoop]: 1070 mSDtfsCounter, 676 mSDsluCounter, 135 mSDsCounter, 0 mSdLazyCounter, 2513 mSolverCounterSat, 4 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 2.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 676 SdHoareTripleChecker+Valid, 1205 SdHoareTripleChecker+Invalid, 2517 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 4 IncrementalHoareTripleChecker+Valid, 2513 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 2.5s IncrementalHoareTripleChecker+Time [2025-02-05 11:41:54,480 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [676 Valid, 1205 Invalid, 2517 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [4 Valid, 2513 Invalid, 0 Unknown, 0 Unchecked, 2.5s Time] [2025-02-05 11:41:54,499 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 29559 states. [2025-02-05 11:41:54,677 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 29559 to 29558. [2025-02-05 11:41:54,702 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 29558 states, 29557 states have (on average 1.2205230571438237) internal successors, (36075), 29557 states have internal predecessors, (36075), 0 states have call successors, (0), 0 states 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:41:54,730 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 29558 states to 29558 states and 36075 transitions. [2025-02-05 11:41:54,731 INFO L78 Accepts]: Start accepts. Automaton has 29558 states and 36075 transitions. Word has length 132 [2025-02-05 11:41:54,731 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-02-05 11:41:54,731 INFO L471 AbstractCegarLoop]: Abstraction has 29558 states and 36075 transitions. [2025-02-05 11:41:54,731 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 44.0) internal successors, (132), 2 states have internal predecessors, (132), 0 states have call successors, (0), 0 states 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:41:54,731 INFO L276 IsEmpty]: Start isEmpty. Operand 29558 states and 36075 transitions. [2025-02-05 11:41:54,733 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 222 [2025-02-05 11:41:54,733 INFO L210 NwaCegarLoop]: Found error trace [2025-02-05 11:41:54,733 INFO L218 NwaCegarLoop]: trace histogram [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, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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:41:54,734 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable5 [2025-02-05 11:41:54,734 INFO L396 AbstractCegarLoop]: === Iteration 7 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-02-05 11:41:54,734 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-02-05 11:41:54,734 INFO L85 PathProgramCache]: Analyzing trace with hash 159296916, now seen corresponding path program 1 times [2025-02-05 11:41:54,734 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-02-05 11:41:54,734 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1842130650] [2025-02-05 11:41:54,734 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-02-05 11:41:54,734 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-02-05 11:41:54,748 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 221 statements into 1 equivalence classes. [2025-02-05 11:41:54,756 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 221 of 221 statements. [2025-02-05 11:41:54,756 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-02-05 11:41:54,757 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-02-05 11:41:55,032 INFO L134 CoverageAnalysis]: Checked inductivity of 115 backedges. 101 proven. 0 refuted. 0 times theorem prover too weak. 14 trivial. 0 not checked. [2025-02-05 11:41:55,033 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-02-05 11:41:55,033 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1842130650] [2025-02-05 11:41:55,033 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1842130650] provided 1 perfect and 0 imperfect interpolant sequences [2025-02-05 11:41:55,033 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-02-05 11:41:55,033 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2025-02-05 11:41:55,033 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1328990231] [2025-02-05 11:41:55,033 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-02-05 11:41:55,034 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2025-02-05 11:41:55,034 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-02-05 11:41:55,034 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2025-02-05 11:41:55,034 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-02-05 11:41:55,035 INFO L87 Difference]: Start difference. First operand 29558 states and 36075 transitions. Second operand has 3 states, 3 states have (on average 69.33333333333333) internal successors, (208), 2 states have internal predecessors, (208), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-02-05 11:41:57,647 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-02-05 11:41:57,647 INFO L93 Difference]: Finished difference Result 58327 states and 71351 transitions. [2025-02-05 11:41:57,648 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2025-02-05 11:41:57,648 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 69.33333333333333) internal successors, (208), 2 states have internal predecessors, (208), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 221 [2025-02-05 11:41:57,648 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-02-05 11:41:57,686 INFO L225 Difference]: With dead ends: 58327 [2025-02-05 11:41:57,686 INFO L226 Difference]: Without dead ends: 29558 [2025-02-05 11:41:57,705 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:41:57,707 INFO L435 NwaCegarLoop]: 1076 mSDtfsCounter, 700 mSDsluCounter, 129 mSDsCounter, 0 mSdLazyCounter, 2513 mSolverCounterSat, 4 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 2.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 700 SdHoareTripleChecker+Valid, 1205 SdHoareTripleChecker+Invalid, 2517 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 4 IncrementalHoareTripleChecker+Valid, 2513 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 2.4s IncrementalHoareTripleChecker+Time [2025-02-05 11:41:57,707 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [700 Valid, 1205 Invalid, 2517 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [4 Valid, 2513 Invalid, 0 Unknown, 0 Unchecked, 2.4s Time] [2025-02-05 11:41:57,724 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 29558 states. [2025-02-05 11:41:57,888 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 29558 to 29558. [2025-02-05 11:41:57,911 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 29558 states, 29557 states have (on average 1.220353892478939) internal successors, (36070), 29557 states have internal predecessors, (36070), 0 states have call successors, (0), 0 states 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:41:57,939 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 29558 states to 29558 states and 36070 transitions. [2025-02-05 11:41:57,940 INFO L78 Accepts]: Start accepts. Automaton has 29558 states and 36070 transitions. Word has length 221 [2025-02-05 11:41:57,941 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-02-05 11:41:57,941 INFO L471 AbstractCegarLoop]: Abstraction has 29558 states and 36070 transitions. [2025-02-05 11:41:57,941 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 69.33333333333333) internal successors, (208), 2 states have internal predecessors, (208), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-02-05 11:41:57,941 INFO L276 IsEmpty]: Start isEmpty. Operand 29558 states and 36070 transitions. [2025-02-05 11:41:57,943 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 229 [2025-02-05 11:41:57,943 INFO L210 NwaCegarLoop]: Found error trace [2025-02-05 11:41:57,943 INFO L218 NwaCegarLoop]: trace histogram [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, 1, 1, 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:41:57,944 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable6 [2025-02-05 11:41:57,944 INFO L396 AbstractCegarLoop]: === Iteration 8 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-02-05 11:41:57,944 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-02-05 11:41:57,944 INFO L85 PathProgramCache]: Analyzing trace with hash 873484752, now seen corresponding path program 1 times [2025-02-05 11:41:57,944 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-02-05 11:41:57,944 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1587656353] [2025-02-05 11:41:57,944 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-02-05 11:41:57,944 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-02-05 11:41:57,959 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 228 statements into 1 equivalence classes. [2025-02-05 11:41:57,972 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 228 of 228 statements. [2025-02-05 11:41:57,972 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-02-05 11:41:57,972 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-02-05 11:41:58,141 INFO L134 CoverageAnalysis]: Checked inductivity of 122 backedges. 122 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-02-05 11:41:58,142 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-02-05 11:41:58,142 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1587656353] [2025-02-05 11:41:58,142 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1587656353] provided 1 perfect and 0 imperfect interpolant sequences [2025-02-05 11:41:58,142 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-02-05 11:41:58,142 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2025-02-05 11:41:58,142 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [108099095] [2025-02-05 11:41:58,142 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-02-05 11:41:58,142 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2025-02-05 11:41:58,142 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-02-05 11:41:58,142 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2025-02-05 11:41:58,142 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-02-05 11:41:58,143 INFO L87 Difference]: Start difference. First operand 29558 states and 36070 transitions. Second operand has 3 states, 3 states have (on average 76.0) internal successors, (228), 3 states have internal predecessors, (228), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-02-05 11:42:01,381 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-02-05 11:42:01,382 INFO L93 Difference]: Finished difference Result 58359 states and 71403 transitions. [2025-02-05 11:42:01,383 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2025-02-05 11:42:01,383 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 76.0) internal successors, (228), 3 states have internal predecessors, (228), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 228 [2025-02-05 11:42:01,383 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-02-05 11:42:01,421 INFO L225 Difference]: With dead ends: 58359 [2025-02-05 11:42:01,422 INFO L226 Difference]: Without dead ends: 29590 [2025-02-05 11:42:01,439 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:42:01,440 INFO L435 NwaCegarLoop]: 1781 mSDtfsCounter, 780 mSDsluCounter, 140 mSDsCounter, 0 mSdLazyCounter, 2549 mSolverCounterSat, 683 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 2.6s Time, 0 mProtectedPredicate, 0 mProtectedAction, 780 SdHoareTripleChecker+Valid, 1921 SdHoareTripleChecker+Invalid, 3232 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 683 IncrementalHoareTripleChecker+Valid, 2549 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 3.0s IncrementalHoareTripleChecker+Time [2025-02-05 11:42:01,441 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [780 Valid, 1921 Invalid, 3232 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [683 Valid, 2549 Invalid, 0 Unknown, 0 Unchecked, 3.0s Time] [2025-02-05 11:42:01,460 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 29590 states. [2025-02-05 11:42:01,631 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 29590 to 29557. [2025-02-05 11:42:01,652 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 29557 states, 29556 states have (on average 1.1417986195696306) internal successors, (33747), 29556 states have internal predecessors, (33747), 0 states have call successors, (0), 0 states 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:42:01,678 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 29557 states to 29557 states and 33747 transitions. [2025-02-05 11:42:01,679 INFO L78 Accepts]: Start accepts. Automaton has 29557 states and 33747 transitions. Word has length 228 [2025-02-05 11:42:01,679 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-02-05 11:42:01,679 INFO L471 AbstractCegarLoop]: Abstraction has 29557 states and 33747 transitions. [2025-02-05 11:42:01,680 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 76.0) internal successors, (228), 3 states have internal predecessors, (228), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-02-05 11:42:01,680 INFO L276 IsEmpty]: Start isEmpty. Operand 29557 states and 33747 transitions. [2025-02-05 11:42:01,682 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 238 [2025-02-05 11:42:01,682 INFO L210 NwaCegarLoop]: Found error trace [2025-02-05 11:42:01,682 INFO L218 NwaCegarLoop]: trace histogram [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, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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:42:01,682 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable7 [2025-02-05 11:42:01,682 INFO L396 AbstractCegarLoop]: === Iteration 9 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-02-05 11:42:01,682 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-02-05 11:42:01,682 INFO L85 PathProgramCache]: Analyzing trace with hash 1022479542, now seen corresponding path program 1 times [2025-02-05 11:42:01,682 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-02-05 11:42:01,685 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1774299583] [2025-02-05 11:42:01,685 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-02-05 11:42:01,685 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-02-05 11:42:01,699 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 237 statements into 1 equivalence classes. [2025-02-05 11:42:01,713 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 237 of 237 statements. [2025-02-05 11:42:01,714 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-02-05 11:42:01,714 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-02-05 11:42:01,783 INFO L134 CoverageAnalysis]: Checked inductivity of 122 backedges. 122 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-02-05 11:42:01,783 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-02-05 11:42:01,783 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1774299583] [2025-02-05 11:42:01,783 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1774299583] provided 1 perfect and 0 imperfect interpolant sequences [2025-02-05 11:42:01,783 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-02-05 11:42:01,784 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2025-02-05 11:42:01,784 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1920185648] [2025-02-05 11:42:01,784 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-02-05 11:42:01,784 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2025-02-05 11:42:01,784 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-02-05 11:42:01,784 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2025-02-05 11:42:01,784 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-02-05 11:42:01,784 INFO L87 Difference]: Start difference. First operand 29557 states and 33747 transitions. Second operand has 3 states, 3 states have (on average 79.0) internal successors, (237), 3 states have internal predecessors, (237), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-02-05 11:42:04,777 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-02-05 11:42:04,777 INFO L93 Difference]: Finished difference Result 83497 states and 95475 transitions. [2025-02-05 11:42:04,777 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2025-02-05 11:42:04,778 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 79.0) internal successors, (237), 3 states have internal predecessors, (237), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 237 [2025-02-05 11:42:04,778 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-02-05 11:42:04,836 INFO L225 Difference]: With dead ends: 83497 [2025-02-05 11:42:04,837 INFO L226 Difference]: Without dead ends: 53941 [2025-02-05 11:42:04,862 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:42:04,865 INFO L435 NwaCegarLoop]: 1766 mSDtfsCounter, 879 mSDsluCounter, 135 mSDsCounter, 0 mSdLazyCounter, 2450 mSolverCounterSat, 804 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 2.4s Time, 0 mProtectedPredicate, 0 mProtectedAction, 879 SdHoareTripleChecker+Valid, 1901 SdHoareTripleChecker+Invalid, 3254 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 804 IncrementalHoareTripleChecker+Valid, 2450 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 2.8s IncrementalHoareTripleChecker+Time [2025-02-05 11:42:04,866 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [879 Valid, 1901 Invalid, 3254 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [804 Valid, 2450 Invalid, 0 Unknown, 0 Unchecked, 2.8s Time] [2025-02-05 11:42:04,898 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 53941 states. [2025-02-05 11:42:05,344 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 53941 to 50000. [2025-02-05 11:42:05,366 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 50000 states, 49999 states have (on average 1.114462289245785) internal successors, (55722), 49999 states have internal predecessors, (55722), 0 states have call successors, (0), 0 states 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:42:05,411 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 50000 states to 50000 states and 55722 transitions. [2025-02-05 11:42:05,412 INFO L78 Accepts]: Start accepts. Automaton has 50000 states and 55722 transitions. Word has length 237 [2025-02-05 11:42:05,412 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-02-05 11:42:05,412 INFO L471 AbstractCegarLoop]: Abstraction has 50000 states and 55722 transitions. [2025-02-05 11:42:05,412 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 79.0) internal successors, (237), 3 states have internal predecessors, (237), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-02-05 11:42:05,413 INFO L276 IsEmpty]: Start isEmpty. Operand 50000 states and 55722 transitions. [2025-02-05 11:42:05,414 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 258 [2025-02-05 11:42:05,414 INFO L210 NwaCegarLoop]: Found error trace [2025-02-05 11:42:05,415 INFO L218 NwaCegarLoop]: trace histogram [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, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-02-05 11:42:05,415 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable8 [2025-02-05 11:42:05,415 INFO L396 AbstractCegarLoop]: === Iteration 10 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-02-05 11:42:05,415 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-02-05 11:42:05,415 INFO L85 PathProgramCache]: Analyzing trace with hash -1053063183, now seen corresponding path program 1 times [2025-02-05 11:42:05,415 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-02-05 11:42:05,415 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1793678920] [2025-02-05 11:42:05,415 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-02-05 11:42:05,416 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-02-05 11:42:05,430 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 257 statements into 1 equivalence classes. [2025-02-05 11:42:05,441 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 257 of 257 statements. [2025-02-05 11:42:05,441 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-02-05 11:42:05,441 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-02-05 11:42:05,971 INFO L134 CoverageAnalysis]: Checked inductivity of 140 backedges. 30 proven. 110 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-02-05 11:42:05,971 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-02-05 11:42:05,971 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1793678920] [2025-02-05 11:42:05,971 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1793678920] provided 0 perfect and 1 imperfect interpolant sequences [2025-02-05 11:42:05,971 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [49505836] [2025-02-05 11:42:05,971 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-02-05 11:42:05,972 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-02-05 11:42:05,972 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 [2025-02-05 11:42:05,978 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:42:05,979 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:42:06,029 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 257 statements into 1 equivalence classes. [2025-02-05 11:42:06,076 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 257 of 257 statements. [2025-02-05 11:42:06,076 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-02-05 11:42:06,076 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-02-05 11:42:06,078 INFO L256 TraceCheckSpWp]: Trace formula consists of 365 conjuncts, 2 conjuncts are in the unsatisfiable core [2025-02-05 11:42:06,085 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-02-05 11:42:06,149 INFO L134 CoverageAnalysis]: Checked inductivity of 140 backedges. 27 proven. 0 refuted. 0 times theorem prover too weak. 113 trivial. 0 not checked. [2025-02-05 11:42:06,152 INFO L308 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2025-02-05 11:42:06,153 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [49505836] provided 1 perfect and 0 imperfect interpolant sequences [2025-02-05 11:42:06,153 INFO L185 FreeRefinementEngine]: Found 1 perfect and 1 imperfect interpolant sequences. [2025-02-05 11:42:06,153 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [5] total 7 [2025-02-05 11:42:06,153 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [714647541] [2025-02-05 11:42:06,153 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-02-05 11:42:06,153 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2025-02-05 11:42:06,153 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-02-05 11:42:06,153 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2025-02-05 11:42:06,153 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=14, Invalid=28, Unknown=0, NotChecked=0, Total=42 [2025-02-05 11:42:06,153 INFO L87 Difference]: Start difference. First operand 50000 states and 55722 transitions. Second operand has 3 states, 3 states have (on average 48.333333333333336) internal successors, (145), 3 states have internal predecessors, (145), 0 states have call successors, (0), 0 states 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:42:09,121 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-02-05 11:42:09,121 INFO L93 Difference]: Finished difference Result 99209 states and 110649 transitions. [2025-02-05 11:42:09,122 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2025-02-05 11:42:09,122 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 48.333333333333336) internal successors, (145), 3 states have internal predecessors, (145), 0 states have call successors, (0), 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 257 [2025-02-05 11:42:09,122 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-02-05 11:42:09,177 INFO L225 Difference]: With dead ends: 99209 [2025-02-05 11:42:09,177 INFO L226 Difference]: Without dead ends: 49998 [2025-02-05 11:42:09,206 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 261 GetRequests, 256 SyntacticMatches, 0 SemanticMatches, 5 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 3 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=14, Invalid=28, Unknown=0, NotChecked=0, Total=42 [2025-02-05 11:42:09,207 INFO L435 NwaCegarLoop]: 1351 mSDtfsCounter, 1187 mSDsluCounter, 82 mSDsCounter, 0 mSdLazyCounter, 2466 mSolverCounterSat, 443 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 2.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 1187 SdHoareTripleChecker+Valid, 1433 SdHoareTripleChecker+Invalid, 2909 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 443 IncrementalHoareTripleChecker+Valid, 2466 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 2.7s IncrementalHoareTripleChecker+Time [2025-02-05 11:42:09,207 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [1187 Valid, 1433 Invalid, 2909 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [443 Valid, 2466 Invalid, 0 Unknown, 0 Unchecked, 2.7s Time] [2025-02-05 11:42:09,238 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 49998 states. [2025-02-05 11:42:09,510 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 49998 to 49997. [2025-02-05 11:42:09,544 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 49997 states, 49996 states have (on average 1.0920673653892312) internal successors, (54599), 49996 states have internal predecessors, (54599), 0 states have call successors, (0), 0 states 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:42:09,753 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 49997 states to 49997 states and 54599 transitions. [2025-02-05 11:42:09,753 INFO L78 Accepts]: Start accepts. Automaton has 49997 states and 54599 transitions. Word has length 257 [2025-02-05 11:42:09,753 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-02-05 11:42:09,753 INFO L471 AbstractCegarLoop]: Abstraction has 49997 states and 54599 transitions. [2025-02-05 11:42:09,754 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 48.333333333333336) internal successors, (145), 3 states have internal predecessors, (145), 0 states have call successors, (0), 0 states 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:42:09,754 INFO L276 IsEmpty]: Start isEmpty. Operand 49997 states and 54599 transitions. [2025-02-05 11:42:09,757 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 346 [2025-02-05 11:42:09,757 INFO L210 NwaCegarLoop]: Found error trace [2025-02-05 11:42:09,757 INFO L218 NwaCegarLoop]: trace histogram [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, 4, 4, 4, 4, 4, 4, 3, 3, 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:42:09,768 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (2)] Ended with exit code 0 [2025-02-05 11:42:09,958 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 2 /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable9 [2025-02-05 11:42:09,958 INFO L396 AbstractCegarLoop]: === Iteration 11 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-02-05 11:42:09,959 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-02-05 11:42:09,959 INFO L85 PathProgramCache]: Analyzing trace with hash 868199512, now seen corresponding path program 1 times [2025-02-05 11:42:09,959 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-02-05 11:42:09,959 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1517730423] [2025-02-05 11:42:09,959 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-02-05 11:42:09,960 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-02-05 11:42:09,985 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 345 statements into 1 equivalence classes. [2025-02-05 11:42:10,011 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 345 of 345 statements. [2025-02-05 11:42:10,013 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-02-05 11:42:10,013 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-02-05 11:42:10,297 INFO L134 CoverageAnalysis]: Checked inductivity of 500 backedges. 55 proven. 0 refuted. 0 times theorem prover too weak. 445 trivial. 0 not checked. [2025-02-05 11:42:10,297 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-02-05 11:42:10,297 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1517730423] [2025-02-05 11:42:10,297 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1517730423] provided 1 perfect and 0 imperfect interpolant sequences [2025-02-05 11:42:10,297 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-02-05 11:42:10,297 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2025-02-05 11:42:10,297 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2057502525] [2025-02-05 11:42:10,298 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-02-05 11:42:10,298 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2025-02-05 11:42:10,298 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-02-05 11:42:10,298 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2025-02-05 11:42:10,298 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-02-05 11:42:10,298 INFO L87 Difference]: Start difference. First operand 49997 states and 54599 transitions. Second operand has 3 states, 3 states have (on average 38.666666666666664) internal successors, (116), 3 states have internal predecessors, (116), 0 states have call successors, (0), 0 states 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:42:14,036 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-02-05 11:42:14,037 INFO L93 Difference]: Finished difference Result 133084 states and 145720 transitions. [2025-02-05 11:42:14,037 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2025-02-05 11:42:14,037 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 38.666666666666664) internal successors, (116), 3 states have internal predecessors, (116), 0 states have call successors, (0), 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 345 [2025-02-05 11:42:14,037 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-02-05 11:42:14,126 INFO L225 Difference]: With dead ends: 133084 [2025-02-05 11:42:14,127 INFO L226 Difference]: Without dead ends: 83089 [2025-02-05 11:42:14,162 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:42:14,163 INFO L435 NwaCegarLoop]: 521 mSDtfsCounter, 988 mSDsluCounter, 151 mSDsCounter, 0 mSdLazyCounter, 2868 mSolverCounterSat, 530 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 2.9s Time, 0 mProtectedPredicate, 0 mProtectedAction, 988 SdHoareTripleChecker+Valid, 672 SdHoareTripleChecker+Invalid, 3398 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 530 IncrementalHoareTripleChecker+Valid, 2868 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 3.4s IncrementalHoareTripleChecker+Time [2025-02-05 11:42:14,163 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [988 Valid, 672 Invalid, 3398 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [530 Valid, 2868 Invalid, 0 Unknown, 0 Unchecked, 3.4s Time] [2025-02-05 11:42:14,220 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 83089 states. [2025-02-05 11:42:14,755 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 83089 to 81507. [2025-02-05 11:42:14,806 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 81507 states, 81506 states have (on average 1.0858096336466028) internal successors, (88500), 81506 states have internal predecessors, (88500), 0 states have call successors, (0), 0 states 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:42:14,893 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 81507 states to 81507 states and 88500 transitions. [2025-02-05 11:42:14,894 INFO L78 Accepts]: Start accepts. Automaton has 81507 states and 88500 transitions. Word has length 345 [2025-02-05 11:42:14,894 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-02-05 11:42:14,895 INFO L471 AbstractCegarLoop]: Abstraction has 81507 states and 88500 transitions. [2025-02-05 11:42:14,895 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 38.666666666666664) internal successors, (116), 3 states have internal predecessors, (116), 0 states have call successors, (0), 0 states 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:42:14,895 INFO L276 IsEmpty]: Start isEmpty. Operand 81507 states and 88500 transitions. [2025-02-05 11:42:14,903 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 408 [2025-02-05 11:42:14,903 INFO L210 NwaCegarLoop]: Found error trace [2025-02-05 11:42:14,904 INFO L218 NwaCegarLoop]: trace histogram [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, 3, 3, 3, 3, 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, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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:42:14,904 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable10 [2025-02-05 11:42:14,904 INFO L396 AbstractCegarLoop]: === Iteration 12 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-02-05 11:42:14,904 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-02-05 11:42:14,904 INFO L85 PathProgramCache]: Analyzing trace with hash -1370007450, now seen corresponding path program 1 times [2025-02-05 11:42:14,904 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-02-05 11:42:14,905 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [960731170] [2025-02-05 11:42:14,905 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-02-05 11:42:14,905 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-02-05 11:42:14,928 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 407 statements into 1 equivalence classes. [2025-02-05 11:42:15,069 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 407 of 407 statements. [2025-02-05 11:42:15,069 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-02-05 11:42:15,069 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-02-05 11:42:15,906 INFO L134 CoverageAnalysis]: Checked inductivity of 392 backedges. 268 proven. 110 refuted. 0 times theorem prover too weak. 14 trivial. 0 not checked. [2025-02-05 11:42:15,906 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-02-05 11:42:15,906 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [960731170] [2025-02-05 11:42:15,906 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [960731170] provided 0 perfect and 1 imperfect interpolant sequences [2025-02-05 11:42:15,906 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1209702809] [2025-02-05 11:42:15,906 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-02-05 11:42:15,906 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-02-05 11:42:15,907 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 [2025-02-05 11:42:15,910 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:42:15,910 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:42:15,957 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 407 statements into 1 equivalence classes. [2025-02-05 11:42:16,016 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 407 of 407 statements. [2025-02-05 11:42:16,016 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-02-05 11:42:16,016 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-02-05 11:42:16,018 INFO L256 TraceCheckSpWp]: Trace formula consists of 543 conjuncts, 2 conjuncts are in the unsatisfiable core [2025-02-05 11:42:16,025 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-02-05 11:42:16,081 INFO L134 CoverageAnalysis]: Checked inductivity of 392 backedges. 41 proven. 0 refuted. 0 times theorem prover too weak. 351 trivial. 0 not checked. [2025-02-05 11:42:16,081 INFO L308 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2025-02-05 11:42:16,081 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1209702809] provided 1 perfect and 0 imperfect interpolant sequences [2025-02-05 11:42:16,081 INFO L185 FreeRefinementEngine]: Found 1 perfect and 1 imperfect interpolant sequences. [2025-02-05 11:42:16,081 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [5] total 7 [2025-02-05 11:42:16,081 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [174465159] [2025-02-05 11:42:16,081 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-02-05 11:42:16,082 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2025-02-05 11:42:16,083 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-02-05 11:42:16,083 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2025-02-05 11:42:16,083 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=16, Invalid=26, Unknown=0, NotChecked=0, Total=42 [2025-02-05 11:42:16,083 INFO L87 Difference]: Start difference. First operand 81507 states and 88500 transitions. Second operand has 3 states, 3 states have (on average 57.0) internal successors, (171), 3 states have internal predecessors, (171), 0 states have call successors, (0), 0 states 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:42:19,525 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-02-05 11:42:19,525 INFO L93 Difference]: Finished difference Result 185040 states and 202085 transitions. [2025-02-05 11:42:19,525 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2025-02-05 11:42:19,525 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 57.0) internal successors, (171), 3 states have internal predecessors, (171), 0 states have call successors, (0), 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 407 [2025-02-05 11:42:19,526 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-02-05 11:42:19,680 INFO L225 Difference]: With dead ends: 185040 [2025-02-05 11:42:19,680 INFO L226 Difference]: Without dead ends: 112989 [2025-02-05 11:42:19,743 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 411 GetRequests, 406 SyntacticMatches, 0 SemanticMatches, 5 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=16, Invalid=26, Unknown=0, NotChecked=0, Total=42 [2025-02-05 11:42:19,743 INFO L435 NwaCegarLoop]: 514 mSDtfsCounter, 994 mSDsluCounter, 109 mSDsCounter, 0 mSdLazyCounter, 2659 mSolverCounterSat, 796 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 2.5s Time, 0 mProtectedPredicate, 0 mProtectedAction, 994 SdHoareTripleChecker+Valid, 623 SdHoareTripleChecker+Invalid, 3455 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 796 IncrementalHoareTripleChecker+Valid, 2659 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 2.9s IncrementalHoareTripleChecker+Time [2025-02-05 11:42:19,743 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [994 Valid, 623 Invalid, 3455 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [796 Valid, 2659 Invalid, 0 Unknown, 0 Unchecked, 2.9s Time] [2025-02-05 11:42:19,842 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 112989 states. [2025-02-05 11:42:20,552 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 112989 to 72032. [2025-02-05 11:42:20,596 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 72032 states, 72031 states have (on average 1.0863655925920783) internal successors, (78252), 72031 states have internal predecessors, (78252), 0 states have call successors, (0), 0 states 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:42:20,891 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 72032 states to 72032 states and 78252 transitions. [2025-02-05 11:42:20,892 INFO L78 Accepts]: Start accepts. Automaton has 72032 states and 78252 transitions. Word has length 407 [2025-02-05 11:42:20,892 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-02-05 11:42:20,893 INFO L471 AbstractCegarLoop]: Abstraction has 72032 states and 78252 transitions. [2025-02-05 11:42:20,893 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 57.0) internal successors, (171), 3 states have internal predecessors, (171), 0 states have call successors, (0), 0 states 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:42:20,893 INFO L276 IsEmpty]: Start isEmpty. Operand 72032 states and 78252 transitions. [2025-02-05 11:42:20,900 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 474 [2025-02-05 11:42:20,901 INFO L210 NwaCegarLoop]: Found error trace [2025-02-05 11:42:20,901 INFO L218 NwaCegarLoop]: trace histogram [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, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 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, 1, 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:42:20,907 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:42:21,101 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable11,3 /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-02-05 11:42:21,102 INFO L396 AbstractCegarLoop]: === Iteration 13 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-02-05 11:42:21,102 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-02-05 11:42:21,102 INFO L85 PathProgramCache]: Analyzing trace with hash 157845734, now seen corresponding path program 1 times [2025-02-05 11:42:21,103 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-02-05 11:42:21,103 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1893222728] [2025-02-05 11:42:21,103 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-02-05 11:42:21,103 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-02-05 11:42:21,128 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 473 statements into 1 equivalence classes. [2025-02-05 11:42:21,145 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 473 of 473 statements. [2025-02-05 11:42:21,145 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-02-05 11:42:21,145 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-02-05 11:42:21,575 INFO L134 CoverageAnalysis]: Checked inductivity of 429 backedges. 305 proven. 0 refuted. 0 times theorem prover too weak. 124 trivial. 0 not checked. [2025-02-05 11:42:21,575 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-02-05 11:42:21,575 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1893222728] [2025-02-05 11:42:21,575 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1893222728] provided 1 perfect and 0 imperfect interpolant sequences [2025-02-05 11:42:21,575 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-02-05 11:42:21,575 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2025-02-05 11:42:21,575 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [557164313] [2025-02-05 11:42:21,575 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-02-05 11:42:21,576 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2025-02-05 11:42:21,576 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-02-05 11:42:21,577 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2025-02-05 11:42:21,577 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-02-05 11:42:21,577 INFO L87 Difference]: Start difference. First operand 72032 states and 78252 transitions. Second operand has 3 states, 3 states have (on average 116.66666666666667) internal successors, (350), 3 states have internal predecessors, (350), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-02-05 11:42:24,631 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-02-05 11:42:24,631 INFO L93 Difference]: Finished difference Result 150342 states and 164240 transitions. [2025-02-05 11:42:24,631 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2025-02-05 11:42:24,631 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 116.66666666666667) internal successors, (350), 3 states have internal predecessors, (350), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 473 [2025-02-05 11:42:24,632 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-02-05 11:42:24,719 INFO L225 Difference]: With dead ends: 150342 [2025-02-05 11:42:24,720 INFO L226 Difference]: Without dead ends: 79099 [2025-02-05 11:42:24,763 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 6 GetRequests, 5 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:42:24,763 INFO L435 NwaCegarLoop]: 383 mSDtfsCounter, 1186 mSDsluCounter, 16 mSDsCounter, 0 mSdLazyCounter, 2264 mSolverCounterSat, 898 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 2.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 1186 SdHoareTripleChecker+Valid, 399 SdHoareTripleChecker+Invalid, 3162 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 898 IncrementalHoareTripleChecker+Valid, 2264 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 2.7s IncrementalHoareTripleChecker+Time [2025-02-05 11:42:24,763 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [1186 Valid, 399 Invalid, 3162 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [898 Valid, 2264 Invalid, 0 Unknown, 0 Unchecked, 2.7s Time] [2025-02-05 11:42:24,825 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 79099 states. [2025-02-05 11:42:25,600 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 79099 to 79099. [2025-02-05 11:42:25,655 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 79099 states, 79098 states have (on average 1.0887759488229791) internal successors, (86120), 79098 states have internal predecessors, (86120), 0 states have call successors, (0), 0 states 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:42:25,953 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 79099 states to 79099 states and 86120 transitions. [2025-02-05 11:42:25,954 INFO L78 Accepts]: Start accepts. Automaton has 79099 states and 86120 transitions. Word has length 473 [2025-02-05 11:42:25,954 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-02-05 11:42:25,954 INFO L471 AbstractCegarLoop]: Abstraction has 79099 states and 86120 transitions. [2025-02-05 11:42:25,954 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 116.66666666666667) internal successors, (350), 3 states have internal predecessors, (350), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-02-05 11:42:25,955 INFO L276 IsEmpty]: Start isEmpty. Operand 79099 states and 86120 transitions. [2025-02-05 11:42:25,962 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 490 [2025-02-05 11:42:25,962 INFO L210 NwaCegarLoop]: Found error trace [2025-02-05 11:42:25,963 INFO L218 NwaCegarLoop]: trace histogram [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, 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, 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] [2025-02-05 11:42:25,963 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable12 [2025-02-05 11:42:25,963 INFO L396 AbstractCegarLoop]: === Iteration 14 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-02-05 11:42:25,963 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-02-05 11:42:25,963 INFO L85 PathProgramCache]: Analyzing trace with hash 739807804, now seen corresponding path program 1 times [2025-02-05 11:42:25,963 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-02-05 11:42:25,963 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1223004943] [2025-02-05 11:42:25,964 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-02-05 11:42:25,964 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-02-05 11:42:25,988 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 489 statements into 1 equivalence classes. [2025-02-05 11:42:25,998 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 489 of 489 statements. [2025-02-05 11:42:25,998 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-02-05 11:42:25,998 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-02-05 11:42:27,029 INFO L134 CoverageAnalysis]: Checked inductivity of 621 backedges. 408 proven. 113 refuted. 0 times theorem prover too weak. 100 trivial. 0 not checked. [2025-02-05 11:42:27,029 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-02-05 11:42:27,029 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1223004943] [2025-02-05 11:42:27,029 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1223004943] provided 0 perfect and 1 imperfect interpolant sequences [2025-02-05 11:42:27,029 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1359907272] [2025-02-05 11:42:27,029 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-02-05 11:42:27,029 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-02-05 11:42:27,030 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 [2025-02-05 11:42:27,037 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:42:27,043 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:42:27,132 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 489 statements into 1 equivalence classes. [2025-02-05 11:42:27,259 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 489 of 489 statements. [2025-02-05 11:42:27,260 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-02-05 11:42:27,260 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-02-05 11:42:27,262 INFO L256 TraceCheckSpWp]: Trace formula consists of 655 conjuncts, 2 conjuncts are in the unsatisfiable core [2025-02-05 11:42:27,270 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-02-05 11:42:27,400 INFO L134 CoverageAnalysis]: Checked inductivity of 621 backedges. 494 proven. 0 refuted. 0 times theorem prover too weak. 127 trivial. 0 not checked. [2025-02-05 11:42:27,404 INFO L308 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2025-02-05 11:42:27,405 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1359907272] provided 1 perfect and 0 imperfect interpolant sequences [2025-02-05 11:42:27,405 INFO L185 FreeRefinementEngine]: Found 1 perfect and 1 imperfect interpolant sequences. [2025-02-05 11:42:27,405 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [7] total 9 [2025-02-05 11:42:27,405 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2074515296] [2025-02-05 11:42:27,405 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-02-05 11:42:27,405 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2025-02-05 11:42:27,405 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-02-05 11:42:27,406 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2025-02-05 11:42:27,406 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=22, Invalid=50, Unknown=0, NotChecked=0, Total=72 [2025-02-05 11:42:27,406 INFO L87 Difference]: Start difference. First operand 79099 states and 86120 transitions. Second operand has 3 states, 3 states have (on average 121.33333333333333) internal successors, (364), 3 states have internal predecessors, (364), 0 states have call successors, (0), 0 states 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:42:30,250 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-02-05 11:42:30,250 INFO L93 Difference]: Finished difference Result 157399 states and 171437 transitions. [2025-02-05 11:42:30,251 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2025-02-05 11:42:30,251 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 121.33333333333333) internal successors, (364), 3 states have internal predecessors, (364), 0 states have call successors, (0), 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 489 [2025-02-05 11:42:30,251 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-02-05 11:42:30,352 INFO L225 Difference]: With dead ends: 157399 [2025-02-05 11:42:30,353 INFO L226 Difference]: Without dead ends: 79089 [2025-02-05 11:42:30,402 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 495 GetRequests, 488 SyntacticMatches, 0 SemanticMatches, 7 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 7 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=22, Invalid=50, Unknown=0, NotChecked=0, Total=72 [2025-02-05 11:42:30,403 INFO L435 NwaCegarLoop]: 656 mSDtfsCounter, 1052 mSDsluCounter, 125 mSDsCounter, 0 mSdLazyCounter, 2376 mSolverCounterSat, 521 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 2.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 1052 SdHoareTripleChecker+Valid, 781 SdHoareTripleChecker+Invalid, 2897 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 521 IncrementalHoareTripleChecker+Valid, 2376 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 2.5s IncrementalHoareTripleChecker+Time [2025-02-05 11:42:30,403 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [1052 Valid, 781 Invalid, 2897 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [521 Valid, 2376 Invalid, 0 Unknown, 0 Unchecked, 2.5s Time] [2025-02-05 11:42:30,463 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 79089 states. [2025-02-05 11:42:31,003 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 79089 to 75938. [2025-02-05 11:42:31,048 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 75938 states, 75937 states have (on average 1.065712366830399) internal successors, (80927), 75937 states have internal predecessors, (80927), 0 states have call successors, (0), 0 states 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:42:31,115 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 75938 states to 75938 states and 80927 transitions. [2025-02-05 11:42:31,116 INFO L78 Accepts]: Start accepts. Automaton has 75938 states and 80927 transitions. Word has length 489 [2025-02-05 11:42:31,117 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-02-05 11:42:31,117 INFO L471 AbstractCegarLoop]: Abstraction has 75938 states and 80927 transitions. [2025-02-05 11:42:31,117 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 121.33333333333333) internal successors, (364), 3 states have internal predecessors, (364), 0 states have call successors, (0), 0 states 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:42:31,117 INFO L276 IsEmpty]: Start isEmpty. Operand 75938 states and 80927 transitions. [2025-02-05 11:42:31,129 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 593 [2025-02-05 11:42:31,129 INFO L210 NwaCegarLoop]: Found error trace [2025-02-05 11:42:31,129 INFO L218 NwaCegarLoop]: trace histogram [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, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 3, 3, 3, 3, 3, 3, 3, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-02-05 11:42:31,136 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:42:31,334 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable13,4 /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-02-05 11:42:31,334 INFO L396 AbstractCegarLoop]: === Iteration 15 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-02-05 11:42:31,335 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-02-05 11:42:31,336 INFO L85 PathProgramCache]: Analyzing trace with hash 428618674, now seen corresponding path program 1 times [2025-02-05 11:42:31,336 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-02-05 11:42:31,336 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [273616180] [2025-02-05 11:42:31,336 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-02-05 11:42:31,336 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-02-05 11:42:31,371 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 592 statements into 1 equivalence classes. [2025-02-05 11:42:31,390 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 592 of 592 statements. [2025-02-05 11:42:31,390 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-02-05 11:42:31,390 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-02-05 11:42:31,638 INFO L134 CoverageAnalysis]: Checked inductivity of 572 backedges. 470 proven. 0 refuted. 0 times theorem prover too weak. 102 trivial. 0 not checked. [2025-02-05 11:42:31,638 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-02-05 11:42:31,638 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [273616180] [2025-02-05 11:42:31,638 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [273616180] provided 1 perfect and 0 imperfect interpolant sequences [2025-02-05 11:42:31,638 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-02-05 11:42:31,638 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2025-02-05 11:42:31,638 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1181542177] [2025-02-05 11:42:31,639 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-02-05 11:42:31,639 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2025-02-05 11:42:31,639 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-02-05 11:42:31,640 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2025-02-05 11:42:31,640 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-02-05 11:42:31,640 INFO L87 Difference]: Start difference. First operand 75938 states and 80927 transitions. Second operand has 3 states, 3 states have (on average 164.0) internal successors, (492), 3 states have internal predecessors, (492), 0 states have call successors, (0), 0 states 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:42:34,967 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-02-05 11:42:34,967 INFO L93 Difference]: Finished difference Result 170761 states and 182539 transitions. [2025-02-05 11:42:34,968 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2025-02-05 11:42:34,968 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 164.0) internal successors, (492), 3 states have internal predecessors, (492), 0 states have call successors, (0), 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 592 [2025-02-05 11:42:34,968 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-02-05 11:42:35,064 INFO L225 Difference]: With dead ends: 170761 [2025-02-05 11:42:35,064 INFO L226 Difference]: Without dead ends: 95612 [2025-02-05 11:42:35,096 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:42:35,096 INFO L435 NwaCegarLoop]: 699 mSDtfsCounter, 924 mSDsluCounter, 78 mSDsCounter, 0 mSdLazyCounter, 2378 mSolverCounterSat, 772 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 2.4s Time, 0 mProtectedPredicate, 0 mProtectedAction, 924 SdHoareTripleChecker+Valid, 777 SdHoareTripleChecker+Invalid, 3150 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 772 IncrementalHoareTripleChecker+Valid, 2378 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 2.9s IncrementalHoareTripleChecker+Time [2025-02-05 11:42:35,097 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [924 Valid, 777 Invalid, 3150 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [772 Valid, 2378 Invalid, 0 Unknown, 0 Unchecked, 2.9s Time] [2025-02-05 11:42:35,162 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 95612 states. [2025-02-05 11:42:36,019 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 95612 to 94026. [2025-02-05 11:42:36,082 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 94026 states, 94025 states have (on average 1.0585376229726136) internal successors, (99529), 94025 states have internal predecessors, (99529), 0 states have call successors, (0), 0 states 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:42:36,202 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 94026 states to 94026 states and 99529 transitions. [2025-02-05 11:42:36,203 INFO L78 Accepts]: Start accepts. Automaton has 94026 states and 99529 transitions. Word has length 592 [2025-02-05 11:42:36,203 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-02-05 11:42:36,203 INFO L471 AbstractCegarLoop]: Abstraction has 94026 states and 99529 transitions. [2025-02-05 11:42:36,204 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 164.0) internal successors, (492), 3 states have internal predecessors, (492), 0 states have call successors, (0), 0 states 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:42:36,204 INFO L276 IsEmpty]: Start isEmpty. Operand 94026 states and 99529 transitions. [2025-02-05 11:42:36,234 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 699 [2025-02-05 11:42:36,234 INFO L210 NwaCegarLoop]: Found error trace [2025-02-05 11:42:36,234 INFO L218 NwaCegarLoop]: trace histogram [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, 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, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 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] [2025-02-05 11:42:36,235 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable14 [2025-02-05 11:42:36,235 INFO L396 AbstractCegarLoop]: === Iteration 16 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-02-05 11:42:36,235 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-02-05 11:42:36,235 INFO L85 PathProgramCache]: Analyzing trace with hash -999205923, now seen corresponding path program 1 times [2025-02-05 11:42:36,235 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-02-05 11:42:36,236 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [799582577] [2025-02-05 11:42:36,236 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-02-05 11:42:36,236 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-02-05 11:42:36,300 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 698 statements into 1 equivalence classes. [2025-02-05 11:42:36,473 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 698 of 698 statements. [2025-02-05 11:42:36,473 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-02-05 11:42:36,473 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-02-05 11:42:36,634 INFO L134 CoverageAnalysis]: Checked inductivity of 714 backedges. 576 proven. 0 refuted. 0 times theorem prover too weak. 138 trivial. 0 not checked. [2025-02-05 11:42:36,634 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-02-05 11:42:36,634 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [799582577] [2025-02-05 11:42:36,635 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [799582577] provided 1 perfect and 0 imperfect interpolant sequences [2025-02-05 11:42:36,635 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-02-05 11:42:36,635 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2025-02-05 11:42:36,635 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1725247121] [2025-02-05 11:42:36,635 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-02-05 11:42:36,635 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2025-02-05 11:42:36,635 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-02-05 11:42:36,636 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2025-02-05 11:42:36,636 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-02-05 11:42:36,636 INFO L87 Difference]: Start difference. First operand 94026 states and 99529 transitions. Second operand has 3 states, 3 states have (on average 187.33333333333334) internal successors, (562), 3 states have internal predecessors, (562), 0 states have call successors, (0), 0 states 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:42:39,194 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-02-05 11:42:39,194 INFO L93 Difference]: Finished difference Result 206157 states and 218933 transitions. [2025-02-05 11:42:39,195 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2025-02-05 11:42:39,195 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 187.33333333333334) internal successors, (562), 3 states have internal predecessors, (562), 0 states have call successors, (0), 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 698 [2025-02-05 11:42:39,195 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-02-05 11:42:39,326 INFO L225 Difference]: With dead ends: 206157 [2025-02-05 11:42:39,327 INFO L226 Difference]: Without dead ends: 112920 [2025-02-05 11:42:39,385 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:42:39,385 INFO L435 NwaCegarLoop]: 1764 mSDtfsCounter, 767 mSDsluCounter, 133 mSDsCounter, 0 mSdLazyCounter, 2498 mSolverCounterSat, 438 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 1.8s Time, 0 mProtectedPredicate, 0 mProtectedAction, 767 SdHoareTripleChecker+Valid, 1897 SdHoareTripleChecker+Invalid, 2936 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 438 IncrementalHoareTripleChecker+Valid, 2498 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 2.1s IncrementalHoareTripleChecker+Time [2025-02-05 11:42:39,385 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [767 Valid, 1897 Invalid, 2936 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [438 Valid, 2498 Invalid, 0 Unknown, 0 Unchecked, 2.1s Time] [2025-02-05 11:42:39,469 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 112920 states. [2025-02-05 11:42:40,563 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 112920 to 111339. [2025-02-05 11:42:40,620 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 111339 states, 111338 states have (on average 1.0557222152364871) internal successors, (117542), 111338 states have internal predecessors, (117542), 0 states have call successors, (0), 0 states 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:42:40,915 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 111339 states to 111339 states and 117542 transitions. [2025-02-05 11:42:40,916 INFO L78 Accepts]: Start accepts. Automaton has 111339 states and 117542 transitions. Word has length 698 [2025-02-05 11:42:40,916 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-02-05 11:42:40,916 INFO L471 AbstractCegarLoop]: Abstraction has 111339 states and 117542 transitions. [2025-02-05 11:42:40,917 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 187.33333333333334) internal successors, (562), 3 states have internal predecessors, (562), 0 states have call successors, (0), 0 states 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:42:40,917 INFO L276 IsEmpty]: Start isEmpty. Operand 111339 states and 117542 transitions. [2025-02-05 11:42:40,946 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 757 [2025-02-05 11:42:40,946 INFO L210 NwaCegarLoop]: Found error trace [2025-02-05 11:42:40,946 INFO L218 NwaCegarLoop]: trace histogram [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, 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, 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, 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, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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:42:40,947 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable15 [2025-02-05 11:42:40,947 INFO L396 AbstractCegarLoop]: === Iteration 17 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-02-05 11:42:40,947 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-02-05 11:42:40,947 INFO L85 PathProgramCache]: Analyzing trace with hash -1067565421, now seen corresponding path program 1 times [2025-02-05 11:42:40,947 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-02-05 11:42:40,947 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1931171354] [2025-02-05 11:42:40,948 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-02-05 11:42:40,948 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-02-05 11:42:40,987 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 756 statements into 1 equivalence classes. [2025-02-05 11:42:41,014 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 756 of 756 statements. [2025-02-05 11:42:41,014 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-02-05 11:42:41,014 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-02-05 11:42:41,376 INFO L134 CoverageAnalysis]: Checked inductivity of 1064 backedges. 495 proven. 0 refuted. 0 times theorem prover too weak. 569 trivial. 0 not checked. [2025-02-05 11:42:41,377 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-02-05 11:42:41,377 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1931171354] [2025-02-05 11:42:41,377 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1931171354] provided 1 perfect and 0 imperfect interpolant sequences [2025-02-05 11:42:41,377 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-02-05 11:42:41,377 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2025-02-05 11:42:41,377 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1697781932] [2025-02-05 11:42:41,377 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-02-05 11:42:41,378 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2025-02-05 11:42:41,378 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-02-05 11:42:41,378 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2025-02-05 11:42:41,378 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2025-02-05 11:42:41,379 INFO L87 Difference]: Start difference. First operand 111339 states and 117542 transitions. Second operand has 4 states, 4 states have (on average 115.5) internal successors, (462), 4 states have internal predecessors, (462), 0 states have call successors, (0), 0 states 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:42:47,856 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-02-05 11:42:47,857 INFO L93 Difference]: Finished difference Result 275520 states and 290988 transitions. [2025-02-05 11:42:47,857 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2025-02-05 11:42:47,857 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 4 states have (on average 115.5) internal successors, (462), 4 states have internal predecessors, (462), 0 states have call successors, (0), 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 756 [2025-02-05 11:42:47,857 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-02-05 11:42:48,027 INFO L225 Difference]: With dead ends: 275520 [2025-02-05 11:42:48,027 INFO L226 Difference]: Without dead ends: 164183 [2025-02-05 11:42:48,058 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 4 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 2 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2025-02-05 11:42:48,059 INFO L435 NwaCegarLoop]: 1466 mSDtfsCounter, 1490 mSDsluCounter, 241 mSDsCounter, 0 mSdLazyCounter, 7927 mSolverCounterSat, 971 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 4.9s Time, 0 mProtectedPredicate, 0 mProtectedAction, 1490 SdHoareTripleChecker+Valid, 1707 SdHoareTripleChecker+Invalid, 8898 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 971 IncrementalHoareTripleChecker+Valid, 7927 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 5.7s IncrementalHoareTripleChecker+Time [2025-02-05 11:42:48,059 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [1490 Valid, 1707 Invalid, 8898 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [971 Valid, 7927 Invalid, 0 Unknown, 0 Unchecked, 5.7s Time] [2025-02-05 11:42:48,173 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 164183 states. [2025-02-05 11:42:49,304 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 164183 to 160153. [2025-02-05 11:42:49,408 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 160153 states, 160152 states have (on average 1.0516009790698837) internal successors, (168416), 160152 states have internal predecessors, (168416), 0 states have call successors, (0), 0 states 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:42:49,565 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 160153 states to 160153 states and 168416 transitions. [2025-02-05 11:42:49,566 INFO L78 Accepts]: Start accepts. Automaton has 160153 states and 168416 transitions. Word has length 756 [2025-02-05 11:42:49,567 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-02-05 11:42:49,567 INFO L471 AbstractCegarLoop]: Abstraction has 160153 states and 168416 transitions. [2025-02-05 11:42:49,568 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 115.5) internal successors, (462), 4 states have internal predecessors, (462), 0 states have call successors, (0), 0 states 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:42:49,568 INFO L276 IsEmpty]: Start isEmpty. Operand 160153 states and 168416 transitions. [2025-02-05 11:42:49,606 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 789 [2025-02-05 11:42:49,607 INFO L210 NwaCegarLoop]: Found error trace [2025-02-05 11:42:49,607 INFO L218 NwaCegarLoop]: trace histogram [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, 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, 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, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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:42:49,607 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable16 [2025-02-05 11:42:49,607 INFO L396 AbstractCegarLoop]: === Iteration 18 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-02-05 11:42:49,608 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-02-05 11:42:49,608 INFO L85 PathProgramCache]: Analyzing trace with hash 165409760, now seen corresponding path program 1 times [2025-02-05 11:42:49,608 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-02-05 11:42:49,608 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1415614068] [2025-02-05 11:42:49,608 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-02-05 11:42:49,608 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-02-05 11:42:49,659 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 788 statements into 1 equivalence classes. [2025-02-05 11:42:49,670 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 788 of 788 statements. [2025-02-05 11:42:49,670 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-02-05 11:42:49,670 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-02-05 11:42:51,739 INFO L134 CoverageAnalysis]: Checked inductivity of 866 backedges. 503 proven. 113 refuted. 0 times theorem prover too weak. 250 trivial. 0 not checked. [2025-02-05 11:42:51,740 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-02-05 11:42:51,740 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1415614068] [2025-02-05 11:42:51,740 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1415614068] provided 0 perfect and 1 imperfect interpolant sequences [2025-02-05 11:42:51,740 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [79215853] [2025-02-05 11:42:51,740 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-02-05 11:42:51,740 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-02-05 11:42:51,740 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 [2025-02-05 11:42:51,743 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:42:51,744 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:42:51,816 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 788 statements into 1 equivalence classes. [2025-02-05 11:42:51,924 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 788 of 788 statements. [2025-02-05 11:42:51,924 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-02-05 11:42:51,924 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-02-05 11:42:51,928 INFO L256 TraceCheckSpWp]: Trace formula consists of 957 conjuncts, 3 conjuncts are in the unsatisfiable core [2025-02-05 11:42:51,934 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-02-05 11:42:51,973 INFO L134 CoverageAnalysis]: Checked inductivity of 866 backedges. 503 proven. 0 refuted. 0 times theorem prover too weak. 363 trivial. 0 not checked. [2025-02-05 11:42:51,973 INFO L308 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2025-02-05 11:42:51,973 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [79215853] provided 1 perfect and 0 imperfect interpolant sequences [2025-02-05 11:42:51,973 INFO L185 FreeRefinementEngine]: Found 1 perfect and 1 imperfect interpolant sequences. [2025-02-05 11:42:51,973 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [7] total 9 [2025-02-05 11:42:51,973 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [192473399] [2025-02-05 11:42:51,973 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-02-05 11:42:51,974 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2025-02-05 11:42:51,974 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-02-05 11:42:51,974 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2025-02-05 11:42:51,974 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=22, Invalid=50, Unknown=0, NotChecked=0, Total=72 [2025-02-05 11:42:51,975 INFO L87 Difference]: Start difference. First operand 160153 states and 168416 transitions. Second operand has 3 states, 3 states have (on average 147.33333333333334) internal successors, (442), 3 states have internal predecessors, (442), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0)