./Ultimate.py --spec ../sv-benchmarks/c/properties/unreach-call.prp --file ../sv-benchmarks/c/hardware-verification-bv/btor2c-lazyMod.client_server.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.client_server.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 9ed0841be1ae1dee8e84f0ca737866704342db1241d2484eefbe911736856543 --- Real Ultimate output --- This is Ultimate 0.3.0-?-551b009-m [2025-01-09 07:06:03,579 INFO L188 SettingsManager]: Resetting all preferences to default values... [2025-01-09 07:06:03,639 INFO L114 SettingsManager]: Loading settings from /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/config/svcomp-Reach-64bit-Automizer_Default.epf [2025-01-09 07:06:03,646 WARN L101 SettingsManager]: Preference file contains the following unknown settings: [2025-01-09 07:06:03,646 WARN L103 SettingsManager]: * de.uni_freiburg.informatik.ultimate.core.Log level for class [2025-01-09 07:06:03,662 INFO L130 SettingsManager]: Preferences different from defaults after loading the file: [2025-01-09 07:06:03,664 INFO L151 SettingsManager]: Preferences of UltimateCore differ from their defaults: [2025-01-09 07:06:03,664 INFO L153 SettingsManager]: * Log level for class=de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher=ERROR; [2025-01-09 07:06:03,665 INFO L151 SettingsManager]: Preferences of Boogie Preprocessor differ from their defaults: [2025-01-09 07:06:03,665 INFO L153 SettingsManager]: * Use memory slicer=true [2025-01-09 07:06:03,665 INFO L151 SettingsManager]: Preferences of Boogie Procedure Inliner differ from their defaults: [2025-01-09 07:06:03,665 INFO L153 SettingsManager]: * Ignore calls to procedures called more than once=ONLY_FOR_SEQUENTIAL_PROGRAMS [2025-01-09 07:06:03,666 INFO L151 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2025-01-09 07:06:03,666 INFO L153 SettingsManager]: * Create parallel compositions if possible=false [2025-01-09 07:06:03,666 INFO L153 SettingsManager]: * Use SBE=true [2025-01-09 07:06:03,666 INFO L151 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2025-01-09 07:06:03,667 INFO L153 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2025-01-09 07:06:03,667 INFO L153 SettingsManager]: * Overapproximate operations on floating types=true [2025-01-09 07:06:03,667 INFO L153 SettingsManager]: * Check division by zero=IGNORE [2025-01-09 07:06:03,667 INFO L153 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2025-01-09 07:06:03,667 INFO L153 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2025-01-09 07:06:03,667 INFO L153 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2025-01-09 07:06:03,667 INFO L153 SettingsManager]: * Check if freed pointer was valid=false [2025-01-09 07:06:03,667 INFO L153 SettingsManager]: * Behaviour of calls to undefined functions=OVERAPPROXIMATE_BEHAVIOUR [2025-01-09 07:06:03,667 INFO L153 SettingsManager]: * Use constant arrays=true [2025-01-09 07:06:03,667 INFO L151 SettingsManager]: Preferences of IcfgBuilder differ from their defaults: [2025-01-09 07:06:03,667 INFO L153 SettingsManager]: * Size of a code block=SequenceOfStatements [2025-01-09 07:06:03,667 INFO L153 SettingsManager]: * Only consider context switches at boundaries of atomic blocks=true [2025-01-09 07:06:03,667 INFO L153 SettingsManager]: * SMT solver=External_DefaultMode [2025-01-09 07:06:03,667 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2025-01-09 07:06:03,668 INFO L151 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2025-01-09 07:06:03,668 INFO L153 SettingsManager]: * Size of a code block=SequenceOfStatements [2025-01-09 07:06:03,668 INFO L153 SettingsManager]: * Only consider context switches at boundaries of atomic blocks=true [2025-01-09 07:06:03,668 INFO L153 SettingsManager]: * SMT solver=External_DefaultMode [2025-01-09 07:06:03,668 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2025-01-09 07:06:03,668 INFO L151 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2025-01-09 07:06:03,668 INFO L153 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2025-01-09 07:06:03,668 INFO L153 SettingsManager]: * Compute procedure contracts=false [2025-01-09 07:06:03,668 INFO L153 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopHeads [2025-01-09 07:06:03,668 INFO L153 SettingsManager]: * Trace refinement strategy=CAMEL [2025-01-09 07:06:03,668 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2025-01-09 07:06:03,668 INFO L153 SettingsManager]: * Apply one-shot large block encoding in concurrent analysis=false [2025-01-09 07:06:03,668 INFO L153 SettingsManager]: * Automaton type used in concurrency analysis=PETRI_NET [2025-01-09 07:06:03,669 INFO L153 SettingsManager]: * Order on configurations for Petri net unfoldings=DBO [2025-01-09 07:06:03,669 INFO L153 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode [2025-01-09 07:06:03,669 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 -> 9ed0841be1ae1dee8e84f0ca737866704342db1241d2484eefbe911736856543 [2025-01-09 07:06:03,902 INFO L75 nceAwareModelManager]: Repository-Root is: /tmp [2025-01-09 07:06:03,910 INFO L261 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2025-01-09 07:06:03,913 INFO L217 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2025-01-09 07:06:03,913 INFO L270 PluginConnector]: Initializing CDTParser... [2025-01-09 07:06:03,914 INFO L274 PluginConnector]: CDTParser initialized [2025-01-09 07:06:03,915 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.client_server.c [2025-01-09 07:06:05,013 INFO L533 CDTParser]: Created temporary CDT project at /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/data/18cab563e/7a0ded2ca4114362af2cb5a0fa722172/FLAG94b7b60bf [2025-01-09 07:06:05,280 INFO L384 CDTParser]: Found 1 translation units. [2025-01-09 07:06:05,280 INFO L180 CDTParser]: Scanning /storage/repos/ultimate-jdk21/releaseScripts/default/sv-benchmarks/c/hardware-verification-bv/btor2c-lazyMod.client_server.c [2025-01-09 07:06:05,291 INFO L427 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/data/18cab563e/7a0ded2ca4114362af2cb5a0fa722172/FLAG94b7b60bf [2025-01-09 07:06:05,306 INFO L435 CDTParser]: Successfully deleted /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/data/18cab563e/7a0ded2ca4114362af2cb5a0fa722172 [2025-01-09 07:06:05,308 INFO L299 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2025-01-09 07:06:05,310 INFO L133 ToolchainWalker]: Walking toolchain with 6 elements. [2025-01-09 07:06:05,311 INFO L112 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2025-01-09 07:06:05,311 INFO L270 PluginConnector]: Initializing CACSL2BoogieTranslator... [2025-01-09 07:06:05,314 INFO L274 PluginConnector]: CACSL2BoogieTranslator initialized [2025-01-09 07:06:05,314 INFO L184 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 09.01 07:06:05" (1/1) ... [2025-01-09 07:06:05,315 INFO L204 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@244c8d0a and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.01 07:06:05, skipping insertion in model container [2025-01-09 07:06:05,315 INFO L184 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 09.01 07:06:05" (1/1) ... [2025-01-09 07:06:05,339 INFO L175 MainTranslator]: Built tables and reachable declarations [2025-01-09 07:06:05,452 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.client_server.c[1253,1266] [2025-01-09 07:06:05,585 INFO L210 PostProcessor]: Analyzing one entry point: main [2025-01-09 07:06:05,595 INFO L200 MainTranslator]: Completed pre-run [2025-01-09 07:06:05,602 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.client_server.c[1253,1266] [2025-01-09 07:06:05,669 INFO L210 PostProcessor]: Analyzing one entry point: main [2025-01-09 07:06:05,684 INFO L204 MainTranslator]: Completed translation [2025-01-09 07:06:05,685 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.01 07:06:05 WrapperNode [2025-01-09 07:06:05,685 INFO L131 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2025-01-09 07:06:05,685 INFO L112 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2025-01-09 07:06:05,685 INFO L270 PluginConnector]: Initializing Boogie Procedure Inliner... [2025-01-09 07:06:05,685 INFO L274 PluginConnector]: Boogie Procedure Inliner initialized [2025-01-09 07:06:05,690 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.01 07:06:05" (1/1) ... [2025-01-09 07:06:05,704 INFO L184 PluginConnector]: Executing the observer Inliner from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.01 07:06:05" (1/1) ... [2025-01-09 07:06:05,786 INFO L138 Inliner]: procedures = 17, calls = 8, calls flagged for inlining = 3, calls inlined = 3, statements flattened = 860 [2025-01-09 07:06:05,787 INFO L131 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2025-01-09 07:06:05,788 INFO L112 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2025-01-09 07:06:05,788 INFO L270 PluginConnector]: Initializing Boogie Preprocessor... [2025-01-09 07:06:05,788 INFO L274 PluginConnector]: Boogie Preprocessor initialized [2025-01-09 07:06:05,795 INFO L184 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.01 07:06:05" (1/1) ... [2025-01-09 07:06:05,795 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.01 07:06:05" (1/1) ... [2025-01-09 07:06:05,812 INFO L184 PluginConnector]: Executing the observer MemorySlicer from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.01 07:06:05" (1/1) ... [2025-01-09 07:06:05,853 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 07:06:05,853 INFO L184 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.01 07:06:05" (1/1) ... [2025-01-09 07:06:05,853 INFO L184 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.01 07:06:05" (1/1) ... [2025-01-09 07:06:05,885 INFO L184 PluginConnector]: Executing the observer ReplaceArrayAssignments from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.01 07:06:05" (1/1) ... [2025-01-09 07:06:05,893 INFO L184 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.01 07:06:05" (1/1) ... [2025-01-09 07:06:05,902 INFO L184 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.01 07:06:05" (1/1) ... [2025-01-09 07:06:05,918 INFO L184 PluginConnector]: Executing the observer LTLStepAnnotator from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.01 07:06:05" (1/1) ... [2025-01-09 07:06:05,928 INFO L184 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.01 07:06:05" (1/1) ... [2025-01-09 07:06:05,945 INFO L131 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2025-01-09 07:06:05,946 INFO L112 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2025-01-09 07:06:05,947 INFO L270 PluginConnector]: Initializing RCFGBuilder... [2025-01-09 07:06:05,947 INFO L274 PluginConnector]: RCFGBuilder initialized [2025-01-09 07:06:05,948 INFO L184 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.01 07:06:05" (1/1) ... [2025-01-09 07:06:05,952 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2025-01-09 07:06:05,961 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 [2025-01-09 07:06:05,974 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 07:06:05,977 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 07:06:05,998 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocInit [2025-01-09 07:06:05,998 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int#0 [2025-01-09 07:06:05,998 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2025-01-09 07:06:05,998 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2025-01-09 07:06:06,129 INFO L234 CfgBuilder]: Building ICFG [2025-01-09 07:06:06,131 INFO L260 CfgBuilder]: Building CFG for each procedure with an implementation [2025-01-09 07:06:06,994 INFO L? ?]: Removed 563 outVars from TransFormulas that were not future-live. [2025-01-09 07:06:06,995 INFO L283 CfgBuilder]: Performing block encoding [2025-01-09 07:06:07,005 INFO L307 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2025-01-09 07:06:07,007 INFO L312 CfgBuilder]: Removed 1 assume(true) statements. [2025-01-09 07:06:07,007 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 09.01 07:06:07 BoogieIcfgContainer [2025-01-09 07:06:07,007 INFO L131 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2025-01-09 07:06:07,010 INFO L112 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2025-01-09 07:06:07,010 INFO L270 PluginConnector]: Initializing TraceAbstraction... [2025-01-09 07:06:07,014 INFO L274 PluginConnector]: TraceAbstraction initialized [2025-01-09 07:06:07,014 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 09.01 07:06:05" (1/3) ... [2025-01-09 07:06:07,014 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@5192143a and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 09.01 07:06:07, skipping insertion in model container [2025-01-09 07:06:07,015 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.01 07:06:05" (2/3) ... [2025-01-09 07:06:07,015 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@5192143a and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 09.01 07:06:07, skipping insertion in model container [2025-01-09 07:06:07,016 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 09.01 07:06:07" (3/3) ... [2025-01-09 07:06:07,016 INFO L128 eAbstractionObserver]: Analyzing ICFG btor2c-lazyMod.client_server.c [2025-01-09 07:06:07,028 INFO L216 ceAbstractionStarter]: Automizer settings: Hoare:LoopHeads NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2025-01-09 07:06:07,029 INFO L151 ceAbstractionStarter]: Applying trace abstraction to ICFG btor2c-lazyMod.client_server.c that has 1 procedures, 210 locations, 1 initial locations, 1 loop locations, and 1 error locations. [2025-01-09 07:06:07,075 INFO L332 AbstractCegarLoop]: ======== Iteration 0 == of CEGAR loop == AllErrorsAtOnce ======== [2025-01-09 07:06:07,084 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;@43be5691, mLbeIndependenceSettings=[IndependenceType=SEMANTIC, AbstractionType=NONE, UseConditional=false, UseSemiCommutativity=true, Solver=Z3, SolverTimeout=1000ms] [2025-01-09 07:06:07,085 INFO L334 AbstractCegarLoop]: Starting to check reachability of 1 error locations. [2025-01-09 07:06:07,089 INFO L276 IsEmpty]: Start isEmpty. Operand has 210 states, 208 states have (on average 1.4951923076923077) internal successors, (311), 209 states have internal predecessors, (311), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-01-09 07:06:07,093 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 42 [2025-01-09 07:06:07,094 INFO L210 NwaCegarLoop]: Found error trace [2025-01-09 07:06:07,094 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 07:06:07,094 INFO L396 AbstractCegarLoop]: === Iteration 1 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-01-09 07:06:07,097 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-01-09 07:06:07,098 INFO L85 PathProgramCache]: Analyzing trace with hash 1877739446, now seen corresponding path program 1 times [2025-01-09 07:06:07,103 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-01-09 07:06:07,103 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1859205812] [2025-01-09 07:06:07,103 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-01-09 07:06:07,103 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-01-09 07:06:07,191 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 41 statements into 1 equivalence classes. [2025-01-09 07:06:07,364 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 41 of 41 statements. [2025-01-09 07:06:07,365 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-01-09 07:06:07,365 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-01-09 07:06:07,942 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 07:06:07,942 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-01-09 07:06:07,942 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1859205812] [2025-01-09 07:06:07,943 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1859205812] provided 1 perfect and 0 imperfect interpolant sequences [2025-01-09 07:06:07,943 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-01-09 07:06:07,943 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2025-01-09 07:06:07,944 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [30958086] [2025-01-09 07:06:07,944 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-01-09 07:06:07,947 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2025-01-09 07:06:07,947 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-01-09 07:06:07,960 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2025-01-09 07:06:07,961 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2025-01-09 07:06:07,964 INFO L87 Difference]: Start difference. First operand has 210 states, 208 states have (on average 1.4951923076923077) internal successors, (311), 209 states have internal predecessors, (311), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) 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 07:06:08,018 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-01-09 07:06:08,018 INFO L93 Difference]: Finished difference Result 397 states and 591 transitions. [2025-01-09 07:06:08,019 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2025-01-09 07:06:08,020 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 07:06:08,021 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-01-09 07:06:08,027 INFO L225 Difference]: With dead ends: 397 [2025-01-09 07:06:08,027 INFO L226 Difference]: Without dead ends: 209 [2025-01-09 07:06:08,031 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 07:06:08,033 INFO L435 NwaCegarLoop]: 305 mSDtfsCounter, 0 mSDsluCounter, 604 mSDsCounter, 0 mSdLazyCounter, 11 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 0 SdHoareTripleChecker+Valid, 909 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 07:06:08,034 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [0 Valid, 909 Invalid, 11 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 11 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2025-01-09 07:06:08,046 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 209 states. [2025-01-09 07:06:08,060 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 209 to 209. [2025-01-09 07:06:08,063 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 209 states, 208 states have (on average 1.4855769230769231) internal successors, (309), 208 states have internal predecessors, (309), 0 states have call successors, (0), 0 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 07:06:08,069 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 209 states to 209 states and 309 transitions. [2025-01-09 07:06:08,071 INFO L78 Accepts]: Start accepts. Automaton has 209 states and 309 transitions. Word has length 41 [2025-01-09 07:06:08,071 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-01-09 07:06:08,071 INFO L471 AbstractCegarLoop]: Abstraction has 209 states and 309 transitions. [2025-01-09 07:06:08,071 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 07:06:08,071 INFO L276 IsEmpty]: Start isEmpty. Operand 209 states and 309 transitions. [2025-01-09 07:06:08,074 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 43 [2025-01-09 07:06:08,074 INFO L210 NwaCegarLoop]: Found error trace [2025-01-09 07:06:08,074 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 07:06:08,075 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable0 [2025-01-09 07:06:08,075 INFO L396 AbstractCegarLoop]: === Iteration 2 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-01-09 07:06:08,075 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-01-09 07:06:08,075 INFO L85 PathProgramCache]: Analyzing trace with hash -1917923931, now seen corresponding path program 1 times [2025-01-09 07:06:08,076 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-01-09 07:06:08,076 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1910546133] [2025-01-09 07:06:08,076 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-01-09 07:06:08,076 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-01-09 07:06:08,110 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 42 statements into 1 equivalence classes. [2025-01-09 07:06:08,155 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 42 of 42 statements. [2025-01-09 07:06:08,155 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-01-09 07:06:08,155 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-01-09 07:06:08,371 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 07:06:08,372 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-01-09 07:06:08,372 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1910546133] [2025-01-09 07:06:08,372 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1910546133] provided 1 perfect and 0 imperfect interpolant sequences [2025-01-09 07:06:08,372 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-01-09 07:06:08,372 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2025-01-09 07:06:08,372 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1669858659] [2025-01-09 07:06:08,372 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-01-09 07:06:08,374 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2025-01-09 07:06:08,374 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-01-09 07:06:08,374 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2025-01-09 07:06:08,375 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2025-01-09 07:06:08,375 INFO L87 Difference]: Start difference. First operand 209 states and 309 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 07:06:08,417 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-01-09 07:06:08,417 INFO L93 Difference]: Finished difference Result 398 states and 589 transitions. [2025-01-09 07:06:08,418 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2025-01-09 07:06:08,418 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 07:06:08,418 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-01-09 07:06:08,419 INFO L225 Difference]: With dead ends: 398 [2025-01-09 07:06:08,419 INFO L226 Difference]: Without dead ends: 211 [2025-01-09 07:06:08,419 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 07:06:08,420 INFO L435 NwaCegarLoop]: 305 mSDtfsCounter, 0 mSDsluCounter, 600 mSDsCounter, 0 mSdLazyCounter, 15 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 0 SdHoareTripleChecker+Valid, 905 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 07:06:08,420 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [0 Valid, 905 Invalid, 15 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 15 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2025-01-09 07:06:08,421 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 211 states. [2025-01-09 07:06:08,427 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 211 to 211. [2025-01-09 07:06:08,428 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 211 states, 210 states have (on average 1.480952380952381) internal successors, (311), 210 states have internal predecessors, (311), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-01-09 07:06:08,429 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 211 states to 211 states and 311 transitions. [2025-01-09 07:06:08,429 INFO L78 Accepts]: Start accepts. Automaton has 211 states and 311 transitions. Word has length 42 [2025-01-09 07:06:08,429 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-01-09 07:06:08,429 INFO L471 AbstractCegarLoop]: Abstraction has 211 states and 311 transitions. [2025-01-09 07:06:08,429 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 07:06:08,429 INFO L276 IsEmpty]: Start isEmpty. Operand 211 states and 311 transitions. [2025-01-09 07:06:08,432 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 44 [2025-01-09 07:06:08,432 INFO L210 NwaCegarLoop]: Found error trace [2025-01-09 07:06:08,433 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 07:06:08,433 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable1 [2025-01-09 07:06:08,433 INFO L396 AbstractCegarLoop]: === Iteration 3 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-01-09 07:06:08,433 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-01-09 07:06:08,434 INFO L85 PathProgramCache]: Analyzing trace with hash -424065425, now seen corresponding path program 1 times [2025-01-09 07:06:08,434 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-01-09 07:06:08,434 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [882334741] [2025-01-09 07:06:08,434 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-01-09 07:06:08,434 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-01-09 07:06:08,478 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 43 statements into 1 equivalence classes. [2025-01-09 07:06:08,599 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 43 of 43 statements. [2025-01-09 07:06:08,599 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-01-09 07:06:08,599 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-01-09 07:06:08,944 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 07:06:08,944 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-01-09 07:06:08,944 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [882334741] [2025-01-09 07:06:08,945 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [882334741] provided 1 perfect and 0 imperfect interpolant sequences [2025-01-09 07:06:08,945 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-01-09 07:06:08,945 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2025-01-09 07:06:08,945 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [99944677] [2025-01-09 07:06:08,945 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-01-09 07:06:08,945 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2025-01-09 07:06:08,945 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-01-09 07:06:08,946 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2025-01-09 07:06:08,946 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=10, Invalid=20, Unknown=0, NotChecked=0, Total=30 [2025-01-09 07:06:08,947 INFO L87 Difference]: Start difference. First operand 211 states and 311 transitions. Second operand has 6 states, 6 states have (on average 7.166666666666667) internal successors, (43), 6 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 07:06:09,009 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-01-09 07:06:09,009 INFO L93 Difference]: Finished difference Result 408 states and 602 transitions. [2025-01-09 07:06:09,009 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2025-01-09 07:06:09,009 INFO L78 Accepts]: Start accepts. Automaton has has 6 states, 6 states have (on average 7.166666666666667) internal successors, (43), 6 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 07:06:09,010 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-01-09 07:06:09,011 INFO L225 Difference]: With dead ends: 408 [2025-01-09 07:06:09,014 INFO L226 Difference]: Without dead ends: 219 [2025-01-09 07:06:09,015 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 6 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 4 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=10, Invalid=20, Unknown=0, NotChecked=0, Total=30 [2025-01-09 07:06:09,016 INFO L435 NwaCegarLoop]: 303 mSDtfsCounter, 5 mSDsluCounter, 1196 mSDsCounter, 0 mSdLazyCounter, 35 mSolverCounterSat, 1 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 5 SdHoareTripleChecker+Valid, 1499 SdHoareTripleChecker+Invalid, 36 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 1 IncrementalHoareTripleChecker+Valid, 35 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2025-01-09 07:06:09,016 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [5 Valid, 1499 Invalid, 36 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [1 Valid, 35 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2025-01-09 07:06:09,017 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 219 states. [2025-01-09 07:06:09,025 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 219 to 216. [2025-01-09 07:06:09,026 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 216 states, 215 states have (on average 1.4744186046511627) internal successors, (317), 215 states have internal predecessors, (317), 0 states have call successors, (0), 0 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 07:06:09,028 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 216 states to 216 states and 317 transitions. [2025-01-09 07:06:09,028 INFO L78 Accepts]: Start accepts. Automaton has 216 states and 317 transitions. Word has length 43 [2025-01-09 07:06:09,028 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-01-09 07:06:09,028 INFO L471 AbstractCegarLoop]: Abstraction has 216 states and 317 transitions. [2025-01-09 07:06:09,029 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 6 states have (on average 7.166666666666667) internal successors, (43), 6 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 07:06:09,029 INFO L276 IsEmpty]: Start isEmpty. Operand 216 states and 317 transitions. [2025-01-09 07:06:09,029 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 45 [2025-01-09 07:06:09,030 INFO L210 NwaCegarLoop]: Found error trace [2025-01-09 07:06:09,030 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 07:06:09,030 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable2 [2025-01-09 07:06:09,031 INFO L396 AbstractCegarLoop]: === Iteration 4 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-01-09 07:06:09,031 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-01-09 07:06:09,031 INFO L85 PathProgramCache]: Analyzing trace with hash 1517625508, now seen corresponding path program 1 times [2025-01-09 07:06:09,032 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-01-09 07:06:09,032 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [486366700] [2025-01-09 07:06:09,032 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-01-09 07:06:09,032 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-01-09 07:06:09,060 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 44 statements into 1 equivalence classes. [2025-01-09 07:06:09,162 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 44 of 44 statements. [2025-01-09 07:06:09,162 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-01-09 07:06:09,162 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-01-09 07:06:09,498 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 07:06:09,498 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-01-09 07:06:09,498 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [486366700] [2025-01-09 07:06:09,498 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [486366700] provided 1 perfect and 0 imperfect interpolant sequences [2025-01-09 07:06:09,498 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-01-09 07:06:09,499 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2025-01-09 07:06:09,499 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [928252515] [2025-01-09 07:06:09,499 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-01-09 07:06:09,499 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 7 states [2025-01-09 07:06:09,499 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-01-09 07:06:09,499 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2025-01-09 07:06:09,499 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=12, Invalid=30, Unknown=0, NotChecked=0, Total=42 [2025-01-09 07:06:09,499 INFO L87 Difference]: Start difference. First operand 216 states and 317 transitions. Second operand has 7 states, 7 states have (on average 6.285714285714286) internal successors, (44), 7 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 07:06:09,560 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-01-09 07:06:09,560 INFO L93 Difference]: Finished difference Result 419 states and 615 transitions. [2025-01-09 07:06:09,561 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2025-01-09 07:06:09,561 INFO L78 Accepts]: Start accepts. Automaton has has 7 states, 7 states have (on average 6.285714285714286) internal successors, (44), 7 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 07:06:09,561 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-01-09 07:06:09,562 INFO L225 Difference]: With dead ends: 419 [2025-01-09 07:06:09,562 INFO L226 Difference]: Without dead ends: 225 [2025-01-09 07:06:09,562 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 7 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 5 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=12, Invalid=30, Unknown=0, NotChecked=0, Total=42 [2025-01-09 07:06:09,563 INFO L435 NwaCegarLoop]: 298 mSDtfsCounter, 7 mSDsluCounter, 1182 mSDsCounter, 0 mSdLazyCounter, 58 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 7 SdHoareTripleChecker+Valid, 1480 SdHoareTripleChecker+Invalid, 58 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 58 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2025-01-09 07:06:09,563 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [7 Valid, 1480 Invalid, 58 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 58 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2025-01-09 07:06:09,563 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 225 states. [2025-01-09 07:06:09,569 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 225 to 220. [2025-01-09 07:06:09,573 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 220 states, 219 states have (on average 1.4703196347031964) internal successors, (322), 219 states have internal predecessors, (322), 0 states have call successors, (0), 0 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 07:06:09,575 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 220 states to 220 states and 322 transitions. [2025-01-09 07:06:09,576 INFO L78 Accepts]: Start accepts. Automaton has 220 states and 322 transitions. Word has length 44 [2025-01-09 07:06:09,576 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-01-09 07:06:09,576 INFO L471 AbstractCegarLoop]: Abstraction has 220 states and 322 transitions. [2025-01-09 07:06:09,576 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 7 states, 7 states have (on average 6.285714285714286) internal successors, (44), 7 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 07:06:09,576 INFO L276 IsEmpty]: Start isEmpty. Operand 220 states and 322 transitions. [2025-01-09 07:06:09,577 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 45 [2025-01-09 07:06:09,579 INFO L210 NwaCegarLoop]: Found error trace [2025-01-09 07:06:09,579 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 07:06:09,579 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable3 [2025-01-09 07:06:09,579 INFO L396 AbstractCegarLoop]: === Iteration 5 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-01-09 07:06:09,580 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-01-09 07:06:09,580 INFO L85 PathProgramCache]: Analyzing trace with hash -785657493, now seen corresponding path program 1 times [2025-01-09 07:06:09,580 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-01-09 07:06:09,580 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1157424083] [2025-01-09 07:06:09,580 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-01-09 07:06:09,580 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-01-09 07:06:09,602 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 44 statements into 1 equivalence classes. [2025-01-09 07:06:09,706 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 44 of 44 statements. [2025-01-09 07:06:09,706 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-01-09 07:06:09,706 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-01-09 07:06:09,940 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 07:06:09,940 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-01-09 07:06:09,940 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1157424083] [2025-01-09 07:06:09,941 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1157424083] provided 1 perfect and 0 imperfect interpolant sequences [2025-01-09 07:06:09,941 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-01-09 07:06:09,942 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2025-01-09 07:06:09,942 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1333297938] [2025-01-09 07:06:09,942 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-01-09 07:06:09,942 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2025-01-09 07:06:09,942 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-01-09 07:06:09,942 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2025-01-09 07:06:09,943 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=8, Invalid=12, Unknown=0, NotChecked=0, Total=20 [2025-01-09 07:06:09,943 INFO L87 Difference]: Start difference. First operand 220 states and 322 transitions. Second operand has 5 states, 5 states have (on average 8.8) internal successors, (44), 5 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 07:06:10,023 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-01-09 07:06:10,024 INFO L93 Difference]: Finished difference Result 422 states and 618 transitions. [2025-01-09 07:06:10,024 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2025-01-09 07:06:10,024 INFO L78 Accepts]: Start accepts. Automaton has has 5 states, 5 states have (on average 8.8) internal successors, (44), 5 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 07:06:10,025 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-01-09 07:06:10,025 INFO L225 Difference]: With dead ends: 422 [2025-01-09 07:06:10,025 INFO L226 Difference]: Without dead ends: 224 [2025-01-09 07:06:10,026 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 6 GetRequests, 2 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 07:06:10,026 INFO L435 NwaCegarLoop]: 289 mSDtfsCounter, 277 mSDsluCounter, 570 mSDsCounter, 0 mSdLazyCounter, 61 mSolverCounterSat, 1 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 277 SdHoareTripleChecker+Valid, 859 SdHoareTripleChecker+Invalid, 62 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 1 IncrementalHoareTripleChecker+Valid, 61 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2025-01-09 07:06:10,026 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [277 Valid, 859 Invalid, 62 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [1 Valid, 61 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2025-01-09 07:06:10,027 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 224 states. [2025-01-09 07:06:10,032 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 224 to 223. [2025-01-09 07:06:10,032 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 223 states, 222 states have (on average 1.4639639639639639) internal successors, (325), 222 states have internal predecessors, (325), 0 states have call successors, (0), 0 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 07:06:10,037 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 223 states to 223 states and 325 transitions. [2025-01-09 07:06:10,037 INFO L78 Accepts]: Start accepts. Automaton has 223 states and 325 transitions. Word has length 44 [2025-01-09 07:06:10,037 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-01-09 07:06:10,037 INFO L471 AbstractCegarLoop]: Abstraction has 223 states and 325 transitions. [2025-01-09 07:06:10,037 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 8.8) internal successors, (44), 5 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 07:06:10,038 INFO L276 IsEmpty]: Start isEmpty. Operand 223 states and 325 transitions. [2025-01-09 07:06:10,038 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 46 [2025-01-09 07:06:10,038 INFO L210 NwaCegarLoop]: Found error trace [2025-01-09 07:06:10,038 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 07:06:10,038 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable4 [2025-01-09 07:06:10,038 INFO L396 AbstractCegarLoop]: === Iteration 6 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-01-09 07:06:10,039 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-01-09 07:06:10,039 INFO L85 PathProgramCache]: Analyzing trace with hash -1316000468, now seen corresponding path program 1 times [2025-01-09 07:06:10,039 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-01-09 07:06:10,039 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [86057878] [2025-01-09 07:06:10,039 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-01-09 07:06:10,039 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-01-09 07:06:10,062 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 45 statements into 1 equivalence classes. [2025-01-09 07:06:10,134 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 45 of 45 statements. [2025-01-09 07:06:10,134 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-01-09 07:06:10,134 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-01-09 07:06:10,868 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 07:06:10,868 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-01-09 07:06:10,868 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [86057878] [2025-01-09 07:06:10,868 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [86057878] provided 1 perfect and 0 imperfect interpolant sequences [2025-01-09 07:06:10,868 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-01-09 07:06:10,868 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [8] imperfect sequences [] total 8 [2025-01-09 07:06:10,868 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [823440306] [2025-01-09 07:06:10,868 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-01-09 07:06:10,869 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 8 states [2025-01-09 07:06:10,869 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-01-09 07:06:10,869 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2025-01-09 07:06:10,869 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=16, Invalid=40, Unknown=0, NotChecked=0, Total=56 [2025-01-09 07:06:10,869 INFO L87 Difference]: Start difference. First operand 223 states and 325 transitions. Second operand has 8 states, 8 states have (on average 5.625) internal successors, (45), 8 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 07:06:11,096 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-01-09 07:06:11,096 INFO L93 Difference]: Finished difference Result 597 states and 869 transitions. [2025-01-09 07:06:11,096 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2025-01-09 07:06:11,096 INFO L78 Accepts]: Start accepts. Automaton has has 8 states, 8 states have (on average 5.625) internal successors, (45), 8 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 07:06:11,096 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-01-09 07:06:11,097 INFO L225 Difference]: With dead ends: 597 [2025-01-09 07:06:11,097 INFO L226 Difference]: Without dead ends: 396 [2025-01-09 07:06:11,098 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 11 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 9 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 9 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=31, Invalid=79, Unknown=0, NotChecked=0, Total=110 [2025-01-09 07:06:11,098 INFO L435 NwaCegarLoop]: 281 mSDtfsCounter, 767 mSDsluCounter, 1387 mSDsCounter, 0 mSdLazyCounter, 173 mSolverCounterSat, 2 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 767 SdHoareTripleChecker+Valid, 1668 SdHoareTripleChecker+Invalid, 175 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 2 IncrementalHoareTripleChecker+Valid, 173 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.2s IncrementalHoareTripleChecker+Time [2025-01-09 07:06:11,098 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [767 Valid, 1668 Invalid, 175 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [2 Valid, 173 Invalid, 0 Unknown, 0 Unchecked, 0.2s Time] [2025-01-09 07:06:11,099 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 396 states. [2025-01-09 07:06:11,104 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 396 to 227. [2025-01-09 07:06:11,109 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 227 states, 226 states have (on average 1.4601769911504425) internal successors, (330), 226 states have internal predecessors, (330), 0 states have call successors, (0), 0 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 07:06:11,110 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 227 states to 227 states and 330 transitions. [2025-01-09 07:06:11,110 INFO L78 Accepts]: Start accepts. Automaton has 227 states and 330 transitions. Word has length 45 [2025-01-09 07:06:11,110 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-01-09 07:06:11,110 INFO L471 AbstractCegarLoop]: Abstraction has 227 states and 330 transitions. [2025-01-09 07:06:11,110 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 8 states, 8 states have (on average 5.625) internal successors, (45), 8 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 07:06:11,110 INFO L276 IsEmpty]: Start isEmpty. Operand 227 states and 330 transitions. [2025-01-09 07:06:11,110 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 46 [2025-01-09 07:06:11,110 INFO L210 NwaCegarLoop]: Found error trace [2025-01-09 07:06:11,110 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 07:06:11,110 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable5 [2025-01-09 07:06:11,111 INFO L396 AbstractCegarLoop]: === Iteration 7 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-01-09 07:06:11,111 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-01-09 07:06:11,111 INFO L85 PathProgramCache]: Analyzing trace with hash -2022362363, now seen corresponding path program 1 times [2025-01-09 07:06:11,111 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-01-09 07:06:11,111 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1797842126] [2025-01-09 07:06:11,111 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-01-09 07:06:11,111 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-01-09 07:06:11,132 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 45 statements into 1 equivalence classes. [2025-01-09 07:06:11,182 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 45 of 45 statements. [2025-01-09 07:06:11,183 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-01-09 07:06:11,183 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-01-09 07:06:11,534 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 07:06:11,535 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-01-09 07:06:11,535 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1797842126] [2025-01-09 07:06:11,535 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1797842126] provided 1 perfect and 0 imperfect interpolant sequences [2025-01-09 07:06:11,535 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-01-09 07:06:11,535 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2025-01-09 07:06:11,535 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2104431154] [2025-01-09 07:06:11,535 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-01-09 07:06:11,535 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2025-01-09 07:06:11,535 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-01-09 07:06:11,535 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2025-01-09 07:06:11,535 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=8, Invalid=12, Unknown=0, NotChecked=0, Total=20 [2025-01-09 07:06:11,536 INFO L87 Difference]: Start difference. First operand 227 states and 330 transitions. Second operand has 5 states, 5 states have (on average 9.0) internal successors, (45), 5 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 07:06:11,617 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-01-09 07:06:11,617 INFO L93 Difference]: Finished difference Result 537 states and 778 transitions. [2025-01-09 07:06:11,618 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2025-01-09 07:06:11,618 INFO L78 Accepts]: Start accepts. Automaton has has 5 states, 5 states have (on average 9.0) internal successors, (45), 5 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 07:06:11,618 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-01-09 07:06:11,619 INFO L225 Difference]: With dead ends: 537 [2025-01-09 07:06:11,619 INFO L226 Difference]: Without dead ends: 336 [2025-01-09 07:06:11,619 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 7 GetRequests, 3 SyntacticMatches, 0 SemanticMatches, 4 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=13, Invalid=17, Unknown=0, NotChecked=0, Total=30 [2025-01-09 07:06:11,620 INFO L435 NwaCegarLoop]: 289 mSDtfsCounter, 594 mSDsluCounter, 571 mSDsCounter, 0 mSdLazyCounter, 60 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 594 SdHoareTripleChecker+Valid, 860 SdHoareTripleChecker+Invalid, 60 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 60 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2025-01-09 07:06:11,620 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [594 Valid, 860 Invalid, 60 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 60 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2025-01-09 07:06:11,620 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 336 states. [2025-01-09 07:06:11,627 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 336 to 227. [2025-01-09 07:06:11,629 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 227 states, 226 states have (on average 1.4557522123893805) internal successors, (329), 226 states have internal predecessors, (329), 0 states have call successors, (0), 0 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 07:06:11,629 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 227 states to 227 states and 329 transitions. [2025-01-09 07:06:11,629 INFO L78 Accepts]: Start accepts. Automaton has 227 states and 329 transitions. Word has length 45 [2025-01-09 07:06:11,629 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-01-09 07:06:11,629 INFO L471 AbstractCegarLoop]: Abstraction has 227 states and 329 transitions. [2025-01-09 07:06:11,630 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 9.0) internal successors, (45), 5 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 07:06:11,630 INFO L276 IsEmpty]: Start isEmpty. Operand 227 states and 329 transitions. [2025-01-09 07:06:11,630 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 47 [2025-01-09 07:06:11,630 INFO L210 NwaCegarLoop]: Found error trace [2025-01-09 07:06:11,630 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 07:06:11,630 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable6 [2025-01-09 07:06:11,630 INFO L396 AbstractCegarLoop]: === Iteration 8 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-01-09 07:06:11,631 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-01-09 07:06:11,631 INFO L85 PathProgramCache]: Analyzing trace with hash -1862258922, now seen corresponding path program 1 times [2025-01-09 07:06:11,631 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-01-09 07:06:11,631 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1952339457] [2025-01-09 07:06:11,631 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-01-09 07:06:11,631 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-01-09 07:06:11,675 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 46 statements into 1 equivalence classes. [2025-01-09 07:06:11,725 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 46 of 46 statements. [2025-01-09 07:06:11,726 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-01-09 07:06:11,726 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-01-09 07:06:11,995 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 07:06:11,995 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-01-09 07:06:11,995 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1952339457] [2025-01-09 07:06:11,996 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1952339457] provided 1 perfect and 0 imperfect interpolant sequences [2025-01-09 07:06:11,996 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-01-09 07:06:11,996 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2025-01-09 07:06:11,996 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [837547558] [2025-01-09 07:06:11,996 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-01-09 07:06:11,996 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 7 states [2025-01-09 07:06:11,996 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-01-09 07:06:11,996 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2025-01-09 07:06:11,996 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=12, Invalid=30, Unknown=0, NotChecked=0, Total=42 [2025-01-09 07:06:11,996 INFO L87 Difference]: Start difference. First operand 227 states and 329 transitions. Second operand has 7 states, 7 states have (on average 6.571428571428571) internal successors, (46), 7 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 07:06:12,058 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-01-09 07:06:12,059 INFO L93 Difference]: Finished difference Result 437 states and 635 transitions. [2025-01-09 07:06:12,060 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2025-01-09 07:06:12,060 INFO L78 Accepts]: Start accepts. Automaton has has 7 states, 7 states have (on average 6.571428571428571) internal successors, (46), 7 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 07:06:12,060 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-01-09 07:06:12,061 INFO L225 Difference]: With dead ends: 437 [2025-01-09 07:06:12,061 INFO L226 Difference]: Without dead ends: 236 [2025-01-09 07:06:12,061 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 7 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 5 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=12, Invalid=30, Unknown=0, NotChecked=0, Total=42 [2025-01-09 07:06:12,062 INFO L435 NwaCegarLoop]: 298 mSDtfsCounter, 7 mSDsluCounter, 1473 mSDsCounter, 0 mSdLazyCounter, 69 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 7 SdHoareTripleChecker+Valid, 1771 SdHoareTripleChecker+Invalid, 69 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 69 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2025-01-09 07:06:12,062 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [7 Valid, 1771 Invalid, 69 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 69 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2025-01-09 07:06:12,062 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 236 states. [2025-01-09 07:06:12,070 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 236 to 231. [2025-01-09 07:06:12,071 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 231 states, 230 states have (on average 1.4521739130434783) internal successors, (334), 230 states have internal predecessors, (334), 0 states have call successors, (0), 0 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 07:06:12,071 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 231 states to 231 states and 334 transitions. [2025-01-09 07:06:12,071 INFO L78 Accepts]: Start accepts. Automaton has 231 states and 334 transitions. Word has length 46 [2025-01-09 07:06:12,071 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-01-09 07:06:12,071 INFO L471 AbstractCegarLoop]: Abstraction has 231 states and 334 transitions. [2025-01-09 07:06:12,072 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 7 states, 7 states have (on average 6.571428571428571) internal successors, (46), 7 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 07:06:12,072 INFO L276 IsEmpty]: Start isEmpty. Operand 231 states and 334 transitions. [2025-01-09 07:06:12,072 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 47 [2025-01-09 07:06:12,072 INFO L210 NwaCegarLoop]: Found error trace [2025-01-09 07:06:12,072 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 07:06:12,072 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable7 [2025-01-09 07:06:12,072 INFO L396 AbstractCegarLoop]: === Iteration 9 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-01-09 07:06:12,073 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-01-09 07:06:12,073 INFO L85 PathProgramCache]: Analyzing trace with hash -1597928529, now seen corresponding path program 1 times [2025-01-09 07:06:12,073 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-01-09 07:06:12,073 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [785543964] [2025-01-09 07:06:12,073 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-01-09 07:06:12,073 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-01-09 07:06:12,101 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 46 statements into 1 equivalence classes. [2025-01-09 07:06:12,174 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 46 of 46 statements. [2025-01-09 07:06:12,175 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-01-09 07:06:12,175 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-01-09 07:06:12,561 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 07:06:12,561 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-01-09 07:06:12,562 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [785543964] [2025-01-09 07:06:12,562 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [785543964] provided 1 perfect and 0 imperfect interpolant sequences [2025-01-09 07:06:12,562 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-01-09 07:06:12,562 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2025-01-09 07:06:12,562 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [319412057] [2025-01-09 07:06:12,562 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-01-09 07:06:12,562 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2025-01-09 07:06:12,562 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-01-09 07:06:12,563 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2025-01-09 07:06:12,563 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=8, Invalid=12, Unknown=0, NotChecked=0, Total=20 [2025-01-09 07:06:12,563 INFO L87 Difference]: Start difference. First operand 231 states and 334 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 07:06:12,683 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-01-09 07:06:12,683 INFO L93 Difference]: Finished difference Result 545 states and 786 transitions. [2025-01-09 07:06:12,684 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2025-01-09 07:06:12,684 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 07:06:12,684 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-01-09 07:06:12,685 INFO L225 Difference]: With dead ends: 545 [2025-01-09 07:06:12,686 INFO L226 Difference]: Without dead ends: 340 [2025-01-09 07:06:12,686 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 7 GetRequests, 3 SyntacticMatches, 0 SemanticMatches, 4 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=13, Invalid=17, Unknown=0, NotChecked=0, Total=30 [2025-01-09 07:06:12,686 INFO L435 NwaCegarLoop]: 289 mSDtfsCounter, 433 mSDsluCounter, 572 mSDsCounter, 0 mSdLazyCounter, 60 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 433 SdHoareTripleChecker+Valid, 861 SdHoareTripleChecker+Invalid, 60 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 60 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2025-01-09 07:06:12,687 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [433 Valid, 861 Invalid, 60 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 60 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2025-01-09 07:06:12,687 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 340 states. [2025-01-09 07:06:12,692 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 340 to 236. [2025-01-09 07:06:12,692 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 236 states, 235 states have (on average 1.4425531914893617) internal successors, (339), 235 states have internal predecessors, (339), 0 states have call successors, (0), 0 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 07:06:12,693 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 236 states to 236 states and 339 transitions. [2025-01-09 07:06:12,693 INFO L78 Accepts]: Start accepts. Automaton has 236 states and 339 transitions. Word has length 46 [2025-01-09 07:06:12,693 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-01-09 07:06:12,693 INFO L471 AbstractCegarLoop]: Abstraction has 236 states and 339 transitions. [2025-01-09 07:06:12,693 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 07:06:12,693 INFO L276 IsEmpty]: Start isEmpty. Operand 236 states and 339 transitions. [2025-01-09 07:06:12,694 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 48 [2025-01-09 07:06:12,694 INFO L210 NwaCegarLoop]: Found error trace [2025-01-09 07:06:12,694 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 07:06:12,694 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable8 [2025-01-09 07:06:12,694 INFO L396 AbstractCegarLoop]: === Iteration 10 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-01-09 07:06:12,694 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-01-09 07:06:12,694 INFO L85 PathProgramCache]: Analyzing trace with hash 1517421953, now seen corresponding path program 1 times [2025-01-09 07:06:12,694 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-01-09 07:06:12,694 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [664473892] [2025-01-09 07:06:12,694 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-01-09 07:06:12,694 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-01-09 07:06:12,729 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 47 statements into 1 equivalence classes. [2025-01-09 07:06:12,778 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 47 of 47 statements. [2025-01-09 07:06:12,778 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-01-09 07:06:12,778 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-01-09 07:06:13,081 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 07:06:13,081 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-01-09 07:06:13,081 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [664473892] [2025-01-09 07:06:13,081 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [664473892] provided 1 perfect and 0 imperfect interpolant sequences [2025-01-09 07:06:13,081 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-01-09 07:06:13,081 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2025-01-09 07:06:13,081 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [406415412] [2025-01-09 07:06:13,081 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-01-09 07:06:13,082 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 7 states [2025-01-09 07:06:13,082 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-01-09 07:06:13,082 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2025-01-09 07:06:13,082 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=12, Invalid=30, Unknown=0, NotChecked=0, Total=42 [2025-01-09 07:06:13,082 INFO L87 Difference]: Start difference. First operand 236 states and 339 transitions. Second operand has 7 states, 7 states have (on average 6.714285714285714) internal successors, (47), 7 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 07:06:13,134 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-01-09 07:06:13,134 INFO L93 Difference]: Finished difference Result 450 states and 650 transitions. [2025-01-09 07:06:13,135 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2025-01-09 07:06:13,135 INFO L78 Accepts]: Start accepts. Automaton has has 7 states, 7 states have (on average 6.714285714285714) internal successors, (47), 7 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 07:06:13,135 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-01-09 07:06:13,136 INFO L225 Difference]: With dead ends: 450 [2025-01-09 07:06:13,136 INFO L226 Difference]: Without dead ends: 245 [2025-01-09 07:06:13,136 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 7 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 5 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=12, Invalid=30, Unknown=0, NotChecked=0, Total=42 [2025-01-09 07:06:13,137 INFO L435 NwaCegarLoop]: 298 mSDtfsCounter, 7 mSDsluCounter, 1182 mSDsCounter, 0 mSdLazyCounter, 58 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 7 SdHoareTripleChecker+Valid, 1480 SdHoareTripleChecker+Invalid, 58 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 58 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2025-01-09 07:06:13,137 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [7 Valid, 1480 Invalid, 58 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 58 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2025-01-09 07:06:13,137 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 245 states. [2025-01-09 07:06:13,144 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 245 to 240. [2025-01-09 07:06:13,147 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 240 states, 239 states have (on average 1.4393305439330544) internal successors, (344), 239 states have internal predecessors, (344), 0 states have call successors, (0), 0 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 07:06:13,148 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 240 states to 240 states and 344 transitions. [2025-01-09 07:06:13,148 INFO L78 Accepts]: Start accepts. Automaton has 240 states and 344 transitions. Word has length 47 [2025-01-09 07:06:13,148 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-01-09 07:06:13,148 INFO L471 AbstractCegarLoop]: Abstraction has 240 states and 344 transitions. [2025-01-09 07:06:13,148 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 7 states, 7 states have (on average 6.714285714285714) internal successors, (47), 7 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 07:06:13,148 INFO L276 IsEmpty]: Start isEmpty. Operand 240 states and 344 transitions. [2025-01-09 07:06:13,148 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 48 [2025-01-09 07:06:13,148 INFO L210 NwaCegarLoop]: Found error trace [2025-01-09 07:06:13,148 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 07:06:13,148 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable9 [2025-01-09 07:06:13,149 INFO L396 AbstractCegarLoop]: === Iteration 11 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-01-09 07:06:13,149 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-01-09 07:06:13,149 INFO L85 PathProgramCache]: Analyzing trace with hash -1643932006, now seen corresponding path program 1 times [2025-01-09 07:06:13,149 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-01-09 07:06:13,149 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2134088198] [2025-01-09 07:06:13,149 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-01-09 07:06:13,149 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-01-09 07:06:13,175 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 47 statements into 1 equivalence classes. [2025-01-09 07:06:13,219 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 47 of 47 statements. [2025-01-09 07:06:13,220 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-01-09 07:06:13,220 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-01-09 07:06:13,810 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 07:06:13,811 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-01-09 07:06:13,811 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2134088198] [2025-01-09 07:06:13,811 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [2134088198] provided 1 perfect and 0 imperfect interpolant sequences [2025-01-09 07:06:13,811 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-01-09 07:06:13,811 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [9] imperfect sequences [] total 9 [2025-01-09 07:06:13,811 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2022863274] [2025-01-09 07:06:13,811 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-01-09 07:06:13,811 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 9 states [2025-01-09 07:06:13,811 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-01-09 07:06:13,812 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2025-01-09 07:06:13,812 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=20, Invalid=52, Unknown=0, NotChecked=0, Total=72 [2025-01-09 07:06:13,812 INFO L87 Difference]: Start difference. First operand 240 states and 344 transitions. Second operand has 9 states, 9 states have (on average 5.222222222222222) internal successors, (47), 9 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 07:06:14,008 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-01-09 07:06:14,008 INFO L93 Difference]: Finished difference Result 559 states and 803 transitions. [2025-01-09 07:06:14,009 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2025-01-09 07:06:14,009 INFO L78 Accepts]: Start accepts. Automaton has has 9 states, 9 states have (on average 5.222222222222222) internal successors, (47), 9 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 07:06:14,009 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-01-09 07:06:14,010 INFO L225 Difference]: With dead ends: 559 [2025-01-09 07:06:14,010 INFO L226 Difference]: Without dead ends: 350 [2025-01-09 07:06:14,011 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 12 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 10 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 12 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=35, Invalid=97, Unknown=0, NotChecked=0, Total=132 [2025-01-09 07:06:14,011 INFO L435 NwaCegarLoop]: 281 mSDtfsCounter, 576 mSDsluCounter, 1668 mSDsCounter, 0 mSdLazyCounter, 198 mSolverCounterSat, 2 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 576 SdHoareTripleChecker+Valid, 1949 SdHoareTripleChecker+Invalid, 200 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 2 IncrementalHoareTripleChecker+Valid, 198 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2025-01-09 07:06:14,011 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [576 Valid, 1949 Invalid, 200 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [2 Valid, 198 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2025-01-09 07:06:14,015 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 350 states. [2025-01-09 07:06:14,022 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 350 to 245. [2025-01-09 07:06:14,023 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 245 states, 244 states have (on average 1.4344262295081966) internal successors, (350), 244 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 07:06:14,023 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 245 states to 245 states and 350 transitions. [2025-01-09 07:06:14,024 INFO L78 Accepts]: Start accepts. Automaton has 245 states and 350 transitions. Word has length 47 [2025-01-09 07:06:14,024 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-01-09 07:06:14,024 INFO L471 AbstractCegarLoop]: Abstraction has 245 states and 350 transitions. [2025-01-09 07:06:14,024 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 9 states, 9 states have (on average 5.222222222222222) internal successors, (47), 9 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 07:06:14,024 INFO L276 IsEmpty]: Start isEmpty. Operand 245 states and 350 transitions. [2025-01-09 07:06:14,024 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 48 [2025-01-09 07:06:14,024 INFO L210 NwaCegarLoop]: Found error trace [2025-01-09 07:06:14,024 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 07:06:14,024 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable10 [2025-01-09 07:06:14,024 INFO L396 AbstractCegarLoop]: === Iteration 12 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-01-09 07:06:14,026 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-01-09 07:06:14,026 INFO L85 PathProgramCache]: Analyzing trace with hash 571085110, now seen corresponding path program 1 times [2025-01-09 07:06:14,027 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-01-09 07:06:14,027 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1413436177] [2025-01-09 07:06:14,027 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-01-09 07:06:14,027 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-01-09 07:06:14,052 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 47 statements into 1 equivalence classes. [2025-01-09 07:06:14,091 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 47 of 47 statements. [2025-01-09 07:06:14,091 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-01-09 07:06:14,092 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-01-09 07:06:14,362 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 07:06:14,364 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-01-09 07:06:14,364 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1413436177] [2025-01-09 07:06:14,364 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1413436177] provided 1 perfect and 0 imperfect interpolant sequences [2025-01-09 07:06:14,364 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-01-09 07:06:14,364 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [9] imperfect sequences [] total 9 [2025-01-09 07:06:14,364 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1336492646] [2025-01-09 07:06:14,364 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-01-09 07:06:14,365 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 9 states [2025-01-09 07:06:14,365 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-01-09 07:06:14,365 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2025-01-09 07:06:14,365 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=16, Invalid=56, Unknown=0, NotChecked=0, Total=72 [2025-01-09 07:06:14,365 INFO L87 Difference]: Start difference. First operand 245 states and 350 transitions. Second operand has 9 states, 9 states have (on average 5.222222222222222) internal successors, (47), 9 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 07:06:14,441 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-01-09 07:06:14,442 INFO L93 Difference]: Finished difference Result 468 states and 673 transitions. [2025-01-09 07:06:14,442 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2025-01-09 07:06:14,442 INFO L78 Accepts]: Start accepts. Automaton has has 9 states, 9 states have (on average 5.222222222222222) internal successors, (47), 9 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 07:06:14,442 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-01-09 07:06:14,443 INFO L225 Difference]: With dead ends: 468 [2025-01-09 07:06:14,443 INFO L226 Difference]: Without dead ends: 259 [2025-01-09 07:06:14,444 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 11 GetRequests, 4 SyntacticMatches, 0 SemanticMatches, 7 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=16, Invalid=56, Unknown=0, NotChecked=0, Total=72 [2025-01-09 07:06:14,444 INFO L435 NwaCegarLoop]: 296 mSDtfsCounter, 9 mSDsluCounter, 1762 mSDsCounter, 0 mSdLazyCounter, 96 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 9 SdHoareTripleChecker+Valid, 2058 SdHoareTripleChecker+Invalid, 96 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 96 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2025-01-09 07:06:14,445 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [9 Valid, 2058 Invalid, 96 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 96 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2025-01-09 07:06:14,445 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 259 states. [2025-01-09 07:06:14,448 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 259 to 255. [2025-01-09 07:06:14,449 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 255 states, 254 states have (on average 1.4291338582677164) internal successors, (363), 254 states have internal predecessors, (363), 0 states have call successors, (0), 0 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 07:06:14,450 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 255 states to 255 states and 363 transitions. [2025-01-09 07:06:14,450 INFO L78 Accepts]: Start accepts. Automaton has 255 states and 363 transitions. Word has length 47 [2025-01-09 07:06:14,450 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-01-09 07:06:14,451 INFO L471 AbstractCegarLoop]: Abstraction has 255 states and 363 transitions. [2025-01-09 07:06:14,451 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 9 states, 9 states have (on average 5.222222222222222) internal successors, (47), 9 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 07:06:14,451 INFO L276 IsEmpty]: Start isEmpty. Operand 255 states and 363 transitions. [2025-01-09 07:06:14,451 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 49 [2025-01-09 07:06:14,451 INFO L210 NwaCegarLoop]: Found error trace [2025-01-09 07:06:14,451 INFO L218 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-01-09 07:06:14,451 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable11 [2025-01-09 07:06:14,452 INFO L396 AbstractCegarLoop]: === Iteration 13 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-01-09 07:06:14,452 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-01-09 07:06:14,452 INFO L85 PathProgramCache]: Analyzing trace with hash -1849298044, now seen corresponding path program 1 times [2025-01-09 07:06:14,452 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-01-09 07:06:14,452 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1891126982] [2025-01-09 07:06:14,452 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-01-09 07:06:14,452 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-01-09 07:06:14,492 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 48 statements into 1 equivalence classes. [2025-01-09 07:06:14,528 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 48 of 48 statements. [2025-01-09 07:06:14,528 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-01-09 07:06:14,528 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-01-09 07:06:14,806 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 07:06:14,806 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-01-09 07:06:14,806 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1891126982] [2025-01-09 07:06:14,806 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1891126982] provided 1 perfect and 0 imperfect interpolant sequences [2025-01-09 07:06:14,806 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-01-09 07:06:14,806 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2025-01-09 07:06:14,806 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1056804685] [2025-01-09 07:06:14,806 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-01-09 07:06:14,807 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 7 states [2025-01-09 07:06:14,807 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-01-09 07:06:14,807 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2025-01-09 07:06:14,807 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=12, Invalid=30, Unknown=0, NotChecked=0, Total=42 [2025-01-09 07:06:14,807 INFO L87 Difference]: Start difference. First operand 255 states and 363 transitions. Second operand has 7 states, 7 states have (on average 6.857142857142857) internal successors, (48), 7 states have internal predecessors, (48), 0 states have call successors, (0), 0 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 07:06:14,864 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-01-09 07:06:14,866 INFO L93 Difference]: Finished difference Result 483 states and 693 transitions. [2025-01-09 07:06:14,866 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2025-01-09 07:06:14,866 INFO L78 Accepts]: Start accepts. Automaton has has 7 states, 7 states have (on average 6.857142857142857) internal successors, (48), 7 states have internal predecessors, (48), 0 states have call successors, (0), 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 48 [2025-01-09 07:06:14,866 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-01-09 07:06:14,867 INFO L225 Difference]: With dead ends: 483 [2025-01-09 07:06:14,867 INFO L226 Difference]: Without dead ends: 264 [2025-01-09 07:06:14,868 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 7 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 5 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=12, Invalid=30, Unknown=0, NotChecked=0, Total=42 [2025-01-09 07:06:14,869 INFO L435 NwaCegarLoop]: 298 mSDtfsCounter, 7 mSDsluCounter, 1473 mSDsCounter, 0 mSdLazyCounter, 69 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 7 SdHoareTripleChecker+Valid, 1771 SdHoareTripleChecker+Invalid, 69 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 69 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2025-01-09 07:06:14,869 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [7 Valid, 1771 Invalid, 69 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 69 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2025-01-09 07:06:14,870 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 264 states. [2025-01-09 07:06:14,874 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 264 to 259. [2025-01-09 07:06:14,875 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 259 states, 258 states have (on average 1.426356589147287) internal successors, (368), 258 states have internal predecessors, (368), 0 states have call successors, (0), 0 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 07:06:14,875 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 259 states to 259 states and 368 transitions. [2025-01-09 07:06:14,875 INFO L78 Accepts]: Start accepts. Automaton has 259 states and 368 transitions. Word has length 48 [2025-01-09 07:06:14,876 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-01-09 07:06:14,876 INFO L471 AbstractCegarLoop]: Abstraction has 259 states and 368 transitions. [2025-01-09 07:06:14,876 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 7 states, 7 states have (on average 6.857142857142857) internal successors, (48), 7 states have internal predecessors, (48), 0 states have call successors, (0), 0 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 07:06:14,876 INFO L276 IsEmpty]: Start isEmpty. Operand 259 states and 368 transitions. [2025-01-09 07:06:14,876 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 49 [2025-01-09 07:06:14,876 INFO L210 NwaCegarLoop]: Found error trace [2025-01-09 07:06:14,877 INFO L218 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-01-09 07:06:14,877 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable12 [2025-01-09 07:06:14,877 INFO L396 AbstractCegarLoop]: === Iteration 14 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-01-09 07:06:14,877 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-01-09 07:06:14,877 INFO L85 PathProgramCache]: Analyzing trace with hash 1790010952, now seen corresponding path program 1 times [2025-01-09 07:06:14,877 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-01-09 07:06:14,877 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1769835472] [2025-01-09 07:06:14,877 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-01-09 07:06:14,877 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-01-09 07:06:14,902 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 48 statements into 1 equivalence classes. [2025-01-09 07:06:14,934 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 48 of 48 statements. [2025-01-09 07:06:14,935 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-01-09 07:06:14,935 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-01-09 07:06:15,424 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 07:06:15,425 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-01-09 07:06:15,425 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1769835472] [2025-01-09 07:06:15,425 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1769835472] provided 1 perfect and 0 imperfect interpolant sequences [2025-01-09 07:06:15,425 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-01-09 07:06:15,425 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [19] imperfect sequences [] total 19 [2025-01-09 07:06:15,425 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2089221563] [2025-01-09 07:06:15,425 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-01-09 07:06:15,425 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 19 states [2025-01-09 07:06:15,426 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-01-09 07:06:15,426 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 19 interpolants. [2025-01-09 07:06:15,426 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=35, Invalid=307, Unknown=0, NotChecked=0, Total=342 [2025-01-09 07:06:15,426 INFO L87 Difference]: Start difference. First operand 259 states and 368 transitions. Second operand has 19 states, 19 states have (on average 2.526315789473684) internal successors, (48), 19 states have internal predecessors, (48), 0 states have call successors, (0), 0 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 07:06:15,822 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-01-09 07:06:15,822 INFO L93 Difference]: Finished difference Result 521 states and 745 transitions. [2025-01-09 07:06:15,822 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 19 states. [2025-01-09 07:06:15,822 INFO L78 Accepts]: Start accepts. Automaton has has 19 states, 19 states have (on average 2.526315789473684) internal successors, (48), 19 states have internal predecessors, (48), 0 states have call successors, (0), 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 48 [2025-01-09 07:06:15,823 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-01-09 07:06:15,824 INFO L225 Difference]: With dead ends: 521 [2025-01-09 07:06:15,824 INFO L226 Difference]: Without dead ends: 298 [2025-01-09 07:06:15,825 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 20 GetRequests, 3 SyntacticMatches, 0 SemanticMatches, 17 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=35, Invalid=307, Unknown=0, NotChecked=0, Total=342 [2025-01-09 07:06:15,825 INFO L435 NwaCegarLoop]: 280 mSDtfsCounter, 25 mSDsluCounter, 4710 mSDsCounter, 0 mSdLazyCounter, 709 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.3s Time, 0 mProtectedPredicate, 0 mProtectedAction, 25 SdHoareTripleChecker+Valid, 4990 SdHoareTripleChecker+Invalid, 709 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 709 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.4s IncrementalHoareTripleChecker+Time [2025-01-09 07:06:15,826 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [25 Valid, 4990 Invalid, 709 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 709 Invalid, 0 Unknown, 0 Unchecked, 0.4s Time] [2025-01-09 07:06:15,826 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 298 states. [2025-01-09 07:06:15,830 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 298 to 293. [2025-01-09 07:06:15,831 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 293 states, 292 states have (on average 1.428082191780822) internal successors, (417), 292 states have internal predecessors, (417), 0 states have call successors, (0), 0 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 07:06:15,832 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 293 states to 293 states and 417 transitions. [2025-01-09 07:06:15,832 INFO L78 Accepts]: Start accepts. Automaton has 293 states and 417 transitions. Word has length 48 [2025-01-09 07:06:15,833 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-01-09 07:06:15,833 INFO L471 AbstractCegarLoop]: Abstraction has 293 states and 417 transitions. [2025-01-09 07:06:15,833 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 19 states, 19 states have (on average 2.526315789473684) internal successors, (48), 19 states have internal predecessors, (48), 0 states have call successors, (0), 0 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 07:06:15,834 INFO L276 IsEmpty]: Start isEmpty. Operand 293 states and 417 transitions. [2025-01-09 07:06:15,834 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 49 [2025-01-09 07:06:15,834 INFO L210 NwaCegarLoop]: Found error trace [2025-01-09 07:06:15,834 INFO L218 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-01-09 07:06:15,834 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable13 [2025-01-09 07:06:15,834 INFO L396 AbstractCegarLoop]: === Iteration 15 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-01-09 07:06:15,834 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-01-09 07:06:15,835 INFO L85 PathProgramCache]: Analyzing trace with hash 1584789789, now seen corresponding path program 1 times [2025-01-09 07:06:15,835 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-01-09 07:06:15,835 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1811932091] [2025-01-09 07:06:15,835 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-01-09 07:06:15,835 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-01-09 07:06:15,860 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 48 statements into 1 equivalence classes. [2025-01-09 07:06:15,900 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 48 of 48 statements. [2025-01-09 07:06:15,900 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-01-09 07:06:15,900 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-01-09 07:06:16,497 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 07:06:16,498 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-01-09 07:06:16,498 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1811932091] [2025-01-09 07:06:16,498 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1811932091] provided 1 perfect and 0 imperfect interpolant sequences [2025-01-09 07:06:16,498 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-01-09 07:06:16,498 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [9] imperfect sequences [] total 9 [2025-01-09 07:06:16,498 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [366348491] [2025-01-09 07:06:16,498 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-01-09 07:06:16,498 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 9 states [2025-01-09 07:06:16,498 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-01-09 07:06:16,499 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2025-01-09 07:06:16,499 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=17, Invalid=55, Unknown=0, NotChecked=0, Total=72 [2025-01-09 07:06:16,499 INFO L87 Difference]: Start difference. First operand 293 states and 417 transitions. Second operand has 9 states, 9 states have (on average 5.333333333333333) internal successors, (48), 9 states have internal predecessors, (48), 0 states have call successors, (0), 0 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 07:06:16,742 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-01-09 07:06:16,742 INFO L93 Difference]: Finished difference Result 735 states and 1055 transitions. [2025-01-09 07:06:16,743 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2025-01-09 07:06:16,743 INFO L78 Accepts]: Start accepts. Automaton has has 9 states, 9 states have (on average 5.333333333333333) internal successors, (48), 9 states have internal predecessors, (48), 0 states have call successors, (0), 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 48 [2025-01-09 07:06:16,743 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-01-09 07:06:16,744 INFO L225 Difference]: With dead ends: 735 [2025-01-09 07:06:16,745 INFO L226 Difference]: Without dead ends: 478 [2025-01-09 07:06:16,745 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 15 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 13 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 16 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=51, Invalid=159, Unknown=0, NotChecked=0, Total=210 [2025-01-09 07:06:16,746 INFO L435 NwaCegarLoop]: 277 mSDtfsCounter, 786 mSDsluCounter, 1592 mSDsCounter, 0 mSdLazyCounter, 218 mSolverCounterSat, 2 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 786 SdHoareTripleChecker+Valid, 1869 SdHoareTripleChecker+Invalid, 220 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 2 IncrementalHoareTripleChecker+Valid, 218 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.2s IncrementalHoareTripleChecker+Time [2025-01-09 07:06:16,746 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [786 Valid, 1869 Invalid, 220 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [2 Valid, 218 Invalid, 0 Unknown, 0 Unchecked, 0.2s Time] [2025-01-09 07:06:16,746 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 478 states. [2025-01-09 07:06:16,751 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 478 to 298. [2025-01-09 07:06:16,751 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 298 states, 297 states have (on average 1.4242424242424243) internal successors, (423), 297 states have internal predecessors, (423), 0 states have call successors, (0), 0 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 07:06:16,752 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 298 states to 298 states and 423 transitions. [2025-01-09 07:06:16,752 INFO L78 Accepts]: Start accepts. Automaton has 298 states and 423 transitions. Word has length 48 [2025-01-09 07:06:16,753 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-01-09 07:06:16,753 INFO L471 AbstractCegarLoop]: Abstraction has 298 states and 423 transitions. [2025-01-09 07:06:16,753 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 9 states, 9 states have (on average 5.333333333333333) internal successors, (48), 9 states have internal predecessors, (48), 0 states have call successors, (0), 0 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 07:06:16,753 INFO L276 IsEmpty]: Start isEmpty. Operand 298 states and 423 transitions. [2025-01-09 07:06:16,753 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 49 [2025-01-09 07:06:16,753 INFO L210 NwaCegarLoop]: Found error trace [2025-01-09 07:06:16,753 INFO L218 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-01-09 07:06:16,753 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable14 [2025-01-09 07:06:16,754 INFO L396 AbstractCegarLoop]: === Iteration 16 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-01-09 07:06:16,754 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-01-09 07:06:16,754 INFO L85 PathProgramCache]: Analyzing trace with hash 674898361, now seen corresponding path program 1 times [2025-01-09 07:06:16,754 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-01-09 07:06:16,754 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [493930726] [2025-01-09 07:06:16,754 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-01-09 07:06:16,754 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-01-09 07:06:16,778 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 48 statements into 1 equivalence classes. [2025-01-09 07:06:16,813 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 48 of 48 statements. [2025-01-09 07:06:16,814 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-01-09 07:06:16,814 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-01-09 07:06:17,138 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 07:06:17,139 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-01-09 07:06:17,139 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [493930726] [2025-01-09 07:06:17,139 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [493930726] provided 1 perfect and 0 imperfect interpolant sequences [2025-01-09 07:06:17,139 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-01-09 07:06:17,139 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [12] imperfect sequences [] total 12 [2025-01-09 07:06:17,139 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1982166322] [2025-01-09 07:06:17,139 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-01-09 07:06:17,139 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 12 states [2025-01-09 07:06:17,139 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-01-09 07:06:17,140 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 12 interpolants. [2025-01-09 07:06:17,140 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=22, Invalid=110, Unknown=0, NotChecked=0, Total=132 [2025-01-09 07:06:17,140 INFO L87 Difference]: Start difference. First operand 298 states and 423 transitions. Second operand has 12 states, 12 states have (on average 4.0) internal successors, (48), 12 states have internal predecessors, (48), 0 states have call successors, (0), 0 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 07:06:17,270 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-01-09 07:06:17,270 INFO L93 Difference]: Finished difference Result 558 states and 798 transitions. [2025-01-09 07:06:17,271 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 12 states. [2025-01-09 07:06:17,271 INFO L78 Accepts]: Start accepts. Automaton has has 12 states, 12 states have (on average 4.0) internal successors, (48), 12 states have internal predecessors, (48), 0 states have call successors, (0), 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 48 [2025-01-09 07:06:17,271 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-01-09 07:06:17,272 INFO L225 Difference]: With dead ends: 558 [2025-01-09 07:06:17,272 INFO L226 Difference]: Without dead ends: 301 [2025-01-09 07:06:17,273 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 14 GetRequests, 4 SyntacticMatches, 0 SemanticMatches, 10 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=22, Invalid=110, Unknown=0, NotChecked=0, Total=132 [2025-01-09 07:06:17,273 INFO L435 NwaCegarLoop]: 296 mSDtfsCounter, 14 mSDsluCounter, 2636 mSDsCounter, 0 mSdLazyCounter, 208 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 14 SdHoareTripleChecker+Valid, 2932 SdHoareTripleChecker+Invalid, 208 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 208 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2025-01-09 07:06:17,273 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [14 Valid, 2932 Invalid, 208 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 208 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2025-01-09 07:06:17,274 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 301 states. [2025-01-09 07:06:17,277 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 301 to 299. [2025-01-09 07:06:17,278 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 299 states, 298 states have (on average 1.419463087248322) internal successors, (423), 298 states have internal predecessors, (423), 0 states have call successors, (0), 0 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 07:06:17,279 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 299 states to 299 states and 423 transitions. [2025-01-09 07:06:17,279 INFO L78 Accepts]: Start accepts. Automaton has 299 states and 423 transitions. Word has length 48 [2025-01-09 07:06:17,279 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-01-09 07:06:17,279 INFO L471 AbstractCegarLoop]: Abstraction has 299 states and 423 transitions. [2025-01-09 07:06:17,279 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 12 states, 12 states have (on average 4.0) internal successors, (48), 12 states have internal predecessors, (48), 0 states have call successors, (0), 0 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 07:06:17,279 INFO L276 IsEmpty]: Start isEmpty. Operand 299 states and 423 transitions. [2025-01-09 07:06:17,279 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 50 [2025-01-09 07:06:17,279 INFO L210 NwaCegarLoop]: Found error trace [2025-01-09 07:06:17,279 INFO L218 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-01-09 07:06:17,279 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable15 [2025-01-09 07:06:17,280 INFO L396 AbstractCegarLoop]: === Iteration 17 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-01-09 07:06:17,286 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-01-09 07:06:17,286 INFO L85 PathProgramCache]: Analyzing trace with hash 1425616392, now seen corresponding path program 1 times [2025-01-09 07:06:17,286 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-01-09 07:06:17,286 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [395192125] [2025-01-09 07:06:17,286 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-01-09 07:06:17,286 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-01-09 07:06:17,313 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 49 statements into 1 equivalence classes. [2025-01-09 07:06:17,344 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 49 of 49 statements. [2025-01-09 07:06:17,344 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-01-09 07:06:17,344 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-01-09 07:06:17,754 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 07:06:17,754 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-01-09 07:06:17,754 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [395192125] [2025-01-09 07:06:17,754 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [395192125] provided 1 perfect and 0 imperfect interpolant sequences [2025-01-09 07:06:17,754 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-01-09 07:06:17,754 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2025-01-09 07:06:17,754 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1116831080] [2025-01-09 07:06:17,754 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-01-09 07:06:17,755 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2025-01-09 07:06:17,755 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-01-09 07:06:17,756 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2025-01-09 07:06:17,756 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2025-01-09 07:06:17,756 INFO L87 Difference]: Start difference. First operand 299 states and 423 transitions. Second operand has 5 states, 5 states have (on average 9.8) internal successors, (49), 5 states have internal predecessors, (49), 0 states have call successors, (0), 0 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 07:06:17,859 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-01-09 07:06:17,859 INFO L93 Difference]: Finished difference Result 670 states and 956 transitions. [2025-01-09 07:06:17,859 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2025-01-09 07:06:17,860 INFO L78 Accepts]: Start accepts. Automaton has has 5 states, 5 states have (on average 9.8) internal successors, (49), 5 states have internal predecessors, (49), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 49 [2025-01-09 07:06:17,860 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-01-09 07:06:17,861 INFO L225 Difference]: With dead ends: 670 [2025-01-09 07:06:17,861 INFO L226 Difference]: Without dead ends: 412 [2025-01-09 07:06:17,861 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 8 GetRequests, 3 SyntacticMatches, 0 SemanticMatches, 5 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=17, Invalid=25, Unknown=0, NotChecked=0, Total=42 [2025-01-09 07:06:17,862 INFO L435 NwaCegarLoop]: 285 mSDtfsCounter, 599 mSDsluCounter, 563 mSDsCounter, 0 mSdLazyCounter, 73 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 599 SdHoareTripleChecker+Valid, 848 SdHoareTripleChecker+Invalid, 73 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 73 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2025-01-09 07:06:17,862 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [599 Valid, 848 Invalid, 73 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 73 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2025-01-09 07:06:17,862 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 412 states. [2025-01-09 07:06:17,867 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 412 to 307. [2025-01-09 07:06:17,868 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 307 states, 306 states have (on average 1.411764705882353) internal successors, (432), 306 states have internal predecessors, (432), 0 states have call successors, (0), 0 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 07:06:17,868 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 307 states to 307 states and 432 transitions. [2025-01-09 07:06:17,868 INFO L78 Accepts]: Start accepts. Automaton has 307 states and 432 transitions. Word has length 49 [2025-01-09 07:06:17,869 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-01-09 07:06:17,869 INFO L471 AbstractCegarLoop]: Abstraction has 307 states and 432 transitions. [2025-01-09 07:06:17,869 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 9.8) internal successors, (49), 5 states have internal predecessors, (49), 0 states have call successors, (0), 0 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 07:06:17,869 INFO L276 IsEmpty]: Start isEmpty. Operand 307 states and 432 transitions. [2025-01-09 07:06:17,869 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 50 [2025-01-09 07:06:17,869 INFO L210 NwaCegarLoop]: Found error trace [2025-01-09 07:06:17,869 INFO L218 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-01-09 07:06:17,869 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable16 [2025-01-09 07:06:17,869 INFO L396 AbstractCegarLoop]: === Iteration 18 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-01-09 07:06:17,870 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-01-09 07:06:17,870 INFO L85 PathProgramCache]: Analyzing trace with hash -24888816, now seen corresponding path program 1 times [2025-01-09 07:06:17,870 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-01-09 07:06:17,870 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [794867710] [2025-01-09 07:06:17,870 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-01-09 07:06:17,871 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-01-09 07:06:17,893 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 49 statements into 1 equivalence classes. [2025-01-09 07:06:17,926 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 49 of 49 statements. [2025-01-09 07:06:17,926 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-01-09 07:06:17,926 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-01-09 07:06:18,400 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 07:06:18,401 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-01-09 07:06:18,401 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [794867710] [2025-01-09 07:06:18,401 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [794867710] provided 1 perfect and 0 imperfect interpolant sequences [2025-01-09 07:06:18,401 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-01-09 07:06:18,401 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [18] imperfect sequences [] total 18 [2025-01-09 07:06:18,401 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [952242832] [2025-01-09 07:06:18,401 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-01-09 07:06:18,401 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 18 states [2025-01-09 07:06:18,402 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-01-09 07:06:18,402 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 18 interpolants. [2025-01-09 07:06:18,402 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=34, Invalid=272, Unknown=0, NotChecked=0, Total=306 [2025-01-09 07:06:18,402 INFO L87 Difference]: Start difference. First operand 307 states and 432 transitions. Second operand has 18 states, 18 states have (on average 2.7222222222222223) internal successors, (49), 18 states have internal predecessors, (49), 0 states have call successors, (0), 0 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 07:06:18,716 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-01-09 07:06:18,716 INFO L93 Difference]: Finished difference Result 570 states and 810 transitions. [2025-01-09 07:06:18,717 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 18 states. [2025-01-09 07:06:18,717 INFO L78 Accepts]: Start accepts. Automaton has has 18 states, 18 states have (on average 2.7222222222222223) internal successors, (49), 18 states have internal predecessors, (49), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 49 [2025-01-09 07:06:18,717 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-01-09 07:06:18,718 INFO L225 Difference]: With dead ends: 570 [2025-01-09 07:06:18,718 INFO L226 Difference]: Without dead ends: 312 [2025-01-09 07:06:18,719 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 20 GetRequests, 4 SyntacticMatches, 0 SemanticMatches, 16 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=34, Invalid=272, Unknown=0, NotChecked=0, Total=306 [2025-01-09 07:06:18,719 INFO L435 NwaCegarLoop]: 294 mSDtfsCounter, 24 mSDsluCounter, 4642 mSDsCounter, 0 mSdLazyCounter, 592 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 24 SdHoareTripleChecker+Valid, 4936 SdHoareTripleChecker+Invalid, 592 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 592 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.3s IncrementalHoareTripleChecker+Time [2025-01-09 07:06:18,720 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [24 Valid, 4936 Invalid, 592 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 592 Invalid, 0 Unknown, 0 Unchecked, 0.3s Time] [2025-01-09 07:06:18,720 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 312 states. [2025-01-09 07:06:18,723 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 312 to 308. [2025-01-09 07:06:18,724 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 308 states, 307 states have (on average 1.4104234527687296) internal successors, (433), 307 states have internal predecessors, (433), 0 states have call successors, (0), 0 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 07:06:18,725 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 308 states to 308 states and 433 transitions. [2025-01-09 07:06:18,725 INFO L78 Accepts]: Start accepts. Automaton has 308 states and 433 transitions. Word has length 49 [2025-01-09 07:06:18,725 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-01-09 07:06:18,725 INFO L471 AbstractCegarLoop]: Abstraction has 308 states and 433 transitions. [2025-01-09 07:06:18,725 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 18 states, 18 states have (on average 2.7222222222222223) internal successors, (49), 18 states have internal predecessors, (49), 0 states have call successors, (0), 0 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 07:06:18,725 INFO L276 IsEmpty]: Start isEmpty. Operand 308 states and 433 transitions. [2025-01-09 07:06:18,726 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 50 [2025-01-09 07:06:18,726 INFO L210 NwaCegarLoop]: Found error trace [2025-01-09 07:06:18,726 INFO L218 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-01-09 07:06:18,726 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable17 [2025-01-09 07:06:18,726 INFO L396 AbstractCegarLoop]: === Iteration 19 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-01-09 07:06:18,726 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-01-09 07:06:18,726 INFO L85 PathProgramCache]: Analyzing trace with hash 1384252580, now seen corresponding path program 1 times [2025-01-09 07:06:18,726 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-01-09 07:06:18,727 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [974222767] [2025-01-09 07:06:18,727 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-01-09 07:06:18,727 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-01-09 07:06:18,753 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 49 statements into 1 equivalence classes. [2025-01-09 07:06:18,791 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 49 of 49 statements. [2025-01-09 07:06:18,791 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-01-09 07:06:18,791 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-01-09 07:06:19,171 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 07:06:19,171 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-01-09 07:06:19,171 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [974222767] [2025-01-09 07:06:19,171 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [974222767] provided 1 perfect and 0 imperfect interpolant sequences [2025-01-09 07:06:19,171 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-01-09 07:06:19,171 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [15] imperfect sequences [] total 15 [2025-01-09 07:06:19,171 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [590331419] [2025-01-09 07:06:19,171 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-01-09 07:06:19,171 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 15 states [2025-01-09 07:06:19,171 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-01-09 07:06:19,172 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 15 interpolants. [2025-01-09 07:06:19,172 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=28, Invalid=182, Unknown=0, NotChecked=0, Total=210 [2025-01-09 07:06:19,172 INFO L87 Difference]: Start difference. First operand 308 states and 433 transitions. Second operand has 15 states, 15 states have (on average 3.2666666666666666) internal successors, (49), 15 states have internal predecessors, (49), 0 states have call successors, (0), 0 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 07:06:19,365 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-01-09 07:06:19,365 INFO L93 Difference]: Finished difference Result 571 states and 811 transitions. [2025-01-09 07:06:19,366 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 15 states. [2025-01-09 07:06:19,366 INFO L78 Accepts]: Start accepts. Automaton has has 15 states, 15 states have (on average 3.2666666666666666) internal successors, (49), 15 states have internal predecessors, (49), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 49 [2025-01-09 07:06:19,366 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-01-09 07:06:19,367 INFO L225 Difference]: With dead ends: 571 [2025-01-09 07:06:19,367 INFO L226 Difference]: Without dead ends: 309 [2025-01-09 07:06:19,367 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 17 GetRequests, 4 SyntacticMatches, 0 SemanticMatches, 13 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=28, Invalid=182, Unknown=0, NotChecked=0, Total=210 [2025-01-09 07:06:19,368 INFO L435 NwaCegarLoop]: 296 mSDtfsCounter, 19 mSDsluCounter, 3510 mSDsCounter, 0 mSdLazyCounter, 362 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 19 SdHoareTripleChecker+Valid, 3806 SdHoareTripleChecker+Invalid, 362 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 362 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.2s IncrementalHoareTripleChecker+Time [2025-01-09 07:06:19,368 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [19 Valid, 3806 Invalid, 362 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 362 Invalid, 0 Unknown, 0 Unchecked, 0.2s Time] [2025-01-09 07:06:19,368 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 309 states. [2025-01-09 07:06:19,372 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 309 to 306. [2025-01-09 07:06:19,372 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 306 states, 305 states have (on average 1.4098360655737705) internal successors, (430), 305 states have internal predecessors, (430), 0 states have call successors, (0), 0 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 07:06:19,373 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 306 states to 306 states and 430 transitions. [2025-01-09 07:06:19,373 INFO L78 Accepts]: Start accepts. Automaton has 306 states and 430 transitions. Word has length 49 [2025-01-09 07:06:19,373 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-01-09 07:06:19,373 INFO L471 AbstractCegarLoop]: Abstraction has 306 states and 430 transitions. [2025-01-09 07:06:19,374 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 15 states, 15 states have (on average 3.2666666666666666) internal successors, (49), 15 states have internal predecessors, (49), 0 states have call successors, (0), 0 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 07:06:19,374 INFO L276 IsEmpty]: Start isEmpty. Operand 306 states and 430 transitions. [2025-01-09 07:06:19,375 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 144 [2025-01-09 07:06:19,375 INFO L210 NwaCegarLoop]: Found error trace [2025-01-09 07:06:19,375 INFO L218 NwaCegarLoop]: trace histogram [2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-01-09 07:06:19,375 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable18 [2025-01-09 07:06:19,375 INFO L396 AbstractCegarLoop]: === Iteration 20 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-01-09 07:06:19,376 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-01-09 07:06:19,376 INFO L85 PathProgramCache]: Analyzing trace with hash -735102638, now seen corresponding path program 1 times [2025-01-09 07:06:19,376 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-01-09 07:06:19,376 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1315712008] [2025-01-09 07:06:19,376 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-01-09 07:06:19,376 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-01-09 07:06:19,424 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 143 statements into 1 equivalence classes. [2025-01-09 07:06:20,125 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 143 of 143 statements. [2025-01-09 07:06:20,125 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-01-09 07:06:20,125 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-01-09 07:06:21,954 INFO L134 CoverageAnalysis]: Checked inductivity of 28 backedges. 22 proven. 6 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-01-09 07:06:21,954 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-01-09 07:06:21,954 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1315712008] [2025-01-09 07:06:21,954 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1315712008] provided 0 perfect and 1 imperfect interpolant sequences [2025-01-09 07:06:21,954 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1136096497] [2025-01-09 07:06:21,955 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-01-09 07:06:21,955 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-01-09 07:06:21,955 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 [2025-01-09 07:06:21,958 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 07:06:21,959 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 07:06:22,275 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 143 statements into 1 equivalence classes. [2025-01-09 07:06:22,607 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 143 of 143 statements. [2025-01-09 07:06:22,607 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-01-09 07:06:22,607 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-01-09 07:06:22,615 INFO L256 TraceCheckSpWp]: Trace formula consists of 1439 conjuncts, 40 conjuncts are in the unsatisfiable core [2025-01-09 07:06:22,627 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-01-09 07:06:23,024 INFO L134 CoverageAnalysis]: Checked inductivity of 28 backedges. 28 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-01-09 07:06:23,024 INFO L308 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2025-01-09 07:06:23,024 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1136096497] provided 1 perfect and 0 imperfect interpolant sequences [2025-01-09 07:06:23,024 INFO L185 FreeRefinementEngine]: Found 1 perfect and 1 imperfect interpolant sequences. [2025-01-09 07:06:23,025 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [8] imperfect sequences [13] total 19 [2025-01-09 07:06:23,025 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1983268246] [2025-01-09 07:06:23,025 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-01-09 07:06:23,025 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 8 states [2025-01-09 07:06:23,025 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-01-09 07:06:23,026 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2025-01-09 07:06:23,026 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=60, Invalid=282, Unknown=0, NotChecked=0, Total=342 [2025-01-09 07:06:23,026 INFO L87 Difference]: Start difference. First operand 306 states and 430 transitions. Second operand has 8 states, 8 states have (on average 17.875) internal successors, (143), 8 states have internal predecessors, (143), 0 states have call successors, (0), 0 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 07:06:23,513 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-01-09 07:06:23,514 INFO L93 Difference]: Finished difference Result 756 states and 1084 transitions. [2025-01-09 07:06:23,514 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2025-01-09 07:06:23,514 INFO L78 Accepts]: Start accepts. Automaton has has 8 states, 8 states have (on average 17.875) internal successors, (143), 8 states have internal predecessors, (143), 0 states have call successors, (0), 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 07:06:23,514 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-01-09 07:06:23,516 INFO L225 Difference]: With dead ends: 756 [2025-01-09 07:06:23,516 INFO L226 Difference]: Without dead ends: 496 [2025-01-09 07:06:23,517 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 161 GetRequests, 139 SyntacticMatches, 0 SemanticMatches, 22 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 101 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=97, Invalid=455, Unknown=0, NotChecked=0, Total=552 [2025-01-09 07:06:23,517 INFO L435 NwaCegarLoop]: 175 mSDtfsCounter, 926 mSDsluCounter, 639 mSDsCounter, 0 mSdLazyCounter, 623 mSolverCounterSat, 1 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.3s Time, 0 mProtectedPredicate, 0 mProtectedAction, 926 SdHoareTripleChecker+Valid, 814 SdHoareTripleChecker+Invalid, 624 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 1 IncrementalHoareTripleChecker+Valid, 623 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.4s IncrementalHoareTripleChecker+Time [2025-01-09 07:06:23,517 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [926 Valid, 814 Invalid, 624 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [1 Valid, 623 Invalid, 0 Unknown, 0 Unchecked, 0.4s Time] [2025-01-09 07:06:23,518 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 496 states. [2025-01-09 07:06:23,522 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 496 to 354. [2025-01-09 07:06:23,522 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 354 states, 353 states have (on average 1.405099150141643) internal successors, (496), 353 states have internal predecessors, (496), 0 states have call successors, (0), 0 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 07:06:23,523 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 354 states to 354 states and 496 transitions. [2025-01-09 07:06:23,523 INFO L78 Accepts]: Start accepts. Automaton has 354 states and 496 transitions. Word has length 143 [2025-01-09 07:06:23,524 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-01-09 07:06:23,524 INFO L471 AbstractCegarLoop]: Abstraction has 354 states and 496 transitions. [2025-01-09 07:06:23,524 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 8 states, 8 states have (on average 17.875) internal successors, (143), 8 states have internal predecessors, (143), 0 states have call successors, (0), 0 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 07:06:23,524 INFO L276 IsEmpty]: Start isEmpty. Operand 354 states and 496 transitions. [2025-01-09 07:06:23,525 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 145 [2025-01-09 07:06:23,526 INFO L210 NwaCegarLoop]: Found error trace [2025-01-09 07:06:23,526 INFO L218 NwaCegarLoop]: trace histogram [2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-01-09 07:06:23,545 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 07:06:23,726 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable19,2 /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-01-09 07:06:23,727 INFO L396 AbstractCegarLoop]: === Iteration 21 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-01-09 07:06:23,727 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-01-09 07:06:23,728 INFO L85 PathProgramCache]: Analyzing trace with hash 769271356, now seen corresponding path program 1 times [2025-01-09 07:06:23,728 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-01-09 07:06:23,728 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1424116644] [2025-01-09 07:06:23,728 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-01-09 07:06:23,728 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-01-09 07:06:23,774 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 144 statements into 1 equivalence classes. [2025-01-09 07:06:24,017 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 144 of 144 statements. [2025-01-09 07:06:24,017 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-01-09 07:06:24,017 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-01-09 07:06:24,738 INFO L134 CoverageAnalysis]: Checked inductivity of 28 backedges. 28 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-01-09 07:06:24,739 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-01-09 07:06:24,739 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1424116644] [2025-01-09 07:06:24,739 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1424116644] provided 1 perfect and 0 imperfect interpolant sequences [2025-01-09 07:06:24,739 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-01-09 07:06:24,739 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2025-01-09 07:06:24,739 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1559009847] [2025-01-09 07:06:24,739 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-01-09 07:06:24,740 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 7 states [2025-01-09 07:06:24,740 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-01-09 07:06:24,740 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2025-01-09 07:06:24,740 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=16, Invalid=26, Unknown=0, NotChecked=0, Total=42 [2025-01-09 07:06:24,741 INFO L87 Difference]: Start difference. First operand 354 states and 496 transitions. Second operand has 7 states, 7 states have (on average 20.571428571428573) internal successors, (144), 7 states have internal predecessors, (144), 0 states have call successors, (0), 0 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 07:06:24,843 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-01-09 07:06:24,843 INFO L93 Difference]: Finished difference Result 709 states and 1012 transitions. [2025-01-09 07:06:24,844 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2025-01-09 07:06:24,844 INFO L78 Accepts]: Start accepts. Automaton has has 7 states, 7 states have (on average 20.571428571428573) internal successors, (144), 7 states have internal predecessors, (144), 0 states have call successors, (0), 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 144 [2025-01-09 07:06:24,844 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-01-09 07:06:24,845 INFO L225 Difference]: With dead ends: 709 [2025-01-09 07:06:24,845 INFO L226 Difference]: Without dead ends: 449 [2025-01-09 07:06:24,846 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 8 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 6 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 3 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=21, Invalid=35, Unknown=0, NotChecked=0, Total=56 [2025-01-09 07:06:24,846 INFO L435 NwaCegarLoop]: 284 mSDtfsCounter, 467 mSDsluCounter, 963 mSDsCounter, 0 mSdLazyCounter, 111 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 467 SdHoareTripleChecker+Valid, 1247 SdHoareTripleChecker+Invalid, 111 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 111 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2025-01-09 07:06:24,846 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [467 Valid, 1247 Invalid, 111 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 111 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2025-01-09 07:06:24,847 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 449 states. [2025-01-09 07:06:24,852 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 449 to 365. [2025-01-09 07:06:24,853 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 365 states, 364 states have (on average 1.4065934065934067) internal successors, (512), 364 states have internal predecessors, (512), 0 states have call successors, (0), 0 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 07:06:24,854 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 365 states to 365 states and 512 transitions. [2025-01-09 07:06:24,854 INFO L78 Accepts]: Start accepts. Automaton has 365 states and 512 transitions. Word has length 144 [2025-01-09 07:06:24,855 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-01-09 07:06:24,855 INFO L471 AbstractCegarLoop]: Abstraction has 365 states and 512 transitions. [2025-01-09 07:06:24,855 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 7 states, 7 states have (on average 20.571428571428573) internal successors, (144), 7 states have internal predecessors, (144), 0 states have call successors, (0), 0 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 07:06:24,855 INFO L276 IsEmpty]: Start isEmpty. Operand 365 states and 512 transitions. [2025-01-09 07:06:24,856 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 145 [2025-01-09 07:06:24,856 INFO L210 NwaCegarLoop]: Found error trace [2025-01-09 07:06:24,857 INFO L218 NwaCegarLoop]: trace histogram [2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-01-09 07:06:24,857 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable20 [2025-01-09 07:06:24,857 INFO L396 AbstractCegarLoop]: === Iteration 22 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-01-09 07:06:24,857 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-01-09 07:06:24,857 INFO L85 PathProgramCache]: Analyzing trace with hash 1155888661, now seen corresponding path program 1 times [2025-01-09 07:06:24,857 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-01-09 07:06:24,857 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1487018823] [2025-01-09 07:06:24,857 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-01-09 07:06:24,858 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-01-09 07:06:24,906 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 144 statements into 1 equivalence classes. [2025-01-09 07:06:25,513 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 144 of 144 statements. [2025-01-09 07:06:25,513 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-01-09 07:06:25,514 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-01-09 07:06:29,198 INFO L134 CoverageAnalysis]: Checked inductivity of 28 backedges. 22 proven. 6 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-01-09 07:06:29,199 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-01-09 07:06:29,199 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1487018823] [2025-01-09 07:06:29,199 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1487018823] provided 0 perfect and 1 imperfect interpolant sequences [2025-01-09 07:06:29,199 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [310857695] [2025-01-09 07:06:29,199 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-01-09 07:06:29,199 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-01-09 07:06:29,199 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 [2025-01-09 07:06:29,204 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 07:06:29,206 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 07:06:29,535 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 144 statements into 1 equivalence classes. [2025-01-09 07:06:29,827 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 144 of 144 statements. [2025-01-09 07:06:29,827 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-01-09 07:06:29,827 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-01-09 07:06:29,834 INFO L256 TraceCheckSpWp]: Trace formula consists of 1442 conjuncts, 40 conjuncts are in the unsatisfiable core [2025-01-09 07:06:29,845 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-01-09 07:06:30,152 INFO L134 CoverageAnalysis]: Checked inductivity of 28 backedges. 28 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-01-09 07:06:30,152 INFO L308 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2025-01-09 07:06:30,152 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [310857695] provided 1 perfect and 0 imperfect interpolant sequences [2025-01-09 07:06:30,152 INFO L185 FreeRefinementEngine]: Found 1 perfect and 1 imperfect interpolant sequences. [2025-01-09 07:06:30,153 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [8] imperfect sequences [18] total 24 [2025-01-09 07:06:30,153 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1495434423] [2025-01-09 07:06:30,153 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-01-09 07:06:30,153 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 8 states [2025-01-09 07:06:30,153 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-01-09 07:06:30,157 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2025-01-09 07:06:30,157 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=75, Invalid=477, Unknown=0, NotChecked=0, Total=552 [2025-01-09 07:06:30,157 INFO L87 Difference]: Start difference. First operand 365 states and 512 transitions. Second operand has 8 states, 8 states have (on average 18.0) internal successors, (144), 8 states have internal predecessors, (144), 0 states have call successors, (0), 0 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 07:06:30,600 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-01-09 07:06:30,600 INFO L93 Difference]: Finished difference Result 805 states and 1150 transitions. [2025-01-09 07:06:30,603 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2025-01-09 07:06:30,603 INFO L78 Accepts]: Start accepts. Automaton has has 8 states, 8 states have (on average 18.0) internal successors, (144), 8 states have internal predecessors, (144), 0 states have call successors, (0), 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 144 [2025-01-09 07:06:30,603 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-01-09 07:06:30,605 INFO L225 Difference]: With dead ends: 805 [2025-01-09 07:06:30,605 INFO L226 Difference]: Without dead ends: 518 [2025-01-09 07:06:30,606 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 167 GetRequests, 139 SyntacticMatches, 1 SemanticMatches, 27 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 216 ImplicationChecksByTransitivity, 0.3s TimeCoverageRelationStatistics Valid=112, Invalid=700, Unknown=0, NotChecked=0, Total=812 [2025-01-09 07:06:30,608 INFO L435 NwaCegarLoop]: 175 mSDtfsCounter, 972 mSDsluCounter, 638 mSDsCounter, 0 mSdLazyCounter, 636 mSolverCounterSat, 1 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.3s Time, 0 mProtectedPredicate, 0 mProtectedAction, 972 SdHoareTripleChecker+Valid, 813 SdHoareTripleChecker+Invalid, 637 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 1 IncrementalHoareTripleChecker+Valid, 636 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.4s IncrementalHoareTripleChecker+Time [2025-01-09 07:06:30,609 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [972 Valid, 813 Invalid, 637 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [1 Valid, 636 Invalid, 0 Unknown, 0 Unchecked, 0.4s Time] [2025-01-09 07:06:30,609 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 518 states. [2025-01-09 07:06:30,614 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 518 to 370. [2025-01-09 07:06:30,614 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 370 states, 369 states have (on average 1.4037940379403795) internal successors, (518), 369 states have internal predecessors, (518), 0 states have call successors, (0), 0 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 07:06:30,615 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 370 states to 370 states and 518 transitions. [2025-01-09 07:06:30,615 INFO L78 Accepts]: Start accepts. Automaton has 370 states and 518 transitions. Word has length 144 [2025-01-09 07:06:30,617 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-01-09 07:06:30,617 INFO L471 AbstractCegarLoop]: Abstraction has 370 states and 518 transitions. [2025-01-09 07:06:30,617 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 8 states, 8 states have (on average 18.0) internal successors, (144), 8 states have internal predecessors, (144), 0 states have call successors, (0), 0 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 07:06:30,617 INFO L276 IsEmpty]: Start isEmpty. Operand 370 states and 518 transitions. [2025-01-09 07:06:30,618 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 146 [2025-01-09 07:06:30,618 INFO L210 NwaCegarLoop]: Found error trace [2025-01-09 07:06:30,618 INFO L218 NwaCegarLoop]: trace histogram [2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-01-09 07:06:30,629 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (3)] Forceful destruction successful, exit code 0 [2025-01-09 07:06:30,818 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable21,3 /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-01-09 07:06:30,819 INFO L396 AbstractCegarLoop]: === Iteration 23 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-01-09 07:06:30,819 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-01-09 07:06:30,819 INFO L85 PathProgramCache]: Analyzing trace with hash 1411171662, now seen corresponding path program 1 times [2025-01-09 07:06:30,820 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-01-09 07:06:30,820 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1880521578] [2025-01-09 07:06:30,820 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-01-09 07:06:30,820 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-01-09 07:06:30,866 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 145 statements into 1 equivalence classes. [2025-01-09 07:06:31,270 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 145 of 145 statements. [2025-01-09 07:06:31,270 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-01-09 07:06:31,270 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-01-09 07:06:33,190 INFO L134 CoverageAnalysis]: Checked inductivity of 28 backedges. 23 proven. 3 refuted. 0 times theorem prover too weak. 2 trivial. 0 not checked. [2025-01-09 07:06:33,190 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-01-09 07:06:33,190 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1880521578] [2025-01-09 07:06:33,190 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1880521578] provided 0 perfect and 1 imperfect interpolant sequences [2025-01-09 07:06:33,190 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [88565786] [2025-01-09 07:06:33,190 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-01-09 07:06:33,190 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-01-09 07:06:33,191 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 [2025-01-09 07:06:33,192 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 07:06:33,194 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 07:06:33,540 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 145 statements into 1 equivalence classes. [2025-01-09 07:06:33,777 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 145 of 145 statements. [2025-01-09 07:06:33,778 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-01-09 07:06:33,778 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-01-09 07:06:33,789 INFO L256 TraceCheckSpWp]: Trace formula consists of 1445 conjuncts, 100 conjuncts are in the unsatisfiable core [2025-01-09 07:06:33,796 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-01-09 07:06:34,824 INFO L134 CoverageAnalysis]: Checked inductivity of 28 backedges. 28 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-01-09 07:06:34,824 INFO L308 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2025-01-09 07:06:34,824 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [88565786] provided 1 perfect and 0 imperfect interpolant sequences [2025-01-09 07:06:34,824 INFO L185 FreeRefinementEngine]: Found 1 perfect and 1 imperfect interpolant sequences. [2025-01-09 07:06:34,825 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [17] imperfect sequences [13] total 28 [2025-01-09 07:06:34,825 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1826671405] [2025-01-09 07:06:34,825 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-01-09 07:06:34,825 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 17 states [2025-01-09 07:06:34,825 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-01-09 07:06:34,825 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 17 interpolants. [2025-01-09 07:06:34,826 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=90, Invalid=666, Unknown=0, NotChecked=0, Total=756 [2025-01-09 07:06:34,826 INFO L87 Difference]: Start difference. First operand 370 states and 518 transitions. Second operand has 17 states, 17 states have (on average 8.529411764705882) internal successors, (145), 17 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 07:06:35,675 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-01-09 07:06:35,676 INFO L93 Difference]: Finished difference Result 866 states and 1240 transitions. [2025-01-09 07:06:35,678 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 18 states. [2025-01-09 07:06:35,678 INFO L78 Accepts]: Start accepts. Automaton has has 17 states, 17 states have (on average 8.529411764705882) internal successors, (145), 17 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 07:06:35,678 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-01-09 07:06:35,680 INFO L225 Difference]: With dead ends: 866 [2025-01-09 07:06:35,680 INFO L226 Difference]: Without dead ends: 606 [2025-01-09 07:06:35,681 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 167 GetRequests, 132 SyntacticMatches, 0 SemanticMatches, 35 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 291 ImplicationChecksByTransitivity, 0.6s TimeCoverageRelationStatistics Valid=166, Invalid=1166, Unknown=0, NotChecked=0, Total=1332 [2025-01-09 07:06:35,682 INFO L435 NwaCegarLoop]: 170 mSDtfsCounter, 931 mSDsluCounter, 1657 mSDsCounter, 0 mSdLazyCounter, 1606 mSolverCounterSat, 2 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.6s Time, 0 mProtectedPredicate, 0 mProtectedAction, 931 SdHoareTripleChecker+Valid, 1827 SdHoareTripleChecker+Invalid, 1608 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 2 IncrementalHoareTripleChecker+Valid, 1606 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.7s IncrementalHoareTripleChecker+Time [2025-01-09 07:06:35,682 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [931 Valid, 1827 Invalid, 1608 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [2 Valid, 1606 Invalid, 0 Unknown, 0 Unchecked, 0.7s Time] [2025-01-09 07:06:35,683 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 606 states. [2025-01-09 07:06:35,688 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 606 to 436. [2025-01-09 07:06:35,689 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 436 states, 435 states have (on average 1.4137931034482758) internal successors, (615), 435 states have internal predecessors, (615), 0 states have call successors, (0), 0 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 07:06:35,689 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 436 states to 436 states and 615 transitions. [2025-01-09 07:06:35,689 INFO L78 Accepts]: Start accepts. Automaton has 436 states and 615 transitions. Word has length 145 [2025-01-09 07:06:35,690 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-01-09 07:06:35,690 INFO L471 AbstractCegarLoop]: Abstraction has 436 states and 615 transitions. [2025-01-09 07:06:35,690 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 17 states, 17 states have (on average 8.529411764705882) internal successors, (145), 17 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 07:06:35,690 INFO L276 IsEmpty]: Start isEmpty. Operand 436 states and 615 transitions. [2025-01-09 07:06:35,691 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 146 [2025-01-09 07:06:35,691 INFO L210 NwaCegarLoop]: Found error trace [2025-01-09 07:06:35,691 INFO L218 NwaCegarLoop]: trace histogram [2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-01-09 07:06:35,704 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 07:06:35,891 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable22,4 /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-01-09 07:06:35,891 INFO L396 AbstractCegarLoop]: === Iteration 24 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-01-09 07:06:35,892 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-01-09 07:06:35,892 INFO L85 PathProgramCache]: Analyzing trace with hash -711752985, now seen corresponding path program 1 times [2025-01-09 07:06:35,892 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-01-09 07:06:35,892 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [835832884] [2025-01-09 07:06:35,892 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-01-09 07:06:35,892 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-01-09 07:06:35,940 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 145 statements into 1 equivalence classes. [2025-01-09 07:06:36,905 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 145 of 145 statements. [2025-01-09 07:06:36,906 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-01-09 07:06:36,906 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-01-09 07:06:39,321 INFO L134 CoverageAnalysis]: Checked inductivity of 28 backedges. 22 proven. 6 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-01-09 07:06:39,322 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-01-09 07:06:39,322 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [835832884] [2025-01-09 07:06:39,322 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [835832884] provided 0 perfect and 1 imperfect interpolant sequences [2025-01-09 07:06:39,322 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [276215698] [2025-01-09 07:06:39,322 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-01-09 07:06:39,322 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-01-09 07:06:39,322 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 [2025-01-09 07:06:39,326 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 07:06:39,349 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 07:06:39,709 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 145 statements into 1 equivalence classes. [2025-01-09 07:06:39,976 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 145 of 145 statements. [2025-01-09 07:06:39,976 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-01-09 07:06:39,976 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-01-09 07:06:39,984 INFO L256 TraceCheckSpWp]: Trace formula consists of 1445 conjuncts, 96 conjuncts are in the unsatisfiable core [2025-01-09 07:06:39,992 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-01-09 07:06:40,695 INFO L134 CoverageAnalysis]: Checked inductivity of 28 backedges. 28 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-01-09 07:06:40,695 INFO L308 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2025-01-09 07:06:40,695 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [276215698] provided 1 perfect and 0 imperfect interpolant sequences [2025-01-09 07:06:40,695 INFO L185 FreeRefinementEngine]: Found 1 perfect and 1 imperfect interpolant sequences. [2025-01-09 07:06:40,695 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [16] imperfect sequences [13] total 27 [2025-01-09 07:06:40,697 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1153248684] [2025-01-09 07:06:40,697 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-01-09 07:06:40,697 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 16 states [2025-01-09 07:06:40,697 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-01-09 07:06:40,697 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 16 interpolants. [2025-01-09 07:06:40,698 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=100, Invalid=602, Unknown=0, NotChecked=0, Total=702 [2025-01-09 07:06:40,698 INFO L87 Difference]: Start difference. First operand 436 states and 615 transitions. Second operand has 16 states, 16 states have (on average 9.0625) internal successors, (145), 16 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 07:06:41,359 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-01-09 07:06:41,359 INFO L93 Difference]: Finished difference Result 862 states and 1232 transitions. [2025-01-09 07:06:41,360 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 16 states. [2025-01-09 07:06:41,360 INFO L78 Accepts]: Start accepts. Automaton has has 16 states, 16 states have (on average 9.0625) internal successors, (145), 16 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 07:06:41,360 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-01-09 07:06:41,362 INFO L225 Difference]: With dead ends: 862 [2025-01-09 07:06:41,362 INFO L226 Difference]: Without dead ends: 602 [2025-01-09 07:06:41,363 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 163 GetRequests, 132 SyntacticMatches, 1 SemanticMatches, 30 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 236 ImplicationChecksByTransitivity, 0.4s TimeCoverageRelationStatistics Valid=138, Invalid=854, Unknown=0, NotChecked=0, Total=992 [2025-01-09 07:06:41,363 INFO L435 NwaCegarLoop]: 190 mSDtfsCounter, 826 mSDsluCounter, 1536 mSDsCounter, 0 mSdLazyCounter, 1524 mSolverCounterSat, 1 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.5s Time, 0 mProtectedPredicate, 0 mProtectedAction, 826 SdHoareTripleChecker+Valid, 1726 SdHoareTripleChecker+Invalid, 1525 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 1 IncrementalHoareTripleChecker+Valid, 1524 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.6s IncrementalHoareTripleChecker+Time [2025-01-09 07:06:41,363 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [826 Valid, 1726 Invalid, 1525 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [1 Valid, 1524 Invalid, 0 Unknown, 0 Unchecked, 0.6s Time] [2025-01-09 07:06:41,364 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 602 states. [2025-01-09 07:06:41,370 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 602 to 478. [2025-01-09 07:06:41,371 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 478 states, 477 states have (on average 1.4171907756813418) internal successors, (676), 477 states have internal predecessors, (676), 0 states have call successors, (0), 0 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 07:06:41,371 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 478 states to 478 states and 676 transitions. [2025-01-09 07:06:41,371 INFO L78 Accepts]: Start accepts. Automaton has 478 states and 676 transitions. Word has length 145 [2025-01-09 07:06:41,372 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-01-09 07:06:41,372 INFO L471 AbstractCegarLoop]: Abstraction has 478 states and 676 transitions. [2025-01-09 07:06:41,372 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 16 states, 16 states have (on average 9.0625) internal successors, (145), 16 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 07:06:41,372 INFO L276 IsEmpty]: Start isEmpty. Operand 478 states and 676 transitions. [2025-01-09 07:06:41,373 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 146 [2025-01-09 07:06:41,373 INFO L210 NwaCegarLoop]: Found error trace [2025-01-09 07:06:41,373 INFO L218 NwaCegarLoop]: trace histogram [2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-01-09 07:06:41,385 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (5)] Forceful destruction successful, exit code 0 [2025-01-09 07:06:41,573 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 5 /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable23 [2025-01-09 07:06:41,574 INFO L396 AbstractCegarLoop]: === Iteration 25 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-01-09 07:06:41,574 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-01-09 07:06:41,574 INFO L85 PathProgramCache]: Analyzing trace with hash 1338983381, now seen corresponding path program 1 times [2025-01-09 07:06:41,574 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-01-09 07:06:41,574 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2020151926] [2025-01-09 07:06:41,575 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-01-09 07:06:41,575 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-01-09 07:06:41,625 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 145 statements into 1 equivalence classes. [2025-01-09 07:06:42,684 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 145 of 145 statements. [2025-01-09 07:06:42,685 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-01-09 07:06:42,685 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-01-09 07:06:44,670 INFO L134 CoverageAnalysis]: Checked inductivity of 28 backedges. 23 proven. 3 refuted. 0 times theorem prover too weak. 2 trivial. 0 not checked. [2025-01-09 07:06:44,671 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-01-09 07:06:44,671 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2020151926] [2025-01-09 07:06:44,671 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [2020151926] provided 0 perfect and 1 imperfect interpolant sequences [2025-01-09 07:06:44,671 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [188988246] [2025-01-09 07:06:44,671 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-01-09 07:06:44,671 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-01-09 07:06:44,671 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 [2025-01-09 07:06:44,674 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 07:06:44,675 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 07:06:45,041 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 145 statements into 1 equivalence classes. [2025-01-09 07:06:45,299 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 145 of 145 statements. [2025-01-09 07:06:45,299 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-01-09 07:06:45,299 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-01-09 07:06:45,307 INFO L256 TraceCheckSpWp]: Trace formula consists of 1445 conjuncts, 72 conjuncts are in the unsatisfiable core [2025-01-09 07:06:45,311 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-01-09 07:06:45,935 INFO L134 CoverageAnalysis]: Checked inductivity of 28 backedges. 28 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-01-09 07:06:45,935 INFO L308 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2025-01-09 07:06:45,935 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [188988246] provided 1 perfect and 0 imperfect interpolant sequences [2025-01-09 07:06:45,935 INFO L185 FreeRefinementEngine]: Found 1 perfect and 1 imperfect interpolant sequences. [2025-01-09 07:06:45,935 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [14] imperfect sequences [12] total 24 [2025-01-09 07:06:45,935 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [27830148] [2025-01-09 07:06:45,935 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-01-09 07:06:45,935 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 14 states [2025-01-09 07:06:45,935 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-01-09 07:06:45,936 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 14 interpolants. [2025-01-09 07:06:45,936 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=73, Invalid=479, Unknown=0, NotChecked=0, Total=552 [2025-01-09 07:06:45,936 INFO L87 Difference]: Start difference. First operand 478 states and 676 transitions. Second operand has 14 states, 14 states have (on average 10.357142857142858) internal successors, (145), 14 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 07:06:46,643 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-01-09 07:06:46,643 INFO L93 Difference]: Finished difference Result 1086 states and 1562 transitions. [2025-01-09 07:06:46,643 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 14 states. [2025-01-09 07:06:46,644 INFO L78 Accepts]: Start accepts. Automaton has has 14 states, 14 states have (on average 10.357142857142858) internal successors, (145), 14 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 07:06:46,644 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-01-09 07:06:46,646 INFO L225 Difference]: With dead ends: 1086 [2025-01-09 07:06:46,646 INFO L226 Difference]: Without dead ends: 826 [2025-01-09 07:06:46,646 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 167 GetRequests, 136 SyntacticMatches, 2 SemanticMatches, 29 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 183 ImplicationChecksByTransitivity, 0.3s TimeCoverageRelationStatistics Valid=136, Invalid=794, Unknown=0, NotChecked=0, Total=930 [2025-01-09 07:06:46,647 INFO L435 NwaCegarLoop]: 237 mSDtfsCounter, 794 mSDsluCounter, 1891 mSDsCounter, 0 mSdLazyCounter, 1652 mSolverCounterSat, 1 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.5s Time, 0 mProtectedPredicate, 0 mProtectedAction, 794 SdHoareTripleChecker+Valid, 2128 SdHoareTripleChecker+Invalid, 1653 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 1 IncrementalHoareTripleChecker+Valid, 1652 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.6s IncrementalHoareTripleChecker+Time [2025-01-09 07:06:46,647 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [794 Valid, 2128 Invalid, 1653 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [1 Valid, 1652 Invalid, 0 Unknown, 0 Unchecked, 0.6s Time] [2025-01-09 07:06:46,649 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 826 states. [2025-01-09 07:06:46,654 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 826 to 546. [2025-01-09 07:06:46,659 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 546 states, 545 states have (on average 1.4275229357798165) internal successors, (778), 545 states have internal predecessors, (778), 0 states have call successors, (0), 0 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 07:06:46,660 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 546 states to 546 states and 778 transitions. [2025-01-09 07:06:46,660 INFO L78 Accepts]: Start accepts. Automaton has 546 states and 778 transitions. Word has length 145 [2025-01-09 07:06:46,661 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-01-09 07:06:46,661 INFO L471 AbstractCegarLoop]: Abstraction has 546 states and 778 transitions. [2025-01-09 07:06:46,661 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 14 states, 14 states have (on average 10.357142857142858) internal successors, (145), 14 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 07:06:46,661 INFO L276 IsEmpty]: Start isEmpty. Operand 546 states and 778 transitions. [2025-01-09 07:06:46,662 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 146 [2025-01-09 07:06:46,662 INFO L210 NwaCegarLoop]: Found error trace [2025-01-09 07:06:46,662 INFO L218 NwaCegarLoop]: trace histogram [2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-01-09 07:06:46,677 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (6)] Ended with exit code 0 [2025-01-09 07:06:46,863 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,SelfDestructingSolverStorable24 [2025-01-09 07:06:46,863 INFO L396 AbstractCegarLoop]: === Iteration 26 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-01-09 07:06:46,863 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-01-09 07:06:46,864 INFO L85 PathProgramCache]: Analyzing trace with hash -783941266, now seen corresponding path program 1 times [2025-01-09 07:06:46,864 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-01-09 07:06:46,864 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1111615709] [2025-01-09 07:06:46,864 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-01-09 07:06:46,864 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-01-09 07:06:46,913 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 145 statements into 1 equivalence classes. [2025-01-09 07:06:47,804 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 145 of 145 statements. [2025-01-09 07:06:47,804 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-01-09 07:06:47,805 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-01-09 07:06:50,964 INFO L134 CoverageAnalysis]: Checked inductivity of 28 backedges. 22 proven. 6 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-01-09 07:06:50,964 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-01-09 07:06:50,964 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1111615709] [2025-01-09 07:06:50,964 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1111615709] provided 0 perfect and 1 imperfect interpolant sequences [2025-01-09 07:06:50,964 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1851876504] [2025-01-09 07:06:50,964 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-01-09 07:06:50,965 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-01-09 07:06:50,965 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 [2025-01-09 07:06:50,966 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 07:06:50,967 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 07:06:51,358 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 145 statements into 1 equivalence classes. [2025-01-09 07:06:51,608 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 145 of 145 statements. [2025-01-09 07:06:51,608 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-01-09 07:06:51,608 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-01-09 07:06:51,615 INFO L256 TraceCheckSpWp]: Trace formula consists of 1445 conjuncts, 87 conjuncts are in the unsatisfiable core [2025-01-09 07:06:51,624 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-01-09 07:06:52,218 INFO L134 CoverageAnalysis]: Checked inductivity of 28 backedges. 28 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-01-09 07:06:52,218 INFO L308 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2025-01-09 07:06:52,218 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1851876504] provided 1 perfect and 0 imperfect interpolant sequences [2025-01-09 07:06:52,218 INFO L185 FreeRefinementEngine]: Found 1 perfect and 1 imperfect interpolant sequences. [2025-01-09 07:06:52,218 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [14] imperfect sequences [17] total 29 [2025-01-09 07:06:52,218 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1862078145] [2025-01-09 07:06:52,218 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-01-09 07:06:52,218 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 14 states [2025-01-09 07:06:52,218 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-01-09 07:06:52,219 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 14 interpolants. [2025-01-09 07:06:52,219 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=106, Invalid=706, Unknown=0, NotChecked=0, Total=812 [2025-01-09 07:06:52,219 INFO L87 Difference]: Start difference. First operand 546 states and 778 transitions. Second operand has 14 states, 14 states have (on average 10.357142857142858) internal successors, (145), 14 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 07:06:52,901 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-01-09 07:06:52,901 INFO L93 Difference]: Finished difference Result 1239 states and 1788 transitions. [2025-01-09 07:06:52,901 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 14 states. [2025-01-09 07:06:52,902 INFO L78 Accepts]: Start accepts. Automaton has has 14 states, 14 states have (on average 10.357142857142858) internal successors, (145), 14 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 07:06:52,902 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-01-09 07:06:52,904 INFO L225 Difference]: With dead ends: 1239 [2025-01-09 07:06:52,904 INFO L226 Difference]: Without dead ends: 979 [2025-01-09 07:06:52,905 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 173 GetRequests, 137 SyntacticMatches, 0 SemanticMatches, 36 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 351 ImplicationChecksByTransitivity, 0.4s TimeCoverageRelationStatistics Valid=192, Invalid=1214, Unknown=0, NotChecked=0, Total=1406 [2025-01-09 07:06:52,905 INFO L435 NwaCegarLoop]: 254 mSDtfsCounter, 1063 mSDsluCounter, 1350 mSDsCounter, 0 mSdLazyCounter, 1327 mSolverCounterSat, 1 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.5s Time, 0 mProtectedPredicate, 0 mProtectedAction, 1063 SdHoareTripleChecker+Valid, 1604 SdHoareTripleChecker+Invalid, 1328 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 1 IncrementalHoareTripleChecker+Valid, 1327 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.5s IncrementalHoareTripleChecker+Time [2025-01-09 07:06:52,905 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [1063 Valid, 1604 Invalid, 1328 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [1 Valid, 1327 Invalid, 0 Unknown, 0 Unchecked, 0.5s Time] [2025-01-09 07:06:52,906 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 979 states. [2025-01-09 07:06:52,911 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 979 to 649. [2025-01-09 07:06:52,912 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 649 states, 648 states have (on average 1.433641975308642) internal successors, (929), 648 states have internal predecessors, (929), 0 states have call successors, (0), 0 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 07:06:52,912 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 649 states to 649 states and 929 transitions. [2025-01-09 07:06:52,913 INFO L78 Accepts]: Start accepts. Automaton has 649 states and 929 transitions. Word has length 145 [2025-01-09 07:06:52,913 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-01-09 07:06:52,913 INFO L471 AbstractCegarLoop]: Abstraction has 649 states and 929 transitions. [2025-01-09 07:06:52,913 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 14 states, 14 states have (on average 10.357142857142858) internal successors, (145), 14 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 07:06:52,913 INFO L276 IsEmpty]: Start isEmpty. Operand 649 states and 929 transitions. [2025-01-09 07:06:52,914 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 146 [2025-01-09 07:06:52,914 INFO L210 NwaCegarLoop]: Found error trace [2025-01-09 07:06:52,914 INFO L218 NwaCegarLoop]: trace histogram [2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-01-09 07:06:52,925 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (7)] Ended with exit code 0 [2025-01-09 07:06:53,115 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,SelfDestructingSolverStorable25 [2025-01-09 07:06:53,115 INFO L396 AbstractCegarLoop]: === Iteration 27 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-01-09 07:06:53,116 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-01-09 07:06:53,116 INFO L85 PathProgramCache]: Analyzing trace with hash 685522076, now seen corresponding path program 1 times [2025-01-09 07:06:53,116 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-01-09 07:06:53,116 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [571068668] [2025-01-09 07:06:53,116 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-01-09 07:06:53,116 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-01-09 07:06:53,155 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 145 statements into 1 equivalence classes. [2025-01-09 07:06:54,245 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 145 of 145 statements. [2025-01-09 07:06:54,245 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-01-09 07:06:54,245 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-01-09 07:06:56,897 INFO L134 CoverageAnalysis]: Checked inductivity of 28 backedges. 22 proven. 5 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2025-01-09 07:06:56,897 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-01-09 07:06:56,897 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [571068668] [2025-01-09 07:06:56,897 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [571068668] provided 0 perfect and 1 imperfect interpolant sequences [2025-01-09 07:06:56,897 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1830735078] [2025-01-09 07:06:56,897 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-01-09 07:06:56,898 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-01-09 07:06:56,898 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 [2025-01-09 07:06:56,900 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 07:06:56,901 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 07:06:57,332 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 145 statements into 1 equivalence classes. [2025-01-09 07:06:57,610 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 145 of 145 statements. [2025-01-09 07:06:57,610 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-01-09 07:06:57,610 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-01-09 07:06:57,618 INFO L256 TraceCheckSpWp]: Trace formula consists of 1445 conjuncts, 83 conjuncts are in the unsatisfiable core [2025-01-09 07:06:57,622 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-01-09 07:06:58,075 INFO L134 CoverageAnalysis]: Checked inductivity of 28 backedges. 28 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-01-09 07:06:58,075 INFO L308 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2025-01-09 07:06:58,075 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1830735078] provided 1 perfect and 0 imperfect interpolant sequences [2025-01-09 07:06:58,075 INFO L185 FreeRefinementEngine]: Found 1 perfect and 1 imperfect interpolant sequences. [2025-01-09 07:06:58,075 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [12] imperfect sequences [13] total 23 [2025-01-09 07:06:58,075 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [978284072] [2025-01-09 07:06:58,075 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-01-09 07:06:58,075 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 12 states [2025-01-09 07:06:58,075 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-01-09 07:06:58,076 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 12 interpolants. [2025-01-09 07:06:58,076 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=71, Invalid=435, Unknown=0, NotChecked=0, Total=506 [2025-01-09 07:06:58,076 INFO L87 Difference]: Start difference. First operand 649 states and 929 transitions. Second operand has 12 states, 12 states have (on average 12.083333333333334) internal successors, (145), 12 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 07:06:58,581 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-01-09 07:06:58,582 INFO L93 Difference]: Finished difference Result 1284 states and 1852 transitions. [2025-01-09 07:06:58,582 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 12 states. [2025-01-09 07:06:58,582 INFO L78 Accepts]: Start accepts. Automaton has has 12 states, 12 states have (on average 12.083333333333334) internal successors, (145), 12 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 07:06:58,582 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-01-09 07:06:58,584 INFO L225 Difference]: With dead ends: 1284 [2025-01-09 07:06:58,584 INFO L226 Difference]: Without dead ends: 988 [2025-01-09 07:06:58,585 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 165 GetRequests, 139 SyntacticMatches, 0 SemanticMatches, 26 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 135 ImplicationChecksByTransitivity, 0.3s TimeCoverageRelationStatistics Valid=113, Invalid=643, Unknown=0, NotChecked=0, Total=756 [2025-01-09 07:06:58,586 INFO L435 NwaCegarLoop]: 205 mSDtfsCounter, 824 mSDsluCounter, 1099 mSDsCounter, 0 mSdLazyCounter, 1096 mSolverCounterSat, 1 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.4s Time, 0 mProtectedPredicate, 0 mProtectedAction, 824 SdHoareTripleChecker+Valid, 1304 SdHoareTripleChecker+Invalid, 1097 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 1 IncrementalHoareTripleChecker+Valid, 1096 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.4s IncrementalHoareTripleChecker+Time [2025-01-09 07:06:58,586 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [824 Valid, 1304 Invalid, 1097 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [1 Valid, 1096 Invalid, 0 Unknown, 0 Unchecked, 0.4s Time] [2025-01-09 07:06:58,587 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 988 states. [2025-01-09 07:06:58,592 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 988 to 732. [2025-01-09 07:06:58,593 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 732 states, 731 states have (on average 1.4363885088919288) internal successors, (1050), 731 states have internal predecessors, (1050), 0 states have call successors, (0), 0 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 07:06:58,594 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 732 states to 732 states and 1050 transitions. [2025-01-09 07:06:58,594 INFO L78 Accepts]: Start accepts. Automaton has 732 states and 1050 transitions. Word has length 145 [2025-01-09 07:06:58,594 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-01-09 07:06:58,594 INFO L471 AbstractCegarLoop]: Abstraction has 732 states and 1050 transitions. [2025-01-09 07:06:58,594 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 12 states, 12 states have (on average 12.083333333333334) internal successors, (145), 12 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 07:06:58,595 INFO L276 IsEmpty]: Start isEmpty. Operand 732 states and 1050 transitions. [2025-01-09 07:06:58,596 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 146 [2025-01-09 07:06:58,596 INFO L210 NwaCegarLoop]: Found error trace [2025-01-09 07:06:58,596 INFO L218 NwaCegarLoop]: trace histogram [2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-01-09 07:06:58,608 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (8)] Forceful destruction successful, exit code 0 [2025-01-09 07:06:58,796 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable26,8 /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-01-09 07:06:58,797 INFO L396 AbstractCegarLoop]: === Iteration 28 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-01-09 07:06:58,797 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-01-09 07:06:58,797 INFO L85 PathProgramCache]: Analyzing trace with hash -1437402571, now seen corresponding path program 1 times [2025-01-09 07:06:58,797 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-01-09 07:06:58,797 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [329538496] [2025-01-09 07:06:58,797 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-01-09 07:06:58,797 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-01-09 07:06:58,838 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 145 statements into 1 equivalence classes. [2025-01-09 07:06:59,521 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 145 of 145 statements. [2025-01-09 07:06:59,521 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-01-09 07:06:59,521 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-01-09 07:07:02,340 INFO L134 CoverageAnalysis]: Checked inductivity of 28 backedges. 23 proven. 3 refuted. 0 times theorem prover too weak. 2 trivial. 0 not checked. [2025-01-09 07:07:02,340 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-01-09 07:07:02,340 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [329538496] [2025-01-09 07:07:02,340 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [329538496] provided 0 perfect and 1 imperfect interpolant sequences [2025-01-09 07:07:02,340 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [462137411] [2025-01-09 07:07:02,341 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-01-09 07:07:02,341 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-01-09 07:07:02,341 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 [2025-01-09 07:07:02,342 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 07:07:02,343 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 07:07:02,791 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 145 statements into 1 equivalence classes. [2025-01-09 07:07:03,016 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 145 of 145 statements. [2025-01-09 07:07:03,017 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-01-09 07:07:03,017 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-01-09 07:07:03,024 INFO L256 TraceCheckSpWp]: Trace formula consists of 1445 conjuncts, 87 conjuncts are in the unsatisfiable core [2025-01-09 07:07:03,029 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-01-09 07:07:03,526 INFO L134 CoverageAnalysis]: Checked inductivity of 28 backedges. 28 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-01-09 07:07:03,527 INFO L308 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2025-01-09 07:07:03,527 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [462137411] provided 1 perfect and 0 imperfect interpolant sequences [2025-01-09 07:07:03,527 INFO L185 FreeRefinementEngine]: Found 1 perfect and 1 imperfect interpolant sequences. [2025-01-09 07:07:03,527 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [13] imperfect sequences [16] total 27 [2025-01-09 07:07:03,527 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [950277141] [2025-01-09 07:07:03,527 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-01-09 07:07:03,527 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 13 states [2025-01-09 07:07:03,527 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-01-09 07:07:03,528 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 13 interpolants. [2025-01-09 07:07:03,528 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=93, Invalid=609, Unknown=0, NotChecked=0, Total=702 [2025-01-09 07:07:03,528 INFO L87 Difference]: Start difference. First operand 732 states and 1050 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 07:07:04,273 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-01-09 07:07:04,273 INFO L93 Difference]: Finished difference Result 1294 states and 1866 transitions. [2025-01-09 07:07:04,273 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 13 states. [2025-01-09 07:07:04,274 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 07:07:04,274 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-01-09 07:07:04,276 INFO L225 Difference]: With dead ends: 1294 [2025-01-09 07:07:04,276 INFO L226 Difference]: Without dead ends: 1034 [2025-01-09 07:07:04,277 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 167 GetRequests, 138 SyntacticMatches, 0 SemanticMatches, 29 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 212 ImplicationChecksByTransitivity, 0.3s TimeCoverageRelationStatistics Valid=123, Invalid=807, Unknown=0, NotChecked=0, Total=930 [2025-01-09 07:07:04,277 INFO L435 NwaCegarLoop]: 222 mSDtfsCounter, 581 mSDsluCounter, 1878 mSDsCounter, 0 mSdLazyCounter, 1805 mSolverCounterSat, 1 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.6s Time, 0 mProtectedPredicate, 0 mProtectedAction, 581 SdHoareTripleChecker+Valid, 2100 SdHoareTripleChecker+Invalid, 1806 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 1 IncrementalHoareTripleChecker+Valid, 1805 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.7s IncrementalHoareTripleChecker+Time [2025-01-09 07:07:04,278 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [581 Valid, 2100 Invalid, 1806 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [1 Valid, 1805 Invalid, 0 Unknown, 0 Unchecked, 0.7s Time] [2025-01-09 07:07:04,278 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1034 states. [2025-01-09 07:07:04,284 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1034 to 727. [2025-01-09 07:07:04,285 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 727 states, 726 states have (on average 1.4352617079889807) internal successors, (1042), 726 states have internal predecessors, (1042), 0 states have call successors, (0), 0 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 07:07:04,286 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 727 states to 727 states and 1042 transitions. [2025-01-09 07:07:04,286 INFO L78 Accepts]: Start accepts. Automaton has 727 states and 1042 transitions. Word has length 145 [2025-01-09 07:07:04,286 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-01-09 07:07:04,286 INFO L471 AbstractCegarLoop]: Abstraction has 727 states and 1042 transitions. [2025-01-09 07:07:04,286 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 07:07:04,286 INFO L276 IsEmpty]: Start isEmpty. Operand 727 states and 1042 transitions. [2025-01-09 07:07:04,287 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 147 [2025-01-09 07:07:04,287 INFO L210 NwaCegarLoop]: Found error trace [2025-01-09 07:07:04,288 INFO L218 NwaCegarLoop]: trace histogram [2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-01-09 07:07:04,300 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 07:07:04,488 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,SelfDestructingSolverStorable27 [2025-01-09 07:07:04,489 INFO L396 AbstractCegarLoop]: === Iteration 29 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-01-09 07:07:04,489 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-01-09 07:07:04,489 INFO L85 PathProgramCache]: Analyzing trace with hash 2096224, now seen corresponding path program 1 times [2025-01-09 07:07:04,489 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-01-09 07:07:04,489 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1732861674] [2025-01-09 07:07:04,490 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-01-09 07:07:04,490 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-01-09 07:07:04,536 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 146 statements into 1 equivalence classes. [2025-01-09 07:07:04,569 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 146 of 146 statements. [2025-01-09 07:07:04,570 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-01-09 07:07:04,570 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-01-09 07:07:04,830 INFO L134 CoverageAnalysis]: Checked inductivity of 28 backedges. 28 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-01-09 07:07:04,830 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-01-09 07:07:04,830 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1732861674] [2025-01-09 07:07:04,830 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1732861674] provided 1 perfect and 0 imperfect interpolant sequences [2025-01-09 07:07:04,830 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-01-09 07:07:04,830 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2025-01-09 07:07:04,831 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [884369910] [2025-01-09 07:07:04,831 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-01-09 07:07:04,831 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2025-01-09 07:07:04,831 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-01-09 07:07:04,831 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2025-01-09 07:07:04,831 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=9, Invalid=21, Unknown=0, NotChecked=0, Total=30 [2025-01-09 07:07:04,831 INFO L87 Difference]: Start difference. First operand 727 states and 1042 transitions. Second operand has 6 states, 6 states have (on average 24.333333333333332) internal successors, (146), 6 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 07:07:04,975 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-01-09 07:07:04,975 INFO L93 Difference]: Finished difference Result 1427 states and 2048 transitions. [2025-01-09 07:07:04,976 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2025-01-09 07:07:04,976 INFO L78 Accepts]: Start accepts. Automaton has has 6 states, 6 states have (on average 24.333333333333332) internal successors, (146), 6 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 07:07:04,976 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-01-09 07:07:04,978 INFO L225 Difference]: With dead ends: 1427 [2025-01-09 07:07:04,978 INFO L226 Difference]: Without dead ends: 759 [2025-01-09 07:07:04,978 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 9 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 7 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 3 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=21, Invalid=51, Unknown=0, NotChecked=0, Total=72 [2025-01-09 07:07:04,979 INFO L435 NwaCegarLoop]: 404 mSDtfsCounter, 141 mSDsluCounter, 1383 mSDsCounter, 0 mSdLazyCounter, 255 mSolverCounterSat, 16 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 141 SdHoareTripleChecker+Valid, 1787 SdHoareTripleChecker+Invalid, 271 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 16 IncrementalHoareTripleChecker+Valid, 255 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2025-01-09 07:07:04,979 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [141 Valid, 1787 Invalid, 271 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [16 Valid, 255 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2025-01-09 07:07:04,979 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 759 states. [2025-01-09 07:07:04,984 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 759 to 743. [2025-01-09 07:07:04,985 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 743 states, 742 states have (on average 1.4258760107816713) internal successors, (1058), 742 states have internal predecessors, (1058), 0 states have call successors, (0), 0 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 07:07:04,985 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 743 states to 743 states and 1058 transitions. [2025-01-09 07:07:04,986 INFO L78 Accepts]: Start accepts. Automaton has 743 states and 1058 transitions. Word has length 146 [2025-01-09 07:07:04,986 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-01-09 07:07:04,986 INFO L471 AbstractCegarLoop]: Abstraction has 743 states and 1058 transitions. [2025-01-09 07:07:04,986 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 6 states have (on average 24.333333333333332) internal successors, (146), 6 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 07:07:04,986 INFO L276 IsEmpty]: Start isEmpty. Operand 743 states and 1058 transitions. [2025-01-09 07:07:04,987 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 147 [2025-01-09 07:07:04,987 INFO L210 NwaCegarLoop]: Found error trace [2025-01-09 07:07:04,987 INFO L218 NwaCegarLoop]: trace histogram [2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-01-09 07:07:04,988 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable28 [2025-01-09 07:07:04,988 INFO L396 AbstractCegarLoop]: === Iteration 30 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-01-09 07:07:04,988 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-01-09 07:07:04,988 INFO L85 PathProgramCache]: Analyzing trace with hash 1361906708, now seen corresponding path program 1 times [2025-01-09 07:07:04,988 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-01-09 07:07:04,988 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1610584677] [2025-01-09 07:07:04,988 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-01-09 07:07:04,988 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-01-09 07:07:05,029 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 146 statements into 1 equivalence classes. [2025-01-09 07:07:05,346 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 146 of 146 statements. [2025-01-09 07:07:05,346 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-01-09 07:07:05,346 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-01-09 07:07:06,146 INFO L134 CoverageAnalysis]: Checked inductivity of 28 backedges. 28 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-01-09 07:07:06,146 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-01-09 07:07:06,146 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1610584677] [2025-01-09 07:07:06,146 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1610584677] provided 1 perfect and 0 imperfect interpolant sequences [2025-01-09 07:07:06,146 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-01-09 07:07:06,146 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [9] imperfect sequences [] total 9 [2025-01-09 07:07:06,146 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1279907198] [2025-01-09 07:07:06,146 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-01-09 07:07:06,146 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 9 states [2025-01-09 07:07:06,146 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-01-09 07:07:06,147 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2025-01-09 07:07:06,147 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=19, Invalid=53, Unknown=0, NotChecked=0, Total=72 [2025-01-09 07:07:06,147 INFO L87 Difference]: Start difference. First operand 743 states and 1058 transitions. Second operand has 9 states, 9 states have (on average 16.22222222222222) internal successors, (146), 9 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 07:07:06,282 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-01-09 07:07:06,282 INFO L93 Difference]: Finished difference Result 1093 states and 1564 transitions. [2025-01-09 07:07:06,283 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2025-01-09 07:07:06,283 INFO L78 Accepts]: Start accepts. Automaton has has 9 states, 9 states have (on average 16.22222222222222) internal successors, (146), 9 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 07:07:06,283 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-01-09 07:07:06,285 INFO L225 Difference]: With dead ends: 1093 [2025-01-09 07:07:06,285 INFO L226 Difference]: Without dead ends: 831 [2025-01-09 07:07:06,285 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 14 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 12 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 17 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=52, Invalid=130, Unknown=0, NotChecked=0, Total=182 [2025-01-09 07:07:06,285 INFO L435 NwaCegarLoop]: 276 mSDtfsCounter, 722 mSDsluCounter, 1482 mSDsCounter, 0 mSdLazyCounter, 188 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 722 SdHoareTripleChecker+Valid, 1758 SdHoareTripleChecker+Invalid, 188 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 188 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2025-01-09 07:07:06,286 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [722 Valid, 1758 Invalid, 188 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 188 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2025-01-09 07:07:06,286 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 831 states. [2025-01-09 07:07:06,292 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 831 to 795. [2025-01-09 07:07:06,292 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 795 states, 794 states have (on average 1.4282115869017633) internal successors, (1134), 794 states have internal predecessors, (1134), 0 states have call successors, (0), 0 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 07:07:06,293 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 795 states to 795 states and 1134 transitions. [2025-01-09 07:07:06,293 INFO L78 Accepts]: Start accepts. Automaton has 795 states and 1134 transitions. Word has length 146 [2025-01-09 07:07:06,293 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-01-09 07:07:06,293 INFO L471 AbstractCegarLoop]: Abstraction has 795 states and 1134 transitions. [2025-01-09 07:07:06,294 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 9 states, 9 states have (on average 16.22222222222222) internal successors, (146), 9 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 07:07:06,294 INFO L276 IsEmpty]: Start isEmpty. Operand 795 states and 1134 transitions. [2025-01-09 07:07:06,295 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 147 [2025-01-09 07:07:06,295 INFO L210 NwaCegarLoop]: Found error trace [2025-01-09 07:07:06,295 INFO L218 NwaCegarLoop]: trace histogram [2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-01-09 07:07:06,295 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable29 [2025-01-09 07:07:06,295 INFO L396 AbstractCegarLoop]: === Iteration 31 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-01-09 07:07:06,296 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-01-09 07:07:06,296 INFO L85 PathProgramCache]: Analyzing trace with hash 91932127, now seen corresponding path program 1 times [2025-01-09 07:07:06,296 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-01-09 07:07:06,296 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [944185916] [2025-01-09 07:07:06,296 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-01-09 07:07:06,296 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-01-09 07:07:06,339 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 146 statements into 1 equivalence classes. [2025-01-09 07:07:06,517 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 146 of 146 statements. [2025-01-09 07:07:06,517 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-01-09 07:07:06,517 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-01-09 07:07:07,582 INFO L134 CoverageAnalysis]: Checked inductivity of 28 backedges. 28 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-01-09 07:07:07,582 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-01-09 07:07:07,582 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [944185916] [2025-01-09 07:07:07,582 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [944185916] provided 1 perfect and 0 imperfect interpolant sequences [2025-01-09 07:07:07,582 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-01-09 07:07:07,582 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [9] imperfect sequences [] total 9 [2025-01-09 07:07:07,582 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [885877825] [2025-01-09 07:07:07,582 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-01-09 07:07:07,582 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 9 states [2025-01-09 07:07:07,582 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-01-09 07:07:07,583 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2025-01-09 07:07:07,583 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=24, Invalid=48, Unknown=0, NotChecked=0, Total=72 [2025-01-09 07:07:07,583 INFO L87 Difference]: Start difference. First operand 795 states and 1134 transitions. Second operand has 9 states, 9 states have (on average 16.22222222222222) internal successors, (146), 9 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 07:07:07,693 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-01-09 07:07:07,694 INFO L93 Difference]: Finished difference Result 1338 states and 1917 transitions. [2025-01-09 07:07:07,694 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2025-01-09 07:07:07,694 INFO L78 Accepts]: Start accepts. Automaton has has 9 states, 9 states have (on average 16.22222222222222) internal successors, (146), 9 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 07:07:07,694 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-01-09 07:07:07,696 INFO L225 Difference]: With dead ends: 1338 [2025-01-09 07:07:07,696 INFO L226 Difference]: Without dead ends: 1048 [2025-01-09 07:07:07,697 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 13 GetRequests, 4 SyntacticMatches, 0 SemanticMatches, 9 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 11 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=34, Invalid=76, Unknown=0, NotChecked=0, Total=110 [2025-01-09 07:07:07,697 INFO L435 NwaCegarLoop]: 291 mSDtfsCounter, 308 mSDsluCounter, 1609 mSDsCounter, 0 mSdLazyCounter, 170 mSolverCounterSat, 2 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 308 SdHoareTripleChecker+Valid, 1900 SdHoareTripleChecker+Invalid, 172 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 2 IncrementalHoareTripleChecker+Valid, 170 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2025-01-09 07:07:07,697 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [308 Valid, 1900 Invalid, 172 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [2 Valid, 170 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2025-01-09 07:07:07,698 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1048 states. [2025-01-09 07:07:07,705 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1048 to 1048. [2025-01-09 07:07:07,706 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 1048 states, 1047 states have (on average 1.4307545367717287) internal successors, (1498), 1047 states have internal predecessors, (1498), 0 states have call successors, (0), 0 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 07:07:07,707 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1048 states to 1048 states and 1498 transitions. [2025-01-09 07:07:07,707 INFO L78 Accepts]: Start accepts. Automaton has 1048 states and 1498 transitions. Word has length 146 [2025-01-09 07:07:07,708 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-01-09 07:07:07,708 INFO L471 AbstractCegarLoop]: Abstraction has 1048 states and 1498 transitions. [2025-01-09 07:07:07,708 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 9 states, 9 states have (on average 16.22222222222222) internal successors, (146), 9 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 07:07:07,708 INFO L276 IsEmpty]: Start isEmpty. Operand 1048 states and 1498 transitions. [2025-01-09 07:07:07,709 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 147 [2025-01-09 07:07:07,709 INFO L210 NwaCegarLoop]: Found error trace [2025-01-09 07:07:07,709 INFO L218 NwaCegarLoop]: trace histogram [2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-01-09 07:07:07,710 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable30 [2025-01-09 07:07:07,710 INFO L396 AbstractCegarLoop]: === Iteration 32 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-01-09 07:07:07,710 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-01-09 07:07:07,710 INFO L85 PathProgramCache]: Analyzing trace with hash -668725156, now seen corresponding path program 1 times [2025-01-09 07:07:07,710 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-01-09 07:07:07,710 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [201064896] [2025-01-09 07:07:07,710 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-01-09 07:07:07,711 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-01-09 07:07:07,755 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 146 statements into 1 equivalence classes. [2025-01-09 07:07:08,169 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 146 of 146 statements. [2025-01-09 07:07:08,169 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-01-09 07:07:08,169 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-01-09 07:07:10,073 INFO L134 CoverageAnalysis]: Checked inductivity of 28 backedges. 23 proven. 3 refuted. 0 times theorem prover too weak. 2 trivial. 0 not checked. [2025-01-09 07:07:10,073 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-01-09 07:07:10,074 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [201064896] [2025-01-09 07:07:10,074 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [201064896] provided 0 perfect and 1 imperfect interpolant sequences [2025-01-09 07:07:10,074 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [66194464] [2025-01-09 07:07:10,074 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-01-09 07:07:10,074 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-01-09 07:07:10,074 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 [2025-01-09 07:07:10,077 INFO L229 MonitoredProcess]: Starting monitored process 10 with /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2025-01-09 07:07:10,079 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (10)] Waiting until timeout for monitored process [2025-01-09 07:07:10,602 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 146 statements into 1 equivalence classes. [2025-01-09 07:07:10,872 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 146 of 146 statements. [2025-01-09 07:07:10,872 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-01-09 07:07:10,872 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-01-09 07:07:10,882 INFO L256 TraceCheckSpWp]: Trace formula consists of 1446 conjuncts, 47 conjuncts are in the unsatisfiable core [2025-01-09 07:07:10,893 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-01-09 07:07:11,398 INFO L134 CoverageAnalysis]: Checked inductivity of 28 backedges. 28 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-01-09 07:07:11,398 INFO L308 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2025-01-09 07:07:11,398 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [66194464] provided 1 perfect and 0 imperfect interpolant sequences [2025-01-09 07:07:11,398 INFO L185 FreeRefinementEngine]: Found 1 perfect and 1 imperfect interpolant sequences. [2025-01-09 07:07:11,398 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [9] imperfect sequences [13] total 20 [2025-01-09 07:07:11,399 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1682301964] [2025-01-09 07:07:11,399 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-01-09 07:07:11,399 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 9 states [2025-01-09 07:07:11,399 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-01-09 07:07:11,399 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2025-01-09 07:07:11,399 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=55, Invalid=325, Unknown=0, NotChecked=0, Total=380 [2025-01-09 07:07:11,400 INFO L87 Difference]: Start difference. First operand 1048 states and 1498 transitions. Second operand has 9 states, 9 states have (on average 16.22222222222222) internal successors, (146), 9 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 07:07:11,878 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-01-09 07:07:11,878 INFO L93 Difference]: Finished difference Result 1923 states and 2759 transitions. [2025-01-09 07:07:11,878 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 10 states. [2025-01-09 07:07:11,879 INFO L78 Accepts]: Start accepts. Automaton has has 9 states, 9 states have (on average 16.22222222222222) internal successors, (146), 9 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 07:07:11,879 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-01-09 07:07:11,882 INFO L225 Difference]: With dead ends: 1923 [2025-01-09 07:07:11,882 INFO L226 Difference]: Without dead ends: 1601 [2025-01-09 07:07:11,883 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 164 GetRequests, 141 SyntacticMatches, 0 SemanticMatches, 23 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 113 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=87, Invalid=513, Unknown=0, NotChecked=0, Total=600 [2025-01-09 07:07:11,883 INFO L435 NwaCegarLoop]: 174 mSDtfsCounter, 430 mSDsluCounter, 1068 mSDsCounter, 0 mSdLazyCounter, 994 mSolverCounterSat, 4 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.3s Time, 0 mProtectedPredicate, 0 mProtectedAction, 430 SdHoareTripleChecker+Valid, 1242 SdHoareTripleChecker+Invalid, 998 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 4 IncrementalHoareTripleChecker+Valid, 994 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.4s IncrementalHoareTripleChecker+Time [2025-01-09 07:07:11,883 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [430 Valid, 1242 Invalid, 998 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [4 Valid, 994 Invalid, 0 Unknown, 0 Unchecked, 0.4s Time] [2025-01-09 07:07:11,885 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1601 states. [2025-01-09 07:07:11,893 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1601 to 1178. [2025-01-09 07:07:11,894 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 1178 states, 1177 states have (on average 1.4350042480883602) internal successors, (1689), 1177 states have internal predecessors, (1689), 0 states have call successors, (0), 0 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 07:07:11,895 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1178 states to 1178 states and 1689 transitions. [2025-01-09 07:07:11,895 INFO L78 Accepts]: Start accepts. Automaton has 1178 states and 1689 transitions. Word has length 146 [2025-01-09 07:07:11,896 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-01-09 07:07:11,896 INFO L471 AbstractCegarLoop]: Abstraction has 1178 states and 1689 transitions. [2025-01-09 07:07:11,896 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 9 states, 9 states have (on average 16.22222222222222) internal successors, (146), 9 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 07:07:11,896 INFO L276 IsEmpty]: Start isEmpty. Operand 1178 states and 1689 transitions. [2025-01-09 07:07:11,897 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 147 [2025-01-09 07:07:11,897 INFO L210 NwaCegarLoop]: Found error trace [2025-01-09 07:07:11,897 INFO L218 NwaCegarLoop]: trace histogram [2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-01-09 07:07:11,909 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (10)] Forceful destruction successful, exit code 0 [2025-01-09 07:07:12,098 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable31,10 /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-01-09 07:07:12,098 INFO L396 AbstractCegarLoop]: === Iteration 33 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-01-09 07:07:12,098 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-01-09 07:07:12,099 INFO L85 PathProgramCache]: Analyzing trace with hash -1932807951, now seen corresponding path program 1 times [2025-01-09 07:07:12,099 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-01-09 07:07:12,099 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [491519729] [2025-01-09 07:07:12,099 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-01-09 07:07:12,099 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-01-09 07:07:12,139 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 146 statements into 1 equivalence classes. [2025-01-09 07:07:12,508 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 146 of 146 statements. [2025-01-09 07:07:12,508 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-01-09 07:07:12,508 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-01-09 07:07:13,475 INFO L134 CoverageAnalysis]: Checked inductivity of 28 backedges. 28 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-01-09 07:07:13,475 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-01-09 07:07:13,475 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [491519729] [2025-01-09 07:07:13,475 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [491519729] provided 1 perfect and 0 imperfect interpolant sequences [2025-01-09 07:07:13,475 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-01-09 07:07:13,475 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [11] imperfect sequences [] total 11 [2025-01-09 07:07:13,475 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [953993668] [2025-01-09 07:07:13,475 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-01-09 07:07:13,475 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 11 states [2025-01-09 07:07:13,475 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-01-09 07:07:13,476 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 11 interpolants. [2025-01-09 07:07:13,476 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=24, Invalid=86, Unknown=0, NotChecked=0, Total=110 [2025-01-09 07:07:13,476 INFO L87 Difference]: Start difference. First operand 1178 states and 1689 transitions. Second operand has 11 states, 11 states have (on average 13.272727272727273) internal successors, (146), 11 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 07:07:13,686 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-01-09 07:07:13,686 INFO L93 Difference]: Finished difference Result 1713 states and 2462 transitions. [2025-01-09 07:07:13,686 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 12 states. [2025-01-09 07:07:13,687 INFO L78 Accepts]: Start accepts. Automaton has has 11 states, 11 states have (on average 13.272727272727273) internal successors, (146), 11 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 07:07:13,687 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-01-09 07:07:13,689 INFO L225 Difference]: With dead ends: 1713 [2025-01-09 07:07:13,689 INFO L226 Difference]: Without dead ends: 1224 [2025-01-09 07:07:13,690 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 18 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 16 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 44 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=65, Invalid=241, Unknown=0, NotChecked=0, Total=306 [2025-01-09 07:07:13,690 INFO L435 NwaCegarLoop]: 278 mSDtfsCounter, 515 mSDsluCounter, 2091 mSDsCounter, 0 mSdLazyCounter, 283 mSolverCounterSat, 2 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 515 SdHoareTripleChecker+Valid, 2369 SdHoareTripleChecker+Invalid, 285 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 2 IncrementalHoareTripleChecker+Valid, 283 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2025-01-09 07:07:13,691 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [515 Valid, 2369 Invalid, 285 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [2 Valid, 283 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2025-01-09 07:07:13,691 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1224 states. [2025-01-09 07:07:13,699 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1224 to 1190. [2025-01-09 07:07:13,700 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 1190 states, 1189 states have (on average 1.430613961312027) internal successors, (1701), 1189 states have internal predecessors, (1701), 0 states have call successors, (0), 0 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 07:07:13,701 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1190 states to 1190 states and 1701 transitions. [2025-01-09 07:07:13,701 INFO L78 Accepts]: Start accepts. Automaton has 1190 states and 1701 transitions. Word has length 146 [2025-01-09 07:07:13,701 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-01-09 07:07:13,701 INFO L471 AbstractCegarLoop]: Abstraction has 1190 states and 1701 transitions. [2025-01-09 07:07:13,702 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 11 states, 11 states have (on average 13.272727272727273) internal successors, (146), 11 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 07:07:13,702 INFO L276 IsEmpty]: Start isEmpty. Operand 1190 states and 1701 transitions. [2025-01-09 07:07:13,703 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 147 [2025-01-09 07:07:13,703 INFO L210 NwaCegarLoop]: Found error trace [2025-01-09 07:07:13,703 INFO L218 NwaCegarLoop]: trace histogram [2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-01-09 07:07:13,703 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable32 [2025-01-09 07:07:13,703 INFO L396 AbstractCegarLoop]: === Iteration 34 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-01-09 07:07:13,704 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-01-09 07:07:13,704 INFO L85 PathProgramCache]: Analyzing trace with hash 1879727904, now seen corresponding path program 1 times [2025-01-09 07:07:13,705 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-01-09 07:07:13,705 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1178372184] [2025-01-09 07:07:13,705 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-01-09 07:07:13,705 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-01-09 07:07:13,751 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 146 statements into 1 equivalence classes. [2025-01-09 07:07:14,628 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 146 of 146 statements. [2025-01-09 07:07:14,628 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-01-09 07:07:14,628 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-01-09 07:07:17,535 INFO L134 CoverageAnalysis]: Checked inductivity of 28 backedges. 22 proven. 5 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2025-01-09 07:07:17,535 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-01-09 07:07:17,535 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1178372184] [2025-01-09 07:07:17,535 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1178372184] provided 0 perfect and 1 imperfect interpolant sequences [2025-01-09 07:07:17,535 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1875547877] [2025-01-09 07:07:17,535 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-01-09 07:07:17,535 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-01-09 07:07:17,535 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 [2025-01-09 07:07:17,537 INFO L229 MonitoredProcess]: Starting monitored process 11 with /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2025-01-09 07:07:17,538 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (11)] Waiting until timeout for monitored process [2025-01-09 07:07:18,083 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 146 statements into 1 equivalence classes. [2025-01-09 07:07:18,271 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 146 of 146 statements. [2025-01-09 07:07:18,271 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-01-09 07:07:18,271 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-01-09 07:07:18,278 INFO L256 TraceCheckSpWp]: Trace formula consists of 1448 conjuncts, 56 conjuncts are in the unsatisfiable core [2025-01-09 07:07:18,282 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-01-09 07:07:18,742 INFO L134 CoverageAnalysis]: Checked inductivity of 28 backedges. 28 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-01-09 07:07:18,743 INFO L308 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2025-01-09 07:07:18,743 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1875547877] provided 1 perfect and 0 imperfect interpolant sequences [2025-01-09 07:07:18,743 INFO L185 FreeRefinementEngine]: Found 1 perfect and 1 imperfect interpolant sequences. [2025-01-09 07:07:18,743 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [12] imperfect sequences [17] total 27 [2025-01-09 07:07:18,743 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [783156283] [2025-01-09 07:07:18,743 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-01-09 07:07:18,743 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 12 states [2025-01-09 07:07:18,743 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-01-09 07:07:18,743 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 12 interpolants. [2025-01-09 07:07:18,744 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=80, Invalid=622, Unknown=0, NotChecked=0, Total=702 [2025-01-09 07:07:18,744 INFO L87 Difference]: Start difference. First operand 1190 states and 1701 transitions. Second operand has 12 states, 12 states have (on average 12.166666666666666) internal successors, (146), 12 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 07:07:19,320 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-01-09 07:07:19,320 INFO L93 Difference]: Finished difference Result 1865 states and 2671 transitions. [2025-01-09 07:07:19,321 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 12 states. [2025-01-09 07:07:19,321 INFO L78 Accepts]: Start accepts. Automaton has has 12 states, 12 states have (on average 12.166666666666666) internal successors, (146), 12 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 07:07:19,321 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-01-09 07:07:19,324 INFO L225 Difference]: With dead ends: 1865 [2025-01-09 07:07:19,324 INFO L226 Difference]: Without dead ends: 1442 [2025-01-09 07:07:19,325 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 170 GetRequests, 139 SyntacticMatches, 0 SemanticMatches, 31 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 288 ImplicationChecksByTransitivity, 0.3s TimeCoverageRelationStatistics Valid=114, Invalid=942, Unknown=0, NotChecked=0, Total=1056 [2025-01-09 07:07:19,325 INFO L435 NwaCegarLoop]: 231 mSDtfsCounter, 620 mSDsluCounter, 1809 mSDsCounter, 0 mSdLazyCounter, 1491 mSolverCounterSat, 2 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.4s Time, 0 mProtectedPredicate, 0 mProtectedAction, 620 SdHoareTripleChecker+Valid, 2040 SdHoareTripleChecker+Invalid, 1493 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 2 IncrementalHoareTripleChecker+Valid, 1491 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.5s IncrementalHoareTripleChecker+Time [2025-01-09 07:07:19,325 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [620 Valid, 2040 Invalid, 1493 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [2 Valid, 1491 Invalid, 0 Unknown, 0 Unchecked, 0.5s Time] [2025-01-09 07:07:19,326 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1442 states. [2025-01-09 07:07:19,333 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1442 to 1406. [2025-01-09 07:07:19,335 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 1406 states, 1405 states have (on average 1.4277580071174378) internal successors, (2006), 1405 states have internal predecessors, (2006), 0 states have call successors, (0), 0 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 07:07:19,336 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1406 states to 1406 states and 2006 transitions. [2025-01-09 07:07:19,336 INFO L78 Accepts]: Start accepts. Automaton has 1406 states and 2006 transitions. Word has length 146 [2025-01-09 07:07:19,336 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-01-09 07:07:19,336 INFO L471 AbstractCegarLoop]: Abstraction has 1406 states and 2006 transitions. [2025-01-09 07:07:19,336 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 12 states, 12 states have (on average 12.166666666666666) internal successors, (146), 12 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 07:07:19,336 INFO L276 IsEmpty]: Start isEmpty. Operand 1406 states and 2006 transitions. [2025-01-09 07:07:19,338 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 147 [2025-01-09 07:07:19,338 INFO L210 NwaCegarLoop]: Found error trace [2025-01-09 07:07:19,338 INFO L218 NwaCegarLoop]: trace histogram [2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-01-09 07:07:19,350 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (11)] Ended with exit code 0 [2025-01-09 07:07:19,538 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 11 /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable33 [2025-01-09 07:07:19,539 INFO L396 AbstractCegarLoop]: === Iteration 35 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-01-09 07:07:19,539 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-01-09 07:07:19,539 INFO L85 PathProgramCache]: Analyzing trace with hash -1829953860, now seen corresponding path program 1 times [2025-01-09 07:07:19,539 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-01-09 07:07:19,539 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1545716579] [2025-01-09 07:07:19,539 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-01-09 07:07:19,539 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-01-09 07:07:19,583 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 146 statements into 1 equivalence classes. [2025-01-09 07:07:20,069 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 146 of 146 statements. [2025-01-09 07:07:20,069 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-01-09 07:07:20,069 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-01-09 07:07:21,895 INFO L134 CoverageAnalysis]: Checked inductivity of 28 backedges. 23 proven. 3 refuted. 0 times theorem prover too weak. 2 trivial. 0 not checked. [2025-01-09 07:07:21,895 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-01-09 07:07:21,895 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1545716579] [2025-01-09 07:07:21,895 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1545716579] provided 0 perfect and 1 imperfect interpolant sequences [2025-01-09 07:07:21,895 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [2065974025] [2025-01-09 07:07:21,895 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-01-09 07:07:21,895 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-01-09 07:07:21,895 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 [2025-01-09 07:07:21,897 INFO L229 MonitoredProcess]: Starting monitored process 12 with /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2025-01-09 07:07:21,899 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (12)] Waiting until timeout for monitored process [2025-01-09 07:07:22,502 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 146 statements into 1 equivalence classes. [2025-01-09 07:07:22,810 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 146 of 146 statements. [2025-01-09 07:07:22,810 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-01-09 07:07:22,810 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-01-09 07:07:22,818 INFO L256 TraceCheckSpWp]: Trace formula consists of 1446 conjuncts, 65 conjuncts are in the unsatisfiable core [2025-01-09 07:07:22,822 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-01-09 07:07:23,059 INFO L134 CoverageAnalysis]: Checked inductivity of 28 backedges. 23 proven. 3 refuted. 0 times theorem prover too weak. 2 trivial. 0 not checked. [2025-01-09 07:07:23,059 INFO L312 TraceCheckSpWp]: Computing backward predicates... [2025-01-09 07:07:23,658 INFO L134 CoverageAnalysis]: Checked inductivity of 28 backedges. 23 proven. 3 refuted. 0 times theorem prover too weak. 2 trivial. 0 not checked. [2025-01-09 07:07:23,658 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [2065974025] provided 0 perfect and 2 imperfect interpolant sequences [2025-01-09 07:07:23,658 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2025-01-09 07:07:23,658 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [12, 12, 12] total 25 [2025-01-09 07:07:23,658 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [457620147] [2025-01-09 07:07:23,658 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2025-01-09 07:07:23,659 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 25 states [2025-01-09 07:07:23,659 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-01-09 07:07:23,659 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 25 interpolants. [2025-01-09 07:07:23,659 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=93, Invalid=507, Unknown=0, NotChecked=0, Total=600 [2025-01-09 07:07:23,659 INFO L87 Difference]: Start difference. First operand 1406 states and 2006 transitions. Second operand has 25 states, 25 states have (on average 10.72) internal successors, (268), 25 states have internal predecessors, (268), 0 states have call successors, (0), 0 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 07:07:23,920 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-01-09 07:07:23,920 INFO L93 Difference]: Finished difference Result 3131 states and 4468 transitions. [2025-01-09 07:07:23,920 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 14 states. [2025-01-09 07:07:23,920 INFO L78 Accepts]: Start accepts. Automaton has has 25 states, 25 states have (on average 10.72) internal successors, (268), 25 states have internal predecessors, (268), 0 states have call successors, (0), 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 07:07:23,921 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-01-09 07:07:23,926 INFO L225 Difference]: With dead ends: 3131 [2025-01-09 07:07:23,926 INFO L226 Difference]: Without dead ends: 2708 [2025-01-09 07:07:23,927 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 310 GetRequests, 282 SyntacticMatches, 0 SemanticMatches, 28 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 174 ImplicationChecksByTransitivity, 0.3s TimeCoverageRelationStatistics Valid=135, Invalid=735, Unknown=0, NotChecked=0, Total=870 [2025-01-09 07:07:23,928 INFO L435 NwaCegarLoop]: 287 mSDtfsCounter, 989 mSDsluCounter, 3222 mSDsCounter, 0 mSdLazyCounter, 400 mSolverCounterSat, 5 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 989 SdHoareTripleChecker+Valid, 3509 SdHoareTripleChecker+Invalid, 405 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 5 IncrementalHoareTripleChecker+Valid, 400 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.2s IncrementalHoareTripleChecker+Time [2025-01-09 07:07:23,928 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [989 Valid, 3509 Invalid, 405 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [5 Valid, 400 Invalid, 0 Unknown, 0 Unchecked, 0.2s Time] [2025-01-09 07:07:23,929 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 2708 states. [2025-01-09 07:07:23,944 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 2708 to 2508. [2025-01-09 07:07:23,946 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 2508 states, 2507 states have (on average 1.434782608695652) internal successors, (3597), 2507 states have internal predecessors, (3597), 0 states have call successors, (0), 0 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 07:07:23,948 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 2508 states to 2508 states and 3597 transitions. [2025-01-09 07:07:23,949 INFO L78 Accepts]: Start accepts. Automaton has 2508 states and 3597 transitions. Word has length 146 [2025-01-09 07:07:23,949 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-01-09 07:07:23,949 INFO L471 AbstractCegarLoop]: Abstraction has 2508 states and 3597 transitions. [2025-01-09 07:07:23,949 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 25 states, 25 states have (on average 10.72) internal successors, (268), 25 states have internal predecessors, (268), 0 states have call successors, (0), 0 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 07:07:23,949 INFO L276 IsEmpty]: Start isEmpty. Operand 2508 states and 3597 transitions. [2025-01-09 07:07:23,952 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 147 [2025-01-09 07:07:23,952 INFO L210 NwaCegarLoop]: Found error trace [2025-01-09 07:07:23,952 INFO L218 NwaCegarLoop]: trace histogram [2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-01-09 07:07:23,966 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (12)] Ended with exit code 0 [2025-01-09 07:07:24,152 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 12 /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable34 [2025-01-09 07:07:24,153 INFO L396 AbstractCegarLoop]: === Iteration 36 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-01-09 07:07:24,153 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-01-09 07:07:24,153 INFO L85 PathProgramCache]: Analyzing trace with hash 1758651541, now seen corresponding path program 1 times [2025-01-09 07:07:24,153 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-01-09 07:07:24,153 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [677540083] [2025-01-09 07:07:24,153 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-01-09 07:07:24,153 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-01-09 07:07:24,197 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 146 statements into 1 equivalence classes. [2025-01-09 07:07:24,678 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 146 of 146 statements. [2025-01-09 07:07:24,678 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-01-09 07:07:24,678 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat