./Ultimate.py --spec ../sv-benchmarks/c/properties/unreach-call.prp --file ../sv-benchmarks/c/hardware-verification-bv/btor2c-lazyMod.vcegar_QF_BV_itc99_b13_p04.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.vcegar_QF_BV_itc99_b13_p04.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 7fcc6d521e585376faa967e3fb44ecb88c57fe5091f07017ec46bf0d857d1eb6 --- Real Ultimate output --- This is Ultimate 0.3.0-?-c00e63d-m [2025-02-05 20:08:59,019 INFO L188 SettingsManager]: Resetting all preferences to default values... [2025-02-05 20:08:59,070 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:08:59,076 WARN L101 SettingsManager]: Preference file contains the following unknown settings: [2025-02-05 20:08:59,079 WARN L103 SettingsManager]: * de.uni_freiburg.informatik.ultimate.core.Log level for class [2025-02-05 20:08:59,099 INFO L130 SettingsManager]: Preferences different from defaults after loading the file: [2025-02-05 20:08:59,100 INFO L151 SettingsManager]: Preferences of UltimateCore differ from their defaults: [2025-02-05 20:08:59,100 INFO L153 SettingsManager]: * Log level for class=de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher=ERROR; [2025-02-05 20:08:59,100 INFO L151 SettingsManager]: Preferences of Boogie Preprocessor differ from their defaults: [2025-02-05 20:08:59,101 INFO L153 SettingsManager]: * Use memory slicer=true [2025-02-05 20:08:59,101 INFO L151 SettingsManager]: Preferences of Boogie Procedure Inliner differ from their defaults: [2025-02-05 20:08:59,101 INFO L153 SettingsManager]: * Ignore calls to procedures called more than once=ONLY_FOR_SEQUENTIAL_PROGRAMS [2025-02-05 20:08:59,102 INFO L151 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2025-02-05 20:08:59,102 INFO L153 SettingsManager]: * Create parallel compositions if possible=false [2025-02-05 20:08:59,102 INFO L153 SettingsManager]: * Use SBE=true [2025-02-05 20:08:59,102 INFO L151 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2025-02-05 20:08:59,102 INFO L153 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2025-02-05 20:08:59,102 INFO L153 SettingsManager]: * Overapproximate operations on floating types=true [2025-02-05 20:08:59,103 INFO L153 SettingsManager]: * Check division by zero=IGNORE [2025-02-05 20:08:59,103 INFO L153 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2025-02-05 20:08:59,103 INFO L153 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2025-02-05 20:08:59,103 INFO L153 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2025-02-05 20:08:59,103 INFO L153 SettingsManager]: * Check if freed pointer was valid=false [2025-02-05 20:08:59,103 INFO L153 SettingsManager]: * Behaviour of calls to undefined functions=OVERAPPROXIMATE_BEHAVIOUR [2025-02-05 20:08:59,103 INFO L153 SettingsManager]: * Use constant arrays=true [2025-02-05 20:08:59,103 INFO L151 SettingsManager]: Preferences of IcfgBuilder differ from their defaults: [2025-02-05 20:08:59,103 INFO L153 SettingsManager]: * Size of a code block=SequenceOfStatements [2025-02-05 20:08:59,103 INFO L153 SettingsManager]: * Only consider context switches at boundaries of atomic blocks=true [2025-02-05 20:08:59,103 INFO L153 SettingsManager]: * SMT solver=External_DefaultMode [2025-02-05 20:08:59,103 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2025-02-05 20:08:59,103 INFO L151 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2025-02-05 20:08:59,104 INFO L153 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2025-02-05 20:08:59,104 INFO L153 SettingsManager]: * Compute procedure contracts=false [2025-02-05 20:08:59,104 INFO L153 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopHeads [2025-02-05 20:08:59,104 INFO L153 SettingsManager]: * Trace refinement strategy=CAMEL [2025-02-05 20:08:59,104 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2025-02-05 20:08:59,104 INFO L153 SettingsManager]: * Apply one-shot large block encoding in concurrent analysis=false [2025-02-05 20:08:59,104 INFO L153 SettingsManager]: * Automaton type used in concurrency analysis=PETRI_NET [2025-02-05 20:08:59,104 INFO L153 SettingsManager]: * Order on configurations for Petri net unfoldings=DBO [2025-02-05 20:08:59,105 INFO L153 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode [2025-02-05 20:08:59,105 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 -> 7fcc6d521e585376faa967e3fb44ecb88c57fe5091f07017ec46bf0d857d1eb6 [2025-02-05 20:08:59,316 INFO L75 nceAwareModelManager]: Repository-Root is: /tmp [2025-02-05 20:08:59,321 INFO L261 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2025-02-05 20:08:59,325 INFO L217 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2025-02-05 20:08:59,326 INFO L270 PluginConnector]: Initializing CDTParser... [2025-02-05 20:08:59,326 INFO L274 PluginConnector]: CDTParser initialized [2025-02-05 20:08:59,328 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.vcegar_QF_BV_itc99_b13_p04.c [2025-02-05 20:09:00,434 INFO L533 CDTParser]: Created temporary CDT project at /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/data/eb6313a75/b9a375910b954d16abc3ac66080785ee/FLAG600b966f8 [2025-02-05 20:09:00,623 INFO L384 CDTParser]: Found 1 translation units. [2025-02-05 20:09:00,624 INFO L180 CDTParser]: Scanning /storage/repos/ultimate-jdk21/releaseScripts/default/sv-benchmarks/c/hardware-verification-bv/btor2c-lazyMod.vcegar_QF_BV_itc99_b13_p04.c [2025-02-05 20:09:00,654 INFO L427 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/data/eb6313a75/b9a375910b954d16abc3ac66080785ee/FLAG600b966f8 [2025-02-05 20:09:01,002 INFO L435 CDTParser]: Successfully deleted /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/data/eb6313a75/b9a375910b954d16abc3ac66080785ee [2025-02-05 20:09:01,004 INFO L299 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2025-02-05 20:09:01,005 INFO L133 ToolchainWalker]: Walking toolchain with 6 elements. [2025-02-05 20:09:01,006 INFO L112 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2025-02-05 20:09:01,006 INFO L270 PluginConnector]: Initializing CACSL2BoogieTranslator... [2025-02-05 20:09:01,009 INFO L274 PluginConnector]: CACSL2BoogieTranslator initialized [2025-02-05 20:09:01,009 INFO L184 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 05.02 08:09:01" (1/1) ... [2025-02-05 20:09:01,010 INFO L204 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@772bda14 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 05.02 08:09:01, skipping insertion in model container [2025-02-05 20:09:01,010 INFO L184 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 05.02 08:09:01" (1/1) ... [2025-02-05 20:09:01,025 INFO L175 MainTranslator]: Built tables and reachable declarations [2025-02-05 20:09:01,119 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.vcegar_QF_BV_itc99_b13_p04.c[1266,1279] [2025-02-05 20:09:01,180 INFO L210 PostProcessor]: Analyzing one entry point: main [2025-02-05 20:09:01,189 INFO L200 MainTranslator]: Completed pre-run [2025-02-05 20:09:01,199 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.vcegar_QF_BV_itc99_b13_p04.c[1266,1279] [2025-02-05 20:09:01,239 INFO L210 PostProcessor]: Analyzing one entry point: main [2025-02-05 20:09:01,251 INFO L204 MainTranslator]: Completed translation [2025-02-05 20:09:01,251 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 05.02 08:09:01 WrapperNode [2025-02-05 20:09:01,251 INFO L131 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2025-02-05 20:09:01,252 INFO L112 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2025-02-05 20:09:01,252 INFO L270 PluginConnector]: Initializing Boogie Procedure Inliner... [2025-02-05 20:09:01,252 INFO L274 PluginConnector]: Boogie Procedure Inliner initialized [2025-02-05 20:09:01,256 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:09:01" (1/1) ... [2025-02-05 20:09:01,265 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:09:01" (1/1) ... [2025-02-05 20:09:01,307 INFO L138 Inliner]: procedures = 17, calls = 8, calls flagged for inlining = 3, calls inlined = 3, statements flattened = 340 [2025-02-05 20:09:01,308 INFO L131 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2025-02-05 20:09:01,308 INFO L112 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2025-02-05 20:09:01,309 INFO L270 PluginConnector]: Initializing Boogie Preprocessor... [2025-02-05 20:09:01,309 INFO L274 PluginConnector]: Boogie Preprocessor initialized [2025-02-05 20:09:01,315 INFO L184 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 05.02 08:09:01" (1/1) ... [2025-02-05 20:09:01,315 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 05.02 08:09:01" (1/1) ... [2025-02-05 20:09:01,326 INFO L184 PluginConnector]: Executing the observer MemorySlicer from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 05.02 08:09:01" (1/1) ... [2025-02-05 20:09:01,347 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:09:01,347 INFO L184 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 05.02 08:09:01" (1/1) ... [2025-02-05 20:09:01,348 INFO L184 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 05.02 08:09:01" (1/1) ... [2025-02-05 20:09:01,360 INFO L184 PluginConnector]: Executing the observer ReplaceArrayAssignments from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 05.02 08:09:01" (1/1) ... [2025-02-05 20:09:01,364 INFO L184 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 05.02 08:09:01" (1/1) ... [2025-02-05 20:09:01,368 INFO L184 PluginConnector]: Executing the observer LTLStepAnnotator from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 05.02 08:09:01" (1/1) ... [2025-02-05 20:09:01,372 INFO L184 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 05.02 08:09:01" (1/1) ... [2025-02-05 20:09:01,375 INFO L131 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2025-02-05 20:09:01,378 INFO L112 PluginConnector]: ------------------------IcfgBuilder---------------------------- [2025-02-05 20:09:01,378 INFO L270 PluginConnector]: Initializing IcfgBuilder... [2025-02-05 20:09:01,378 INFO L274 PluginConnector]: IcfgBuilder initialized [2025-02-05 20:09:01,379 INFO L184 PluginConnector]: Executing the observer IcfgBuilderObserver from plugin IcfgBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 05.02 08:09:01" (1/1) ... [2025-02-05 20:09:01,383 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2025-02-05 20:09:01,392 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 [2025-02-05 20:09:01,401 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:09:01,404 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:09:01,420 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocInit [2025-02-05 20:09:01,420 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int#0 [2025-02-05 20:09:01,420 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2025-02-05 20:09:01,420 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2025-02-05 20:09:01,489 INFO L257 CfgBuilder]: Building ICFG [2025-02-05 20:09:01,491 INFO L287 CfgBuilder]: Building CFG for each procedure with an implementation [2025-02-05 20:09:01,806 INFO L? ?]: Removed 136 outVars from TransFormulas that were not future-live. [2025-02-05 20:09:01,806 INFO L308 CfgBuilder]: Performing block encoding [2025-02-05 20:09:01,828 INFO L332 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2025-02-05 20:09:01,828 INFO L337 CfgBuilder]: Removed 0 assume(true) statements. [2025-02-05 20:09:01,829 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.icfgbuilder CFG 05.02 08:09:01 BoogieIcfgContainer [2025-02-05 20:09:01,829 INFO L131 PluginConnector]: ------------------------ END IcfgBuilder---------------------------- [2025-02-05 20:09:01,830 INFO L112 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2025-02-05 20:09:01,830 INFO L270 PluginConnector]: Initializing TraceAbstraction... [2025-02-05 20:09:01,834 INFO L274 PluginConnector]: TraceAbstraction initialized [2025-02-05 20:09:01,834 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 05.02 08:09:01" (1/3) ... [2025-02-05 20:09:01,834 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@7d0ceb31 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 05.02 08:09:01, skipping insertion in model container [2025-02-05 20:09:01,834 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 05.02 08:09:01" (2/3) ... [2025-02-05 20:09:01,834 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@7d0ceb31 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 05.02 08:09:01, skipping insertion in model container [2025-02-05 20:09:01,834 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.icfgbuilder CFG 05.02 08:09:01" (3/3) ... [2025-02-05 20:09:01,835 INFO L128 eAbstractionObserver]: Analyzing ICFG btor2c-lazyMod.vcegar_QF_BV_itc99_b13_p04.c [2025-02-05 20:09:01,845 INFO L216 ceAbstractionStarter]: Automizer settings: Hoare:LoopHeads NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2025-02-05 20:09:01,847 INFO L151 ceAbstractionStarter]: Applying trace abstraction to ICFG btor2c-lazyMod.vcegar_QF_BV_itc99_b13_p04.c that has 1 procedures, 62 locations, 1 initial locations, 1 loop locations, and 1 error locations. [2025-02-05 20:09:01,885 INFO L332 AbstractCegarLoop]: ======== Iteration 0 == of CEGAR loop == AllErrorsAtOnce ======== [2025-02-05 20:09:01,895 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;@84f00ea, mLbeIndependenceSettings=[IndependenceType=SEMANTIC, AbstractionType=NONE, UseConditional=false, UseSemiCommutativity=true, Solver=Z3, SolverTimeout=1000ms] [2025-02-05 20:09:01,895 INFO L334 AbstractCegarLoop]: Starting to check reachability of 1 error locations. [2025-02-05 20:09:01,899 INFO L276 IsEmpty]: Start isEmpty. Operand has 62 states, 60 states have (on average 1.4833333333333334) internal successors, (89), 61 states have internal predecessors, (89), 0 states have call successors, (0), 0 states have 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:09:01,903 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 26 [2025-02-05 20:09:01,904 INFO L210 NwaCegarLoop]: Found error trace [2025-02-05 20:09:01,904 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] [2025-02-05 20:09:01,905 INFO L396 AbstractCegarLoop]: === Iteration 1 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-02-05 20:09:01,908 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-02-05 20:09:01,909 INFO L85 PathProgramCache]: Analyzing trace with hash -692314657, now seen corresponding path program 1 times [2025-02-05 20:09:01,914 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-02-05 20:09:01,915 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1843793712] [2025-02-05 20:09:01,916 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-02-05 20:09:01,916 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-02-05 20:09:01,991 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 25 statements into 1 equivalence classes. [2025-02-05 20:09:02,034 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 25 of 25 statements. [2025-02-05 20:09:02,035 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-02-05 20:09:02,035 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-02-05 20:09:02,325 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:09:02,326 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-02-05 20:09:02,326 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1843793712] [2025-02-05 20:09:02,326 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1843793712] provided 1 perfect and 0 imperfect interpolant sequences [2025-02-05 20:09:02,326 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-02-05 20:09:02,326 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2025-02-05 20:09:02,329 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1992624541] [2025-02-05 20:09:02,329 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-02-05 20:09:02,332 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2025-02-05 20:09:02,332 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-02-05 20:09:02,345 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2025-02-05 20:09:02,345 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2025-02-05 20:09:02,347 INFO L87 Difference]: Start difference. First operand has 62 states, 60 states have (on average 1.4833333333333334) internal successors, (89), 61 states have internal predecessors, (89), 0 states have call successors, (0), 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 6.25) internal successors, (25), 4 states have internal predecessors, (25), 0 states have call successors, (0), 0 states have 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:09:02,408 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-02-05 20:09:02,409 INFO L93 Difference]: Finished difference Result 101 states and 147 transitions. [2025-02-05 20:09:02,410 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2025-02-05 20:09:02,410 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 4 states have (on average 6.25) internal successors, (25), 4 states have internal predecessors, (25), 0 states have call successors, (0), 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 25 [2025-02-05 20:09:02,411 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-02-05 20:09:02,415 INFO L225 Difference]: With dead ends: 101 [2025-02-05 20:09:02,415 INFO L226 Difference]: Without dead ends: 61 [2025-02-05 20:09:02,417 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:09:02,419 INFO L435 NwaCegarLoop]: 70 mSDtfsCounter, 0 mSDsluCounter, 135 mSDsCounter, 0 mSdLazyCounter, 49 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 0 SdHoareTripleChecker+Valid, 205 SdHoareTripleChecker+Invalid, 49 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 49 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2025-02-05 20:09:02,419 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [0 Valid, 205 Invalid, 49 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 49 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2025-02-05 20:09:02,430 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 61 states. [2025-02-05 20:09:02,438 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 61 to 61. [2025-02-05 20:09:02,439 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 61 states, 60 states have (on average 1.45) internal successors, (87), 60 states have internal predecessors, (87), 0 states have call successors, (0), 0 states have 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:09:02,444 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 61 states to 61 states and 87 transitions. [2025-02-05 20:09:02,445 INFO L78 Accepts]: Start accepts. Automaton has 61 states and 87 transitions. Word has length 25 [2025-02-05 20:09:02,446 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-02-05 20:09:02,446 INFO L471 AbstractCegarLoop]: Abstraction has 61 states and 87 transitions. [2025-02-05 20:09:02,446 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 6.25) internal successors, (25), 4 states have internal predecessors, (25), 0 states have call successors, (0), 0 states have 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:09:02,447 INFO L276 IsEmpty]: Start isEmpty. Operand 61 states and 87 transitions. [2025-02-05 20:09:02,447 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 27 [2025-02-05 20:09:02,447 INFO L210 NwaCegarLoop]: Found error trace [2025-02-05 20:09:02,447 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] [2025-02-05 20:09:02,447 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable0 [2025-02-05 20:09:02,447 INFO L396 AbstractCegarLoop]: === Iteration 2 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-02-05 20:09:02,448 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-02-05 20:09:02,448 INFO L85 PathProgramCache]: Analyzing trace with hash 17761279, now seen corresponding path program 1 times [2025-02-05 20:09:02,448 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-02-05 20:09:02,448 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [932427855] [2025-02-05 20:09:02,448 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-02-05 20:09:02,448 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-02-05 20:09:02,463 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 26 statements into 1 equivalence classes. [2025-02-05 20:09:02,485 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 26 of 26 statements. [2025-02-05 20:09:02,485 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-02-05 20:09:02,485 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-02-05 20:09:02,601 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:09:02,601 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-02-05 20:09:02,602 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [932427855] [2025-02-05 20:09:02,602 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [932427855] provided 1 perfect and 0 imperfect interpolant sequences [2025-02-05 20:09:02,602 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-02-05 20:09:02,602 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2025-02-05 20:09:02,602 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [332072011] [2025-02-05 20:09:02,602 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-02-05 20:09:02,603 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2025-02-05 20:09:02,603 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-02-05 20:09:02,603 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2025-02-05 20:09:02,603 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2025-02-05 20:09:02,604 INFO L87 Difference]: Start difference. First operand 61 states and 87 transitions. Second operand has 4 states, 4 states have (on average 6.5) internal successors, (26), 4 states have internal predecessors, (26), 0 states have call successors, (0), 0 states have 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:09:02,655 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-02-05 20:09:02,655 INFO L93 Difference]: Finished difference Result 102 states and 145 transitions. [2025-02-05 20:09:02,656 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2025-02-05 20:09:02,656 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 4 states have (on average 6.5) internal successors, (26), 4 states have internal predecessors, (26), 0 states have call successors, (0), 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 26 [2025-02-05 20:09:02,656 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-02-05 20:09:02,658 INFO L225 Difference]: With dead ends: 102 [2025-02-05 20:09:02,658 INFO L226 Difference]: Without dead ends: 63 [2025-02-05 20:09:02,658 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:09:02,658 INFO L435 NwaCegarLoop]: 70 mSDtfsCounter, 0 mSDsluCounter, 132 mSDsCounter, 0 mSdLazyCounter, 52 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 0 SdHoareTripleChecker+Valid, 202 SdHoareTripleChecker+Invalid, 52 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 52 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2025-02-05 20:09:02,658 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [0 Valid, 202 Invalid, 52 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 52 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2025-02-05 20:09:02,659 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 63 states. [2025-02-05 20:09:02,661 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 63 to 63. [2025-02-05 20:09:02,661 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 63 states, 62 states have (on average 1.435483870967742) internal successors, (89), 62 states have internal predecessors, (89), 0 states have call successors, (0), 0 states have 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:09:02,661 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 63 states to 63 states and 89 transitions. [2025-02-05 20:09:02,661 INFO L78 Accepts]: Start accepts. Automaton has 63 states and 89 transitions. Word has length 26 [2025-02-05 20:09:02,662 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-02-05 20:09:02,662 INFO L471 AbstractCegarLoop]: Abstraction has 63 states and 89 transitions. [2025-02-05 20:09:02,662 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 6.5) internal successors, (26), 4 states have internal predecessors, (26), 0 states have call successors, (0), 0 states have 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:09:02,662 INFO L276 IsEmpty]: Start isEmpty. Operand 63 states and 89 transitions. [2025-02-05 20:09:02,662 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 28 [2025-02-05 20:09:02,662 INFO L210 NwaCegarLoop]: Found error trace [2025-02-05 20:09:02,662 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] [2025-02-05 20:09:02,662 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable1 [2025-02-05 20:09:02,662 INFO L396 AbstractCegarLoop]: === Iteration 3 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-02-05 20:09:02,663 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-02-05 20:09:02,663 INFO L85 PathProgramCache]: Analyzing trace with hash -1812858406, now seen corresponding path program 1 times [2025-02-05 20:09:02,663 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-02-05 20:09:02,663 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1233883085] [2025-02-05 20:09:02,663 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-02-05 20:09:02,663 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-02-05 20:09:02,672 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 27 statements into 1 equivalence classes. [2025-02-05 20:09:02,693 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 27 of 27 statements. [2025-02-05 20:09:02,693 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-02-05 20:09:02,693 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-02-05 20:09:02,909 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:09:02,909 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-02-05 20:09:02,909 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1233883085] [2025-02-05 20:09:02,909 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1233883085] provided 1 perfect and 0 imperfect interpolant sequences [2025-02-05 20:09:02,910 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-02-05 20:09:02,910 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2025-02-05 20:09:02,910 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2039868347] [2025-02-05 20:09:02,910 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-02-05 20:09:02,910 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2025-02-05 20:09:02,911 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-02-05 20:09:02,911 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2025-02-05 20:09:02,911 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2025-02-05 20:09:02,911 INFO L87 Difference]: Start difference. First operand 63 states and 89 transitions. Second operand has 4 states, 4 states have (on average 6.75) internal successors, (27), 4 states have internal predecessors, (27), 0 states have call successors, (0), 0 states have 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:09:02,955 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-02-05 20:09:02,955 INFO L93 Difference]: Finished difference Result 104 states and 146 transitions. [2025-02-05 20:09:02,956 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2025-02-05 20:09:02,956 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 4 states have (on average 6.75) internal successors, (27), 4 states have internal predecessors, (27), 0 states have call successors, (0), 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 27 [2025-02-05 20:09:02,956 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-02-05 20:09:02,956 INFO L225 Difference]: With dead ends: 104 [2025-02-05 20:09:02,956 INFO L226 Difference]: Without dead ends: 63 [2025-02-05 20:09:02,957 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:09:02,957 INFO L435 NwaCegarLoop]: 67 mSDtfsCounter, 6 mSDsluCounter, 125 mSDsCounter, 0 mSdLazyCounter, 51 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 6 SdHoareTripleChecker+Valid, 192 SdHoareTripleChecker+Invalid, 51 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 51 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2025-02-05 20:09:02,957 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [6 Valid, 192 Invalid, 51 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 51 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2025-02-05 20:09:02,958 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 63 states. [2025-02-05 20:09:02,960 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 63 to 63. [2025-02-05 20:09:02,960 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 63 states, 62 states have (on average 1.4193548387096775) internal successors, (88), 62 states have internal predecessors, (88), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-02-05 20:09:02,960 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 63 states to 63 states and 88 transitions. [2025-02-05 20:09:02,960 INFO L78 Accepts]: Start accepts. Automaton has 63 states and 88 transitions. Word has length 27 [2025-02-05 20:09:02,961 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-02-05 20:09:02,961 INFO L471 AbstractCegarLoop]: Abstraction has 63 states and 88 transitions. [2025-02-05 20:09:02,961 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 6.75) internal successors, (27), 4 states have internal predecessors, (27), 0 states have call successors, (0), 0 states have 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:09:02,961 INFO L276 IsEmpty]: Start isEmpty. Operand 63 states and 88 transitions. [2025-02-05 20:09:02,961 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 29 [2025-02-05 20:09:02,961 INFO L210 NwaCegarLoop]: Found error trace [2025-02-05 20:09:02,961 INFO L218 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-02-05 20:09:02,962 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable2 [2025-02-05 20:09:02,962 INFO L396 AbstractCegarLoop]: === Iteration 4 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-02-05 20:09:02,962 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-02-05 20:09:02,962 INFO L85 PathProgramCache]: Analyzing trace with hash 1524326788, now seen corresponding path program 1 times [2025-02-05 20:09:02,962 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-02-05 20:09:02,962 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1308496945] [2025-02-05 20:09:02,962 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-02-05 20:09:02,962 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-02-05 20:09:02,971 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 28 statements into 1 equivalence classes. [2025-02-05 20:09:02,993 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 28 of 28 statements. [2025-02-05 20:09:02,995 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-02-05 20:09:02,995 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-02-05 20:09:03,252 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:09:03,252 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-02-05 20:09:03,252 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1308496945] [2025-02-05 20:09:03,252 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1308496945] provided 1 perfect and 0 imperfect interpolant sequences [2025-02-05 20:09:03,252 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-02-05 20:09:03,252 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [8] imperfect sequences [] total 8 [2025-02-05 20:09:03,252 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1322907058] [2025-02-05 20:09:03,252 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-02-05 20:09:03,253 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 8 states [2025-02-05 20:09:03,253 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-02-05 20:09:03,253 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2025-02-05 20:09:03,253 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=14, Invalid=42, Unknown=0, NotChecked=0, Total=56 [2025-02-05 20:09:03,253 INFO L87 Difference]: Start difference. First operand 63 states and 88 transitions. Second operand has 8 states, 8 states have (on average 3.5) internal successors, (28), 8 states have internal predecessors, (28), 0 states have call successors, (0), 0 states have 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:09:03,383 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-02-05 20:09:03,383 INFO L93 Difference]: Finished difference Result 114 states and 158 transitions. [2025-02-05 20:09:03,384 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2025-02-05 20:09:03,384 INFO L78 Accepts]: Start accepts. Automaton has has 8 states, 8 states have (on average 3.5) internal successors, (28), 8 states have internal predecessors, (28), 0 states have call successors, (0), 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 28 [2025-02-05 20:09:03,384 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-02-05 20:09:03,385 INFO L225 Difference]: With dead ends: 114 [2025-02-05 20:09:03,385 INFO L226 Difference]: Without dead ends: 73 [2025-02-05 20:09:03,385 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 13 GetRequests, 3 SyntacticMatches, 0 SemanticMatches, 10 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 10 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=30, Invalid=102, Unknown=0, NotChecked=0, Total=132 [2025-02-05 20:09:03,386 INFO L435 NwaCegarLoop]: 65 mSDtfsCounter, 88 mSDsluCounter, 313 mSDsCounter, 0 mSdLazyCounter, 126 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 88 SdHoareTripleChecker+Valid, 378 SdHoareTripleChecker+Invalid, 126 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 126 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2025-02-05 20:09:03,387 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [88 Valid, 378 Invalid, 126 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 126 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2025-02-05 20:09:03,387 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 73 states. [2025-02-05 20:09:03,396 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 73 to 72. [2025-02-05 20:09:03,397 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 72 states, 71 states have (on average 1.408450704225352) internal successors, (100), 71 states have internal predecessors, (100), 0 states have call successors, (0), 0 states have 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:09:03,397 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 72 states to 72 states and 100 transitions. [2025-02-05 20:09:03,397 INFO L78 Accepts]: Start accepts. Automaton has 72 states and 100 transitions. Word has length 28 [2025-02-05 20:09:03,397 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-02-05 20:09:03,397 INFO L471 AbstractCegarLoop]: Abstraction has 72 states and 100 transitions. [2025-02-05 20:09:03,397 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 8 states, 8 states have (on average 3.5) internal successors, (28), 8 states have internal predecessors, (28), 0 states have call successors, (0), 0 states have 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:09:03,397 INFO L276 IsEmpty]: Start isEmpty. Operand 72 states and 100 transitions. [2025-02-05 20:09:03,398 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 30 [2025-02-05 20:09:03,398 INFO L210 NwaCegarLoop]: Found error trace [2025-02-05 20:09:03,398 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] [2025-02-05 20:09:03,398 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable3 [2025-02-05 20:09:03,398 INFO L396 AbstractCegarLoop]: === Iteration 5 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-02-05 20:09:03,398 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-02-05 20:09:03,398 INFO L85 PathProgramCache]: Analyzing trace with hash 2094366203, now seen corresponding path program 1 times [2025-02-05 20:09:03,398 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-02-05 20:09:03,398 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2052672847] [2025-02-05 20:09:03,399 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-02-05 20:09:03,399 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-02-05 20:09:03,408 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 29 statements into 1 equivalence classes. [2025-02-05 20:09:03,424 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 29 of 29 statements. [2025-02-05 20:09:03,424 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-02-05 20:09:03,424 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-02-05 20:09:03,956 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:09:03,956 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-02-05 20:09:03,956 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2052672847] [2025-02-05 20:09:03,956 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [2052672847] provided 1 perfect and 0 imperfect interpolant sequences [2025-02-05 20:09:03,956 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-02-05 20:09:03,956 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [10] imperfect sequences [] total 10 [2025-02-05 20:09:03,956 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1994598986] [2025-02-05 20:09:03,956 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-02-05 20:09:03,957 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 10 states [2025-02-05 20:09:03,957 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-02-05 20:09:03,957 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 10 interpolants. [2025-02-05 20:09:03,957 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=20, Invalid=70, Unknown=0, NotChecked=0, Total=90 [2025-02-05 20:09:03,957 INFO L87 Difference]: Start difference. First operand 72 states and 100 transitions. Second operand has 10 states, 10 states have (on average 2.9) internal successors, (29), 10 states have internal predecessors, (29), 0 states have call successors, (0), 0 states have 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:09:04,131 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-02-05 20:09:04,132 INFO L93 Difference]: Finished difference Result 127 states and 175 transitions. [2025-02-05 20:09:04,133 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2025-02-05 20:09:04,133 INFO L78 Accepts]: Start accepts. Automaton has has 10 states, 10 states have (on average 2.9) internal successors, (29), 10 states have internal predecessors, (29), 0 states have call successors, (0), 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 29 [2025-02-05 20:09:04,133 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-02-05 20:09:04,133 INFO L225 Difference]: With dead ends: 127 [2025-02-05 20:09:04,133 INFO L226 Difference]: Without dead ends: 77 [2025-02-05 20:09:04,134 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 16 GetRequests, 2 SyntacticMatches, 1 SemanticMatches, 13 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 26 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=43, Invalid=167, Unknown=0, NotChecked=0, Total=210 [2025-02-05 20:09:04,134 INFO L435 NwaCegarLoop]: 60 mSDtfsCounter, 93 mSDsluCounter, 290 mSDsCounter, 0 mSdLazyCounter, 155 mSolverCounterSat, 2 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 93 SdHoareTripleChecker+Valid, 350 SdHoareTripleChecker+Invalid, 157 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 2 IncrementalHoareTripleChecker+Valid, 155 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2025-02-05 20:09:04,134 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [93 Valid, 350 Invalid, 157 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [2 Valid, 155 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2025-02-05 20:09:04,135 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 77 states. [2025-02-05 20:09:04,137 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 77 to 76. [2025-02-05 20:09:04,137 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 76 states, 75 states have (on average 1.4) internal successors, (105), 75 states have internal predecessors, (105), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-02-05 20:09:04,139 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 76 states to 76 states and 105 transitions. [2025-02-05 20:09:04,139 INFO L78 Accepts]: Start accepts. Automaton has 76 states and 105 transitions. Word has length 29 [2025-02-05 20:09:04,139 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-02-05 20:09:04,139 INFO L471 AbstractCegarLoop]: Abstraction has 76 states and 105 transitions. [2025-02-05 20:09:04,139 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 10 states, 10 states have (on average 2.9) internal successors, (29), 10 states have internal predecessors, (29), 0 states have call successors, (0), 0 states have 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:09:04,139 INFO L276 IsEmpty]: Start isEmpty. Operand 76 states and 105 transitions. [2025-02-05 20:09:04,140 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 30 [2025-02-05 20:09:04,140 INFO L210 NwaCegarLoop]: Found error trace [2025-02-05 20:09:04,140 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] [2025-02-05 20:09:04,140 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable4 [2025-02-05 20:09:04,140 INFO L396 AbstractCegarLoop]: === Iteration 6 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-02-05 20:09:04,140 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-02-05 20:09:04,140 INFO L85 PathProgramCache]: Analyzing trace with hash 959564752, now seen corresponding path program 1 times [2025-02-05 20:09:04,140 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-02-05 20:09:04,140 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1042546955] [2025-02-05 20:09:04,140 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-02-05 20:09:04,141 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-02-05 20:09:04,152 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 29 statements into 1 equivalence classes. [2025-02-05 20:09:04,160 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 29 of 29 statements. [2025-02-05 20:09:04,161 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-02-05 20:09:04,161 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-02-05 20:09:04,267 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:09:04,267 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-02-05 20:09:04,267 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1042546955] [2025-02-05 20:09:04,267 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1042546955] provided 1 perfect and 0 imperfect interpolant sequences [2025-02-05 20:09:04,267 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-02-05 20:09:04,268 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2025-02-05 20:09:04,268 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2121658408] [2025-02-05 20:09:04,268 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-02-05 20:09:04,268 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2025-02-05 20:09:04,268 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-02-05 20:09:04,268 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2025-02-05 20:09:04,269 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=10, Invalid=20, Unknown=0, NotChecked=0, Total=30 [2025-02-05 20:09:04,269 INFO L87 Difference]: Start difference. First operand 76 states and 105 transitions. Second operand has 6 states, 6 states have (on average 4.833333333333333) internal successors, (29), 6 states have internal predecessors, (29), 0 states have call successors, (0), 0 states have 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:09:04,386 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-02-05 20:09:04,386 INFO L93 Difference]: Finished difference Result 159 states and 214 transitions. [2025-02-05 20:09:04,386 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2025-02-05 20:09:04,387 INFO L78 Accepts]: Start accepts. Automaton has has 6 states, 6 states have (on average 4.833333333333333) internal successors, (29), 6 states have internal predecessors, (29), 0 states have call successors, (0), 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 29 [2025-02-05 20:09:04,387 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-02-05 20:09:04,387 INFO L225 Difference]: With dead ends: 159 [2025-02-05 20:09:04,387 INFO L226 Difference]: Without dead ends: 105 [2025-02-05 20:09:04,388 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:09:04,388 INFO L435 NwaCegarLoop]: 66 mSDtfsCounter, 130 mSDsluCounter, 148 mSDsCounter, 0 mSdLazyCounter, 122 mSolverCounterSat, 1 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 130 SdHoareTripleChecker+Valid, 214 SdHoareTripleChecker+Invalid, 123 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 1 IncrementalHoareTripleChecker+Valid, 122 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2025-02-05 20:09:04,388 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [130 Valid, 214 Invalid, 123 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [1 Valid, 122 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2025-02-05 20:09:04,389 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 105 states. [2025-02-05 20:09:04,391 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 105 to 78. [2025-02-05 20:09:04,391 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 78 states, 77 states have (on average 1.3896103896103895) internal successors, (107), 77 states have internal predecessors, (107), 0 states have call successors, (0), 0 states have 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:09:04,391 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 78 states to 78 states and 107 transitions. [2025-02-05 20:09:04,392 INFO L78 Accepts]: Start accepts. Automaton has 78 states and 107 transitions. Word has length 29 [2025-02-05 20:09:04,392 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-02-05 20:09:04,392 INFO L471 AbstractCegarLoop]: Abstraction has 78 states and 107 transitions. [2025-02-05 20:09:04,392 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 6 states have (on average 4.833333333333333) internal successors, (29), 6 states have internal predecessors, (29), 0 states have call successors, (0), 0 states have 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:09:04,392 INFO L276 IsEmpty]: Start isEmpty. Operand 78 states and 107 transitions. [2025-02-05 20:09:04,392 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 31 [2025-02-05 20:09:04,392 INFO L210 NwaCegarLoop]: Found error trace [2025-02-05 20:09:04,393 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] [2025-02-05 20:09:04,393 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable5 [2025-02-05 20:09:04,393 INFO L396 AbstractCegarLoop]: === Iteration 7 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-02-05 20:09:04,393 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-02-05 20:09:04,393 INFO L85 PathProgramCache]: Analyzing trace with hash 1829950631, now seen corresponding path program 1 times [2025-02-05 20:09:04,393 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-02-05 20:09:04,393 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2130717597] [2025-02-05 20:09:04,393 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-02-05 20:09:04,394 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-02-05 20:09:04,401 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 30 statements into 1 equivalence classes. [2025-02-05 20:09:04,413 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 30 of 30 statements. [2025-02-05 20:09:04,414 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-02-05 20:09:04,414 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-02-05 20:09:04,538 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:09:04,538 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-02-05 20:09:04,538 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2130717597] [2025-02-05 20:09:04,538 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [2130717597] provided 1 perfect and 0 imperfect interpolant sequences [2025-02-05 20:09:04,538 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-02-05 20:09:04,538 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2025-02-05 20:09:04,538 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [207711831] [2025-02-05 20:09:04,539 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-02-05 20:09:04,539 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2025-02-05 20:09:04,539 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-02-05 20:09:04,539 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2025-02-05 20:09:04,539 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=8, Invalid=12, Unknown=0, NotChecked=0, Total=20 [2025-02-05 20:09:04,539 INFO L87 Difference]: Start difference. First operand 78 states and 107 transitions. Second operand has 5 states, 5 states have (on average 6.0) internal successors, (30), 5 states have internal predecessors, (30), 0 states have call successors, (0), 0 states have 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:09:04,593 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-02-05 20:09:04,593 INFO L93 Difference]: Finished difference Result 138 states and 188 transitions. [2025-02-05 20:09:04,594 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2025-02-05 20:09:04,594 INFO L78 Accepts]: Start accepts. Automaton has has 5 states, 5 states have (on average 6.0) internal successors, (30), 5 states have internal predecessors, (30), 0 states have call successors, (0), 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 30 [2025-02-05 20:09:04,595 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-02-05 20:09:04,595 INFO L225 Difference]: With dead ends: 138 [2025-02-05 20:09:04,595 INFO L226 Difference]: Without dead ends: 84 [2025-02-05 20:09:04,595 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 8 GetRequests, 4 SyntacticMatches, 0 SemanticMatches, 4 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=12, Invalid=18, Unknown=0, NotChecked=0, Total=30 [2025-02-05 20:09:04,596 INFO L435 NwaCegarLoop]: 67 mSDtfsCounter, 71 mSDsluCounter, 129 mSDsCounter, 0 mSdLazyCounter, 56 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 71 SdHoareTripleChecker+Valid, 196 SdHoareTripleChecker+Invalid, 56 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 56 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2025-02-05 20:09:04,596 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [71 Valid, 196 Invalid, 56 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 56 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2025-02-05 20:09:04,596 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 84 states. [2025-02-05 20:09:04,598 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 84 to 84. [2025-02-05 20:09:04,598 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 84 states, 83 states have (on average 1.3614457831325302) internal successors, (113), 83 states have internal predecessors, (113), 0 states have call successors, (0), 0 states have 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:09:04,601 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 84 states to 84 states and 113 transitions. [2025-02-05 20:09:04,602 INFO L78 Accepts]: Start accepts. Automaton has 84 states and 113 transitions. Word has length 30 [2025-02-05 20:09:04,602 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-02-05 20:09:04,602 INFO L471 AbstractCegarLoop]: Abstraction has 84 states and 113 transitions. [2025-02-05 20:09:04,602 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 6.0) internal successors, (30), 5 states have internal predecessors, (30), 0 states have call successors, (0), 0 states have 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:09:04,602 INFO L276 IsEmpty]: Start isEmpty. Operand 84 states and 113 transitions. [2025-02-05 20:09:04,603 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 32 [2025-02-05 20:09:04,603 INFO L210 NwaCegarLoop]: Found error trace [2025-02-05 20:09:04,603 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] [2025-02-05 20:09:04,604 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable6 [2025-02-05 20:09:04,604 INFO L396 AbstractCegarLoop]: === Iteration 8 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-02-05 20:09:04,604 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-02-05 20:09:04,605 INFO L85 PathProgramCache]: Analyzing trace with hash 261374392, now seen corresponding path program 1 times [2025-02-05 20:09:04,605 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-02-05 20:09:04,605 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1966334283] [2025-02-05 20:09:04,605 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-02-05 20:09:04,605 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-02-05 20:09:04,615 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 31 statements into 1 equivalence classes. [2025-02-05 20:09:04,620 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 31 of 31 statements. [2025-02-05 20:09:04,620 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-02-05 20:09:04,620 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-02-05 20:09:04,704 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:09:04,704 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-02-05 20:09:04,704 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1966334283] [2025-02-05 20:09:04,704 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1966334283] provided 1 perfect and 0 imperfect interpolant sequences [2025-02-05 20:09:04,704 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-02-05 20:09:04,704 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2025-02-05 20:09:04,704 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1252762933] [2025-02-05 20:09:04,704 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-02-05 20:09:04,705 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2025-02-05 20:09:04,705 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-02-05 20:09:04,705 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2025-02-05 20:09:04,705 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=10, Invalid=20, Unknown=0, NotChecked=0, Total=30 [2025-02-05 20:09:04,705 INFO L87 Difference]: Start difference. First operand 84 states and 113 transitions. Second operand has 6 states, 6 states have (on average 5.166666666666667) internal successors, (31), 6 states have internal predecessors, (31), 0 states have call successors, (0), 0 states have 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:09:04,810 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-02-05 20:09:04,810 INFO L93 Difference]: Finished difference Result 156 states and 205 transitions. [2025-02-05 20:09:04,810 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2025-02-05 20:09:04,811 INFO L78 Accepts]: Start accepts. Automaton has has 6 states, 6 states have (on average 5.166666666666667) internal successors, (31), 6 states have internal predecessors, (31), 0 states have call successors, (0), 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 31 [2025-02-05 20:09:04,811 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-02-05 20:09:04,811 INFO L225 Difference]: With dead ends: 156 [2025-02-05 20:09:04,811 INFO L226 Difference]: Without dead ends: 96 [2025-02-05 20:09:04,812 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:09:04,812 INFO L435 NwaCegarLoop]: 66 mSDtfsCounter, 98 mSDsluCounter, 148 mSDsCounter, 0 mSdLazyCounter, 122 mSolverCounterSat, 1 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 98 SdHoareTripleChecker+Valid, 214 SdHoareTripleChecker+Invalid, 123 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 1 IncrementalHoareTripleChecker+Valid, 122 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2025-02-05 20:09:04,812 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [98 Valid, 214 Invalid, 123 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [1 Valid, 122 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2025-02-05 20:09:04,813 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 96 states. [2025-02-05 20:09:04,816 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 96 to 86. [2025-02-05 20:09:04,816 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 86 states, 85 states have (on average 1.3529411764705883) internal successors, (115), 85 states have internal predecessors, (115), 0 states have call successors, (0), 0 states have 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:09:04,816 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 86 states to 86 states and 115 transitions. [2025-02-05 20:09:04,816 INFO L78 Accepts]: Start accepts. Automaton has 86 states and 115 transitions. Word has length 31 [2025-02-05 20:09:04,817 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-02-05 20:09:04,817 INFO L471 AbstractCegarLoop]: Abstraction has 86 states and 115 transitions. [2025-02-05 20:09:04,817 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 6 states have (on average 5.166666666666667) internal successors, (31), 6 states have internal predecessors, (31), 0 states have call successors, (0), 0 states have 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:09:04,817 INFO L276 IsEmpty]: Start isEmpty. Operand 86 states and 115 transitions. [2025-02-05 20:09:04,817 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 50 [2025-02-05 20:09:04,817 INFO L210 NwaCegarLoop]: Found error trace [2025-02-05 20:09:04,818 INFO L218 NwaCegarLoop]: trace histogram [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] [2025-02-05 20:09:04,818 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable7 [2025-02-05 20:09:04,818 INFO L396 AbstractCegarLoop]: === Iteration 9 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-02-05 20:09:04,818 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-02-05 20:09:04,818 INFO L85 PathProgramCache]: Analyzing trace with hash -57917144, now seen corresponding path program 1 times [2025-02-05 20:09:04,818 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-02-05 20:09:04,818 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1913082260] [2025-02-05 20:09:04,818 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-02-05 20:09:04,822 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-02-05 20:09:04,841 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 49 statements into 1 equivalence classes. [2025-02-05 20:09:04,885 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 49 of 49 statements. [2025-02-05 20:09:04,885 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-02-05 20:09:04,885 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-02-05 20:09:05,135 INFO L134 CoverageAnalysis]: Checked inductivity of 13 backedges. 11 proven. 2 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-02-05 20:09:05,135 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-02-05 20:09:05,135 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1913082260] [2025-02-05 20:09:05,136 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1913082260] provided 0 perfect and 1 imperfect interpolant sequences [2025-02-05 20:09:05,136 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1515872869] [2025-02-05 20:09:05,136 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-02-05 20:09:05,136 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-02-05 20:09:05,136 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 [2025-02-05 20:09:05,139 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:09:05,140 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:09:05,232 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 49 statements into 1 equivalence classes. [2025-02-05 20:09:05,280 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 49 of 49 statements. [2025-02-05 20:09:05,280 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-02-05 20:09:05,280 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-02-05 20:09:05,287 INFO L256 TraceCheckSpWp]: Trace formula consists of 358 conjuncts, 26 conjuncts are in the unsatisfiable core [2025-02-05 20:09:05,292 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-02-05 20:09:05,521 INFO L134 CoverageAnalysis]: Checked inductivity of 13 backedges. 11 proven. 2 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-02-05 20:09:05,521 INFO L312 TraceCheckSpWp]: Computing backward predicates... [2025-02-05 20:09:05,689 INFO L134 CoverageAnalysis]: Checked inductivity of 13 backedges. 11 proven. 1 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2025-02-05 20:09:05,689 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1515872869] provided 0 perfect and 2 imperfect interpolant sequences [2025-02-05 20:09:05,689 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2025-02-05 20:09:05,689 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [6, 7, 6] total 15 [2025-02-05 20:09:05,690 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [798292139] [2025-02-05 20:09:05,690 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2025-02-05 20:09:05,690 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 15 states [2025-02-05 20:09:05,690 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-02-05 20:09:05,690 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 15 interpolants. [2025-02-05 20:09:05,690 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=34, Invalid=176, Unknown=0, NotChecked=0, Total=210 [2025-02-05 20:09:05,691 INFO L87 Difference]: Start difference. First operand 86 states and 115 transitions. Second operand has 15 states, 15 states have (on average 7.8) internal successors, (117), 15 states have internal predecessors, (117), 0 states have call successors, (0), 0 states have 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:09:06,052 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-02-05 20:09:06,052 INFO L93 Difference]: Finished difference Result 148 states and 194 transitions. [2025-02-05 20:09:06,053 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 11 states. [2025-02-05 20:09:06,053 INFO L78 Accepts]: Start accepts. Automaton has has 15 states, 15 states have (on average 7.8) internal successors, (117), 15 states have internal predecessors, (117), 0 states have call successors, (0), 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 49 [2025-02-05 20:09:06,053 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-02-05 20:09:06,053 INFO L225 Difference]: With dead ends: 148 [2025-02-05 20:09:06,053 INFO L226 Difference]: Without dead ends: 88 [2025-02-05 20:09:06,054 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 110 GetRequests, 88 SyntacticMatches, 1 SemanticMatches, 21 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 47 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=114, Invalid=392, Unknown=0, NotChecked=0, Total=506 [2025-02-05 20:09:06,054 INFO L435 NwaCegarLoop]: 19 mSDtfsCounter, 363 mSDsluCounter, 120 mSDsCounter, 0 mSdLazyCounter, 491 mSolverCounterSat, 4 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 363 SdHoareTripleChecker+Valid, 139 SdHoareTripleChecker+Invalid, 495 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 4 IncrementalHoareTripleChecker+Valid, 491 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.3s IncrementalHoareTripleChecker+Time [2025-02-05 20:09:06,054 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [363 Valid, 139 Invalid, 495 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [4 Valid, 491 Invalid, 0 Unknown, 0 Unchecked, 0.3s Time] [2025-02-05 20:09:06,055 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 88 states. [2025-02-05 20:09:06,059 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 88 to 81. [2025-02-05 20:09:06,060 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 81 states, 80 states have (on average 1.2875) internal successors, (103), 80 states have internal predecessors, (103), 0 states have call successors, (0), 0 states have 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:09:06,061 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 81 states to 81 states and 103 transitions. [2025-02-05 20:09:06,061 INFO L78 Accepts]: Start accepts. Automaton has 81 states and 103 transitions. Word has length 49 [2025-02-05 20:09:06,061 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-02-05 20:09:06,061 INFO L471 AbstractCegarLoop]: Abstraction has 81 states and 103 transitions. [2025-02-05 20:09:06,061 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 15 states, 15 states have (on average 7.8) internal successors, (117), 15 states have internal predecessors, (117), 0 states have call successors, (0), 0 states have 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:09:06,061 INFO L276 IsEmpty]: Start isEmpty. Operand 81 states and 103 transitions. [2025-02-05 20:09:06,062 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 53 [2025-02-05 20:09:06,062 INFO L210 NwaCegarLoop]: Found error trace [2025-02-05 20:09:06,062 INFO L218 NwaCegarLoop]: trace histogram [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] [2025-02-05 20:09:06,069 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:09:06,262 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable8,2 /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-02-05 20:09:06,263 INFO L396 AbstractCegarLoop]: === Iteration 10 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-02-05 20:09:06,263 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-02-05 20:09:06,263 INFO L85 PathProgramCache]: Analyzing trace with hash -2069136410, now seen corresponding path program 1 times [2025-02-05 20:09:06,264 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-02-05 20:09:06,264 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1503394895] [2025-02-05 20:09:06,264 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-02-05 20:09:06,264 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-02-05 20:09:06,279 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 52 statements into 1 equivalence classes. [2025-02-05 20:09:06,341 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 52 of 52 statements. [2025-02-05 20:09:06,341 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-02-05 20:09:06,341 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-02-05 20:09:07,054 INFO L134 CoverageAnalysis]: Checked inductivity of 13 backedges. 9 proven. 4 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-02-05 20:09:07,055 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-02-05 20:09:07,055 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1503394895] [2025-02-05 20:09:07,055 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1503394895] provided 0 perfect and 1 imperfect interpolant sequences [2025-02-05 20:09:07,055 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1547520050] [2025-02-05 20:09:07,055 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-02-05 20:09:07,055 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-02-05 20:09:07,055 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 [2025-02-05 20:09:07,057 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:09:07,059 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:09:07,148 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 52 statements into 1 equivalence classes. [2025-02-05 20:09:07,206 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 52 of 52 statements. [2025-02-05 20:09:07,206 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-02-05 20:09:07,206 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-02-05 20:09:07,208 INFO L256 TraceCheckSpWp]: Trace formula consists of 363 conjuncts, 59 conjuncts are in the unsatisfiable core [2025-02-05 20:09:07,213 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-02-05 20:09:07,475 INFO L134 CoverageAnalysis]: Checked inductivity of 13 backedges. 9 proven. 4 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-02-05 20:09:07,475 INFO L312 TraceCheckSpWp]: Computing backward predicates... [2025-02-05 20:09:08,067 INFO L134 CoverageAnalysis]: Checked inductivity of 13 backedges. 7 proven. 6 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-02-05 20:09:08,068 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1547520050] provided 0 perfect and 2 imperfect interpolant sequences [2025-02-05 20:09:08,068 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2025-02-05 20:09:08,068 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [7, 8, 10] total 19 [2025-02-05 20:09:08,068 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [925218227] [2025-02-05 20:09:08,068 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2025-02-05 20:09:08,068 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 19 states [2025-02-05 20:09:08,069 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-02-05 20:09:08,069 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 19 interpolants. [2025-02-05 20:09:08,069 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=64, Invalid=278, Unknown=0, NotChecked=0, Total=342 [2025-02-05 20:09:08,069 INFO L87 Difference]: Start difference. First operand 81 states and 103 transitions. Second operand has 19 states, 19 states have (on average 5.684210526315789) internal successors, (108), 19 states have internal predecessors, (108), 0 states have call successors, (0), 0 states have 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:09:08,439 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-02-05 20:09:08,440 INFO L93 Difference]: Finished difference Result 150 states and 190 transitions. [2025-02-05 20:09:08,440 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 11 states. [2025-02-05 20:09:08,440 INFO L78 Accepts]: Start accepts. Automaton has has 19 states, 19 states have (on average 5.684210526315789) internal successors, (108), 19 states have internal predecessors, (108), 0 states have call successors, (0), 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:09:08,440 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-02-05 20:09:08,441 INFO L225 Difference]: With dead ends: 150 [2025-02-05 20:09:08,441 INFO L226 Difference]: Without dead ends: 106 [2025-02-05 20:09:08,441 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 116 GetRequests, 93 SyntacticMatches, 0 SemanticMatches, 23 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 129 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=122, Invalid=478, Unknown=0, NotChecked=0, Total=600 [2025-02-05 20:09:08,442 INFO L435 NwaCegarLoop]: 19 mSDtfsCounter, 162 mSDsluCounter, 151 mSDsCounter, 0 mSdLazyCounter, 551 mSolverCounterSat, 3 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 162 SdHoareTripleChecker+Valid, 170 SdHoareTripleChecker+Invalid, 554 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 3 IncrementalHoareTripleChecker+Valid, 551 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.3s IncrementalHoareTripleChecker+Time [2025-02-05 20:09:08,442 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [162 Valid, 170 Invalid, 554 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [3 Valid, 551 Invalid, 0 Unknown, 0 Unchecked, 0.3s Time] [2025-02-05 20:09:08,442 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 106 states. [2025-02-05 20:09:08,445 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 106 to 96. [2025-02-05 20:09:08,445 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 96 states, 95 states have (on average 1.2947368421052632) internal successors, (123), 95 states have internal predecessors, (123), 0 states have call successors, (0), 0 states have 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:09:08,446 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 96 states to 96 states and 123 transitions. [2025-02-05 20:09:08,446 INFO L78 Accepts]: Start accepts. Automaton has 96 states and 123 transitions. Word has length 52 [2025-02-05 20:09:08,446 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-02-05 20:09:08,446 INFO L471 AbstractCegarLoop]: Abstraction has 96 states and 123 transitions. [2025-02-05 20:09:08,446 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 19 states, 19 states have (on average 5.684210526315789) internal successors, (108), 19 states have internal predecessors, (108), 0 states have call successors, (0), 0 states have 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:09:08,446 INFO L276 IsEmpty]: Start isEmpty. Operand 96 states and 123 transitions. [2025-02-05 20:09:08,448 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 73 [2025-02-05 20:09:08,448 INFO L210 NwaCegarLoop]: Found error trace [2025-02-05 20:09:08,448 INFO L218 NwaCegarLoop]: trace histogram [3, 3, 3, 3, 3, 3, 3, 3, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-02-05 20:09:08,456 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:09:08,648 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable9,3 /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-02-05 20:09:08,649 INFO L396 AbstractCegarLoop]: === Iteration 11 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-02-05 20:09:08,651 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-02-05 20:09:08,651 INFO L85 PathProgramCache]: Analyzing trace with hash 1423513662, now seen corresponding path program 1 times [2025-02-05 20:09:08,651 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-02-05 20:09:08,652 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [370671599] [2025-02-05 20:09:08,652 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-02-05 20:09:08,652 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-02-05 20:09:08,671 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 72 statements into 1 equivalence classes. [2025-02-05 20:09:08,784 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 72 of 72 statements. [2025-02-05 20:09:08,784 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-02-05 20:09:08,784 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-02-05 20:09:09,751 INFO L134 CoverageAnalysis]: Checked inductivity of 46 backedges. 32 proven. 14 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-02-05 20:09:09,751 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-02-05 20:09:09,751 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [370671599] [2025-02-05 20:09:09,751 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [370671599] provided 0 perfect and 1 imperfect interpolant sequences [2025-02-05 20:09:09,751 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [979050979] [2025-02-05 20:09:09,752 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-02-05 20:09:09,752 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-02-05 20:09:09,752 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 [2025-02-05 20:09:09,753 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:09:09,755 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:09:09,852 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 72 statements into 1 equivalence classes. [2025-02-05 20:09:09,945 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 72 of 72 statements. [2025-02-05 20:09:09,946 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-02-05 20:09:09,946 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-02-05 20:09:09,950 INFO L256 TraceCheckSpWp]: Trace formula consists of 549 conjuncts, 100 conjuncts are in the unsatisfiable core [2025-02-05 20:09:09,957 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-02-05 20:09:10,835 INFO L134 CoverageAnalysis]: Checked inductivity of 46 backedges. 32 proven. 14 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-02-05 20:09:10,835 INFO L312 TraceCheckSpWp]: Computing backward predicates... [2025-02-05 20:09:11,858 INFO L134 CoverageAnalysis]: Checked inductivity of 46 backedges. 18 proven. 28 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-02-05 20:09:11,859 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [979050979] provided 0 perfect and 2 imperfect interpolant sequences [2025-02-05 20:09:11,859 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2025-02-05 20:09:11,859 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [12, 18, 18] total 44 [2025-02-05 20:09:11,859 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [706628157] [2025-02-05 20:09:11,859 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2025-02-05 20:09:11,860 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 44 states [2025-02-05 20:09:11,860 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-02-05 20:09:11,860 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 44 interpolants. [2025-02-05 20:09:11,861 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=310, Invalid=1582, Unknown=0, NotChecked=0, Total=1892 [2025-02-05 20:09:11,861 INFO L87 Difference]: Start difference. First operand 96 states and 123 transitions. Second operand has 44 states, 44 states have (on average 4.2272727272727275) internal successors, (186), 44 states have internal predecessors, (186), 0 states have call successors, (0), 0 states have 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:09:13,877 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-02-05 20:09:13,878 INFO L93 Difference]: Finished difference Result 399 states and 495 transitions. [2025-02-05 20:09:13,878 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 54 states. [2025-02-05 20:09:13,879 INFO L78 Accepts]: Start accepts. Automaton has has 44 states, 44 states have (on average 4.2272727272727275) internal successors, (186), 44 states have internal predecessors, (186), 0 states have call successors, (0), 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 72 [2025-02-05 20:09:13,879 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-02-05 20:09:13,881 INFO L225 Difference]: With dead ends: 399 [2025-02-05 20:09:13,881 INFO L226 Difference]: Without dead ends: 355 [2025-02-05 20:09:13,884 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 195 GetRequests, 114 SyntacticMatches, 0 SemanticMatches, 81 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 2034 ImplicationChecksByTransitivity, 2.0s TimeCoverageRelationStatistics Valid=994, Invalid=5812, Unknown=0, NotChecked=0, Total=6806 [2025-02-05 20:09:13,885 INFO L435 NwaCegarLoop]: 19 mSDtfsCounter, 464 mSDsluCounter, 463 mSDsCounter, 0 mSdLazyCounter, 1651 mSolverCounterSat, 34 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.8s Time, 0 mProtectedPredicate, 0 mProtectedAction, 464 SdHoareTripleChecker+Valid, 482 SdHoareTripleChecker+Invalid, 1685 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 34 IncrementalHoareTripleChecker+Valid, 1651 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.9s IncrementalHoareTripleChecker+Time [2025-02-05 20:09:13,885 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [464 Valid, 482 Invalid, 1685 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [34 Valid, 1651 Invalid, 0 Unknown, 0 Unchecked, 0.9s Time] [2025-02-05 20:09:13,886 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 355 states. [2025-02-05 20:09:13,892 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 355 to 169. [2025-02-05 20:09:13,897 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 169 states, 168 states have (on average 1.2797619047619047) internal successors, (215), 168 states have internal predecessors, (215), 0 states have call successors, (0), 0 states have 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:09:13,897 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 169 states to 169 states and 215 transitions. [2025-02-05 20:09:13,898 INFO L78 Accepts]: Start accepts. Automaton has 169 states and 215 transitions. Word has length 72 [2025-02-05 20:09:13,898 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-02-05 20:09:13,899 INFO L471 AbstractCegarLoop]: Abstraction has 169 states and 215 transitions. [2025-02-05 20:09:13,899 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 44 states, 44 states have (on average 4.2272727272727275) internal successors, (186), 44 states have internal predecessors, (186), 0 states have call successors, (0), 0 states have 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:09:13,899 INFO L276 IsEmpty]: Start isEmpty. Operand 169 states and 215 transitions. [2025-02-05 20:09:13,899 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 74 [2025-02-05 20:09:13,899 INFO L210 NwaCegarLoop]: Found error trace [2025-02-05 20:09:13,900 INFO L218 NwaCegarLoop]: trace histogram [3, 3, 3, 3, 3, 3, 3, 3, 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] [2025-02-05 20:09:13,907 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (4)] Forceful destruction successful, exit code 0 [2025-02-05 20:09:14,104 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:09:14,104 INFO L396 AbstractCegarLoop]: === Iteration 12 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-02-05 20:09:14,104 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-02-05 20:09:14,105 INFO L85 PathProgramCache]: Analyzing trace with hash 468999021, now seen corresponding path program 1 times [2025-02-05 20:09:14,105 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-02-05 20:09:14,105 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1161174825] [2025-02-05 20:09:14,105 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-02-05 20:09:14,105 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-02-05 20:09:14,130 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 73 statements into 1 equivalence classes. [2025-02-05 20:09:14,266 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 73 of 73 statements. [2025-02-05 20:09:14,266 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-02-05 20:09:14,266 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-02-05 20:09:14,803 INFO L134 CoverageAnalysis]: Checked inductivity of 46 backedges. 39 proven. 7 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-02-05 20:09:14,804 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-02-05 20:09:14,804 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1161174825] [2025-02-05 20:09:14,804 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1161174825] provided 0 perfect and 1 imperfect interpolant sequences [2025-02-05 20:09:14,804 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [435829909] [2025-02-05 20:09:14,804 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-02-05 20:09:14,804 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-02-05 20:09:14,805 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 [2025-02-05 20:09:14,806 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:09:14,808 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:09:14,915 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 73 statements into 1 equivalence classes. [2025-02-05 20:09:14,991 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 73 of 73 statements. [2025-02-05 20:09:14,991 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-02-05 20:09:14,991 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-02-05 20:09:14,996 INFO L256 TraceCheckSpWp]: Trace formula consists of 552 conjuncts, 77 conjuncts are in the unsatisfiable core [2025-02-05 20:09:15,000 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-02-05 20:09:15,554 INFO L134 CoverageAnalysis]: Checked inductivity of 46 backedges. 19 proven. 27 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-02-05 20:09:15,554 INFO L312 TraceCheckSpWp]: Computing backward predicates... [2025-02-05 20:09:16,049 INFO L134 CoverageAnalysis]: Checked inductivity of 46 backedges. 37 proven. 9 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-02-05 20:09:16,049 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [435829909] provided 0 perfect and 2 imperfect interpolant sequences [2025-02-05 20:09:16,049 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2025-02-05 20:09:16,050 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [11, 18, 12] total 37 [2025-02-05 20:09:16,050 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [612309953] [2025-02-05 20:09:16,050 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2025-02-05 20:09:16,050 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 37 states [2025-02-05 20:09:16,050 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-02-05 20:09:16,051 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 37 interpolants. [2025-02-05 20:09:16,051 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=195, Invalid=1137, Unknown=0, NotChecked=0, Total=1332 [2025-02-05 20:09:16,051 INFO L87 Difference]: Start difference. First operand 169 states and 215 transitions. Second operand has 37 states, 37 states have (on average 5.108108108108108) internal successors, (189), 37 states have internal predecessors, (189), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-02-05 20:09:18,377 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-02-05 20:09:18,377 INFO L93 Difference]: Finished difference Result 746 states and 943 transitions. [2025-02-05 20:09:18,378 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 66 states. [2025-02-05 20:09:18,378 INFO L78 Accepts]: Start accepts. Automaton has has 37 states, 37 states have (on average 5.108108108108108) internal successors, (189), 37 states have internal predecessors, (189), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 73 [2025-02-05 20:09:18,378 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-02-05 20:09:18,380 INFO L225 Difference]: With dead ends: 746 [2025-02-05 20:09:18,380 INFO L226 Difference]: Without dead ends: 614 [2025-02-05 20:09:18,382 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 239 GetRequests, 141 SyntacticMatches, 0 SemanticMatches, 98 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 3041 ImplicationChecksByTransitivity, 1.6s TimeCoverageRelationStatistics Valid=1214, Invalid=8686, Unknown=0, NotChecked=0, Total=9900 [2025-02-05 20:09:18,383 INFO L435 NwaCegarLoop]: 49 mSDtfsCounter, 444 mSDsluCounter, 844 mSDsCounter, 0 mSdLazyCounter, 2916 mSolverCounterSat, 25 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 1.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 444 SdHoareTripleChecker+Valid, 893 SdHoareTripleChecker+Invalid, 2941 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 25 IncrementalHoareTripleChecker+Valid, 2916 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 1.1s IncrementalHoareTripleChecker+Time [2025-02-05 20:09:18,383 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [444 Valid, 893 Invalid, 2941 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [25 Valid, 2916 Invalid, 0 Unknown, 0 Unchecked, 1.1s Time] [2025-02-05 20:09:18,383 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 614 states. [2025-02-05 20:09:18,389 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 614 to 181. [2025-02-05 20:09:18,390 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 181 states, 180 states have (on average 1.2944444444444445) internal successors, (233), 180 states have internal predecessors, (233), 0 states have call successors, (0), 0 states have 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:09:18,391 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 181 states to 181 states and 233 transitions. [2025-02-05 20:09:18,391 INFO L78 Accepts]: Start accepts. Automaton has 181 states and 233 transitions. Word has length 73 [2025-02-05 20:09:18,391 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-02-05 20:09:18,392 INFO L471 AbstractCegarLoop]: Abstraction has 181 states and 233 transitions. [2025-02-05 20:09:18,392 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 37 states, 37 states have (on average 5.108108108108108) internal successors, (189), 37 states have internal predecessors, (189), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-02-05 20:09:18,392 INFO L276 IsEmpty]: Start isEmpty. Operand 181 states and 233 transitions. [2025-02-05 20:09:18,392 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 74 [2025-02-05 20:09:18,393 INFO L210 NwaCegarLoop]: Found error trace [2025-02-05 20:09:18,393 INFO L218 NwaCegarLoop]: trace histogram [3, 3, 3, 3, 3, 3, 3, 3, 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] [2025-02-05 20:09:18,400 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:09:18,593 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:09:18,593 INFO L396 AbstractCegarLoop]: === Iteration 13 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-02-05 20:09:18,594 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-02-05 20:09:18,594 INFO L85 PathProgramCache]: Analyzing trace with hash 135161074, now seen corresponding path program 1 times [2025-02-05 20:09:18,594 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-02-05 20:09:18,594 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1178360086] [2025-02-05 20:09:18,594 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-02-05 20:09:18,594 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-02-05 20:09:18,610 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 73 statements into 1 equivalence classes. [2025-02-05 20:09:18,663 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 73 of 73 statements. [2025-02-05 20:09:18,663 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-02-05 20:09:18,663 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-02-05 20:09:18,935 INFO L134 CoverageAnalysis]: Checked inductivity of 46 backedges. 46 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-02-05 20:09:18,935 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-02-05 20:09:18,935 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1178360086] [2025-02-05 20:09:18,935 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1178360086] provided 1 perfect and 0 imperfect interpolant sequences [2025-02-05 20:09:18,935 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-02-05 20:09:18,935 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2025-02-05 20:09:18,936 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1506891009] [2025-02-05 20:09:18,936 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-02-05 20:09:18,936 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2025-02-05 20:09:18,936 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-02-05 20:09:18,937 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2025-02-05 20:09:18,937 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=12, Invalid=18, Unknown=0, NotChecked=0, Total=30 [2025-02-05 20:09:18,937 INFO L87 Difference]: Start difference. First operand 181 states and 233 transitions. Second operand has 6 states, 6 states have (on average 12.166666666666666) internal successors, (73), 6 states have internal predecessors, (73), 0 states have call successors, (0), 0 states have 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:09:19,084 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-02-05 20:09:19,084 INFO L93 Difference]: Finished difference Result 457 states and 587 transitions. [2025-02-05 20:09:19,084 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2025-02-05 20:09:19,085 INFO L78 Accepts]: Start accepts. Automaton has has 6 states, 6 states have (on average 12.166666666666666) internal successors, (73), 6 states have internal predecessors, (73), 0 states have call successors, (0), 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 73 [2025-02-05 20:09:19,085 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-02-05 20:09:19,086 INFO L225 Difference]: With dead ends: 457 [2025-02-05 20:09:19,087 INFO L226 Difference]: Without dead ends: 313 [2025-02-05 20:09:19,087 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 8 GetRequests, 4 SyntacticMatches, 0 SemanticMatches, 4 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=12, Invalid=18, Unknown=0, NotChecked=0, Total=30 [2025-02-05 20:09:19,087 INFO L435 NwaCegarLoop]: 41 mSDtfsCounter, 69 mSDsluCounter, 97 mSDsCounter, 0 mSdLazyCounter, 304 mSolverCounterSat, 1 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 69 SdHoareTripleChecker+Valid, 138 SdHoareTripleChecker+Invalid, 305 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 1 IncrementalHoareTripleChecker+Valid, 304 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2025-02-05 20:09:19,088 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [69 Valid, 138 Invalid, 305 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [1 Valid, 304 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2025-02-05 20:09:19,089 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 313 states. [2025-02-05 20:09:19,096 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 313 to 305. [2025-02-05 20:09:19,097 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 305 states, 304 states have (on average 1.2664473684210527) internal successors, (385), 304 states have internal predecessors, (385), 0 states have call successors, (0), 0 states have 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:09:19,097 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 305 states to 305 states and 385 transitions. [2025-02-05 20:09:19,097 INFO L78 Accepts]: Start accepts. Automaton has 305 states and 385 transitions. Word has length 73 [2025-02-05 20:09:19,098 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-02-05 20:09:19,098 INFO L471 AbstractCegarLoop]: Abstraction has 305 states and 385 transitions. [2025-02-05 20:09:19,098 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 6 states have (on average 12.166666666666666) internal successors, (73), 6 states have internal predecessors, (73), 0 states have call successors, (0), 0 states have 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:09:19,098 INFO L276 IsEmpty]: Start isEmpty. Operand 305 states and 385 transitions. [2025-02-05 20:09:19,099 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 75 [2025-02-05 20:09:19,099 INFO L210 NwaCegarLoop]: Found error trace [2025-02-05 20:09:19,099 INFO L218 NwaCegarLoop]: trace histogram [3, 3, 3, 3, 3, 3, 3, 3, 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] [2025-02-05 20:09:19,099 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable12 [2025-02-05 20:09:19,099 INFO L396 AbstractCegarLoop]: === Iteration 14 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-02-05 20:09:19,100 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-02-05 20:09:19,100 INFO L85 PathProgramCache]: Analyzing trace with hash 816515579, now seen corresponding path program 1 times [2025-02-05 20:09:19,100 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-02-05 20:09:19,100 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [424156211] [2025-02-05 20:09:19,100 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-02-05 20:09:19,100 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-02-05 20:09:19,120 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 74 statements into 1 equivalence classes. [2025-02-05 20:09:19,204 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 74 of 74 statements. [2025-02-05 20:09:19,205 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-02-05 20:09:19,205 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-02-05 20:09:19,733 INFO L134 CoverageAnalysis]: Checked inductivity of 46 backedges. 30 proven. 0 refuted. 0 times theorem prover too weak. 16 trivial. 0 not checked. [2025-02-05 20:09:19,733 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-02-05 20:09:19,733 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [424156211] [2025-02-05 20:09:19,733 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [424156211] provided 1 perfect and 0 imperfect interpolant sequences [2025-02-05 20:09:19,733 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-02-05 20:09:19,733 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2025-02-05 20:09:19,733 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1581950988] [2025-02-05 20:09:19,733 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-02-05 20:09:19,734 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2025-02-05 20:09:19,734 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-02-05 20:09:19,734 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2025-02-05 20:09:19,734 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=8, Invalid=12, Unknown=0, NotChecked=0, Total=20 [2025-02-05 20:09:19,734 INFO L87 Difference]: Start difference. First operand 305 states and 385 transitions. Second operand has 5 states, 5 states have (on average 12.6) internal successors, (63), 5 states have internal predecessors, (63), 0 states have call successors, (0), 0 states have 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:09:19,775 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-02-05 20:09:19,775 INFO L93 Difference]: Finished difference Result 577 states and 729 transitions. [2025-02-05 20:09:19,776 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2025-02-05 20:09:19,776 INFO L78 Accepts]: Start accepts. Automaton has has 5 states, 5 states have (on average 12.6) internal successors, (63), 5 states have internal predecessors, (63), 0 states have call successors, (0), 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 74 [2025-02-05 20:09:19,776 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-02-05 20:09:19,777 INFO L225 Difference]: With dead ends: 577 [2025-02-05 20:09:19,777 INFO L226 Difference]: Without dead ends: 309 [2025-02-05 20:09:19,777 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 7 GetRequests, 3 SyntacticMatches, 0 SemanticMatches, 4 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=12, Invalid=18, Unknown=0, NotChecked=0, Total=30 [2025-02-05 20:09:19,778 INFO L435 NwaCegarLoop]: 63 mSDtfsCounter, 71 mSDsluCounter, 119 mSDsCounter, 0 mSdLazyCounter, 55 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 71 SdHoareTripleChecker+Valid, 182 SdHoareTripleChecker+Invalid, 55 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 55 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2025-02-05 20:09:19,778 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [71 Valid, 182 Invalid, 55 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 55 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2025-02-05 20:09:19,778 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 309 states. [2025-02-05 20:09:19,782 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 309 to 309. [2025-02-05 20:09:19,783 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 309 states, 308 states have (on average 1.2662337662337662) internal successors, (390), 308 states have internal predecessors, (390), 0 states have call successors, (0), 0 states have 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:09:19,783 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 309 states to 309 states and 390 transitions. [2025-02-05 20:09:19,783 INFO L78 Accepts]: Start accepts. Automaton has 309 states and 390 transitions. Word has length 74 [2025-02-05 20:09:19,783 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-02-05 20:09:19,784 INFO L471 AbstractCegarLoop]: Abstraction has 309 states and 390 transitions. [2025-02-05 20:09:19,784 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 12.6) internal successors, (63), 5 states have internal predecessors, (63), 0 states have call successors, (0), 0 states have 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:09:19,784 INFO L276 IsEmpty]: Start isEmpty. Operand 309 states and 390 transitions. [2025-02-05 20:09:19,784 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 75 [2025-02-05 20:09:19,784 INFO L210 NwaCegarLoop]: Found error trace [2025-02-05 20:09:19,784 INFO L218 NwaCegarLoop]: trace histogram [3, 3, 3, 3, 3, 3, 3, 3, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-02-05 20:09:19,785 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable13 [2025-02-05 20:09:19,785 INFO L396 AbstractCegarLoop]: === Iteration 15 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-02-05 20:09:19,785 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-02-05 20:09:19,785 INFO L85 PathProgramCache]: Analyzing trace with hash 1643209486, now seen corresponding path program 1 times [2025-02-05 20:09:19,785 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-02-05 20:09:19,785 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [688622749] [2025-02-05 20:09:19,785 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-02-05 20:09:19,785 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-02-05 20:09:19,803 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 74 statements into 1 equivalence classes. [2025-02-05 20:09:19,836 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 74 of 74 statements. [2025-02-05 20:09:19,836 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-02-05 20:09:19,836 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-02-05 20:09:20,037 INFO L134 CoverageAnalysis]: Checked inductivity of 47 backedges. 33 proven. 0 refuted. 0 times theorem prover too weak. 14 trivial. 0 not checked. [2025-02-05 20:09:20,037 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-02-05 20:09:20,037 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [688622749] [2025-02-05 20:09:20,037 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [688622749] provided 1 perfect and 0 imperfect interpolant sequences [2025-02-05 20:09:20,037 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-02-05 20:09:20,038 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2025-02-05 20:09:20,038 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [947318732] [2025-02-05 20:09:20,038 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-02-05 20:09:20,038 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2025-02-05 20:09:20,039 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-02-05 20:09:20,040 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2025-02-05 20:09:20,040 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2025-02-05 20:09:20,040 INFO L87 Difference]: Start difference. First operand 309 states and 390 transitions. Second operand has 5 states, 5 states have (on average 13.0) internal successors, (65), 5 states have internal predecessors, (65), 0 states have call successors, (0), 0 states have 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:09:20,151 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-02-05 20:09:20,151 INFO L93 Difference]: Finished difference Result 579 states and 731 transitions. [2025-02-05 20:09:20,152 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2025-02-05 20:09:20,152 INFO L78 Accepts]: Start accepts. Automaton has has 5 states, 5 states have (on average 13.0) internal successors, (65), 5 states have internal predecessors, (65), 0 states have call successors, (0), 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 74 [2025-02-05 20:09:20,152 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-02-05 20:09:20,153 INFO L225 Difference]: With dead ends: 579 [2025-02-05 20:09:20,153 INFO L226 Difference]: Without dead ends: 311 [2025-02-05 20:09:20,154 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:09:20,154 INFO L435 NwaCegarLoop]: 22 mSDtfsCounter, 92 mSDsluCounter, 41 mSDsCounter, 0 mSdLazyCounter, 174 mSolverCounterSat, 1 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 92 SdHoareTripleChecker+Valid, 63 SdHoareTripleChecker+Invalid, 175 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 1 IncrementalHoareTripleChecker+Valid, 174 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2025-02-05 20:09:20,155 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [92 Valid, 63 Invalid, 175 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [1 Valid, 174 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2025-02-05 20:09:20,155 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 311 states. [2025-02-05 20:09:20,161 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 311 to 311. [2025-02-05 20:09:20,162 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 311 states, 310 states have (on average 1.264516129032258) internal successors, (392), 310 states have internal predecessors, (392), 0 states have call successors, (0), 0 states have 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:09:20,162 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 311 states to 311 states and 392 transitions. [2025-02-05 20:09:20,162 INFO L78 Accepts]: Start accepts. Automaton has 311 states and 392 transitions. Word has length 74 [2025-02-05 20:09:20,163 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-02-05 20:09:20,163 INFO L471 AbstractCegarLoop]: Abstraction has 311 states and 392 transitions. [2025-02-05 20:09:20,163 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 13.0) internal successors, (65), 5 states have internal predecessors, (65), 0 states have call successors, (0), 0 states have 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:09:20,163 INFO L276 IsEmpty]: Start isEmpty. Operand 311 states and 392 transitions. [2025-02-05 20:09:20,163 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 95 [2025-02-05 20:09:20,163 INFO L210 NwaCegarLoop]: Found error trace [2025-02-05 20:09:20,163 INFO L218 NwaCegarLoop]: trace histogram [4, 4, 4, 4, 4, 4, 4, 4, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-02-05 20:09:20,164 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable14 [2025-02-05 20:09:20,164 INFO L396 AbstractCegarLoop]: === Iteration 16 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-02-05 20:09:20,164 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-02-05 20:09:20,164 INFO L85 PathProgramCache]: Analyzing trace with hash -1417128877, now seen corresponding path program 2 times [2025-02-05 20:09:20,164 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-02-05 20:09:20,164 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1176302771] [2025-02-05 20:09:20,164 INFO L95 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST1 [2025-02-05 20:09:20,164 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-02-05 20:09:20,191 INFO L108 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 partitioned 94 statements into 2 equivalence classes. [2025-02-05 20:09:20,271 INFO L111 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) and asserted 94 of 94 statements. [2025-02-05 20:09:20,271 INFO L114 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) [2025-02-05 20:09:20,271 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-02-05 20:09:20,573 INFO L134 CoverageAnalysis]: Checked inductivity of 99 backedges. 60 proven. 24 refuted. 0 times theorem prover too weak. 15 trivial. 0 not checked. [2025-02-05 20:09:20,573 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-02-05 20:09:20,573 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1176302771] [2025-02-05 20:09:20,573 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1176302771] provided 0 perfect and 1 imperfect interpolant sequences [2025-02-05 20:09:20,573 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1804322130] [2025-02-05 20:09:20,573 INFO L95 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST1 [2025-02-05 20:09:20,574 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-02-05 20:09:20,574 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 [2025-02-05 20:09:20,576 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:09:20,578 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:09:20,729 INFO L108 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 partitioned 94 statements into 2 equivalence classes. [2025-02-05 20:09:21,177 INFO L111 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) and asserted 94 of 94 statements. [2025-02-05 20:09:21,177 INFO L114 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) [2025-02-05 20:09:21,177 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-02-05 20:09:21,180 INFO L256 TraceCheckSpWp]: Trace formula consists of 739 conjuncts, 52 conjuncts are in the unsatisfiable core [2025-02-05 20:09:21,185 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-02-05 20:09:21,415 INFO L134 CoverageAnalysis]: Checked inductivity of 99 backedges. 82 proven. 2 refuted. 0 times theorem prover too weak. 15 trivial. 0 not checked. [2025-02-05 20:09:21,415 INFO L312 TraceCheckSpWp]: Computing backward predicates... [2025-02-05 20:09:21,837 INFO L134 CoverageAnalysis]: Checked inductivity of 99 backedges. 72 proven. 12 refuted. 0 times theorem prover too weak. 15 trivial. 0 not checked. [2025-02-05 20:09:21,837 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1804322130] provided 0 perfect and 2 imperfect interpolant sequences [2025-02-05 20:09:21,837 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2025-02-05 20:09:21,837 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [8, 9, 12] total 24 [2025-02-05 20:09:21,837 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [34237815] [2025-02-05 20:09:21,837 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2025-02-05 20:09:21,838 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 24 states [2025-02-05 20:09:21,838 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-02-05 20:09:21,838 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 24 interpolants. [2025-02-05 20:09:21,838 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=114, Invalid=438, Unknown=0, NotChecked=0, Total=552 [2025-02-05 20:09:21,839 INFO L87 Difference]: Start difference. First operand 311 states and 392 transitions. Second operand has 24 states, 24 states have (on average 8.916666666666666) internal successors, (214), 24 states have internal predecessors, (214), 0 states have call successors, (0), 0 states have 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:09:22,262 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-02-05 20:09:22,262 INFO L93 Difference]: Finished difference Result 880 states and 1113 transitions. [2025-02-05 20:09:22,265 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 14 states. [2025-02-05 20:09:22,265 INFO L78 Accepts]: Start accepts. Automaton has has 24 states, 24 states have (on average 8.916666666666666) internal successors, (214), 24 states have internal predecessors, (214), 0 states have call successors, (0), 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 94 [2025-02-05 20:09:22,265 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-02-05 20:09:22,267 INFO L225 Difference]: With dead ends: 880 [2025-02-05 20:09:22,267 INFO L226 Difference]: Without dead ends: 612 [2025-02-05 20:09:22,267 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 200 GetRequests, 172 SyntacticMatches, 0 SemanticMatches, 28 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 196 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=178, Invalid=692, Unknown=0, NotChecked=0, Total=870 [2025-02-05 20:09:22,268 INFO L435 NwaCegarLoop]: 31 mSDtfsCounter, 112 mSDsluCounter, 299 mSDsCounter, 0 mSdLazyCounter, 1119 mSolverCounterSat, 4 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.3s Time, 0 mProtectedPredicate, 0 mProtectedAction, 112 SdHoareTripleChecker+Valid, 330 SdHoareTripleChecker+Invalid, 1123 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 4 IncrementalHoareTripleChecker+Valid, 1119 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.4s IncrementalHoareTripleChecker+Time [2025-02-05 20:09:22,268 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [112 Valid, 330 Invalid, 1123 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [4 Valid, 1119 Invalid, 0 Unknown, 0 Unchecked, 0.4s Time] [2025-02-05 20:09:22,268 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 612 states. [2025-02-05 20:09:22,285 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 612 to 571. [2025-02-05 20:09:22,287 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 571 states, 570 states have (on average 1.2473684210526317) internal successors, (711), 570 states have internal predecessors, (711), 0 states have call successors, (0), 0 states have 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:09:22,288 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 571 states to 571 states and 711 transitions. [2025-02-05 20:09:22,288 INFO L78 Accepts]: Start accepts. Automaton has 571 states and 711 transitions. Word has length 94 [2025-02-05 20:09:22,288 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-02-05 20:09:22,289 INFO L471 AbstractCegarLoop]: Abstraction has 571 states and 711 transitions. [2025-02-05 20:09:22,289 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 24 states, 24 states have (on average 8.916666666666666) internal successors, (214), 24 states have internal predecessors, (214), 0 states have call successors, (0), 0 states have 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:09:22,289 INFO L276 IsEmpty]: Start isEmpty. Operand 571 states and 711 transitions. [2025-02-05 20:09:22,290 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 96 [2025-02-05 20:09:22,290 INFO L210 NwaCegarLoop]: Found error trace [2025-02-05 20:09:22,290 INFO L218 NwaCegarLoop]: trace histogram [4, 4, 4, 4, 4, 4, 4, 4, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 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] [2025-02-05 20:09:22,301 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (6)] Ended with exit code 0 [2025-02-05 20:09:22,490 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,SelfDestructingSolverStorable15 [2025-02-05 20:09:22,490 INFO L396 AbstractCegarLoop]: === Iteration 17 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-02-05 20:09:22,491 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-02-05 20:09:22,491 INFO L85 PathProgramCache]: Analyzing trace with hash -344174333, now seen corresponding path program 3 times [2025-02-05 20:09:22,491 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-02-05 20:09:22,491 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [861504633] [2025-02-05 20:09:22,491 INFO L95 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST2 [2025-02-05 20:09:22,491 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-02-05 20:09:22,515 INFO L108 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST2 partitioned 95 statements into 4 equivalence classes. [2025-02-05 20:09:22,565 INFO L111 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST2 issued 2 check-sat command(s) and asserted 52 of 95 statements. [2025-02-05 20:09:22,565 INFO L114 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST2 issued 2 check-sat command(s) [2025-02-05 20:09:22,565 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-02-05 20:09:23,193 INFO L134 CoverageAnalysis]: Checked inductivity of 100 backedges. 49 proven. 25 refuted. 0 times theorem prover too weak. 26 trivial. 0 not checked. [2025-02-05 20:09:23,194 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-02-05 20:09:23,194 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [861504633] [2025-02-05 20:09:23,194 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [861504633] provided 0 perfect and 1 imperfect interpolant sequences [2025-02-05 20:09:23,194 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [835659566] [2025-02-05 20:09:23,194 INFO L95 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST2 [2025-02-05 20:09:23,194 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-02-05 20:09:23,194 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 [2025-02-05 20:09:23,197 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:09:23,197 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:09:23,354 INFO L108 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST2 partitioned 95 statements into 4 equivalence classes. [2025-02-05 20:09:23,507 INFO L111 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST2 issued 2 check-sat command(s) and asserted 52 of 95 statements. [2025-02-05 20:09:23,507 INFO L114 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST2 issued 2 check-sat command(s) [2025-02-05 20:09:23,507 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-02-05 20:09:23,510 INFO L256 TraceCheckSpWp]: Trace formula consists of 363 conjuncts, 90 conjuncts are in the unsatisfiable core [2025-02-05 20:09:23,516 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-02-05 20:09:24,042 INFO L134 CoverageAnalysis]: Checked inductivity of 100 backedges. 49 proven. 25 refuted. 0 times theorem prover too weak. 26 trivial. 0 not checked. [2025-02-05 20:09:24,042 INFO L312 TraceCheckSpWp]: Computing backward predicates... [2025-02-05 20:09:25,105 INFO L134 CoverageAnalysis]: Checked inductivity of 100 backedges. 37 proven. 37 refuted. 0 times theorem prover too weak. 26 trivial. 0 not checked. [2025-02-05 20:09:25,105 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [835659566] provided 0 perfect and 2 imperfect interpolant sequences [2025-02-05 20:09:25,105 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2025-02-05 20:09:25,105 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [11, 14, 15] total 36 [2025-02-05 20:09:25,105 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [157765979] [2025-02-05 20:09:25,106 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2025-02-05 20:09:25,106 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 36 states [2025-02-05 20:09:25,106 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-02-05 20:09:25,106 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 36 interpolants. [2025-02-05 20:09:25,107 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=165, Invalid=1095, Unknown=0, NotChecked=0, Total=1260 [2025-02-05 20:09:25,107 INFO L87 Difference]: Start difference. First operand 571 states and 711 transitions. Second operand has 36 states, 36 states have (on average 5.777777777777778) internal successors, (208), 36 states have internal predecessors, (208), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-02-05 20:09:26,146 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-02-05 20:09:26,146 INFO L93 Difference]: Finished difference Result 1353 states and 1680 transitions. [2025-02-05 20:09:26,147 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 31 states. [2025-02-05 20:09:26,147 INFO L78 Accepts]: Start accepts. Automaton has has 36 states, 36 states have (on average 5.777777777777778) internal successors, (208), 36 states have internal predecessors, (208), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 95 [2025-02-05 20:09:26,147 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-02-05 20:09:26,149 INFO L225 Difference]: With dead ends: 1353 [2025-02-05 20:09:26,149 INFO L226 Difference]: Without dead ends: 820 [2025-02-05 20:09:26,151 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 226 GetRequests, 167 SyntacticMatches, 0 SemanticMatches, 59 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 998 ImplicationChecksByTransitivity, 0.9s TimeCoverageRelationStatistics Valid=489, Invalid=3171, Unknown=0, NotChecked=0, Total=3660 [2025-02-05 20:09:26,153 INFO L435 NwaCegarLoop]: 20 mSDtfsCounter, 162 mSDsluCounter, 375 mSDsCounter, 0 mSdLazyCounter, 1664 mSolverCounterSat, 21 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.5s Time, 0 mProtectedPredicate, 0 mProtectedAction, 162 SdHoareTripleChecker+Valid, 395 SdHoareTripleChecker+Invalid, 1685 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 21 IncrementalHoareTripleChecker+Valid, 1664 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.6s IncrementalHoareTripleChecker+Time [2025-02-05 20:09:26,153 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [162 Valid, 395 Invalid, 1685 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [21 Valid, 1664 Invalid, 0 Unknown, 0 Unchecked, 0.6s Time] [2025-02-05 20:09:26,154 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 820 states. [2025-02-05 20:09:26,165 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 820 to 657. [2025-02-05 20:09:26,166 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 657 states, 656 states have (on average 1.2469512195121952) internal successors, (818), 656 states have internal predecessors, (818), 0 states have call successors, (0), 0 states have 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:09:26,168 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 657 states to 657 states and 818 transitions. [2025-02-05 20:09:26,169 INFO L78 Accepts]: Start accepts. Automaton has 657 states and 818 transitions. Word has length 95 [2025-02-05 20:09:26,169 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-02-05 20:09:26,169 INFO L471 AbstractCegarLoop]: Abstraction has 657 states and 818 transitions. [2025-02-05 20:09:26,169 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 36 states, 36 states have (on average 5.777777777777778) internal successors, (208), 36 states have internal predecessors, (208), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-02-05 20:09:26,170 INFO L276 IsEmpty]: Start isEmpty. Operand 657 states and 818 transitions. [2025-02-05 20:09:26,171 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 96 [2025-02-05 20:09:26,171 INFO L210 NwaCegarLoop]: Found error trace [2025-02-05 20:09:26,171 INFO L218 NwaCegarLoop]: trace histogram [4, 4, 4, 4, 4, 4, 4, 4, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 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] [2025-02-05 20:09:26,180 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:09:26,371 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,SelfDestructingSolverStorable16 [2025-02-05 20:09:26,372 INFO L396 AbstractCegarLoop]: === Iteration 18 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-02-05 20:09:26,372 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-02-05 20:09:26,372 INFO L85 PathProgramCache]: Analyzing trace with hash 542203556, now seen corresponding path program 2 times [2025-02-05 20:09:26,372 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-02-05 20:09:26,372 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1310297417] [2025-02-05 20:09:26,372 INFO L95 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST1 [2025-02-05 20:09:26,372 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-02-05 20:09:26,392 INFO L108 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 partitioned 95 statements into 2 equivalence classes. [2025-02-05 20:09:26,482 INFO L111 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) and asserted 95 of 95 statements. [2025-02-05 20:09:26,483 INFO L114 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) [2025-02-05 20:09:26,483 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-02-05 20:09:26,770 INFO L134 CoverageAnalysis]: Checked inductivity of 101 backedges. 83 proven. 4 refuted. 0 times theorem prover too weak. 14 trivial. 0 not checked. [2025-02-05 20:09:26,770 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-02-05 20:09:26,770 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1310297417] [2025-02-05 20:09:26,770 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1310297417] provided 0 perfect and 1 imperfect interpolant sequences [2025-02-05 20:09:26,770 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1262009720] [2025-02-05 20:09:26,770 INFO L95 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST1 [2025-02-05 20:09:26,771 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-02-05 20:09:26,771 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 [2025-02-05 20:09:26,773 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:09:26,775 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:09:26,955 INFO L108 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 partitioned 95 statements into 2 equivalence classes. [2025-02-05 20:09:27,284 INFO L111 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) and asserted 95 of 95 statements. [2025-02-05 20:09:27,284 INFO L114 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) [2025-02-05 20:09:27,284 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-02-05 20:09:27,288 INFO L256 TraceCheckSpWp]: Trace formula consists of 744 conjuncts, 68 conjuncts are in the unsatisfiable core [2025-02-05 20:09:27,292 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-02-05 20:09:27,603 INFO L134 CoverageAnalysis]: Checked inductivity of 101 backedges. 81 proven. 6 refuted. 0 times theorem prover too weak. 14 trivial. 0 not checked. [2025-02-05 20:09:27,604 INFO L312 TraceCheckSpWp]: Computing backward predicates... [2025-02-05 20:09:27,860 INFO L134 CoverageAnalysis]: Checked inductivity of 101 backedges. 81 proven. 8 refuted. 0 times theorem prover too weak. 12 trivial. 0 not checked. [2025-02-05 20:09:27,860 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1262009720] provided 0 perfect and 2 imperfect interpolant sequences [2025-02-05 20:09:27,860 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2025-02-05 20:09:27,860 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [8, 10, 10] total 24 [2025-02-05 20:09:27,860 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1900891293] [2025-02-05 20:09:27,860 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2025-02-05 20:09:27,861 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 24 states [2025-02-05 20:09:27,861 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-02-05 20:09:27,861 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 24 interpolants. [2025-02-05 20:09:27,862 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=91, Invalid=461, Unknown=0, NotChecked=0, Total=552 [2025-02-05 20:09:27,862 INFO L87 Difference]: Start difference. First operand 657 states and 818 transitions. Second operand has 24 states, 24 states have (on average 9.291666666666666) internal successors, (223), 24 states have internal predecessors, (223), 0 states have call successors, (0), 0 states have 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:09:28,398 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-02-05 20:09:28,399 INFO L93 Difference]: Finished difference Result 1557 states and 1965 transitions. [2025-02-05 20:09:28,399 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 21 states. [2025-02-05 20:09:28,399 INFO L78 Accepts]: Start accepts. Automaton has has 24 states, 24 states have (on average 9.291666666666666) internal successors, (223), 24 states have internal predecessors, (223), 0 states have call successors, (0), 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 95 [2025-02-05 20:09:28,399 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-02-05 20:09:28,402 INFO L225 Difference]: With dead ends: 1557 [2025-02-05 20:09:28,402 INFO L226 Difference]: Without dead ends: 942 [2025-02-05 20:09:28,403 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 210 GetRequests, 177 SyntacticMatches, 0 SemanticMatches, 33 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 243 ImplicationChecksByTransitivity, 0.3s TimeCoverageRelationStatistics Valid=182, Invalid=1008, Unknown=0, NotChecked=0, Total=1190 [2025-02-05 20:09:28,403 INFO L435 NwaCegarLoop]: 22 mSDtfsCounter, 174 mSDsluCounter, 218 mSDsCounter, 0 mSdLazyCounter, 1164 mSolverCounterSat, 4 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.3s Time, 0 mProtectedPredicate, 0 mProtectedAction, 174 SdHoareTripleChecker+Valid, 240 SdHoareTripleChecker+Invalid, 1168 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 4 IncrementalHoareTripleChecker+Valid, 1164 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.4s IncrementalHoareTripleChecker+Time [2025-02-05 20:09:28,403 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [174 Valid, 240 Invalid, 1168 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [4 Valid, 1164 Invalid, 0 Unknown, 0 Unchecked, 0.4s Time] [2025-02-05 20:09:28,404 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 942 states. [2025-02-05 20:09:28,416 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 942 to 869. [2025-02-05 20:09:28,417 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 869 states, 868 states have (on average 1.25) internal successors, (1085), 868 states have internal predecessors, (1085), 0 states have call successors, (0), 0 states have 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:09:28,419 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 869 states to 869 states and 1085 transitions. [2025-02-05 20:09:28,419 INFO L78 Accepts]: Start accepts. Automaton has 869 states and 1085 transitions. Word has length 95 [2025-02-05 20:09:28,419 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-02-05 20:09:28,419 INFO L471 AbstractCegarLoop]: Abstraction has 869 states and 1085 transitions. [2025-02-05 20:09:28,420 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 24 states, 24 states have (on average 9.291666666666666) internal successors, (223), 24 states have internal predecessors, (223), 0 states have call successors, (0), 0 states have 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:09:28,420 INFO L276 IsEmpty]: Start isEmpty. Operand 869 states and 1085 transitions. [2025-02-05 20:09:28,421 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 96 [2025-02-05 20:09:28,421 INFO L210 NwaCegarLoop]: Found error trace [2025-02-05 20:09:28,421 INFO L218 NwaCegarLoop]: trace histogram [4, 4, 4, 4, 4, 4, 4, 4, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 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] [2025-02-05 20:09:28,429 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (8)] Ended with exit code 0 [2025-02-05 20:09:28,625 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable17,8 /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-02-05 20:09:28,625 INFO L396 AbstractCegarLoop]: === Iteration 19 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-02-05 20:09:28,625 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-02-05 20:09:28,625 INFO L85 PathProgramCache]: Analyzing trace with hash -1450279155, now seen corresponding path program 4 times [2025-02-05 20:09:28,625 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-02-05 20:09:28,625 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2122618925] [2025-02-05 20:09:28,625 INFO L95 rtionOrderModulation]: Changing assertion order to TERMS_WITH_SMALL_CONSTANTS_FIRST [2025-02-05 20:09:28,625 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-02-05 20:09:28,645 INFO L108 AnnotateAndAsserter]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST partitioned 95 statements into 2 equivalence classes. [2025-02-05 20:09:28,781 INFO L111 AnnotateAndAsserter]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST issued 2 check-sat command(s) and asserted 95 of 95 statements. [2025-02-05 20:09:28,782 INFO L114 AnnotateAndAsserter]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST issued 2 check-sat command(s) [2025-02-05 20:09:28,782 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-02-05 20:09:29,169 INFO L134 CoverageAnalysis]: Checked inductivity of 100 backedges. 78 proven. 4 refuted. 0 times theorem prover too weak. 18 trivial. 0 not checked. [2025-02-05 20:09:29,169 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-02-05 20:09:29,169 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2122618925] [2025-02-05 20:09:29,169 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [2122618925] provided 0 perfect and 1 imperfect interpolant sequences [2025-02-05 20:09:29,169 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [207845727] [2025-02-05 20:09:29,169 INFO L95 rtionOrderModulation]: Changing assertion order to TERMS_WITH_SMALL_CONSTANTS_FIRST [2025-02-05 20:09:29,169 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-02-05 20:09:29,170 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 [2025-02-05 20:09:29,171 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:09:29,173 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:09:29,359 INFO L108 AnnotateAndAsserter]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST partitioned 95 statements into 2 equivalence classes. [2025-02-05 20:09:29,452 INFO L111 AnnotateAndAsserter]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST issued 2 check-sat command(s) and asserted 95 of 95 statements. [2025-02-05 20:09:29,452 INFO L114 AnnotateAndAsserter]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST issued 2 check-sat command(s) [2025-02-05 20:09:29,452 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-02-05 20:09:29,458 INFO L256 TraceCheckSpWp]: Trace formula consists of 742 conjuncts, 43 conjuncts are in the unsatisfiable core [2025-02-05 20:09:29,461 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-02-05 20:09:29,644 INFO L134 CoverageAnalysis]: Checked inductivity of 100 backedges. 80 proven. 2 refuted. 0 times theorem prover too weak. 18 trivial. 0 not checked. [2025-02-05 20:09:29,644 INFO L312 TraceCheckSpWp]: Computing backward predicates... [2025-02-05 20:09:29,926 INFO L134 CoverageAnalysis]: Checked inductivity of 100 backedges. 66 proven. 16 refuted. 0 times theorem prover too weak. 18 trivial. 0 not checked. [2025-02-05 20:09:29,926 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [207845727] provided 0 perfect and 2 imperfect interpolant sequences [2025-02-05 20:09:29,926 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2025-02-05 20:09:29,926 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [9, 7, 8] total 20 [2025-02-05 20:09:29,926 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [818523906] [2025-02-05 20:09:29,926 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2025-02-05 20:09:29,926 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 20 states [2025-02-05 20:09:29,927 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-02-05 20:09:29,927 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 20 interpolants. [2025-02-05 20:09:29,927 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=82, Invalid=298, Unknown=0, NotChecked=0, Total=380 [2025-02-05 20:09:29,927 INFO L87 Difference]: Start difference. First operand 869 states and 1085 transitions. Second operand has 20 states, 20 states have (on average 8.95) internal successors, (179), 20 states have internal predecessors, (179), 0 states have call successors, (0), 0 states have 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:09:30,230 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-02-05 20:09:30,230 INFO L93 Difference]: Finished difference Result 1627 states and 2020 transitions. [2025-02-05 20:09:30,231 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2025-02-05 20:09:30,231 INFO L78 Accepts]: Start accepts. Automaton has has 20 states, 20 states have (on average 8.95) internal successors, (179), 20 states have internal predecessors, (179), 0 states have call successors, (0), 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 95 [2025-02-05 20:09:30,231 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-02-05 20:09:30,233 INFO L225 Difference]: With dead ends: 1627 [2025-02-05 20:09:30,233 INFO L226 Difference]: Without dead ends: 798 [2025-02-05 20:09:30,234 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 202 GetRequests, 181 SyntacticMatches, 0 SemanticMatches, 21 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 119 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=110, Invalid=396, Unknown=0, NotChecked=0, Total=506 [2025-02-05 20:09:30,234 INFO L435 NwaCegarLoop]: 29 mSDtfsCounter, 152 mSDsluCounter, 263 mSDsCounter, 0 mSdLazyCounter, 786 mSolverCounterSat, 1 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 152 SdHoareTripleChecker+Valid, 292 SdHoareTripleChecker+Invalid, 787 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 1 IncrementalHoareTripleChecker+Valid, 786 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.3s IncrementalHoareTripleChecker+Time [2025-02-05 20:09:30,234 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [152 Valid, 292 Invalid, 787 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [1 Valid, 786 Invalid, 0 Unknown, 0 Unchecked, 0.3s Time] [2025-02-05 20:09:30,235 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 798 states. [2025-02-05 20:09:30,245 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 798 to 728. [2025-02-05 20:09:30,246 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 728 states, 727 states have (on average 1.2269601100412655) internal successors, (892), 727 states have internal predecessors, (892), 0 states have call successors, (0), 0 states have 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:09:30,247 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 728 states to 728 states and 892 transitions. [2025-02-05 20:09:30,247 INFO L78 Accepts]: Start accepts. Automaton has 728 states and 892 transitions. Word has length 95 [2025-02-05 20:09:30,248 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-02-05 20:09:30,248 INFO L471 AbstractCegarLoop]: Abstraction has 728 states and 892 transitions. [2025-02-05 20:09:30,248 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 20 states, 20 states have (on average 8.95) internal successors, (179), 20 states have internal predecessors, (179), 0 states have call successors, (0), 0 states have 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:09:30,248 INFO L276 IsEmpty]: Start isEmpty. Operand 728 states and 892 transitions. [2025-02-05 20:09:30,249 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 97 [2025-02-05 20:09:30,249 INFO L210 NwaCegarLoop]: Found error trace [2025-02-05 20:09:30,249 INFO L218 NwaCegarLoop]: trace histogram [4, 4, 4, 4, 4, 4, 4, 4, 3, 3, 3, 3, 3, 3, 3, 3, 3, 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] [2025-02-05 20:09:30,258 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:09:30,452 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable18,9 /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-02-05 20:09:30,453 INFO L396 AbstractCegarLoop]: === Iteration 20 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-02-05 20:09:30,453 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-02-05 20:09:30,453 INFO L85 PathProgramCache]: Analyzing trace with hash -331286243, now seen corresponding path program 1 times [2025-02-05 20:09:30,453 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-02-05 20:09:30,453 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1219754511] [2025-02-05 20:09:30,453 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-02-05 20:09:30,453 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-02-05 20:09:30,481 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 96 statements into 1 equivalence classes. [2025-02-05 20:09:30,548 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 96 of 96 statements. [2025-02-05 20:09:30,548 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-02-05 20:09:30,548 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-02-05 20:09:30,836 INFO L134 CoverageAnalysis]: Checked inductivity of 100 backedges. 81 proven. 4 refuted. 0 times theorem prover too weak. 15 trivial. 0 not checked. [2025-02-05 20:09:30,836 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-02-05 20:09:30,836 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1219754511] [2025-02-05 20:09:30,836 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1219754511] provided 0 perfect and 1 imperfect interpolant sequences [2025-02-05 20:09:30,836 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [368224750] [2025-02-05 20:09:30,836 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-02-05 20:09:30,836 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-02-05 20:09:30,836 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 [2025-02-05 20:09:30,838 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:09:30,840 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:09:31,034 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 96 statements into 1 equivalence classes. [2025-02-05 20:09:31,172 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 96 of 96 statements. [2025-02-05 20:09:31,172 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-02-05 20:09:31,172 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-02-05 20:09:31,175 INFO L256 TraceCheckSpWp]: Trace formula consists of 745 conjuncts, 24 conjuncts are in the unsatisfiable core [2025-02-05 20:09:31,177 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-02-05 20:09:31,380 INFO L134 CoverageAnalysis]: Checked inductivity of 100 backedges. 70 proven. 11 refuted. 0 times theorem prover too weak. 19 trivial. 0 not checked. [2025-02-05 20:09:31,380 INFO L312 TraceCheckSpWp]: Computing backward predicates... [2025-02-05 20:09:31,490 INFO L134 CoverageAnalysis]: Checked inductivity of 100 backedges. 71 proven. 25 refuted. 0 times theorem prover too weak. 4 trivial. 0 not checked. [2025-02-05 20:09:31,490 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [368224750] provided 0 perfect and 2 imperfect interpolant sequences [2025-02-05 20:09:31,490 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2025-02-05 20:09:31,490 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [8, 8, 7] total 19 [2025-02-05 20:09:31,491 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1438668002] [2025-02-05 20:09:31,491 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2025-02-05 20:09:31,491 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 19 states [2025-02-05 20:09:31,491 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-02-05 20:09:31,491 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 19 interpolants. [2025-02-05 20:09:31,491 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=80, Invalid=262, Unknown=0, NotChecked=0, Total=342 [2025-02-05 20:09:31,492 INFO L87 Difference]: Start difference. First operand 728 states and 892 transitions. Second operand has 19 states, 19 states have (on average 11.263157894736842) internal successors, (214), 19 states have internal predecessors, (214), 0 states have call successors, (0), 0 states have 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:09:31,783 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-02-05 20:09:31,783 INFO L93 Difference]: Finished difference Result 1029 states and 1259 transitions. [2025-02-05 20:09:31,783 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 13 states. [2025-02-05 20:09:31,784 INFO L78 Accepts]: Start accepts. Automaton has has 19 states, 19 states have (on average 11.263157894736842) internal successors, (214), 19 states have internal predecessors, (214), 0 states have call successors, (0), 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 96 [2025-02-05 20:09:31,784 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-02-05 20:09:31,784 INFO L225 Difference]: With dead ends: 1029 [2025-02-05 20:09:31,784 INFO L226 Difference]: Without dead ends: 343 [2025-02-05 20:09:31,785 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 208 GetRequests, 184 SyntacticMatches, 0 SemanticMatches, 24 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 125 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=149, Invalid=501, Unknown=0, NotChecked=0, Total=650 [2025-02-05 20:09:31,785 INFO L435 NwaCegarLoop]: 35 mSDtfsCounter, 148 mSDsluCounter, 233 mSDsCounter, 0 mSdLazyCounter, 666 mSolverCounterSat, 1 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 148 SdHoareTripleChecker+Valid, 268 SdHoareTripleChecker+Invalid, 667 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 1 IncrementalHoareTripleChecker+Valid, 666 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.2s IncrementalHoareTripleChecker+Time [2025-02-05 20:09:31,786 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [148 Valid, 268 Invalid, 667 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [1 Valid, 666 Invalid, 0 Unknown, 0 Unchecked, 0.2s Time] [2025-02-05 20:09:31,786 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 343 states. [2025-02-05 20:09:31,790 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 343 to 254. [2025-02-05 20:09:31,790 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 254 states, 253 states have (on average 1.2015810276679841) internal successors, (304), 253 states have internal predecessors, (304), 0 states have call successors, (0), 0 states have 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:09:31,791 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 254 states to 254 states and 304 transitions. [2025-02-05 20:09:31,791 INFO L78 Accepts]: Start accepts. Automaton has 254 states and 304 transitions. Word has length 96 [2025-02-05 20:09:31,791 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-02-05 20:09:31,791 INFO L471 AbstractCegarLoop]: Abstraction has 254 states and 304 transitions. [2025-02-05 20:09:31,791 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 19 states, 19 states have (on average 11.263157894736842) internal successors, (214), 19 states have internal predecessors, (214), 0 states have call successors, (0), 0 states have 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:09:31,791 INFO L276 IsEmpty]: Start isEmpty. Operand 254 states and 304 transitions. [2025-02-05 20:09:31,792 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 116 [2025-02-05 20:09:31,792 INFO L210 NwaCegarLoop]: Found error trace [2025-02-05 20:09:31,792 INFO L218 NwaCegarLoop]: trace histogram [5, 5, 5, 5, 5, 5, 5, 5, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 3, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-02-05 20:09:31,800 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (10)] Ended with exit code 0 [2025-02-05 20:09:31,992 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable19,10 /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-02-05 20:09:31,994 INFO L396 AbstractCegarLoop]: === Iteration 21 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-02-05 20:09:31,994 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-02-05 20:09:31,994 INFO L85 PathProgramCache]: Analyzing trace with hash 1891343285, now seen corresponding path program 5 times [2025-02-05 20:09:31,995 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-02-05 20:09:31,995 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [917976948] [2025-02-05 20:09:31,995 INFO L95 rtionOrderModulation]: Changing assertion order to INSIDE_LOOP_FIRST1 [2025-02-05 20:09:31,995 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-02-05 20:09:32,022 INFO L108 AnnotateAndAsserter]: Assert order INSIDE_LOOP_FIRST1 partitioned 115 statements into 5 equivalence classes. [2025-02-05 20:09:32,571 INFO L111 AnnotateAndAsserter]: Assert order INSIDE_LOOP_FIRST1 issued 3 check-sat command(s) and asserted 64 of 115 statements. [2025-02-05 20:09:32,571 INFO L114 AnnotateAndAsserter]: Assert order INSIDE_LOOP_FIRST1 issued 3 check-sat command(s) [2025-02-05 20:09:32,571 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-02-05 20:09:33,881 INFO L134 CoverageAnalysis]: Checked inductivity of 173 backedges. 131 proven. 26 refuted. 0 times theorem prover too weak. 16 trivial. 0 not checked. [2025-02-05 20:09:33,881 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-02-05 20:09:33,881 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [917976948] [2025-02-05 20:09:33,881 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [917976948] provided 0 perfect and 1 imperfect interpolant sequences [2025-02-05 20:09:33,881 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [455144547] [2025-02-05 20:09:33,881 INFO L95 rtionOrderModulation]: Changing assertion order to INSIDE_LOOP_FIRST1 [2025-02-05 20:09:33,882 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-02-05 20:09:33,882 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 [2025-02-05 20:09:33,885 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:09:33,886 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:09:34,098 INFO L108 AnnotateAndAsserter]: Assert order INSIDE_LOOP_FIRST1 partitioned 115 statements into 5 equivalence classes. [2025-02-05 20:09:34,236 INFO L111 AnnotateAndAsserter]: Assert order INSIDE_LOOP_FIRST1 issued 3 check-sat command(s) and asserted 64 of 115 statements. [2025-02-05 20:09:34,236 INFO L114 AnnotateAndAsserter]: Assert order INSIDE_LOOP_FIRST1 issued 3 check-sat command(s) [2025-02-05 20:09:34,236 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-02-05 20:09:34,240 INFO L256 TraceCheckSpWp]: Trace formula consists of 570 conjuncts, 119 conjuncts are in the unsatisfiable core [2025-02-05 20:09:34,244 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-02-05 20:09:34,604 INFO L134 CoverageAnalysis]: Checked inductivity of 173 backedges. 126 proven. 30 refuted. 0 times theorem prover too weak. 17 trivial. 0 not checked. [2025-02-05 20:09:34,604 INFO L312 TraceCheckSpWp]: Computing backward predicates... [2025-02-05 20:09:35,131 INFO L134 CoverageAnalysis]: Checked inductivity of 173 backedges. 155 proven. 2 refuted. 0 times theorem prover too weak. 16 trivial. 0 not checked. [2025-02-05 20:09:35,131 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [455144547] provided 0 perfect and 2 imperfect interpolant sequences [2025-02-05 20:09:35,131 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2025-02-05 20:09:35,131 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [15, 19, 14] total 36 [2025-02-05 20:09:35,131 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [865904359] [2025-02-05 20:09:35,131 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2025-02-05 20:09:35,132 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 36 states [2025-02-05 20:09:35,132 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-02-05 20:09:35,132 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 36 interpolants. [2025-02-05 20:09:35,132 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=195, Invalid=1065, Unknown=0, NotChecked=0, Total=1260 [2025-02-05 20:09:35,132 INFO L87 Difference]: Start difference. First operand 254 states and 304 transitions. Second operand has 36 states, 36 states have (on average 4.944444444444445) internal successors, (178), 36 states have internal predecessors, (178), 0 states have call successors, (0), 0 states have 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:09:35,961 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-02-05 20:09:35,961 INFO L93 Difference]: Finished difference Result 295 states and 347 transitions. [2025-02-05 20:09:35,962 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 29 states. [2025-02-05 20:09:35,962 INFO L78 Accepts]: Start accepts. Automaton has has 36 states, 36 states have (on average 4.944444444444445) internal successors, (178), 36 states have internal predecessors, (178), 0 states have call successors, (0), 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 115 [2025-02-05 20:09:35,962 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-02-05 20:09:35,962 INFO L225 Difference]: With dead ends: 295 [2025-02-05 20:09:35,962 INFO L226 Difference]: Without dead ends: 0 [2025-02-05 20:09:35,963 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 278 GetRequests, 214 SyntacticMatches, 3 SemanticMatches, 61 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 927 ImplicationChecksByTransitivity, 0.9s TimeCoverageRelationStatistics Valid=667, Invalid=3239, Unknown=0, NotChecked=0, Total=3906 [2025-02-05 20:09:35,964 INFO L435 NwaCegarLoop]: 20 mSDtfsCounter, 124 mSDsluCounter, 366 mSDsCounter, 0 mSdLazyCounter, 1145 mSolverCounterSat, 9 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.3s Time, 0 mProtectedPredicate, 0 mProtectedAction, 124 SdHoareTripleChecker+Valid, 386 SdHoareTripleChecker+Invalid, 1154 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 9 IncrementalHoareTripleChecker+Valid, 1145 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.3s IncrementalHoareTripleChecker+Time [2025-02-05 20:09:35,964 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [124 Valid, 386 Invalid, 1154 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [9 Valid, 1145 Invalid, 0 Unknown, 0 Unchecked, 0.3s Time] [2025-02-05 20:09:35,964 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 0 states. [2025-02-05 20:09:35,964 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 0 to 0. [2025-02-05 20:09:35,964 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 0 states, 0 states have (on average 0.0) internal successors, (0), 0 states have internal predecessors, (0), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-02-05 20:09:35,964 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 0 states to 0 states and 0 transitions. [2025-02-05 20:09:35,964 INFO L78 Accepts]: Start accepts. Automaton has 0 states and 0 transitions. Word has length 115 [2025-02-05 20:09:35,964 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-02-05 20:09:35,964 INFO L471 AbstractCegarLoop]: Abstraction has 0 states and 0 transitions. [2025-02-05 20:09:35,964 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 36 states, 36 states have (on average 4.944444444444445) internal successors, (178), 36 states have internal predecessors, (178), 0 states have call successors, (0), 0 states have 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:09:35,964 INFO L276 IsEmpty]: Start isEmpty. Operand 0 states and 0 transitions. [2025-02-05 20:09:35,965 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2025-02-05 20:09:35,967 INFO L782 garLoopResultBuilder]: Registering result SAFE for location ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION (0 of 1 remaining) [2025-02-05 20:09:35,975 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (11)] Ended with exit code 0 [2025-02-05 20:09:36,168 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable20,11 /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-02-05 20:09:36,170 INFO L422 BasicCegarLoop]: Path program histogram: [5, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-02-05 20:09:36,171 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends 0 states and 0 transitions. [2025-02-05 20:09:36,208 INFO L170 ceAbstractionStarter]: Computing trace abstraction results [2025-02-05 20:09:36,216 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction CFG 05.02 08:09:36 BoogieIcfgContainer [2025-02-05 20:09:36,216 INFO L131 PluginConnector]: ------------------------ END TraceAbstraction---------------------------- [2025-02-05 20:09:36,216 INFO L112 PluginConnector]: ------------------------Witness Printer---------------------------- [2025-02-05 20:09:36,217 INFO L270 PluginConnector]: Initializing Witness Printer... [2025-02-05 20:09:36,217 INFO L274 PluginConnector]: Witness Printer initialized [2025-02-05 20:09:36,217 INFO L184 PluginConnector]: Executing the observer RCFGCatcher from plugin Witness Printer for "de.uni_freiburg.informatik.ultimate.plugins.generator.icfgbuilder CFG 05.02 08:09:01" (3/4) ... [2025-02-05 20:09:36,218 INFO L146 WitnessPrinter]: Generating witness for correct program [2025-02-05 20:09:36,228 INFO L919 BoogieBacktranslator]: Reduced CFG by removing 10 nodes and edges [2025-02-05 20:09:36,229 INFO L919 BoogieBacktranslator]: Reduced CFG by removing 4 nodes and edges [2025-02-05 20:09:36,229 INFO L919 BoogieBacktranslator]: Reduced CFG by removing 3 nodes and edges [2025-02-05 20:09:36,230 INFO L919 BoogieBacktranslator]: Reduced CFG by removing 1 nodes and edges [2025-02-05 20:09:36,307 INFO L149 WitnessManager]: Wrote witness to /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/witness.graphml [2025-02-05 20:09:36,308 INFO L149 WitnessManager]: Wrote witness to /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/witness.yml [2025-02-05 20:09:36,308 INFO L131 PluginConnector]: ------------------------ END Witness Printer---------------------------- [2025-02-05 20:09:36,308 INFO L158 Benchmark]: Toolchain (without parser) took 35303.09ms. Allocated memory was 142.6MB in the beginning and 847.2MB in the end (delta: 704.6MB). Free memory was 105.7MB in the beginning and 420.8MB in the end (delta: -315.1MB). Peak memory consumption was 385.1MB. Max. memory is 16.1GB. [2025-02-05 20:09:36,308 INFO L158 Benchmark]: CDTParser took 0.26ms. Allocated memory is still 201.3MB. Free memory is still 126.2MB. There was no memory consumed. Max. memory is 16.1GB. [2025-02-05 20:09:36,309 INFO L158 Benchmark]: CACSL2BoogieTranslator took 245.85ms. Allocated memory is still 142.6MB. Free memory was 105.7MB in the beginning and 91.1MB in the end (delta: 14.6MB). Peak memory consumption was 16.8MB. Max. memory is 16.1GB. [2025-02-05 20:09:36,309 INFO L158 Benchmark]: Boogie Procedure Inliner took 55.88ms. Allocated memory is still 142.6MB. Free memory was 91.1MB in the beginning and 85.0MB in the end (delta: 6.1MB). There was no memory consumed. Max. memory is 16.1GB. [2025-02-05 20:09:36,311 INFO L158 Benchmark]: Boogie Preprocessor took 68.35ms. Allocated memory is still 142.6MB. Free memory was 85.0MB in the beginning and 81.8MB in the end (delta: 3.2MB). Peak memory consumption was 8.4MB. Max. memory is 16.1GB. [2025-02-05 20:09:36,312 INFO L158 Benchmark]: IcfgBuilder took 450.54ms. Allocated memory is still 142.6MB. Free memory was 81.8MB in the beginning and 44.8MB in the end (delta: 37.1MB). Peak memory consumption was 33.6MB. Max. memory is 16.1GB. [2025-02-05 20:09:36,312 INFO L158 Benchmark]: TraceAbstraction took 34386.05ms. Allocated memory was 142.6MB in the beginning and 847.2MB in the end (delta: 704.6MB). Free memory was 43.9MB in the beginning and 429.2MB in the end (delta: -385.3MB). Peak memory consumption was 318.0MB. Max. memory is 16.1GB. [2025-02-05 20:09:36,312 INFO L158 Benchmark]: Witness Printer took 91.14ms. Allocated memory is still 847.2MB. Free memory was 429.2MB in the beginning and 420.8MB in the end (delta: 8.4MB). Peak memory consumption was 8.4MB. Max. memory is 16.1GB. [2025-02-05 20:09:36,313 INFO L338 ainManager$Toolchain]: ####################### End [Toolchain 1] ####################### --- Results --- * Results from de.uni_freiburg.informatik.ultimate.core: - StatisticsResult: Toolchain Benchmarks Benchmark results are: * CDTParser took 0.26ms. Allocated memory is still 201.3MB. Free memory is still 126.2MB. There was no memory consumed. Max. memory is 16.1GB. * CACSL2BoogieTranslator took 245.85ms. Allocated memory is still 142.6MB. Free memory was 105.7MB in the beginning and 91.1MB in the end (delta: 14.6MB). Peak memory consumption was 16.8MB. Max. memory is 16.1GB. * Boogie Procedure Inliner took 55.88ms. Allocated memory is still 142.6MB. Free memory was 91.1MB in the beginning and 85.0MB in the end (delta: 6.1MB). There was no memory consumed. Max. memory is 16.1GB. * Boogie Preprocessor took 68.35ms. Allocated memory is still 142.6MB. Free memory was 85.0MB in the beginning and 81.8MB in the end (delta: 3.2MB). Peak memory consumption was 8.4MB. Max. memory is 16.1GB. * IcfgBuilder took 450.54ms. Allocated memory is still 142.6MB. Free memory was 81.8MB in the beginning and 44.8MB in the end (delta: 37.1MB). Peak memory consumption was 33.6MB. Max. memory is 16.1GB. * TraceAbstraction took 34386.05ms. Allocated memory was 142.6MB in the beginning and 847.2MB in the end (delta: 704.6MB). Free memory was 43.9MB in the beginning and 429.2MB in the end (delta: -385.3MB). Peak memory consumption was 318.0MB. Max. memory is 16.1GB. * Witness Printer took 91.14ms. Allocated memory is still 847.2MB. Free memory was 429.2MB in the beginning and 420.8MB in the end (delta: 8.4MB). Peak memory consumption was 8.4MB. Max. memory is 16.1GB. * Results from de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction: - StatisticsResult: ErrorAutomatonStatistics NumberErrorTraces: 0, NumberStatementsAllTraces: 0, NumberRelevantStatements: 0, 0.0s ErrorAutomatonConstructionTimeTotal, 0.0s FaulLocalizationTime, NumberStatementsFirstTrace: -1, TraceLengthAvg: 0, 0.0s ErrorAutomatonConstructionTimeAvg, 0.0s ErrorAutomatonDifferenceTimeAvg, 0.0s ErrorAutomatonDifferenceTimeTotal, NumberOfNoEnhancement: 0, NumberOfFiniteEnhancement: 0, NumberOfInfiniteEnhancement: 0 - PositiveResult [Line: 21]: a call to reach_error is unreachable For all program executions holds that a call to reach_error is unreachable at this location - StatisticsResult: Ultimate Automizer benchmark data CFG has 1 procedures, 62 locations, 1 error locations. Started 1 CEGAR loops. OverallTime: 34.3s, OverallIterations: 21, TraceHistogramMax: 5, PathProgramHistogramMax: 5, EmptinessCheckTime: 0.0s, AutomataDifference: 9.7s, DeadEndRemovalTime: 0.0s, HoareAnnotationTime: 0.0s, InitialAbstractionConstructionTime: 0.0s, HoareTripleCheckerStatistics: 0 mSolverCounterUnknown, 3023 SdHoareTripleChecker+Valid, 5.6s IncrementalHoareTripleChecker+Time, 0 mSdLazyCounter, 3023 mSDsluCounter, 5929 SdHoareTripleChecker+Invalid, 4.7s Time, 0 mProtectedAction, 0 SdHoareTripleChecker+Unchecked, 0 IncrementalHoareTripleChecker+Unchecked, 5009 mSDsCounter, 112 IncrementalHoareTripleChecker+Valid, 0 mProtectedPredicate, 13419 IncrementalHoareTripleChecker+Invalid, 13531 SdHoareTripleChecker+Unknown, 0 mSolverCounterNotChecked, 112 mSolverCounterUnsat, 920 mSDtfsCounter, 13419 mSolverCounterSat, 0.1s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Unknown, PredicateUnifierStatistics: 0 DeclaredPredicates, 2077 GetRequests, 1565 SyntacticMatches, 5 SemanticMatches, 507 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 7900 ImplicationChecksByTransitivity, 7.0s Time, 0.0s BasicInterpolantAutomatonTime, BiggestAbstraction: size=869occurred in iteration=18, InterpolantAutomatonStates: 319, traceCheckStatistics: No data available, InterpolantConsolidationStatistics: No data available, PathInvariantsStatistics: No data available, 0/0 InterpolantCoveringCapability, TotalInterpolationStatistics: No data available, 0.0s DumpTime, AutomataMinimizationStatistics: 0.2s AutomataMinimizationTime, 21 MinimizatonAttempts, 1119 StatesRemovedByMinimization, 14 NontrivialMinimizations, HoareAnnotationStatistics: No data available, RefinementEngineStatistics: TRACE_CHECK: 0.4s SsaConstructionTime, 3.3s SatisfiabilityAnalysisTime, 17.1s InterpolantComputationTime, 2118 NumberOfCodeBlocks, 1930 NumberOfCodeBlocksAsserted, 43 NumberOfCheckSat, 2913 ConstructedInterpolants, 0 QuantifiedInterpolants, 22602 SizeOfPredicates, 46 NumberOfNonLiveVariables, 5725 ConjunctsInSsa, 658 ConjunctsInUnsatCore, 41 InterpolantComputations, 11 PerfectInterpolantSequences, 2131/2512 InterpolantCoveringCapability, INVARIANT_SYNTHESIS: No data available, INTERPOLANT_CONSOLIDATION: No data available, ABSTRACT_INTERPRETATION: No data available, PDR: No data available, ACCELERATED_INTERPOLATION: No data available, SIFA: No data available, ReuseStatistics: No data available, ConComCheckerStatistics: No data available - AllSpecificationsHoldResult: All specifications hold 1 specifications checked. All of them hold - InvariantResult [Line: 87]: Location Invariant Derived location invariant: ((((((((((state_26 == 1) && (var_12 == 1)) && (state_28 == 0)) && (state_8 == 0)) && (state_58 == 0)) && (state_15 == 0)) && (var_22 == 1)) && (mask_SORT_1 == 1)) && (var_7 == 0)) || (((((((((var_12 == 1) && (state_28 == 0)) && (state_26 == 0)) && (state_8 == 0)) && (state_58 == 0)) && (state_15 == 0)) && (var_22 == 1)) && (mask_SORT_1 == 1)) && (var_7 == 0))) RESULT: Ultimate proved your program to be correct! [2025-02-05 20:09:36,328 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 (1)] Ended with exit code 0 Received shutdown request... --- End real Ultimate output --- Execution finished normally Writing output log to file Ultimate.log Result: TRUE