./Ultimate.py --spec ../sv-benchmarks/c/properties/unreach-call.prp --file ../sv-benchmarks/c/eca-rers2012/Problem15_label54.c --full-output --architecture 32bit -------------------------------------------------------------------------------- Checking for ERROR reachability Using default analysis Version c00e63dc Calling Ultimate with: /root/.sdkman/candidates/java/21.0.5-tem/bin/java -Dosgi.configuration.area=/storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/data/config -Xmx15G -Xms4m -jar /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/plugins/org.eclipse.equinox.launcher_1.6.800.v20240513-1750.jar -data @noDefault -ultimatedata /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/data -tc /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/config/AutomizerReach.xml -i ../sv-benchmarks/c/eca-rers2012/Problem15_label54.c -s /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/config/svcomp-Reach-32bit-Automizer_Default.epf --cacsl2boogietranslator.entry.function main --witnessprinter.witness.directory /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux --witnessprinter.witness.filename witness --witnessprinter.write.witness.besides.input.file false --witnessprinter.graph.data.specification CHECK( init(main()), LTL(G ! call(reach_error())) ) --witnessprinter.graph.data.producer Automizer --witnessprinter.graph.data.architecture 32bit --witnessprinter.graph.data.programhash 4c52ec07a463523a7400028d070720f187a378d4cbca4c6c694254a0e1ef7e72 --- Real Ultimate output --- This is Ultimate 0.3.0-?-c00e63d-m [2025-02-05 11:55:33,898 INFO L188 SettingsManager]: Resetting all preferences to default values... [2025-02-05 11:55:33,948 INFO L114 SettingsManager]: Loading settings from /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/config/svcomp-Reach-32bit-Automizer_Default.epf [2025-02-05 11:55:33,953 WARN L101 SettingsManager]: Preference file contains the following unknown settings: [2025-02-05 11:55:33,955 WARN L103 SettingsManager]: * de.uni_freiburg.informatik.ultimate.core.Log level for class [2025-02-05 11:55:33,974 INFO L130 SettingsManager]: Preferences different from defaults after loading the file: [2025-02-05 11:55:33,974 INFO L151 SettingsManager]: Preferences of UltimateCore differ from their defaults: [2025-02-05 11:55:33,975 INFO L153 SettingsManager]: * Log level for class=de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher=ERROR; [2025-02-05 11:55:33,975 INFO L151 SettingsManager]: Preferences of Boogie Preprocessor differ from their defaults: [2025-02-05 11:55:33,975 INFO L153 SettingsManager]: * Use memory slicer=true [2025-02-05 11:55:33,975 INFO L151 SettingsManager]: Preferences of Boogie Procedure Inliner differ from their defaults: [2025-02-05 11:55:33,975 INFO L153 SettingsManager]: * Ignore calls to procedures called more than once=ONLY_FOR_SEQUENTIAL_PROGRAMS [2025-02-05 11:55:33,975 INFO L151 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2025-02-05 11:55:33,975 INFO L153 SettingsManager]: * Create parallel compositions if possible=false [2025-02-05 11:55:33,975 INFO L153 SettingsManager]: * Use SBE=true [2025-02-05 11:55:33,975 INFO L151 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2025-02-05 11:55:33,975 INFO L153 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2025-02-05 11:55:33,975 INFO L153 SettingsManager]: * sizeof long=4 [2025-02-05 11:55:33,977 INFO L153 SettingsManager]: * Overapproximate operations on floating types=true [2025-02-05 11:55:33,977 INFO L153 SettingsManager]: * sizeof POINTER=4 [2025-02-05 11:55:33,977 INFO L153 SettingsManager]: * Check division by zero=IGNORE [2025-02-05 11:55:33,977 INFO L153 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2025-02-05 11:55:33,978 INFO L153 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2025-02-05 11:55:33,978 INFO L153 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2025-02-05 11:55:33,978 INFO L153 SettingsManager]: * sizeof long double=12 [2025-02-05 11:55:33,978 INFO L153 SettingsManager]: * Check if freed pointer was valid=false [2025-02-05 11:55:33,978 INFO L153 SettingsManager]: * Behaviour of calls to undefined functions=OVERAPPROXIMATE_BEHAVIOUR [2025-02-05 11:55:33,978 INFO L153 SettingsManager]: * Use constant arrays=true [2025-02-05 11:55:33,978 INFO L151 SettingsManager]: Preferences of IcfgBuilder differ from their defaults: [2025-02-05 11:55:33,978 INFO L153 SettingsManager]: * Size of a code block=SequenceOfStatements [2025-02-05 11:55:33,979 INFO L153 SettingsManager]: * Only consider context switches at boundaries of atomic blocks=true [2025-02-05 11:55:33,979 INFO L153 SettingsManager]: * SMT solver=External_DefaultMode [2025-02-05 11:55:33,979 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2025-02-05 11:55:33,979 INFO L151 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2025-02-05 11:55:33,979 INFO L153 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2025-02-05 11:55:33,979 INFO L153 SettingsManager]: * Compute procedure contracts=false [2025-02-05 11:55:33,979 INFO L153 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopHeads [2025-02-05 11:55:33,979 INFO L153 SettingsManager]: * Trace refinement strategy=CAMEL [2025-02-05 11:55:33,979 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2025-02-05 11:55:33,979 INFO L153 SettingsManager]: * Apply one-shot large block encoding in concurrent analysis=false [2025-02-05 11:55:33,979 INFO L153 SettingsManager]: * Automaton type used in concurrency analysis=PETRI_NET [2025-02-05 11:55:33,979 INFO L153 SettingsManager]: * Order on configurations for Petri net unfoldings=DBO [2025-02-05 11:55:33,979 INFO L153 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode [2025-02-05 11:55:33,980 INFO L153 SettingsManager]: * Looper check in Petri net analysis=SEMANTIC Applying setting for plugin de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator: Entry function -> main Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Witness directory -> /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Witness filename -> witness Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Write witness besides input file -> false Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Graph data specification -> CHECK( init(main()), LTL(G ! call(reach_error())) ) Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Graph data producer -> Automizer Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Graph data architecture -> 32bit Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Graph data programhash -> 4c52ec07a463523a7400028d070720f187a378d4cbca4c6c694254a0e1ef7e72 [2025-02-05 11:55:34,229 INFO L75 nceAwareModelManager]: Repository-Root is: /tmp [2025-02-05 11:55:34,238 INFO L261 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2025-02-05 11:55:34,242 INFO L217 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2025-02-05 11:55:34,243 INFO L270 PluginConnector]: Initializing CDTParser... [2025-02-05 11:55:34,243 INFO L274 PluginConnector]: CDTParser initialized [2025-02-05 11:55:34,244 INFO L431 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/../sv-benchmarks/c/eca-rers2012/Problem15_label54.c [2025-02-05 11:55:35,457 INFO L533 CDTParser]: Created temporary CDT project at /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/data/2582a88ae/2a74318c65de4eb49e77779a3bbf1524/FLAG6fd710a37 [2025-02-05 11:55:35,863 INFO L384 CDTParser]: Found 1 translation units. [2025-02-05 11:55:35,864 INFO L180 CDTParser]: Scanning /storage/repos/ultimate-jdk21/releaseScripts/default/sv-benchmarks/c/eca-rers2012/Problem15_label54.c [2025-02-05 11:55:35,879 INFO L427 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/data/2582a88ae/2a74318c65de4eb49e77779a3bbf1524/FLAG6fd710a37 [2025-02-05 11:55:36,015 INFO L435 CDTParser]: Successfully deleted /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/data/2582a88ae/2a74318c65de4eb49e77779a3bbf1524 [2025-02-05 11:55:36,017 INFO L299 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2025-02-05 11:55:36,018 INFO L133 ToolchainWalker]: Walking toolchain with 6 elements. [2025-02-05 11:55:36,020 INFO L112 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2025-02-05 11:55:36,020 INFO L270 PluginConnector]: Initializing CACSL2BoogieTranslator... [2025-02-05 11:55:36,022 INFO L274 PluginConnector]: CACSL2BoogieTranslator initialized [2025-02-05 11:55:36,023 INFO L184 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 05.02 11:55:36" (1/1) ... [2025-02-05 11:55:36,023 INFO L204 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@3f2df603 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 05.02 11:55:36, skipping insertion in model container [2025-02-05 11:55:36,024 INFO L184 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 05.02 11:55:36" (1/1) ... [2025-02-05 11:55:36,071 INFO L175 MainTranslator]: Built tables and reachable declarations [2025-02-05 11:55:36,199 WARN L250 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate-jdk21/releaseScripts/default/sv-benchmarks/c/eca-rers2012/Problem15_label54.c[4982,4995] [2025-02-05 11:55:36,454 INFO L210 PostProcessor]: Analyzing one entry point: main [2025-02-05 11:55:36,466 INFO L200 MainTranslator]: Completed pre-run [2025-02-05 11:55:36,482 WARN L250 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate-jdk21/releaseScripts/default/sv-benchmarks/c/eca-rers2012/Problem15_label54.c[4982,4995] [2025-02-05 11:55:36,638 INFO L210 PostProcessor]: Analyzing one entry point: main [2025-02-05 11:55:36,652 INFO L204 MainTranslator]: Completed translation [2025-02-05 11:55:36,653 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 05.02 11:55:36 WrapperNode [2025-02-05 11:55:36,653 INFO L131 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2025-02-05 11:55:36,655 INFO L112 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2025-02-05 11:55:36,655 INFO L270 PluginConnector]: Initializing Boogie Procedure Inliner... [2025-02-05 11:55:36,655 INFO L274 PluginConnector]: Boogie Procedure Inliner initialized [2025-02-05 11:55:36,660 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 05.02 11:55:36" (1/1) ... [2025-02-05 11:55:36,693 INFO L184 PluginConnector]: Executing the observer Inliner from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 05.02 11:55:36" (1/1) ... [2025-02-05 11:55:36,889 INFO L138 Inliner]: procedures = 15, calls = 9, calls flagged for inlining = 4, calls inlined = 4, statements flattened = 1757 [2025-02-05 11:55:36,889 INFO L131 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2025-02-05 11:55:36,890 INFO L112 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2025-02-05 11:55:36,890 INFO L270 PluginConnector]: Initializing Boogie Preprocessor... [2025-02-05 11:55:36,890 INFO L274 PluginConnector]: Boogie Preprocessor initialized [2025-02-05 11:55:36,896 INFO L184 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 05.02 11:55:36" (1/1) ... [2025-02-05 11:55:36,897 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 05.02 11:55:36" (1/1) ... [2025-02-05 11:55:36,917 INFO L184 PluginConnector]: Executing the observer MemorySlicer from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 05.02 11:55:36" (1/1) ... [2025-02-05 11:55:37,033 INFO L175 MemorySlicer]: Split 2 memory accesses to 1 slices as follows [2]. 100 percent of accesses are in the largest equivalence class. The 2 initializations are split as follows [2]. The 0 writes are split as follows [0]. [2025-02-05 11:55:37,034 INFO L184 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 05.02 11:55:36" (1/1) ... [2025-02-05 11:55:37,034 INFO L184 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 05.02 11:55:36" (1/1) ... [2025-02-05 11:55:37,080 INFO L184 PluginConnector]: Executing the observer ReplaceArrayAssignments from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 05.02 11:55:36" (1/1) ... [2025-02-05 11:55:37,091 INFO L184 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 05.02 11:55:36" (1/1) ... [2025-02-05 11:55:37,104 INFO L184 PluginConnector]: Executing the observer LTLStepAnnotator from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 05.02 11:55:36" (1/1) ... [2025-02-05 11:55:37,114 INFO L184 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 05.02 11:55:36" (1/1) ... [2025-02-05 11:55:37,140 INFO L131 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2025-02-05 11:55:37,141 INFO L112 PluginConnector]: ------------------------IcfgBuilder---------------------------- [2025-02-05 11:55:37,142 INFO L270 PluginConnector]: Initializing IcfgBuilder... [2025-02-05 11:55:37,142 INFO L274 PluginConnector]: IcfgBuilder initialized [2025-02-05 11:55:37,143 INFO L184 PluginConnector]: Executing the observer IcfgBuilderObserver from plugin IcfgBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 05.02 11:55:36" (1/1) ... [2025-02-05 11:55:37,147 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2025-02-05 11:55:37,155 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 [2025-02-05 11:55:37,168 INFO L229 MonitoredProcess]: Starting monitored process 1 with /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 (exit command is (exit), workingDir is null) [2025-02-05 11:55:37,177 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 (1)] Waiting until timeout for monitored process [2025-02-05 11:55:37,191 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocInit [2025-02-05 11:55:37,191 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int#0 [2025-02-05 11:55:37,191 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2025-02-05 11:55:37,191 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2025-02-05 11:55:37,236 INFO L257 CfgBuilder]: Building ICFG [2025-02-05 11:55:37,237 INFO L287 CfgBuilder]: Building CFG for each procedure with an implementation [2025-02-05 11:55:39,332 INFO L1309 $ProcedureCfgBuilder]: dead code at ProgramPoint L1665: havoc calculate_output_#t~ret7#1; [2025-02-05 11:55:39,405 INFO L? ?]: Removed 246 outVars from TransFormulas that were not future-live. [2025-02-05 11:55:39,405 INFO L308 CfgBuilder]: Performing block encoding [2025-02-05 11:55:39,423 INFO L332 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2025-02-05 11:55:39,423 INFO L337 CfgBuilder]: Removed 0 assume(true) statements. [2025-02-05 11:55:39,424 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.icfgbuilder CFG 05.02 11:55:39 BoogieIcfgContainer [2025-02-05 11:55:39,424 INFO L131 PluginConnector]: ------------------------ END IcfgBuilder---------------------------- [2025-02-05 11:55:39,425 INFO L112 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2025-02-05 11:55:39,428 INFO L270 PluginConnector]: Initializing TraceAbstraction... [2025-02-05 11:55:39,431 INFO L274 PluginConnector]: TraceAbstraction initialized [2025-02-05 11:55:39,431 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 05.02 11:55:36" (1/3) ... [2025-02-05 11:55:39,432 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@6fe831cc and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 05.02 11:55:39, skipping insertion in model container [2025-02-05 11:55:39,432 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 05.02 11:55:36" (2/3) ... [2025-02-05 11:55:39,432 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@6fe831cc and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 05.02 11:55:39, skipping insertion in model container [2025-02-05 11:55:39,432 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.icfgbuilder CFG 05.02 11:55:39" (3/3) ... [2025-02-05 11:55:39,437 INFO L128 eAbstractionObserver]: Analyzing ICFG Problem15_label54.c [2025-02-05 11:55:39,453 INFO L216 ceAbstractionStarter]: Automizer settings: Hoare:LoopHeads NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2025-02-05 11:55:39,458 INFO L151 ceAbstractionStarter]: Applying trace abstraction to ICFG Problem15_label54.c that has 1 procedures, 424 locations, 1 initial locations, 1 loop locations, and 1 error locations. [2025-02-05 11:55:39,528 INFO L332 AbstractCegarLoop]: ======== Iteration 0 == of CEGAR loop == AllErrorsAtOnce ======== [2025-02-05 11:55:39,548 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;@13969b97, mLbeIndependenceSettings=[IndependenceType=SEMANTIC, AbstractionType=NONE, UseConditional=false, UseSemiCommutativity=true, Solver=Z3, SolverTimeout=1000ms] [2025-02-05 11:55:39,548 INFO L334 AbstractCegarLoop]: Starting to check reachability of 1 error locations. [2025-02-05 11:55:39,555 INFO L276 IsEmpty]: Start isEmpty. Operand has 424 states, 422 states have (on average 1.7748815165876777) internal successors, (749), 423 states have internal predecessors, (749), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-02-05 11:55:39,563 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 41 [2025-02-05 11:55:39,563 INFO L210 NwaCegarLoop]: Found error trace [2025-02-05 11:55:39,564 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] [2025-02-05 11:55:39,564 INFO L396 AbstractCegarLoop]: === Iteration 1 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-02-05 11:55:39,571 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-02-05 11:55:39,572 INFO L85 PathProgramCache]: Analyzing trace with hash -619580213, now seen corresponding path program 1 times [2025-02-05 11:55:39,579 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-02-05 11:55:39,580 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [314272078] [2025-02-05 11:55:39,580 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-02-05 11:55:39,580 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-02-05 11:55:39,644 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 40 statements into 1 equivalence classes. [2025-02-05 11:55:39,664 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 40 of 40 statements. [2025-02-05 11:55:39,665 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-02-05 11:55:39,665 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-02-05 11:55:39,777 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-02-05 11:55:39,778 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-02-05 11:55:39,778 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [314272078] [2025-02-05 11:55:39,778 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [314272078] provided 1 perfect and 0 imperfect interpolant sequences [2025-02-05 11:55:39,778 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-02-05 11:55:39,779 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2025-02-05 11:55:39,779 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [919330992] [2025-02-05 11:55:39,780 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-02-05 11:55:39,782 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2025-02-05 11:55:39,782 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-02-05 11:55:39,793 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2025-02-05 11:55:39,794 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-02-05 11:55:39,796 INFO L87 Difference]: Start difference. First operand has 424 states, 422 states have (on average 1.7748815165876777) internal successors, (749), 423 states have internal predecessors, (749), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Second operand has 3 states, 3 states have (on average 13.333333333333334) internal successors, (40), 2 states have internal predecessors, (40), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-02-05 11:55:41,547 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-02-05 11:55:41,548 INFO L93 Difference]: Finished difference Result 1191 states and 2154 transitions. [2025-02-05 11:55:41,549 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2025-02-05 11:55:41,550 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 13.333333333333334) internal successors, (40), 2 states have internal predecessors, (40), 0 states have call successors, (0), 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 40 [2025-02-05 11:55:41,550 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-02-05 11:55:41,558 INFO L225 Difference]: With dead ends: 1191 [2025-02-05 11:55:41,558 INFO L226 Difference]: Without dead ends: 688 [2025-02-05 11:55:41,564 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 2 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-02-05 11:55:41,565 INFO L435 NwaCegarLoop]: 188 mSDtfsCounter, 331 mSDsluCounter, 41 mSDsCounter, 0 mSdLazyCounter, 1047 mSolverCounterSat, 286 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 1.4s Time, 0 mProtectedPredicate, 0 mProtectedAction, 331 SdHoareTripleChecker+Valid, 229 SdHoareTripleChecker+Invalid, 1333 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 286 IncrementalHoareTripleChecker+Valid, 1047 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 1.7s IncrementalHoareTripleChecker+Time [2025-02-05 11:55:41,566 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [331 Valid, 229 Invalid, 1333 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [286 Valid, 1047 Invalid, 0 Unknown, 0 Unchecked, 1.7s Time] [2025-02-05 11:55:41,580 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 688 states. [2025-02-05 11:55:41,615 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 688 to 680. [2025-02-05 11:55:41,618 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 680 states, 679 states have (on average 1.609720176730486) internal successors, (1093), 679 states have internal predecessors, (1093), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-02-05 11:55:41,624 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 680 states to 680 states and 1093 transitions. [2025-02-05 11:55:41,625 INFO L78 Accepts]: Start accepts. Automaton has 680 states and 1093 transitions. Word has length 40 [2025-02-05 11:55:41,625 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-02-05 11:55:41,625 INFO L471 AbstractCegarLoop]: Abstraction has 680 states and 1093 transitions. [2025-02-05 11:55:41,625 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 13.333333333333334) internal successors, (40), 2 states have internal predecessors, (40), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-02-05 11:55:41,625 INFO L276 IsEmpty]: Start isEmpty. Operand 680 states and 1093 transitions. [2025-02-05 11:55:41,627 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 109 [2025-02-05 11:55:41,627 INFO L210 NwaCegarLoop]: Found error trace [2025-02-05 11:55:41,628 INFO L218 NwaCegarLoop]: trace histogram [2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 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] [2025-02-05 11:55:41,628 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable0 [2025-02-05 11:55:41,632 INFO L396 AbstractCegarLoop]: === Iteration 2 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-02-05 11:55:41,633 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-02-05 11:55:41,633 INFO L85 PathProgramCache]: Analyzing trace with hash 1971606473, now seen corresponding path program 1 times [2025-02-05 11:55:41,633 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-02-05 11:55:41,633 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1176123052] [2025-02-05 11:55:41,633 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-02-05 11:55:41,633 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-02-05 11:55:41,650 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 108 statements into 1 equivalence classes. [2025-02-05 11:55:41,686 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 108 of 108 statements. [2025-02-05 11:55:41,686 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-02-05 11:55:41,686 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-02-05 11:55:41,852 INFO L134 CoverageAnalysis]: Checked inductivity of 37 backedges. 37 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-02-05 11:55:41,855 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-02-05 11:55:41,855 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1176123052] [2025-02-05 11:55:41,856 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1176123052] provided 1 perfect and 0 imperfect interpolant sequences [2025-02-05 11:55:41,856 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-02-05 11:55:41,856 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2025-02-05 11:55:41,856 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2023342076] [2025-02-05 11:55:41,856 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-02-05 11:55:41,856 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2025-02-05 11:55:41,857 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-02-05 11:55:41,857 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2025-02-05 11:55:41,857 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-02-05 11:55:41,857 INFO L87 Difference]: Start difference. First operand 680 states and 1093 transitions. Second operand has 3 states, 3 states have (on average 36.0) internal successors, (108), 2 states have internal predecessors, (108), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-02-05 11:55:43,421 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-02-05 11:55:43,422 INFO L93 Difference]: Finished difference Result 1964 states and 3171 transitions. [2025-02-05 11:55:43,422 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2025-02-05 11:55:43,422 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 36.0) internal successors, (108), 2 states have internal predecessors, (108), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 108 [2025-02-05 11:55:43,422 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-02-05 11:55:43,426 INFO L225 Difference]: With dead ends: 1964 [2025-02-05 11:55:43,426 INFO L226 Difference]: Without dead ends: 1286 [2025-02-05 11:55:43,427 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 2 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-02-05 11:55:43,428 INFO L435 NwaCegarLoop]: 294 mSDtfsCounter, 282 mSDsluCounter, 67 mSDsCounter, 0 mSdLazyCounter, 799 mSolverCounterSat, 298 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 1.3s Time, 0 mProtectedPredicate, 0 mProtectedAction, 282 SdHoareTripleChecker+Valid, 361 SdHoareTripleChecker+Invalid, 1097 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 298 IncrementalHoareTripleChecker+Valid, 799 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 1.5s IncrementalHoareTripleChecker+Time [2025-02-05 11:55:43,428 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [282 Valid, 361 Invalid, 1097 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [298 Valid, 799 Invalid, 0 Unknown, 0 Unchecked, 1.5s Time] [2025-02-05 11:55:43,429 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1286 states. [2025-02-05 11:55:43,444 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1286 to 1281. [2025-02-05 11:55:43,446 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 1281 states, 1280 states have (on average 1.3953125) internal successors, (1786), 1280 states have internal predecessors, (1786), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-02-05 11:55:43,449 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1281 states to 1281 states and 1786 transitions. [2025-02-05 11:55:43,449 INFO L78 Accepts]: Start accepts. Automaton has 1281 states and 1786 transitions. Word has length 108 [2025-02-05 11:55:43,449 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-02-05 11:55:43,449 INFO L471 AbstractCegarLoop]: Abstraction has 1281 states and 1786 transitions. [2025-02-05 11:55:43,449 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 36.0) internal successors, (108), 2 states have internal predecessors, (108), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-02-05 11:55:43,449 INFO L276 IsEmpty]: Start isEmpty. Operand 1281 states and 1786 transitions. [2025-02-05 11:55:43,450 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 117 [2025-02-05 11:55:43,450 INFO L210 NwaCegarLoop]: Found error trace [2025-02-05 11:55:43,451 INFO L218 NwaCegarLoop]: trace histogram [2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-02-05 11:55:43,451 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable1 [2025-02-05 11:55:43,451 INFO L396 AbstractCegarLoop]: === Iteration 3 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-02-05 11:55:43,451 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-02-05 11:55:43,451 INFO L85 PathProgramCache]: Analyzing trace with hash 35629877, now seen corresponding path program 1 times [2025-02-05 11:55:43,451 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-02-05 11:55:43,451 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1416382107] [2025-02-05 11:55:43,451 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-02-05 11:55:43,451 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-02-05 11:55:43,468 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 116 statements into 1 equivalence classes. [2025-02-05 11:55:43,501 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 116 of 116 statements. [2025-02-05 11:55:43,501 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-02-05 11:55:43,501 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-02-05 11:55:43,814 INFO L134 CoverageAnalysis]: Checked inductivity of 37 backedges. 37 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-02-05 11:55:43,814 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-02-05 11:55:43,816 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1416382107] [2025-02-05 11:55:43,816 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1416382107] provided 1 perfect and 0 imperfect interpolant sequences [2025-02-05 11:55:43,816 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-02-05 11:55:43,816 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2025-02-05 11:55:43,816 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1517218599] [2025-02-05 11:55:43,816 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-02-05 11:55:43,817 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2025-02-05 11:55:43,817 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-02-05 11:55:43,817 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2025-02-05 11:55:43,817 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-02-05 11:55:43,817 INFO L87 Difference]: Start difference. First operand 1281 states and 1786 transitions. Second operand has 3 states, 3 states have (on average 38.666666666666664) internal successors, (116), 2 states have internal predecessors, (116), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-02-05 11:55:44,825 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-02-05 11:55:44,825 INFO L93 Difference]: Finished difference Result 2859 states and 3905 transitions. [2025-02-05 11:55:44,826 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2025-02-05 11:55:44,826 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 38.666666666666664) internal successors, (116), 2 states have internal predecessors, (116), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 116 [2025-02-05 11:55:44,826 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-02-05 11:55:44,831 INFO L225 Difference]: With dead ends: 2859 [2025-02-05 11:55:44,831 INFO L226 Difference]: Without dead ends: 1580 [2025-02-05 11:55:44,832 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 2 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-02-05 11:55:44,833 INFO L435 NwaCegarLoop]: 324 mSDtfsCounter, 225 mSDsluCounter, 35 mSDsCounter, 0 mSdLazyCounter, 888 mSolverCounterSat, 29 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.8s Time, 0 mProtectedPredicate, 0 mProtectedAction, 225 SdHoareTripleChecker+Valid, 359 SdHoareTripleChecker+Invalid, 917 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 29 IncrementalHoareTripleChecker+Valid, 888 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 1.0s IncrementalHoareTripleChecker+Time [2025-02-05 11:55:44,833 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [225 Valid, 359 Invalid, 917 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [29 Valid, 888 Invalid, 0 Unknown, 0 Unchecked, 1.0s Time] [2025-02-05 11:55:44,834 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1580 states. [2025-02-05 11:55:44,874 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1580 to 1580. [2025-02-05 11:55:44,875 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 1580 states, 1579 states have (on average 1.3242558581380621) internal successors, (2091), 1579 states have internal predecessors, (2091), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-02-05 11:55:44,879 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1580 states to 1580 states and 2091 transitions. [2025-02-05 11:55:44,879 INFO L78 Accepts]: Start accepts. Automaton has 1580 states and 2091 transitions. Word has length 116 [2025-02-05 11:55:44,881 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-02-05 11:55:44,881 INFO L471 AbstractCegarLoop]: Abstraction has 1580 states and 2091 transitions. [2025-02-05 11:55:44,881 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 38.666666666666664) internal successors, (116), 2 states have internal predecessors, (116), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-02-05 11:55:44,881 INFO L276 IsEmpty]: Start isEmpty. Operand 1580 states and 2091 transitions. [2025-02-05 11:55:44,883 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 208 [2025-02-05 11:55:44,883 INFO L210 NwaCegarLoop]: Found error trace [2025-02-05 11:55:44,884 INFO L218 NwaCegarLoop]: trace histogram [3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-02-05 11:55:44,884 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable2 [2025-02-05 11:55:44,884 INFO L396 AbstractCegarLoop]: === Iteration 4 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-02-05 11:55:44,884 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-02-05 11:55:44,884 INFO L85 PathProgramCache]: Analyzing trace with hash 2082661520, now seen corresponding path program 1 times [2025-02-05 11:55:44,884 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-02-05 11:55:44,884 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1394533215] [2025-02-05 11:55:44,886 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-02-05 11:55:44,887 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-02-05 11:55:44,910 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 207 statements into 1 equivalence classes. [2025-02-05 11:55:44,926 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 207 of 207 statements. [2025-02-05 11:55:44,928 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-02-05 11:55:44,928 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-02-05 11:55:45,448 INFO L134 CoverageAnalysis]: Checked inductivity of 150 backedges. 75 proven. 75 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-02-05 11:55:45,449 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-02-05 11:55:45,449 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1394533215] [2025-02-05 11:55:45,449 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1394533215] provided 0 perfect and 1 imperfect interpolant sequences [2025-02-05 11:55:45,450 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1561128536] [2025-02-05 11:55:45,450 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-02-05 11:55:45,450 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-02-05 11:55:45,450 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 [2025-02-05 11:55:45,452 INFO L229 MonitoredProcess]: Starting monitored process 2 with /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2025-02-05 11:55:45,453 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (2)] Waiting until timeout for monitored process [2025-02-05 11:55:45,494 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 207 statements into 1 equivalence classes. [2025-02-05 11:55:45,527 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 207 of 207 statements. [2025-02-05 11:55:45,527 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-02-05 11:55:45,527 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-02-05 11:55:45,529 INFO L256 TraceCheckSpWp]: Trace formula consists of 300 conjuncts, 7 conjuncts are in the unsatisfiable core [2025-02-05 11:55:45,537 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-02-05 11:55:46,076 INFO L134 CoverageAnalysis]: Checked inductivity of 150 backedges. 126 proven. 24 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-02-05 11:55:46,077 INFO L312 TraceCheckSpWp]: Computing backward predicates... [2025-02-05 11:55:46,726 INFO L134 CoverageAnalysis]: Checked inductivity of 150 backedges. 126 proven. 24 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-02-05 11:55:46,729 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1561128536] provided 0 perfect and 2 imperfect interpolant sequences [2025-02-05 11:55:46,730 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2025-02-05 11:55:46,730 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [4, 4, 4] total 9 [2025-02-05 11:55:46,730 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [154069340] [2025-02-05 11:55:46,730 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2025-02-05 11:55:46,730 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 10 states [2025-02-05 11:55:46,731 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-02-05 11:55:46,731 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 10 interpolants. [2025-02-05 11:55:46,732 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=28, Invalid=62, Unknown=0, NotChecked=0, Total=90 [2025-02-05 11:55:46,732 INFO L87 Difference]: Start difference. First operand 1580 states and 2091 transitions. Second operand has 10 states, 10 states have (on average 51.9) internal successors, (519), 9 states have internal predecessors, (519), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-02-05 11:55:53,327 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-02-05 11:55:53,327 INFO L93 Difference]: Finished difference Result 8167 states and 11084 transitions. [2025-02-05 11:55:53,328 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 15 states. [2025-02-05 11:55:53,328 INFO L78 Accepts]: Start accepts. Automaton has has 10 states, 10 states have (on average 51.9) internal successors, (519), 9 states have internal predecessors, (519), 0 states have call successors, (0), 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 207 [2025-02-05 11:55:53,328 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-02-05 11:55:53,351 INFO L225 Difference]: With dead ends: 8167 [2025-02-05 11:55:53,355 INFO L226 Difference]: Without dead ends: 4287 [2025-02-05 11:55:53,361 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 423 GetRequests, 408 SyntacticMatches, 0 SemanticMatches, 15 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 39 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=80, Invalid=192, Unknown=0, NotChecked=0, Total=272 [2025-02-05 11:55:53,363 INFO L435 NwaCegarLoop]: 109 mSDtfsCounter, 3648 mSDsluCounter, 267 mSDsCounter, 0 mSdLazyCounter, 8588 mSolverCounterSat, 1061 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 5.4s Time, 0 mProtectedPredicate, 0 mProtectedAction, 3648 SdHoareTripleChecker+Valid, 376 SdHoareTripleChecker+Invalid, 9649 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 1061 IncrementalHoareTripleChecker+Valid, 8588 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 6.3s IncrementalHoareTripleChecker+Time [2025-02-05 11:55:53,363 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [3648 Valid, 376 Invalid, 9649 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [1061 Valid, 8588 Invalid, 0 Unknown, 0 Unchecked, 6.3s Time] [2025-02-05 11:55:53,371 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 4287 states. [2025-02-05 11:55:53,439 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 4287 to 3978. [2025-02-05 11:55:53,444 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 3978 states, 3977 states have (on average 1.1508674880563239) internal successors, (4577), 3977 states have internal predecessors, (4577), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-02-05 11:55:53,450 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3978 states to 3978 states and 4577 transitions. [2025-02-05 11:55:53,450 INFO L78 Accepts]: Start accepts. Automaton has 3978 states and 4577 transitions. Word has length 207 [2025-02-05 11:55:53,451 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-02-05 11:55:53,451 INFO L471 AbstractCegarLoop]: Abstraction has 3978 states and 4577 transitions. [2025-02-05 11:55:53,451 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 10 states, 10 states have (on average 51.9) internal successors, (519), 9 states have internal predecessors, (519), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-02-05 11:55:53,451 INFO L276 IsEmpty]: Start isEmpty. Operand 3978 states and 4577 transitions. [2025-02-05 11:55:53,455 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 323 [2025-02-05 11:55:53,455 INFO L210 NwaCegarLoop]: Found error trace [2025-02-05 11:55:53,455 INFO L218 NwaCegarLoop]: trace histogram [2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-02-05 11:55:53,464 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (2)] Ended with exit code 0 [2025-02-05 11:55:53,660 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable3,2 /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-02-05 11:55:53,660 INFO L396 AbstractCegarLoop]: === Iteration 5 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-02-05 11:55:53,662 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-02-05 11:55:53,662 INFO L85 PathProgramCache]: Analyzing trace with hash 973588338, now seen corresponding path program 1 times [2025-02-05 11:55:53,662 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-02-05 11:55:53,662 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [76116363] [2025-02-05 11:55:53,662 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-02-05 11:55:53,663 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-02-05 11:55:53,692 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 322 statements into 1 equivalence classes. [2025-02-05 11:55:53,711 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 322 of 322 statements. [2025-02-05 11:55:53,711 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-02-05 11:55:53,711 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-02-05 11:55:53,881 INFO L134 CoverageAnalysis]: Checked inductivity of 37 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 37 trivial. 0 not checked. [2025-02-05 11:55:53,882 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-02-05 11:55:53,882 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [76116363] [2025-02-05 11:55:53,882 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [76116363] provided 1 perfect and 0 imperfect interpolant sequences [2025-02-05 11:55:53,882 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-02-05 11:55:53,882 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2025-02-05 11:55:53,882 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [787805875] [2025-02-05 11:55:53,882 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-02-05 11:55:53,883 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2025-02-05 11:55:53,883 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-02-05 11:55:53,883 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2025-02-05 11:55:53,883 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-02-05 11:55:53,884 INFO L87 Difference]: Start difference. First operand 3978 states and 4577 transitions. Second operand has 3 states, 3 states have (on average 95.33333333333333) internal successors, (286), 2 states have internal predecessors, (286), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-02-05 11:55:54,830 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-02-05 11:55:54,830 INFO L93 Difference]: Finished difference Result 8858 states and 10345 transitions. [2025-02-05 11:55:54,831 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2025-02-05 11:55:54,831 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 95.33333333333333) internal successors, (286), 2 states have internal predecessors, (286), 0 states have call successors, (0), 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 322 [2025-02-05 11:55:54,832 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-02-05 11:55:54,844 INFO L225 Difference]: With dead ends: 8858 [2025-02-05 11:55:54,844 INFO L226 Difference]: Without dead ends: 5181 [2025-02-05 11:55:54,847 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 2 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-02-05 11:55:54,848 INFO L435 NwaCegarLoop]: 219 mSDtfsCounter, 31 mSDsluCounter, 46 mSDsCounter, 0 mSdLazyCounter, 810 mSolverCounterSat, 144 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.8s Time, 0 mProtectedPredicate, 0 mProtectedAction, 31 SdHoareTripleChecker+Valid, 265 SdHoareTripleChecker+Invalid, 954 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 144 IncrementalHoareTripleChecker+Valid, 810 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.9s IncrementalHoareTripleChecker+Time [2025-02-05 11:55:54,848 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [31 Valid, 265 Invalid, 954 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [144 Valid, 810 Invalid, 0 Unknown, 0 Unchecked, 0.9s Time] [2025-02-05 11:55:54,853 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 5181 states. [2025-02-05 11:55:54,899 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 5181 to 5178. [2025-02-05 11:55:54,904 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 5178 states, 5177 states have (on average 1.1323160131350203) internal successors, (5862), 5177 states have internal predecessors, (5862), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-02-05 11:55:54,912 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5178 states to 5178 states and 5862 transitions. [2025-02-05 11:55:54,912 INFO L78 Accepts]: Start accepts. Automaton has 5178 states and 5862 transitions. Word has length 322 [2025-02-05 11:55:54,912 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-02-05 11:55:54,912 INFO L471 AbstractCegarLoop]: Abstraction has 5178 states and 5862 transitions. [2025-02-05 11:55:54,913 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 95.33333333333333) internal successors, (286), 2 states have internal predecessors, (286), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-02-05 11:55:54,913 INFO L276 IsEmpty]: Start isEmpty. Operand 5178 states and 5862 transitions. [2025-02-05 11:55:54,916 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 387 [2025-02-05 11:55:54,916 INFO L210 NwaCegarLoop]: Found error trace [2025-02-05 11:55:54,917 INFO L218 NwaCegarLoop]: trace histogram [3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-02-05 11:55:54,917 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable4 [2025-02-05 11:55:54,917 INFO L396 AbstractCegarLoop]: === Iteration 6 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-02-05 11:55:54,919 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-02-05 11:55:54,919 INFO L85 PathProgramCache]: Analyzing trace with hash 291617374, now seen corresponding path program 1 times [2025-02-05 11:55:54,919 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-02-05 11:55:54,919 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2125185044] [2025-02-05 11:55:54,919 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-02-05 11:55:54,919 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-02-05 11:55:54,949 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 386 statements into 1 equivalence classes. [2025-02-05 11:55:54,970 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 386 of 386 statements. [2025-02-05 11:55:54,972 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-02-05 11:55:54,972 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-02-05 11:55:55,252 INFO L134 CoverageAnalysis]: Checked inductivity of 150 backedges. 75 proven. 0 refuted. 0 times theorem prover too weak. 75 trivial. 0 not checked. [2025-02-05 11:55:55,253 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-02-05 11:55:55,253 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2125185044] [2025-02-05 11:55:55,253 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [2125185044] provided 1 perfect and 0 imperfect interpolant sequences [2025-02-05 11:55:55,253 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-02-05 11:55:55,253 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2025-02-05 11:55:55,253 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1106011533] [2025-02-05 11:55:55,253 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-02-05 11:55:55,253 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2025-02-05 11:55:55,253 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-02-05 11:55:55,254 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2025-02-05 11:55:55,254 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-02-05 11:55:55,254 INFO L87 Difference]: Start difference. First operand 5178 states and 5862 transitions. Second operand has 3 states, 3 states have (on average 104.0) internal successors, (312), 3 states have internal predecessors, (312), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-02-05 11:55:56,149 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-02-05 11:55:56,149 INFO L93 Difference]: Finished difference Result 11254 states and 12848 transitions. [2025-02-05 11:55:56,150 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2025-02-05 11:55:56,150 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 104.0) internal successors, (312), 3 states have internal predecessors, (312), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 386 [2025-02-05 11:55:56,150 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-02-05 11:55:56,162 INFO L225 Difference]: With dead ends: 11254 [2025-02-05 11:55:56,162 INFO L226 Difference]: Without dead ends: 6078 [2025-02-05 11:55:56,166 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 3 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-02-05 11:55:56,168 INFO L435 NwaCegarLoop]: 509 mSDtfsCounter, 291 mSDsluCounter, 43 mSDsCounter, 0 mSdLazyCounter, 771 mSolverCounterSat, 156 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.7s Time, 0 mProtectedPredicate, 0 mProtectedAction, 291 SdHoareTripleChecker+Valid, 552 SdHoareTripleChecker+Invalid, 927 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 156 IncrementalHoareTripleChecker+Valid, 771 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.8s IncrementalHoareTripleChecker+Time [2025-02-05 11:55:56,169 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [291 Valid, 552 Invalid, 927 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [156 Valid, 771 Invalid, 0 Unknown, 0 Unchecked, 0.8s Time] [2025-02-05 11:55:56,174 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 6078 states. [2025-02-05 11:55:56,217 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 6078 to 6078. [2025-02-05 11:55:56,223 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 6078 states, 6077 states have (on average 1.109428994569689) internal successors, (6742), 6077 states have internal predecessors, (6742), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-02-05 11:55:56,232 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 6078 states to 6078 states and 6742 transitions. [2025-02-05 11:55:56,232 INFO L78 Accepts]: Start accepts. Automaton has 6078 states and 6742 transitions. Word has length 386 [2025-02-05 11:55:56,233 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-02-05 11:55:56,233 INFO L471 AbstractCegarLoop]: Abstraction has 6078 states and 6742 transitions. [2025-02-05 11:55:56,233 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 104.0) internal successors, (312), 3 states have internal predecessors, (312), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-02-05 11:55:56,233 INFO L276 IsEmpty]: Start isEmpty. Operand 6078 states and 6742 transitions. [2025-02-05 11:55:56,236 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 404 [2025-02-05 11:55:56,236 INFO L210 NwaCegarLoop]: Found error trace [2025-02-05 11:55:56,236 INFO L218 NwaCegarLoop]: trace histogram [3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-02-05 11:55:56,236 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable5 [2025-02-05 11:55:56,237 INFO L396 AbstractCegarLoop]: === Iteration 7 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-02-05 11:55:56,237 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-02-05 11:55:56,237 INFO L85 PathProgramCache]: Analyzing trace with hash -1313237093, now seen corresponding path program 1 times [2025-02-05 11:55:56,237 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-02-05 11:55:56,237 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1844367113] [2025-02-05 11:55:56,237 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-02-05 11:55:56,237 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-02-05 11:55:56,267 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 403 statements into 1 equivalence classes. [2025-02-05 11:55:56,284 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 403 of 403 statements. [2025-02-05 11:55:56,284 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-02-05 11:55:56,284 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-02-05 11:55:56,509 INFO L134 CoverageAnalysis]: Checked inductivity of 155 backedges. 155 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-02-05 11:55:56,510 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-02-05 11:55:56,510 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1844367113] [2025-02-05 11:55:56,510 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1844367113] provided 1 perfect and 0 imperfect interpolant sequences [2025-02-05 11:55:56,510 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-02-05 11:55:56,510 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2025-02-05 11:55:56,510 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [168662147] [2025-02-05 11:55:56,510 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-02-05 11:55:56,511 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2025-02-05 11:55:56,511 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-02-05 11:55:56,512 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2025-02-05 11:55:56,512 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-02-05 11:55:56,513 INFO L87 Difference]: Start difference. First operand 6078 states and 6742 transitions. Second operand has 3 states, 3 states have (on average 134.33333333333334) internal successors, (403), 3 states have internal predecessors, (403), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-02-05 11:55:57,375 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-02-05 11:55:57,375 INFO L93 Difference]: Finished difference Result 14856 states and 16631 transitions. [2025-02-05 11:55:57,376 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2025-02-05 11:55:57,376 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 134.33333333333334) internal successors, (403), 3 states have internal predecessors, (403), 0 states have call successors, (0), 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 403 [2025-02-05 11:55:57,377 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-02-05 11:55:57,396 INFO L225 Difference]: With dead ends: 14856 [2025-02-05 11:55:57,397 INFO L226 Difference]: Without dead ends: 8780 [2025-02-05 11:55:57,403 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 3 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-02-05 11:55:57,404 INFO L435 NwaCegarLoop]: 524 mSDtfsCounter, 237 mSDsluCounter, 37 mSDsCounter, 0 mSdLazyCounter, 795 mSolverCounterSat, 145 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.7s Time, 0 mProtectedPredicate, 0 mProtectedAction, 237 SdHoareTripleChecker+Valid, 561 SdHoareTripleChecker+Invalid, 940 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 145 IncrementalHoareTripleChecker+Valid, 795 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.8s IncrementalHoareTripleChecker+Time [2025-02-05 11:55:57,404 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [237 Valid, 561 Invalid, 940 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [145 Valid, 795 Invalid, 0 Unknown, 0 Unchecked, 0.8s Time] [2025-02-05 11:55:57,409 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 8780 states. [2025-02-05 11:55:57,472 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 8780 to 8179. [2025-02-05 11:55:57,480 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 8179 states, 8178 states have (on average 1.0842504279775007) internal successors, (8867), 8178 states have internal predecessors, (8867), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-02-05 11:55:57,489 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 8179 states to 8179 states and 8867 transitions. [2025-02-05 11:55:57,490 INFO L78 Accepts]: Start accepts. Automaton has 8179 states and 8867 transitions. Word has length 403 [2025-02-05 11:55:57,490 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-02-05 11:55:57,490 INFO L471 AbstractCegarLoop]: Abstraction has 8179 states and 8867 transitions. [2025-02-05 11:55:57,494 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 134.33333333333334) internal successors, (403), 3 states have internal predecessors, (403), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-02-05 11:55:57,495 INFO L276 IsEmpty]: Start isEmpty. Operand 8179 states and 8867 transitions. [2025-02-05 11:55:57,498 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 418 [2025-02-05 11:55:57,499 INFO L210 NwaCegarLoop]: Found error trace [2025-02-05 11:55:57,499 INFO L218 NwaCegarLoop]: trace histogram [3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-02-05 11:55:57,499 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable6 [2025-02-05 11:55:57,499 INFO L396 AbstractCegarLoop]: === Iteration 8 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-02-05 11:55:57,500 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-02-05 11:55:57,500 INFO L85 PathProgramCache]: Analyzing trace with hash -258743886, now seen corresponding path program 1 times [2025-02-05 11:55:57,500 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-02-05 11:55:57,500 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [91631139] [2025-02-05 11:55:57,500 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-02-05 11:55:57,500 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-02-05 11:55:57,574 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 417 statements into 1 equivalence classes. [2025-02-05 11:55:57,594 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 417 of 417 statements. [2025-02-05 11:55:57,594 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-02-05 11:55:57,594 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-02-05 11:55:57,760 INFO L134 CoverageAnalysis]: Checked inductivity of 181 backedges. 75 proven. 0 refuted. 0 times theorem prover too weak. 106 trivial. 0 not checked. [2025-02-05 11:55:57,761 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-02-05 11:55:57,761 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [91631139] [2025-02-05 11:55:57,761 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [91631139] provided 1 perfect and 0 imperfect interpolant sequences [2025-02-05 11:55:57,761 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-02-05 11:55:57,761 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2025-02-05 11:55:57,761 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1552535285] [2025-02-05 11:55:57,761 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-02-05 11:55:57,762 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2025-02-05 11:55:57,762 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-02-05 11:55:57,763 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2025-02-05 11:55:57,763 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-02-05 11:55:57,763 INFO L87 Difference]: Start difference. First operand 8179 states and 8867 transitions. Second operand has 3 states, 3 states have (on average 104.0) internal successors, (312), 3 states have internal predecessors, (312), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-02-05 11:55:58,611 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-02-05 11:55:58,612 INFO L93 Difference]: Finished difference Result 18751 states and 20542 transitions. [2025-02-05 11:55:58,665 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2025-02-05 11:55:58,665 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 104.0) internal successors, (312), 3 states have internal predecessors, (312), 0 states have call successors, (0), 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 417 [2025-02-05 11:55:58,666 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-02-05 11:55:58,685 INFO L225 Difference]: With dead ends: 18751 [2025-02-05 11:55:58,685 INFO L226 Difference]: Without dead ends: 10574 [2025-02-05 11:55:58,690 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 3 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-02-05 11:55:58,690 INFO L435 NwaCegarLoop]: 499 mSDtfsCounter, 282 mSDsluCounter, 37 mSDsCounter, 0 mSdLazyCounter, 759 mSolverCounterSat, 150 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.7s Time, 0 mProtectedPredicate, 0 mProtectedAction, 282 SdHoareTripleChecker+Valid, 536 SdHoareTripleChecker+Invalid, 909 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 150 IncrementalHoareTripleChecker+Valid, 759 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.8s IncrementalHoareTripleChecker+Time [2025-02-05 11:55:58,690 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [282 Valid, 536 Invalid, 909 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [150 Valid, 759 Invalid, 0 Unknown, 0 Unchecked, 0.8s Time] [2025-02-05 11:55:58,695 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 10574 states. [2025-02-05 11:55:58,797 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 10574 to 10568. [2025-02-05 11:55:58,821 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 10568 states, 10567 states have (on average 1.0681366518406359) internal successors, (11287), 10567 states have internal predecessors, (11287), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-02-05 11:55:58,852 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 10568 states to 10568 states and 11287 transitions. [2025-02-05 11:55:58,852 INFO L78 Accepts]: Start accepts. Automaton has 10568 states and 11287 transitions. Word has length 417 [2025-02-05 11:55:58,852 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-02-05 11:55:58,852 INFO L471 AbstractCegarLoop]: Abstraction has 10568 states and 11287 transitions. [2025-02-05 11:55:58,853 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 104.0) internal successors, (312), 3 states have internal predecessors, (312), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-02-05 11:55:58,853 INFO L276 IsEmpty]: Start isEmpty. Operand 10568 states and 11287 transitions. [2025-02-05 11:55:58,860 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 542 [2025-02-05 11:55:58,860 INFO L210 NwaCegarLoop]: Found error trace [2025-02-05 11:55:58,860 INFO L218 NwaCegarLoop]: trace histogram [4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-02-05 11:55:58,860 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable7 [2025-02-05 11:55:58,860 INFO L396 AbstractCegarLoop]: === Iteration 9 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-02-05 11:55:58,860 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-02-05 11:55:58,861 INFO L85 PathProgramCache]: Analyzing trace with hash -444879686, now seen corresponding path program 1 times [2025-02-05 11:55:58,861 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-02-05 11:55:58,861 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [841074509] [2025-02-05 11:55:58,861 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-02-05 11:55:58,861 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-02-05 11:55:58,926 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 541 statements into 1 equivalence classes. [2025-02-05 11:55:58,977 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 541 of 541 statements. [2025-02-05 11:55:58,980 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-02-05 11:55:58,980 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-02-05 11:55:59,308 INFO L134 CoverageAnalysis]: Checked inductivity of 447 backedges. 113 proven. 0 refuted. 0 times theorem prover too weak. 334 trivial. 0 not checked. [2025-02-05 11:55:59,308 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-02-05 11:55:59,309 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [841074509] [2025-02-05 11:55:59,309 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [841074509] provided 1 perfect and 0 imperfect interpolant sequences [2025-02-05 11:55:59,309 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-02-05 11:55:59,309 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2025-02-05 11:55:59,309 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2053062666] [2025-02-05 11:55:59,309 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-02-05 11:55:59,309 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2025-02-05 11:55:59,309 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-02-05 11:55:59,310 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2025-02-05 11:55:59,313 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-02-05 11:55:59,314 INFO L87 Difference]: Start difference. First operand 10568 states and 11287 transitions. Second operand has 3 states, 3 states have (on average 105.0) internal successors, (315), 3 states have internal predecessors, (315), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-02-05 11:56:00,312 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-02-05 11:56:00,312 INFO L93 Difference]: Finished difference Result 21132 states and 22596 transitions. [2025-02-05 11:56:00,312 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2025-02-05 11:56:00,312 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 105.0) internal successors, (315), 3 states have internal predecessors, (315), 0 states have call successors, (0), 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 541 [2025-02-05 11:56:00,313 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-02-05 11:56:00,331 INFO L225 Difference]: With dead ends: 21132 [2025-02-05 11:56:00,334 INFO L226 Difference]: Without dead ends: 10865 [2025-02-05 11:56:00,350 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 3 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-02-05 11:56:00,353 INFO L435 NwaCegarLoop]: 62 mSDtfsCounter, 435 mSDsluCounter, 5 mSDsCounter, 0 mSdLazyCounter, 733 mSolverCounterSat, 90 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.8s Time, 0 mProtectedPredicate, 0 mProtectedAction, 435 SdHoareTripleChecker+Valid, 67 SdHoareTripleChecker+Invalid, 823 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 90 IncrementalHoareTripleChecker+Valid, 733 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.9s IncrementalHoareTripleChecker+Time [2025-02-05 11:56:00,354 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [435 Valid, 67 Invalid, 823 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [90 Valid, 733 Invalid, 0 Unknown, 0 Unchecked, 0.9s Time] [2025-02-05 11:56:00,367 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 10865 states. [2025-02-05 11:56:00,507 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 10865 to 10566. [2025-02-05 11:56:00,522 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 10566 states, 10565 states have (on average 1.0679602460955986) internal successors, (11283), 10565 states have internal predecessors, (11283), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-02-05 11:56:00,536 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 10566 states to 10566 states and 11283 transitions. [2025-02-05 11:56:00,539 INFO L78 Accepts]: Start accepts. Automaton has 10566 states and 11283 transitions. Word has length 541 [2025-02-05 11:56:00,540 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-02-05 11:56:00,540 INFO L471 AbstractCegarLoop]: Abstraction has 10566 states and 11283 transitions. [2025-02-05 11:56:00,540 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 105.0) internal successors, (315), 3 states have internal predecessors, (315), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-02-05 11:56:00,541 INFO L276 IsEmpty]: Start isEmpty. Operand 10566 states and 11283 transitions. [2025-02-05 11:56:00,546 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 568 [2025-02-05 11:56:00,546 INFO L210 NwaCegarLoop]: Found error trace [2025-02-05 11:56:00,547 INFO L218 NwaCegarLoop]: trace histogram [4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-02-05 11:56:00,547 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable8 [2025-02-05 11:56:00,547 INFO L396 AbstractCegarLoop]: === Iteration 10 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-02-05 11:56:00,549 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-02-05 11:56:00,550 INFO L85 PathProgramCache]: Analyzing trace with hash 436088742, now seen corresponding path program 1 times [2025-02-05 11:56:00,552 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-02-05 11:56:00,552 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [389684111] [2025-02-05 11:56:00,552 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-02-05 11:56:00,552 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-02-05 11:56:00,640 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 567 statements into 1 equivalence classes. [2025-02-05 11:56:00,698 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 567 of 567 statements. [2025-02-05 11:56:00,701 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-02-05 11:56:00,701 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-02-05 11:56:01,206 INFO L134 CoverageAnalysis]: Checked inductivity of 475 backedges. 113 proven. 0 refuted. 0 times theorem prover too weak. 362 trivial. 0 not checked. [2025-02-05 11:56:01,207 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-02-05 11:56:01,207 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [389684111] [2025-02-05 11:56:01,207 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [389684111] provided 1 perfect and 0 imperfect interpolant sequences [2025-02-05 11:56:01,207 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-02-05 11:56:01,207 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2025-02-05 11:56:01,207 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1811135440] [2025-02-05 11:56:01,207 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-02-05 11:56:01,208 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2025-02-05 11:56:01,208 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-02-05 11:56:01,209 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2025-02-05 11:56:01,209 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-02-05 11:56:01,209 INFO L87 Difference]: Start difference. First operand 10566 states and 11283 transitions. Second operand has 3 states, 3 states have (on average 104.33333333333333) internal successors, (313), 3 states have internal predecessors, (313), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-02-05 11:56:02,398 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-02-05 11:56:02,398 INFO L93 Difference]: Finished difference Result 24448 states and 26150 transitions. [2025-02-05 11:56:02,399 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2025-02-05 11:56:02,399 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 104.33333333333333) internal successors, (313), 3 states have internal predecessors, (313), 0 states have call successors, (0), 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 567 [2025-02-05 11:56:02,400 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-02-05 11:56:02,442 INFO L225 Difference]: With dead ends: 24448 [2025-02-05 11:56:02,445 INFO L226 Difference]: Without dead ends: 14183 [2025-02-05 11:56:02,463 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 3 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-02-05 11:56:02,463 INFO L435 NwaCegarLoop]: 169 mSDtfsCounter, 297 mSDsluCounter, 34 mSDsCounter, 0 mSdLazyCounter, 840 mSolverCounterSat, 101 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.9s Time, 0 mProtectedPredicate, 0 mProtectedAction, 297 SdHoareTripleChecker+Valid, 203 SdHoareTripleChecker+Invalid, 941 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 101 IncrementalHoareTripleChecker+Valid, 840 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 1.1s IncrementalHoareTripleChecker+Time [2025-02-05 11:56:02,463 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [297 Valid, 203 Invalid, 941 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [101 Valid, 840 Invalid, 0 Unknown, 0 Unchecked, 1.1s Time] [2025-02-05 11:56:02,482 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 14183 states. [2025-02-05 11:56:02,637 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 14183 to 11465. [2025-02-05 11:56:02,658 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 11465 states, 11464 states have (on average 1.0655966503838101) internal successors, (12216), 11464 states have internal predecessors, (12216), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-02-05 11:56:02,682 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 11465 states to 11465 states and 12216 transitions. [2025-02-05 11:56:02,683 INFO L78 Accepts]: Start accepts. Automaton has 11465 states and 12216 transitions. Word has length 567 [2025-02-05 11:56:02,683 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-02-05 11:56:02,683 INFO L471 AbstractCegarLoop]: Abstraction has 11465 states and 12216 transitions. [2025-02-05 11:56:02,683 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 104.33333333333333) internal successors, (313), 3 states have internal predecessors, (313), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-02-05 11:56:02,684 INFO L276 IsEmpty]: Start isEmpty. Operand 11465 states and 12216 transitions. [2025-02-05 11:56:02,691 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 579 [2025-02-05 11:56:02,691 INFO L210 NwaCegarLoop]: Found error trace [2025-02-05 11:56:02,692 INFO L218 NwaCegarLoop]: trace histogram [4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-02-05 11:56:02,692 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable9 [2025-02-05 11:56:02,692 INFO L396 AbstractCegarLoop]: === Iteration 11 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-02-05 11:56:02,693 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-02-05 11:56:02,693 INFO L85 PathProgramCache]: Analyzing trace with hash -879618058, now seen corresponding path program 1 times [2025-02-05 11:56:02,693 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-02-05 11:56:02,693 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [287172343] [2025-02-05 11:56:02,693 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-02-05 11:56:02,693 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-02-05 11:56:02,754 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 578 statements into 1 equivalence classes. [2025-02-05 11:56:02,787 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 578 of 578 statements. [2025-02-05 11:56:02,787 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-02-05 11:56:02,787 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-02-05 11:56:03,027 INFO L134 CoverageAnalysis]: Checked inductivity of 486 backedges. 113 proven. 0 refuted. 0 times theorem prover too weak. 373 trivial. 0 not checked. [2025-02-05 11:56:03,028 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-02-05 11:56:03,028 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [287172343] [2025-02-05 11:56:03,028 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [287172343] provided 1 perfect and 0 imperfect interpolant sequences [2025-02-05 11:56:03,028 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-02-05 11:56:03,028 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2025-02-05 11:56:03,028 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1441687478] [2025-02-05 11:56:03,028 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-02-05 11:56:03,029 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2025-02-05 11:56:03,029 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-02-05 11:56:03,029 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2025-02-05 11:56:03,030 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-02-05 11:56:03,030 INFO L87 Difference]: Start difference. First operand 11465 states and 12216 transitions. Second operand has 3 states, 3 states have (on average 104.33333333333333) internal successors, (313), 3 states have internal predecessors, (313), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-02-05 11:56:03,973 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-02-05 11:56:03,973 INFO L93 Difference]: Finished difference Result 25319 states and 27077 transitions. [2025-02-05 11:56:03,973 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2025-02-05 11:56:03,973 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 104.33333333333333) internal successors, (313), 3 states have internal predecessors, (313), 0 states have call successors, (0), 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 578 [2025-02-05 11:56:03,974 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-02-05 11:56:04,019 INFO L225 Difference]: With dead ends: 25319 [2025-02-05 11:56:04,019 INFO L226 Difference]: Without dead ends: 13856 [2025-02-05 11:56:04,038 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 3 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-02-05 11:56:04,039 INFO L435 NwaCegarLoop]: 439 mSDtfsCounter, 305 mSDsluCounter, 27 mSDsCounter, 0 mSdLazyCounter, 733 mSolverCounterSat, 134 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.7s Time, 0 mProtectedPredicate, 0 mProtectedAction, 305 SdHoareTripleChecker+Valid, 466 SdHoareTripleChecker+Invalid, 867 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 134 IncrementalHoareTripleChecker+Valid, 733 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.9s IncrementalHoareTripleChecker+Time [2025-02-05 11:56:04,039 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [305 Valid, 466 Invalid, 867 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [134 Valid, 733 Invalid, 0 Unknown, 0 Unchecked, 0.9s Time] [2025-02-05 11:56:04,055 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 13856 states. [2025-02-05 11:56:04,215 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 13856 to 13856. [2025-02-05 11:56:04,226 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 13856 states, 13855 states have (on average 1.0604835799350416) internal successors, (14693), 13855 states have internal predecessors, (14693), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-02-05 11:56:04,237 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 13856 states to 13856 states and 14693 transitions. [2025-02-05 11:56:04,238 INFO L78 Accepts]: Start accepts. Automaton has 13856 states and 14693 transitions. Word has length 578 [2025-02-05 11:56:04,238 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-02-05 11:56:04,239 INFO L471 AbstractCegarLoop]: Abstraction has 13856 states and 14693 transitions. [2025-02-05 11:56:04,239 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 104.33333333333333) internal successors, (313), 3 states have internal predecessors, (313), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-02-05 11:56:04,239 INFO L276 IsEmpty]: Start isEmpty. Operand 13856 states and 14693 transitions. [2025-02-05 11:56:04,245 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 731 [2025-02-05 11:56:04,245 INFO L210 NwaCegarLoop]: Found error trace [2025-02-05 11:56:04,246 INFO L218 NwaCegarLoop]: trace histogram [5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-02-05 11:56:04,246 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable10 [2025-02-05 11:56:04,247 INFO L396 AbstractCegarLoop]: === Iteration 12 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-02-05 11:56:04,248 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-02-05 11:56:04,248 INFO L85 PathProgramCache]: Analyzing trace with hash -1502043164, now seen corresponding path program 1 times [2025-02-05 11:56:04,248 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-02-05 11:56:04,248 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [232599732] [2025-02-05 11:56:04,248 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-02-05 11:56:04,248 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-02-05 11:56:04,292 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 730 statements into 1 equivalence classes. [2025-02-05 11:56:04,363 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 730 of 730 statements. [2025-02-05 11:56:04,364 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-02-05 11:56:04,364 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-02-05 11:56:04,595 INFO L134 CoverageAnalysis]: Checked inductivity of 875 backedges. 536 proven. 0 refuted. 0 times theorem prover too weak. 339 trivial. 0 not checked. [2025-02-05 11:56:04,595 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-02-05 11:56:04,595 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [232599732] [2025-02-05 11:56:04,595 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [232599732] provided 1 perfect and 0 imperfect interpolant sequences [2025-02-05 11:56:04,595 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-02-05 11:56:04,595 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2025-02-05 11:56:04,595 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [246823116] [2025-02-05 11:56:04,595 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-02-05 11:56:04,596 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2025-02-05 11:56:04,596 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-02-05 11:56:04,596 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2025-02-05 11:56:04,597 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-02-05 11:56:04,597 INFO L87 Difference]: Start difference. First operand 13856 states and 14693 transitions. Second operand has 3 states, 3 states have (on average 156.0) internal successors, (468), 3 states have internal predecessors, (468), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-02-05 11:56:05,378 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-02-05 11:56:05,379 INFO L93 Difference]: Finished difference Result 30401 states and 32499 transitions. [2025-02-05 11:56:05,379 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2025-02-05 11:56:05,379 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 156.0) internal successors, (468), 3 states have internal predecessors, (468), 0 states have call successors, (0), 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 730 [2025-02-05 11:56:05,380 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-02-05 11:56:05,393 INFO L225 Difference]: With dead ends: 30401 [2025-02-05 11:56:05,393 INFO L226 Difference]: Without dead ends: 16846 [2025-02-05 11:56:05,461 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 3 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-02-05 11:56:05,462 INFO L435 NwaCegarLoop]: 487 mSDtfsCounter, 158 mSDsluCounter, 32 mSDsCounter, 0 mSdLazyCounter, 748 mSolverCounterSat, 118 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.6s Time, 0 mProtectedPredicate, 0 mProtectedAction, 158 SdHoareTripleChecker+Valid, 519 SdHoareTripleChecker+Invalid, 866 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 118 IncrementalHoareTripleChecker+Valid, 748 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.7s IncrementalHoareTripleChecker+Time [2025-02-05 11:56:05,462 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [158 Valid, 519 Invalid, 866 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [118 Valid, 748 Invalid, 0 Unknown, 0 Unchecked, 0.7s Time] [2025-02-05 11:56:05,466 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 16846 states. [2025-02-05 11:56:05,592 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 16846 to 16547. [2025-02-05 11:56:05,608 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 16547 states, 16546 states have (on average 1.054031185785084) internal successors, (17440), 16546 states have internal predecessors, (17440), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-02-05 11:56:05,630 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 16547 states to 16547 states and 17440 transitions. [2025-02-05 11:56:05,631 INFO L78 Accepts]: Start accepts. Automaton has 16547 states and 17440 transitions. Word has length 730 [2025-02-05 11:56:05,632 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-02-05 11:56:05,632 INFO L471 AbstractCegarLoop]: Abstraction has 16547 states and 17440 transitions. [2025-02-05 11:56:05,632 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 156.0) internal successors, (468), 3 states have internal predecessors, (468), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-02-05 11:56:05,632 INFO L276 IsEmpty]: Start isEmpty. Operand 16547 states and 17440 transitions. [2025-02-05 11:56:05,645 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 734 [2025-02-05 11:56:05,645 INFO L210 NwaCegarLoop]: Found error trace [2025-02-05 11:56:05,645 INFO L218 NwaCegarLoop]: trace histogram [5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-02-05 11:56:05,645 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable11 [2025-02-05 11:56:05,646 INFO L396 AbstractCegarLoop]: === Iteration 13 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-02-05 11:56:05,646 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-02-05 11:56:05,646 INFO L85 PathProgramCache]: Analyzing trace with hash -283539253, now seen corresponding path program 1 times [2025-02-05 11:56:05,646 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-02-05 11:56:05,646 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1833434644] [2025-02-05 11:56:05,646 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-02-05 11:56:05,647 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-02-05 11:56:05,724 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 733 statements into 1 equivalence classes. [2025-02-05 11:56:05,767 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 733 of 733 statements. [2025-02-05 11:56:05,767 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-02-05 11:56:05,767 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-02-05 11:56:05,932 INFO L134 CoverageAnalysis]: Checked inductivity of 937 backedges. 151 proven. 0 refuted. 0 times theorem prover too weak. 786 trivial. 0 not checked. [2025-02-05 11:56:05,932 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-02-05 11:56:05,932 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1833434644] [2025-02-05 11:56:05,932 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1833434644] provided 1 perfect and 0 imperfect interpolant sequences [2025-02-05 11:56:05,932 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-02-05 11:56:05,933 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2025-02-05 11:56:05,933 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [769380252] [2025-02-05 11:56:05,933 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-02-05 11:56:05,933 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2025-02-05 11:56:05,933 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-02-05 11:56:05,934 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2025-02-05 11:56:05,934 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-02-05 11:56:05,934 INFO L87 Difference]: Start difference. First operand 16547 states and 17440 transitions. Second operand has 3 states, 3 states have (on average 104.66666666666667) internal successors, (314), 3 states have internal predecessors, (314), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-02-05 11:56:06,728 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-02-05 11:56:06,728 INFO L93 Difference]: Finished difference Result 34886 states and 36869 transitions. [2025-02-05 11:56:06,729 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2025-02-05 11:56:06,729 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 104.66666666666667) internal successors, (314), 3 states have internal predecessors, (314), 0 states have call successors, (0), 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 733 [2025-02-05 11:56:06,729 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-02-05 11:56:06,747 INFO L225 Difference]: With dead ends: 34886 [2025-02-05 11:56:06,747 INFO L226 Difference]: Without dead ends: 18640 [2025-02-05 11:56:06,756 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 3 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-02-05 11:56:06,757 INFO L435 NwaCegarLoop]: 167 mSDtfsCounter, 276 mSDsluCounter, 41 mSDsCounter, 0 mSdLazyCounter, 750 mSolverCounterSat, 110 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.6s Time, 0 mProtectedPredicate, 0 mProtectedAction, 276 SdHoareTripleChecker+Valid, 208 SdHoareTripleChecker+Invalid, 860 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 110 IncrementalHoareTripleChecker+Valid, 750 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.7s IncrementalHoareTripleChecker+Time [2025-02-05 11:56:06,757 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [276 Valid, 208 Invalid, 860 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [110 Valid, 750 Invalid, 0 Unknown, 0 Unchecked, 0.7s Time] [2025-02-05 11:56:06,766 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 18640 states. [2025-02-05 11:56:06,934 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 18640 to 15046. [2025-02-05 11:56:06,943 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 15046 states, 15045 states have (on average 1.0544366899302093) internal successors, (15864), 15045 states have internal predecessors, (15864), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-02-05 11:56:06,955 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 15046 states to 15046 states and 15864 transitions. [2025-02-05 11:56:06,955 INFO L78 Accepts]: Start accepts. Automaton has 15046 states and 15864 transitions. Word has length 733 [2025-02-05 11:56:06,956 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-02-05 11:56:06,956 INFO L471 AbstractCegarLoop]: Abstraction has 15046 states and 15864 transitions. [2025-02-05 11:56:06,956 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 104.66666666666667) internal successors, (314), 3 states have internal predecessors, (314), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-02-05 11:56:06,956 INFO L276 IsEmpty]: Start isEmpty. Operand 15046 states and 15864 transitions. [2025-02-05 11:56:06,964 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 770 [2025-02-05 11:56:06,964 INFO L210 NwaCegarLoop]: Found error trace [2025-02-05 11:56:06,964 INFO L218 NwaCegarLoop]: trace histogram [6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 3, 3, 3, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-02-05 11:56:06,964 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable12 [2025-02-05 11:56:06,964 INFO L396 AbstractCegarLoop]: === Iteration 14 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-02-05 11:56:06,965 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-02-05 11:56:06,965 INFO L85 PathProgramCache]: Analyzing trace with hash -1310677543, now seen corresponding path program 1 times [2025-02-05 11:56:06,965 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-02-05 11:56:06,965 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [652831834] [2025-02-05 11:56:06,965 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-02-05 11:56:06,965 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-02-05 11:56:07,007 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 769 statements into 1 equivalence classes. [2025-02-05 11:56:07,032 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 769 of 769 statements. [2025-02-05 11:56:07,033 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-02-05 11:56:07,033 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-02-05 11:56:07,775 INFO L134 CoverageAnalysis]: Checked inductivity of 1221 backedges. 543 proven. 390 refuted. 0 times theorem prover too weak. 288 trivial. 0 not checked. [2025-02-05 11:56:07,775 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-02-05 11:56:07,776 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [652831834] [2025-02-05 11:56:07,776 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [652831834] provided 0 perfect and 1 imperfect interpolant sequences [2025-02-05 11:56:07,776 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [812761141] [2025-02-05 11:56:07,776 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-02-05 11:56:07,776 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-02-05 11:56:07,776 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 [2025-02-05 11:56:07,778 INFO L229 MonitoredProcess]: Starting monitored process 3 with /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2025-02-05 11:56:07,780 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (3)] Waiting until timeout for monitored process [2025-02-05 11:56:07,847 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 769 statements into 1 equivalence classes. [2025-02-05 11:56:07,980 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 769 of 769 statements. [2025-02-05 11:56:07,980 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-02-05 11:56:07,980 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-02-05 11:56:07,982 INFO L256 TraceCheckSpWp]: Trace formula consists of 928 conjuncts, 2 conjuncts are in the unsatisfiable core [2025-02-05 11:56:07,997 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-02-05 11:56:08,153 INFO L134 CoverageAnalysis]: Checked inductivity of 1221 backedges. 645 proven. 0 refuted. 0 times theorem prover too weak. 576 trivial. 0 not checked. [2025-02-05 11:56:08,153 INFO L308 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2025-02-05 11:56:08,154 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [812761141] provided 1 perfect and 0 imperfect interpolant sequences [2025-02-05 11:56:08,154 INFO L185 FreeRefinementEngine]: Found 1 perfect and 1 imperfect interpolant sequences. [2025-02-05 11:56:08,154 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [4] total 5 [2025-02-05 11:56:08,155 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [512059871] [2025-02-05 11:56:08,155 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-02-05 11:56:08,156 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2025-02-05 11:56:08,156 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-02-05 11:56:08,156 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2025-02-05 11:56:08,156 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=9, Invalid=11, Unknown=0, NotChecked=0, Total=20 [2025-02-05 11:56:08,157 INFO L87 Difference]: Start difference. First operand 15046 states and 15864 transitions. Second operand has 3 states, 3 states have (on average 157.0) internal successors, (471), 3 states have internal predecessors, (471), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-02-05 11:56:08,983 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-02-05 11:56:08,984 INFO L93 Difference]: Finished difference Result 34574 states and 36530 transitions. [2025-02-05 11:56:08,985 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2025-02-05 11:56:08,985 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 157.0) internal successors, (471), 3 states have internal predecessors, (471), 0 states have call successors, (0), 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 769 [2025-02-05 11:56:08,985 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-02-05 11:56:09,001 INFO L225 Difference]: With dead ends: 34574 [2025-02-05 11:56:09,002 INFO L226 Difference]: Without dead ends: 19829 [2025-02-05 11:56:09,010 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 773 GetRequests, 770 SyntacticMatches, 0 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=9, Invalid=11, Unknown=0, NotChecked=0, Total=20 [2025-02-05 11:56:09,011 INFO L435 NwaCegarLoop]: 95 mSDtfsCounter, 207 mSDsluCounter, 28 mSDsCounter, 0 mSdLazyCounter, 785 mSolverCounterSat, 116 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.6s Time, 0 mProtectedPredicate, 0 mProtectedAction, 207 SdHoareTripleChecker+Valid, 123 SdHoareTripleChecker+Invalid, 901 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 116 IncrementalHoareTripleChecker+Valid, 785 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.7s IncrementalHoareTripleChecker+Time [2025-02-05 11:56:09,011 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [207 Valid, 123 Invalid, 901 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [116 Valid, 785 Invalid, 0 Unknown, 0 Unchecked, 0.7s Time] [2025-02-05 11:56:09,020 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 19829 states. [2025-02-05 11:56:09,116 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 19829 to 18633. [2025-02-05 11:56:09,128 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 18633 states, 18632 states have (on average 1.0521683125805066) internal successors, (19604), 18632 states have internal predecessors, (19604), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-02-05 11:56:09,144 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 18633 states to 18633 states and 19604 transitions. [2025-02-05 11:56:09,144 INFO L78 Accepts]: Start accepts. Automaton has 18633 states and 19604 transitions. Word has length 769 [2025-02-05 11:56:09,144 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-02-05 11:56:09,144 INFO L471 AbstractCegarLoop]: Abstraction has 18633 states and 19604 transitions. [2025-02-05 11:56:09,145 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 157.0) internal successors, (471), 3 states have internal predecessors, (471), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-02-05 11:56:09,145 INFO L276 IsEmpty]: Start isEmpty. Operand 18633 states and 19604 transitions. [2025-02-05 11:56:09,152 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 784 [2025-02-05 11:56:09,152 INFO L210 NwaCegarLoop]: Found error trace [2025-02-05 11:56:09,153 INFO L218 NwaCegarLoop]: trace histogram [5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-02-05 11:56:09,160 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (3)] Ended with exit code 0 [2025-02-05 11:56:09,353 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable13,3 /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-02-05 11:56:09,353 INFO L396 AbstractCegarLoop]: === Iteration 15 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-02-05 11:56:09,354 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-02-05 11:56:09,354 INFO L85 PathProgramCache]: Analyzing trace with hash -1074896344, now seen corresponding path program 1 times [2025-02-05 11:56:09,354 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-02-05 11:56:09,354 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1297087260] [2025-02-05 11:56:09,354 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-02-05 11:56:09,354 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-02-05 11:56:09,427 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 783 statements into 1 equivalence classes. [2025-02-05 11:56:09,465 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 783 of 783 statements. [2025-02-05 11:56:09,465 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-02-05 11:56:09,465 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-02-05 11:56:10,640 INFO L134 CoverageAnalysis]: Checked inductivity of 1014 backedges. 478 proven. 306 refuted. 0 times theorem prover too weak. 230 trivial. 0 not checked. [2025-02-05 11:56:10,640 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-02-05 11:56:10,640 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1297087260] [2025-02-05 11:56:10,640 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1297087260] provided 0 perfect and 1 imperfect interpolant sequences [2025-02-05 11:56:10,640 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1487249701] [2025-02-05 11:56:10,640 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-02-05 11:56:10,641 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-02-05 11:56:10,641 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 [2025-02-05 11:56:10,643 INFO L229 MonitoredProcess]: Starting monitored process 4 with /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2025-02-05 11:56:10,644 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (4)] Waiting until timeout for monitored process [2025-02-05 11:56:10,718 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 783 statements into 1 equivalence classes. [2025-02-05 11:56:10,826 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 783 of 783 statements. [2025-02-05 11:56:10,826 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-02-05 11:56:10,826 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-02-05 11:56:10,829 INFO L256 TraceCheckSpWp]: Trace formula consists of 916 conjuncts, 2 conjuncts are in the unsatisfiable core [2025-02-05 11:56:10,835 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-02-05 11:56:10,885 INFO L134 CoverageAnalysis]: Checked inductivity of 1014 backedges. 151 proven. 0 refuted. 0 times theorem prover too weak. 863 trivial. 0 not checked. [2025-02-05 11:56:10,885 INFO L308 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2025-02-05 11:56:10,885 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1487249701] provided 1 perfect and 0 imperfect interpolant sequences [2025-02-05 11:56:10,885 INFO L185 FreeRefinementEngine]: Found 1 perfect and 1 imperfect interpolant sequences. [2025-02-05 11:56:10,886 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [4] total 5 [2025-02-05 11:56:10,886 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1031154858] [2025-02-05 11:56:10,886 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-02-05 11:56:10,886 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2025-02-05 11:56:10,886 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-02-05 11:56:10,887 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2025-02-05 11:56:10,887 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=8, Invalid=12, Unknown=0, NotChecked=0, Total=20 [2025-02-05 11:56:10,887 INFO L87 Difference]: Start difference. First operand 18633 states and 19604 transitions. Second operand has 3 states, 3 states have (on average 105.33333333333333) internal successors, (316), 3 states have internal predecessors, (316), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-02-05 11:56:11,756 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-02-05 11:56:11,756 INFO L93 Difference]: Finished difference Result 37558 states and 39627 transitions. [2025-02-05 11:56:11,757 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2025-02-05 11:56:11,757 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 105.33333333333333) internal successors, (316), 3 states have internal predecessors, (316), 0 states have call successors, (0), 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 783 [2025-02-05 11:56:11,757 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-02-05 11:56:11,772 INFO L225 Difference]: With dead ends: 37558 [2025-02-05 11:56:11,772 INFO L226 Difference]: Without dead ends: 18927 [2025-02-05 11:56:11,782 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 787 GetRequests, 784 SyntacticMatches, 0 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=8, Invalid=12, Unknown=0, NotChecked=0, Total=20 [2025-02-05 11:56:11,783 INFO L435 NwaCegarLoop]: 467 mSDtfsCounter, 283 mSDsluCounter, 32 mSDsCounter, 0 mSdLazyCounter, 746 mSolverCounterSat, 112 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.7s Time, 0 mProtectedPredicate, 0 mProtectedAction, 283 SdHoareTripleChecker+Valid, 499 SdHoareTripleChecker+Invalid, 858 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 112 IncrementalHoareTripleChecker+Valid, 746 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.8s IncrementalHoareTripleChecker+Time [2025-02-05 11:56:11,783 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [283 Valid, 499 Invalid, 858 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [112 Valid, 746 Invalid, 0 Unknown, 0 Unchecked, 0.8s Time] [2025-02-05 11:56:11,791 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 18927 states. [2025-02-05 11:56:11,889 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 18927 to 18328. [2025-02-05 11:56:11,902 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 18328 states, 18327 states have (on average 1.037758498390353) internal successors, (19019), 18327 states have internal predecessors, (19019), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-02-05 11:56:11,916 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 18328 states to 18328 states and 19019 transitions. [2025-02-05 11:56:11,917 INFO L78 Accepts]: Start accepts. Automaton has 18328 states and 19019 transitions. Word has length 783 [2025-02-05 11:56:11,917 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-02-05 11:56:11,917 INFO L471 AbstractCegarLoop]: Abstraction has 18328 states and 19019 transitions. [2025-02-05 11:56:11,918 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 105.33333333333333) internal successors, (316), 3 states have internal predecessors, (316), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-02-05 11:56:11,918 INFO L276 IsEmpty]: Start isEmpty. Operand 18328 states and 19019 transitions. [2025-02-05 11:56:11,927 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 920 [2025-02-05 11:56:11,928 INFO L210 NwaCegarLoop]: Found error trace [2025-02-05 11:56:11,928 INFO L218 NwaCegarLoop]: trace histogram [6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-02-05 11:56:11,935 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (4)] Forceful destruction successful, exit code 0 [2025-02-05 11:56:12,129 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable14,4 /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-02-05 11:56:12,129 INFO L396 AbstractCegarLoop]: === Iteration 16 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-02-05 11:56:12,130 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-02-05 11:56:12,130 INFO L85 PathProgramCache]: Analyzing trace with hash 1697151752, now seen corresponding path program 1 times [2025-02-05 11:56:12,130 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-02-05 11:56:12,130 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [50231766] [2025-02-05 11:56:12,130 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-02-05 11:56:12,130 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-02-05 11:56:12,179 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 919 statements into 1 equivalence classes. [2025-02-05 11:56:12,212 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 919 of 919 statements. [2025-02-05 11:56:12,212 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-02-05 11:56:12,212 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-02-05 11:56:12,547 INFO L134 CoverageAnalysis]: Checked inductivity of 1399 backedges. 728 proven. 0 refuted. 0 times theorem prover too weak. 671 trivial. 0 not checked. [2025-02-05 11:56:12,547 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-02-05 11:56:12,547 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [50231766] [2025-02-05 11:56:12,547 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [50231766] provided 1 perfect and 0 imperfect interpolant sequences [2025-02-05 11:56:12,547 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-02-05 11:56:12,547 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2025-02-05 11:56:12,547 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1082089078] [2025-02-05 11:56:12,547 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-02-05 11:56:12,547 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2025-02-05 11:56:12,548 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-02-05 11:56:12,548 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2025-02-05 11:56:12,548 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-02-05 11:56:12,548 INFO L87 Difference]: Start difference. First operand 18328 states and 19019 transitions. Second operand has 3 states, 3 states have (on average 148.66666666666666) internal successors, (446), 3 states have internal predecessors, (446), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-02-05 11:56:13,437 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-02-05 11:56:13,438 INFO L93 Difference]: Finished difference Result 41453 states and 42997 transitions. [2025-02-05 11:56:13,438 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2025-02-05 11:56:13,438 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 148.66666666666666) internal successors, (446), 3 states have internal predecessors, (446), 0 states have call successors, (0), 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 919 [2025-02-05 11:56:13,438 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-02-05 11:56:13,455 INFO L225 Difference]: With dead ends: 41453 [2025-02-05 11:56:13,456 INFO L226 Difference]: Without dead ends: 23426 [2025-02-05 11:56:13,466 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 3 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-02-05 11:56:13,466 INFO L435 NwaCegarLoop]: 131 mSDtfsCounter, 268 mSDsluCounter, 23 mSDsCounter, 0 mSdLazyCounter, 797 mSolverCounterSat, 124 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.7s Time, 0 mProtectedPredicate, 0 mProtectedAction, 268 SdHoareTripleChecker+Valid, 154 SdHoareTripleChecker+Invalid, 921 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 124 IncrementalHoareTripleChecker+Valid, 797 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.8s IncrementalHoareTripleChecker+Time [2025-02-05 11:56:13,466 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [268 Valid, 154 Invalid, 921 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [124 Valid, 797 Invalid, 0 Unknown, 0 Unchecked, 0.8s Time] [2025-02-05 11:56:13,477 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 23426 states. [2025-02-05 11:56:13,592 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 23426 to 20122. [2025-02-05 11:56:13,604 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 20122 states, 20121 states have (on average 1.038169077083644) internal successors, (20889), 20121 states have internal predecessors, (20889), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-02-05 11:56:13,777 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 20122 states to 20122 states and 20889 transitions. [2025-02-05 11:56:13,778 INFO L78 Accepts]: Start accepts. Automaton has 20122 states and 20889 transitions. Word has length 919 [2025-02-05 11:56:13,778 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-02-05 11:56:13,778 INFO L471 AbstractCegarLoop]: Abstraction has 20122 states and 20889 transitions. [2025-02-05 11:56:13,779 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 148.66666666666666) internal successors, (446), 3 states have internal predecessors, (446), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-02-05 11:56:13,779 INFO L276 IsEmpty]: Start isEmpty. Operand 20122 states and 20889 transitions. [2025-02-05 11:56:13,801 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 1596 [2025-02-05 11:56:13,801 INFO L210 NwaCegarLoop]: Found error trace [2025-02-05 11:56:13,802 INFO L218 NwaCegarLoop]: trace histogram [9, 9, 9, 9, 9, 9, 9, 9, 9, 9, 9, 9, 9, 9, 9, 9, 9, 9, 9, 9, 9, 9, 9, 9, 9, 9, 9, 9, 9, 9, 9, 9, 9, 9, 9, 9, 8, 8, 8, 8, 8, 8, 8, 8, 8, 8, 8, 8, 8, 8, 8, 8, 8, 8, 8, 8, 8, 8, 8, 8, 8, 8, 8, 8, 8, 8, 8, 8, 8, 8, 8, 8, 8, 8, 8, 8, 8, 8, 8, 8, 8, 8, 8, 8, 8, 8, 8, 8, 8, 8, 8, 7, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 3, 3, 3, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-02-05 11:56:13,805 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable15 [2025-02-05 11:56:13,806 INFO L396 AbstractCegarLoop]: === Iteration 17 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-02-05 11:56:13,806 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-02-05 11:56:13,806 INFO L85 PathProgramCache]: Analyzing trace with hash -1399069378, now seen corresponding path program 1 times [2025-02-05 11:56:13,806 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-02-05 11:56:13,806 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1942501425] [2025-02-05 11:56:13,807 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-02-05 11:56:13,807 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-02-05 11:56:13,943 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 1595 statements into 1 equivalence classes. [2025-02-05 11:56:14,046 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 1595 of 1595 statements. [2025-02-05 11:56:14,046 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-02-05 11:56:14,046 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-02-05 11:56:14,455 INFO L134 CoverageAnalysis]: Checked inductivity of 4570 backedges. 2866 proven. 0 refuted. 0 times theorem prover too weak. 1704 trivial. 0 not checked. [2025-02-05 11:56:14,455 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-02-05 11:56:14,455 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1942501425] [2025-02-05 11:56:14,455 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1942501425] provided 1 perfect and 0 imperfect interpolant sequences [2025-02-05 11:56:14,455 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-02-05 11:56:14,455 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2025-02-05 11:56:14,456 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1584776797] [2025-02-05 11:56:14,456 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-02-05 11:56:14,456 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2025-02-05 11:56:14,456 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-02-05 11:56:14,457 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2025-02-05 11:56:14,457 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-02-05 11:56:14,457 INFO L87 Difference]: Start difference. First operand 20122 states and 20889 transitions. Second operand has 3 states, 3 states have (on average 207.33333333333334) internal successors, (622), 3 states have internal predecessors, (622), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-02-05 11:56:15,119 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-02-05 11:56:15,119 INFO L93 Difference]: Finished difference Result 33015 states and 34137 transitions. [2025-02-05 11:56:15,120 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2025-02-05 11:56:15,120 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 207.33333333333334) internal successors, (622), 3 states have internal predecessors, (622), 0 states have call successors, (0), 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 1595 [2025-02-05 11:56:15,121 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-02-05 11:56:15,121 INFO L225 Difference]: With dead ends: 33015 [2025-02-05 11:56:15,122 INFO L226 Difference]: Without dead ends: 0 [2025-02-05 11:56:15,130 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 3 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-02-05 11:56:15,131 INFO L435 NwaCegarLoop]: 84 mSDtfsCounter, 72 mSDsluCounter, 30 mSDsCounter, 0 mSdLazyCounter, 667 mSolverCounterSat, 55 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.5s Time, 0 mProtectedPredicate, 0 mProtectedAction, 72 SdHoareTripleChecker+Valid, 114 SdHoareTripleChecker+Invalid, 722 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 55 IncrementalHoareTripleChecker+Valid, 667 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.6s IncrementalHoareTripleChecker+Time [2025-02-05 11:56:15,131 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [72 Valid, 114 Invalid, 722 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [55 Valid, 667 Invalid, 0 Unknown, 0 Unchecked, 0.6s Time] [2025-02-05 11:56:15,132 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 0 states. [2025-02-05 11:56:15,132 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 0 to 0. [2025-02-05 11:56:15,132 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 0 states, 0 states have (on average 0.0) internal successors, (0), 0 states have internal predecessors, (0), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-02-05 11:56:15,132 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 0 states to 0 states and 0 transitions. [2025-02-05 11:56:15,132 INFO L78 Accepts]: Start accepts. Automaton has 0 states and 0 transitions. Word has length 1595 [2025-02-05 11:56:15,132 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-02-05 11:56:15,132 INFO L471 AbstractCegarLoop]: Abstraction has 0 states and 0 transitions. [2025-02-05 11:56:15,133 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 207.33333333333334) internal successors, (622), 3 states have internal predecessors, (622), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-02-05 11:56:15,133 INFO L276 IsEmpty]: Start isEmpty. Operand 0 states and 0 transitions. [2025-02-05 11:56:15,133 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2025-02-05 11:56:15,135 INFO L782 garLoopResultBuilder]: Registering result SAFE for location ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION (0 of 1 remaining) [2025-02-05 11:56:15,135 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable16 [2025-02-05 11:56:15,137 INFO L422 BasicCegarLoop]: Path program histogram: [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-02-05 11:56:15,138 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends 0 states and 0 transitions. [2025-02-05 11:56:16,064 INFO L170 ceAbstractionStarter]: Computing trace abstraction results [2025-02-05 11:56:16,087 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction CFG 05.02 11:56:16 BoogieIcfgContainer [2025-02-05 11:56:16,087 INFO L131 PluginConnector]: ------------------------ END TraceAbstraction---------------------------- [2025-02-05 11:56:16,088 INFO L112 PluginConnector]: ------------------------Witness Printer---------------------------- [2025-02-05 11:56:16,088 INFO L270 PluginConnector]: Initializing Witness Printer... [2025-02-05 11:56:16,088 INFO L274 PluginConnector]: Witness Printer initialized [2025-02-05 11:56:16,089 INFO L184 PluginConnector]: Executing the observer RCFGCatcher from plugin Witness Printer for "de.uni_freiburg.informatik.ultimate.plugins.generator.icfgbuilder CFG 05.02 11:55:39" (3/4) ... [2025-02-05 11:56:16,090 INFO L146 WitnessPrinter]: Generating witness for correct program [2025-02-05 11:56:16,114 INFO L919 BoogieBacktranslator]: Reduced CFG by removing 12 nodes and edges [2025-02-05 11:56:16,116 INFO L919 BoogieBacktranslator]: Reduced CFG by removing 4 nodes and edges [2025-02-05 11:56:16,117 INFO L919 BoogieBacktranslator]: Reduced CFG by removing 3 nodes and edges [2025-02-05 11:56:16,118 INFO L919 BoogieBacktranslator]: Reduced CFG by removing 1 nodes and edges [2025-02-05 11:56:16,251 INFO L149 WitnessManager]: Wrote witness to /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/witness.graphml [2025-02-05 11:56:16,251 INFO L149 WitnessManager]: Wrote witness to /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/witness.yml [2025-02-05 11:56:16,251 INFO L131 PluginConnector]: ------------------------ END Witness Printer---------------------------- [2025-02-05 11:56:16,252 INFO L158 Benchmark]: Toolchain (without parser) took 40233.49ms. Allocated memory was 167.8MB in the beginning and 1.6GB in the end (delta: 1.4GB). Free memory was 125.7MB in the beginning and 1.1GB in the end (delta: -1.0GB). Peak memory consumption was 397.2MB. Max. memory is 16.1GB. [2025-02-05 11:56:16,252 INFO L158 Benchmark]: CDTParser took 0.34ms. Allocated memory is still 226.5MB. Free memory is still 149.4MB. There was no memory consumed. Max. memory is 16.1GB. [2025-02-05 11:56:16,252 INFO L158 Benchmark]: CACSL2BoogieTranslator took 634.74ms. Allocated memory is still 167.8MB. Free memory was 125.7MB in the beginning and 51.6MB in the end (delta: 74.1MB). Peak memory consumption was 75.5MB. Max. memory is 16.1GB. [2025-02-05 11:56:16,253 INFO L158 Benchmark]: Boogie Procedure Inliner took 234.76ms. Allocated memory is still 167.8MB. Free memory was 51.6MB in the beginning and 94.8MB in the end (delta: -43.2MB). Peak memory consumption was 21.0MB. Max. memory is 16.1GB. [2025-02-05 11:56:16,253 INFO L158 Benchmark]: Boogie Preprocessor took 250.15ms. Allocated memory is still 167.8MB. Free memory was 94.8MB in the beginning and 98.5MB in the end (delta: -3.7MB). Peak memory consumption was 49.6MB. Max. memory is 16.1GB. [2025-02-05 11:56:16,253 INFO L158 Benchmark]: IcfgBuilder took 2282.39ms. Allocated memory was 167.8MB in the beginning and 335.5MB in the end (delta: 167.8MB). Free memory was 97.6MB in the beginning and 236.8MB in the end (delta: -139.2MB). Peak memory consumption was 181.0MB. Max. memory is 16.1GB. [2025-02-05 11:56:16,253 INFO L158 Benchmark]: TraceAbstraction took 36662.39ms. Allocated memory was 335.5MB in the beginning and 1.6GB in the end (delta: 1.2GB). Free memory was 233.6MB in the beginning and 1.2GB in the end (delta: -918.9MB). Peak memory consumption was 903.3MB. Max. memory is 16.1GB. [2025-02-05 11:56:16,254 INFO L158 Benchmark]: Witness Printer took 163.50ms. Allocated memory is still 1.6GB. Free memory was 1.2GB in the beginning and 1.1GB in the end (delta: 24.9MB). Peak memory consumption was 25.2MB. Max. memory is 16.1GB. [2025-02-05 11:56:16,255 INFO L338 ainManager$Toolchain]: ####################### End [Toolchain 1] ####################### --- Results --- * Results from de.uni_freiburg.informatik.ultimate.core: - StatisticsResult: Toolchain Benchmarks Benchmark results are: * CDTParser took 0.34ms. Allocated memory is still 226.5MB. Free memory is still 149.4MB. There was no memory consumed. Max. memory is 16.1GB. * CACSL2BoogieTranslator took 634.74ms. Allocated memory is still 167.8MB. Free memory was 125.7MB in the beginning and 51.6MB in the end (delta: 74.1MB). Peak memory consumption was 75.5MB. Max. memory is 16.1GB. * Boogie Procedure Inliner took 234.76ms. Allocated memory is still 167.8MB. Free memory was 51.6MB in the beginning and 94.8MB in the end (delta: -43.2MB). Peak memory consumption was 21.0MB. Max. memory is 16.1GB. * Boogie Preprocessor took 250.15ms. Allocated memory is still 167.8MB. Free memory was 94.8MB in the beginning and 98.5MB in the end (delta: -3.7MB). Peak memory consumption was 49.6MB. Max. memory is 16.1GB. * IcfgBuilder took 2282.39ms. Allocated memory was 167.8MB in the beginning and 335.5MB in the end (delta: 167.8MB). Free memory was 97.6MB in the beginning and 236.8MB in the end (delta: -139.2MB). Peak memory consumption was 181.0MB. Max. memory is 16.1GB. * TraceAbstraction took 36662.39ms. Allocated memory was 335.5MB in the beginning and 1.6GB in the end (delta: 1.2GB). Free memory was 233.6MB in the beginning and 1.2GB in the end (delta: -918.9MB). Peak memory consumption was 903.3MB. Max. memory is 16.1GB. * Witness Printer took 163.50ms. Allocated memory is still 1.6GB. Free memory was 1.2GB in the beginning and 1.1GB in the end (delta: 24.9MB). Peak memory consumption was 25.2MB. Max. memory is 16.1GB. * Results from de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction: - StatisticsResult: ErrorAutomatonStatistics NumberErrorTraces: 0, NumberStatementsAllTraces: 0, NumberRelevantStatements: 0, 0.0s ErrorAutomatonConstructionTimeTotal, 0.0s FaulLocalizationTime, NumberStatementsFirstTrace: -1, TraceLengthAvg: 0, 0.0s ErrorAutomatonConstructionTimeAvg, 0.0s ErrorAutomatonDifferenceTimeAvg, 0.0s ErrorAutomatonDifferenceTimeTotal, NumberOfNoEnhancement: 0, NumberOfFiniteEnhancement: 0, NumberOfInfiniteEnhancement: 0 - PositiveResult [Line: 137]: a call to reach_error is unreachable For all program executions holds that a call to reach_error is unreachable at this location - StatisticsResult: Ultimate Automizer benchmark data CFG has 1 procedures, 424 locations, 1 error locations. Started 1 CEGAR loops. OverallTime: 35.6s, OverallIterations: 17, TraceHistogramMax: 9, PathProgramHistogramMax: 1, EmptinessCheckTime: 0.1s, AutomataDifference: 23.1s, DeadEndRemovalTime: 0.0s, HoareAnnotationTime: 0.0s, InitialAbstractionConstructionTime: 0.0s, HoareTripleCheckerStatistics: 0 mSolverCounterUnknown, 7628 SdHoareTripleChecker+Valid, 21.2s IncrementalHoareTripleChecker+Time, 0 mSdLazyCounter, 7628 mSDsluCounter, 5592 SdHoareTripleChecker+Invalid, 17.9s Time, 0 mProtectedAction, 0 SdHoareTripleChecker+Unchecked, 0 IncrementalHoareTripleChecker+Unchecked, 825 mSDsCounter, 3229 IncrementalHoareTripleChecker+Valid, 0 mProtectedPredicate, 21256 IncrementalHoareTripleChecker+Invalid, 24485 SdHoareTripleChecker+Unknown, 0 mSolverCounterNotChecked, 3229 mSolverCounterUnsat, 4767 mSDtfsCounter, 21256 mSolverCounterSat, 0.1s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Unknown, PredicateUnifierStatistics: 0 DeclaredPredicates, 2021 GetRequests, 1986 SyntacticMatches, 0 SemanticMatches, 35 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 40 ImplicationChecksByTransitivity, 0.2s Time, 0.0s BasicInterpolantAutomatonTime, BiggestAbstraction: size=20122occurred in iteration=16, InterpolantAutomatonStates: 63, traceCheckStatistics: No data available, InterpolantConsolidationStatistics: No data available, PathInvariantsStatistics: No data available, 0/0 InterpolantCoveringCapability, TotalInterpolationStatistics: No data available, 0.0s DumpTime, AutomataMinimizationStatistics: 2.1s AutomataMinimizationTime, 17 MinimizatonAttempts, 12941 StatesRemovedByMinimization, 13 NontrivialMinimizations, HoareAnnotationStatistics: No data available, RefinementEngineStatistics: TRACE_CHECK: 0.3s SsaConstructionTime, 0.9s SatisfiabilityAnalysisTime, 7.5s InterpolantComputationTime, 10973 NumberOfCodeBlocks, 10973 NumberOfCodeBlocksAsserted, 20 NumberOfCheckSat, 11159 ConstructedInterpolants, 0 QuantifiedInterpolants, 27038 SizeOfPredicates, 5 NumberOfNonLiveVariables, 2144 ConjunctsInSsa, 11 ConjunctsInUnsatCore, 21 InterpolantComputations, 16 PerfectInterpolantSequences, 13887/14706 InterpolantCoveringCapability, INVARIANT_SYNTHESIS: No data available, INTERPOLANT_CONSOLIDATION: No data available, ABSTRACT_INTERPRETATION: No data available, PDR: No data available, ACCELERATED_INTERPOLATION: No data available, SIFA: No data available, ReuseStatistics: No data available, ConComCheckerStatistics: No data available - AllSpecificationsHoldResult: All specifications hold 1 specifications checked. All of them hold - InvariantResult [Line: 1776]: Location Invariant Derived location invariant: ((((((((((((((((((long long) a29 + 18) <= 0) && (((long long) a4 + 86) <= 0)) && (3 == a2)) || ((((((long long) 89 + a4) <= 0) && (a2 == 1)) && (a29 <= 401234)) && (((long long) a0 + 61) <= 0))) || (((2 == a2) && (((long long) 98 + a0) <= 0)) && (0 <= ((long long) 146 + a0)))) || ((2 == a2) && (((long long) 89 + a4) <= 0))) || (((((long long) 89 + a4) <= 0) && (((long long) a29 + 18) <= 0)) && (a2 == 4))) || ((((long long) 89 + a4) <= 0) && (3 == a2))) || (((a29 <= 41) && (((long long) 42 + a4) <= 0)) && (a2 == 1))) || (((((long long) 89 + a4) <= 0) && (((long long) a29 + 127) <= 0)) && (((long long) a0 + 61) <= 0))) || ((((long long) 42 + a4) <= 0) && (((long long) 98 + a0) <= 0))) || (((0 <= ((long long) a0 + 60)) && (5 <= a2)) && (((long long) a4 + 86) <= 0))) || (((0 <= ((long long) a0 + 60)) && (((long long) a4 + 86) <= 0)) && (3 == a2))) || (((2 == a2) && (0 <= ((long long) a0 + 60))) && (((long long) a4 + 86) <= 0))) || ((((long long) 89 + a4) <= 0) && (5 <= a2))) || (((0 <= ((long long) a0 + 60)) && (((long long) a4 + 86) <= 0)) && (a2 == 4))) RESULT: Ultimate proved your program to be correct! [2025-02-05 11:56:16,278 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 (1)] Forceful destruction successful, exit code 0 Received shutdown request... --- End real Ultimate output --- Execution finished normally Writing output log to file Ultimate.log Result: TRUE