./Ultimate.py --spec ../sv-benchmarks/c/properties/unreach-call.prp --file ../sv-benchmarks/c/hardware-verification-bv/btor2c-lazyMod.vcegar_QF_BV_itc99_b13_p01.c --full-output --architecture 64bit -------------------------------------------------------------------------------- Checking for ERROR reachability Using default analysis Version 551b0097 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_p01.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 10c341169e851beaa907d6b4c856b8c9335bdf02c819f534595f4ceb4010e354 --- Real Ultimate output --- This is Ultimate 0.3.0-?-551b009-m [2025-01-09 08:15:29,398 INFO L188 SettingsManager]: Resetting all preferences to default values... [2025-01-09 08:15:29,435 INFO L114 SettingsManager]: Loading settings from /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/config/svcomp-Reach-64bit-Automizer_Default.epf [2025-01-09 08:15:29,438 WARN L101 SettingsManager]: Preference file contains the following unknown settings: [2025-01-09 08:15:29,438 WARN L103 SettingsManager]: * de.uni_freiburg.informatik.ultimate.core.Log level for class [2025-01-09 08:15:29,453 INFO L130 SettingsManager]: Preferences different from defaults after loading the file: [2025-01-09 08:15:29,453 INFO L151 SettingsManager]: Preferences of UltimateCore differ from their defaults: [2025-01-09 08:15:29,453 INFO L153 SettingsManager]: * Log level for class=de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher=ERROR; [2025-01-09 08:15:29,454 INFO L151 SettingsManager]: Preferences of Boogie Preprocessor differ from their defaults: [2025-01-09 08:15:29,454 INFO L153 SettingsManager]: * Use memory slicer=true [2025-01-09 08:15:29,454 INFO L151 SettingsManager]: Preferences of Boogie Procedure Inliner differ from their defaults: [2025-01-09 08:15:29,454 INFO L153 SettingsManager]: * Ignore calls to procedures called more than once=ONLY_FOR_SEQUENTIAL_PROGRAMS [2025-01-09 08:15:29,454 INFO L151 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2025-01-09 08:15:29,454 INFO L153 SettingsManager]: * Create parallel compositions if possible=false [2025-01-09 08:15:29,454 INFO L153 SettingsManager]: * Use SBE=true [2025-01-09 08:15:29,454 INFO L151 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2025-01-09 08:15:29,454 INFO L153 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2025-01-09 08:15:29,454 INFO L153 SettingsManager]: * Overapproximate operations on floating types=true [2025-01-09 08:15:29,454 INFO L153 SettingsManager]: * Check division by zero=IGNORE [2025-01-09 08:15:29,454 INFO L153 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2025-01-09 08:15:29,455 INFO L153 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2025-01-09 08:15:29,455 INFO L153 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2025-01-09 08:15:29,455 INFO L153 SettingsManager]: * Check if freed pointer was valid=false [2025-01-09 08:15:29,455 INFO L153 SettingsManager]: * Behaviour of calls to undefined functions=OVERAPPROXIMATE_BEHAVIOUR [2025-01-09 08:15:29,455 INFO L153 SettingsManager]: * Use constant arrays=true [2025-01-09 08:15:29,455 INFO L151 SettingsManager]: Preferences of IcfgBuilder differ from their defaults: [2025-01-09 08:15:29,455 INFO L153 SettingsManager]: * Size of a code block=SequenceOfStatements [2025-01-09 08:15:29,455 INFO L153 SettingsManager]: * Only consider context switches at boundaries of atomic blocks=true [2025-01-09 08:15:29,455 INFO L153 SettingsManager]: * SMT solver=External_DefaultMode [2025-01-09 08:15:29,455 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2025-01-09 08:15:29,455 INFO L151 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2025-01-09 08:15:29,455 INFO L153 SettingsManager]: * Size of a code block=SequenceOfStatements [2025-01-09 08:15:29,455 INFO L153 SettingsManager]: * Only consider context switches at boundaries of atomic blocks=true [2025-01-09 08:15:29,455 INFO L153 SettingsManager]: * SMT solver=External_DefaultMode [2025-01-09 08:15:29,455 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2025-01-09 08:15:29,455 INFO L151 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2025-01-09 08:15:29,455 INFO L153 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2025-01-09 08:15:29,455 INFO L153 SettingsManager]: * Compute procedure contracts=false [2025-01-09 08:15:29,456 INFO L153 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopHeads [2025-01-09 08:15:29,456 INFO L153 SettingsManager]: * Trace refinement strategy=CAMEL [2025-01-09 08:15:29,456 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2025-01-09 08:15:29,456 INFO L153 SettingsManager]: * Apply one-shot large block encoding in concurrent analysis=false [2025-01-09 08:15:29,456 INFO L153 SettingsManager]: * Automaton type used in concurrency analysis=PETRI_NET [2025-01-09 08:15:29,456 INFO L153 SettingsManager]: * Order on configurations for Petri net unfoldings=DBO [2025-01-09 08:15:29,456 INFO L153 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode [2025-01-09 08:15:29,456 INFO L153 SettingsManager]: * Looper check in Petri net analysis=SEMANTIC Applying setting for plugin de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator: Entry function -> main Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Witness directory -> /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Witness filename -> witness Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Write witness besides input file -> false Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Graph data specification -> CHECK( init(main()), LTL(G ! call(reach_error())) ) Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Graph data producer -> Automizer Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Graph data architecture -> 64bit Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Graph data programhash -> 10c341169e851beaa907d6b4c856b8c9335bdf02c819f534595f4ceb4010e354 [2025-01-09 08:15:29,674 INFO L75 nceAwareModelManager]: Repository-Root is: /tmp [2025-01-09 08:15:29,680 INFO L261 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2025-01-09 08:15:29,681 INFO L217 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2025-01-09 08:15:29,682 INFO L270 PluginConnector]: Initializing CDTParser... [2025-01-09 08:15:29,683 INFO L274 PluginConnector]: CDTParser initialized [2025-01-09 08:15:29,687 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_p01.c [2025-01-09 08:15:31,196 INFO L533 CDTParser]: Created temporary CDT project at /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/data/da5e43854/bcf6f0f11b9d43839bcc8615fb5b008d/FLAGa0e238830 [2025-01-09 08:15:31,630 INFO L384 CDTParser]: Found 1 translation units. [2025-01-09 08:15:31,631 INFO L180 CDTParser]: Scanning /storage/repos/ultimate-jdk21/releaseScripts/default/sv-benchmarks/c/hardware-verification-bv/btor2c-lazyMod.vcegar_QF_BV_itc99_b13_p01.c [2025-01-09 08:15:31,646 INFO L427 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/data/da5e43854/bcf6f0f11b9d43839bcc8615fb5b008d/FLAGa0e238830 [2025-01-09 08:15:31,808 INFO L435 CDTParser]: Successfully deleted /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/data/da5e43854/bcf6f0f11b9d43839bcc8615fb5b008d [2025-01-09 08:15:31,810 INFO L299 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2025-01-09 08:15:31,812 INFO L133 ToolchainWalker]: Walking toolchain with 6 elements. [2025-01-09 08:15:31,814 INFO L112 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2025-01-09 08:15:31,814 INFO L270 PluginConnector]: Initializing CACSL2BoogieTranslator... [2025-01-09 08:15:31,818 INFO L274 PluginConnector]: CACSL2BoogieTranslator initialized [2025-01-09 08:15:31,818 INFO L184 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 09.01 08:15:31" (1/1) ... [2025-01-09 08:15:31,819 INFO L204 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@1f3466a6 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.01 08:15:31, skipping insertion in model container [2025-01-09 08:15:31,820 INFO L184 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 09.01 08:15:31" (1/1) ... [2025-01-09 08:15:31,848 INFO L175 MainTranslator]: Built tables and reachable declarations [2025-01-09 08:15:31,979 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_p01.c[1266,1279] [2025-01-09 08:15:32,107 INFO L210 PostProcessor]: Analyzing one entry point: main [2025-01-09 08:15:32,119 INFO L200 MainTranslator]: Completed pre-run [2025-01-09 08:15:32,130 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_p01.c[1266,1279] [2025-01-09 08:15:32,223 INFO L210 PostProcessor]: Analyzing one entry point: main [2025-01-09 08:15:32,235 INFO L204 MainTranslator]: Completed translation [2025-01-09 08:15:32,236 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.01 08:15:32 WrapperNode [2025-01-09 08:15:32,236 INFO L131 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2025-01-09 08:15:32,237 INFO L112 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2025-01-09 08:15:32,238 INFO L270 PluginConnector]: Initializing Boogie Procedure Inliner... [2025-01-09 08:15:32,238 INFO L274 PluginConnector]: Boogie Procedure Inliner initialized [2025-01-09 08:15:32,243 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.01 08:15:32" (1/1) ... [2025-01-09 08:15:32,263 INFO L184 PluginConnector]: Executing the observer Inliner from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.01 08:15:32" (1/1) ... [2025-01-09 08:15:32,346 INFO L138 Inliner]: procedures = 17, calls = 8, calls flagged for inlining = 3, calls inlined = 3, statements flattened = 747 [2025-01-09 08:15:32,347 INFO L131 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2025-01-09 08:15:32,348 INFO L112 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2025-01-09 08:15:32,348 INFO L270 PluginConnector]: Initializing Boogie Preprocessor... [2025-01-09 08:15:32,349 INFO L274 PluginConnector]: Boogie Preprocessor initialized [2025-01-09 08:15:32,358 INFO L184 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.01 08:15:32" (1/1) ... [2025-01-09 08:15:32,360 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.01 08:15:32" (1/1) ... [2025-01-09 08:15:32,383 INFO L184 PluginConnector]: Executing the observer MemorySlicer from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.01 08:15:32" (1/1) ... [2025-01-09 08:15:32,425 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-01-09 08:15:32,430 INFO L184 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.01 08:15:32" (1/1) ... [2025-01-09 08:15:32,430 INFO L184 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.01 08:15:32" (1/1) ... [2025-01-09 08:15:32,469 INFO L184 PluginConnector]: Executing the observer ReplaceArrayAssignments from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.01 08:15:32" (1/1) ... [2025-01-09 08:15:32,482 INFO L184 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.01 08:15:32" (1/1) ... [2025-01-09 08:15:32,491 INFO L184 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.01 08:15:32" (1/1) ... [2025-01-09 08:15:32,506 INFO L184 PluginConnector]: Executing the observer LTLStepAnnotator from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.01 08:15:32" (1/1) ... [2025-01-09 08:15:32,517 INFO L184 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.01 08:15:32" (1/1) ... [2025-01-09 08:15:32,530 INFO L131 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2025-01-09 08:15:32,531 INFO L112 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2025-01-09 08:15:32,531 INFO L270 PluginConnector]: Initializing RCFGBuilder... [2025-01-09 08:15:32,531 INFO L274 PluginConnector]: RCFGBuilder initialized [2025-01-09 08:15:32,532 INFO L184 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.01 08:15:32" (1/1) ... [2025-01-09 08:15:32,538 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2025-01-09 08:15:32,552 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 [2025-01-09 08:15:32,570 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-01-09 08:15:32,579 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-01-09 08:15:32,604 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocInit [2025-01-09 08:15:32,605 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int#0 [2025-01-09 08:15:32,605 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2025-01-09 08:15:32,606 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2025-01-09 08:15:32,750 INFO L234 CfgBuilder]: Building ICFG [2025-01-09 08:15:32,752 INFO L260 CfgBuilder]: Building CFG for each procedure with an implementation [2025-01-09 08:15:33,516 INFO L? ?]: Removed 395 outVars from TransFormulas that were not future-live. [2025-01-09 08:15:33,516 INFO L283 CfgBuilder]: Performing block encoding [2025-01-09 08:15:33,526 INFO L307 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2025-01-09 08:15:33,528 INFO L312 CfgBuilder]: Removed 1 assume(true) statements. [2025-01-09 08:15:33,528 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 09.01 08:15:33 BoogieIcfgContainer [2025-01-09 08:15:33,528 INFO L131 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2025-01-09 08:15:33,530 INFO L112 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2025-01-09 08:15:33,530 INFO L270 PluginConnector]: Initializing TraceAbstraction... [2025-01-09 08:15:33,533 INFO L274 PluginConnector]: TraceAbstraction initialized [2025-01-09 08:15:33,533 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 09.01 08:15:31" (1/3) ... [2025-01-09 08:15:33,534 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@19852e83 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 09.01 08:15:33, skipping insertion in model container [2025-01-09 08:15:33,534 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.01 08:15:32" (2/3) ... [2025-01-09 08:15:33,535 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@19852e83 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 09.01 08:15:33, skipping insertion in model container [2025-01-09 08:15:33,535 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 09.01 08:15:33" (3/3) ... [2025-01-09 08:15:33,536 INFO L128 eAbstractionObserver]: Analyzing ICFG btor2c-lazyMod.vcegar_QF_BV_itc99_b13_p01.c [2025-01-09 08:15:33,546 INFO L216 ceAbstractionStarter]: Automizer settings: Hoare:LoopHeads NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2025-01-09 08:15:33,548 INFO L151 ceAbstractionStarter]: Applying trace abstraction to ICFG btor2c-lazyMod.vcegar_QF_BV_itc99_b13_p01.c that has 1 procedures, 142 locations, 1 initial locations, 1 loop locations, and 1 error locations. [2025-01-09 08:15:33,592 INFO L332 AbstractCegarLoop]: ======== Iteration 0 == of CEGAR loop == AllErrorsAtOnce ======== [2025-01-09 08:15:33,601 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;@6209e9f1, mLbeIndependenceSettings=[IndependenceType=SEMANTIC, AbstractionType=NONE, UseConditional=false, UseSemiCommutativity=true, Solver=Z3, SolverTimeout=1000ms] [2025-01-09 08:15:33,601 INFO L334 AbstractCegarLoop]: Starting to check reachability of 1 error locations. [2025-01-09 08:15:33,606 INFO L276 IsEmpty]: Start isEmpty. Operand has 142 states, 140 states have (on average 1.4928571428571429) internal successors, (209), 141 states have internal predecessors, (209), 0 states have call successors, (0), 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-01-09 08:15:33,611 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 42 [2025-01-09 08:15:33,611 INFO L210 NwaCegarLoop]: Found error trace [2025-01-09 08:15:33,612 INFO L218 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-01-09 08:15:33,612 INFO L396 AbstractCegarLoop]: === Iteration 1 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-01-09 08:15:33,652 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-01-09 08:15:33,653 INFO L85 PathProgramCache]: Analyzing trace with hash 387884158, now seen corresponding path program 1 times [2025-01-09 08:15:33,658 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-01-09 08:15:33,660 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [45723895] [2025-01-09 08:15:33,660 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-01-09 08:15:33,660 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-01-09 08:15:33,744 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 41 statements into 1 equivalence classes. [2025-01-09 08:15:33,815 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 41 of 41 statements. [2025-01-09 08:15:33,816 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-01-09 08:15:33,816 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-01-09 08:15:34,284 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-01-09 08:15:34,285 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-01-09 08:15:34,285 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [45723895] [2025-01-09 08:15:34,286 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [45723895] provided 1 perfect and 0 imperfect interpolant sequences [2025-01-09 08:15:34,286 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-01-09 08:15:34,286 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2025-01-09 08:15:34,287 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1113049480] [2025-01-09 08:15:34,287 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-01-09 08:15:34,290 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2025-01-09 08:15:34,290 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-01-09 08:15:34,302 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2025-01-09 08:15:34,303 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2025-01-09 08:15:34,306 INFO L87 Difference]: Start difference. First operand has 142 states, 140 states have (on average 1.4928571428571429) internal successors, (209), 141 states have internal predecessors, (209), 0 states have call successors, (0), 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 10.25) internal successors, (41), 4 states have internal predecessors, (41), 0 states have call successors, (0), 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-01-09 08:15:34,353 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-01-09 08:15:34,353 INFO L93 Difference]: Finished difference Result 229 states and 339 transitions. [2025-01-09 08:15:34,355 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2025-01-09 08:15:34,356 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 4 states have (on average 10.25) internal successors, (41), 4 states have internal predecessors, (41), 0 states have call successors, (0), 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 41 [2025-01-09 08:15:34,356 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-01-09 08:15:34,363 INFO L225 Difference]: With dead ends: 229 [2025-01-09 08:15:34,365 INFO L226 Difference]: Without dead ends: 141 [2025-01-09 08:15:34,368 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-01-09 08:15:34,372 INFO L435 NwaCegarLoop]: 203 mSDtfsCounter, 0 mSDsluCounter, 400 mSDsCounter, 0 mSdLazyCounter, 11 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 0 SdHoareTripleChecker+Valid, 603 SdHoareTripleChecker+Invalid, 11 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 11 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2025-01-09 08:15:34,374 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [0 Valid, 603 Invalid, 11 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 11 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2025-01-09 08:15:34,389 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 141 states. [2025-01-09 08:15:34,408 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 141 to 141. [2025-01-09 08:15:34,410 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 141 states, 140 states have (on average 1.4785714285714286) internal successors, (207), 140 states have internal predecessors, (207), 0 states have call successors, (0), 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-01-09 08:15:34,414 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 141 states to 141 states and 207 transitions. [2025-01-09 08:15:34,416 INFO L78 Accepts]: Start accepts. Automaton has 141 states and 207 transitions. Word has length 41 [2025-01-09 08:15:34,416 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-01-09 08:15:34,416 INFO L471 AbstractCegarLoop]: Abstraction has 141 states and 207 transitions. [2025-01-09 08:15:34,417 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 10.25) internal successors, (41), 4 states have internal predecessors, (41), 0 states have call successors, (0), 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-01-09 08:15:34,417 INFO L276 IsEmpty]: Start isEmpty. Operand 141 states and 207 transitions. [2025-01-09 08:15:34,418 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 43 [2025-01-09 08:15:34,418 INFO L210 NwaCegarLoop]: Found error trace [2025-01-09 08:15:34,418 INFO L218 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-01-09 08:15:34,419 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable0 [2025-01-09 08:15:34,419 INFO L396 AbstractCegarLoop]: === Iteration 2 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-01-09 08:15:34,419 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-01-09 08:15:34,420 INFO L85 PathProgramCache]: Analyzing trace with hash -858797603, now seen corresponding path program 1 times [2025-01-09 08:15:34,420 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-01-09 08:15:34,420 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1122044603] [2025-01-09 08:15:34,420 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-01-09 08:15:34,420 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-01-09 08:15:34,442 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 42 statements into 1 equivalence classes. [2025-01-09 08:15:34,475 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 42 of 42 statements. [2025-01-09 08:15:34,478 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-01-09 08:15:34,479 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-01-09 08:15:34,635 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-01-09 08:15:34,635 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-01-09 08:15:34,635 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1122044603] [2025-01-09 08:15:34,635 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1122044603] provided 1 perfect and 0 imperfect interpolant sequences [2025-01-09 08:15:34,635 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-01-09 08:15:34,635 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2025-01-09 08:15:34,635 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [638995323] [2025-01-09 08:15:34,636 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-01-09 08:15:34,636 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2025-01-09 08:15:34,637 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-01-09 08:15:34,637 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2025-01-09 08:15:34,638 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2025-01-09 08:15:34,638 INFO L87 Difference]: Start difference. First operand 141 states and 207 transitions. Second operand has 4 states, 4 states have (on average 10.5) internal successors, (42), 4 states have internal predecessors, (42), 0 states have call successors, (0), 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-01-09 08:15:34,667 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-01-09 08:15:34,668 INFO L93 Difference]: Finished difference Result 230 states and 337 transitions. [2025-01-09 08:15:34,668 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2025-01-09 08:15:34,668 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 4 states have (on average 10.5) internal successors, (42), 4 states have internal predecessors, (42), 0 states have call successors, (0), 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 42 [2025-01-09 08:15:34,668 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-01-09 08:15:34,669 INFO L225 Difference]: With dead ends: 230 [2025-01-09 08:15:34,671 INFO L226 Difference]: Without dead ends: 143 [2025-01-09 08:15:34,671 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-01-09 08:15:34,672 INFO L435 NwaCegarLoop]: 203 mSDtfsCounter, 0 mSDsluCounter, 396 mSDsCounter, 0 mSdLazyCounter, 15 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 0 SdHoareTripleChecker+Valid, 599 SdHoareTripleChecker+Invalid, 15 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 15 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2025-01-09 08:15:34,672 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [0 Valid, 599 Invalid, 15 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 15 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2025-01-09 08:15:34,672 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 143 states. [2025-01-09 08:15:34,676 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 143 to 143. [2025-01-09 08:15:34,678 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 143 states, 142 states have (on average 1.471830985915493) internal successors, (209), 142 states have internal predecessors, (209), 0 states have call successors, (0), 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-01-09 08:15:34,679 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 143 states to 143 states and 209 transitions. [2025-01-09 08:15:34,681 INFO L78 Accepts]: Start accepts. Automaton has 143 states and 209 transitions. Word has length 42 [2025-01-09 08:15:34,681 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-01-09 08:15:34,681 INFO L471 AbstractCegarLoop]: Abstraction has 143 states and 209 transitions. [2025-01-09 08:15:34,681 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 10.5) internal successors, (42), 4 states have internal predecessors, (42), 0 states have call successors, (0), 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-01-09 08:15:34,681 INFO L276 IsEmpty]: Start isEmpty. Operand 143 states and 209 transitions. [2025-01-09 08:15:34,682 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 44 [2025-01-09 08:15:34,682 INFO L210 NwaCegarLoop]: Found error trace [2025-01-09 08:15:34,682 INFO L218 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-01-09 08:15:34,682 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable1 [2025-01-09 08:15:34,682 INFO L396 AbstractCegarLoop]: === Iteration 3 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-01-09 08:15:34,683 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-01-09 08:15:34,683 INFO L85 PathProgramCache]: Analyzing trace with hash -1950887625, now seen corresponding path program 1 times [2025-01-09 08:15:34,683 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-01-09 08:15:34,683 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2063687713] [2025-01-09 08:15:34,683 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-01-09 08:15:34,683 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-01-09 08:15:34,703 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 43 statements into 1 equivalence classes. [2025-01-09 08:15:34,726 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 43 of 43 statements. [2025-01-09 08:15:34,729 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-01-09 08:15:34,729 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-01-09 08:15:35,048 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-01-09 08:15:35,048 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-01-09 08:15:35,048 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2063687713] [2025-01-09 08:15:35,048 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [2063687713] provided 1 perfect and 0 imperfect interpolant sequences [2025-01-09 08:15:35,048 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-01-09 08:15:35,048 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2025-01-09 08:15:35,048 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [366626885] [2025-01-09 08:15:35,049 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-01-09 08:15:35,049 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2025-01-09 08:15:35,049 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-01-09 08:15:35,049 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2025-01-09 08:15:35,049 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2025-01-09 08:15:35,049 INFO L87 Difference]: Start difference. First operand 143 states and 209 transitions. Second operand has 4 states, 4 states have (on average 10.75) internal successors, (43), 4 states have internal predecessors, (43), 0 states have call successors, (0), 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-01-09 08:15:35,076 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-01-09 08:15:35,076 INFO L93 Difference]: Finished difference Result 232 states and 338 transitions. [2025-01-09 08:15:35,077 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2025-01-09 08:15:35,077 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 4 states have (on average 10.75) internal successors, (43), 4 states have internal predecessors, (43), 0 states have call successors, (0), 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 43 [2025-01-09 08:15:35,077 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-01-09 08:15:35,078 INFO L225 Difference]: With dead ends: 232 [2025-01-09 08:15:35,078 INFO L226 Difference]: Without dead ends: 143 [2025-01-09 08:15:35,079 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-01-09 08:15:35,080 INFO L435 NwaCegarLoop]: 199 mSDtfsCounter, 6 mSDsluCounter, 388 mSDsCounter, 0 mSdLazyCounter, 16 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 6 SdHoareTripleChecker+Valid, 587 SdHoareTripleChecker+Invalid, 16 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 16 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2025-01-09 08:15:35,080 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [6 Valid, 587 Invalid, 16 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 16 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2025-01-09 08:15:35,081 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 143 states. [2025-01-09 08:15:35,086 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 143 to 143. [2025-01-09 08:15:35,087 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 143 states, 142 states have (on average 1.4647887323943662) internal successors, (208), 142 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-01-09 08:15:35,088 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 143 states to 143 states and 208 transitions. [2025-01-09 08:15:35,088 INFO L78 Accepts]: Start accepts. Automaton has 143 states and 208 transitions. Word has length 43 [2025-01-09 08:15:35,088 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-01-09 08:15:35,088 INFO L471 AbstractCegarLoop]: Abstraction has 143 states and 208 transitions. [2025-01-09 08:15:35,088 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 10.75) internal successors, (43), 4 states have internal predecessors, (43), 0 states have call successors, (0), 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-01-09 08:15:35,088 INFO L276 IsEmpty]: Start isEmpty. Operand 143 states and 208 transitions. [2025-01-09 08:15:35,089 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 45 [2025-01-09 08:15:35,089 INFO L210 NwaCegarLoop]: Found error trace [2025-01-09 08:15:35,089 INFO L218 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-01-09 08:15:35,090 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable2 [2025-01-09 08:15:35,090 INFO L396 AbstractCegarLoop]: === Iteration 4 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-01-09 08:15:35,090 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-01-09 08:15:35,090 INFO L85 PathProgramCache]: Analyzing trace with hash 560912804, now seen corresponding path program 1 times [2025-01-09 08:15:35,090 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-01-09 08:15:35,090 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1207216119] [2025-01-09 08:15:35,090 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-01-09 08:15:35,091 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-01-09 08:15:35,111 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 44 statements into 1 equivalence classes. [2025-01-09 08:15:35,139 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 44 of 44 statements. [2025-01-09 08:15:35,139 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-01-09 08:15:35,139 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-01-09 08:15:35,479 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-01-09 08:15:35,480 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-01-09 08:15:35,480 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1207216119] [2025-01-09 08:15:35,480 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1207216119] provided 1 perfect and 0 imperfect interpolant sequences [2025-01-09 08:15:35,480 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-01-09 08:15:35,480 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [8] imperfect sequences [] total 8 [2025-01-09 08:15:35,481 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1658266644] [2025-01-09 08:15:35,481 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-01-09 08:15:35,481 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 8 states [2025-01-09 08:15:35,481 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-01-09 08:15:35,481 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2025-01-09 08:15:35,482 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=14, Invalid=42, Unknown=0, NotChecked=0, Total=56 [2025-01-09 08:15:35,482 INFO L87 Difference]: Start difference. First operand 143 states and 208 transitions. Second operand has 8 states, 8 states have (on average 5.5) internal successors, (44), 8 states have internal predecessors, (44), 0 states have call successors, (0), 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-01-09 08:15:35,584 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-01-09 08:15:35,584 INFO L93 Difference]: Finished difference Result 242 states and 350 transitions. [2025-01-09 08:15:35,584 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2025-01-09 08:15:35,584 INFO L78 Accepts]: Start accepts. Automaton has has 8 states, 8 states have (on average 5.5) internal successors, (44), 8 states have internal predecessors, (44), 0 states have call successors, (0), 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 44 [2025-01-09 08:15:35,585 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-01-09 08:15:35,585 INFO L225 Difference]: With dead ends: 242 [2025-01-09 08:15:35,587 INFO L226 Difference]: Without dead ends: 153 [2025-01-09 08:15:35,587 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-01-09 08:15:35,588 INFO L435 NwaCegarLoop]: 196 mSDtfsCounter, 192 mSDsluCounter, 966 mSDsCounter, 0 mSdLazyCounter, 62 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 192 SdHoareTripleChecker+Valid, 1162 SdHoareTripleChecker+Invalid, 62 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 62 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2025-01-09 08:15:35,588 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [192 Valid, 1162 Invalid, 62 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 62 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2025-01-09 08:15:35,590 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 153 states. [2025-01-09 08:15:35,596 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 153 to 152. [2025-01-09 08:15:35,596 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 152 states, 151 states have (on average 1.4569536423841059) internal successors, (220), 151 states have internal predecessors, (220), 0 states have call successors, (0), 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-01-09 08:15:35,597 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 152 states to 152 states and 220 transitions. [2025-01-09 08:15:35,600 INFO L78 Accepts]: Start accepts. Automaton has 152 states and 220 transitions. Word has length 44 [2025-01-09 08:15:35,600 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-01-09 08:15:35,600 INFO L471 AbstractCegarLoop]: Abstraction has 152 states and 220 transitions. [2025-01-09 08:15:35,600 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 8 states, 8 states have (on average 5.5) internal successors, (44), 8 states have internal predecessors, (44), 0 states have call successors, (0), 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-01-09 08:15:35,601 INFO L276 IsEmpty]: Start isEmpty. Operand 152 states and 220 transitions. [2025-01-09 08:15:35,601 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 46 [2025-01-09 08:15:35,601 INFO L210 NwaCegarLoop]: Found error trace [2025-01-09 08:15:35,601 INFO L218 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-01-09 08:15:35,601 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable3 [2025-01-09 08:15:35,601 INFO L396 AbstractCegarLoop]: === Iteration 5 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-01-09 08:15:35,602 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-01-09 08:15:35,602 INFO L85 PathProgramCache]: Analyzing trace with hash 527774260, now seen corresponding path program 1 times [2025-01-09 08:15:35,602 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-01-09 08:15:35,602 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1526295575] [2025-01-09 08:15:35,602 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-01-09 08:15:35,602 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-01-09 08:15:35,620 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 45 statements into 1 equivalence classes. [2025-01-09 08:15:35,652 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 45 of 45 statements. [2025-01-09 08:15:35,654 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-01-09 08:15:35,654 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-01-09 08:15:36,065 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-01-09 08:15:36,067 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-01-09 08:15:36,067 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1526295575] [2025-01-09 08:15:36,067 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1526295575] provided 1 perfect and 0 imperfect interpolant sequences [2025-01-09 08:15:36,067 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-01-09 08:15:36,067 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [9] imperfect sequences [] total 9 [2025-01-09 08:15:36,067 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [147268807] [2025-01-09 08:15:36,067 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-01-09 08:15:36,067 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 9 states [2025-01-09 08:15:36,067 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-01-09 08:15:36,068 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2025-01-09 08:15:36,069 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=17, Invalid=55, Unknown=0, NotChecked=0, Total=72 [2025-01-09 08:15:36,069 INFO L87 Difference]: Start difference. First operand 152 states and 220 transitions. Second operand has 9 states, 9 states have (on average 5.0) internal successors, (45), 9 states have internal predecessors, (45), 0 states have call successors, (0), 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-01-09 08:15:36,265 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-01-09 08:15:36,266 INFO L93 Difference]: Finished difference Result 255 states and 367 transitions. [2025-01-09 08:15:36,266 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2025-01-09 08:15:36,266 INFO L78 Accepts]: Start accepts. Automaton has has 9 states, 9 states have (on average 5.0) internal successors, (45), 9 states have internal predecessors, (45), 0 states have call successors, (0), 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 45 [2025-01-09 08:15:36,266 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-01-09 08:15:36,267 INFO L225 Difference]: With dead ends: 255 [2025-01-09 08:15:36,267 INFO L226 Difference]: Without dead ends: 157 [2025-01-09 08:15:36,268 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 15 GetRequests, 3 SyntacticMatches, 0 SemanticMatches, 12 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 17 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=39, Invalid=143, Unknown=0, NotChecked=0, Total=182 [2025-01-09 08:15:36,268 INFO L435 NwaCegarLoop]: 181 mSDtfsCounter, 195 mSDsluCounter, 1072 mSDsCounter, 0 mSdLazyCounter, 175 mSolverCounterSat, 1 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 195 SdHoareTripleChecker+Valid, 1253 SdHoareTripleChecker+Invalid, 176 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 1 IncrementalHoareTripleChecker+Valid, 175 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2025-01-09 08:15:36,268 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [195 Valid, 1253 Invalid, 176 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [1 Valid, 175 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2025-01-09 08:15:36,269 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 157 states. [2025-01-09 08:15:36,272 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 157 to 156. [2025-01-09 08:15:36,272 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 156 states, 155 states have (on average 1.4516129032258065) internal successors, (225), 155 states have internal predecessors, (225), 0 states have call successors, (0), 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-01-09 08:15:36,277 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 156 states to 156 states and 225 transitions. [2025-01-09 08:15:36,277 INFO L78 Accepts]: Start accepts. Automaton has 156 states and 225 transitions. Word has length 45 [2025-01-09 08:15:36,277 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-01-09 08:15:36,277 INFO L471 AbstractCegarLoop]: Abstraction has 156 states and 225 transitions. [2025-01-09 08:15:36,277 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 9 states, 9 states have (on average 5.0) internal successors, (45), 9 states have internal predecessors, (45), 0 states have call successors, (0), 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-01-09 08:15:36,277 INFO L276 IsEmpty]: Start isEmpty. Operand 156 states and 225 transitions. [2025-01-09 08:15:36,278 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 46 [2025-01-09 08:15:36,278 INFO L210 NwaCegarLoop]: Found error trace [2025-01-09 08:15:36,278 INFO L218 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-01-09 08:15:36,278 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable4 [2025-01-09 08:15:36,278 INFO L396 AbstractCegarLoop]: === Iteration 6 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-01-09 08:15:36,279 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-01-09 08:15:36,279 INFO L85 PathProgramCache]: Analyzing trace with hash 1053569225, now seen corresponding path program 1 times [2025-01-09 08:15:36,279 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-01-09 08:15:36,279 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [232684152] [2025-01-09 08:15:36,279 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-01-09 08:15:36,279 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-01-09 08:15:36,307 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 45 statements into 1 equivalence classes. [2025-01-09 08:15:36,320 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 45 of 45 statements. [2025-01-09 08:15:36,320 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-01-09 08:15:36,320 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-01-09 08:15:36,550 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-01-09 08:15:36,550 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-01-09 08:15:36,550 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [232684152] [2025-01-09 08:15:36,550 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [232684152] provided 1 perfect and 0 imperfect interpolant sequences [2025-01-09 08:15:36,550 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-01-09 08:15:36,552 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2025-01-09 08:15:36,552 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [936181284] [2025-01-09 08:15:36,552 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-01-09 08:15:36,552 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2025-01-09 08:15:36,552 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-01-09 08:15:36,552 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2025-01-09 08:15:36,552 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=10, Invalid=20, Unknown=0, NotChecked=0, Total=30 [2025-01-09 08:15:36,553 INFO L87 Difference]: Start difference. First operand 156 states and 225 transitions. Second operand has 6 states, 6 states have (on average 7.5) internal successors, (45), 6 states have internal predecessors, (45), 0 states have call successors, (0), 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-01-09 08:15:36,769 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-01-09 08:15:36,771 INFO L93 Difference]: Finished difference Result 299 states and 424 transitions. [2025-01-09 08:15:36,771 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2025-01-09 08:15:36,772 INFO L78 Accepts]: Start accepts. Automaton has has 6 states, 6 states have (on average 7.5) internal successors, (45), 6 states have internal predecessors, (45), 0 states have call successors, (0), 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 45 [2025-01-09 08:15:36,772 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-01-09 08:15:36,772 INFO L225 Difference]: With dead ends: 299 [2025-01-09 08:15:36,772 INFO L226 Difference]: Without dead ends: 197 [2025-01-09 08:15:36,773 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-01-09 08:15:36,774 INFO L435 NwaCegarLoop]: 194 mSDtfsCounter, 270 mSDsluCounter, 440 mSDsCounter, 0 mSdLazyCounter, 182 mSolverCounterSat, 1 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 270 SdHoareTripleChecker+Valid, 634 SdHoareTripleChecker+Invalid, 183 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 1 IncrementalHoareTripleChecker+Valid, 182 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.2s IncrementalHoareTripleChecker+Time [2025-01-09 08:15:36,775 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [270 Valid, 634 Invalid, 183 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [1 Valid, 182 Invalid, 0 Unknown, 0 Unchecked, 0.2s Time] [2025-01-09 08:15:36,775 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 197 states. [2025-01-09 08:15:36,780 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 197 to 158. [2025-01-09 08:15:36,784 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 158 states, 157 states have (on average 1.4458598726114649) internal successors, (227), 157 states have internal predecessors, (227), 0 states have call successors, (0), 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-01-09 08:15:36,784 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 158 states to 158 states and 227 transitions. [2025-01-09 08:15:36,784 INFO L78 Accepts]: Start accepts. Automaton has 158 states and 227 transitions. Word has length 45 [2025-01-09 08:15:36,784 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-01-09 08:15:36,784 INFO L471 AbstractCegarLoop]: Abstraction has 158 states and 227 transitions. [2025-01-09 08:15:36,784 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 6 states have (on average 7.5) internal successors, (45), 6 states have internal predecessors, (45), 0 states have call successors, (0), 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-01-09 08:15:36,785 INFO L276 IsEmpty]: Start isEmpty. Operand 158 states and 227 transitions. [2025-01-09 08:15:36,785 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 47 [2025-01-09 08:15:36,785 INFO L210 NwaCegarLoop]: Found error trace [2025-01-09 08:15:36,785 INFO L218 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-01-09 08:15:36,785 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable5 [2025-01-09 08:15:36,785 INFO L396 AbstractCegarLoop]: === Iteration 7 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-01-09 08:15:36,786 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-01-09 08:15:36,786 INFO L85 PathProgramCache]: Analyzing trace with hash 745678211, now seen corresponding path program 1 times [2025-01-09 08:15:36,786 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-01-09 08:15:36,789 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [894787414] [2025-01-09 08:15:36,789 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-01-09 08:15:36,789 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-01-09 08:15:36,804 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 46 statements into 1 equivalence classes. [2025-01-09 08:15:36,819 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 46 of 46 statements. [2025-01-09 08:15:36,819 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-01-09 08:15:36,819 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-01-09 08:15:36,990 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-01-09 08:15:36,991 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-01-09 08:15:36,991 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [894787414] [2025-01-09 08:15:36,991 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [894787414] provided 1 perfect and 0 imperfect interpolant sequences [2025-01-09 08:15:36,991 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-01-09 08:15:36,991 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2025-01-09 08:15:36,991 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [520164098] [2025-01-09 08:15:36,991 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-01-09 08:15:36,991 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2025-01-09 08:15:36,992 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-01-09 08:15:36,992 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2025-01-09 08:15:36,992 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=8, Invalid=12, Unknown=0, NotChecked=0, Total=20 [2025-01-09 08:15:36,992 INFO L87 Difference]: Start difference. First operand 158 states and 227 transitions. Second operand has 5 states, 5 states have (on average 9.2) internal successors, (46), 5 states have internal predecessors, (46), 0 states have call successors, (0), 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-01-09 08:15:37,030 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-01-09 08:15:37,031 INFO L93 Difference]: Finished difference Result 266 states and 380 transitions. [2025-01-09 08:15:37,031 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2025-01-09 08:15:37,031 INFO L78 Accepts]: Start accepts. Automaton has has 5 states, 5 states have (on average 9.2) internal successors, (46), 5 states have internal predecessors, (46), 0 states have call successors, (0), 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 46 [2025-01-09 08:15:37,031 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-01-09 08:15:37,032 INFO L225 Difference]: With dead ends: 266 [2025-01-09 08:15:37,032 INFO L226 Difference]: Without dead ends: 164 [2025-01-09 08:15:37,032 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-01-09 08:15:37,033 INFO L435 NwaCegarLoop]: 199 mSDtfsCounter, 175 mSDsluCounter, 390 mSDsCounter, 0 mSdLazyCounter, 22 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 175 SdHoareTripleChecker+Valid, 589 SdHoareTripleChecker+Invalid, 22 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 22 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2025-01-09 08:15:37,034 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [175 Valid, 589 Invalid, 22 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 22 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2025-01-09 08:15:37,034 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 164 states. [2025-01-09 08:15:37,041 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 164 to 164. [2025-01-09 08:15:37,041 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 164 states, 163 states have (on average 1.4294478527607362) internal successors, (233), 163 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-01-09 08:15:37,041 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 164 states to 164 states and 233 transitions. [2025-01-09 08:15:37,042 INFO L78 Accepts]: Start accepts. Automaton has 164 states and 233 transitions. Word has length 46 [2025-01-09 08:15:37,042 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-01-09 08:15:37,042 INFO L471 AbstractCegarLoop]: Abstraction has 164 states and 233 transitions. [2025-01-09 08:15:37,042 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 9.2) internal successors, (46), 5 states have internal predecessors, (46), 0 states have call successors, (0), 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-01-09 08:15:37,042 INFO L276 IsEmpty]: Start isEmpty. Operand 164 states and 233 transitions. [2025-01-09 08:15:37,042 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 48 [2025-01-09 08:15:37,042 INFO L210 NwaCegarLoop]: Found error trace [2025-01-09 08:15:37,042 INFO L218 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-01-09 08:15:37,042 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable6 [2025-01-09 08:15:37,042 INFO L396 AbstractCegarLoop]: === Iteration 8 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-01-09 08:15:37,043 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-01-09 08:15:37,043 INFO L85 PathProgramCache]: Analyzing trace with hash -1691991601, now seen corresponding path program 1 times [2025-01-09 08:15:37,043 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-01-09 08:15:37,043 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1898030786] [2025-01-09 08:15:37,043 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-01-09 08:15:37,043 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-01-09 08:15:37,057 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 47 statements into 1 equivalence classes. [2025-01-09 08:15:37,062 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 47 of 47 statements. [2025-01-09 08:15:37,062 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-01-09 08:15:37,062 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-01-09 08:15:37,184 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-01-09 08:15:37,186 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-01-09 08:15:37,186 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1898030786] [2025-01-09 08:15:37,186 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1898030786] provided 1 perfect and 0 imperfect interpolant sequences [2025-01-09 08:15:37,186 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-01-09 08:15:37,186 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2025-01-09 08:15:37,186 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1775896794] [2025-01-09 08:15:37,186 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-01-09 08:15:37,186 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2025-01-09 08:15:37,187 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-01-09 08:15:37,187 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2025-01-09 08:15:37,187 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=10, Invalid=20, Unknown=0, NotChecked=0, Total=30 [2025-01-09 08:15:37,187 INFO L87 Difference]: Start difference. First operand 164 states and 233 transitions. Second operand has 6 states, 6 states have (on average 7.833333333333333) internal successors, (47), 6 states have internal predecessors, (47), 0 states have call successors, (0), 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-01-09 08:15:37,398 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-01-09 08:15:37,399 INFO L93 Difference]: Finished difference Result 284 states and 397 transitions. [2025-01-09 08:15:37,399 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2025-01-09 08:15:37,399 INFO L78 Accepts]: Start accepts. Automaton has has 6 states, 6 states have (on average 7.833333333333333) internal successors, (47), 6 states have internal predecessors, (47), 0 states have call successors, (0), 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 47 [2025-01-09 08:15:37,400 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-01-09 08:15:37,400 INFO L225 Difference]: With dead ends: 284 [2025-01-09 08:15:37,401 INFO L226 Difference]: Without dead ends: 176 [2025-01-09 08:15:37,401 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-01-09 08:15:37,402 INFO L435 NwaCegarLoop]: 193 mSDtfsCounter, 202 mSDsluCounter, 437 mSDsCounter, 0 mSdLazyCounter, 186 mSolverCounterSat, 1 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 202 SdHoareTripleChecker+Valid, 630 SdHoareTripleChecker+Invalid, 187 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 1 IncrementalHoareTripleChecker+Valid, 186 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.2s IncrementalHoareTripleChecker+Time [2025-01-09 08:15:37,402 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [202 Valid, 630 Invalid, 187 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [1 Valid, 186 Invalid, 0 Unknown, 0 Unchecked, 0.2s Time] [2025-01-09 08:15:37,403 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 176 states. [2025-01-09 08:15:37,405 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 176 to 166. [2025-01-09 08:15:37,406 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 166 states, 165 states have (on average 1.4242424242424243) internal successors, (235), 165 states have internal predecessors, (235), 0 states have call successors, (0), 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-01-09 08:15:37,406 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 166 states to 166 states and 235 transitions. [2025-01-09 08:15:37,407 INFO L78 Accepts]: Start accepts. Automaton has 166 states and 235 transitions. Word has length 47 [2025-01-09 08:15:37,407 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-01-09 08:15:37,407 INFO L471 AbstractCegarLoop]: Abstraction has 166 states and 235 transitions. [2025-01-09 08:15:37,408 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 6 states have (on average 7.833333333333333) internal successors, (47), 6 states have internal predecessors, (47), 0 states have call successors, (0), 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-01-09 08:15:37,408 INFO L276 IsEmpty]: Start isEmpty. Operand 166 states and 235 transitions. [2025-01-09 08:15:37,408 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 90 [2025-01-09 08:15:37,410 INFO L210 NwaCegarLoop]: Found error trace [2025-01-09 08:15:37,410 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, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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-01-09 08:15:37,410 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable7 [2025-01-09 08:15:37,410 INFO L396 AbstractCegarLoop]: === Iteration 9 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-01-09 08:15:37,411 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-01-09 08:15:37,411 INFO L85 PathProgramCache]: Analyzing trace with hash -19459059, now seen corresponding path program 1 times [2025-01-09 08:15:37,411 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-01-09 08:15:37,411 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1532991270] [2025-01-09 08:15:37,411 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-01-09 08:15:37,411 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-01-09 08:15:37,454 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 89 statements into 1 equivalence classes. [2025-01-09 08:15:37,671 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 89 of 89 statements. [2025-01-09 08:15:37,671 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-01-09 08:15:37,671 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-01-09 08:15:38,226 INFO L134 CoverageAnalysis]: Checked inductivity of 13 backedges. 11 proven. 2 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-01-09 08:15:38,227 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-01-09 08:15:38,227 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1532991270] [2025-01-09 08:15:38,227 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1532991270] provided 0 perfect and 1 imperfect interpolant sequences [2025-01-09 08:15:38,227 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1266880980] [2025-01-09 08:15:38,227 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-01-09 08:15:38,227 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-01-09 08:15:38,227 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 [2025-01-09 08:15:38,230 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-01-09 08:15:38,232 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-01-09 08:15:38,411 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 89 statements into 1 equivalence classes. [2025-01-09 08:15:38,541 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 89 of 89 statements. [2025-01-09 08:15:38,541 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-01-09 08:15:38,541 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-01-09 08:15:38,548 INFO L256 TraceCheckSpWp]: Trace formula consists of 848 conjuncts, 42 conjuncts are in the unsatisfiable core [2025-01-09 08:15:38,557 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-01-09 08:15:38,892 INFO L134 CoverageAnalysis]: Checked inductivity of 13 backedges. 13 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-01-09 08:15:38,892 INFO L308 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2025-01-09 08:15:38,892 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1266880980] provided 1 perfect and 0 imperfect interpolant sequences [2025-01-09 08:15:38,892 INFO L185 FreeRefinementEngine]: Found 1 perfect and 1 imperfect interpolant sequences. [2025-01-09 08:15:38,892 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [6] total 9 [2025-01-09 08:15:38,892 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [926315956] [2025-01-09 08:15:38,893 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-01-09 08:15:38,893 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2025-01-09 08:15:38,894 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-01-09 08:15:38,894 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2025-01-09 08:15:38,894 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=16, Invalid=56, Unknown=0, NotChecked=0, Total=72 [2025-01-09 08:15:38,894 INFO L87 Difference]: Start difference. First operand 166 states and 235 transitions. Second operand has 5 states, 5 states have (on average 17.8) internal successors, (89), 5 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-01-09 08:15:39,204 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-01-09 08:15:39,204 INFO L93 Difference]: Finished difference Result 287 states and 401 transitions. [2025-01-09 08:15:39,204 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2025-01-09 08:15:39,204 INFO L78 Accepts]: Start accepts. Automaton has has 5 states, 5 states have (on average 17.8) internal successors, (89), 5 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) Word has length 89 [2025-01-09 08:15:39,205 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-01-09 08:15:39,206 INFO L225 Difference]: With dead ends: 287 [2025-01-09 08:15:39,206 INFO L226 Difference]: Without dead ends: 179 [2025-01-09 08:15:39,207 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 96 GetRequests, 87 SyntacticMatches, 0 SemanticMatches, 9 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 3 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=26, Invalid=84, Unknown=0, NotChecked=0, Total=110 [2025-01-09 08:15:39,207 INFO L435 NwaCegarLoop]: 55 mSDtfsCounter, 196 mSDsluCounter, 107 mSDsCounter, 0 mSdLazyCounter, 450 mSolverCounterSat, 1 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 196 SdHoareTripleChecker+Valid, 162 SdHoareTripleChecker+Invalid, 451 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 1 IncrementalHoareTripleChecker+Valid, 450 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.3s IncrementalHoareTripleChecker+Time [2025-01-09 08:15:39,207 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [196 Valid, 162 Invalid, 451 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [1 Valid, 450 Invalid, 0 Unknown, 0 Unchecked, 0.3s Time] [2025-01-09 08:15:39,208 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 179 states. [2025-01-09 08:15:39,211 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 179 to 178. [2025-01-09 08:15:39,211 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 178 states, 177 states have (on average 1.3954802259887005) internal successors, (247), 177 states have internal predecessors, (247), 0 states have call successors, (0), 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-01-09 08:15:39,211 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 178 states to 178 states and 247 transitions. [2025-01-09 08:15:39,212 INFO L78 Accepts]: Start accepts. Automaton has 178 states and 247 transitions. Word has length 89 [2025-01-09 08:15:39,212 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-01-09 08:15:39,212 INFO L471 AbstractCegarLoop]: Abstraction has 178 states and 247 transitions. [2025-01-09 08:15:39,212 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 17.8) internal successors, (89), 5 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-01-09 08:15:39,212 INFO L276 IsEmpty]: Start isEmpty. Operand 178 states and 247 transitions. [2025-01-09 08:15:39,213 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 92 [2025-01-09 08:15:39,213 INFO L210 NwaCegarLoop]: Found error trace [2025-01-09 08:15:39,213 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, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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-01-09 08:15:39,226 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-01-09 08:15:39,418 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-01-09 08:15:39,418 INFO L396 AbstractCegarLoop]: === Iteration 10 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-01-09 08:15:39,419 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-01-09 08:15:39,419 INFO L85 PathProgramCache]: Analyzing trace with hash 1705407056, now seen corresponding path program 1 times [2025-01-09 08:15:39,419 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-01-09 08:15:39,419 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1373519288] [2025-01-09 08:15:39,419 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-01-09 08:15:39,419 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-01-09 08:15:39,466 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 91 statements into 1 equivalence classes. [2025-01-09 08:15:39,676 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 91 of 91 statements. [2025-01-09 08:15:39,676 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-01-09 08:15:39,676 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-01-09 08:15:40,099 INFO L134 CoverageAnalysis]: Checked inductivity of 13 backedges. 13 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-01-09 08:15:40,099 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-01-09 08:15:40,100 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1373519288] [2025-01-09 08:15:40,100 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1373519288] provided 1 perfect and 0 imperfect interpolant sequences [2025-01-09 08:15:40,100 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-01-09 08:15:40,100 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2025-01-09 08:15:40,100 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [86399320] [2025-01-09 08:15:40,100 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-01-09 08:15:40,100 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2025-01-09 08:15:40,100 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-01-09 08:15:40,100 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2025-01-09 08:15:40,100 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=10, Invalid=20, Unknown=0, NotChecked=0, Total=30 [2025-01-09 08:15:40,101 INFO L87 Difference]: Start difference. First operand 178 states and 247 transitions. Second operand has 6 states, 6 states have (on average 15.166666666666666) internal successors, (91), 6 states have internal predecessors, (91), 0 states have call successors, (0), 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-01-09 08:15:40,423 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-01-09 08:15:40,423 INFO L93 Difference]: Finished difference Result 324 states and 454 transitions. [2025-01-09 08:15:40,423 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2025-01-09 08:15:40,424 INFO L78 Accepts]: Start accepts. Automaton has has 6 states, 6 states have (on average 15.166666666666666) internal successors, (91), 6 states have internal predecessors, (91), 0 states have call successors, (0), 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 91 [2025-01-09 08:15:40,424 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-01-09 08:15:40,425 INFO L225 Difference]: With dead ends: 324 [2025-01-09 08:15:40,425 INFO L226 Difference]: Without dead ends: 216 [2025-01-09 08:15:40,425 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 10 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 8 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 5 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=33, Invalid=57, Unknown=0, NotChecked=0, Total=90 [2025-01-09 08:15:40,425 INFO L435 NwaCegarLoop]: 154 mSDtfsCounter, 300 mSDsluCounter, 292 mSDsCounter, 0 mSdLazyCounter, 368 mSolverCounterSat, 1 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 300 SdHoareTripleChecker+Valid, 446 SdHoareTripleChecker+Invalid, 369 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 1 IncrementalHoareTripleChecker+Valid, 368 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.3s IncrementalHoareTripleChecker+Time [2025-01-09 08:15:40,426 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [300 Valid, 446 Invalid, 369 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [1 Valid, 368 Invalid, 0 Unknown, 0 Unchecked, 0.3s Time] [2025-01-09 08:15:40,426 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 216 states. [2025-01-09 08:15:40,428 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 216 to 189. [2025-01-09 08:15:40,429 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 189 states, 188 states have (on average 1.3936170212765957) internal successors, (262), 188 states have internal predecessors, (262), 0 states have call successors, (0), 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-01-09 08:15:40,429 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 189 states to 189 states and 262 transitions. [2025-01-09 08:15:40,429 INFO L78 Accepts]: Start accepts. Automaton has 189 states and 262 transitions. Word has length 91 [2025-01-09 08:15:40,429 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-01-09 08:15:40,429 INFO L471 AbstractCegarLoop]: Abstraction has 189 states and 262 transitions. [2025-01-09 08:15:40,430 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 6 states have (on average 15.166666666666666) internal successors, (91), 6 states have internal predecessors, (91), 0 states have call successors, (0), 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-01-09 08:15:40,430 INFO L276 IsEmpty]: Start isEmpty. Operand 189 states and 262 transitions. [2025-01-09 08:15:40,430 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 93 [2025-01-09 08:15:40,430 INFO L210 NwaCegarLoop]: Found error trace [2025-01-09 08:15:40,430 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, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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-01-09 08:15:40,430 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable9 [2025-01-09 08:15:40,430 INFO L396 AbstractCegarLoop]: === Iteration 11 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-01-09 08:15:40,431 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-01-09 08:15:40,431 INFO L85 PathProgramCache]: Analyzing trace with hash 1779479355, now seen corresponding path program 1 times [2025-01-09 08:15:40,431 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-01-09 08:15:40,431 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1261709732] [2025-01-09 08:15:40,431 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-01-09 08:15:40,431 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-01-09 08:15:40,464 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 92 statements into 1 equivalence classes. [2025-01-09 08:15:40,575 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 92 of 92 statements. [2025-01-09 08:15:40,575 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-01-09 08:15:40,575 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-01-09 08:15:40,996 INFO L134 CoverageAnalysis]: Checked inductivity of 13 backedges. 13 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-01-09 08:15:40,996 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-01-09 08:15:40,996 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1261709732] [2025-01-09 08:15:40,996 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1261709732] provided 1 perfect and 0 imperfect interpolant sequences [2025-01-09 08:15:40,996 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-01-09 08:15:40,996 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2025-01-09 08:15:40,996 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [100281273] [2025-01-09 08:15:40,997 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-01-09 08:15:40,997 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2025-01-09 08:15:40,997 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-01-09 08:15:40,997 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2025-01-09 08:15:40,997 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=10, Invalid=20, Unknown=0, NotChecked=0, Total=30 [2025-01-09 08:15:40,998 INFO L87 Difference]: Start difference. First operand 189 states and 262 transitions. Second operand has 6 states, 6 states have (on average 15.333333333333334) internal successors, (92), 6 states have internal predecessors, (92), 0 states have call successors, (0), 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-01-09 08:15:41,263 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-01-09 08:15:41,263 INFO L93 Difference]: Finished difference Result 340 states and 477 transitions. [2025-01-09 08:15:41,264 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2025-01-09 08:15:41,264 INFO L78 Accepts]: Start accepts. Automaton has has 6 states, 6 states have (on average 15.333333333333334) internal successors, (92), 6 states have internal predecessors, (92), 0 states have call successors, (0), 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 92 [2025-01-09 08:15:41,264 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-01-09 08:15:41,265 INFO L225 Difference]: With dead ends: 340 [2025-01-09 08:15:41,265 INFO L226 Difference]: Without dead ends: 232 [2025-01-09 08:15:41,265 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 10 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 8 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 5 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=33, Invalid=57, Unknown=0, NotChecked=0, Total=90 [2025-01-09 08:15:41,265 INFO L435 NwaCegarLoop]: 141 mSDtfsCounter, 396 mSDsluCounter, 250 mSDsCounter, 0 mSdLazyCounter, 234 mSolverCounterSat, 1 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 396 SdHoareTripleChecker+Valid, 391 SdHoareTripleChecker+Invalid, 235 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 1 IncrementalHoareTripleChecker+Valid, 234 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.2s IncrementalHoareTripleChecker+Time [2025-01-09 08:15:41,266 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [396 Valid, 391 Invalid, 235 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [1 Valid, 234 Invalid, 0 Unknown, 0 Unchecked, 0.2s Time] [2025-01-09 08:15:41,266 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 232 states. [2025-01-09 08:15:41,274 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 232 to 209. [2025-01-09 08:15:41,275 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 209 states, 208 states have (on average 1.3990384615384615) internal successors, (291), 208 states have internal predecessors, (291), 0 states have call successors, (0), 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-01-09 08:15:41,276 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 209 states to 209 states and 291 transitions. [2025-01-09 08:15:41,276 INFO L78 Accepts]: Start accepts. Automaton has 209 states and 291 transitions. Word has length 92 [2025-01-09 08:15:41,276 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-01-09 08:15:41,276 INFO L471 AbstractCegarLoop]: Abstraction has 209 states and 291 transitions. [2025-01-09 08:15:41,277 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 6 states have (on average 15.333333333333334) internal successors, (92), 6 states have internal predecessors, (92), 0 states have call successors, (0), 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-01-09 08:15:41,277 INFO L276 IsEmpty]: Start isEmpty. Operand 209 states and 291 transitions. [2025-01-09 08:15:41,277 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 94 [2025-01-09 08:15:41,277 INFO L210 NwaCegarLoop]: Found error trace [2025-01-09 08:15:41,278 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, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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-01-09 08:15:41,278 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable10 [2025-01-09 08:15:41,278 INFO L396 AbstractCegarLoop]: === Iteration 12 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-01-09 08:15:41,278 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-01-09 08:15:41,278 INFO L85 PathProgramCache]: Analyzing trace with hash 2142078003, now seen corresponding path program 1 times [2025-01-09 08:15:41,278 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-01-09 08:15:41,279 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1389768034] [2025-01-09 08:15:41,279 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-01-09 08:15:41,279 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-01-09 08:15:41,340 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 93 statements into 1 equivalence classes. [2025-01-09 08:15:41,592 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 93 of 93 statements. [2025-01-09 08:15:41,592 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-01-09 08:15:41,592 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-01-09 08:15:42,421 INFO L134 CoverageAnalysis]: Checked inductivity of 13 backedges. 13 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-01-09 08:15:42,421 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-01-09 08:15:42,421 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1389768034] [2025-01-09 08:15:42,421 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1389768034] provided 1 perfect and 0 imperfect interpolant sequences [2025-01-09 08:15:42,421 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-01-09 08:15:42,421 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [10] imperfect sequences [] total 10 [2025-01-09 08:15:42,421 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2036544918] [2025-01-09 08:15:42,422 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-01-09 08:15:42,422 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 10 states [2025-01-09 08:15:42,422 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-01-09 08:15:42,422 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 10 interpolants. [2025-01-09 08:15:42,423 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=26, Invalid=64, Unknown=0, NotChecked=0, Total=90 [2025-01-09 08:15:42,423 INFO L87 Difference]: Start difference. First operand 209 states and 291 transitions. Second operand has 10 states, 10 states have (on average 9.3) internal successors, (93), 10 states have internal predecessors, (93), 0 states have call successors, (0), 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-01-09 08:15:43,222 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-01-09 08:15:43,222 INFO L93 Difference]: Finished difference Result 438 states and 613 transitions. [2025-01-09 08:15:43,223 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 10 states. [2025-01-09 08:15:43,223 INFO L78 Accepts]: Start accepts. Automaton has has 10 states, 10 states have (on average 9.3) internal successors, (93), 10 states have internal predecessors, (93), 0 states have call successors, (0), 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 93 [2025-01-09 08:15:43,223 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-01-09 08:15:43,224 INFO L225 Difference]: With dead ends: 438 [2025-01-09 08:15:43,224 INFO L226 Difference]: Without dead ends: 330 [2025-01-09 08:15:43,225 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 12 GetRequests, 3 SyntacticMatches, 0 SemanticMatches, 9 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 4 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=31, Invalid=79, Unknown=0, NotChecked=0, Total=110 [2025-01-09 08:15:43,225 INFO L435 NwaCegarLoop]: 71 mSDtfsCounter, 280 mSDsluCounter, 469 mSDsCounter, 0 mSdLazyCounter, 1176 mSolverCounterSat, 2 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.6s Time, 0 mProtectedPredicate, 0 mProtectedAction, 280 SdHoareTripleChecker+Valid, 540 SdHoareTripleChecker+Invalid, 1178 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 2 IncrementalHoareTripleChecker+Valid, 1176 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.8s IncrementalHoareTripleChecker+Time [2025-01-09 08:15:43,225 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [280 Valid, 540 Invalid, 1178 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [2 Valid, 1176 Invalid, 0 Unknown, 0 Unchecked, 0.8s Time] [2025-01-09 08:15:43,226 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 330 states. [2025-01-09 08:15:43,235 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 330 to 292. [2025-01-09 08:15:43,235 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 292 states, 291 states have (on average 1.4123711340206186) internal successors, (411), 291 states have internal predecessors, (411), 0 states have call successors, (0), 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-01-09 08:15:43,236 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 292 states to 292 states and 411 transitions. [2025-01-09 08:15:43,236 INFO L78 Accepts]: Start accepts. Automaton has 292 states and 411 transitions. Word has length 93 [2025-01-09 08:15:43,236 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-01-09 08:15:43,237 INFO L471 AbstractCegarLoop]: Abstraction has 292 states and 411 transitions. [2025-01-09 08:15:43,237 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 10 states, 10 states have (on average 9.3) internal successors, (93), 10 states have internal predecessors, (93), 0 states have call successors, (0), 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-01-09 08:15:43,237 INFO L276 IsEmpty]: Start isEmpty. Operand 292 states and 411 transitions. [2025-01-09 08:15:43,237 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 95 [2025-01-09 08:15:43,239 INFO L210 NwaCegarLoop]: Found error trace [2025-01-09 08:15:43,239 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, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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-01-09 08:15:43,239 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable11 [2025-01-09 08:15:43,240 INFO L396 AbstractCegarLoop]: === Iteration 13 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-01-09 08:15:43,240 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-01-09 08:15:43,240 INFO L85 PathProgramCache]: Analyzing trace with hash -1200865215, now seen corresponding path program 1 times [2025-01-09 08:15:43,240 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-01-09 08:15:43,240 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [512750287] [2025-01-09 08:15:43,241 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-01-09 08:15:43,242 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-01-09 08:15:43,297 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 94 statements into 1 equivalence classes. [2025-01-09 08:15:43,484 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 94 of 94 statements. [2025-01-09 08:15:43,484 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-01-09 08:15:43,485 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-01-09 08:15:44,153 INFO L134 CoverageAnalysis]: Checked inductivity of 13 backedges. 13 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-01-09 08:15:44,153 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-01-09 08:15:44,153 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [512750287] [2025-01-09 08:15:44,153 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [512750287] provided 1 perfect and 0 imperfect interpolant sequences [2025-01-09 08:15:44,153 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-01-09 08:15:44,153 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [10] imperfect sequences [] total 10 [2025-01-09 08:15:44,153 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [879801002] [2025-01-09 08:15:44,154 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-01-09 08:15:44,154 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 10 states [2025-01-09 08:15:44,154 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-01-09 08:15:44,154 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 10 interpolants. [2025-01-09 08:15:44,154 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=26, Invalid=64, Unknown=0, NotChecked=0, Total=90 [2025-01-09 08:15:44,155 INFO L87 Difference]: Start difference. First operand 292 states and 411 transitions. Second operand has 10 states, 10 states have (on average 9.4) internal successors, (94), 10 states have internal predecessors, (94), 0 states have call successors, (0), 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-01-09 08:15:45,043 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-01-09 08:15:45,044 INFO L93 Difference]: Finished difference Result 497 states and 697 transitions. [2025-01-09 08:15:45,044 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 10 states. [2025-01-09 08:15:45,044 INFO L78 Accepts]: Start accepts. Automaton has has 10 states, 10 states have (on average 9.4) internal successors, (94), 10 states have internal predecessors, (94), 0 states have call successors, (0), 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-01-09 08:15:45,044 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-01-09 08:15:45,046 INFO L225 Difference]: With dead ends: 497 [2025-01-09 08:15:45,046 INFO L226 Difference]: Without dead ends: 330 [2025-01-09 08:15:45,046 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 13 GetRequests, 4 SyntacticMatches, 0 SemanticMatches, 9 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 4 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=31, Invalid=79, Unknown=0, NotChecked=0, Total=110 [2025-01-09 08:15:45,047 INFO L435 NwaCegarLoop]: 77 mSDtfsCounter, 238 mSDsluCounter, 506 mSDsCounter, 0 mSdLazyCounter, 1204 mSolverCounterSat, 1 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.7s Time, 0 mProtectedPredicate, 0 mProtectedAction, 238 SdHoareTripleChecker+Valid, 583 SdHoareTripleChecker+Invalid, 1205 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 1 IncrementalHoareTripleChecker+Valid, 1204 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.8s IncrementalHoareTripleChecker+Time [2025-01-09 08:15:45,047 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [238 Valid, 583 Invalid, 1205 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [1 Valid, 1204 Invalid, 0 Unknown, 0 Unchecked, 0.8s Time] [2025-01-09 08:15:45,049 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 330 states. [2025-01-09 08:15:45,058 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 330 to 294. [2025-01-09 08:15:45,059 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 294 states, 293 states have (on average 1.4095563139931742) internal successors, (413), 293 states have internal predecessors, (413), 0 states have call successors, (0), 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-01-09 08:15:45,060 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 294 states to 294 states and 413 transitions. [2025-01-09 08:15:45,060 INFO L78 Accepts]: Start accepts. Automaton has 294 states and 413 transitions. Word has length 94 [2025-01-09 08:15:45,060 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-01-09 08:15:45,061 INFO L471 AbstractCegarLoop]: Abstraction has 294 states and 413 transitions. [2025-01-09 08:15:45,061 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 10 states, 10 states have (on average 9.4) internal successors, (94), 10 states have internal predecessors, (94), 0 states have call successors, (0), 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-01-09 08:15:45,061 INFO L276 IsEmpty]: Start isEmpty. Operand 294 states and 413 transitions. [2025-01-09 08:15:45,062 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 95 [2025-01-09 08:15:45,062 INFO L210 NwaCegarLoop]: Found error trace [2025-01-09 08:15:45,062 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, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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-01-09 08:15:45,062 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable12 [2025-01-09 08:15:45,062 INFO L396 AbstractCegarLoop]: === Iteration 14 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-01-09 08:15:45,063 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-01-09 08:15:45,063 INFO L85 PathProgramCache]: Analyzing trace with hash 930172023, now seen corresponding path program 1 times [2025-01-09 08:15:45,063 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-01-09 08:15:45,063 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [588891841] [2025-01-09 08:15:45,063 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-01-09 08:15:45,063 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-01-09 08:15:45,107 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 94 statements into 1 equivalence classes. [2025-01-09 08:15:45,297 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 94 of 94 statements. [2025-01-09 08:15:45,298 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-01-09 08:15:45,298 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-01-09 08:15:46,232 INFO L134 CoverageAnalysis]: Checked inductivity of 13 backedges. 11 proven. 2 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-01-09 08:15:46,232 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-01-09 08:15:46,233 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [588891841] [2025-01-09 08:15:46,233 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [588891841] provided 0 perfect and 1 imperfect interpolant sequences [2025-01-09 08:15:46,233 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1489701713] [2025-01-09 08:15:46,233 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-01-09 08:15:46,233 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-01-09 08:15:46,233 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 [2025-01-09 08:15:46,237 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-01-09 08:15:46,244 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-01-09 08:15:46,518 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 94 statements into 1 equivalence classes. [2025-01-09 08:15:46,684 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 94 of 94 statements. [2025-01-09 08:15:46,684 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-01-09 08:15:46,684 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-01-09 08:15:46,689 INFO L256 TraceCheckSpWp]: Trace formula consists of 861 conjuncts, 47 conjuncts are in the unsatisfiable core [2025-01-09 08:15:46,696 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-01-09 08:15:47,522 INFO L134 CoverageAnalysis]: Checked inductivity of 13 backedges. 9 proven. 4 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-01-09 08:15:47,522 INFO L312 TraceCheckSpWp]: Computing backward predicates... [2025-01-09 08:15:48,138 INFO L134 CoverageAnalysis]: Checked inductivity of 13 backedges. 9 proven. 4 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-01-09 08:15:48,138 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1489701713] provided 0 perfect and 2 imperfect interpolant sequences [2025-01-09 08:15:48,138 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2025-01-09 08:15:48,138 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [7, 12, 12] total 27 [2025-01-09 08:15:48,138 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1791278077] [2025-01-09 08:15:48,138 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2025-01-09 08:15:48,139 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 27 states [2025-01-09 08:15:48,139 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-01-09 08:15:48,139 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 27 interpolants. [2025-01-09 08:15:48,141 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=100, Invalid=602, Unknown=0, NotChecked=0, Total=702 [2025-01-09 08:15:48,142 INFO L87 Difference]: Start difference. First operand 294 states and 413 transitions. Second operand has 27 states, 27 states have (on average 9.481481481481481) internal successors, (256), 27 states have internal predecessors, (256), 0 states have call successors, (0), 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-01-09 08:15:51,182 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-01-09 08:15:51,182 INFO L93 Difference]: Finished difference Result 743 states and 1042 transitions. [2025-01-09 08:15:51,183 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 33 states. [2025-01-09 08:15:51,183 INFO L78 Accepts]: Start accepts. Automaton has has 27 states, 27 states have (on average 9.481481481481481) internal successors, (256), 27 states have internal predecessors, (256), 0 states have call successors, (0), 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-01-09 08:15:51,183 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-01-09 08:15:51,185 INFO L225 Difference]: With dead ends: 743 [2025-01-09 08:15:51,185 INFO L226 Difference]: Without dead ends: 574 [2025-01-09 08:15:51,187 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 224 GetRequests, 169 SyntacticMatches, 0 SemanticMatches, 55 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 500 ImplicationChecksByTransitivity, 1.5s TimeCoverageRelationStatistics Valid=476, Invalid=2716, Unknown=0, NotChecked=0, Total=3192 [2025-01-09 08:15:51,187 INFO L435 NwaCegarLoop]: 57 mSDtfsCounter, 1713 mSDsluCounter, 876 mSDsCounter, 0 mSdLazyCounter, 2894 mSolverCounterSat, 17 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 1.7s Time, 0 mProtectedPredicate, 0 mProtectedAction, 1713 SdHoareTripleChecker+Valid, 933 SdHoareTripleChecker+Invalid, 2911 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 17 IncrementalHoareTripleChecker+Valid, 2894 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 2.0s IncrementalHoareTripleChecker+Time [2025-01-09 08:15:51,187 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [1713 Valid, 933 Invalid, 2911 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [17 Valid, 2894 Invalid, 0 Unknown, 0 Unchecked, 2.0s Time] [2025-01-09 08:15:51,188 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 574 states. [2025-01-09 08:15:51,198 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 574 to 411. [2025-01-09 08:15:51,199 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 411 states, 410 states have (on average 1.424390243902439) internal successors, (584), 410 states have internal predecessors, (584), 0 states have call successors, (0), 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-01-09 08:15:51,200 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 411 states to 411 states and 584 transitions. [2025-01-09 08:15:51,200 INFO L78 Accepts]: Start accepts. Automaton has 411 states and 584 transitions. Word has length 94 [2025-01-09 08:15:51,200 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-01-09 08:15:51,200 INFO L471 AbstractCegarLoop]: Abstraction has 411 states and 584 transitions. [2025-01-09 08:15:51,200 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 27 states, 27 states have (on average 9.481481481481481) internal successors, (256), 27 states have internal predecessors, (256), 0 states have call successors, (0), 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-01-09 08:15:51,200 INFO L276 IsEmpty]: Start isEmpty. Operand 411 states and 584 transitions. [2025-01-09 08:15:51,202 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 97 [2025-01-09 08:15:51,205 INFO L210 NwaCegarLoop]: Found error trace [2025-01-09 08:15:51,205 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, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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-01-09 08:15:51,215 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-01-09 08:15:51,409 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable13,3 /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-01-09 08:15:51,409 INFO L396 AbstractCegarLoop]: === Iteration 15 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-01-09 08:15:51,410 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-01-09 08:15:51,410 INFO L85 PathProgramCache]: Analyzing trace with hash 1039264284, now seen corresponding path program 1 times [2025-01-09 08:15:51,410 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-01-09 08:15:51,410 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [198520589] [2025-01-09 08:15:51,410 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-01-09 08:15:51,410 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-01-09 08:15:51,442 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 96 statements into 1 equivalence classes. [2025-01-09 08:15:51,567 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 96 of 96 statements. [2025-01-09 08:15:51,567 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-01-09 08:15:51,567 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-01-09 08:15:52,558 INFO L134 CoverageAnalysis]: Checked inductivity of 13 backedges. 13 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-01-09 08:15:52,558 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-01-09 08:15:52,558 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [198520589] [2025-01-09 08:15:52,558 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [198520589] provided 1 perfect and 0 imperfect interpolant sequences [2025-01-09 08:15:52,558 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-01-09 08:15:52,558 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [9] imperfect sequences [] total 9 [2025-01-09 08:15:52,558 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [382853494] [2025-01-09 08:15:52,558 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-01-09 08:15:52,559 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 9 states [2025-01-09 08:15:52,559 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-01-09 08:15:52,559 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2025-01-09 08:15:52,559 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=15, Invalid=57, Unknown=0, NotChecked=0, Total=72 [2025-01-09 08:15:52,559 INFO L87 Difference]: Start difference. First operand 411 states and 584 transitions. Second operand has 9 states, 9 states have (on average 10.666666666666666) internal successors, (96), 9 states have internal predecessors, (96), 0 states have call successors, (0), 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-01-09 08:15:53,041 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-01-09 08:15:53,041 INFO L93 Difference]: Finished difference Result 690 states and 982 transitions. [2025-01-09 08:15:53,041 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 10 states. [2025-01-09 08:15:53,042 INFO L78 Accepts]: Start accepts. Automaton has has 9 states, 9 states have (on average 10.666666666666666) internal successors, (96), 9 states have internal predecessors, (96), 0 states have call successors, (0), 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-01-09 08:15:53,042 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-01-09 08:15:53,047 INFO L225 Difference]: With dead ends: 690 [2025-01-09 08:15:53,047 INFO L226 Difference]: Without dead ends: 412 [2025-01-09 08:15:53,048 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 17 GetRequests, 3 SyntacticMatches, 0 SemanticMatches, 14 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 20 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=46, Invalid=194, Unknown=0, NotChecked=0, Total=240 [2025-01-09 08:15:53,048 INFO L435 NwaCegarLoop]: 178 mSDtfsCounter, 211 mSDsluCounter, 544 mSDsCounter, 0 mSdLazyCounter, 706 mSolverCounterSat, 1 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.3s Time, 0 mProtectedPredicate, 0 mProtectedAction, 211 SdHoareTripleChecker+Valid, 722 SdHoareTripleChecker+Invalid, 707 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 1 IncrementalHoareTripleChecker+Valid, 706 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.4s IncrementalHoareTripleChecker+Time [2025-01-09 08:15:53,050 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [211 Valid, 722 Invalid, 707 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [1 Valid, 706 Invalid, 0 Unknown, 0 Unchecked, 0.4s Time] [2025-01-09 08:15:53,051 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 412 states. [2025-01-09 08:15:53,060 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 412 to 411. [2025-01-09 08:15:53,065 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 411 states, 410 states have (on average 1.421951219512195) internal successors, (583), 410 states have internal predecessors, (583), 0 states have call successors, (0), 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-01-09 08:15:53,066 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 411 states to 411 states and 583 transitions. [2025-01-09 08:15:53,067 INFO L78 Accepts]: Start accepts. Automaton has 411 states and 583 transitions. Word has length 96 [2025-01-09 08:15:53,067 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-01-09 08:15:53,067 INFO L471 AbstractCegarLoop]: Abstraction has 411 states and 583 transitions. [2025-01-09 08:15:53,067 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 9 states, 9 states have (on average 10.666666666666666) internal successors, (96), 9 states have internal predecessors, (96), 0 states have call successors, (0), 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-01-09 08:15:53,067 INFO L276 IsEmpty]: Start isEmpty. Operand 411 states and 583 transitions. [2025-01-09 08:15:53,069 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 98 [2025-01-09 08:15:53,069 INFO L210 NwaCegarLoop]: Found error trace [2025-01-09 08:15:53,071 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, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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-01-09 08:15:53,071 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable14 [2025-01-09 08:15:53,071 INFO L396 AbstractCegarLoop]: === Iteration 16 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-01-09 08:15:53,074 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-01-09 08:15:53,074 INFO L85 PathProgramCache]: Analyzing trace with hash 643304280, now seen corresponding path program 1 times [2025-01-09 08:15:53,074 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-01-09 08:15:53,074 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1461644387] [2025-01-09 08:15:53,074 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-01-09 08:15:53,074 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-01-09 08:15:53,104 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 97 statements into 1 equivalence classes. [2025-01-09 08:15:53,279 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 97 of 97 statements. [2025-01-09 08:15:53,280 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-01-09 08:15:53,280 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-01-09 08:15:54,078 INFO L134 CoverageAnalysis]: Checked inductivity of 13 backedges. 9 proven. 4 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-01-09 08:15:54,078 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-01-09 08:15:54,078 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1461644387] [2025-01-09 08:15:54,078 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1461644387] provided 0 perfect and 1 imperfect interpolant sequences [2025-01-09 08:15:54,078 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1566806703] [2025-01-09 08:15:54,078 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-01-09 08:15:54,079 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-01-09 08:15:54,079 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 [2025-01-09 08:15:54,080 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-01-09 08:15:54,082 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-01-09 08:15:54,296 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 97 statements into 1 equivalence classes. [2025-01-09 08:15:54,449 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 97 of 97 statements. [2025-01-09 08:15:54,449 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-01-09 08:15:54,449 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-01-09 08:15:54,455 INFO L256 TraceCheckSpWp]: Trace formula consists of 864 conjuncts, 131 conjuncts are in the unsatisfiable core [2025-01-09 08:15:54,462 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-01-09 08:15:55,562 INFO L134 CoverageAnalysis]: Checked inductivity of 13 backedges. 9 proven. 4 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-01-09 08:15:55,562 INFO L312 TraceCheckSpWp]: Computing backward predicates... [2025-01-09 08:15:57,017 INFO L134 CoverageAnalysis]: Checked inductivity of 13 backedges. 5 proven. 8 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-01-09 08:15:57,017 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1566806703] provided 0 perfect and 2 imperfect interpolant sequences [2025-01-09 08:15:57,017 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2025-01-09 08:15:57,017 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [9, 20, 20] total 45 [2025-01-09 08:15:57,018 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [247342190] [2025-01-09 08:15:57,018 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2025-01-09 08:15:57,018 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 45 states [2025-01-09 08:15:57,018 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-01-09 08:15:57,019 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 45 interpolants. [2025-01-09 08:15:57,019 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=274, Invalid=1706, Unknown=0, NotChecked=0, Total=1980 [2025-01-09 08:15:57,020 INFO L87 Difference]: Start difference. First operand 411 states and 583 transitions. Second operand has 45 states, 45 states have (on average 6.044444444444444) internal successors, (272), 45 states have internal predecessors, (272), 0 states have call successors, (0), 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-01-09 08:15:59,233 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-01-09 08:15:59,233 INFO L93 Difference]: Finished difference Result 741 states and 1049 transitions. [2025-01-09 08:15:59,234 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 28 states. [2025-01-09 08:15:59,234 INFO L78 Accepts]: Start accepts. Automaton has has 45 states, 45 states have (on average 6.044444444444444) internal successors, (272), 45 states have internal predecessors, (272), 0 states have call successors, (0), 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 97 [2025-01-09 08:15:59,234 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-01-09 08:15:59,235 INFO L225 Difference]: With dead ends: 741 [2025-01-09 08:15:59,235 INFO L226 Difference]: Without dead ends: 405 [2025-01-09 08:15:59,237 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 216 GetRequests, 159 SyntacticMatches, 0 SemanticMatches, 57 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1015 ImplicationChecksByTransitivity, 1.2s TimeCoverageRelationStatistics Valid=464, Invalid=2958, Unknown=0, NotChecked=0, Total=3422 [2025-01-09 08:15:59,239 INFO L435 NwaCegarLoop]: 44 mSDtfsCounter, 511 mSDsluCounter, 984 mSDsCounter, 0 mSdLazyCounter, 3748 mSolverCounterSat, 9 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 1.6s Time, 0 mProtectedPredicate, 0 mProtectedAction, 511 SdHoareTripleChecker+Valid, 1028 SdHoareTripleChecker+Invalid, 3757 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 9 IncrementalHoareTripleChecker+Valid, 3748 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 1.8s IncrementalHoareTripleChecker+Time [2025-01-09 08:15:59,239 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [511 Valid, 1028 Invalid, 3757 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [9 Valid, 3748 Invalid, 0 Unknown, 0 Unchecked, 1.8s Time] [2025-01-09 08:15:59,240 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 405 states. [2025-01-09 08:15:59,244 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 405 to 385. [2025-01-09 08:15:59,245 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 385 states, 384 states have (on average 1.4140625) internal successors, (543), 384 states have internal predecessors, (543), 0 states have call successors, (0), 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-01-09 08:15:59,246 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 385 states to 385 states and 543 transitions. [2025-01-09 08:15:59,246 INFO L78 Accepts]: Start accepts. Automaton has 385 states and 543 transitions. Word has length 97 [2025-01-09 08:15:59,246 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-01-09 08:15:59,246 INFO L471 AbstractCegarLoop]: Abstraction has 385 states and 543 transitions. [2025-01-09 08:15:59,246 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 45 states, 45 states have (on average 6.044444444444444) internal successors, (272), 45 states have internal predecessors, (272), 0 states have call successors, (0), 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-01-09 08:15:59,247 INFO L276 IsEmpty]: Start isEmpty. Operand 385 states and 543 transitions. [2025-01-09 08:15:59,248 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 142 [2025-01-09 08:15:59,248 INFO L210 NwaCegarLoop]: Found error trace [2025-01-09 08:15:59,249 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, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-01-09 08:15:59,261 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-01-09 08:15:59,453 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable15,4 /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-01-09 08:15:59,453 INFO L396 AbstractCegarLoop]: === Iteration 17 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-01-09 08:15:59,455 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-01-09 08:15:59,455 INFO L85 PathProgramCache]: Analyzing trace with hash -911423619, now seen corresponding path program 1 times [2025-01-09 08:15:59,455 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-01-09 08:15:59,455 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1452369071] [2025-01-09 08:15:59,455 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-01-09 08:15:59,455 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-01-09 08:15:59,516 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 141 statements into 1 equivalence classes. [2025-01-09 08:16:00,048 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 141 of 141 statements. [2025-01-09 08:16:00,049 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-01-09 08:16:00,049 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-01-09 08:16:00,907 INFO L134 CoverageAnalysis]: Checked inductivity of 70 backedges. 70 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-01-09 08:16:00,907 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-01-09 08:16:00,907 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1452369071] [2025-01-09 08:16:00,908 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1452369071] provided 1 perfect and 0 imperfect interpolant sequences [2025-01-09 08:16:00,908 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-01-09 08:16:00,908 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [9] imperfect sequences [] total 9 [2025-01-09 08:16:00,908 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1449623097] [2025-01-09 08:16:00,908 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-01-09 08:16:00,908 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 9 states [2025-01-09 08:16:00,908 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-01-09 08:16:00,909 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2025-01-09 08:16:00,909 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=23, Invalid=49, Unknown=0, NotChecked=0, Total=72 [2025-01-09 08:16:00,909 INFO L87 Difference]: Start difference. First operand 385 states and 543 transitions. Second operand has 9 states, 9 states have (on average 15.666666666666666) internal successors, (141), 9 states have internal predecessors, (141), 0 states have call successors, (0), 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-01-09 08:16:01,427 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-01-09 08:16:01,428 INFO L93 Difference]: Finished difference Result 1073 states and 1533 transitions. [2025-01-09 08:16:01,428 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 14 states. [2025-01-09 08:16:01,428 INFO L78 Accepts]: Start accepts. Automaton has has 9 states, 9 states have (on average 15.666666666666666) internal successors, (141), 9 states have internal predecessors, (141), 0 states have call successors, (0), 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 141 [2025-01-09 08:16:01,428 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-01-09 08:16:01,430 INFO L225 Difference]: With dead ends: 1073 [2025-01-09 08:16:01,430 INFO L226 Difference]: Without dead ends: 846 [2025-01-09 08:16:01,431 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 16 GetRequests, 4 SyntacticMatches, 0 SemanticMatches, 12 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 16 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=52, Invalid=130, Unknown=0, NotChecked=0, Total=182 [2025-01-09 08:16:01,431 INFO L435 NwaCegarLoop]: 101 mSDtfsCounter, 344 mSDsluCounter, 393 mSDsCounter, 0 mSdLazyCounter, 1027 mSolverCounterSat, 1 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.4s Time, 0 mProtectedPredicate, 0 mProtectedAction, 344 SdHoareTripleChecker+Valid, 494 SdHoareTripleChecker+Invalid, 1028 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 1 IncrementalHoareTripleChecker+Valid, 1027 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.5s IncrementalHoareTripleChecker+Time [2025-01-09 08:16:01,431 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [344 Valid, 494 Invalid, 1028 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [1 Valid, 1027 Invalid, 0 Unknown, 0 Unchecked, 0.5s Time] [2025-01-09 08:16:01,433 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 846 states. [2025-01-09 08:16:01,441 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 846 to 625. [2025-01-09 08:16:01,442 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 625 states, 624 states have (on average 1.4150641025641026) internal successors, (883), 624 states have internal predecessors, (883), 0 states have call successors, (0), 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-01-09 08:16:01,443 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 625 states to 625 states and 883 transitions. [2025-01-09 08:16:01,443 INFO L78 Accepts]: Start accepts. Automaton has 625 states and 883 transitions. Word has length 141 [2025-01-09 08:16:01,444 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-01-09 08:16:01,444 INFO L471 AbstractCegarLoop]: Abstraction has 625 states and 883 transitions. [2025-01-09 08:16:01,444 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 9 states, 9 states have (on average 15.666666666666666) internal successors, (141), 9 states have internal predecessors, (141), 0 states have call successors, (0), 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-01-09 08:16:01,444 INFO L276 IsEmpty]: Start isEmpty. Operand 625 states and 883 transitions. [2025-01-09 08:16:01,445 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 143 [2025-01-09 08:16:01,445 INFO L210 NwaCegarLoop]: Found error trace [2025-01-09 08:16:01,446 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, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-01-09 08:16:01,446 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable16 [2025-01-09 08:16:01,446 INFO L396 AbstractCegarLoop]: === Iteration 18 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-01-09 08:16:01,446 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-01-09 08:16:01,446 INFO L85 PathProgramCache]: Analyzing trace with hash -467199913, now seen corresponding path program 1 times [2025-01-09 08:16:01,447 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-01-09 08:16:01,447 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2012675115] [2025-01-09 08:16:01,447 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-01-09 08:16:01,447 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-01-09 08:16:01,488 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 142 statements into 1 equivalence classes. [2025-01-09 08:16:01,896 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 142 of 142 statements. [2025-01-09 08:16:01,896 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-01-09 08:16:01,896 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-01-09 08:16:02,786 INFO L134 CoverageAnalysis]: Checked inductivity of 71 backedges. 71 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-01-09 08:16:02,787 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-01-09 08:16:02,787 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2012675115] [2025-01-09 08:16:02,787 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [2012675115] provided 1 perfect and 0 imperfect interpolant sequences [2025-01-09 08:16:02,787 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-01-09 08:16:02,787 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [8] imperfect sequences [] total 8 [2025-01-09 08:16:02,787 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1774050380] [2025-01-09 08:16:02,787 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-01-09 08:16:02,787 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 8 states [2025-01-09 08:16:02,788 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-01-09 08:16:02,788 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2025-01-09 08:16:02,788 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=21, Invalid=35, Unknown=0, NotChecked=0, Total=56 [2025-01-09 08:16:02,788 INFO L87 Difference]: Start difference. First operand 625 states and 883 transitions. Second operand has 8 states, 8 states have (on average 17.75) internal successors, (142), 8 states have internal predecessors, (142), 0 states have call successors, (0), 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-01-09 08:16:03,314 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-01-09 08:16:03,315 INFO L93 Difference]: Finished difference Result 1473 states and 2071 transitions. [2025-01-09 08:16:03,315 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2025-01-09 08:16:03,315 INFO L78 Accepts]: Start accepts. Automaton has has 8 states, 8 states have (on average 17.75) internal successors, (142), 8 states have internal predecessors, (142), 0 states have call successors, (0), 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 142 [2025-01-09 08:16:03,315 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-01-09 08:16:03,323 INFO L225 Difference]: With dead ends: 1473 [2025-01-09 08:16:03,323 INFO L226 Difference]: Without dead ends: 1033 [2025-01-09 08:16:03,324 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 12 GetRequests, 5 SyntacticMatches, 0 SemanticMatches, 7 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 3 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=26, Invalid=46, Unknown=0, NotChecked=0, Total=72 [2025-01-09 08:16:03,324 INFO L435 NwaCegarLoop]: 104 mSDtfsCounter, 279 mSDsluCounter, 450 mSDsCounter, 0 mSdLazyCounter, 1083 mSolverCounterSat, 1 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.4s Time, 0 mProtectedPredicate, 0 mProtectedAction, 279 SdHoareTripleChecker+Valid, 554 SdHoareTripleChecker+Invalid, 1084 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 1 IncrementalHoareTripleChecker+Valid, 1083 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.5s IncrementalHoareTripleChecker+Time [2025-01-09 08:16:03,327 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [279 Valid, 554 Invalid, 1084 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [1 Valid, 1083 Invalid, 0 Unknown, 0 Unchecked, 0.5s Time] [2025-01-09 08:16:03,328 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1033 states. [2025-01-09 08:16:03,346 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1033 to 701. [2025-01-09 08:16:03,351 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 701 states, 700 states have (on average 1.3957142857142857) internal successors, (977), 700 states have internal predecessors, (977), 0 states have call successors, (0), 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-01-09 08:16:03,352 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 701 states to 701 states and 977 transitions. [2025-01-09 08:16:03,360 INFO L78 Accepts]: Start accepts. Automaton has 701 states and 977 transitions. Word has length 142 [2025-01-09 08:16:03,360 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-01-09 08:16:03,360 INFO L471 AbstractCegarLoop]: Abstraction has 701 states and 977 transitions. [2025-01-09 08:16:03,360 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 8 states, 8 states have (on average 17.75) internal successors, (142), 8 states have internal predecessors, (142), 0 states have call successors, (0), 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-01-09 08:16:03,360 INFO L276 IsEmpty]: Start isEmpty. Operand 701 states and 977 transitions. [2025-01-09 08:16:03,362 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 144 [2025-01-09 08:16:03,362 INFO L210 NwaCegarLoop]: Found error trace [2025-01-09 08:16:03,362 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, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-01-09 08:16:03,362 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable17 [2025-01-09 08:16:03,362 INFO L396 AbstractCegarLoop]: === Iteration 19 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-01-09 08:16:03,362 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-01-09 08:16:03,362 INFO L85 PathProgramCache]: Analyzing trace with hash 1924255733, now seen corresponding path program 1 times [2025-01-09 08:16:03,362 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-01-09 08:16:03,362 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [286959055] [2025-01-09 08:16:03,363 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-01-09 08:16:03,363 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-01-09 08:16:03,469 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 143 statements into 1 equivalence classes. [2025-01-09 08:16:04,425 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 143 of 143 statements. [2025-01-09 08:16:04,426 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-01-09 08:16:04,426 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-01-09 08:16:05,415 INFO L134 CoverageAnalysis]: Checked inductivity of 72 backedges. 39 proven. 33 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-01-09 08:16:05,415 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-01-09 08:16:05,415 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [286959055] [2025-01-09 08:16:05,415 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [286959055] provided 0 perfect and 1 imperfect interpolant sequences [2025-01-09 08:16:05,415 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1265099178] [2025-01-09 08:16:05,416 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-01-09 08:16:05,416 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-01-09 08:16:05,416 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 [2025-01-09 08:16:05,417 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-01-09 08:16:05,419 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-01-09 08:16:05,748 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 143 statements into 1 equivalence classes. [2025-01-09 08:16:05,997 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 143 of 143 statements. [2025-01-09 08:16:05,997 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-01-09 08:16:05,997 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-01-09 08:16:06,004 INFO L256 TraceCheckSpWp]: Trace formula consists of 1472 conjuncts, 39 conjuncts are in the unsatisfiable core [2025-01-09 08:16:06,009 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-01-09 08:16:06,507 INFO L134 CoverageAnalysis]: Checked inductivity of 72 backedges. 56 proven. 16 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-01-09 08:16:06,507 INFO L312 TraceCheckSpWp]: Computing backward predicates... [2025-01-09 08:16:07,529 INFO L134 CoverageAnalysis]: Checked inductivity of 72 backedges. 52 proven. 20 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-01-09 08:16:07,529 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1265099178] provided 0 perfect and 2 imperfect interpolant sequences [2025-01-09 08:16:07,529 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2025-01-09 08:16:07,530 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [13, 11, 11] total 31 [2025-01-09 08:16:07,530 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [204040592] [2025-01-09 08:16:07,530 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2025-01-09 08:16:07,531 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 31 states [2025-01-09 08:16:07,531 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-01-09 08:16:07,531 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 31 interpolants. [2025-01-09 08:16:07,532 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=141, Invalid=789, Unknown=0, NotChecked=0, Total=930 [2025-01-09 08:16:07,532 INFO L87 Difference]: Start difference. First operand 701 states and 977 transitions. Second operand has 31 states, 31 states have (on average 11.741935483870968) internal successors, (364), 31 states have internal predecessors, (364), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-01-09 08:16:10,595 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-01-09 08:16:10,596 INFO L93 Difference]: Finished difference Result 2968 states and 4133 transitions. [2025-01-09 08:16:10,596 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 58 states. [2025-01-09 08:16:10,597 INFO L78 Accepts]: Start accepts. Automaton has has 31 states, 31 states have (on average 11.741935483870968) internal successors, (364), 31 states have internal predecessors, (364), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 143 [2025-01-09 08:16:10,597 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-01-09 08:16:10,612 INFO L225 Difference]: With dead ends: 2968 [2025-01-09 08:16:10,613 INFO L226 Difference]: Without dead ends: 2462 [2025-01-09 08:16:10,620 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 363 GetRequests, 286 SyntacticMatches, 0 SemanticMatches, 77 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1659 ImplicationChecksByTransitivity, 1.2s TimeCoverageRelationStatistics Valid=842, Invalid=5320, Unknown=0, NotChecked=0, Total=6162 [2025-01-09 08:16:10,621 INFO L435 NwaCegarLoop]: 84 mSDtfsCounter, 3480 mSDsluCounter, 1673 mSDsCounter, 0 mSdLazyCounter, 4793 mSolverCounterSat, 24 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 1.8s Time, 0 mProtectedPredicate, 0 mProtectedAction, 3480 SdHoareTripleChecker+Valid, 1757 SdHoareTripleChecker+Invalid, 4817 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 24 IncrementalHoareTripleChecker+Valid, 4793 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 2.2s IncrementalHoareTripleChecker+Time [2025-01-09 08:16:10,621 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [3480 Valid, 1757 Invalid, 4817 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [24 Valid, 4793 Invalid, 0 Unknown, 0 Unchecked, 2.2s Time] [2025-01-09 08:16:10,623 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 2462 states. [2025-01-09 08:16:10,689 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 2462 to 1618. [2025-01-09 08:16:10,699 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 1618 states, 1617 states have (on average 1.4044526901669758) internal successors, (2271), 1617 states have internal predecessors, (2271), 0 states have call successors, (0), 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-01-09 08:16:10,703 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1618 states to 1618 states and 2271 transitions. [2025-01-09 08:16:10,707 INFO L78 Accepts]: Start accepts. Automaton has 1618 states and 2271 transitions. Word has length 143 [2025-01-09 08:16:10,707 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-01-09 08:16:10,707 INFO L471 AbstractCegarLoop]: Abstraction has 1618 states and 2271 transitions. [2025-01-09 08:16:10,708 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 31 states, 31 states have (on average 11.741935483870968) internal successors, (364), 31 states have internal predecessors, (364), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-01-09 08:16:10,708 INFO L276 IsEmpty]: Start isEmpty. Operand 1618 states and 2271 transitions. [2025-01-09 08:16:10,715 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 146 [2025-01-09 08:16:10,718 INFO L210 NwaCegarLoop]: Found error trace [2025-01-09 08:16:10,719 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, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-01-09 08:16:10,743 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-01-09 08:16:10,919 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable18,5 /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-01-09 08:16:10,919 INFO L396 AbstractCegarLoop]: === Iteration 20 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-01-09 08:16:10,920 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-01-09 08:16:10,920 INFO L85 PathProgramCache]: Analyzing trace with hash 69313758, now seen corresponding path program 1 times [2025-01-09 08:16:10,920 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-01-09 08:16:10,920 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1739405931] [2025-01-09 08:16:10,920 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-01-09 08:16:10,920 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-01-09 08:16:11,013 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 145 statements into 1 equivalence classes. [2025-01-09 08:16:12,411 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 145 of 145 statements. [2025-01-09 08:16:12,412 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-01-09 08:16:12,412 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-01-09 08:16:15,029 INFO L134 CoverageAnalysis]: Checked inductivity of 73 backedges. 73 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-01-09 08:16:15,029 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-01-09 08:16:15,030 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1739405931] [2025-01-09 08:16:15,030 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1739405931] provided 1 perfect and 0 imperfect interpolant sequences [2025-01-09 08:16:15,030 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-01-09 08:16:15,030 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [13] imperfect sequences [] total 13 [2025-01-09 08:16:15,030 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [364979956] [2025-01-09 08:16:15,030 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-01-09 08:16:15,030 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 13 states [2025-01-09 08:16:15,031 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-01-09 08:16:15,031 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 13 interpolants. [2025-01-09 08:16:15,032 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=37, Invalid=119, Unknown=0, NotChecked=0, Total=156 [2025-01-09 08:16:15,032 INFO L87 Difference]: Start difference. First operand 1618 states and 2271 transitions. Second operand has 13 states, 13 states have (on average 11.153846153846153) internal successors, (145), 13 states have internal predecessors, (145), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-01-09 08:16:15,639 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-01-09 08:16:15,639 INFO L93 Difference]: Finished difference Result 3858 states and 5393 transitions. [2025-01-09 08:16:15,639 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 13 states. [2025-01-09 08:16:15,640 INFO L78 Accepts]: Start accepts. Automaton has has 13 states, 13 states have (on average 11.153846153846153) internal successors, (145), 13 states have internal predecessors, (145), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 145 [2025-01-09 08:16:15,640 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-01-09 08:16:15,647 INFO L225 Difference]: With dead ends: 3858 [2025-01-09 08:16:15,647 INFO L226 Difference]: Without dead ends: 2492 [2025-01-09 08:16:15,649 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 20 GetRequests, 5 SyntacticMatches, 0 SemanticMatches, 15 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 29 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=57, Invalid=215, Unknown=0, NotChecked=0, Total=272 [2025-01-09 08:16:15,649 INFO L435 NwaCegarLoop]: 85 mSDtfsCounter, 322 mSDsluCounter, 583 mSDsCounter, 0 mSdLazyCounter, 1480 mSolverCounterSat, 2 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.5s Time, 0 mProtectedPredicate, 0 mProtectedAction, 322 SdHoareTripleChecker+Valid, 668 SdHoareTripleChecker+Invalid, 1482 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 2 IncrementalHoareTripleChecker+Valid, 1480 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.5s IncrementalHoareTripleChecker+Time [2025-01-09 08:16:15,650 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [322 Valid, 668 Invalid, 1482 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [2 Valid, 1480 Invalid, 0 Unknown, 0 Unchecked, 0.5s Time] [2025-01-09 08:16:15,654 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 2492 states. [2025-01-09 08:16:15,725 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 2492 to 1874. [2025-01-09 08:16:15,731 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 1874 states, 1873 states have (on average 1.393486385477843) internal successors, (2610), 1873 states have internal predecessors, (2610), 0 states have call successors, (0), 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-01-09 08:16:15,738 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1874 states to 1874 states and 2610 transitions. [2025-01-09 08:16:15,738 INFO L78 Accepts]: Start accepts. Automaton has 1874 states and 2610 transitions. Word has length 145 [2025-01-09 08:16:15,739 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-01-09 08:16:15,739 INFO L471 AbstractCegarLoop]: Abstraction has 1874 states and 2610 transitions. [2025-01-09 08:16:15,739 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 13 states, 13 states have (on average 11.153846153846153) internal successors, (145), 13 states have internal predecessors, (145), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-01-09 08:16:15,739 INFO L276 IsEmpty]: Start isEmpty. Operand 1874 states and 2610 transitions. [2025-01-09 08:16:15,746 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 146 [2025-01-09 08:16:15,747 INFO L210 NwaCegarLoop]: Found error trace [2025-01-09 08:16:15,747 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, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-01-09 08:16:15,747 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable19 [2025-01-09 08:16:15,747 INFO L396 AbstractCegarLoop]: === Iteration 21 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-01-09 08:16:15,748 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-01-09 08:16:15,748 INFO L85 PathProgramCache]: Analyzing trace with hash -1186554387, now seen corresponding path program 1 times [2025-01-09 08:16:15,748 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-01-09 08:16:15,748 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1912971235] [2025-01-09 08:16:15,748 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-01-09 08:16:15,748 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-01-09 08:16:15,809 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 145 statements into 1 equivalence classes. [2025-01-09 08:16:16,923 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 145 of 145 statements. [2025-01-09 08:16:16,923 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-01-09 08:16:16,923 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-01-09 08:16:17,502 INFO L134 CoverageAnalysis]: Checked inductivity of 74 backedges. 56 proven. 0 refuted. 0 times theorem prover too weak. 18 trivial. 0 not checked. [2025-01-09 08:16:17,504 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-01-09 08:16:17,504 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1912971235] [2025-01-09 08:16:17,505 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1912971235] provided 1 perfect and 0 imperfect interpolant sequences [2025-01-09 08:16:17,505 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-01-09 08:16:17,505 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [10] imperfect sequences [] total 10 [2025-01-09 08:16:17,505 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1571304598] [2025-01-09 08:16:17,505 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-01-09 08:16:17,509 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 10 states [2025-01-09 08:16:17,509 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-01-09 08:16:17,509 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 10 interpolants. [2025-01-09 08:16:17,509 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=24, Invalid=66, Unknown=0, NotChecked=0, Total=90 [2025-01-09 08:16:17,509 INFO L87 Difference]: Start difference. First operand 1874 states and 2610 transitions. Second operand has 10 states, 10 states have (on average 12.8) internal successors, (128), 10 states have internal predecessors, (128), 0 states have call successors, (0), 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-01-09 08:16:18,206 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-01-09 08:16:18,206 INFO L93 Difference]: Finished difference Result 3533 states and 4919 transitions. [2025-01-09 08:16:18,211 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 11 states. [2025-01-09 08:16:18,211 INFO L78 Accepts]: Start accepts. Automaton has has 10 states, 10 states have (on average 12.8) internal successors, (128), 10 states have internal predecessors, (128), 0 states have call successors, (0), 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 145 [2025-01-09 08:16:18,212 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-01-09 08:16:18,216 INFO L225 Difference]: With dead ends: 3533 [2025-01-09 08:16:18,216 INFO L226 Difference]: Without dead ends: 1991 [2025-01-09 08:16:18,217 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 13 GetRequests, 3 SyntacticMatches, 0 SemanticMatches, 10 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=35, Invalid=97, Unknown=0, NotChecked=0, Total=132 [2025-01-09 08:16:18,218 INFO L435 NwaCegarLoop]: 97 mSDtfsCounter, 216 mSDsluCounter, 612 mSDsCounter, 0 mSdLazyCounter, 1570 mSolverCounterSat, 4 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.5s Time, 0 mProtectedPredicate, 0 mProtectedAction, 216 SdHoareTripleChecker+Valid, 709 SdHoareTripleChecker+Invalid, 1574 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 4 IncrementalHoareTripleChecker+Valid, 1570 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.6s IncrementalHoareTripleChecker+Time [2025-01-09 08:16:18,218 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [216 Valid, 709 Invalid, 1574 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [4 Valid, 1570 Invalid, 0 Unknown, 0 Unchecked, 0.6s Time] [2025-01-09 08:16:18,219 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1991 states. [2025-01-09 08:16:18,234 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1991 to 1538. [2025-01-09 08:16:18,235 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 1538 states, 1537 states have (on average 1.3819128171763175) internal successors, (2124), 1537 states have internal predecessors, (2124), 0 states have call successors, (0), 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-01-09 08:16:18,236 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1538 states to 1538 states and 2124 transitions. [2025-01-09 08:16:18,237 INFO L78 Accepts]: Start accepts. Automaton has 1538 states and 2124 transitions. Word has length 145 [2025-01-09 08:16:18,237 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-01-09 08:16:18,237 INFO L471 AbstractCegarLoop]: Abstraction has 1538 states and 2124 transitions. [2025-01-09 08:16:18,237 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 10 states, 10 states have (on average 12.8) internal successors, (128), 10 states have internal predecessors, (128), 0 states have call successors, (0), 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-01-09 08:16:18,237 INFO L276 IsEmpty]: Start isEmpty. Operand 1538 states and 2124 transitions. [2025-01-09 08:16:18,239 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 146 [2025-01-09 08:16:18,239 INFO L210 NwaCegarLoop]: Found error trace [2025-01-09 08:16:18,239 INFO L218 NwaCegarLoop]: trace histogram [3, 3, 3, 3, 3, 3, 3, 3, 3, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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-01-09 08:16:18,239 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable20 [2025-01-09 08:16:18,239 INFO L396 AbstractCegarLoop]: === Iteration 22 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-01-09 08:16:18,240 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-01-09 08:16:18,240 INFO L85 PathProgramCache]: Analyzing trace with hash 1554661925, now seen corresponding path program 1 times [2025-01-09 08:16:18,240 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-01-09 08:16:18,240 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2102811392] [2025-01-09 08:16:18,240 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-01-09 08:16:18,240 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-01-09 08:16:18,282 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 145 statements into 1 equivalence classes. [2025-01-09 08:16:18,580 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 145 of 145 statements. [2025-01-09 08:16:18,580 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-01-09 08:16:18,581 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-01-09 08:16:19,399 INFO L134 CoverageAnalysis]: Checked inductivity of 75 backedges. 66 proven. 9 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-01-09 08:16:19,400 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-01-09 08:16:19,400 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2102811392] [2025-01-09 08:16:19,400 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [2102811392] provided 0 perfect and 1 imperfect interpolant sequences [2025-01-09 08:16:19,400 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [920796558] [2025-01-09 08:16:19,400 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-01-09 08:16:19,400 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-01-09 08:16:19,400 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 [2025-01-09 08:16:19,402 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-01-09 08:16:19,404 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-01-09 08:16:19,894 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 145 statements into 1 equivalence classes. [2025-01-09 08:16:20,174 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 145 of 145 statements. [2025-01-09 08:16:20,174 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-01-09 08:16:20,174 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-01-09 08:16:20,186 INFO L256 TraceCheckSpWp]: Trace formula consists of 1476 conjuncts, 54 conjuncts are in the unsatisfiable core [2025-01-09 08:16:20,193 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-01-09 08:16:20,723 INFO L134 CoverageAnalysis]: Checked inductivity of 75 backedges. 62 proven. 13 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-01-09 08:16:20,723 INFO L312 TraceCheckSpWp]: Computing backward predicates... [2025-01-09 08:16:21,320 INFO L134 CoverageAnalysis]: Checked inductivity of 75 backedges. 72 proven. 3 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-01-09 08:16:21,320 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [920796558] provided 0 perfect and 2 imperfect interpolant sequences [2025-01-09 08:16:21,320 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2025-01-09 08:16:21,320 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [9, 9, 11] total 24 [2025-01-09 08:16:21,321 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1759236257] [2025-01-09 08:16:21,321 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2025-01-09 08:16:21,321 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 24 states [2025-01-09 08:16:21,321 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-01-09 08:16:21,322 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 24 interpolants. [2025-01-09 08:16:21,322 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=93, Invalid=459, Unknown=0, NotChecked=0, Total=552 [2025-01-09 08:16:21,322 INFO L87 Difference]: Start difference. First operand 1538 states and 2124 transitions. Second operand has 24 states, 24 states have (on average 14.583333333333334) internal successors, (350), 24 states have internal predecessors, (350), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-01-09 08:16:24,179 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-01-09 08:16:24,179 INFO L93 Difference]: Finished difference Result 9804 states and 13824 transitions. [2025-01-09 08:16:24,182 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 79 states. [2025-01-09 08:16:24,183 INFO L78 Accepts]: Start accepts. Automaton has has 24 states, 24 states have (on average 14.583333333333334) internal successors, (350), 24 states have internal predecessors, (350), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 145 [2025-01-09 08:16:24,183 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-01-09 08:16:24,199 INFO L225 Difference]: With dead ends: 9804 [2025-01-09 08:16:24,199 INFO L226 Difference]: Without dead ends: 8598 [2025-01-09 08:16:24,201 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 371 GetRequests, 284 SyntacticMatches, 0 SemanticMatches, 87 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 2300 ImplicationChecksByTransitivity, 1.1s TimeCoverageRelationStatistics Valid=860, Invalid=6972, Unknown=0, NotChecked=0, Total=7832 [2025-01-09 08:16:24,202 INFO L435 NwaCegarLoop]: 104 mSDtfsCounter, 966 mSDsluCounter, 1349 mSDsCounter, 0 mSdLazyCounter, 4242 mSolverCounterSat, 10 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 1.5s Time, 0 mProtectedPredicate, 0 mProtectedAction, 966 SdHoareTripleChecker+Valid, 1453 SdHoareTripleChecker+Invalid, 4252 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 10 IncrementalHoareTripleChecker+Valid, 4242 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 1.8s IncrementalHoareTripleChecker+Time [2025-01-09 08:16:24,203 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [966 Valid, 1453 Invalid, 4252 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [10 Valid, 4242 Invalid, 0 Unknown, 0 Unchecked, 1.8s Time] [2025-01-09 08:16:24,211 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 8598 states. [2025-01-09 08:16:24,278 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 8598 to 3636. [2025-01-09 08:16:24,282 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 3636 states, 3635 states have (on average 1.3898211829436038) internal successors, (5052), 3635 states have internal predecessors, (5052), 0 states have call successors, (0), 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-01-09 08:16:24,285 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3636 states to 3636 states and 5052 transitions. [2025-01-09 08:16:24,285 INFO L78 Accepts]: Start accepts. Automaton has 3636 states and 5052 transitions. Word has length 145 [2025-01-09 08:16:24,286 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-01-09 08:16:24,286 INFO L471 AbstractCegarLoop]: Abstraction has 3636 states and 5052 transitions. [2025-01-09 08:16:24,286 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 24 states, 24 states have (on average 14.583333333333334) internal successors, (350), 24 states have internal predecessors, (350), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-01-09 08:16:24,286 INFO L276 IsEmpty]: Start isEmpty. Operand 3636 states and 5052 transitions. [2025-01-09 08:16:24,291 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 146 [2025-01-09 08:16:24,291 INFO L210 NwaCegarLoop]: Found error trace [2025-01-09 08:16:24,291 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, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-01-09 08:16:24,302 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (6)] Forceful destruction successful, exit code 0 [2025-01-09 08:16:24,496 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,SelfDestructingSolverStorable21 [2025-01-09 08:16:24,496 INFO L396 AbstractCegarLoop]: === Iteration 23 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-01-09 08:16:24,497 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-01-09 08:16:24,497 INFO L85 PathProgramCache]: Analyzing trace with hash -1096831804, now seen corresponding path program 1 times [2025-01-09 08:16:24,497 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-01-09 08:16:24,497 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [91483733] [2025-01-09 08:16:24,497 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-01-09 08:16:24,497 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-01-09 08:16:24,543 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 145 statements into 1 equivalence classes. [2025-01-09 08:16:25,326 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 145 of 145 statements. [2025-01-09 08:16:25,326 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-01-09 08:16:25,326 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-01-09 08:16:27,041 INFO L134 CoverageAnalysis]: Checked inductivity of 73 backedges. 70 proven. 3 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-01-09 08:16:27,041 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-01-09 08:16:27,041 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [91483733] [2025-01-09 08:16:27,041 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [91483733] provided 0 perfect and 1 imperfect interpolant sequences [2025-01-09 08:16:27,041 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1926805299] [2025-01-09 08:16:27,041 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-01-09 08:16:27,041 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-01-09 08:16:27,041 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 [2025-01-09 08:16:27,043 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-01-09 08:16:27,045 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-01-09 08:16:27,433 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 145 statements into 1 equivalence classes. [2025-01-09 08:16:27,758 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 145 of 145 statements. [2025-01-09 08:16:27,758 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-01-09 08:16:27,758 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-01-09 08:16:27,767 INFO L256 TraceCheckSpWp]: Trace formula consists of 1476 conjuncts, 77 conjuncts are in the unsatisfiable core [2025-01-09 08:16:27,779 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-01-09 08:16:28,479 INFO L134 CoverageAnalysis]: Checked inductivity of 73 backedges. 71 proven. 2 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-01-09 08:16:28,482 INFO L312 TraceCheckSpWp]: Computing backward predicates... [2025-01-09 08:16:29,879 INFO L134 CoverageAnalysis]: Checked inductivity of 73 backedges. 61 proven. 12 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-01-09 08:16:29,881 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1926805299] provided 0 perfect and 2 imperfect interpolant sequences [2025-01-09 08:16:29,881 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2025-01-09 08:16:29,881 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [13, 9, 15] total 33 [2025-01-09 08:16:29,881 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1817434297] [2025-01-09 08:16:29,881 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2025-01-09 08:16:29,882 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 33 states [2025-01-09 08:16:29,882 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-01-09 08:16:29,883 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 33 interpolants. [2025-01-09 08:16:29,883 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=135, Invalid=921, Unknown=0, NotChecked=0, Total=1056 [2025-01-09 08:16:29,883 INFO L87 Difference]: Start difference. First operand 3636 states and 5052 transitions. Second operand has 33 states, 33 states have (on average 11.909090909090908) internal successors, (393), 33 states have internal predecessors, (393), 0 states have call successors, (0), 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-01-09 08:16:33,490 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-01-09 08:16:33,490 INFO L93 Difference]: Finished difference Result 12940 states and 18134 transitions. [2025-01-09 08:16:33,490 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 43 states. [2025-01-09 08:16:33,491 INFO L78 Accepts]: Start accepts. Automaton has has 33 states, 33 states have (on average 11.909090909090908) internal successors, (393), 33 states have internal predecessors, (393), 0 states have call successors, (0), 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 145 [2025-01-09 08:16:33,491 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-01-09 08:16:33,511 INFO L225 Difference]: With dead ends: 12940 [2025-01-09 08:16:33,511 INFO L226 Difference]: Without dead ends: 9886 [2025-01-09 08:16:33,520 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 339 GetRequests, 273 SyntacticMatches, 0 SemanticMatches, 66 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 989 ImplicationChecksByTransitivity, 1.4s TimeCoverageRelationStatistics Valid=505, Invalid=4051, Unknown=0, NotChecked=0, Total=4556 [2025-01-09 08:16:33,522 INFO L435 NwaCegarLoop]: 79 mSDtfsCounter, 669 mSDsluCounter, 1596 mSDsCounter, 0 mSdLazyCounter, 5549 mSolverCounterSat, 9 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 2.3s Time, 0 mProtectedPredicate, 0 mProtectedAction, 669 SdHoareTripleChecker+Valid, 1675 SdHoareTripleChecker+Invalid, 5558 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 9 IncrementalHoareTripleChecker+Valid, 5549 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 2.6s IncrementalHoareTripleChecker+Time [2025-01-09 08:16:33,524 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [669 Valid, 1675 Invalid, 5558 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [9 Valid, 5549 Invalid, 0 Unknown, 0 Unchecked, 2.6s Time] [2025-01-09 08:16:33,530 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 9886 states. [2025-01-09 08:16:33,629 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 9886 to 7416. [2025-01-09 08:16:33,636 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 7416 states, 7415 states have (on average 1.3871881321645314) internal successors, (10286), 7415 states have internal predecessors, (10286), 0 states have call successors, (0), 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-01-09 08:16:33,644 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 7416 states to 7416 states and 10286 transitions. [2025-01-09 08:16:33,645 INFO L78 Accepts]: Start accepts. Automaton has 7416 states and 10286 transitions. Word has length 145 [2025-01-09 08:16:33,645 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-01-09 08:16:33,645 INFO L471 AbstractCegarLoop]: Abstraction has 7416 states and 10286 transitions. [2025-01-09 08:16:33,646 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 33 states, 33 states have (on average 11.909090909090908) internal successors, (393), 33 states have internal predecessors, (393), 0 states have call successors, (0), 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-01-09 08:16:33,646 INFO L276 IsEmpty]: Start isEmpty. Operand 7416 states and 10286 transitions. [2025-01-09 08:16:33,655 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 147 [2025-01-09 08:16:33,655 INFO L210 NwaCegarLoop]: Found error trace [2025-01-09 08:16:33,655 INFO L218 NwaCegarLoop]: trace histogram [3, 3, 3, 3, 3, 3, 3, 3, 3, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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-01-09 08:16:33,667 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-01-09 08:16:33,860 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,SelfDestructingSolverStorable22 [2025-01-09 08:16:33,860 INFO L396 AbstractCegarLoop]: === Iteration 24 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-01-09 08:16:33,861 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-01-09 08:16:33,861 INFO L85 PathProgramCache]: Analyzing trace with hash 502432213, now seen corresponding path program 1 times [2025-01-09 08:16:33,861 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-01-09 08:16:33,861 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [226454726] [2025-01-09 08:16:33,861 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-01-09 08:16:33,861 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-01-09 08:16:33,905 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 146 statements into 1 equivalence classes. [2025-01-09 08:16:34,182 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 146 of 146 statements. [2025-01-09 08:16:34,183 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-01-09 08:16:34,183 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-01-09 08:16:34,756 INFO L134 CoverageAnalysis]: Checked inductivity of 75 backedges. 66 proven. 9 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-01-09 08:16:34,757 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-01-09 08:16:34,757 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [226454726] [2025-01-09 08:16:34,757 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [226454726] provided 0 perfect and 1 imperfect interpolant sequences [2025-01-09 08:16:34,757 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [128608856] [2025-01-09 08:16:34,757 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-01-09 08:16:34,757 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-01-09 08:16:34,757 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 [2025-01-09 08:16:34,759 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-01-09 08:16:34,760 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-01-09 08:16:35,187 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 146 statements into 1 equivalence classes. [2025-01-09 08:16:35,327 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 146 of 146 statements. [2025-01-09 08:16:35,327 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-01-09 08:16:35,327 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-01-09 08:16:35,335 INFO L256 TraceCheckSpWp]: Trace formula consists of 1479 conjuncts, 32 conjuncts are in the unsatisfiable core [2025-01-09 08:16:35,338 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-01-09 08:16:35,715 INFO L134 CoverageAnalysis]: Checked inductivity of 75 backedges. 66 proven. 9 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-01-09 08:16:35,715 INFO L312 TraceCheckSpWp]: Computing backward predicates... [2025-01-09 08:16:36,363 INFO L134 CoverageAnalysis]: Checked inductivity of 75 backedges. 63 proven. 12 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-01-09 08:16:36,364 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [128608856] provided 0 perfect and 2 imperfect interpolant sequences [2025-01-09 08:16:36,364 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2025-01-09 08:16:36,364 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [8, 7, 11] total 22 [2025-01-09 08:16:36,364 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [476120981] [2025-01-09 08:16:36,364 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2025-01-09 08:16:36,364 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 22 states [2025-01-09 08:16:36,364 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-01-09 08:16:36,365 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 22 interpolants. [2025-01-09 08:16:36,365 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=94, Invalid=368, Unknown=0, NotChecked=0, Total=462 [2025-01-09 08:16:36,365 INFO L87 Difference]: Start difference. First operand 7416 states and 10286 transitions. Second operand has 22 states, 22 states have (on average 18.40909090909091) internal successors, (405), 22 states have internal predecessors, (405), 0 states have call successors, (0), 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-01-09 08:16:37,867 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-01-09 08:16:37,868 INFO L93 Difference]: Finished difference Result 21348 states and 29694 transitions. [2025-01-09 08:16:37,868 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 16 states. [2025-01-09 08:16:37,868 INFO L78 Accepts]: Start accepts. Automaton has has 22 states, 22 states have (on average 18.40909090909091) internal successors, (405), 22 states have internal predecessors, (405), 0 states have call successors, (0), 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 146 [2025-01-09 08:16:37,869 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-01-09 08:16:37,895 INFO L225 Difference]: With dead ends: 21348 [2025-01-09 08:16:37,896 INFO L226 Difference]: Without dead ends: 14872 [2025-01-09 08:16:37,905 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 311 GetRequests, 282 SyntacticMatches, 0 SemanticMatches, 29 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 166 ImplicationChecksByTransitivity, 0.3s TimeCoverageRelationStatistics Valid=189, Invalid=741, Unknown=0, NotChecked=0, Total=930 [2025-01-09 08:16:37,906 INFO L435 NwaCegarLoop]: 104 mSDtfsCounter, 752 mSDsluCounter, 1101 mSDsCounter, 0 mSdLazyCounter, 3215 mSolverCounterSat, 4 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 1.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 752 SdHoareTripleChecker+Valid, 1205 SdHoareTripleChecker+Invalid, 3219 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 4 IncrementalHoareTripleChecker+Valid, 3215 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 1.3s IncrementalHoareTripleChecker+Time [2025-01-09 08:16:37,906 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [752 Valid, 1205 Invalid, 3219 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [4 Valid, 3215 Invalid, 0 Unknown, 0 Unchecked, 1.3s Time] [2025-01-09 08:16:37,915 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 14872 states. [2025-01-09 08:16:38,015 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 14872 to 8741. [2025-01-09 08:16:38,026 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 8741 states, 8740 states have (on average 1.3850114416475972) internal successors, (12105), 8740 states have internal predecessors, (12105), 0 states have call successors, (0), 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-01-09 08:16:38,038 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 8741 states to 8741 states and 12105 transitions. [2025-01-09 08:16:38,039 INFO L78 Accepts]: Start accepts. Automaton has 8741 states and 12105 transitions. Word has length 146 [2025-01-09 08:16:38,039 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-01-09 08:16:38,039 INFO L471 AbstractCegarLoop]: Abstraction has 8741 states and 12105 transitions. [2025-01-09 08:16:38,040 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 22 states, 22 states have (on average 18.40909090909091) internal successors, (405), 22 states have internal predecessors, (405), 0 states have call successors, (0), 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-01-09 08:16:38,040 INFO L276 IsEmpty]: Start isEmpty. Operand 8741 states and 12105 transitions. [2025-01-09 08:16:38,057 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 147 [2025-01-09 08:16:38,057 INFO L210 NwaCegarLoop]: Found error trace [2025-01-09 08:16:38,057 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, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-01-09 08:16:38,072 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-01-09 08:16:38,258 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable23,8 /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-01-09 08:16:38,259 INFO L396 AbstractCegarLoop]: === Iteration 25 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-01-09 08:16:38,260 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-01-09 08:16:38,261 INFO L85 PathProgramCache]: Analyzing trace with hash -1233971864, now seen corresponding path program 1 times [2025-01-09 08:16:38,261 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-01-09 08:16:38,261 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [473242195] [2025-01-09 08:16:38,261 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-01-09 08:16:38,261 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-01-09 08:16:38,309 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 146 statements into 1 equivalence classes. [2025-01-09 08:16:38,775 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 146 of 146 statements. [2025-01-09 08:16:38,775 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-01-09 08:16:38,775 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-01-09 08:16:39,797 INFO L134 CoverageAnalysis]: Checked inductivity of 74 backedges. 74 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-01-09 08:16:39,797 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-01-09 08:16:39,797 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [473242195] [2025-01-09 08:16:39,797 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [473242195] provided 1 perfect and 0 imperfect interpolant sequences [2025-01-09 08:16:39,797 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-01-09 08:16:39,798 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [13] imperfect sequences [] total 13 [2025-01-09 08:16:39,798 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [182872614] [2025-01-09 08:16:39,798 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-01-09 08:16:39,798 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 13 states [2025-01-09 08:16:39,798 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-01-09 08:16:39,798 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 13 interpolants. [2025-01-09 08:16:39,799 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=38, Invalid=118, Unknown=0, NotChecked=0, Total=156 [2025-01-09 08:16:39,799 INFO L87 Difference]: Start difference. First operand 8741 states and 12105 transitions. Second operand has 13 states, 13 states have (on average 11.23076923076923) internal successors, (146), 13 states have internal predecessors, (146), 0 states have call successors, (0), 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-01-09 08:16:40,663 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-01-09 08:16:40,664 INFO L93 Difference]: Finished difference Result 18079 states and 24941 transitions. [2025-01-09 08:16:40,665 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 14 states. [2025-01-09 08:16:40,665 INFO L78 Accepts]: Start accepts. Automaton has has 13 states, 13 states have (on average 11.23076923076923) internal successors, (146), 13 states have internal predecessors, (146), 0 states have call successors, (0), 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 146 [2025-01-09 08:16:40,665 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-01-09 08:16:40,677 INFO L225 Difference]: With dead ends: 18079 [2025-01-09 08:16:40,677 INFO L226 Difference]: Without dead ends: 10435 [2025-01-09 08:16:40,683 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 22 GetRequests, 5 SyntacticMatches, 0 SemanticMatches, 17 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 29 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=75, Invalid=267, Unknown=0, NotChecked=0, Total=342 [2025-01-09 08:16:40,684 INFO L435 NwaCegarLoop]: 81 mSDtfsCounter, 296 mSDsluCounter, 685 mSDsCounter, 0 mSdLazyCounter, 1749 mSolverCounterSat, 2 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.6s Time, 0 mProtectedPredicate, 0 mProtectedAction, 296 SdHoareTripleChecker+Valid, 766 SdHoareTripleChecker+Invalid, 1751 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 2 IncrementalHoareTripleChecker+Valid, 1749 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.7s IncrementalHoareTripleChecker+Time [2025-01-09 08:16:40,684 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [296 Valid, 766 Invalid, 1751 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [2 Valid, 1749 Invalid, 0 Unknown, 0 Unchecked, 0.7s Time] [2025-01-09 08:16:40,688 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 10435 states. [2025-01-09 08:16:40,771 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 10435 to 10049. [2025-01-09 08:16:40,780 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 10049 states, 10048 states have (on average 1.3743033439490446) internal successors, (13809), 10048 states have internal predecessors, (13809), 0 states have call successors, (0), 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-01-09 08:16:40,790 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 10049 states to 10049 states and 13809 transitions. [2025-01-09 08:16:40,790 INFO L78 Accepts]: Start accepts. Automaton has 10049 states and 13809 transitions. Word has length 146 [2025-01-09 08:16:40,791 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-01-09 08:16:40,791 INFO L471 AbstractCegarLoop]: Abstraction has 10049 states and 13809 transitions. [2025-01-09 08:16:40,791 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 13 states, 13 states have (on average 11.23076923076923) internal successors, (146), 13 states have internal predecessors, (146), 0 states have call successors, (0), 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-01-09 08:16:40,791 INFO L276 IsEmpty]: Start isEmpty. Operand 10049 states and 13809 transitions. [2025-01-09 08:16:40,802 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 147 [2025-01-09 08:16:40,802 INFO L210 NwaCegarLoop]: Found error trace [2025-01-09 08:16:40,802 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, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-01-09 08:16:40,802 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable24 [2025-01-09 08:16:40,802 INFO L396 AbstractCegarLoop]: === Iteration 26 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-01-09 08:16:40,803 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-01-09 08:16:40,803 INFO L85 PathProgramCache]: Analyzing trace with hash -1744914604, now seen corresponding path program 1 times [2025-01-09 08:16:40,803 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-01-09 08:16:40,803 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1072632823] [2025-01-09 08:16:40,803 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-01-09 08:16:40,803 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-01-09 08:16:40,847 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 146 statements into 1 equivalence classes. [2025-01-09 08:16:41,725 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 146 of 146 statements. [2025-01-09 08:16:41,725 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-01-09 08:16:41,725 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-01-09 08:16:43,275 INFO L134 CoverageAnalysis]: Checked inductivity of 75 backedges. 46 proven. 29 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-01-09 08:16:43,276 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-01-09 08:16:43,276 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1072632823] [2025-01-09 08:16:43,276 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1072632823] provided 0 perfect and 1 imperfect interpolant sequences [2025-01-09 08:16:43,276 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [878650705] [2025-01-09 08:16:43,276 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-01-09 08:16:43,276 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-01-09 08:16:43,276 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 [2025-01-09 08:16:43,278 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-01-09 08:16:43,279 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-01-09 08:16:43,743 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 146 statements into 1 equivalence classes. [2025-01-09 08:16:44,079 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 146 of 146 statements. [2025-01-09 08:16:44,079 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-01-09 08:16:44,079 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-01-09 08:16:44,089 INFO L256 TraceCheckSpWp]: Trace formula consists of 1475 conjuncts, 63 conjuncts are in the unsatisfiable core [2025-01-09 08:16:44,093 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-01-09 08:16:44,650 INFO L134 CoverageAnalysis]: Checked inductivity of 75 backedges. 48 proven. 27 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-01-09 08:16:44,650 INFO L312 TraceCheckSpWp]: Computing backward predicates... [2025-01-09 08:16:45,404 INFO L134 CoverageAnalysis]: Checked inductivity of 75 backedges. 44 proven. 31 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-01-09 08:16:45,404 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [878650705] provided 0 perfect and 2 imperfect interpolant sequences [2025-01-09 08:16:45,404 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2025-01-09 08:16:45,404 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [19, 18, 15] total 47 [2025-01-09 08:16:45,404 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1985508607] [2025-01-09 08:16:45,404 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2025-01-09 08:16:45,404 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 47 states [2025-01-09 08:16:45,404 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-01-09 08:16:45,405 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 47 interpolants. [2025-01-09 08:16:45,406 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=226, Invalid=1936, Unknown=0, NotChecked=0, Total=2162 [2025-01-09 08:16:45,406 INFO L87 Difference]: Start difference. First operand 10049 states and 13809 transitions. Second operand has 47 states, 47 states have (on average 8.23404255319149) internal successors, (387), 47 states have internal predecessors, (387), 0 states have call successors, (0), 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-01-09 08:16:49,143 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-01-09 08:16:49,144 INFO L93 Difference]: Finished difference Result 29840 states and 40897 transitions. [2025-01-09 08:16:49,144 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 62 states. [2025-01-09 08:16:49,144 INFO L78 Accepts]: Start accepts. Automaton has has 47 states, 47 states have (on average 8.23404255319149) internal successors, (387), 47 states have internal predecessors, (387), 0 states have call successors, (0), 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 146 [2025-01-09 08:16:49,145 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-01-09 08:16:49,177 INFO L225 Difference]: With dead ends: 29840 [2025-01-09 08:16:49,177 INFO L226 Difference]: Without dead ends: 21026 [2025-01-09 08:16:49,199 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 384 GetRequests, 278 SyntacticMatches, 1 SemanticMatches, 105 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 2704 ImplicationChecksByTransitivity, 2.5s TimeCoverageRelationStatistics Valid=1307, Invalid=10035, Unknown=0, NotChecked=0, Total=11342 [2025-01-09 08:16:49,199 INFO L435 NwaCegarLoop]: 55 mSDtfsCounter, 2373 mSDsluCounter, 1314 mSDsCounter, 0 mSdLazyCounter, 4142 mSolverCounterSat, 33 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 1.6s Time, 0 mProtectedPredicate, 0 mProtectedAction, 2373 SdHoareTripleChecker+Valid, 1369 SdHoareTripleChecker+Invalid, 4175 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 33 IncrementalHoareTripleChecker+Valid, 4142 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 1.8s IncrementalHoareTripleChecker+Time [2025-01-09 08:16:49,201 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [2373 Valid, 1369 Invalid, 4175 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [33 Valid, 4142 Invalid, 0 Unknown, 0 Unchecked, 1.8s Time] [2025-01-09 08:16:49,218 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 21026 states. [2025-01-09 08:16:49,455 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 21026 to 16751. [2025-01-09 08:16:49,474 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 16751 states, 16750 states have (on average 1.3895522388059702) internal successors, (23275), 16750 states have internal predecessors, (23275), 0 states have call successors, (0), 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-01-09 08:16:49,497 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 16751 states to 16751 states and 23275 transitions. [2025-01-09 08:16:49,498 INFO L78 Accepts]: Start accepts. Automaton has 16751 states and 23275 transitions. Word has length 146 [2025-01-09 08:16:49,498 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-01-09 08:16:49,499 INFO L471 AbstractCegarLoop]: Abstraction has 16751 states and 23275 transitions. [2025-01-09 08:16:49,499 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 47 states, 47 states have (on average 8.23404255319149) internal successors, (387), 47 states have internal predecessors, (387), 0 states have call successors, (0), 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-01-09 08:16:49,499 INFO L276 IsEmpty]: Start isEmpty. Operand 16751 states and 23275 transitions. [2025-01-09 08:16:49,517 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 147 [2025-01-09 08:16:49,517 INFO L210 NwaCegarLoop]: Found error trace [2025-01-09 08:16:49,517 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, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-01-09 08:16:49,532 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-01-09 08:16:49,718 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 9 /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable25 [2025-01-09 08:16:49,720 INFO L396 AbstractCegarLoop]: === Iteration 27 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-01-09 08:16:49,721 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-01-09 08:16:49,721 INFO L85 PathProgramCache]: Analyzing trace with hash 1312551786, now seen corresponding path program 1 times [2025-01-09 08:16:49,721 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-01-09 08:16:49,721 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [912416872] [2025-01-09 08:16:49,721 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-01-09 08:16:49,721 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-01-09 08:16:49,768 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 146 statements into 1 equivalence classes. [2025-01-09 08:16:50,083 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 146 of 146 statements. [2025-01-09 08:16:50,084 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-01-09 08:16:50,084 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-01-09 08:16:50,643 INFO L134 CoverageAnalysis]: Checked inductivity of 73 backedges. 59 proven. 0 refuted. 0 times theorem prover too weak. 14 trivial. 0 not checked. [2025-01-09 08:16:50,643 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-01-09 08:16:50,643 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [912416872] [2025-01-09 08:16:50,644 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [912416872] provided 1 perfect and 0 imperfect interpolant sequences [2025-01-09 08:16:50,644 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-01-09 08:16:50,644 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2025-01-09 08:16:50,644 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [52301546] [2025-01-09 08:16:50,644 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-01-09 08:16:50,645 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2025-01-09 08:16:50,645 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-01-09 08:16:50,645 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2025-01-09 08:16:50,645 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=8, Invalid=12, Unknown=0, NotChecked=0, Total=20 [2025-01-09 08:16:50,645 INFO L87 Difference]: Start difference. First operand 16751 states and 23275 transitions. Second operand has 5 states, 5 states have (on average 27.4) internal successors, (137), 5 states have internal predecessors, (137), 0 states have call successors, (0), 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-01-09 08:16:50,995 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-01-09 08:16:50,995 INFO L93 Difference]: Finished difference Result 30217 states and 42168 transitions. [2025-01-09 08:16:50,996 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2025-01-09 08:16:50,996 INFO L78 Accepts]: Start accepts. Automaton has has 5 states, 5 states have (on average 27.4) internal successors, (137), 5 states have internal predecessors, (137), 0 states have call successors, (0), 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 146 [2025-01-09 08:16:50,996 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-01-09 08:16:51,011 INFO L225 Difference]: With dead ends: 30217 [2025-01-09 08:16:51,012 INFO L226 Difference]: Without dead ends: 14345 [2025-01-09 08:16:51,027 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-01-09 08:16:51,028 INFO L435 NwaCegarLoop]: 61 mSDtfsCounter, 265 mSDsluCounter, 118 mSDsCounter, 0 mSdLazyCounter, 419 mSolverCounterSat, 2 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 265 SdHoareTripleChecker+Valid, 179 SdHoareTripleChecker+Invalid, 421 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 2 IncrementalHoareTripleChecker+Valid, 419 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.2s IncrementalHoareTripleChecker+Time [2025-01-09 08:16:51,028 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [265 Valid, 179 Invalid, 421 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [2 Valid, 419 Invalid, 0 Unknown, 0 Unchecked, 0.2s Time] [2025-01-09 08:16:51,035 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 14345 states. [2025-01-09 08:16:51,169 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 14345 to 13665. [2025-01-09 08:16:51,179 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 13665 states, 13664 states have (on average 1.38605093676815) internal successors, (18939), 13664 states have internal predecessors, (18939), 0 states have call successors, (0), 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-01-09 08:16:51,196 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 13665 states to 13665 states and 18939 transitions. [2025-01-09 08:16:51,197 INFO L78 Accepts]: Start accepts. Automaton has 13665 states and 18939 transitions. Word has length 146 [2025-01-09 08:16:51,197 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-01-09 08:16:51,198 INFO L471 AbstractCegarLoop]: Abstraction has 13665 states and 18939 transitions. [2025-01-09 08:16:51,198 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 27.4) internal successors, (137), 5 states have internal predecessors, (137), 0 states have call successors, (0), 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-01-09 08:16:51,198 INFO L276 IsEmpty]: Start isEmpty. Operand 13665 states and 18939 transitions. [2025-01-09 08:16:51,207 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 147 [2025-01-09 08:16:51,207 INFO L210 NwaCegarLoop]: Found error trace [2025-01-09 08:16:51,207 INFO L218 NwaCegarLoop]: trace histogram [3, 3, 3, 3, 3, 3, 3, 3, 3, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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-01-09 08:16:51,208 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable26 [2025-01-09 08:16:51,208 INFO L396 AbstractCegarLoop]: === Iteration 28 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-01-09 08:16:51,208 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-01-09 08:16:51,208 INFO L85 PathProgramCache]: Analyzing trace with hash 174066864, now seen corresponding path program 1 times [2025-01-09 08:16:51,208 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-01-09 08:16:51,208 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1021348031] [2025-01-09 08:16:51,208 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-01-09 08:16:51,209 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-01-09 08:16:51,260 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 146 statements into 1 equivalence classes. [2025-01-09 08:16:51,560 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 146 of 146 statements. [2025-01-09 08:16:51,560 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-01-09 08:16:51,560 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-01-09 08:16:52,082 INFO L134 CoverageAnalysis]: Checked inductivity of 76 backedges. 52 proven. 0 refuted. 0 times theorem prover too weak. 24 trivial. 0 not checked. [2025-01-09 08:16:52,082 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-01-09 08:16:52,083 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1021348031] [2025-01-09 08:16:52,084 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1021348031] provided 1 perfect and 0 imperfect interpolant sequences [2025-01-09 08:16:52,084 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-01-09 08:16:52,084 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2025-01-09 08:16:52,084 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1820796667] [2025-01-09 08:16:52,084 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-01-09 08:16:52,084 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2025-01-09 08:16:52,084 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-01-09 08:16:52,085 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2025-01-09 08:16:52,085 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2025-01-09 08:16:52,085 INFO L87 Difference]: Start difference. First operand 13665 states and 18939 transitions. Second operand has 5 states, 5 states have (on average 25.2) internal successors, (126), 5 states have internal predecessors, (126), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0)