./Ultimate.py --spec ../sv-benchmarks/c/properties/unreach-call.prp --file ../sv-benchmarks/c/hardness-nfm22/hardness_fillercode_fillercodesize_ps-cn-100_file-56.i --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/hardness-nfm22/hardness_fillercode_fillercodesize_ps-cn-100_file-56.i -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 372612807ec8a09625942983a4318ea5cf13bd58b55643cc4c787d7ad1a0ebc5 --- Real Ultimate output --- This is Ultimate 0.3.0-?-c00e63d-m [2025-02-05 21:13:26,932 INFO L188 SettingsManager]: Resetting all preferences to default values... [2025-02-05 21:13:26,992 INFO L114 SettingsManager]: Loading settings from /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/config/svcomp-Reach-32bit-Automizer_Default.epf [2025-02-05 21:13:27,002 WARN L101 SettingsManager]: Preference file contains the following unknown settings: [2025-02-05 21:13:27,003 WARN L103 SettingsManager]: * de.uni_freiburg.informatik.ultimate.core.Log level for class [2025-02-05 21:13:27,017 INFO L130 SettingsManager]: Preferences different from defaults after loading the file: [2025-02-05 21:13:27,019 INFO L151 SettingsManager]: Preferences of UltimateCore differ from their defaults: [2025-02-05 21:13:27,019 INFO L153 SettingsManager]: * Log level for class=de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher=ERROR; [2025-02-05 21:13:27,020 INFO L151 SettingsManager]: Preferences of Boogie Preprocessor differ from their defaults: [2025-02-05 21:13:27,020 INFO L153 SettingsManager]: * Use memory slicer=true [2025-02-05 21:13:27,021 INFO L151 SettingsManager]: Preferences of Boogie Procedure Inliner differ from their defaults: [2025-02-05 21:13:27,021 INFO L153 SettingsManager]: * Ignore calls to procedures called more than once=ONLY_FOR_SEQUENTIAL_PROGRAMS [2025-02-05 21:13:27,021 INFO L151 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2025-02-05 21:13:27,021 INFO L153 SettingsManager]: * Create parallel compositions if possible=false [2025-02-05 21:13:27,021 INFO L153 SettingsManager]: * Use SBE=true [2025-02-05 21:13:27,022 INFO L151 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2025-02-05 21:13:27,022 INFO L153 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2025-02-05 21:13:27,022 INFO L153 SettingsManager]: * sizeof long=4 [2025-02-05 21:13:27,022 INFO L153 SettingsManager]: * Overapproximate operations on floating types=true [2025-02-05 21:13:27,022 INFO L153 SettingsManager]: * sizeof POINTER=4 [2025-02-05 21:13:27,022 INFO L153 SettingsManager]: * Check division by zero=IGNORE [2025-02-05 21:13:27,022 INFO L153 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2025-02-05 21:13:27,022 INFO L153 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2025-02-05 21:13:27,022 INFO L153 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2025-02-05 21:13:27,022 INFO L153 SettingsManager]: * sizeof long double=12 [2025-02-05 21:13:27,023 INFO L153 SettingsManager]: * Check if freed pointer was valid=false [2025-02-05 21:13:27,023 INFO L153 SettingsManager]: * Behaviour of calls to undefined functions=OVERAPPROXIMATE_BEHAVIOUR [2025-02-05 21:13:27,023 INFO L153 SettingsManager]: * Use constant arrays=true [2025-02-05 21:13:27,023 INFO L151 SettingsManager]: Preferences of IcfgBuilder differ from their defaults: [2025-02-05 21:13:27,023 INFO L153 SettingsManager]: * Size of a code block=SequenceOfStatements [2025-02-05 21:13:27,023 INFO L153 SettingsManager]: * Only consider context switches at boundaries of atomic blocks=true [2025-02-05 21:13:27,023 INFO L153 SettingsManager]: * SMT solver=External_DefaultMode [2025-02-05 21:13:27,023 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2025-02-05 21:13:27,024 INFO L151 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2025-02-05 21:13:27,024 INFO L153 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2025-02-05 21:13:27,024 INFO L153 SettingsManager]: * Compute procedure contracts=false [2025-02-05 21:13:27,024 INFO L153 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopHeads [2025-02-05 21:13:27,024 INFO L153 SettingsManager]: * Trace refinement strategy=CAMEL [2025-02-05 21:13:27,024 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2025-02-05 21:13:27,024 INFO L153 SettingsManager]: * Apply one-shot large block encoding in concurrent analysis=false [2025-02-05 21:13:27,024 INFO L153 SettingsManager]: * Automaton type used in concurrency analysis=PETRI_NET [2025-02-05 21:13:27,024 INFO L153 SettingsManager]: * Order on configurations for Petri net unfoldings=DBO [2025-02-05 21:13:27,024 INFO L153 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode [2025-02-05 21:13:27,025 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 -> 372612807ec8a09625942983a4318ea5cf13bd58b55643cc4c787d7ad1a0ebc5 [2025-02-05 21:13:27,265 INFO L75 nceAwareModelManager]: Repository-Root is: /tmp [2025-02-05 21:13:27,274 INFO L261 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2025-02-05 21:13:27,275 INFO L217 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2025-02-05 21:13:27,276 INFO L270 PluginConnector]: Initializing CDTParser... [2025-02-05 21:13:27,276 INFO L274 PluginConnector]: CDTParser initialized [2025-02-05 21:13:27,278 INFO L431 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/../sv-benchmarks/c/hardness-nfm22/hardness_fillercode_fillercodesize_ps-cn-100_file-56.i [2025-02-05 21:13:28,468 INFO L533 CDTParser]: Created temporary CDT project at /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/data/6b44a57f0/7b7734fba0244edea9339ea14f87bf49/FLAG1eaa700ed [2025-02-05 21:13:28,786 INFO L384 CDTParser]: Found 1 translation units. [2025-02-05 21:13:28,787 INFO L180 CDTParser]: Scanning /storage/repos/ultimate-jdk21/releaseScripts/default/sv-benchmarks/c/hardness-nfm22/hardness_fillercode_fillercodesize_ps-cn-100_file-56.i [2025-02-05 21:13:28,797 INFO L427 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/data/6b44a57f0/7b7734fba0244edea9339ea14f87bf49/FLAG1eaa700ed [2025-02-05 21:13:29,059 INFO L435 CDTParser]: Successfully deleted /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/data/6b44a57f0/7b7734fba0244edea9339ea14f87bf49 [2025-02-05 21:13:29,060 INFO L299 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2025-02-05 21:13:29,061 INFO L133 ToolchainWalker]: Walking toolchain with 6 elements. [2025-02-05 21:13:29,062 INFO L112 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2025-02-05 21:13:29,062 INFO L270 PluginConnector]: Initializing CACSL2BoogieTranslator... [2025-02-05 21:13:29,073 INFO L274 PluginConnector]: CACSL2BoogieTranslator initialized [2025-02-05 21:13:29,075 INFO L184 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 05.02 09:13:29" (1/1) ... [2025-02-05 21:13:29,075 INFO L204 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@6a934bf5 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 05.02 09:13:29, skipping insertion in model container [2025-02-05 21:13:29,075 INFO L184 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 05.02 09:13:29" (1/1) ... [2025-02-05 21:13:29,101 INFO L175 MainTranslator]: Built tables and reachable declarations [2025-02-05 21:13:29,205 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/hardness-nfm22/hardness_fillercode_fillercodesize_ps-cn-100_file-56.i[916,929] [2025-02-05 21:13:29,290 INFO L210 PostProcessor]: Analyzing one entry point: main [2025-02-05 21:13:29,307 INFO L200 MainTranslator]: Completed pre-run [2025-02-05 21:13:29,317 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/hardness-nfm22/hardness_fillercode_fillercodesize_ps-cn-100_file-56.i[916,929] [2025-02-05 21:13:29,369 INFO L210 PostProcessor]: Analyzing one entry point: main [2025-02-05 21:13:29,393 INFO L204 MainTranslator]: Completed translation [2025-02-05 21:13:29,394 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 05.02 09:13:29 WrapperNode [2025-02-05 21:13:29,394 INFO L131 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2025-02-05 21:13:29,399 INFO L112 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2025-02-05 21:13:29,399 INFO L270 PluginConnector]: Initializing Boogie Procedure Inliner... [2025-02-05 21:13:29,399 INFO L274 PluginConnector]: Boogie Procedure Inliner initialized [2025-02-05 21:13:29,404 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 05.02 09:13:29" (1/1) ... [2025-02-05 21:13:29,420 INFO L184 PluginConnector]: Executing the observer Inliner from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 05.02 09:13:29" (1/1) ... [2025-02-05 21:13:29,460 INFO L138 Inliner]: procedures = 26, calls = 70, calls flagged for inlining = 8, calls inlined = 8, statements flattened = 324 [2025-02-05 21:13:29,461 INFO L131 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2025-02-05 21:13:29,461 INFO L112 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2025-02-05 21:13:29,461 INFO L270 PluginConnector]: Initializing Boogie Preprocessor... [2025-02-05 21:13:29,462 INFO L274 PluginConnector]: Boogie Preprocessor initialized [2025-02-05 21:13:29,468 INFO L184 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 05.02 09:13:29" (1/1) ... [2025-02-05 21:13:29,468 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 05.02 09:13:29" (1/1) ... [2025-02-05 21:13:29,472 INFO L184 PluginConnector]: Executing the observer MemorySlicer from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 05.02 09:13:29" (1/1) ... [2025-02-05 21:13:29,503 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 21:13:29,503 INFO L184 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 05.02 09:13:29" (1/1) ... [2025-02-05 21:13:29,503 INFO L184 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 05.02 09:13:29" (1/1) ... [2025-02-05 21:13:29,515 INFO L184 PluginConnector]: Executing the observer ReplaceArrayAssignments from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 05.02 09:13:29" (1/1) ... [2025-02-05 21:13:29,516 INFO L184 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 05.02 09:13:29" (1/1) ... [2025-02-05 21:13:29,517 INFO L184 PluginConnector]: Executing the observer LTLStepAnnotator from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 05.02 09:13:29" (1/1) ... [2025-02-05 21:13:29,519 INFO L184 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 05.02 09:13:29" (1/1) ... [2025-02-05 21:13:29,522 INFO L131 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2025-02-05 21:13:29,522 INFO L112 PluginConnector]: ------------------------IcfgBuilder---------------------------- [2025-02-05 21:13:29,522 INFO L270 PluginConnector]: Initializing IcfgBuilder... [2025-02-05 21:13:29,522 INFO L274 PluginConnector]: IcfgBuilder initialized [2025-02-05 21:13:29,523 INFO L184 PluginConnector]: Executing the observer IcfgBuilderObserver from plugin IcfgBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 05.02 09:13:29" (1/1) ... [2025-02-05 21:13:29,526 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2025-02-05 21:13:29,535 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 [2025-02-05 21:13:29,544 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 21:13:29,546 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 21:13:29,561 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocInit [2025-02-05 21:13:29,561 INFO L130 BoogieDeclarations]: Found specification of procedure assume_abort_if_not [2025-02-05 21:13:29,561 INFO L138 BoogieDeclarations]: Found implementation of procedure assume_abort_if_not [2025-02-05 21:13:29,561 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int#0 [2025-02-05 21:13:29,561 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2025-02-05 21:13:29,561 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2025-02-05 21:13:29,625 INFO L257 CfgBuilder]: Building ICFG [2025-02-05 21:13:29,626 INFO L287 CfgBuilder]: Building CFG for each procedure with an implementation [2025-02-05 21:13:30,108 INFO L? ?]: Removed 14 outVars from TransFormulas that were not future-live. [2025-02-05 21:13:30,109 INFO L308 CfgBuilder]: Performing block encoding [2025-02-05 21:13:30,130 INFO L332 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2025-02-05 21:13:30,130 INFO L337 CfgBuilder]: Removed 0 assume(true) statements. [2025-02-05 21:13:30,131 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.icfgbuilder CFG 05.02 09:13:30 BoogieIcfgContainer [2025-02-05 21:13:30,131 INFO L131 PluginConnector]: ------------------------ END IcfgBuilder---------------------------- [2025-02-05 21:13:30,134 INFO L112 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2025-02-05 21:13:30,135 INFO L270 PluginConnector]: Initializing TraceAbstraction... [2025-02-05 21:13:30,138 INFO L274 PluginConnector]: TraceAbstraction initialized [2025-02-05 21:13:30,138 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 05.02 09:13:29" (1/3) ... [2025-02-05 21:13:30,139 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@54f6861 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 05.02 09:13:30, skipping insertion in model container [2025-02-05 21:13:30,139 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 05.02 09:13:29" (2/3) ... [2025-02-05 21:13:30,139 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@54f6861 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 05.02 09:13:30, skipping insertion in model container [2025-02-05 21:13:30,140 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.icfgbuilder CFG 05.02 09:13:30" (3/3) ... [2025-02-05 21:13:30,141 INFO L128 eAbstractionObserver]: Analyzing ICFG hardness_fillercode_fillercodesize_ps-cn-100_file-56.i [2025-02-05 21:13:30,151 INFO L216 ceAbstractionStarter]: Automizer settings: Hoare:LoopHeads NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2025-02-05 21:13:30,153 INFO L151 ceAbstractionStarter]: Applying trace abstraction to ICFG hardness_fillercode_fillercodesize_ps-cn-100_file-56.i that has 2 procedures, 140 locations, 1 initial locations, 1 loop locations, and 1 error locations. [2025-02-05 21:13:30,210 INFO L332 AbstractCegarLoop]: ======== Iteration 0 == of CEGAR loop == AllErrorsAtOnce ======== [2025-02-05 21:13:30,226 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;@25f04f2a, mLbeIndependenceSettings=[IndependenceType=SEMANTIC, AbstractionType=NONE, UseConditional=false, UseSemiCommutativity=true, Solver=Z3, SolverTimeout=1000ms] [2025-02-05 21:13:30,227 INFO L334 AbstractCegarLoop]: Starting to check reachability of 1 error locations. [2025-02-05 21:13:30,233 INFO L276 IsEmpty]: Start isEmpty. Operand has 140 states, 80 states have (on average 1.4125) internal successors, (113), 81 states have internal predecessors, (113), 57 states have call successors, (57), 1 states have call predecessors, (57), 1 states have return successors, (57), 57 states have call predecessors, (57), 57 states have call successors, (57) [2025-02-05 21:13:30,245 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 349 [2025-02-05 21:13:30,245 INFO L210 NwaCegarLoop]: Found error trace [2025-02-05 21:13:30,246 INFO L218 NwaCegarLoop]: trace histogram [57, 57, 57, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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 21:13:30,246 INFO L396 AbstractCegarLoop]: === Iteration 1 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-02-05 21:13:30,250 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-02-05 21:13:30,250 INFO L85 PathProgramCache]: Analyzing trace with hash 1761421225, now seen corresponding path program 1 times [2025-02-05 21:13:30,281 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-02-05 21:13:30,285 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1530779683] [2025-02-05 21:13:30,285 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-02-05 21:13:30,285 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-02-05 21:13:30,373 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 348 statements into 1 equivalence classes. [2025-02-05 21:13:30,401 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 348 of 348 statements. [2025-02-05 21:13:30,405 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-02-05 21:13:30,405 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-02-05 21:13:30,676 INFO L134 CoverageAnalysis]: Checked inductivity of 6384 backedges. 0 proven. 112 refuted. 0 times theorem prover too weak. 6272 trivial. 0 not checked. [2025-02-05 21:13:30,676 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-02-05 21:13:30,678 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1530779683] [2025-02-05 21:13:30,678 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1530779683] provided 0 perfect and 1 imperfect interpolant sequences [2025-02-05 21:13:30,679 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1182425879] [2025-02-05 21:13:30,679 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-02-05 21:13:30,679 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-02-05 21:13:30,679 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 [2025-02-05 21:13:30,683 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 21:13:30,686 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 21:13:30,788 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 348 statements into 1 equivalence classes. [2025-02-05 21:13:30,904 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 348 of 348 statements. [2025-02-05 21:13:30,904 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-02-05 21:13:30,904 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-02-05 21:13:30,908 INFO L256 TraceCheckSpWp]: Trace formula consists of 771 conjuncts, 1 conjuncts are in the unsatisfiable core [2025-02-05 21:13:30,918 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-02-05 21:13:30,944 INFO L134 CoverageAnalysis]: Checked inductivity of 6384 backedges. 112 proven. 0 refuted. 0 times theorem prover too weak. 6272 trivial. 0 not checked. [2025-02-05 21:13:30,944 INFO L308 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2025-02-05 21:13:30,945 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1182425879] provided 1 perfect and 0 imperfect interpolant sequences [2025-02-05 21:13:30,945 INFO L185 FreeRefinementEngine]: Found 1 perfect and 1 imperfect interpolant sequences. [2025-02-05 21:13:30,945 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [2] total 2 [2025-02-05 21:13:30,947 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1375235733] [2025-02-05 21:13:30,951 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-02-05 21:13:30,956 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 2 states [2025-02-05 21:13:30,957 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-02-05 21:13:30,973 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 2 interpolants. [2025-02-05 21:13:30,973 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=1, Invalid=1, Unknown=0, NotChecked=0, Total=2 [2025-02-05 21:13:30,976 INFO L87 Difference]: Start difference. First operand has 140 states, 80 states have (on average 1.4125) internal successors, (113), 81 states have internal predecessors, (113), 57 states have call successors, (57), 1 states have call predecessors, (57), 1 states have return successors, (57), 57 states have call predecessors, (57), 57 states have call successors, (57) Second operand has 2 states, 2 states have (on average 34.0) internal successors, (68), 2 states have internal predecessors, (68), 2 states have call successors, (57), 2 states have call predecessors, (57), 1 states have return successors, (57), 1 states have call predecessors, (57), 2 states have call successors, (57) [2025-02-05 21:13:31,017 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-02-05 21:13:31,020 INFO L93 Difference]: Finished difference Result 274 states and 506 transitions. [2025-02-05 21:13:31,021 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 2 states. [2025-02-05 21:13:31,022 INFO L78 Accepts]: Start accepts. Automaton has has 2 states, 2 states have (on average 34.0) internal successors, (68), 2 states have internal predecessors, (68), 2 states have call successors, (57), 2 states have call predecessors, (57), 1 states have return successors, (57), 1 states have call predecessors, (57), 2 states have call successors, (57) Word has length 348 [2025-02-05 21:13:31,022 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-02-05 21:13:31,031 INFO L225 Difference]: With dead ends: 274 [2025-02-05 21:13:31,033 INFO L226 Difference]: Without dead ends: 137 [2025-02-05 21:13:31,036 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 349 GetRequests, 349 SyntacticMatches, 0 SemanticMatches, 0 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=1, Invalid=1, Unknown=0, NotChecked=0, Total=2 [2025-02-05 21:13:31,039 INFO L435 NwaCegarLoop]: 220 mSDtfsCounter, 0 mSDsluCounter, 0 mSDsCounter, 0 mSdLazyCounter, 2 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 0 SdHoareTripleChecker+Valid, 220 SdHoareTripleChecker+Invalid, 2 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 2 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2025-02-05 21:13:31,041 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [0 Valid, 220 Invalid, 2 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 2 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2025-02-05 21:13:31,052 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 137 states. [2025-02-05 21:13:31,098 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 137 to 137. [2025-02-05 21:13:31,100 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 137 states, 78 states have (on average 1.3846153846153846) internal successors, (108), 78 states have internal predecessors, (108), 57 states have call successors, (57), 1 states have call predecessors, (57), 1 states have return successors, (57), 57 states have call predecessors, (57), 57 states have call successors, (57) [2025-02-05 21:13:31,103 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 137 states to 137 states and 222 transitions. [2025-02-05 21:13:31,106 INFO L78 Accepts]: Start accepts. Automaton has 137 states and 222 transitions. Word has length 348 [2025-02-05 21:13:31,107 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-02-05 21:13:31,108 INFO L471 AbstractCegarLoop]: Abstraction has 137 states and 222 transitions. [2025-02-05 21:13:31,108 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 2 states, 2 states have (on average 34.0) internal successors, (68), 2 states have internal predecessors, (68), 2 states have call successors, (57), 2 states have call predecessors, (57), 1 states have return successors, (57), 1 states have call predecessors, (57), 2 states have call successors, (57) [2025-02-05 21:13:31,108 INFO L276 IsEmpty]: Start isEmpty. Operand 137 states and 222 transitions. [2025-02-05 21:13:31,115 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 349 [2025-02-05 21:13:31,115 INFO L210 NwaCegarLoop]: Found error trace [2025-02-05 21:13:31,116 INFO L218 NwaCegarLoop]: trace histogram [57, 57, 57, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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 21:13:31,124 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 21:13:31,316 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 2 /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable0 [2025-02-05 21:13:31,317 INFO L396 AbstractCegarLoop]: === Iteration 2 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-02-05 21:13:31,318 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-02-05 21:13:31,318 INFO L85 PathProgramCache]: Analyzing trace with hash -1970180980, now seen corresponding path program 1 times [2025-02-05 21:13:31,318 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-02-05 21:13:31,319 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1607286087] [2025-02-05 21:13:31,319 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-02-05 21:13:31,319 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-02-05 21:13:31,345 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 348 statements into 1 equivalence classes. [2025-02-05 21:13:31,396 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 348 of 348 statements. [2025-02-05 21:13:31,396 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-02-05 21:13:31,396 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-02-05 21:13:31,602 INFO L134 CoverageAnalysis]: Checked inductivity of 6384 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 6384 trivial. 0 not checked. [2025-02-05 21:13:31,603 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-02-05 21:13:31,603 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1607286087] [2025-02-05 21:13:31,603 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1607286087] provided 1 perfect and 0 imperfect interpolant sequences [2025-02-05 21:13:31,603 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-02-05 21:13:31,603 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2025-02-05 21:13:31,603 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [801878387] [2025-02-05 21:13:31,603 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-02-05 21:13:31,604 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2025-02-05 21:13:31,604 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-02-05 21:13:31,607 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2025-02-05 21:13:31,607 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-02-05 21:13:31,608 INFO L87 Difference]: Start difference. First operand 137 states and 222 transitions. Second operand has 3 states, 3 states have (on average 22.0) internal successors, (66), 3 states have internal predecessors, (66), 1 states have call successors, (57), 1 states have call predecessors, (57), 1 states have return successors, (57), 1 states have call predecessors, (57), 1 states have call successors, (57) [2025-02-05 21:13:31,684 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-02-05 21:13:31,685 INFO L93 Difference]: Finished difference Result 365 states and 592 transitions. [2025-02-05 21:13:31,686 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2025-02-05 21:13:31,686 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 22.0) internal successors, (66), 3 states have internal predecessors, (66), 1 states have call successors, (57), 1 states have call predecessors, (57), 1 states have return successors, (57), 1 states have call predecessors, (57), 1 states have call successors, (57) Word has length 348 [2025-02-05 21:13:31,687 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-02-05 21:13:31,689 INFO L225 Difference]: With dead ends: 365 [2025-02-05 21:13:31,689 INFO L226 Difference]: Without dead ends: 231 [2025-02-05 21:13:31,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 21:13:31,691 INFO L435 NwaCegarLoop]: 351 mSDtfsCounter, 144 mSDsluCounter, 207 mSDsCounter, 0 mSdLazyCounter, 20 mSolverCounterSat, 3 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 144 SdHoareTripleChecker+Valid, 558 SdHoareTripleChecker+Invalid, 23 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 3 IncrementalHoareTripleChecker+Valid, 20 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2025-02-05 21:13:31,691 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [144 Valid, 558 Invalid, 23 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [3 Valid, 20 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2025-02-05 21:13:31,692 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 231 states. [2025-02-05 21:13:31,722 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 231 to 228. [2025-02-05 21:13:31,724 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 228 states, 130 states have (on average 1.376923076923077) internal successors, (179), 131 states have internal predecessors, (179), 95 states have call successors, (95), 2 states have call predecessors, (95), 2 states have return successors, (95), 94 states have call predecessors, (95), 95 states have call successors, (95) [2025-02-05 21:13:31,726 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 228 states to 228 states and 369 transitions. [2025-02-05 21:13:31,727 INFO L78 Accepts]: Start accepts. Automaton has 228 states and 369 transitions. Word has length 348 [2025-02-05 21:13:31,728 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-02-05 21:13:31,730 INFO L471 AbstractCegarLoop]: Abstraction has 228 states and 369 transitions. [2025-02-05 21:13:31,730 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 22.0) internal successors, (66), 3 states have internal predecessors, (66), 1 states have call successors, (57), 1 states have call predecessors, (57), 1 states have return successors, (57), 1 states have call predecessors, (57), 1 states have call successors, (57) [2025-02-05 21:13:31,730 INFO L276 IsEmpty]: Start isEmpty. Operand 228 states and 369 transitions. [2025-02-05 21:13:31,732 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 350 [2025-02-05 21:13:31,734 INFO L210 NwaCegarLoop]: Found error trace [2025-02-05 21:13:31,734 INFO L218 NwaCegarLoop]: trace histogram [57, 57, 57, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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 21:13:31,734 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable1 [2025-02-05 21:13:31,734 INFO L396 AbstractCegarLoop]: === Iteration 3 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-02-05 21:13:31,735 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-02-05 21:13:31,735 INFO L85 PathProgramCache]: Analyzing trace with hash 1230301051, now seen corresponding path program 1 times [2025-02-05 21:13:31,735 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-02-05 21:13:31,735 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [776513014] [2025-02-05 21:13:31,736 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-02-05 21:13:31,736 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-02-05 21:13:31,759 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 349 statements into 1 equivalence classes. [2025-02-05 21:13:31,993 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 349 of 349 statements. [2025-02-05 21:13:31,993 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-02-05 21:13:31,993 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-02-05 21:13:32,975 INFO L134 CoverageAnalysis]: Checked inductivity of 6384 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 6384 trivial. 0 not checked. [2025-02-05 21:13:32,975 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-02-05 21:13:32,976 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [776513014] [2025-02-05 21:13:32,976 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [776513014] provided 1 perfect and 0 imperfect interpolant sequences [2025-02-05 21:13:32,976 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-02-05 21:13:32,976 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2025-02-05 21:13:32,976 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [379179591] [2025-02-05 21:13:32,977 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-02-05 21:13:32,977 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2025-02-05 21:13:32,977 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-02-05 21:13:32,978 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2025-02-05 21:13:32,979 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=8, Invalid=12, Unknown=0, NotChecked=0, Total=20 [2025-02-05 21:13:32,979 INFO L87 Difference]: Start difference. First operand 228 states and 369 transitions. Second operand has 5 states, 5 states have (on average 13.4) internal successors, (67), 5 states have internal predecessors, (67), 1 states have call successors, (57), 1 states have call predecessors, (57), 1 states have return successors, (57), 1 states have call predecessors, (57), 1 states have call successors, (57) [2025-02-05 21:13:33,068 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-02-05 21:13:33,068 INFO L93 Difference]: Finished difference Result 533 states and 845 transitions. [2025-02-05 21:13:33,068 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2025-02-05 21:13:33,069 INFO L78 Accepts]: Start accepts. Automaton has has 5 states, 5 states have (on average 13.4) internal successors, (67), 5 states have internal predecessors, (67), 1 states have call successors, (57), 1 states have call predecessors, (57), 1 states have return successors, (57), 1 states have call predecessors, (57), 1 states have call successors, (57) Word has length 349 [2025-02-05 21:13:33,070 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-02-05 21:13:33,073 INFO L225 Difference]: With dead ends: 533 [2025-02-05 21:13:33,073 INFO L226 Difference]: Without dead ends: 308 [2025-02-05 21:13:33,079 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 7 GetRequests, 4 SyntacticMatches, 0 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=8, Invalid=12, Unknown=0, NotChecked=0, Total=20 [2025-02-05 21:13:33,079 INFO L435 NwaCegarLoop]: 228 mSDtfsCounter, 50 mSDsluCounter, 632 mSDsCounter, 0 mSdLazyCounter, 53 mSolverCounterSat, 3 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 50 SdHoareTripleChecker+Valid, 860 SdHoareTripleChecker+Invalid, 56 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 3 IncrementalHoareTripleChecker+Valid, 53 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2025-02-05 21:13:33,084 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [50 Valid, 860 Invalid, 56 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [3 Valid, 53 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2025-02-05 21:13:33,085 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 308 states. [2025-02-05 21:13:33,114 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 308 to 276. [2025-02-05 21:13:33,115 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 276 states, 168 states have (on average 1.3630952380952381) internal successors, (229), 171 states have internal predecessors, (229), 103 states have call successors, (103), 4 states have call predecessors, (103), 4 states have return successors, (103), 100 states have call predecessors, (103), 103 states have call successors, (103) [2025-02-05 21:13:33,117 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 276 states to 276 states and 435 transitions. [2025-02-05 21:13:33,117 INFO L78 Accepts]: Start accepts. Automaton has 276 states and 435 transitions. Word has length 349 [2025-02-05 21:13:33,118 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-02-05 21:13:33,118 INFO L471 AbstractCegarLoop]: Abstraction has 276 states and 435 transitions. [2025-02-05 21:13:33,118 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 13.4) internal successors, (67), 5 states have internal predecessors, (67), 1 states have call successors, (57), 1 states have call predecessors, (57), 1 states have return successors, (57), 1 states have call predecessors, (57), 1 states have call successors, (57) [2025-02-05 21:13:33,118 INFO L276 IsEmpty]: Start isEmpty. Operand 276 states and 435 transitions. [2025-02-05 21:13:33,120 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 350 [2025-02-05 21:13:33,120 INFO L210 NwaCegarLoop]: Found error trace [2025-02-05 21:13:33,120 INFO L218 NwaCegarLoop]: trace histogram [57, 57, 57, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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 21:13:33,120 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable2 [2025-02-05 21:13:33,121 INFO L396 AbstractCegarLoop]: === Iteration 4 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-02-05 21:13:33,121 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-02-05 21:13:33,121 INFO L85 PathProgramCache]: Analyzing trace with hash -1321855910, now seen corresponding path program 1 times [2025-02-05 21:13:33,121 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-02-05 21:13:33,121 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1642398651] [2025-02-05 21:13:33,121 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-02-05 21:13:33,121 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-02-05 21:13:33,136 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 349 statements into 1 equivalence classes. [2025-02-05 21:13:33,223 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 349 of 349 statements. [2025-02-05 21:13:33,223 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-02-05 21:13:33,223 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-02-05 21:13:37,608 INFO L134 CoverageAnalysis]: Checked inductivity of 6384 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 6384 trivial. 0 not checked. [2025-02-05 21:13:37,608 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-02-05 21:13:37,609 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1642398651] [2025-02-05 21:13:37,609 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1642398651] provided 1 perfect and 0 imperfect interpolant sequences [2025-02-05 21:13:37,610 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-02-05 21:13:37,610 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [11] imperfect sequences [] total 11 [2025-02-05 21:13:37,610 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [20616528] [2025-02-05 21:13:37,610 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-02-05 21:13:37,611 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 11 states [2025-02-05 21:13:37,611 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-02-05 21:13:37,612 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 11 interpolants. [2025-02-05 21:13:37,612 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=27, Invalid=83, Unknown=0, NotChecked=0, Total=110 [2025-02-05 21:13:37,612 INFO L87 Difference]: Start difference. First operand 276 states and 435 transitions. Second operand has 11 states, 11 states have (on average 6.090909090909091) internal successors, (67), 11 states have internal predecessors, (67), 5 states have call successors, (57), 1 states have call predecessors, (57), 1 states have return successors, (57), 5 states have call predecessors, (57), 5 states have call successors, (57) [2025-02-05 21:13:43,540 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-02-05 21:13:43,541 INFO L93 Difference]: Finished difference Result 1862 states and 2860 transitions. [2025-02-05 21:13:43,542 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 18 states. [2025-02-05 21:13:43,543 INFO L78 Accepts]: Start accepts. Automaton has has 11 states, 11 states have (on average 6.090909090909091) internal successors, (67), 11 states have internal predecessors, (67), 5 states have call successors, (57), 1 states have call predecessors, (57), 1 states have return successors, (57), 5 states have call predecessors, (57), 5 states have call successors, (57) Word has length 349 [2025-02-05 21:13:43,543 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-02-05 21:13:43,556 INFO L225 Difference]: With dead ends: 1862 [2025-02-05 21:13:43,556 INFO L226 Difference]: Without dead ends: 1589 [2025-02-05 21:13:43,557 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 33 GetRequests, 12 SyntacticMatches, 0 SemanticMatches, 21 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 72 ImplicationChecksByTransitivity, 1.8s TimeCoverageRelationStatistics Valid=151, Invalid=355, Unknown=0, NotChecked=0, Total=506 [2025-02-05 21:13:43,558 INFO L435 NwaCegarLoop]: 347 mSDtfsCounter, 1283 mSDsluCounter, 772 mSDsCounter, 0 mSdLazyCounter, 1425 mSolverCounterSat, 712 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 3.8s Time, 0 mProtectedPredicate, 0 mProtectedAction, 1283 SdHoareTripleChecker+Valid, 1119 SdHoareTripleChecker+Invalid, 2137 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 712 IncrementalHoareTripleChecker+Valid, 1425 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 4.2s IncrementalHoareTripleChecker+Time [2025-02-05 21:13:43,559 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [1283 Valid, 1119 Invalid, 2137 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [712 Valid, 1425 Invalid, 0 Unknown, 0 Unchecked, 4.2s Time] [2025-02-05 21:13:43,563 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1589 states. [2025-02-05 21:13:43,733 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1589 to 1200. [2025-02-05 21:13:43,735 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 1200 states, 777 states have (on average 1.3655083655083655) internal successors, (1061), 796 states have internal predecessors, (1061), 388 states have call successors, (388), 34 states have call predecessors, (388), 34 states have return successors, (388), 369 states have call predecessors, (388), 388 states have call successors, (388) [2025-02-05 21:13:43,740 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1200 states to 1200 states and 1837 transitions. [2025-02-05 21:13:43,741 INFO L78 Accepts]: Start accepts. Automaton has 1200 states and 1837 transitions. Word has length 349 [2025-02-05 21:13:43,742 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-02-05 21:13:43,742 INFO L471 AbstractCegarLoop]: Abstraction has 1200 states and 1837 transitions. [2025-02-05 21:13:43,742 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 11 states, 11 states have (on average 6.090909090909091) internal successors, (67), 11 states have internal predecessors, (67), 5 states have call successors, (57), 1 states have call predecessors, (57), 1 states have return successors, (57), 5 states have call predecessors, (57), 5 states have call successors, (57) [2025-02-05 21:13:43,742 INFO L276 IsEmpty]: Start isEmpty. Operand 1200 states and 1837 transitions. [2025-02-05 21:13:43,744 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 350 [2025-02-05 21:13:43,744 INFO L210 NwaCegarLoop]: Found error trace [2025-02-05 21:13:43,744 INFO L218 NwaCegarLoop]: trace histogram [57, 57, 57, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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 21:13:43,744 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable3 [2025-02-05 21:13:43,745 INFO L396 AbstractCegarLoop]: === Iteration 5 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-02-05 21:13:43,745 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-02-05 21:13:43,745 INFO L85 PathProgramCache]: Analyzing trace with hash -1110504997, now seen corresponding path program 1 times [2025-02-05 21:13:43,745 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-02-05 21:13:43,745 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [706586914] [2025-02-05 21:13:43,745 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-02-05 21:13:43,746 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-02-05 21:13:43,756 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 349 statements into 1 equivalence classes. [2025-02-05 21:13:43,880 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 349 of 349 statements. [2025-02-05 21:13:43,881 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-02-05 21:13:43,881 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-02-05 21:13:50,444 INFO L134 CoverageAnalysis]: Checked inductivity of 6384 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 6384 trivial. 0 not checked. [2025-02-05 21:13:50,445 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-02-05 21:13:50,445 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [706586914] [2025-02-05 21:13:50,445 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [706586914] provided 1 perfect and 0 imperfect interpolant sequences [2025-02-05 21:13:50,445 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-02-05 21:13:50,445 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [14] imperfect sequences [] total 14 [2025-02-05 21:13:50,445 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [106380395] [2025-02-05 21:13:50,446 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-02-05 21:13:50,446 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 14 states [2025-02-05 21:13:50,446 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-02-05 21:13:50,447 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 14 interpolants. [2025-02-05 21:13:50,447 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=54, Invalid=128, Unknown=0, NotChecked=0, Total=182 [2025-02-05 21:13:50,448 INFO L87 Difference]: Start difference. First operand 1200 states and 1837 transitions. Second operand has 14 states, 14 states have (on average 4.785714285714286) internal successors, (67), 14 states have internal predecessors, (67), 1 states have call successors, (57), 1 states have call predecessors, (57), 1 states have return successors, (57), 1 states have call predecessors, (57), 1 states have call successors, (57) [2025-02-05 21:13:51,784 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-02-05 21:13:51,785 INFO L93 Difference]: Finished difference Result 2679 states and 4048 transitions. [2025-02-05 21:13:51,786 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 15 states. [2025-02-05 21:13:51,786 INFO L78 Accepts]: Start accepts. Automaton has has 14 states, 14 states have (on average 4.785714285714286) internal successors, (67), 14 states have internal predecessors, (67), 1 states have call successors, (57), 1 states have call predecessors, (57), 1 states have return successors, (57), 1 states have call predecessors, (57), 1 states have call successors, (57) Word has length 349 [2025-02-05 21:13:51,787 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-02-05 21:13:51,794 INFO L225 Difference]: With dead ends: 2679 [2025-02-05 21:13:51,794 INFO L226 Difference]: Without dead ends: 1516 [2025-02-05 21:13:51,797 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 19 GetRequests, 4 SyntacticMatches, 0 SemanticMatches, 15 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 22 ImplicationChecksByTransitivity, 1.5s TimeCoverageRelationStatistics Valid=81, Invalid=191, Unknown=0, NotChecked=0, Total=272 [2025-02-05 21:13:51,798 INFO L435 NwaCegarLoop]: 208 mSDtfsCounter, 90 mSDsluCounter, 1573 mSDsCounter, 0 mSdLazyCounter, 357 mSolverCounterSat, 10 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.5s Time, 0 mProtectedPredicate, 0 mProtectedAction, 90 SdHoareTripleChecker+Valid, 1781 SdHoareTripleChecker+Invalid, 367 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 10 IncrementalHoareTripleChecker+Valid, 357 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.6s IncrementalHoareTripleChecker+Time [2025-02-05 21:13:51,798 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [90 Valid, 1781 Invalid, 367 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [10 Valid, 357 Invalid, 0 Unknown, 0 Unchecked, 0.6s Time] [2025-02-05 21:13:51,799 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1516 states. [2025-02-05 21:13:51,959 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1516 to 1300. [2025-02-05 21:13:51,961 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 1300 states, 877 states have (on average 1.3580387685290765) internal successors, (1191), 896 states have internal predecessors, (1191), 388 states have call successors, (388), 34 states have call predecessors, (388), 34 states have return successors, (388), 369 states have call predecessors, (388), 388 states have call successors, (388) [2025-02-05 21:13:51,965 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1300 states to 1300 states and 1967 transitions. [2025-02-05 21:13:51,967 INFO L78 Accepts]: Start accepts. Automaton has 1300 states and 1967 transitions. Word has length 349 [2025-02-05 21:13:51,968 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-02-05 21:13:51,968 INFO L471 AbstractCegarLoop]: Abstraction has 1300 states and 1967 transitions. [2025-02-05 21:13:51,968 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 14 states, 14 states have (on average 4.785714285714286) internal successors, (67), 14 states have internal predecessors, (67), 1 states have call successors, (57), 1 states have call predecessors, (57), 1 states have return successors, (57), 1 states have call predecessors, (57), 1 states have call successors, (57) [2025-02-05 21:13:51,968 INFO L276 IsEmpty]: Start isEmpty. Operand 1300 states and 1967 transitions. [2025-02-05 21:13:51,970 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 350 [2025-02-05 21:13:51,970 INFO L210 NwaCegarLoop]: Found error trace [2025-02-05 21:13:51,970 INFO L218 NwaCegarLoop]: trace histogram [57, 57, 57, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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 21:13:51,970 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable4 [2025-02-05 21:13:51,970 INFO L396 AbstractCegarLoop]: === Iteration 6 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-02-05 21:13:51,971 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-02-05 21:13:51,971 INFO L85 PathProgramCache]: Analyzing trace with hash 1377007836, now seen corresponding path program 1 times [2025-02-05 21:13:51,971 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-02-05 21:13:51,971 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1055911224] [2025-02-05 21:13:51,971 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-02-05 21:13:51,971 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-02-05 21:13:51,992 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 349 statements into 1 equivalence classes. [2025-02-05 21:13:52,071 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 349 of 349 statements. [2025-02-05 21:13:52,071 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-02-05 21:13:52,071 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-02-05 21:13:58,586 INFO L134 CoverageAnalysis]: Checked inductivity of 6384 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 6384 trivial. 0 not checked. [2025-02-05 21:13:58,586 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-02-05 21:13:58,586 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1055911224] [2025-02-05 21:13:58,586 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1055911224] provided 1 perfect and 0 imperfect interpolant sequences [2025-02-05 21:13:58,586 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-02-05 21:13:58,586 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [14] imperfect sequences [] total 14 [2025-02-05 21:13:58,586 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1185786625] [2025-02-05 21:13:58,587 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-02-05 21:13:58,587 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 14 states [2025-02-05 21:13:58,587 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-02-05 21:13:58,587 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 14 interpolants. [2025-02-05 21:13:58,588 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=54, Invalid=128, Unknown=0, NotChecked=0, Total=182 [2025-02-05 21:13:58,588 INFO L87 Difference]: Start difference. First operand 1300 states and 1967 transitions. Second operand has 14 states, 14 states have (on average 4.785714285714286) internal successors, (67), 14 states have internal predecessors, (67), 1 states have call successors, (57), 1 states have call predecessors, (57), 1 states have return successors, (57), 1 states have call predecessors, (57), 1 states have call successors, (57) [2025-02-05 21:13:59,985 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-02-05 21:13:59,986 INFO L93 Difference]: Finished difference Result 2809 states and 4198 transitions. [2025-02-05 21:13:59,986 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 15 states. [2025-02-05 21:13:59,987 INFO L78 Accepts]: Start accepts. Automaton has has 14 states, 14 states have (on average 4.785714285714286) internal successors, (67), 14 states have internal predecessors, (67), 1 states have call successors, (57), 1 states have call predecessors, (57), 1 states have return successors, (57), 1 states have call predecessors, (57), 1 states have call successors, (57) Word has length 349 [2025-02-05 21:13:59,987 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-02-05 21:14:00,000 INFO L225 Difference]: With dead ends: 2809 [2025-02-05 21:14:00,000 INFO L226 Difference]: Without dead ends: 1546 [2025-02-05 21:14:00,008 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 19 GetRequests, 4 SyntacticMatches, 0 SemanticMatches, 15 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 22 ImplicationChecksByTransitivity, 1.7s TimeCoverageRelationStatistics Valid=81, Invalid=191, Unknown=0, NotChecked=0, Total=272 [2025-02-05 21:14:00,009 INFO L435 NwaCegarLoop]: 209 mSDtfsCounter, 65 mSDsluCounter, 1405 mSDsCounter, 0 mSdLazyCounter, 412 mSolverCounterSat, 12 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.5s Time, 0 mProtectedPredicate, 0 mProtectedAction, 65 SdHoareTripleChecker+Valid, 1614 SdHoareTripleChecker+Invalid, 424 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 12 IncrementalHoareTripleChecker+Valid, 412 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.6s IncrementalHoareTripleChecker+Time [2025-02-05 21:14:00,009 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [65 Valid, 1614 Invalid, 424 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [12 Valid, 412 Invalid, 0 Unknown, 0 Unchecked, 0.6s Time] [2025-02-05 21:14:00,014 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1546 states. [2025-02-05 21:14:00,212 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1546 to 1290. [2025-02-05 21:14:00,214 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 1290 states, 867 states have (on average 1.362168396770473) internal successors, (1181), 886 states have internal predecessors, (1181), 388 states have call successors, (388), 34 states have call predecessors, (388), 34 states have return successors, (388), 369 states have call predecessors, (388), 388 states have call successors, (388) [2025-02-05 21:14:00,219 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1290 states to 1290 states and 1957 transitions. [2025-02-05 21:14:00,221 INFO L78 Accepts]: Start accepts. Automaton has 1290 states and 1957 transitions. Word has length 349 [2025-02-05 21:14:00,221 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-02-05 21:14:00,222 INFO L471 AbstractCegarLoop]: Abstraction has 1290 states and 1957 transitions. [2025-02-05 21:14:00,222 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 14 states, 14 states have (on average 4.785714285714286) internal successors, (67), 14 states have internal predecessors, (67), 1 states have call successors, (57), 1 states have call predecessors, (57), 1 states have return successors, (57), 1 states have call predecessors, (57), 1 states have call successors, (57) [2025-02-05 21:14:00,222 INFO L276 IsEmpty]: Start isEmpty. Operand 1290 states and 1957 transitions. [2025-02-05 21:14:00,224 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 350 [2025-02-05 21:14:00,224 INFO L210 NwaCegarLoop]: Found error trace [2025-02-05 21:14:00,224 INFO L218 NwaCegarLoop]: trace histogram [57, 57, 57, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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 21:14:00,224 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable5 [2025-02-05 21:14:00,225 INFO L396 AbstractCegarLoop]: === Iteration 7 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-02-05 21:14:00,225 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-02-05 21:14:00,225 INFO L85 PathProgramCache]: Analyzing trace with hash -355299395, now seen corresponding path program 1 times [2025-02-05 21:14:00,225 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-02-05 21:14:00,225 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1933159368] [2025-02-05 21:14:00,225 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-02-05 21:14:00,225 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-02-05 21:14:00,235 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 349 statements into 1 equivalence classes. [2025-02-05 21:14:00,316 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 349 of 349 statements. [2025-02-05 21:14:00,316 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-02-05 21:14:00,316 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat