./Ultimate.py --spec ../sv-benchmarks/c/properties/unreach-call.prp --file ../sv-benchmarks/c/hardware-verification-bv/btor2c-lazyMod.vis_arrays_palu.c --full-output --architecture 64bit -------------------------------------------------------------------------------- Checking for ERROR reachability Using default analysis Version c00e63dc Calling Ultimate with: /root/.sdkman/candidates/java/21.0.5-tem/bin/java -Dosgi.configuration.area=/storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/data/config -Xmx15G -Xms4m -jar /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/plugins/org.eclipse.equinox.launcher_1.6.800.v20240513-1750.jar -data @noDefault -ultimatedata /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/data -tc /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/config/AutomizerReach.xml -i ../sv-benchmarks/c/hardware-verification-bv/btor2c-lazyMod.vis_arrays_palu.c -s /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/config/svcomp-Reach-64bit-Automizer_Default.epf --cacsl2boogietranslator.entry.function main --witnessprinter.witness.directory /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux --witnessprinter.witness.filename witness --witnessprinter.write.witness.besides.input.file false --witnessprinter.graph.data.specification CHECK( init(main()), LTL(G ! call(reach_error())) ) --witnessprinter.graph.data.producer Automizer --witnessprinter.graph.data.architecture 64bit --witnessprinter.graph.data.programhash 7bfb32b49701ea1484553c69a9c6c976094bd0d4ca4d5ea9d4d30cdc2f2571dd --- Real Ultimate output --- This is Ultimate 0.3.0-?-c00e63d-m [2025-02-05 20:13:36,366 INFO L188 SettingsManager]: Resetting all preferences to default values... [2025-02-05 20:13:36,424 INFO L114 SettingsManager]: Loading settings from /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/config/svcomp-Reach-64bit-Automizer_Default.epf [2025-02-05 20:13:36,429 WARN L101 SettingsManager]: Preference file contains the following unknown settings: [2025-02-05 20:13:36,429 WARN L103 SettingsManager]: * de.uni_freiburg.informatik.ultimate.core.Log level for class [2025-02-05 20:13:36,449 INFO L130 SettingsManager]: Preferences different from defaults after loading the file: [2025-02-05 20:13:36,451 INFO L151 SettingsManager]: Preferences of UltimateCore differ from their defaults: [2025-02-05 20:13:36,451 INFO L153 SettingsManager]: * Log level for class=de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher=ERROR; [2025-02-05 20:13:36,451 INFO L151 SettingsManager]: Preferences of Boogie Preprocessor differ from their defaults: [2025-02-05 20:13:36,451 INFO L153 SettingsManager]: * Use memory slicer=true [2025-02-05 20:13:36,452 INFO L151 SettingsManager]: Preferences of Boogie Procedure Inliner differ from their defaults: [2025-02-05 20:13:36,452 INFO L153 SettingsManager]: * Ignore calls to procedures called more than once=ONLY_FOR_SEQUENTIAL_PROGRAMS [2025-02-05 20:13:36,452 INFO L151 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2025-02-05 20:13:36,452 INFO L153 SettingsManager]: * Create parallel compositions if possible=false [2025-02-05 20:13:36,453 INFO L153 SettingsManager]: * Use SBE=true [2025-02-05 20:13:36,453 INFO L151 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2025-02-05 20:13:36,453 INFO L153 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2025-02-05 20:13:36,453 INFO L153 SettingsManager]: * Overapproximate operations on floating types=true [2025-02-05 20:13:36,454 INFO L153 SettingsManager]: * Check division by zero=IGNORE [2025-02-05 20:13:36,454 INFO L153 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2025-02-05 20:13:36,454 INFO L153 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2025-02-05 20:13:36,454 INFO L153 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2025-02-05 20:13:36,454 INFO L153 SettingsManager]: * Check if freed pointer was valid=false [2025-02-05 20:13:36,454 INFO L153 SettingsManager]: * Behaviour of calls to undefined functions=OVERAPPROXIMATE_BEHAVIOUR [2025-02-05 20:13:36,454 INFO L153 SettingsManager]: * Use constant arrays=true [2025-02-05 20:13:36,454 INFO L151 SettingsManager]: Preferences of IcfgBuilder differ from their defaults: [2025-02-05 20:13:36,454 INFO L153 SettingsManager]: * Size of a code block=SequenceOfStatements [2025-02-05 20:13:36,454 INFO L153 SettingsManager]: * Only consider context switches at boundaries of atomic blocks=true [2025-02-05 20:13:36,454 INFO L153 SettingsManager]: * SMT solver=External_DefaultMode [2025-02-05 20:13:36,454 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2025-02-05 20:13:36,455 INFO L151 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2025-02-05 20:13:36,455 INFO L153 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2025-02-05 20:13:36,455 INFO L153 SettingsManager]: * Compute procedure contracts=false [2025-02-05 20:13:36,455 INFO L153 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopHeads [2025-02-05 20:13:36,455 INFO L153 SettingsManager]: * Trace refinement strategy=CAMEL [2025-02-05 20:13:36,455 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2025-02-05 20:13:36,455 INFO L153 SettingsManager]: * Apply one-shot large block encoding in concurrent analysis=false [2025-02-05 20:13:36,455 INFO L153 SettingsManager]: * Automaton type used in concurrency analysis=PETRI_NET [2025-02-05 20:13:36,455 INFO L153 SettingsManager]: * Order on configurations for Petri net unfoldings=DBO [2025-02-05 20:13:36,456 INFO L153 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode [2025-02-05 20:13:36,456 INFO L153 SettingsManager]: * Looper check in Petri net analysis=SEMANTIC Applying setting for plugin de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator: Entry function -> main Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Witness directory -> /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Witness filename -> witness Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Write witness besides input file -> false Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Graph data specification -> CHECK( init(main()), LTL(G ! call(reach_error())) ) Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Graph data producer -> Automizer Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Graph data architecture -> 64bit Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Graph data programhash -> 7bfb32b49701ea1484553c69a9c6c976094bd0d4ca4d5ea9d4d30cdc2f2571dd [2025-02-05 20:13:36,691 INFO L75 nceAwareModelManager]: Repository-Root is: /tmp [2025-02-05 20:13:36,696 INFO L261 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2025-02-05 20:13:36,699 INFO L217 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2025-02-05 20:13:36,699 INFO L270 PluginConnector]: Initializing CDTParser... [2025-02-05 20:13:36,700 INFO L274 PluginConnector]: CDTParser initialized [2025-02-05 20:13:36,701 INFO L431 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/../sv-benchmarks/c/hardware-verification-bv/btor2c-lazyMod.vis_arrays_palu.c [2025-02-05 20:13:37,898 INFO L533 CDTParser]: Created temporary CDT project at /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/data/c1c446471/5ddee8f1d1f64e658b1b9be7acf98332/FLAG8adfba34a [2025-02-05 20:13:38,231 INFO L384 CDTParser]: Found 1 translation units. [2025-02-05 20:13:38,232 INFO L180 CDTParser]: Scanning /storage/repos/ultimate-jdk21/releaseScripts/default/sv-benchmarks/c/hardware-verification-bv/btor2c-lazyMod.vis_arrays_palu.c [2025-02-05 20:13:38,242 INFO L427 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/data/c1c446471/5ddee8f1d1f64e658b1b9be7acf98332/FLAG8adfba34a [2025-02-05 20:13:38,459 INFO L435 CDTParser]: Successfully deleted /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/data/c1c446471/5ddee8f1d1f64e658b1b9be7acf98332 [2025-02-05 20:13:38,461 INFO L299 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2025-02-05 20:13:38,462 INFO L133 ToolchainWalker]: Walking toolchain with 6 elements. [2025-02-05 20:13:38,463 INFO L112 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2025-02-05 20:13:38,463 INFO L270 PluginConnector]: Initializing CACSL2BoogieTranslator... [2025-02-05 20:13:38,466 INFO L274 PluginConnector]: CACSL2BoogieTranslator initialized [2025-02-05 20:13:38,467 INFO L184 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 05.02 08:13:38" (1/1) ... [2025-02-05 20:13:38,468 INFO L204 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@11b873d4 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 05.02 08:13:38, skipping insertion in model container [2025-02-05 20:13:38,469 INFO L184 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 05.02 08:13:38" (1/1) ... [2025-02-05 20:13:38,492 INFO L175 MainTranslator]: Built tables and reachable declarations [2025-02-05 20:13:38,610 WARN L250 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate-jdk21/releaseScripts/default/sv-benchmarks/c/hardware-verification-bv/btor2c-lazyMod.vis_arrays_palu.c[1255,1268] [2025-02-05 20:13:38,728 INFO L210 PostProcessor]: Analyzing one entry point: main [2025-02-05 20:13:38,736 INFO L200 MainTranslator]: Completed pre-run [2025-02-05 20:13:38,743 WARN L250 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate-jdk21/releaseScripts/default/sv-benchmarks/c/hardware-verification-bv/btor2c-lazyMod.vis_arrays_palu.c[1255,1268] [2025-02-05 20:13:38,827 INFO L210 PostProcessor]: Analyzing one entry point: main [2025-02-05 20:13:38,846 INFO L204 MainTranslator]: Completed translation [2025-02-05 20:13:38,846 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 05.02 08:13:38 WrapperNode [2025-02-05 20:13:38,847 INFO L131 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2025-02-05 20:13:38,847 INFO L112 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2025-02-05 20:13:38,847 INFO L270 PluginConnector]: Initializing Boogie Procedure Inliner... [2025-02-05 20:13:38,847 INFO L274 PluginConnector]: Boogie Procedure Inliner initialized [2025-02-05 20:13:38,852 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 05.02 08:13:38" (1/1) ... [2025-02-05 20:13:38,876 INFO L184 PluginConnector]: Executing the observer Inliner from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 05.02 08:13:38" (1/1) ... [2025-02-05 20:13:38,957 INFO L138 Inliner]: procedures = 17, calls = 8, calls flagged for inlining = 3, calls inlined = 3, statements flattened = 1243 [2025-02-05 20:13:38,957 INFO L131 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2025-02-05 20:13:38,958 INFO L112 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2025-02-05 20:13:38,958 INFO L270 PluginConnector]: Initializing Boogie Preprocessor... [2025-02-05 20:13:38,958 INFO L274 PluginConnector]: Boogie Preprocessor initialized [2025-02-05 20:13:38,964 INFO L184 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 05.02 08:13:38" (1/1) ... [2025-02-05 20:13:38,964 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 05.02 08:13:38" (1/1) ... [2025-02-05 20:13:38,978 INFO L184 PluginConnector]: Executing the observer MemorySlicer from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 05.02 08:13:38" (1/1) ... [2025-02-05 20:13:39,009 INFO L175 MemorySlicer]: Split 2 memory accesses to 1 slices as follows [2]. 100 percent of accesses are in the largest equivalence class. The 2 initializations are split as follows [2]. The 0 writes are split as follows [0]. [2025-02-05 20:13:39,009 INFO L184 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 05.02 08:13:38" (1/1) ... [2025-02-05 20:13:39,009 INFO L184 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 05.02 08:13:38" (1/1) ... [2025-02-05 20:13:39,033 INFO L184 PluginConnector]: Executing the observer ReplaceArrayAssignments from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 05.02 08:13:38" (1/1) ... [2025-02-05 20:13:39,040 INFO L184 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 05.02 08:13:38" (1/1) ... [2025-02-05 20:13:39,049 INFO L184 PluginConnector]: Executing the observer LTLStepAnnotator from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 05.02 08:13:38" (1/1) ... [2025-02-05 20:13:39,056 INFO L184 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 05.02 08:13:38" (1/1) ... [2025-02-05 20:13:39,072 INFO L131 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2025-02-05 20:13:39,074 INFO L112 PluginConnector]: ------------------------IcfgBuilder---------------------------- [2025-02-05 20:13:39,074 INFO L270 PluginConnector]: Initializing IcfgBuilder... [2025-02-05 20:13:39,074 INFO L274 PluginConnector]: IcfgBuilder initialized [2025-02-05 20:13:39,075 INFO L184 PluginConnector]: Executing the observer IcfgBuilderObserver from plugin IcfgBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 05.02 08:13:38" (1/1) ... [2025-02-05 20:13:39,079 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2025-02-05 20:13:39,090 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 [2025-02-05 20:13:39,102 INFO L229 MonitoredProcess]: Starting monitored process 1 with /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 (exit command is (exit), workingDir is null) [2025-02-05 20:13:39,108 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 (1)] Waiting until timeout for monitored process [2025-02-05 20:13:39,126 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocInit [2025-02-05 20:13:39,126 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int#0 [2025-02-05 20:13:39,126 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2025-02-05 20:13:39,126 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2025-02-05 20:13:39,283 INFO L257 CfgBuilder]: Building ICFG [2025-02-05 20:13:39,284 INFO L287 CfgBuilder]: Building CFG for each procedure with an implementation [2025-02-05 20:13:40,513 INFO L? ?]: Removed 682 outVars from TransFormulas that were not future-live. [2025-02-05 20:13:40,513 INFO L308 CfgBuilder]: Performing block encoding [2025-02-05 20:13:40,580 INFO L332 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2025-02-05 20:13:40,580 INFO L337 CfgBuilder]: Removed 0 assume(true) statements. [2025-02-05 20:13:40,580 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.icfgbuilder CFG 05.02 08:13:40 BoogieIcfgContainer [2025-02-05 20:13:40,580 INFO L131 PluginConnector]: ------------------------ END IcfgBuilder---------------------------- [2025-02-05 20:13:40,582 INFO L112 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2025-02-05 20:13:40,582 INFO L270 PluginConnector]: Initializing TraceAbstraction... [2025-02-05 20:13:40,586 INFO L274 PluginConnector]: TraceAbstraction initialized [2025-02-05 20:13:40,587 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 05.02 08:13:38" (1/3) ... [2025-02-05 20:13:40,587 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@1835cfe0 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 05.02 08:13:40, skipping insertion in model container [2025-02-05 20:13:40,587 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 05.02 08:13:38" (2/3) ... [2025-02-05 20:13:40,587 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@1835cfe0 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 05.02 08:13:40, skipping insertion in model container [2025-02-05 20:13:40,587 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.icfgbuilder CFG 05.02 08:13:40" (3/3) ... [2025-02-05 20:13:40,588 INFO L128 eAbstractionObserver]: Analyzing ICFG btor2c-lazyMod.vis_arrays_palu.c [2025-02-05 20:13:40,599 INFO L216 ceAbstractionStarter]: Automizer settings: Hoare:LoopHeads NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2025-02-05 20:13:40,601 INFO L151 ceAbstractionStarter]: Applying trace abstraction to ICFG btor2c-lazyMod.vis_arrays_palu.c that has 1 procedures, 362 locations, 1 initial locations, 1 loop locations, and 1 error locations. [2025-02-05 20:13:40,642 INFO L332 AbstractCegarLoop]: ======== Iteration 0 == of CEGAR loop == AllErrorsAtOnce ======== [2025-02-05 20:13:40,649 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;@618ddc3c, mLbeIndependenceSettings=[IndependenceType=SEMANTIC, AbstractionType=NONE, UseConditional=false, UseSemiCommutativity=true, Solver=Z3, SolverTimeout=1000ms] [2025-02-05 20:13:40,649 INFO L334 AbstractCegarLoop]: Starting to check reachability of 1 error locations. [2025-02-05 20:13:40,652 INFO L276 IsEmpty]: Start isEmpty. Operand has 362 states, 360 states have (on average 1.4972222222222222) internal successors, (539), 361 states have internal predecessors, (539), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-02-05 20:13:40,656 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 52 [2025-02-05 20:13:40,656 INFO L210 NwaCegarLoop]: Found error trace [2025-02-05 20:13:40,656 INFO L218 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-02-05 20:13:40,656 INFO L396 AbstractCegarLoop]: === Iteration 1 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-02-05 20:13:40,659 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-02-05 20:13:40,660 INFO L85 PathProgramCache]: Analyzing trace with hash -1611351578, now seen corresponding path program 1 times [2025-02-05 20:13:40,664 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-02-05 20:13:40,664 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [138706310] [2025-02-05 20:13:40,664 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-02-05 20:13:40,665 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-02-05 20:13:40,740 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 51 statements into 1 equivalence classes. [2025-02-05 20:13:40,870 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 51 of 51 statements. [2025-02-05 20:13:40,870 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-02-05 20:13:40,870 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-02-05 20:13:41,333 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-02-05 20:13:41,334 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-02-05 20:13:41,334 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [138706310] [2025-02-05 20:13:41,334 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [138706310] provided 1 perfect and 0 imperfect interpolant sequences [2025-02-05 20:13:41,334 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-02-05 20:13:41,335 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2025-02-05 20:13:41,336 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [333908908] [2025-02-05 20:13:41,336 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-02-05 20:13:41,338 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2025-02-05 20:13:41,338 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-02-05 20:13:41,349 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2025-02-05 20:13:41,350 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2025-02-05 20:13:41,353 INFO L87 Difference]: Start difference. First operand has 362 states, 360 states have (on average 1.4972222222222222) internal successors, (539), 361 states have internal predecessors, (539), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Second operand has 4 states, 4 states have (on average 12.75) internal successors, (51), 4 states have internal predecessors, (51), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-02-05 20:13:41,584 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-02-05 20:13:41,585 INFO L93 Difference]: Finished difference Result 681 states and 1017 transitions. [2025-02-05 20:13:41,585 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2025-02-05 20:13:41,586 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 4 states have (on average 12.75) internal successors, (51), 4 states have internal predecessors, (51), 0 states have call successors, (0), 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 51 [2025-02-05 20:13:41,587 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-02-05 20:13:41,595 INFO L225 Difference]: With dead ends: 681 [2025-02-05 20:13:41,596 INFO L226 Difference]: Without dead ends: 361 [2025-02-05 20:13:41,598 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 4 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 2 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2025-02-05 20:13:41,599 INFO L435 NwaCegarLoop]: 445 mSDtfsCounter, 0 mSDsluCounter, 885 mSDsCounter, 0 mSdLazyCounter, 274 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 0 SdHoareTripleChecker+Valid, 1330 SdHoareTripleChecker+Invalid, 274 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 274 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.2s IncrementalHoareTripleChecker+Time [2025-02-05 20:13:41,600 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [0 Valid, 1330 Invalid, 274 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 274 Invalid, 0 Unknown, 0 Unchecked, 0.2s Time] [2025-02-05 20:13:41,610 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 361 states. [2025-02-05 20:13:41,637 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 361 to 361. [2025-02-05 20:13:41,639 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 361 states, 360 states have (on average 1.4916666666666667) internal successors, (537), 360 states have internal predecessors, (537), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-02-05 20:13:41,643 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 361 states to 361 states and 537 transitions. [2025-02-05 20:13:41,644 INFO L78 Accepts]: Start accepts. Automaton has 361 states and 537 transitions. Word has length 51 [2025-02-05 20:13:41,644 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-02-05 20:13:41,644 INFO L471 AbstractCegarLoop]: Abstraction has 361 states and 537 transitions. [2025-02-05 20:13:41,644 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 12.75) internal successors, (51), 4 states have internal predecessors, (51), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-02-05 20:13:41,645 INFO L276 IsEmpty]: Start isEmpty. Operand 361 states and 537 transitions. [2025-02-05 20:13:41,645 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 53 [2025-02-05 20:13:41,646 INFO L210 NwaCegarLoop]: Found error trace [2025-02-05 20:13:41,646 INFO L218 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-02-05 20:13:41,646 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable0 [2025-02-05 20:13:41,646 INFO L396 AbstractCegarLoop]: === Iteration 2 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-02-05 20:13:41,647 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-02-05 20:13:41,647 INFO L85 PathProgramCache]: Analyzing trace with hash 1592388234, now seen corresponding path program 1 times [2025-02-05 20:13:41,647 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-02-05 20:13:41,647 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1055579429] [2025-02-05 20:13:41,647 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-02-05 20:13:41,647 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-02-05 20:13:41,668 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 52 statements into 1 equivalence classes. [2025-02-05 20:13:41,687 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 52 of 52 statements. [2025-02-05 20:13:41,687 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-02-05 20:13:41,687 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-02-05 20:13:41,850 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-02-05 20:13:41,850 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-02-05 20:13:41,850 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1055579429] [2025-02-05 20:13:41,850 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1055579429] provided 1 perfect and 0 imperfect interpolant sequences [2025-02-05 20:13:41,850 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-02-05 20:13:41,850 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2025-02-05 20:13:41,850 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2031882218] [2025-02-05 20:13:41,850 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-02-05 20:13:41,851 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2025-02-05 20:13:41,851 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-02-05 20:13:41,852 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2025-02-05 20:13:41,852 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2025-02-05 20:13:41,852 INFO L87 Difference]: Start difference. First operand 361 states and 537 transitions. Second operand has 4 states, 4 states have (on average 13.0) internal successors, (52), 4 states have internal predecessors, (52), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-02-05 20:13:42,058 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-02-05 20:13:42,058 INFO L93 Difference]: Finished difference Result 682 states and 1015 transitions. [2025-02-05 20:13:42,060 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2025-02-05 20:13:42,060 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 4 states have (on average 13.0) internal successors, (52), 4 states have internal predecessors, (52), 0 states have call successors, (0), 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 52 [2025-02-05 20:13:42,060 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-02-05 20:13:42,062 INFO L225 Difference]: With dead ends: 682 [2025-02-05 20:13:42,062 INFO L226 Difference]: Without dead ends: 363 [2025-02-05 20:13:42,062 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 5 GetRequests, 3 SyntacticMatches, 0 SemanticMatches, 2 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2025-02-05 20:13:42,063 INFO L435 NwaCegarLoop]: 445 mSDtfsCounter, 0 mSDsluCounter, 882 mSDsCounter, 0 mSdLazyCounter, 277 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 0 SdHoareTripleChecker+Valid, 1327 SdHoareTripleChecker+Invalid, 277 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 277 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.2s IncrementalHoareTripleChecker+Time [2025-02-05 20:13:42,063 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [0 Valid, 1327 Invalid, 277 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 277 Invalid, 0 Unknown, 0 Unchecked, 0.2s Time] [2025-02-05 20:13:42,066 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 363 states. [2025-02-05 20:13:42,081 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 363 to 363. [2025-02-05 20:13:42,083 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 363 states, 362 states have (on average 1.488950276243094) internal successors, (539), 362 states have internal predecessors, (539), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-02-05 20:13:42,085 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 363 states to 363 states and 539 transitions. [2025-02-05 20:13:42,089 INFO L78 Accepts]: Start accepts. Automaton has 363 states and 539 transitions. Word has length 52 [2025-02-05 20:13:42,089 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-02-05 20:13:42,089 INFO L471 AbstractCegarLoop]: Abstraction has 363 states and 539 transitions. [2025-02-05 20:13:42,089 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 13.0) internal successors, (52), 4 states have internal predecessors, (52), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-02-05 20:13:42,089 INFO L276 IsEmpty]: Start isEmpty. Operand 363 states and 539 transitions. [2025-02-05 20:13:42,090 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 54 [2025-02-05 20:13:42,090 INFO L210 NwaCegarLoop]: Found error trace [2025-02-05 20:13:42,090 INFO L218 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-02-05 20:13:42,090 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable1 [2025-02-05 20:13:42,090 INFO L396 AbstractCegarLoop]: === Iteration 3 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-02-05 20:13:42,091 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-02-05 20:13:42,091 INFO L85 PathProgramCache]: Analyzing trace with hash -244062623, now seen corresponding path program 1 times [2025-02-05 20:13:42,091 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-02-05 20:13:42,091 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1226514280] [2025-02-05 20:13:42,091 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-02-05 20:13:42,091 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-02-05 20:13:42,122 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 53 statements into 1 equivalence classes. [2025-02-05 20:13:42,201 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 53 of 53 statements. [2025-02-05 20:13:42,204 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-02-05 20:13:42,205 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-02-05 20:13:42,508 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-02-05 20:13:42,509 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-02-05 20:13:42,510 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1226514280] [2025-02-05 20:13:42,510 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1226514280] provided 1 perfect and 0 imperfect interpolant sequences [2025-02-05 20:13:42,510 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-02-05 20:13:42,510 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2025-02-05 20:13:42,510 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1659577211] [2025-02-05 20:13:42,510 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-02-05 20:13:42,510 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2025-02-05 20:13:42,510 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-02-05 20:13:42,511 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2025-02-05 20:13:42,511 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2025-02-05 20:13:42,511 INFO L87 Difference]: Start difference. First operand 363 states and 539 transitions. Second operand has 4 states, 4 states have (on average 13.25) internal successors, (53), 4 states have internal predecessors, (53), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-02-05 20:13:42,695 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-02-05 20:13:42,696 INFO L93 Difference]: Finished difference Result 686 states and 1019 transitions. [2025-02-05 20:13:42,696 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2025-02-05 20:13:42,696 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 4 states have (on average 13.25) internal successors, (53), 4 states have internal predecessors, (53), 0 states have call successors, (0), 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 53 [2025-02-05 20:13:42,697 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-02-05 20:13:42,698 INFO L225 Difference]: With dead ends: 686 [2025-02-05 20:13:42,699 INFO L226 Difference]: Without dead ends: 365 [2025-02-05 20:13:42,699 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 5 GetRequests, 3 SyntacticMatches, 0 SemanticMatches, 2 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2025-02-05 20:13:42,700 INFO L435 NwaCegarLoop]: 445 mSDtfsCounter, 0 mSDsluCounter, 882 mSDsCounter, 0 mSdLazyCounter, 277 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 0 SdHoareTripleChecker+Valid, 1327 SdHoareTripleChecker+Invalid, 277 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 277 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.2s IncrementalHoareTripleChecker+Time [2025-02-05 20:13:42,700 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [0 Valid, 1327 Invalid, 277 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 277 Invalid, 0 Unknown, 0 Unchecked, 0.2s Time] [2025-02-05 20:13:42,702 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 365 states. [2025-02-05 20:13:42,711 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 365 to 365. [2025-02-05 20:13:42,715 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 365 states, 364 states have (on average 1.4862637362637363) internal successors, (541), 364 states have internal predecessors, (541), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-02-05 20:13:42,716 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 365 states to 365 states and 541 transitions. [2025-02-05 20:13:42,716 INFO L78 Accepts]: Start accepts. Automaton has 365 states and 541 transitions. Word has length 53 [2025-02-05 20:13:42,716 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-02-05 20:13:42,716 INFO L471 AbstractCegarLoop]: Abstraction has 365 states and 541 transitions. [2025-02-05 20:13:42,716 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 13.25) internal successors, (53), 4 states have internal predecessors, (53), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-02-05 20:13:42,716 INFO L276 IsEmpty]: Start isEmpty. Operand 365 states and 541 transitions. [2025-02-05 20:13:42,717 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 55 [2025-02-05 20:13:42,717 INFO L210 NwaCegarLoop]: Found error trace [2025-02-05 20:13:42,717 INFO L218 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-02-05 20:13:42,717 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable2 [2025-02-05 20:13:42,717 INFO L396 AbstractCegarLoop]: === Iteration 4 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-02-05 20:13:42,718 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-02-05 20:13:42,718 INFO L85 PathProgramCache]: Analyzing trace with hash -1382611057, now seen corresponding path program 1 times [2025-02-05 20:13:42,718 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-02-05 20:13:42,718 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1654696140] [2025-02-05 20:13:42,718 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-02-05 20:13:42,718 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-02-05 20:13:42,746 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 54 statements into 1 equivalence classes. [2025-02-05 20:13:42,773 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 54 of 54 statements. [2025-02-05 20:13:42,774 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-02-05 20:13:42,774 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-02-05 20:13:42,906 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-02-05 20:13:42,906 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-02-05 20:13:42,907 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1654696140] [2025-02-05 20:13:42,907 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1654696140] provided 1 perfect and 0 imperfect interpolant sequences [2025-02-05 20:13:42,907 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-02-05 20:13:42,907 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2025-02-05 20:13:42,907 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1259722158] [2025-02-05 20:13:42,907 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-02-05 20:13:42,907 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2025-02-05 20:13:42,908 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-02-05 20:13:42,908 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2025-02-05 20:13:42,908 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2025-02-05 20:13:42,908 INFO L87 Difference]: Start difference. First operand 365 states and 541 transitions. Second operand has 5 states, 5 states have (on average 10.8) internal successors, (54), 5 states have internal predecessors, (54), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-02-05 20:13:43,122 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-02-05 20:13:43,123 INFO L93 Difference]: Finished difference Result 718 states and 1065 transitions. [2025-02-05 20:13:43,123 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2025-02-05 20:13:43,124 INFO L78 Accepts]: Start accepts. Automaton has has 5 states, 5 states have (on average 10.8) internal successors, (54), 5 states have internal predecessors, (54), 0 states have call successors, (0), 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 54 [2025-02-05 20:13:43,124 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-02-05 20:13:43,125 INFO L225 Difference]: With dead ends: 718 [2025-02-05 20:13:43,127 INFO L226 Difference]: Without dead ends: 395 [2025-02-05 20:13:43,127 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 6 GetRequests, 3 SyntacticMatches, 0 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2025-02-05 20:13:43,128 INFO L435 NwaCegarLoop]: 444 mSDtfsCounter, 28 mSDsluCounter, 1322 mSDsCounter, 0 mSdLazyCounter, 373 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 28 SdHoareTripleChecker+Valid, 1766 SdHoareTripleChecker+Invalid, 373 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 373 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.2s IncrementalHoareTripleChecker+Time [2025-02-05 20:13:43,128 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [28 Valid, 1766 Invalid, 373 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 373 Invalid, 0 Unknown, 0 Unchecked, 0.2s Time] [2025-02-05 20:13:43,129 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 395 states. [2025-02-05 20:13:43,140 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 395 to 395. [2025-02-05 20:13:43,140 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 395 states, 394 states have (on average 1.484771573604061) internal successors, (585), 394 states have internal predecessors, (585), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-02-05 20:13:43,141 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 395 states to 395 states and 585 transitions. [2025-02-05 20:13:43,141 INFO L78 Accepts]: Start accepts. Automaton has 395 states and 585 transitions. Word has length 54 [2025-02-05 20:13:43,146 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-02-05 20:13:43,146 INFO L471 AbstractCegarLoop]: Abstraction has 395 states and 585 transitions. [2025-02-05 20:13:43,146 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 10.8) internal successors, (54), 5 states have internal predecessors, (54), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-02-05 20:13:43,146 INFO L276 IsEmpty]: Start isEmpty. Operand 395 states and 585 transitions. [2025-02-05 20:13:43,147 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 56 [2025-02-05 20:13:43,147 INFO L210 NwaCegarLoop]: Found error trace [2025-02-05 20:13:43,147 INFO L218 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-02-05 20:13:43,147 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable3 [2025-02-05 20:13:43,147 INFO L396 AbstractCegarLoop]: === Iteration 5 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-02-05 20:13:43,147 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-02-05 20:13:43,147 INFO L85 PathProgramCache]: Analyzing trace with hash 153206009, now seen corresponding path program 1 times [2025-02-05 20:13:43,148 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-02-05 20:13:43,148 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1554152733] [2025-02-05 20:13:43,148 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-02-05 20:13:43,148 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-02-05 20:13:43,173 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 55 statements into 1 equivalence classes. [2025-02-05 20:13:43,248 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 55 of 55 statements. [2025-02-05 20:13:43,250 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-02-05 20:13:43,250 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-02-05 20:13:43,627 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-02-05 20:13:43,628 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-02-05 20:13:43,628 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1554152733] [2025-02-05 20:13:43,628 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1554152733] provided 1 perfect and 0 imperfect interpolant sequences [2025-02-05 20:13:43,628 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-02-05 20:13:43,628 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2025-02-05 20:13:43,628 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [356671295] [2025-02-05 20:13:43,628 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-02-05 20:13:43,628 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 7 states [2025-02-05 20:13:43,628 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-02-05 20:13:43,629 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2025-02-05 20:13:43,629 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=12, Invalid=30, Unknown=0, NotChecked=0, Total=42 [2025-02-05 20:13:43,629 INFO L87 Difference]: Start difference. First operand 395 states and 585 transitions. Second operand has 7 states, 7 states have (on average 7.857142857142857) internal successors, (55), 7 states have internal predecessors, (55), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-02-05 20:13:43,926 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-02-05 20:13:43,926 INFO L93 Difference]: Finished difference Result 754 states and 1117 transitions. [2025-02-05 20:13:43,927 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2025-02-05 20:13:43,927 INFO L78 Accepts]: Start accepts. Automaton has has 7 states, 7 states have (on average 7.857142857142857) internal successors, (55), 7 states have internal predecessors, (55), 0 states have call successors, (0), 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 55 [2025-02-05 20:13:43,927 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-02-05 20:13:43,928 INFO L225 Difference]: With dead ends: 754 [2025-02-05 20:13:43,929 INFO L226 Difference]: Without dead ends: 401 [2025-02-05 20:13:43,929 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 9 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 7 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 4 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=20, Invalid=52, Unknown=0, NotChecked=0, Total=72 [2025-02-05 20:13:43,930 INFO L435 NwaCegarLoop]: 444 mSDtfsCounter, 523 mSDsluCounter, 1761 mSDsCounter, 0 mSdLazyCounter, 469 mSolverCounterSat, 1 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 523 SdHoareTripleChecker+Valid, 2205 SdHoareTripleChecker+Invalid, 470 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 1 IncrementalHoareTripleChecker+Valid, 469 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.3s IncrementalHoareTripleChecker+Time [2025-02-05 20:13:43,930 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [523 Valid, 2205 Invalid, 470 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [1 Valid, 469 Invalid, 0 Unknown, 0 Unchecked, 0.3s Time] [2025-02-05 20:13:43,931 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 401 states. [2025-02-05 20:13:43,935 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 401 to 401. [2025-02-05 20:13:43,935 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 401 states, 400 states have (on average 1.4825) internal successors, (593), 400 states have internal predecessors, (593), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-02-05 20:13:43,936 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 401 states to 401 states and 593 transitions. [2025-02-05 20:13:43,937 INFO L78 Accepts]: Start accepts. Automaton has 401 states and 593 transitions. Word has length 55 [2025-02-05 20:13:43,937 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-02-05 20:13:43,937 INFO L471 AbstractCegarLoop]: Abstraction has 401 states and 593 transitions. [2025-02-05 20:13:43,937 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 7 states, 7 states have (on average 7.857142857142857) internal successors, (55), 7 states have internal predecessors, (55), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-02-05 20:13:43,937 INFO L276 IsEmpty]: Start isEmpty. Operand 401 states and 593 transitions. [2025-02-05 20:13:43,938 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 57 [2025-02-05 20:13:43,938 INFO L210 NwaCegarLoop]: Found error trace [2025-02-05 20:13:43,938 INFO L218 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-02-05 20:13:43,938 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable4 [2025-02-05 20:13:43,938 INFO L396 AbstractCegarLoop]: === Iteration 6 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-02-05 20:13:43,939 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-02-05 20:13:43,939 INFO L85 PathProgramCache]: Analyzing trace with hash 1529158361, now seen corresponding path program 1 times [2025-02-05 20:13:43,939 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-02-05 20:13:43,939 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1308733054] [2025-02-05 20:13:43,939 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-02-05 20:13:43,939 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-02-05 20:13:43,957 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 56 statements into 1 equivalence classes. [2025-02-05 20:13:43,970 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 56 of 56 statements. [2025-02-05 20:13:43,971 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-02-05 20:13:43,971 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-02-05 20:13:44,166 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-02-05 20:13:44,167 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-02-05 20:13:44,167 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1308733054] [2025-02-05 20:13:44,167 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1308733054] provided 1 perfect and 0 imperfect interpolant sequences [2025-02-05 20:13:44,167 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-02-05 20:13:44,167 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2025-02-05 20:13:44,167 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [944427256] [2025-02-05 20:13:44,167 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-02-05 20:13:44,167 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2025-02-05 20:13:44,168 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-02-05 20:13:44,168 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2025-02-05 20:13:44,168 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=10, Invalid=20, Unknown=0, NotChecked=0, Total=30 [2025-02-05 20:13:44,168 INFO L87 Difference]: Start difference. First operand 401 states and 593 transitions. Second operand has 6 states, 6 states have (on average 9.333333333333334) internal successors, (56), 6 states have internal predecessors, (56), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-02-05 20:13:44,576 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-02-05 20:13:44,577 INFO L93 Difference]: Finished difference Result 1057 states and 1564 transitions. [2025-02-05 20:13:44,577 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2025-02-05 20:13:44,577 INFO L78 Accepts]: Start accepts. Automaton has has 6 states, 6 states have (on average 9.333333333333334) internal successors, (56), 6 states have internal predecessors, (56), 0 states have call successors, (0), 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 56 [2025-02-05 20:13:44,578 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-02-05 20:13:44,580 INFO L225 Difference]: With dead ends: 1057 [2025-02-05 20:13:44,580 INFO L226 Difference]: Without dead ends: 698 [2025-02-05 20:13:44,581 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 10 GetRequests, 4 SyntacticMatches, 0 SemanticMatches, 6 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=20, Invalid=36, Unknown=0, NotChecked=0, Total=56 [2025-02-05 20:13:44,581 INFO L435 NwaCegarLoop]: 437 mSDtfsCounter, 1391 mSDsluCounter, 1185 mSDsCounter, 0 mSdLazyCounter, 518 mSolverCounterSat, 1 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.3s Time, 0 mProtectedPredicate, 0 mProtectedAction, 1391 SdHoareTripleChecker+Valid, 1622 SdHoareTripleChecker+Invalid, 519 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 1 IncrementalHoareTripleChecker+Valid, 518 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.4s IncrementalHoareTripleChecker+Time [2025-02-05 20:13:44,581 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [1391 Valid, 1622 Invalid, 519 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [1 Valid, 518 Invalid, 0 Unknown, 0 Unchecked, 0.4s Time] [2025-02-05 20:13:44,582 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 698 states. [2025-02-05 20:13:44,588 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 698 to 403. [2025-02-05 20:13:44,589 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 403 states, 402 states have (on average 1.4800995024875623) internal successors, (595), 402 states have internal predecessors, (595), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-02-05 20:13:44,590 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 403 states to 403 states and 595 transitions. [2025-02-05 20:13:44,590 INFO L78 Accepts]: Start accepts. Automaton has 403 states and 595 transitions. Word has length 56 [2025-02-05 20:13:44,590 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-02-05 20:13:44,591 INFO L471 AbstractCegarLoop]: Abstraction has 403 states and 595 transitions. [2025-02-05 20:13:44,591 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 6 states have (on average 9.333333333333334) internal successors, (56), 6 states have internal predecessors, (56), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-02-05 20:13:44,591 INFO L276 IsEmpty]: Start isEmpty. Operand 403 states and 595 transitions. [2025-02-05 20:13:44,592 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 216 [2025-02-05 20:13:44,592 INFO L210 NwaCegarLoop]: Found error trace [2025-02-05 20:13:44,593 INFO L218 NwaCegarLoop]: trace histogram [2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-02-05 20:13:44,593 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable5 [2025-02-05 20:13:44,593 INFO L396 AbstractCegarLoop]: === Iteration 7 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-02-05 20:13:44,593 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-02-05 20:13:44,593 INFO L85 PathProgramCache]: Analyzing trace with hash -1614337595, now seen corresponding path program 1 times [2025-02-05 20:13:44,593 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-02-05 20:13:44,593 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1015811734] [2025-02-05 20:13:44,593 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-02-05 20:13:44,594 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-02-05 20:13:44,656 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 215 statements into 1 equivalence classes. [2025-02-05 20:13:44,965 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 215 of 215 statements. [2025-02-05 20:13:44,965 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-02-05 20:13:44,965 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-02-05 20:13:45,420 INFO L134 CoverageAnalysis]: Checked inductivity of 28 backedges. 26 proven. 2 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-02-05 20:13:45,421 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-02-05 20:13:45,421 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1015811734] [2025-02-05 20:13:45,421 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1015811734] provided 0 perfect and 1 imperfect interpolant sequences [2025-02-05 20:13:45,421 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [460602218] [2025-02-05 20:13:45,421 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-02-05 20:13:45,421 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-02-05 20:13:45,421 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 [2025-02-05 20:13:45,424 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 20:13:45,425 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 20:13:45,662 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 215 statements into 1 equivalence classes. [2025-02-05 20:13:45,886 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 215 of 215 statements. [2025-02-05 20:13:45,886 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-02-05 20:13:45,886 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-02-05 20:13:45,895 INFO L256 TraceCheckSpWp]: Trace formula consists of 1431 conjuncts, 12 conjuncts are in the unsatisfiable core [2025-02-05 20:13:45,908 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-02-05 20:13:46,186 INFO L134 CoverageAnalysis]: Checked inductivity of 28 backedges. 26 proven. 2 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-02-05 20:13:46,188 INFO L312 TraceCheckSpWp]: Computing backward predicates... [2025-02-05 20:13:46,548 INFO L134 CoverageAnalysis]: Checked inductivity of 28 backedges. 26 proven. 2 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-02-05 20:13:46,549 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [460602218] provided 0 perfect and 2 imperfect interpolant sequences [2025-02-05 20:13:46,549 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2025-02-05 20:13:46,549 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [6, 6, 6] total 11 [2025-02-05 20:13:46,549 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [477734527] [2025-02-05 20:13:46,549 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2025-02-05 20:13:46,549 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 11 states [2025-02-05 20:13:46,550 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-02-05 20:13:46,550 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 11 interpolants. [2025-02-05 20:13:46,550 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=22, Invalid=88, Unknown=0, NotChecked=0, Total=110 [2025-02-05 20:13:46,550 INFO L87 Difference]: Start difference. First operand 403 states and 595 transitions. Second operand has 11 states, 11 states have (on average 49.90909090909091) internal successors, (549), 11 states have internal predecessors, (549), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-02-05 20:13:47,310 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-02-05 20:13:47,310 INFO L93 Difference]: Finished difference Result 1519 states and 2251 transitions. [2025-02-05 20:13:47,311 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 11 states. [2025-02-05 20:13:47,311 INFO L78 Accepts]: Start accepts. Automaton has has 11 states, 11 states have (on average 49.90909090909091) internal successors, (549), 11 states have internal predecessors, (549), 0 states have call successors, (0), 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 215 [2025-02-05 20:13:47,312 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-02-05 20:13:47,315 INFO L225 Difference]: With dead ends: 1519 [2025-02-05 20:13:47,315 INFO L226 Difference]: Without dead ends: 701 [2025-02-05 20:13:47,316 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 442 GetRequests, 425 SyntacticMatches, 0 SemanticMatches, 17 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 31 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=80, Invalid=262, Unknown=0, NotChecked=0, Total=342 [2025-02-05 20:13:47,316 INFO L435 NwaCegarLoop]: 450 mSDtfsCounter, 2449 mSDsluCounter, 2868 mSDsCounter, 0 mSdLazyCounter, 1192 mSolverCounterSat, 50 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.5s Time, 0 mProtectedPredicate, 0 mProtectedAction, 2449 SdHoareTripleChecker+Valid, 3318 SdHoareTripleChecker+Invalid, 1242 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 50 IncrementalHoareTripleChecker+Valid, 1192 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.7s IncrementalHoareTripleChecker+Time [2025-02-05 20:13:47,316 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [2449 Valid, 3318 Invalid, 1242 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [50 Valid, 1192 Invalid, 0 Unknown, 0 Unchecked, 0.7s Time] [2025-02-05 20:13:47,317 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 701 states. [2025-02-05 20:13:47,327 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 701 to 699. [2025-02-05 20:13:47,328 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 699 states, 698 states have (on average 1.478510028653295) internal successors, (1032), 698 states have internal predecessors, (1032), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-02-05 20:13:47,329 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 699 states to 699 states and 1032 transitions. [2025-02-05 20:13:47,330 INFO L78 Accepts]: Start accepts. Automaton has 699 states and 1032 transitions. Word has length 215 [2025-02-05 20:13:47,330 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-02-05 20:13:47,330 INFO L471 AbstractCegarLoop]: Abstraction has 699 states and 1032 transitions. [2025-02-05 20:13:47,330 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 11 states, 11 states have (on average 49.90909090909091) internal successors, (549), 11 states have internal predecessors, (549), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-02-05 20:13:47,330 INFO L276 IsEmpty]: Start isEmpty. Operand 699 states and 1032 transitions. [2025-02-05 20:13:47,331 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 218 [2025-02-05 20:13:47,331 INFO L210 NwaCegarLoop]: Found error trace [2025-02-05 20:13:47,332 INFO L218 NwaCegarLoop]: trace histogram [2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-02-05 20:13:47,344 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 20:13:47,532 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable6,2 /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-02-05 20:13:47,533 INFO L396 AbstractCegarLoop]: === Iteration 8 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-02-05 20:13:47,533 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-02-05 20:13:47,534 INFO L85 PathProgramCache]: Analyzing trace with hash -1585110678, now seen corresponding path program 1 times [2025-02-05 20:13:47,534 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-02-05 20:13:47,534 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1512736132] [2025-02-05 20:13:47,534 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-02-05 20:13:47,534 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-02-05 20:13:47,581 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 217 statements into 1 equivalence classes. [2025-02-05 20:13:47,830 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 217 of 217 statements. [2025-02-05 20:13:47,830 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-02-05 20:13:47,831 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-02-05 20:13:48,797 INFO L134 CoverageAnalysis]: Checked inductivity of 28 backedges. 7 proven. 3 refuted. 0 times theorem prover too weak. 18 trivial. 0 not checked. [2025-02-05 20:13:48,798 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-02-05 20:13:48,798 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1512736132] [2025-02-05 20:13:48,798 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1512736132] provided 0 perfect and 1 imperfect interpolant sequences [2025-02-05 20:13:48,798 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1413266869] [2025-02-05 20:13:48,798 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-02-05 20:13:48,798 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-02-05 20:13:48,798 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 [2025-02-05 20:13:48,801 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 20:13:48,802 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 20:13:49,037 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 217 statements into 1 equivalence classes. [2025-02-05 20:13:49,245 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 217 of 217 statements. [2025-02-05 20:13:49,245 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-02-05 20:13:49,245 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-02-05 20:13:49,258 INFO L256 TraceCheckSpWp]: Trace formula consists of 1437 conjuncts, 36 conjuncts are in the unsatisfiable core [2025-02-05 20:13:49,265 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-02-05 20:13:49,509 INFO L134 CoverageAnalysis]: Checked inductivity of 28 backedges. 28 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-02-05 20:13:49,510 INFO L308 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2025-02-05 20:13:49,510 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1413266869] provided 1 perfect and 0 imperfect interpolant sequences [2025-02-05 20:13:49,510 INFO L185 FreeRefinementEngine]: Found 1 perfect and 1 imperfect interpolant sequences. [2025-02-05 20:13:49,510 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [8] total 12 [2025-02-05 20:13:49,513 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1569732800] [2025-02-05 20:13:49,513 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-02-05 20:13:49,513 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2025-02-05 20:13:49,513 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-02-05 20:13:49,514 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2025-02-05 20:13:49,514 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=23, Invalid=109, Unknown=0, NotChecked=0, Total=132 [2025-02-05 20:13:49,514 INFO L87 Difference]: Start difference. First operand 699 states and 1032 transitions. Second operand has 6 states, 6 states have (on average 36.166666666666664) internal successors, (217), 6 states have internal predecessors, (217), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-02-05 20:13:49,906 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-02-05 20:13:49,907 INFO L93 Difference]: Finished difference Result 1308 states and 1937 transitions. [2025-02-05 20:13:49,908 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2025-02-05 20:13:49,908 INFO L78 Accepts]: Start accepts. Automaton has has 6 states, 6 states have (on average 36.166666666666664) internal successors, (217), 6 states have internal predecessors, (217), 0 states have call successors, (0), 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 217 [2025-02-05 20:13:49,908 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-02-05 20:13:49,910 INFO L225 Difference]: With dead ends: 1308 [2025-02-05 20:13:49,910 INFO L226 Difference]: Without dead ends: 699 [2025-02-05 20:13:49,911 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 226 GetRequests, 214 SyntacticMatches, 0 SemanticMatches, 12 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 12 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=32, Invalid=150, Unknown=0, NotChecked=0, Total=182 [2025-02-05 20:13:49,911 INFO L435 NwaCegarLoop]: 315 mSDtfsCounter, 665 mSDsluCounter, 624 mSDsCounter, 0 mSdLazyCounter, 666 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.3s Time, 0 mProtectedPredicate, 0 mProtectedAction, 665 SdHoareTripleChecker+Valid, 939 SdHoareTripleChecker+Invalid, 666 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 666 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.4s IncrementalHoareTripleChecker+Time [2025-02-05 20:13:49,912 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [665 Valid, 939 Invalid, 666 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 666 Invalid, 0 Unknown, 0 Unchecked, 0.4s Time] [2025-02-05 20:13:49,913 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 699 states. [2025-02-05 20:13:49,923 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 699 to 699. [2025-02-05 20:13:49,924 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 699 states, 698 states have (on average 1.4770773638968482) internal successors, (1031), 698 states have internal predecessors, (1031), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-02-05 20:13:49,926 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 699 states to 699 states and 1031 transitions. [2025-02-05 20:13:49,926 INFO L78 Accepts]: Start accepts. Automaton has 699 states and 1031 transitions. Word has length 217 [2025-02-05 20:13:49,926 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-02-05 20:13:49,926 INFO L471 AbstractCegarLoop]: Abstraction has 699 states and 1031 transitions. [2025-02-05 20:13:49,926 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 6 states have (on average 36.166666666666664) internal successors, (217), 6 states have internal predecessors, (217), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-02-05 20:13:49,926 INFO L276 IsEmpty]: Start isEmpty. Operand 699 states and 1031 transitions. [2025-02-05 20:13:49,928 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 219 [2025-02-05 20:13:49,928 INFO L210 NwaCegarLoop]: Found error trace [2025-02-05 20:13:49,929 INFO L218 NwaCegarLoop]: trace histogram [2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-02-05 20:13:49,938 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 20:13:50,133 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable7,3 /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-02-05 20:13:50,134 INFO L396 AbstractCegarLoop]: === Iteration 9 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-02-05 20:13:50,135 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-02-05 20:13:50,135 INFO L85 PathProgramCache]: Analyzing trace with hash -1773177347, now seen corresponding path program 1 times [2025-02-05 20:13:50,135 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-02-05 20:13:50,135 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [545844967] [2025-02-05 20:13:50,135 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-02-05 20:13:50,135 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-02-05 20:13:50,190 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 218 statements into 1 equivalence classes. [2025-02-05 20:13:50,448 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 218 of 218 statements. [2025-02-05 20:13:50,448 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-02-05 20:13:50,448 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-02-05 20:13:50,859 INFO L134 CoverageAnalysis]: Checked inductivity of 28 backedges. 28 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-02-05 20:13:50,860 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-02-05 20:13:50,860 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [545844967] [2025-02-05 20:13:50,860 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [545844967] provided 1 perfect and 0 imperfect interpolant sequences [2025-02-05 20:13:50,861 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-02-05 20:13:50,861 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2025-02-05 20:13:50,861 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [649808732] [2025-02-05 20:13:50,861 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-02-05 20:13:50,861 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2025-02-05 20:13:50,861 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-02-05 20:13:50,862 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2025-02-05 20:13:50,862 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2025-02-05 20:13:50,862 INFO L87 Difference]: Start difference. First operand 699 states and 1031 transitions. Second operand has 5 states, 5 states have (on average 43.6) internal successors, (218), 5 states have internal predecessors, (218), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-02-05 20:13:51,370 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-02-05 20:13:51,371 INFO L93 Difference]: Finished difference Result 1060 states and 1565 transitions. [2025-02-05 20:13:51,371 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2025-02-05 20:13:51,371 INFO L78 Accepts]: Start accepts. Automaton has has 5 states, 5 states have (on average 43.6) internal successors, (218), 5 states have internal predecessors, (218), 0 states have call successors, (0), 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 218 [2025-02-05 20:13:51,372 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-02-05 20:13:51,374 INFO L225 Difference]: With dead ends: 1060 [2025-02-05 20:13:51,374 INFO L226 Difference]: Without dead ends: 701 [2025-02-05 20:13:51,375 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 8 GetRequests, 3 SyntacticMatches, 0 SemanticMatches, 5 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=15, Invalid=27, Unknown=0, NotChecked=0, Total=42 [2025-02-05 20:13:51,375 INFO L435 NwaCegarLoop]: 318 mSDtfsCounter, 1235 mSDsluCounter, 632 mSDsCounter, 0 mSdLazyCounter, 655 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.4s Time, 0 mProtectedPredicate, 0 mProtectedAction, 1235 SdHoareTripleChecker+Valid, 950 SdHoareTripleChecker+Invalid, 655 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 655 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.5s IncrementalHoareTripleChecker+Time [2025-02-05 20:13:51,376 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [1235 Valid, 950 Invalid, 655 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 655 Invalid, 0 Unknown, 0 Unchecked, 0.5s Time] [2025-02-05 20:13:51,377 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 701 states. [2025-02-05 20:13:51,387 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 701 to 700. [2025-02-05 20:13:51,388 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 700 states, 699 states have (on average 1.4763948497854078) internal successors, (1032), 699 states have internal predecessors, (1032), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-02-05 20:13:51,390 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 700 states to 700 states and 1032 transitions. [2025-02-05 20:13:51,390 INFO L78 Accepts]: Start accepts. Automaton has 700 states and 1032 transitions. Word has length 218 [2025-02-05 20:13:51,390 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-02-05 20:13:51,390 INFO L471 AbstractCegarLoop]: Abstraction has 700 states and 1032 transitions. [2025-02-05 20:13:51,391 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 43.6) internal successors, (218), 5 states have internal predecessors, (218), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-02-05 20:13:51,391 INFO L276 IsEmpty]: Start isEmpty. Operand 700 states and 1032 transitions. [2025-02-05 20:13:51,393 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 220 [2025-02-05 20:13:51,393 INFO L210 NwaCegarLoop]: Found error trace [2025-02-05 20:13:51,393 INFO L218 NwaCegarLoop]: trace histogram [2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-02-05 20:13:51,393 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable8 [2025-02-05 20:13:51,393 INFO L396 AbstractCegarLoop]: === Iteration 10 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-02-05 20:13:51,394 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-02-05 20:13:51,394 INFO L85 PathProgramCache]: Analyzing trace with hash 255038488, now seen corresponding path program 1 times [2025-02-05 20:13:51,394 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-02-05 20:13:51,394 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [251602454] [2025-02-05 20:13:51,394 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-02-05 20:13:51,394 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-02-05 20:13:51,455 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 219 statements into 1 equivalence classes. [2025-02-05 20:13:51,602 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 219 of 219 statements. [2025-02-05 20:13:51,603 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-02-05 20:13:51,603 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-02-05 20:13:52,085 INFO L134 CoverageAnalysis]: Checked inductivity of 28 backedges. 28 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-02-05 20:13:52,086 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-02-05 20:13:52,086 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [251602454] [2025-02-05 20:13:52,086 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [251602454] provided 1 perfect and 0 imperfect interpolant sequences [2025-02-05 20:13:52,086 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-02-05 20:13:52,086 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [8] imperfect sequences [] total 8 [2025-02-05 20:13:52,086 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1990930516] [2025-02-05 20:13:52,086 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-02-05 20:13:52,086 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 8 states [2025-02-05 20:13:52,086 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-02-05 20:13:52,087 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2025-02-05 20:13:52,087 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=18, Invalid=38, Unknown=0, NotChecked=0, Total=56 [2025-02-05 20:13:52,087 INFO L87 Difference]: Start difference. First operand 700 states and 1032 transitions. Second operand has 8 states, 8 states have (on average 27.375) internal successors, (219), 8 states have internal predecessors, (219), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-02-05 20:13:53,039 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-02-05 20:13:53,039 INFO L93 Difference]: Finished difference Result 1405 states and 2075 transitions. [2025-02-05 20:13:53,040 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2025-02-05 20:13:53,040 INFO L78 Accepts]: Start accepts. Automaton has has 8 states, 8 states have (on average 27.375) internal successors, (219), 8 states have internal predecessors, (219), 0 states have call successors, (0), 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 219 [2025-02-05 20:13:53,040 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-02-05 20:13:53,043 INFO L225 Difference]: With dead ends: 1405 [2025-02-05 20:13:53,044 INFO L226 Difference]: Without dead ends: 1046 [2025-02-05 20:13:53,044 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 12 GetRequests, 4 SyntacticMatches, 0 SemanticMatches, 8 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=28, Invalid=62, Unknown=0, NotChecked=0, Total=90 [2025-02-05 20:13:53,045 INFO L435 NwaCegarLoop]: 592 mSDtfsCounter, 1084 mSDsluCounter, 2230 mSDsCounter, 0 mSdLazyCounter, 1807 mSolverCounterSat, 1 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.7s Time, 0 mProtectedPredicate, 0 mProtectedAction, 1084 SdHoareTripleChecker+Valid, 2822 SdHoareTripleChecker+Invalid, 1808 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 1 IncrementalHoareTripleChecker+Valid, 1807 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.9s IncrementalHoareTripleChecker+Time [2025-02-05 20:13:53,045 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [1084 Valid, 2822 Invalid, 1808 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [1 Valid, 1807 Invalid, 0 Unknown, 0 Unchecked, 0.9s Time] [2025-02-05 20:13:53,046 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1046 states. [2025-02-05 20:13:53,055 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1046 to 704. [2025-02-05 20:13:53,057 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 704 states, 703 states have (on average 1.4736842105263157) internal successors, (1036), 703 states have internal predecessors, (1036), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-02-05 20:13:53,058 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 704 states to 704 states and 1036 transitions. [2025-02-05 20:13:53,058 INFO L78 Accepts]: Start accepts. Automaton has 704 states and 1036 transitions. Word has length 219 [2025-02-05 20:13:53,059 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-02-05 20:13:53,059 INFO L471 AbstractCegarLoop]: Abstraction has 704 states and 1036 transitions. [2025-02-05 20:13:53,059 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 8 states, 8 states have (on average 27.375) internal successors, (219), 8 states have internal predecessors, (219), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-02-05 20:13:53,059 INFO L276 IsEmpty]: Start isEmpty. Operand 704 states and 1036 transitions. [2025-02-05 20:13:53,060 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 221 [2025-02-05 20:13:53,060 INFO L210 NwaCegarLoop]: Found error trace [2025-02-05 20:13:53,061 INFO L218 NwaCegarLoop]: trace histogram [2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-02-05 20:13:53,061 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable9 [2025-02-05 20:13:53,061 INFO L396 AbstractCegarLoop]: === Iteration 11 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-02-05 20:13:53,061 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-02-05 20:13:53,061 INFO L85 PathProgramCache]: Analyzing trace with hash 766944056, now seen corresponding path program 1 times [2025-02-05 20:13:53,061 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-02-05 20:13:53,061 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [189552347] [2025-02-05 20:13:53,062 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-02-05 20:13:53,062 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-02-05 20:13:53,110 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 220 statements into 1 equivalence classes. [2025-02-05 20:13:53,363 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 220 of 220 statements. [2025-02-05 20:13:53,364 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-02-05 20:13:53,364 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-02-05 20:13:54,127 INFO L134 CoverageAnalysis]: Checked inductivity of 28 backedges. 7 proven. 17 refuted. 0 times theorem prover too weak. 4 trivial. 0 not checked. [2025-02-05 20:13:54,127 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-02-05 20:13:54,128 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [189552347] [2025-02-05 20:13:54,128 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [189552347] provided 0 perfect and 1 imperfect interpolant sequences [2025-02-05 20:13:54,128 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [483163773] [2025-02-05 20:13:54,128 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-02-05 20:13:54,128 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-02-05 20:13:54,128 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 [2025-02-05 20:13:54,130 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 20:13:54,131 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 20:13:54,448 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 220 statements into 1 equivalence classes. [2025-02-05 20:13:54,655 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 220 of 220 statements. [2025-02-05 20:13:54,656 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-02-05 20:13:54,656 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-02-05 20:13:54,663 INFO L256 TraceCheckSpWp]: Trace formula consists of 1440 conjuncts, 71 conjuncts are in the unsatisfiable core [2025-02-05 20:13:54,671 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-02-05 20:13:55,597 INFO L134 CoverageAnalysis]: Checked inductivity of 28 backedges. 6 proven. 22 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-02-05 20:13:55,597 INFO L312 TraceCheckSpWp]: Computing backward predicates... [2025-02-05 20:13:56,278 INFO L134 CoverageAnalysis]: Checked inductivity of 28 backedges. 24 proven. 4 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-02-05 20:13:56,280 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [483163773] provided 0 perfect and 2 imperfect interpolant sequences [2025-02-05 20:13:56,280 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2025-02-05 20:13:56,280 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [8, 15, 10] total 29 [2025-02-05 20:13:56,280 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [598826737] [2025-02-05 20:13:56,280 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2025-02-05 20:13:56,281 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 29 states [2025-02-05 20:13:56,281 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-02-05 20:13:56,282 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 29 interpolants. [2025-02-05 20:13:56,282 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=123, Invalid=689, Unknown=0, NotChecked=0, Total=812 [2025-02-05 20:13:56,283 INFO L87 Difference]: Start difference. First operand 704 states and 1036 transitions. Second operand has 29 states, 29 states have (on average 21.93103448275862) internal successors, (636), 29 states have internal predecessors, (636), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-02-05 20:13:58,003 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-02-05 20:13:58,004 INFO L93 Difference]: Finished difference Result 1355 states and 1991 transitions. [2025-02-05 20:13:58,004 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 21 states. [2025-02-05 20:13:58,005 INFO L78 Accepts]: Start accepts. Automaton has has 29 states, 29 states have (on average 21.93103448275862) internal successors, (636), 29 states have internal predecessors, (636), 0 states have call successors, (0), 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 220 [2025-02-05 20:13:58,005 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-02-05 20:13:58,008 INFO L225 Difference]: With dead ends: 1355 [2025-02-05 20:13:58,008 INFO L226 Difference]: Without dead ends: 728 [2025-02-05 20:13:58,009 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 466 GetRequests, 420 SyntacticMatches, 0 SemanticMatches, 46 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 380 ImplicationChecksByTransitivity, 0.6s TimeCoverageRelationStatistics Valid=361, Invalid=1895, Unknown=0, NotChecked=0, Total=2256 [2025-02-05 20:13:58,009 INFO L435 NwaCegarLoop]: 309 mSDtfsCounter, 1115 mSDsluCounter, 4846 mSDsCounter, 0 mSdLazyCounter, 3842 mSolverCounterSat, 5 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 1.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 1115 SdHoareTripleChecker+Valid, 5155 SdHoareTripleChecker+Invalid, 3847 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 5 IncrementalHoareTripleChecker+Valid, 3842 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 1.4s IncrementalHoareTripleChecker+Time [2025-02-05 20:13:58,009 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [1115 Valid, 5155 Invalid, 3847 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [5 Valid, 3842 Invalid, 0 Unknown, 0 Unchecked, 1.4s Time] [2025-02-05 20:13:58,010 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 728 states. [2025-02-05 20:13:58,019 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 728 to 713. [2025-02-05 20:13:58,020 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 713 states, 712 states have (on average 1.4719101123595506) internal successors, (1048), 712 states have internal predecessors, (1048), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-02-05 20:13:58,022 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 713 states to 713 states and 1048 transitions. [2025-02-05 20:13:58,022 INFO L78 Accepts]: Start accepts. Automaton has 713 states and 1048 transitions. Word has length 220 [2025-02-05 20:13:58,024 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-02-05 20:13:58,024 INFO L471 AbstractCegarLoop]: Abstraction has 713 states and 1048 transitions. [2025-02-05 20:13:58,024 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 29 states, 29 states have (on average 21.93103448275862) internal successors, (636), 29 states have internal predecessors, (636), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-02-05 20:13:58,024 INFO L276 IsEmpty]: Start isEmpty. Operand 713 states and 1048 transitions. [2025-02-05 20:13:58,026 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 223 [2025-02-05 20:13:58,026 INFO L210 NwaCegarLoop]: Found error trace [2025-02-05 20:13:58,026 INFO L218 NwaCegarLoop]: trace histogram [2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-02-05 20:13:58,038 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (4)] Ended with exit code 0 [2025-02-05 20:13:58,231 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable10,4 /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-02-05 20:13:58,231 INFO L396 AbstractCegarLoop]: === Iteration 12 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-02-05 20:13:58,232 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-02-05 20:13:58,232 INFO L85 PathProgramCache]: Analyzing trace with hash -193082095, now seen corresponding path program 1 times [2025-02-05 20:13:58,232 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-02-05 20:13:58,232 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1863937846] [2025-02-05 20:13:58,232 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-02-05 20:13:58,232 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-02-05 20:13:58,278 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 222 statements into 1 equivalence classes. [2025-02-05 20:13:58,324 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 222 of 222 statements. [2025-02-05 20:13:58,325 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-02-05 20:13:58,325 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-02-05 20:13:58,772 INFO L134 CoverageAnalysis]: Checked inductivity of 28 backedges. 24 proven. 4 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-02-05 20:13:58,772 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-02-05 20:13:58,772 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1863937846] [2025-02-05 20:13:58,772 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1863937846] provided 0 perfect and 1 imperfect interpolant sequences [2025-02-05 20:13:58,772 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1852949463] [2025-02-05 20:13:58,772 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-02-05 20:13:58,773 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-02-05 20:13:58,773 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 [2025-02-05 20:13:58,775 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 20:13:58,777 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 20:13:59,059 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 222 statements into 1 equivalence classes. [2025-02-05 20:13:59,277 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 222 of 222 statements. [2025-02-05 20:13:59,278 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-02-05 20:13:59,278 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-02-05 20:13:59,285 INFO L256 TraceCheckSpWp]: Trace formula consists of 1446 conjuncts, 38 conjuncts are in the unsatisfiable core [2025-02-05 20:13:59,289 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-02-05 20:13:59,896 INFO L134 CoverageAnalysis]: Checked inductivity of 28 backedges. 24 proven. 4 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-02-05 20:13:59,896 INFO L312 TraceCheckSpWp]: Computing backward predicates... [2025-02-05 20:14:00,817 INFO L134 CoverageAnalysis]: Checked inductivity of 28 backedges. 21 proven. 7 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-02-05 20:14:00,817 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1852949463] provided 0 perfect and 2 imperfect interpolant sequences [2025-02-05 20:14:00,817 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2025-02-05 20:14:00,817 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [8, 7, 11] total 22 [2025-02-05 20:14:00,818 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1511858856] [2025-02-05 20:14:00,818 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2025-02-05 20:14:00,818 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 22 states [2025-02-05 20:14:00,818 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-02-05 20:14:00,819 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 22 interpolants. [2025-02-05 20:14:00,819 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=61, Invalid=401, Unknown=0, NotChecked=0, Total=462 [2025-02-05 20:14:00,820 INFO L87 Difference]: Start difference. First operand 713 states and 1048 transitions. Second operand has 22 states, 22 states have (on average 28.681818181818183) internal successors, (631), 22 states have internal predecessors, (631), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-02-05 20:14:02,219 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-02-05 20:14:02,219 INFO L93 Difference]: Finished difference Result 1438 states and 2107 transitions. [2025-02-05 20:14:02,220 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 16 states. [2025-02-05 20:14:02,221 INFO L78 Accepts]: Start accepts. Automaton has has 22 states, 22 states have (on average 28.681818181818183) internal successors, (631), 22 states have internal predecessors, (631), 0 states have call successors, (0), 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 222 [2025-02-05 20:14:02,222 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-02-05 20:14:02,225 INFO L225 Difference]: With dead ends: 1438 [2025-02-05 20:14:02,229 INFO L226 Difference]: Without dead ends: 771 [2025-02-05 20:14:02,231 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 465 GetRequests, 432 SyntacticMatches, 0 SemanticMatches, 33 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 204 ImplicationChecksByTransitivity, 0.3s TimeCoverageRelationStatistics Valid=206, Invalid=984, Unknown=0, NotChecked=0, Total=1190 [2025-02-05 20:14:02,231 INFO L435 NwaCegarLoop]: 311 mSDtfsCounter, 3322 mSDsluCounter, 4341 mSDsCounter, 0 mSdLazyCounter, 3368 mSolverCounterSat, 9 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 1.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 3322 SdHoareTripleChecker+Valid, 4652 SdHoareTripleChecker+Invalid, 3377 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 9 IncrementalHoareTripleChecker+Valid, 3368 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 1.2s IncrementalHoareTripleChecker+Time [2025-02-05 20:14:02,231 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [3322 Valid, 4652 Invalid, 3377 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [9 Valid, 3368 Invalid, 0 Unknown, 0 Unchecked, 1.2s Time] [2025-02-05 20:14:02,232 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 771 states. [2025-02-05 20:14:02,253 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 771 to 727. [2025-02-05 20:14:02,255 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 727 states, 726 states have (on average 1.465564738292011) internal successors, (1064), 726 states have internal predecessors, (1064), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-02-05 20:14:02,255 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 727 states to 727 states and 1064 transitions. [2025-02-05 20:14:02,256 INFO L78 Accepts]: Start accepts. Automaton has 727 states and 1064 transitions. Word has length 222 [2025-02-05 20:14:02,260 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-02-05 20:14:02,260 INFO L471 AbstractCegarLoop]: Abstraction has 727 states and 1064 transitions. [2025-02-05 20:14:02,260 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 22 states, 22 states have (on average 28.681818181818183) internal successors, (631), 22 states have internal predecessors, (631), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-02-05 20:14:02,260 INFO L276 IsEmpty]: Start isEmpty. Operand 727 states and 1064 transitions. [2025-02-05 20:14:02,263 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 383 [2025-02-05 20:14:02,263 INFO L210 NwaCegarLoop]: Found error trace [2025-02-05 20:14:02,263 INFO L218 NwaCegarLoop]: trace histogram [3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 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] [2025-02-05 20:14:02,274 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (5)] Ended with exit code 0 [2025-02-05 20:14:02,464 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 5 /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable11 [2025-02-05 20:14:02,464 INFO L396 AbstractCegarLoop]: === Iteration 13 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-02-05 20:14:02,466 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-02-05 20:14:02,466 INFO L85 PathProgramCache]: Analyzing trace with hash 1080331327, now seen corresponding path program 1 times [2025-02-05 20:14:02,466 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-02-05 20:14:02,466 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1083223131] [2025-02-05 20:14:02,466 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-02-05 20:14:02,466 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-02-05 20:14:02,567 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 382 statements into 1 equivalence classes. [2025-02-05 20:14:03,225 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 382 of 382 statements. [2025-02-05 20:14:03,225 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-02-05 20:14:03,225 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-02-05 20:14:03,852 INFO L134 CoverageAnalysis]: Checked inductivity of 215 backedges. 185 proven. 30 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-02-05 20:14:03,853 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-02-05 20:14:03,853 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1083223131] [2025-02-05 20:14:03,853 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1083223131] provided 0 perfect and 1 imperfect interpolant sequences [2025-02-05 20:14:03,853 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1178409822] [2025-02-05 20:14:03,853 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-02-05 20:14:03,853 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-02-05 20:14:03,853 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 [2025-02-05 20:14:03,855 INFO L229 MonitoredProcess]: Starting monitored process 6 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 20:14:03,856 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (6)] Waiting until timeout for monitored process [2025-02-05 20:14:04,220 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 382 statements into 1 equivalence classes. [2025-02-05 20:14:04,733 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 382 of 382 statements. [2025-02-05 20:14:04,733 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-02-05 20:14:04,733 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-02-05 20:14:04,744 INFO L256 TraceCheckSpWp]: Trace formula consists of 2478 conjuncts, 16 conjuncts are in the unsatisfiable core [2025-02-05 20:14:04,751 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-02-05 20:14:05,172 INFO L134 CoverageAnalysis]: Checked inductivity of 215 backedges. 185 proven. 30 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-02-05 20:14:05,172 INFO L312 TraceCheckSpWp]: Computing backward predicates... [2025-02-05 20:14:05,803 INFO L134 CoverageAnalysis]: Checked inductivity of 215 backedges. 185 proven. 30 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-02-05 20:14:05,803 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1178409822] provided 0 perfect and 2 imperfect interpolant sequences [2025-02-05 20:14:05,804 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2025-02-05 20:14:05,804 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [8, 8, 8] total 15 [2025-02-05 20:14:05,804 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [255955963] [2025-02-05 20:14:05,804 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2025-02-05 20:14:05,805 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 15 states [2025-02-05 20:14:05,805 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-02-05 20:14:05,805 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 15 interpolants. [2025-02-05 20:14:05,806 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=38, Invalid=172, Unknown=0, NotChecked=0, Total=210 [2025-02-05 20:14:05,806 INFO L87 Difference]: Start difference. First operand 727 states and 1064 transitions. Second operand has 15 states, 15 states have (on average 39.93333333333333) internal successors, (599), 15 states have internal predecessors, (599), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-02-05 20:14:06,318 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-02-05 20:14:06,319 INFO L93 Difference]: Finished difference Result 1141 states and 1669 transitions. [2025-02-05 20:14:06,319 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 11 states. [2025-02-05 20:14:06,324 INFO L78 Accepts]: Start accepts. Automaton has has 15 states, 15 states have (on average 39.93333333333333) internal successors, (599), 15 states have internal predecessors, (599), 0 states have call successors, (0), 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 382 [2025-02-05 20:14:06,324 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-02-05 20:14:06,327 INFO L225 Difference]: With dead ends: 1141 [2025-02-05 20:14:06,327 INFO L226 Difference]: Without dead ends: 772 [2025-02-05 20:14:06,327 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 778 GetRequests, 757 SyntacticMatches, 0 SemanticMatches, 21 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 65 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=109, Invalid=397, Unknown=0, NotChecked=0, Total=506 [2025-02-05 20:14:06,332 INFO L435 NwaCegarLoop]: 380 mSDtfsCounter, 2249 mSDsluCounter, 1985 mSDsCounter, 0 mSdLazyCounter, 1026 mSolverCounterSat, 2 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.4s Time, 0 mProtectedPredicate, 0 mProtectedAction, 2249 SdHoareTripleChecker+Valid, 2365 SdHoareTripleChecker+Invalid, 1028 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 2 IncrementalHoareTripleChecker+Valid, 1026 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.4s IncrementalHoareTripleChecker+Time [2025-02-05 20:14:06,332 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [2249 Valid, 2365 Invalid, 1028 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [2 Valid, 1026 Invalid, 0 Unknown, 0 Unchecked, 0.4s Time] [2025-02-05 20:14:06,333 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 772 states. [2025-02-05 20:14:06,347 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 772 to 770. [2025-02-05 20:14:06,354 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 770 states, 769 states have (on average 1.459037711313394) internal successors, (1122), 769 states have internal predecessors, (1122), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-02-05 20:14:06,358 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 770 states to 770 states and 1122 transitions. [2025-02-05 20:14:06,358 INFO L78 Accepts]: Start accepts. Automaton has 770 states and 1122 transitions. Word has length 382 [2025-02-05 20:14:06,358 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-02-05 20:14:06,359 INFO L471 AbstractCegarLoop]: Abstraction has 770 states and 1122 transitions. [2025-02-05 20:14:06,359 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 15 states, 15 states have (on average 39.93333333333333) internal successors, (599), 15 states have internal predecessors, (599), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-02-05 20:14:06,359 INFO L276 IsEmpty]: Start isEmpty. Operand 770 states and 1122 transitions. [2025-02-05 20:14:06,365 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 384 [2025-02-05 20:14:06,366 INFO L210 NwaCegarLoop]: Found error trace [2025-02-05 20:14:06,366 INFO L218 NwaCegarLoop]: trace histogram [3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 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] [2025-02-05 20:14:06,380 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (6)] Forceful destruction successful, exit code 0 [2025-02-05 20:14:06,567 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 6 /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable12 [2025-02-05 20:14:06,567 INFO L396 AbstractCegarLoop]: === Iteration 14 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-02-05 20:14:06,569 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-02-05 20:14:06,569 INFO L85 PathProgramCache]: Analyzing trace with hash 1839489895, now seen corresponding path program 1 times [2025-02-05 20:14:06,569 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-02-05 20:14:06,569 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [808356682] [2025-02-05 20:14:06,569 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-02-05 20:14:06,569 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-02-05 20:14:06,630 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 383 statements into 1 equivalence classes. [2025-02-05 20:14:07,119 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 383 of 383 statements. [2025-02-05 20:14:07,120 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-02-05 20:14:07,120 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-02-05 20:14:07,781 INFO L134 CoverageAnalysis]: Checked inductivity of 216 backedges. 185 proven. 31 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-02-05 20:14:07,782 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-02-05 20:14:07,782 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [808356682] [2025-02-05 20:14:07,782 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [808356682] provided 0 perfect and 1 imperfect interpolant sequences [2025-02-05 20:14:07,782 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [910927475] [2025-02-05 20:14:07,782 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-02-05 20:14:07,782 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-02-05 20:14:07,782 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 [2025-02-05 20:14:07,785 INFO L229 MonitoredProcess]: Starting monitored process 7 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 20:14:07,786 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (7)] Waiting until timeout for monitored process [2025-02-05 20:14:08,173 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 383 statements into 1 equivalence classes. [2025-02-05 20:14:08,782 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 383 of 383 statements. [2025-02-05 20:14:08,782 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-02-05 20:14:08,782 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-02-05 20:14:08,800 INFO L256 TraceCheckSpWp]: Trace formula consists of 2481 conjuncts, 45 conjuncts are in the unsatisfiable core [2025-02-05 20:14:08,806 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-02-05 20:14:10,196 INFO L134 CoverageAnalysis]: Checked inductivity of 216 backedges. 12 proven. 196 refuted. 0 times theorem prover too weak. 8 trivial. 0 not checked. [2025-02-05 20:14:10,197 INFO L312 TraceCheckSpWp]: Computing backward predicates... [2025-02-05 20:14:11,270 INFO L134 CoverageAnalysis]: Checked inductivity of 216 backedges. 60 proven. 39 refuted. 0 times theorem prover too weak. 117 trivial. 0 not checked. [2025-02-05 20:14:11,270 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [910927475] provided 0 perfect and 2 imperfect interpolant sequences [2025-02-05 20:14:11,270 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2025-02-05 20:14:11,270 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [7, 12, 10] total 25 [2025-02-05 20:14:11,271 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1692241431] [2025-02-05 20:14:11,271 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2025-02-05 20:14:11,271 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 25 states [2025-02-05 20:14:11,271 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-02-05 20:14:11,272 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 25 interpolants. [2025-02-05 20:14:11,273 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=85, Invalid=515, Unknown=0, NotChecked=0, Total=600 [2025-02-05 20:14:11,277 INFO L87 Difference]: Start difference. First operand 770 states and 1122 transitions. Second operand has 25 states, 25 states have (on average 40.48) internal successors, (1012), 25 states have internal predecessors, (1012), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-02-05 20:14:13,143 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-02-05 20:14:13,143 INFO L93 Difference]: Finished difference Result 1484 states and 2163 transitions. [2025-02-05 20:14:13,144 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 30 states. [2025-02-05 20:14:13,144 INFO L78 Accepts]: Start accepts. Automaton has has 25 states, 25 states have (on average 40.48) internal successors, (1012), 25 states have internal predecessors, (1012), 0 states have call successors, (0), 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 383 [2025-02-05 20:14:13,144 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-02-05 20:14:13,146 INFO L225 Difference]: With dead ends: 1484 [2025-02-05 20:14:13,146 INFO L226 Difference]: Without dead ends: 792 [2025-02-05 20:14:13,148 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 800 GetRequests, 749 SyntacticMatches, 0 SemanticMatches, 51 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 462 ImplicationChecksByTransitivity, 0.7s TimeCoverageRelationStatistics Valid=511, Invalid=2245, Unknown=0, NotChecked=0, Total=2756 [2025-02-05 20:14:13,149 INFO L435 NwaCegarLoop]: 262 mSDtfsCounter, 3736 mSDsluCounter, 3073 mSDsCounter, 0 mSdLazyCounter, 3540 mSolverCounterSat, 10 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 1.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 3736 SdHoareTripleChecker+Valid, 3335 SdHoareTripleChecker+Invalid, 3550 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 10 IncrementalHoareTripleChecker+Valid, 3540 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 1.4s IncrementalHoareTripleChecker+Time [2025-02-05 20:14:13,149 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [3736 Valid, 3335 Invalid, 3550 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [10 Valid, 3540 Invalid, 0 Unknown, 0 Unchecked, 1.4s Time] [2025-02-05 20:14:13,150 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 792 states. [2025-02-05 20:14:13,157 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 792 to 771. [2025-02-05 20:14:13,158 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 771 states, 770 states have (on average 1.4584415584415584) internal successors, (1123), 770 states have internal predecessors, (1123), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-02-05 20:14:13,159 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 771 states to 771 states and 1123 transitions. [2025-02-05 20:14:13,159 INFO L78 Accepts]: Start accepts. Automaton has 771 states and 1123 transitions. Word has length 383 [2025-02-05 20:14:13,159 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-02-05 20:14:13,159 INFO L471 AbstractCegarLoop]: Abstraction has 771 states and 1123 transitions. [2025-02-05 20:14:13,159 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 25 states, 25 states have (on average 40.48) internal successors, (1012), 25 states have internal predecessors, (1012), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-02-05 20:14:13,160 INFO L276 IsEmpty]: Start isEmpty. Operand 771 states and 1123 transitions. [2025-02-05 20:14:13,161 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 385 [2025-02-05 20:14:13,161 INFO L210 NwaCegarLoop]: Found error trace [2025-02-05 20:14:13,161 INFO L218 NwaCegarLoop]: trace histogram [3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 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] [2025-02-05 20:14:13,174 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (7)] Forceful destruction successful, exit code 0 [2025-02-05 20:14:13,362 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 7 /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable13 [2025-02-05 20:14:13,363 INFO L396 AbstractCegarLoop]: === Iteration 15 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-02-05 20:14:13,363 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-02-05 20:14:13,363 INFO L85 PathProgramCache]: Analyzing trace with hash 372408341, now seen corresponding path program 1 times [2025-02-05 20:14:13,363 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-02-05 20:14:13,363 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2143333389] [2025-02-05 20:14:13,364 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-02-05 20:14:13,364 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-02-05 20:14:13,424 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 384 statements into 1 equivalence classes. [2025-02-05 20:14:14,874 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 384 of 384 statements. [2025-02-05 20:14:14,875 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-02-05 20:14:14,875 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-02-05 20:14:15,691 INFO L134 CoverageAnalysis]: Checked inductivity of 217 backedges. 191 proven. 0 refuted. 0 times theorem prover too weak. 26 trivial. 0 not checked. [2025-02-05 20:14:15,691 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-02-05 20:14:15,691 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2143333389] [2025-02-05 20:14:15,691 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [2143333389] provided 1 perfect and 0 imperfect interpolant sequences [2025-02-05 20:14:15,691 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-02-05 20:14:15,691 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [8] imperfect sequences [] total 8 [2025-02-05 20:14:15,691 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1150413909] [2025-02-05 20:14:15,691 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-02-05 20:14:15,691 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 8 states [2025-02-05 20:14:15,692 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-02-05 20:14:15,693 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2025-02-05 20:14:15,693 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=18, Invalid=38, Unknown=0, NotChecked=0, Total=56 [2025-02-05 20:14:15,693 INFO L87 Difference]: Start difference. First operand 771 states and 1123 transitions. Second operand has 8 states, 8 states have (on average 45.625) internal successors, (365), 8 states have internal predecessors, (365), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-02-05 20:14:16,545 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-02-05 20:14:16,545 INFO L93 Difference]: Finished difference Result 1591 states and 2317 transitions. [2025-02-05 20:14:16,545 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2025-02-05 20:14:16,546 INFO L78 Accepts]: Start accepts. Automaton has has 8 states, 8 states have (on average 45.625) internal successors, (365), 8 states have internal predecessors, (365), 0 states have call successors, (0), 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 384 [2025-02-05 20:14:16,546 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-02-05 20:14:16,549 INFO L225 Difference]: With dead ends: 1591 [2025-02-05 20:14:16,549 INFO L226 Difference]: Without dead ends: 1176 [2025-02-05 20:14:16,549 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 12 GetRequests, 4 SyntacticMatches, 0 SemanticMatches, 8 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=28, Invalid=62, Unknown=0, NotChecked=0, Total=90 [2025-02-05 20:14:16,550 INFO L435 NwaCegarLoop]: 604 mSDtfsCounter, 1063 mSDsluCounter, 2276 mSDsCounter, 0 mSdLazyCounter, 1859 mSolverCounterSat, 1 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.7s Time, 0 mProtectedPredicate, 0 mProtectedAction, 1063 SdHoareTripleChecker+Valid, 2880 SdHoareTripleChecker+Invalid, 1860 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 1 IncrementalHoareTripleChecker+Valid, 1859 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.8s IncrementalHoareTripleChecker+Time [2025-02-05 20:14:16,550 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [1063 Valid, 2880 Invalid, 1860 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [1 Valid, 1859 Invalid, 0 Unknown, 0 Unchecked, 0.8s Time] [2025-02-05 20:14:16,551 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1176 states. [2025-02-05 20:14:16,557 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1176 to 771. [2025-02-05 20:14:16,558 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 771 states, 770 states have (on average 1.4584415584415584) internal successors, (1123), 770 states have internal predecessors, (1123), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-02-05 20:14:16,559 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 771 states to 771 states and 1123 transitions. [2025-02-05 20:14:16,559 INFO L78 Accepts]: Start accepts. Automaton has 771 states and 1123 transitions. Word has length 384 [2025-02-05 20:14:16,559 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-02-05 20:14:16,559 INFO L471 AbstractCegarLoop]: Abstraction has 771 states and 1123 transitions. [2025-02-05 20:14:16,559 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 8 states, 8 states have (on average 45.625) internal successors, (365), 8 states have internal predecessors, (365), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-02-05 20:14:16,559 INFO L276 IsEmpty]: Start isEmpty. Operand 771 states and 1123 transitions. [2025-02-05 20:14:16,561 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 386 [2025-02-05 20:14:16,561 INFO L210 NwaCegarLoop]: Found error trace [2025-02-05 20:14:16,561 INFO L218 NwaCegarLoop]: trace histogram [3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 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] [2025-02-05 20:14:16,561 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable14 [2025-02-05 20:14:16,561 INFO L396 AbstractCegarLoop]: === Iteration 16 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-02-05 20:14:16,562 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-02-05 20:14:16,562 INFO L85 PathProgramCache]: Analyzing trace with hash -1176823813, now seen corresponding path program 1 times [2025-02-05 20:14:16,562 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-02-05 20:14:16,562 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2025905948] [2025-02-05 20:14:16,562 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-02-05 20:14:16,562 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-02-05 20:14:16,620 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 385 statements into 1 equivalence classes. [2025-02-05 20:14:17,154 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 385 of 385 statements. [2025-02-05 20:14:17,155 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-02-05 20:14:17,155 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-02-05 20:14:18,199 INFO L134 CoverageAnalysis]: Checked inductivity of 219 backedges. 81 proven. 138 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-02-05 20:14:18,199 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-02-05 20:14:18,199 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2025905948] [2025-02-05 20:14:18,199 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [2025905948] provided 0 perfect and 1 imperfect interpolant sequences [2025-02-05 20:14:18,199 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [18401792] [2025-02-05 20:14:18,200 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-02-05 20:14:18,200 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-02-05 20:14:18,200 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 [2025-02-05 20:14:18,203 INFO L229 MonitoredProcess]: Starting monitored process 8 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 20:14:18,204 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (8)] Waiting until timeout for monitored process [2025-02-05 20:14:18,659 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 385 statements into 1 equivalence classes. [2025-02-05 20:14:19,212 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 385 of 385 statements. [2025-02-05 20:14:19,212 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-02-05 20:14:19,212 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-02-05 20:14:19,223 INFO L256 TraceCheckSpWp]: Trace formula consists of 2483 conjuncts, 31 conjuncts are in the unsatisfiable core [2025-02-05 20:14:19,229 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-02-05 20:14:19,614 INFO L134 CoverageAnalysis]: Checked inductivity of 219 backedges. 17 proven. 55 refuted. 0 times theorem prover too weak. 147 trivial. 0 not checked. [2025-02-05 20:14:19,614 INFO L312 TraceCheckSpWp]: Computing backward predicates... [2025-02-05 20:14:20,266 INFO L134 CoverageAnalysis]: Checked inductivity of 219 backedges. 60 proven. 12 refuted. 0 times theorem prover too weak. 147 trivial. 0 not checked. [2025-02-05 20:14:20,266 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [18401792] provided 0 perfect and 2 imperfect interpolant sequences [2025-02-05 20:14:20,267 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2025-02-05 20:14:20,267 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [10, 9, 10] total 25 [2025-02-05 20:14:20,267 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1097611659] [2025-02-05 20:14:20,267 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2025-02-05 20:14:20,268 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 25 states [2025-02-05 20:14:20,268 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-02-05 20:14:20,268 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 25 interpolants. [2025-02-05 20:14:20,269 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=70, Invalid=530, Unknown=0, NotChecked=0, Total=600 [2025-02-05 20:14:20,269 INFO L87 Difference]: Start difference. First operand 771 states and 1123 transitions. Second operand has 25 states, 25 states have (on average 33.68) internal successors, (842), 25 states have internal predecessors, (842), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-02-05 20:14:23,376 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-02-05 20:14:23,376 INFO L93 Difference]: Finished difference Result 2218 states and 3227 transitions. [2025-02-05 20:14:23,377 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 40 states. [2025-02-05 20:14:23,377 INFO L78 Accepts]: Start accepts. Automaton has has 25 states, 25 states have (on average 33.68) internal successors, (842), 25 states have internal predecessors, (842), 0 states have call successors, (0), 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 385 [2025-02-05 20:14:23,378 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-02-05 20:14:23,381 INFO L225 Difference]: With dead ends: 2218 [2025-02-05 20:14:23,381 INFO L226 Difference]: Without dead ends: 1514 [2025-02-05 20:14:23,382 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 817 GetRequests, 757 SyntacticMatches, 0 SemanticMatches, 60 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 764 ImplicationChecksByTransitivity, 0.7s TimeCoverageRelationStatistics Valid=500, Invalid=3282, Unknown=0, NotChecked=0, Total=3782 [2025-02-05 20:14:23,383 INFO L435 NwaCegarLoop]: 620 mSDtfsCounter, 1660 mSDsluCounter, 8884 mSDsCounter, 0 mSdLazyCounter, 6758 mSolverCounterSat, 4 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 2.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 1660 SdHoareTripleChecker+Valid, 9504 SdHoareTripleChecker+Invalid, 6762 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 4 IncrementalHoareTripleChecker+Valid, 6758 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 2.5s IncrementalHoareTripleChecker+Time [2025-02-05 20:14:23,383 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [1660 Valid, 9504 Invalid, 6762 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [4 Valid, 6758 Invalid, 0 Unknown, 0 Unchecked, 2.5s Time] [2025-02-05 20:14:23,384 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1514 states. [2025-02-05 20:14:23,397 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1514 to 1267. [2025-02-05 20:14:23,398 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 1267 states, 1266 states have (on average 1.44391785150079) internal successors, (1828), 1266 states have internal predecessors, (1828), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-02-05 20:14:23,399 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1267 states to 1267 states and 1828 transitions. [2025-02-05 20:14:23,400 INFO L78 Accepts]: Start accepts. Automaton has 1267 states and 1828 transitions. Word has length 385 [2025-02-05 20:14:23,400 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-02-05 20:14:23,400 INFO L471 AbstractCegarLoop]: Abstraction has 1267 states and 1828 transitions. [2025-02-05 20:14:23,400 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 25 states, 25 states have (on average 33.68) internal successors, (842), 25 states have internal predecessors, (842), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-02-05 20:14:23,400 INFO L276 IsEmpty]: Start isEmpty. Operand 1267 states and 1828 transitions. [2025-02-05 20:14:23,402 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 387 [2025-02-05 20:14:23,403 INFO L210 NwaCegarLoop]: Found error trace [2025-02-05 20:14:23,403 INFO L218 NwaCegarLoop]: trace histogram [3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 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] [2025-02-05 20:14:23,419 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (8)] Forceful destruction successful, exit code 0 [2025-02-05 20:14:23,603 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable15,8 /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-02-05 20:14:23,603 INFO L396 AbstractCegarLoop]: === Iteration 17 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-02-05 20:14:23,604 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-02-05 20:14:23,604 INFO L85 PathProgramCache]: Analyzing trace with hash 333207908, now seen corresponding path program 1 times [2025-02-05 20:14:23,604 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-02-05 20:14:23,604 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1007661032] [2025-02-05 20:14:23,604 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-02-05 20:14:23,604 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-02-05 20:14:23,663 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 386 statements into 1 equivalence classes. [2025-02-05 20:14:24,928 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 386 of 386 statements. [2025-02-05 20:14:24,928 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-02-05 20:14:24,928 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-02-05 20:14:25,759 INFO L134 CoverageAnalysis]: Checked inductivity of 217 backedges. 88 proven. 129 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-02-05 20:14:25,760 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-02-05 20:14:25,760 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1007661032] [2025-02-05 20:14:25,760 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1007661032] provided 0 perfect and 1 imperfect interpolant sequences [2025-02-05 20:14:25,760 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [2105721341] [2025-02-05 20:14:25,760 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-02-05 20:14:25,761 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-02-05 20:14:25,761 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 [2025-02-05 20:14:25,763 INFO L229 MonitoredProcess]: Starting monitored process 9 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 20:14:25,765 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (9)] Waiting until timeout for monitored process [2025-02-05 20:14:26,276 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 386 statements into 1 equivalence classes. [2025-02-05 20:14:26,744 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 386 of 386 statements. [2025-02-05 20:14:26,744 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-02-05 20:14:26,744 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-02-05 20:14:26,758 INFO L256 TraceCheckSpWp]: Trace formula consists of 2484 conjuncts, 15 conjuncts are in the unsatisfiable core [2025-02-05 20:14:26,772 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-02-05 20:14:27,635 INFO L134 CoverageAnalysis]: Checked inductivity of 217 backedges. 88 proven. 129 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-02-05 20:14:27,635 INFO L312 TraceCheckSpWp]: Computing backward predicates... [2025-02-05 20:14:28,393 INFO L134 CoverageAnalysis]: Checked inductivity of 217 backedges. 217 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-02-05 20:14:28,393 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [2105721341] provided 1 perfect and 1 imperfect interpolant sequences [2025-02-05 20:14:28,393 INFO L185 FreeRefinementEngine]: Found 1 perfect and 2 imperfect interpolant sequences. [2025-02-05 20:14:28,394 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [8, 8] total 13 [2025-02-05 20:14:28,394 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1475968543] [2025-02-05 20:14:28,394 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-02-05 20:14:28,395 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2025-02-05 20:14:28,395 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-02-05 20:14:28,396 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2025-02-05 20:14:28,396 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=43, Invalid=113, Unknown=0, NotChecked=0, Total=156 [2025-02-05 20:14:28,396 INFO L87 Difference]: Start difference. First operand 1267 states and 1828 transitions. Second operand has 6 states, 6 states have (on average 64.33333333333333) internal successors, (386), 6 states have internal predecessors, (386), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-02-05 20:14:28,830 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-02-05 20:14:28,831 INFO L93 Difference]: Finished difference Result 2413 states and 3496 transitions. [2025-02-05 20:14:28,831 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2025-02-05 20:14:28,831 INFO L78 Accepts]: Start accepts. Automaton has has 6 states, 6 states have (on average 64.33333333333333) internal successors, (386), 6 states have internal predecessors, (386), 0 states have call successors, (0), 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 386 [2025-02-05 20:14:28,832 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-02-05 20:14:28,835 INFO L225 Difference]: With dead ends: 2413 [2025-02-05 20:14:28,835 INFO L226 Difference]: Without dead ends: 1626 [2025-02-05 20:14:28,836 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 779 GetRequests, 767 SyntacticMatches, 1 SemanticMatches, 11 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 36 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=43, Invalid=113, Unknown=0, NotChecked=0, Total=156 [2025-02-05 20:14:28,836 INFO L435 NwaCegarLoop]: 325 mSDtfsCounter, 1239 mSDsluCounter, 642 mSDsCounter, 0 mSdLazyCounter, 646 mSolverCounterSat, 2 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.3s Time, 0 mProtectedPredicate, 0 mProtectedAction, 1239 SdHoareTripleChecker+Valid, 967 SdHoareTripleChecker+Invalid, 648 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 2 IncrementalHoareTripleChecker+Valid, 646 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.4s IncrementalHoareTripleChecker+Time [2025-02-05 20:14:28,836 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [1239 Valid, 967 Invalid, 648 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [2 Valid, 646 Invalid, 0 Unknown, 0 Unchecked, 0.4s Time] [2025-02-05 20:14:28,838 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1626 states. [2025-02-05 20:14:28,849 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1626 to 1626. [2025-02-05 20:14:28,850 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 1626 states, 1625 states have (on average 1.4455384615384614) internal successors, (2349), 1625 states have internal predecessors, (2349), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-02-05 20:14:28,852 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1626 states to 1626 states and 2349 transitions. [2025-02-05 20:14:28,852 INFO L78 Accepts]: Start accepts. Automaton has 1626 states and 2349 transitions. Word has length 386 [2025-02-05 20:14:28,853 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-02-05 20:14:28,853 INFO L471 AbstractCegarLoop]: Abstraction has 1626 states and 2349 transitions. [2025-02-05 20:14:28,853 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 6 states have (on average 64.33333333333333) internal successors, (386), 6 states have internal predecessors, (386), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-02-05 20:14:28,853 INFO L276 IsEmpty]: Start isEmpty. Operand 1626 states and 2349 transitions. [2025-02-05 20:14:28,856 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 388 [2025-02-05 20:14:28,856 INFO L210 NwaCegarLoop]: Found error trace [2025-02-05 20:14:28,856 INFO L218 NwaCegarLoop]: trace histogram [3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 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] [2025-02-05 20:14:28,872 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (9)] Ended with exit code 0 [2025-02-05 20:14:29,057 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 9 /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable16 [2025-02-05 20:14:29,058 INFO L396 AbstractCegarLoop]: === Iteration 18 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-02-05 20:14:29,058 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-02-05 20:14:29,058 INFO L85 PathProgramCache]: Analyzing trace with hash 1533863902, now seen corresponding path program 1 times [2025-02-05 20:14:29,059 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-02-05 20:14:29,059 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [243736919] [2025-02-05 20:14:29,059 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-02-05 20:14:29,059 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-02-05 20:14:29,124 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 387 statements into 1 equivalence classes. [2025-02-05 20:14:30,228 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 387 of 387 statements. [2025-02-05 20:14:30,228 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-02-05 20:14:30,228 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-02-05 20:14:32,726 INFO L134 CoverageAnalysis]: Checked inductivity of 219 backedges. 145 proven. 10 refuted. 0 times theorem prover too weak. 64 trivial. 0 not checked. [2025-02-05 20:14:32,726 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-02-05 20:14:32,727 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [243736919] [2025-02-05 20:14:32,727 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [243736919] provided 0 perfect and 1 imperfect interpolant sequences [2025-02-05 20:14:32,727 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1474484189] [2025-02-05 20:14:32,727 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-02-05 20:14:32,727 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-02-05 20:14:32,727 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 [2025-02-05 20:14:32,729 INFO L229 MonitoredProcess]: Starting monitored process 10 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 20:14:32,730 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (10)] Waiting until timeout for monitored process [2025-02-05 20:14:33,305 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 387 statements into 1 equivalence classes. [2025-02-05 20:14:34,640 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 387 of 387 statements. [2025-02-05 20:14:34,640 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-02-05 20:14:34,640 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-02-05 20:14:34,654 INFO L256 TraceCheckSpWp]: Trace formula consists of 2485 conjuncts, 30 conjuncts are in the unsatisfiable core [2025-02-05 20:14:34,670 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-02-05 20:14:34,876 INFO L134 CoverageAnalysis]: Checked inductivity of 219 backedges. 66 proven. 0 refuted. 0 times theorem prover too weak. 153 trivial. 0 not checked. [2025-02-05 20:14:34,877 INFO L308 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2025-02-05 20:14:34,877 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1474484189] provided 1 perfect and 0 imperfect interpolant sequences [2025-02-05 20:14:34,877 INFO L185 FreeRefinementEngine]: Found 1 perfect and 1 imperfect interpolant sequences. [2025-02-05 20:14:34,877 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [8] imperfect sequences [14] total 20 [2025-02-05 20:14:34,877 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1023900296] [2025-02-05 20:14:34,877 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-02-05 20:14:34,877 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 8 states [2025-02-05 20:14:34,877 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-02-05 20:14:34,878 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2025-02-05 20:14:34,878 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=53, Invalid=327, Unknown=0, NotChecked=0, Total=380 [2025-02-05 20:14:34,878 INFO L87 Difference]: Start difference. First operand 1626 states and 2349 transitions. Second operand has 8 states, 8 states have (on average 30.25) internal successors, (242), 8 states have internal predecessors, (242), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-02-05 20:14:35,454 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-02-05 20:14:35,455 INFO L93 Difference]: Finished difference Result 3653 states and 5311 transitions. [2025-02-05 20:14:35,455 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2025-02-05 20:14:35,455 INFO L78 Accepts]: Start accepts. Automaton has has 8 states, 8 states have (on average 30.25) internal successors, (242), 8 states have internal predecessors, (242), 0 states have call successors, (0), 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 387 [2025-02-05 20:14:35,455 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-02-05 20:14:35,462 INFO L225 Difference]: With dead ends: 3653 [2025-02-05 20:14:35,462 INFO L226 Difference]: Without dead ends: 2138 [2025-02-05 20:14:35,464 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 405 GetRequests, 382 SyntacticMatches, 1 SemanticMatches, 22 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 102 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=77, Invalid=475, Unknown=0, NotChecked=0, Total=552 [2025-02-05 20:14:35,465 INFO L435 NwaCegarLoop]: 426 mSDtfsCounter, 1160 mSDsluCounter, 1271 mSDsCounter, 0 mSdLazyCounter, 1165 mSolverCounterSat, 1 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.4s Time, 0 mProtectedPredicate, 0 mProtectedAction, 1160 SdHoareTripleChecker+Valid, 1697 SdHoareTripleChecker+Invalid, 1166 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 1 IncrementalHoareTripleChecker+Valid, 1165 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.5s IncrementalHoareTripleChecker+Time [2025-02-05 20:14:35,465 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [1160 Valid, 1697 Invalid, 1166 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [1 Valid, 1165 Invalid, 0 Unknown, 0 Unchecked, 0.5s Time] [2025-02-05 20:14:35,467 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 2138 states. [2025-02-05 20:14:35,489 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 2138 to 1646. [2025-02-05 20:14:35,491 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 1646 states, 1645 states have (on average 1.4425531914893617) internal successors, (2373), 1645 states have internal predecessors, (2373), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-02-05 20:14:35,493 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1646 states to 1646 states and 2373 transitions. [2025-02-05 20:14:35,493 INFO L78 Accepts]: Start accepts. Automaton has 1646 states and 2373 transitions. Word has length 387 [2025-02-05 20:14:35,494 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-02-05 20:14:35,494 INFO L471 AbstractCegarLoop]: Abstraction has 1646 states and 2373 transitions. [2025-02-05 20:14:35,494 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 8 states, 8 states have (on average 30.25) internal successors, (242), 8 states have internal predecessors, (242), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-02-05 20:14:35,494 INFO L276 IsEmpty]: Start isEmpty. Operand 1646 states and 2373 transitions. [2025-02-05 20:14:35,498 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 390 [2025-02-05 20:14:35,498 INFO L210 NwaCegarLoop]: Found error trace [2025-02-05 20:14:35,498 INFO L218 NwaCegarLoop]: trace histogram [3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 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] [2025-02-05 20:14:35,517 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (10)] Forceful destruction successful, exit code 0 [2025-02-05 20:14:35,703 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 10 /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable17 [2025-02-05 20:14:35,703 INFO L396 AbstractCegarLoop]: === Iteration 19 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-02-05 20:14:35,703 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-02-05 20:14:35,703 INFO L85 PathProgramCache]: Analyzing trace with hash -963961218, now seen corresponding path program 1 times [2025-02-05 20:14:35,704 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-02-05 20:14:35,704 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1456652900] [2025-02-05 20:14:35,704 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-02-05 20:14:35,704 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-02-05 20:14:35,776 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 389 statements into 1 equivalence classes. [2025-02-05 20:14:37,519 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 389 of 389 statements. [2025-02-05 20:14:37,520 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-02-05 20:14:37,520 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-02-05 20:14:39,841 INFO L134 CoverageAnalysis]: Checked inductivity of 220 backedges. 145 proven. 10 refuted. 0 times theorem prover too weak. 65 trivial. 0 not checked. [2025-02-05 20:14:39,841 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-02-05 20:14:39,841 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1456652900] [2025-02-05 20:14:39,841 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1456652900] provided 0 perfect and 1 imperfect interpolant sequences [2025-02-05 20:14:39,841 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1226910227] [2025-02-05 20:14:39,841 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-02-05 20:14:39,841 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-02-05 20:14:39,842 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 [2025-02-05 20:14:39,844 INFO L229 MonitoredProcess]: Starting monitored process 11 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 20:14:39,872 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (11)] Waiting until timeout for monitored process [2025-02-05 20:14:40,458 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 389 statements into 1 equivalence classes. [2025-02-05 20:14:41,240 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 389 of 389 statements. [2025-02-05 20:14:41,240 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-02-05 20:14:41,240 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-02-05 20:14:41,255 INFO L256 TraceCheckSpWp]: Trace formula consists of 2491 conjuncts, 64 conjuncts are in the unsatisfiable core [2025-02-05 20:14:41,262 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-02-05 20:14:42,105 INFO L134 CoverageAnalysis]: Checked inductivity of 220 backedges. 154 proven. 31 refuted. 0 times theorem prover too weak. 35 trivial. 0 not checked. [2025-02-05 20:14:42,105 INFO L312 TraceCheckSpWp]: Computing backward predicates... [2025-02-05 20:14:44,029 INFO L134 CoverageAnalysis]: Checked inductivity of 220 backedges. 140 proven. 75 refuted. 0 times theorem prover too weak. 5 trivial. 0 not checked. [2025-02-05 20:14:44,030 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1226910227] provided 0 perfect and 2 imperfect interpolant sequences [2025-02-05 20:14:44,030 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2025-02-05 20:14:44,030 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [14, 8, 18] total 36 [2025-02-05 20:14:44,031 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [938456189] [2025-02-05 20:14:44,031 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2025-02-05 20:14:44,036 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 36 states [2025-02-05 20:14:44,037 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-02-05 20:14:44,038 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 36 interpolants. [2025-02-05 20:14:44,039 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=123, Invalid=1137, Unknown=0, NotChecked=0, Total=1260 [2025-02-05 20:14:44,040 INFO L87 Difference]: Start difference. First operand 1646 states and 2373 transitions. Second operand has 36 states, 36 states have (on average 29.25) internal successors, (1053), 36 states have internal predecessors, (1053), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-02-05 20:14:48,507 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-02-05 20:14:48,507 INFO L93 Difference]: Finished difference Result 5321 states and 7699 transitions. [2025-02-05 20:14:48,508 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 41 states. [2025-02-05 20:14:48,508 INFO L78 Accepts]: Start accepts. Automaton has has 36 states, 36 states have (on average 29.25) internal successors, (1053), 36 states have internal predecessors, (1053), 0 states have call successors, (0), 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 389 [2025-02-05 20:14:48,508 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-02-05 20:14:48,518 INFO L225 Difference]: With dead ends: 5321 [2025-02-05 20:14:48,518 INFO L226 Difference]: Without dead ends: 3847 [2025-02-05 20:14:48,524 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 830 GetRequests, 756 SyntacticMatches, 1 SemanticMatches, 73 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 937 ImplicationChecksByTransitivity, 1.4s TimeCoverageRelationStatistics Valid=543, Invalid=5007, Unknown=0, NotChecked=0, Total=5550 [2025-02-05 20:14:48,525 INFO L435 NwaCegarLoop]: 356 mSDtfsCounter, 1864 mSDsluCounter, 9273 mSDsCounter, 0 mSdLazyCounter, 8696 mSolverCounterSat, 13 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 2.9s Time, 0 mProtectedPredicate, 0 mProtectedAction, 1864 SdHoareTripleChecker+Valid, 9629 SdHoareTripleChecker+Invalid, 8709 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 13 IncrementalHoareTripleChecker+Valid, 8696 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 3.4s IncrementalHoareTripleChecker+Time [2025-02-05 20:14:48,525 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [1864 Valid, 9629 Invalid, 8709 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [13 Valid, 8696 Invalid, 0 Unknown, 0 Unchecked, 3.4s Time] [2025-02-05 20:14:48,531 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 3847 states. [2025-02-05 20:14:48,588 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 3847 to 2989. [2025-02-05 20:14:48,605 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 2989 states, 2988 states have (on average 1.4464524765729585) internal successors, (4322), 2988 states have internal predecessors, (4322), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-02-05 20:14:48,612 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 2989 states to 2989 states and 4322 transitions. [2025-02-05 20:14:48,616 INFO L78 Accepts]: Start accepts. Automaton has 2989 states and 4322 transitions. Word has length 389 [2025-02-05 20:14:48,617 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-02-05 20:14:48,617 INFO L471 AbstractCegarLoop]: Abstraction has 2989 states and 4322 transitions. [2025-02-05 20:14:48,617 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 36 states, 36 states have (on average 29.25) internal successors, (1053), 36 states have internal predecessors, (1053), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-02-05 20:14:48,618 INFO L276 IsEmpty]: Start isEmpty. Operand 2989 states and 4322 transitions. [2025-02-05 20:14:48,626 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 390 [2025-02-05 20:14:48,626 INFO L210 NwaCegarLoop]: Found error trace [2025-02-05 20:14:48,626 INFO L218 NwaCegarLoop]: trace histogram [3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 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] [2025-02-05 20:14:48,653 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (11)] Forceful destruction successful, exit code 0 [2025-02-05 20:14:48,826 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable18,11 /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-02-05 20:14:48,827 INFO L396 AbstractCegarLoop]: === Iteration 20 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-02-05 20:14:48,827 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-02-05 20:14:48,827 INFO L85 PathProgramCache]: Analyzing trace with hash 542891714, now seen corresponding path program 1 times [2025-02-05 20:14:48,827 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-02-05 20:14:48,827 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [453032980] [2025-02-05 20:14:48,827 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-02-05 20:14:48,827 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-02-05 20:14:48,884 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 389 statements into 1 equivalence classes. [2025-02-05 20:14:49,733 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 389 of 389 statements. [2025-02-05 20:14:49,733 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-02-05 20:14:49,733 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-02-05 20:14:50,689 INFO L134 CoverageAnalysis]: Checked inductivity of 220 backedges. 26 proven. 10 refuted. 0 times theorem prover too weak. 184 trivial. 0 not checked. [2025-02-05 20:14:50,689 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-02-05 20:14:50,689 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [453032980] [2025-02-05 20:14:50,689 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [453032980] provided 0 perfect and 1 imperfect interpolant sequences [2025-02-05 20:14:50,690 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [324721429] [2025-02-05 20:14:50,690 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-02-05 20:14:50,690 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-02-05 20:14:50,690 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 [2025-02-05 20:14:50,692 INFO L229 MonitoredProcess]: Starting monitored process 12 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 20:14:50,694 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (12)] Waiting until timeout for monitored process [2025-02-05 20:14:51,268 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 389 statements into 1 equivalence classes. [2025-02-05 20:14:51,795 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 389 of 389 statements. [2025-02-05 20:14:51,795 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-02-05 20:14:51,795 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-02-05 20:14:51,807 INFO L256 TraceCheckSpWp]: Trace formula consists of 2493 conjuncts, 35 conjuncts are in the unsatisfiable core [2025-02-05 20:14:51,814 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-02-05 20:14:52,185 INFO L134 CoverageAnalysis]: Checked inductivity of 220 backedges. 25 proven. 51 refuted. 0 times theorem prover too weak. 144 trivial. 0 not checked. [2025-02-05 20:14:52,186 INFO L312 TraceCheckSpWp]: Computing backward predicates... [2025-02-05 20:14:52,829 INFO L134 CoverageAnalysis]: Checked inductivity of 220 backedges. 62 proven. 14 refuted. 0 times theorem prover too weak. 144 trivial. 0 not checked. [2025-02-05 20:14:52,830 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [324721429] provided 0 perfect and 2 imperfect interpolant sequences [2025-02-05 20:14:52,830 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2025-02-05 20:14:52,830 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [8, 9, 10] total 18 [2025-02-05 20:14:52,830 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1190872596] [2025-02-05 20:14:52,830 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2025-02-05 20:14:52,831 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 18 states [2025-02-05 20:14:52,831 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-02-05 20:14:52,831 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 18 interpolants. [2025-02-05 20:14:52,831 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=49, Invalid=257, Unknown=0, NotChecked=0, Total=306 [2025-02-05 20:14:52,831 INFO L87 Difference]: Start difference. First operand 2989 states and 4322 transitions. Second operand has 18 states, 18 states have (on average 28.11111111111111) internal successors, (506), 18 states have internal predecessors, (506), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-02-05 20:14:53,595 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-02-05 20:14:53,596 INFO L93 Difference]: Finished difference Result 6106 states and 8848 transitions. [2025-02-05 20:14:53,596 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2025-02-05 20:14:53,596 INFO L78 Accepts]: Start accepts. Automaton has has 18 states, 18 states have (on average 28.11111111111111) internal successors, (506), 18 states have internal predecessors, (506), 0 states have call successors, (0), 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 389 [2025-02-05 20:14:53,597 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-02-05 20:14:53,603 INFO L225 Difference]: With dead ends: 6106 [2025-02-05 20:14:53,603 INFO L226 Difference]: Without dead ends: 3176 [2025-02-05 20:14:53,605 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 791 GetRequests, 769 SyntacticMatches, 0 SemanticMatches, 22 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 73 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=97, Invalid=455, Unknown=0, NotChecked=0, Total=552 [2025-02-05 20:14:53,606 INFO L435 NwaCegarLoop]: 318 mSDtfsCounter, 845 mSDsluCounter, 2206 mSDsCounter, 0 mSdLazyCounter, 1756 mSolverCounterSat, 2 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.6s Time, 0 mProtectedPredicate, 0 mProtectedAction, 845 SdHoareTripleChecker+Valid, 2524 SdHoareTripleChecker+Invalid, 1758 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 2 IncrementalHoareTripleChecker+Valid, 1756 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.7s IncrementalHoareTripleChecker+Time [2025-02-05 20:14:53,606 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [845 Valid, 2524 Invalid, 1758 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [2 Valid, 1756 Invalid, 0 Unknown, 0 Unchecked, 0.7s Time] [2025-02-05 20:14:53,607 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 3176 states. [2025-02-05 20:14:53,626 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 3176 to 3172. [2025-02-05 20:14:53,628 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 3172 states, 3171 states have (on average 1.4367707347839798) internal successors, (4556), 3171 states have internal predecessors, (4556), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-02-05 20:14:53,631 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3172 states to 3172 states and 4556 transitions. [2025-02-05 20:14:53,631 INFO L78 Accepts]: Start accepts. Automaton has 3172 states and 4556 transitions. Word has length 389 [2025-02-05 20:14:53,631 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-02-05 20:14:53,631 INFO L471 AbstractCegarLoop]: Abstraction has 3172 states and 4556 transitions. [2025-02-05 20:14:53,631 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 18 states, 18 states have (on average 28.11111111111111) internal successors, (506), 18 states have internal predecessors, (506), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-02-05 20:14:53,631 INFO L276 IsEmpty]: Start isEmpty. Operand 3172 states and 4556 transitions. [2025-02-05 20:14:53,635 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 390 [2025-02-05 20:14:53,636 INFO L210 NwaCegarLoop]: Found error trace [2025-02-05 20:14:53,636 INFO L218 NwaCegarLoop]: trace histogram [3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 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] [2025-02-05 20:14:53,650 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (12)] Ended with exit code 0 [2025-02-05 20:14:53,836 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable19,12 /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-02-05 20:14:53,837 INFO L396 AbstractCegarLoop]: === Iteration 21 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-02-05 20:14:53,837 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-02-05 20:14:53,837 INFO L85 PathProgramCache]: Analyzing trace with hash 934598311, now seen corresponding path program 1 times [2025-02-05 20:14:53,837 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-02-05 20:14:53,838 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2009933479] [2025-02-05 20:14:53,838 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-02-05 20:14:53,838 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-02-05 20:14:53,893 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 389 statements into 1 equivalence classes. [2025-02-05 20:14:54,298 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 389 of 389 statements. [2025-02-05 20:14:54,298 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-02-05 20:14:54,298 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-02-05 20:14:55,316 INFO L134 CoverageAnalysis]: Checked inductivity of 220 backedges. 16 proven. 12 refuted. 0 times theorem prover too weak. 192 trivial. 0 not checked. [2025-02-05 20:14:55,316 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-02-05 20:14:55,316 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2009933479] [2025-02-05 20:14:55,316 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [2009933479] provided 0 perfect and 1 imperfect interpolant sequences [2025-02-05 20:14:55,316 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1546763264] [2025-02-05 20:14:55,316 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-02-05 20:14:55,316 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-02-05 20:14:55,317 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 [2025-02-05 20:14:55,319 INFO L229 MonitoredProcess]: Starting monitored process 13 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 20:14:55,320 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (13)] Waiting until timeout for monitored process [2025-02-05 20:14:55,925 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 389 statements into 1 equivalence classes. [2025-02-05 20:14:56,398 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 389 of 389 statements. [2025-02-05 20:14:56,399 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-02-05 20:14:56,399 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-02-05 20:14:56,409 INFO L256 TraceCheckSpWp]: Trace formula consists of 2493 conjuncts, 63 conjuncts are in the unsatisfiable core [2025-02-05 20:14:56,419 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-02-05 20:14:57,742 INFO L134 CoverageAnalysis]: Checked inductivity of 220 backedges. 16 proven. 194 refuted. 0 times theorem prover too weak. 10 trivial. 0 not checked. [2025-02-05 20:14:57,742 INFO L312 TraceCheckSpWp]: Computing backward predicates... [2025-02-05 20:14:58,488 INFO L134 CoverageAnalysis]: Checked inductivity of 220 backedges. 60 proven. 12 refuted. 0 times theorem prover too weak. 148 trivial. 0 not checked. [2025-02-05 20:14:58,488 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1546763264] provided 0 perfect and 2 imperfect interpolant sequences [2025-02-05 20:14:58,488 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2025-02-05 20:14:58,488 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [8, 14, 10] total 25 [2025-02-05 20:14:58,488 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1652225726] [2025-02-05 20:14:58,488 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2025-02-05 20:14:58,489 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 25 states [2025-02-05 20:14:58,489 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-02-05 20:14:58,490 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 25 interpolants. [2025-02-05 20:14:58,490 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=87, Invalid=513, Unknown=0, NotChecked=0, Total=600 [2025-02-05 20:14:58,490 INFO L87 Difference]: Start difference. First operand 3172 states and 4556 transitions. Second operand has 25 states, 25 states have (on average 32.48) internal successors, (812), 25 states have internal predecessors, (812), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-02-05 20:15:00,156 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-02-05 20:15:00,156 INFO L93 Difference]: Finished difference Result 6430 states and 9232 transitions. [2025-02-05 20:15:00,156 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 16 states. [2025-02-05 20:15:00,157 INFO L78 Accepts]: Start accepts. Automaton has has 25 states, 25 states have (on average 32.48) internal successors, (812), 25 states have internal predecessors, (812), 0 states have call successors, (0), 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 389 [2025-02-05 20:15:00,157 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-02-05 20:15:00,165 INFO L225 Difference]: With dead ends: 6430 [2025-02-05 20:15:00,165 INFO L226 Difference]: Without dead ends: 3345 [2025-02-05 20:15:00,168 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 798 GetRequests, 760 SyntacticMatches, 2 SemanticMatches, 36 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 267 ImplicationChecksByTransitivity, 0.4s TimeCoverageRelationStatistics Valid=222, Invalid=1184, Unknown=0, NotChecked=0, Total=1406 [2025-02-05 20:15:00,168 INFO L435 NwaCegarLoop]: 273 mSDtfsCounter, 1551 mSDsluCounter, 4053 mSDsCounter, 0 mSdLazyCounter, 4243 mSolverCounterSat, 6 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 1.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 1551 SdHoareTripleChecker+Valid, 4326 SdHoareTripleChecker+Invalid, 4249 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 6 IncrementalHoareTripleChecker+Valid, 4243 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 1.5s IncrementalHoareTripleChecker+Time [2025-02-05 20:15:00,169 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [1551 Valid, 4326 Invalid, 4249 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [6 Valid, 4243 Invalid, 0 Unknown, 0 Unchecked, 1.5s Time] [2025-02-05 20:15:00,170 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 3345 states. [2025-02-05 20:15:00,192 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 3345 to 3172. [2025-02-05 20:15:00,194 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 3172 states, 3171 states have (on average 1.4367707347839798) internal successors, (4556), 3171 states have internal predecessors, (4556), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-02-05 20:15:00,197 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3172 states to 3172 states and 4556 transitions. [2025-02-05 20:15:00,197 INFO L78 Accepts]: Start accepts. Automaton has 3172 states and 4556 transitions. Word has length 389 [2025-02-05 20:15:00,197 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-02-05 20:15:00,197 INFO L471 AbstractCegarLoop]: Abstraction has 3172 states and 4556 transitions. [2025-02-05 20:15:00,197 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 25 states, 25 states have (on average 32.48) internal successors, (812), 25 states have internal predecessors, (812), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-02-05 20:15:00,197 INFO L276 IsEmpty]: Start isEmpty. Operand 3172 states and 4556 transitions. [2025-02-05 20:15:00,202 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 391 [2025-02-05 20:15:00,202 INFO L210 NwaCegarLoop]: Found error trace [2025-02-05 20:15:00,202 INFO L218 NwaCegarLoop]: trace histogram [3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 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] [2025-02-05 20:15:00,219 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (13)] Ended with exit code 0 [2025-02-05 20:15:00,406 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable20,13 /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-02-05 20:15:00,406 INFO L396 AbstractCegarLoop]: === Iteration 22 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-02-05 20:15:00,406 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-02-05 20:15:00,406 INFO L85 PathProgramCache]: Analyzing trace with hash 143380441, now seen corresponding path program 1 times [2025-02-05 20:15:00,406 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-02-05 20:15:00,406 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2030778031] [2025-02-05 20:15:00,406 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-02-05 20:15:00,407 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-02-05 20:15:00,465 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 390 statements into 1 equivalence classes. [2025-02-05 20:15:02,150 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 390 of 390 statements. [2025-02-05 20:15:02,150 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-02-05 20:15:02,150 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat