./Ultimate.py --spec ../sv-benchmarks/c/properties/unreach-call.prp --file ../sv-benchmarks/c/hardness-nfm22/hardness_fillercode_fillercodestructure_filler-pr-co_file-66.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_fillercodestructure_filler-pr-co_file-66.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 fc772c7bbac1de5fe64d64c143c1154d0fb749c01b6a27196c7210715a9fc32d --- Real Ultimate output --- This is Ultimate 0.3.0-?-c00e63d-m [2025-02-05 23:25:23,069 INFO L188 SettingsManager]: Resetting all preferences to default values... [2025-02-05 23:25:23,125 INFO L114 SettingsManager]: Loading settings from /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/config/svcomp-Reach-32bit-Automizer_Default.epf [2025-02-05 23:25:23,129 WARN L101 SettingsManager]: Preference file contains the following unknown settings: [2025-02-05 23:25:23,132 WARN L103 SettingsManager]: * de.uni_freiburg.informatik.ultimate.core.Log level for class [2025-02-05 23:25:23,155 INFO L130 SettingsManager]: Preferences different from defaults after loading the file: [2025-02-05 23:25:23,157 INFO L151 SettingsManager]: Preferences of UltimateCore differ from their defaults: [2025-02-05 23:25:23,157 INFO L153 SettingsManager]: * Log level for class=de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher=ERROR; [2025-02-05 23:25:23,158 INFO L151 SettingsManager]: Preferences of Boogie Preprocessor differ from their defaults: [2025-02-05 23:25:23,158 INFO L153 SettingsManager]: * Use memory slicer=true [2025-02-05 23:25:23,158 INFO L151 SettingsManager]: Preferences of Boogie Procedure Inliner differ from their defaults: [2025-02-05 23:25:23,158 INFO L153 SettingsManager]: * Ignore calls to procedures called more than once=ONLY_FOR_SEQUENTIAL_PROGRAMS [2025-02-05 23:25:23,159 INFO L151 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2025-02-05 23:25:23,159 INFO L153 SettingsManager]: * Create parallel compositions if possible=false [2025-02-05 23:25:23,159 INFO L153 SettingsManager]: * Use SBE=true [2025-02-05 23:25:23,159 INFO L151 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2025-02-05 23:25:23,160 INFO L153 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2025-02-05 23:25:23,160 INFO L153 SettingsManager]: * sizeof long=4 [2025-02-05 23:25:23,160 INFO L153 SettingsManager]: * Overapproximate operations on floating types=true [2025-02-05 23:25:23,160 INFO L153 SettingsManager]: * sizeof POINTER=4 [2025-02-05 23:25:23,160 INFO L153 SettingsManager]: * Check division by zero=IGNORE [2025-02-05 23:25:23,160 INFO L153 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2025-02-05 23:25:23,160 INFO L153 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2025-02-05 23:25:23,160 INFO L153 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2025-02-05 23:25:23,160 INFO L153 SettingsManager]: * sizeof long double=12 [2025-02-05 23:25:23,160 INFO L153 SettingsManager]: * Check if freed pointer was valid=false [2025-02-05 23:25:23,161 INFO L153 SettingsManager]: * Behaviour of calls to undefined functions=OVERAPPROXIMATE_BEHAVIOUR [2025-02-05 23:25:23,161 INFO L153 SettingsManager]: * Use constant arrays=true [2025-02-05 23:25:23,161 INFO L151 SettingsManager]: Preferences of IcfgBuilder differ from their defaults: [2025-02-05 23:25:23,161 INFO L153 SettingsManager]: * Size of a code block=SequenceOfStatements [2025-02-05 23:25:23,161 INFO L153 SettingsManager]: * Only consider context switches at boundaries of atomic blocks=true [2025-02-05 23:25:23,161 INFO L153 SettingsManager]: * SMT solver=External_DefaultMode [2025-02-05 23:25:23,161 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2025-02-05 23:25:23,162 INFO L151 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2025-02-05 23:25:23,162 INFO L153 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2025-02-05 23:25:23,162 INFO L153 SettingsManager]: * Compute procedure contracts=false [2025-02-05 23:25:23,162 INFO L153 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopHeads [2025-02-05 23:25:23,162 INFO L153 SettingsManager]: * Trace refinement strategy=CAMEL [2025-02-05 23:25:23,162 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2025-02-05 23:25:23,162 INFO L153 SettingsManager]: * Apply one-shot large block encoding in concurrent analysis=false [2025-02-05 23:25:23,162 INFO L153 SettingsManager]: * Automaton type used in concurrency analysis=PETRI_NET [2025-02-05 23:25:23,162 INFO L153 SettingsManager]: * Order on configurations for Petri net unfoldings=DBO [2025-02-05 23:25:23,162 INFO L153 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode [2025-02-05 23:25:23,163 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 -> fc772c7bbac1de5fe64d64c143c1154d0fb749c01b6a27196c7210715a9fc32d [2025-02-05 23:25:23,408 INFO L75 nceAwareModelManager]: Repository-Root is: /tmp [2025-02-05 23:25:23,415 INFO L261 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2025-02-05 23:25:23,418 INFO L217 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2025-02-05 23:25:23,419 INFO L270 PluginConnector]: Initializing CDTParser... [2025-02-05 23:25:23,419 INFO L274 PluginConnector]: CDTParser initialized [2025-02-05 23:25:23,421 INFO L431 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/../sv-benchmarks/c/hardness-nfm22/hardness_fillercode_fillercodestructure_filler-pr-co_file-66.i [2025-02-05 23:25:24,579 INFO L533 CDTParser]: Created temporary CDT project at /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/data/0072bcc70/a567644468724208b1e3bfacfb817bc8/FLAG703f56831 [2025-02-05 23:25:24,819 INFO L384 CDTParser]: Found 1 translation units. [2025-02-05 23:25:24,819 INFO L180 CDTParser]: Scanning /storage/repos/ultimate-jdk21/releaseScripts/default/sv-benchmarks/c/hardness-nfm22/hardness_fillercode_fillercodestructure_filler-pr-co_file-66.i [2025-02-05 23:25:24,827 INFO L427 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/data/0072bcc70/a567644468724208b1e3bfacfb817bc8/FLAG703f56831 [2025-02-05 23:25:25,142 INFO L435 CDTParser]: Successfully deleted /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/data/0072bcc70/a567644468724208b1e3bfacfb817bc8 [2025-02-05 23:25:25,145 INFO L299 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2025-02-05 23:25:25,146 INFO L133 ToolchainWalker]: Walking toolchain with 6 elements. [2025-02-05 23:25:25,149 INFO L112 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2025-02-05 23:25:25,149 INFO L270 PluginConnector]: Initializing CACSL2BoogieTranslator... [2025-02-05 23:25:25,152 INFO L274 PluginConnector]: CACSL2BoogieTranslator initialized [2025-02-05 23:25:25,153 INFO L184 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 05.02 11:25:25" (1/1) ... [2025-02-05 23:25:25,153 INFO L204 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@25821b07 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 05.02 11:25:25, skipping insertion in model container [2025-02-05 23:25:25,153 INFO L184 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 05.02 11:25:25" (1/1) ... [2025-02-05 23:25:25,174 INFO L175 MainTranslator]: Built tables and reachable declarations [2025-02-05 23:25:25,273 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_fillercodestructure_filler-pr-co_file-66.i[919,932] [2025-02-05 23:25:25,344 INFO L210 PostProcessor]: Analyzing one entry point: main [2025-02-05 23:25:25,359 INFO L200 MainTranslator]: Completed pre-run [2025-02-05 23:25:25,368 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_fillercodestructure_filler-pr-co_file-66.i[919,932] [2025-02-05 23:25:25,402 INFO L210 PostProcessor]: Analyzing one entry point: main [2025-02-05 23:25:25,417 INFO L204 MainTranslator]: Completed translation [2025-02-05 23:25:25,417 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 05.02 11:25:25 WrapperNode [2025-02-05 23:25:25,418 INFO L131 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2025-02-05 23:25:25,418 INFO L112 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2025-02-05 23:25:25,418 INFO L270 PluginConnector]: Initializing Boogie Procedure Inliner... [2025-02-05 23:25:25,418 INFO L274 PluginConnector]: Boogie Procedure Inliner initialized [2025-02-05 23:25:25,423 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:25:25" (1/1) ... [2025-02-05 23:25:25,430 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:25:25" (1/1) ... [2025-02-05 23:25:25,457 INFO L138 Inliner]: procedures = 26, calls = 37, calls flagged for inlining = 8, calls inlined = 8, statements flattened = 183 [2025-02-05 23:25:25,457 INFO L131 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2025-02-05 23:25:25,458 INFO L112 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2025-02-05 23:25:25,458 INFO L270 PluginConnector]: Initializing Boogie Preprocessor... [2025-02-05 23:25:25,458 INFO L274 PluginConnector]: Boogie Preprocessor initialized [2025-02-05 23:25:25,468 INFO L184 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 05.02 11:25:25" (1/1) ... [2025-02-05 23:25:25,468 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 05.02 11:25:25" (1/1) ... [2025-02-05 23:25:25,470 INFO L184 PluginConnector]: Executing the observer MemorySlicer from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 05.02 11:25:25" (1/1) ... [2025-02-05 23:25:25,494 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 23:25:25,495 INFO L184 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 05.02 11:25:25" (1/1) ... [2025-02-05 23:25:25,495 INFO L184 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 05.02 11:25:25" (1/1) ... [2025-02-05 23:25:25,507 INFO L184 PluginConnector]: Executing the observer ReplaceArrayAssignments from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 05.02 11:25:25" (1/1) ... [2025-02-05 23:25:25,508 INFO L184 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 05.02 11:25:25" (1/1) ... [2025-02-05 23:25:25,509 INFO L184 PluginConnector]: Executing the observer LTLStepAnnotator from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 05.02 11:25:25" (1/1) ... [2025-02-05 23:25:25,510 INFO L184 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 05.02 11:25:25" (1/1) ... [2025-02-05 23:25:25,512 INFO L131 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2025-02-05 23:25:25,513 INFO L112 PluginConnector]: ------------------------IcfgBuilder---------------------------- [2025-02-05 23:25:25,513 INFO L270 PluginConnector]: Initializing IcfgBuilder... [2025-02-05 23:25:25,513 INFO L274 PluginConnector]: IcfgBuilder initialized [2025-02-05 23:25:25,514 INFO L184 PluginConnector]: Executing the observer IcfgBuilderObserver from plugin IcfgBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 05.02 11:25:25" (1/1) ... [2025-02-05 23:25:25,517 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2025-02-05 23:25:25,526 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 [2025-02-05 23:25:25,539 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 23:25:25,549 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 23:25:25,565 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocInit [2025-02-05 23:25:25,565 INFO L130 BoogieDeclarations]: Found specification of procedure assume_abort_if_not [2025-02-05 23:25:25,565 INFO L138 BoogieDeclarations]: Found implementation of procedure assume_abort_if_not [2025-02-05 23:25:25,565 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int#0 [2025-02-05 23:25:25,566 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2025-02-05 23:25:25,566 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2025-02-05 23:25:25,628 INFO L257 CfgBuilder]: Building ICFG [2025-02-05 23:25:25,630 INFO L287 CfgBuilder]: Building CFG for each procedure with an implementation [2025-02-05 23:25:25,941 INFO L? ?]: Removed 18 outVars from TransFormulas that were not future-live. [2025-02-05 23:25:25,944 INFO L308 CfgBuilder]: Performing block encoding [2025-02-05 23:25:25,951 INFO L332 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2025-02-05 23:25:25,952 INFO L337 CfgBuilder]: Removed 0 assume(true) statements. [2025-02-05 23:25:25,952 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.icfgbuilder CFG 05.02 11:25:25 BoogieIcfgContainer [2025-02-05 23:25:25,952 INFO L131 PluginConnector]: ------------------------ END IcfgBuilder---------------------------- [2025-02-05 23:25:25,954 INFO L112 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2025-02-05 23:25:25,954 INFO L270 PluginConnector]: Initializing TraceAbstraction... [2025-02-05 23:25:25,958 INFO L274 PluginConnector]: TraceAbstraction initialized [2025-02-05 23:25:25,958 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 05.02 11:25:25" (1/3) ... [2025-02-05 23:25:25,958 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@7606ad78 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 05.02 11:25:25, skipping insertion in model container [2025-02-05 23:25:25,958 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 05.02 11:25:25" (2/3) ... [2025-02-05 23:25:25,959 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@7606ad78 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 05.02 11:25:25, skipping insertion in model container [2025-02-05 23:25:25,959 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.icfgbuilder CFG 05.02 11:25:25" (3/3) ... [2025-02-05 23:25:25,960 INFO L128 eAbstractionObserver]: Analyzing ICFG hardness_fillercode_fillercodestructure_filler-pr-co_file-66.i [2025-02-05 23:25:25,971 INFO L216 ceAbstractionStarter]: Automizer settings: Hoare:LoopHeads NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2025-02-05 23:25:25,976 INFO L151 ceAbstractionStarter]: Applying trace abstraction to ICFG hardness_fillercode_fillercodestructure_filler-pr-co_file-66.i that has 2 procedures, 83 locations, 1 initial locations, 1 loop locations, and 1 error locations. [2025-02-05 23:25:26,028 INFO L332 AbstractCegarLoop]: ======== Iteration 0 == of CEGAR loop == AllErrorsAtOnce ======== [2025-02-05 23:25:26,039 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;@1392aa1d, mLbeIndependenceSettings=[IndependenceType=SEMANTIC, AbstractionType=NONE, UseConditional=false, UseSemiCommutativity=true, Solver=Z3, SolverTimeout=1000ms] [2025-02-05 23:25:26,040 INFO L334 AbstractCegarLoop]: Starting to check reachability of 1 error locations. [2025-02-05 23:25:26,044 INFO L276 IsEmpty]: Start isEmpty. Operand has 83 states, 56 states have (on average 1.4821428571428572) internal successors, (83), 57 states have internal predecessors, (83), 24 states have call successors, (24), 1 states have call predecessors, (24), 1 states have return successors, (24), 24 states have call predecessors, (24), 24 states have call successors, (24) [2025-02-05 23:25:26,054 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 161 [2025-02-05 23:25:26,055 INFO L210 NwaCegarLoop]: Found error trace [2025-02-05 23:25:26,055 INFO L218 NwaCegarLoop]: trace histogram [24, 24, 24, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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 23:25:26,056 INFO L396 AbstractCegarLoop]: === Iteration 1 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-02-05 23:25:26,061 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-02-05 23:25:26,061 INFO L85 PathProgramCache]: Analyzing trace with hash -531796878, now seen corresponding path program 1 times [2025-02-05 23:25:26,066 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-02-05 23:25:26,067 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [952523289] [2025-02-05 23:25:26,069 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-02-05 23:25:26,069 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-02-05 23:25:26,138 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 160 statements into 1 equivalence classes. [2025-02-05 23:25:26,165 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 160 of 160 statements. [2025-02-05 23:25:26,165 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-02-05 23:25:26,165 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-02-05 23:25:26,301 INFO L134 CoverageAnalysis]: Checked inductivity of 1104 backedges. 0 proven. 46 refuted. 0 times theorem prover too weak. 1058 trivial. 0 not checked. [2025-02-05 23:25:26,303 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-02-05 23:25:26,305 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [952523289] [2025-02-05 23:25:26,306 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [952523289] provided 0 perfect and 1 imperfect interpolant sequences [2025-02-05 23:25:26,306 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [2103115321] [2025-02-05 23:25:26,306 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-02-05 23:25:26,306 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-02-05 23:25:26,306 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 [2025-02-05 23:25:26,309 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 23:25:26,313 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 23:25:26,370 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 160 statements into 1 equivalence classes. [2025-02-05 23:25:26,420 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 160 of 160 statements. [2025-02-05 23:25:26,420 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-02-05 23:25:26,420 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-02-05 23:25:26,422 INFO L256 TraceCheckSpWp]: Trace formula consists of 382 conjuncts, 1 conjuncts are in the unsatisfiable core [2025-02-05 23:25:26,427 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-02-05 23:25:26,444 INFO L134 CoverageAnalysis]: Checked inductivity of 1104 backedges. 46 proven. 0 refuted. 0 times theorem prover too weak. 1058 trivial. 0 not checked. [2025-02-05 23:25:26,445 INFO L308 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2025-02-05 23:25:26,445 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [2103115321] provided 1 perfect and 0 imperfect interpolant sequences [2025-02-05 23:25:26,445 INFO L185 FreeRefinementEngine]: Found 1 perfect and 1 imperfect interpolant sequences. [2025-02-05 23:25:26,445 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [2] total 2 [2025-02-05 23:25:26,447 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1854359288] [2025-02-05 23:25:26,447 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-02-05 23:25:26,450 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 2 states [2025-02-05 23:25:26,450 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-02-05 23:25:26,470 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 2 interpolants. [2025-02-05 23:25:26,471 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=1, Invalid=1, Unknown=0, NotChecked=0, Total=2 [2025-02-05 23:25:26,473 INFO L87 Difference]: Start difference. First operand has 83 states, 56 states have (on average 1.4821428571428572) internal successors, (83), 57 states have internal predecessors, (83), 24 states have call successors, (24), 1 states have call predecessors, (24), 1 states have return successors, (24), 24 states have call predecessors, (24), 24 states have call successors, (24) Second operand has 2 states, 2 states have (on average 22.5) internal successors, (45), 2 states have internal predecessors, (45), 2 states have call successors, (24), 2 states have call predecessors, (24), 1 states have return successors, (24), 1 states have call predecessors, (24), 2 states have call successors, (24) [2025-02-05 23:25:26,498 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-02-05 23:25:26,499 INFO L93 Difference]: Finished difference Result 158 states and 277 transitions. [2025-02-05 23:25:26,500 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 2 states. [2025-02-05 23:25:26,501 INFO L78 Accepts]: Start accepts. Automaton has has 2 states, 2 states have (on average 22.5) internal successors, (45), 2 states have internal predecessors, (45), 2 states have call successors, (24), 2 states have call predecessors, (24), 1 states have return successors, (24), 1 states have call predecessors, (24), 2 states have call successors, (24) Word has length 160 [2025-02-05 23:25:26,501 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-02-05 23:25:26,505 INFO L225 Difference]: With dead ends: 158 [2025-02-05 23:25:26,505 INFO L226 Difference]: Without dead ends: 78 [2025-02-05 23:25:26,508 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 161 GetRequests, 161 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 23:25:26,510 INFO L435 NwaCegarLoop]: 121 mSDtfsCounter, 0 mSDsluCounter, 0 mSDsCounter, 0 mSdLazyCounter, 0 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 0 SdHoareTripleChecker+Valid, 121 SdHoareTripleChecker+Invalid, 0 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 0 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2025-02-05 23:25:26,510 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [0 Valid, 121 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 0 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2025-02-05 23:25:26,519 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 78 states. [2025-02-05 23:25:26,533 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 78 to 78. [2025-02-05 23:25:26,534 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 78 states, 52 states have (on average 1.4038461538461537) internal successors, (73), 52 states have internal predecessors, (73), 24 states have call successors, (24), 1 states have call predecessors, (24), 1 states have return successors, (24), 24 states have call predecessors, (24), 24 states have call successors, (24) [2025-02-05 23:25:26,542 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 78 states to 78 states and 121 transitions. [2025-02-05 23:25:26,544 INFO L78 Accepts]: Start accepts. Automaton has 78 states and 121 transitions. Word has length 160 [2025-02-05 23:25:26,544 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-02-05 23:25:26,544 INFO L471 AbstractCegarLoop]: Abstraction has 78 states and 121 transitions. [2025-02-05 23:25:26,544 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 2 states, 2 states have (on average 22.5) internal successors, (45), 2 states have internal predecessors, (45), 2 states have call successors, (24), 2 states have call predecessors, (24), 1 states have return successors, (24), 1 states have call predecessors, (24), 2 states have call successors, (24) [2025-02-05 23:25:26,545 INFO L276 IsEmpty]: Start isEmpty. Operand 78 states and 121 transitions. [2025-02-05 23:25:26,547 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 161 [2025-02-05 23:25:26,547 INFO L210 NwaCegarLoop]: Found error trace [2025-02-05 23:25:26,547 INFO L218 NwaCegarLoop]: trace histogram [24, 24, 24, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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 23:25:26,554 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (2)] Forceful destruction successful, exit code 0 [2025-02-05 23:25:26,751 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 23:25:26,752 INFO L396 AbstractCegarLoop]: === Iteration 2 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-02-05 23:25:26,752 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-02-05 23:25:26,752 INFO L85 PathProgramCache]: Analyzing trace with hash -734865712, now seen corresponding path program 1 times [2025-02-05 23:25:26,753 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-02-05 23:25:26,753 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1477411392] [2025-02-05 23:25:26,753 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-02-05 23:25:26,753 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-02-05 23:25:26,777 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 160 statements into 1 equivalence classes. [2025-02-05 23:25:26,986 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 160 of 160 statements. [2025-02-05 23:25:26,987 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-02-05 23:25:26,987 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-02-05 23:25:32,304 INFO L134 CoverageAnalysis]: Checked inductivity of 1104 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 1104 trivial. 0 not checked. [2025-02-05 23:25:32,304 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-02-05 23:25:32,304 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1477411392] [2025-02-05 23:25:32,304 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1477411392] provided 1 perfect and 0 imperfect interpolant sequences [2025-02-05 23:25:32,305 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-02-05 23:25:32,305 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [16] imperfect sequences [] total 16 [2025-02-05 23:25:32,305 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [148977333] [2025-02-05 23:25:32,305 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-02-05 23:25:32,306 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 16 states [2025-02-05 23:25:32,306 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-02-05 23:25:32,306 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 16 interpolants. [2025-02-05 23:25:32,307 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=63, Invalid=177, Unknown=0, NotChecked=0, Total=240 [2025-02-05 23:25:32,307 INFO L87 Difference]: Start difference. First operand 78 states and 121 transitions. Second operand has 16 states, 16 states have (on average 2.6875) internal successors, (43), 16 states have internal predecessors, (43), 1 states have call successors, (24), 1 states have call predecessors, (24), 1 states have return successors, (24), 1 states have call predecessors, (24), 1 states have call successors, (24) [2025-02-05 23:25:33,465 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-02-05 23:25:33,465 INFO L93 Difference]: Finished difference Result 367 states and 554 transitions. [2025-02-05 23:25:33,466 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 20 states. [2025-02-05 23:25:33,466 INFO L78 Accepts]: Start accepts. Automaton has has 16 states, 16 states have (on average 2.6875) internal successors, (43), 16 states have internal predecessors, (43), 1 states have call successors, (24), 1 states have call predecessors, (24), 1 states have return successors, (24), 1 states have call predecessors, (24), 1 states have call successors, (24) Word has length 160 [2025-02-05 23:25:33,467 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-02-05 23:25:33,470 INFO L225 Difference]: With dead ends: 367 [2025-02-05 23:25:33,472 INFO L226 Difference]: Without dead ends: 292 [2025-02-05 23:25:33,473 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 27 GetRequests, 5 SyntacticMatches, 0 SemanticMatches, 22 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 80 ImplicationChecksByTransitivity, 1.1s TimeCoverageRelationStatistics Valid=131, Invalid=421, Unknown=0, NotChecked=0, Total=552 [2025-02-05 23:25:33,474 INFO L435 NwaCegarLoop]: 95 mSDtfsCounter, 410 mSDsluCounter, 493 mSDsCounter, 0 mSdLazyCounter, 556 mSolverCounterSat, 18 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.6s Time, 0 mProtectedPredicate, 0 mProtectedAction, 410 SdHoareTripleChecker+Valid, 588 SdHoareTripleChecker+Invalid, 574 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 18 IncrementalHoareTripleChecker+Valid, 556 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.7s IncrementalHoareTripleChecker+Time [2025-02-05 23:25:33,474 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [410 Valid, 588 Invalid, 574 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [18 Valid, 556 Invalid, 0 Unknown, 0 Unchecked, 0.7s Time] [2025-02-05 23:25:33,475 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 292 states. [2025-02-05 23:25:33,517 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 292 to 188. [2025-02-05 23:25:33,518 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 188 states, 132 states have (on average 1.4015151515151516) internal successors, (185), 133 states have internal predecessors, (185), 52 states have call successors, (52), 3 states have call predecessors, (52), 3 states have return successors, (52), 51 states have call predecessors, (52), 52 states have call successors, (52) [2025-02-05 23:25:33,521 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 188 states to 188 states and 289 transitions. [2025-02-05 23:25:33,524 INFO L78 Accepts]: Start accepts. Automaton has 188 states and 289 transitions. Word has length 160 [2025-02-05 23:25:33,524 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-02-05 23:25:33,524 INFO L471 AbstractCegarLoop]: Abstraction has 188 states and 289 transitions. [2025-02-05 23:25:33,524 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 16 states, 16 states have (on average 2.6875) internal successors, (43), 16 states have internal predecessors, (43), 1 states have call successors, (24), 1 states have call predecessors, (24), 1 states have return successors, (24), 1 states have call predecessors, (24), 1 states have call successors, (24) [2025-02-05 23:25:33,524 INFO L276 IsEmpty]: Start isEmpty. Operand 188 states and 289 transitions. [2025-02-05 23:25:33,527 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 161 [2025-02-05 23:25:33,528 INFO L210 NwaCegarLoop]: Found error trace [2025-02-05 23:25:33,528 INFO L218 NwaCegarLoop]: trace histogram [24, 24, 24, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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 23:25:33,528 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable1 [2025-02-05 23:25:33,528 INFO L396 AbstractCegarLoop]: === Iteration 3 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-02-05 23:25:33,529 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-02-05 23:25:33,529 INFO L85 PathProgramCache]: Analyzing trace with hash -733942191, now seen corresponding path program 1 times [2025-02-05 23:25:33,530 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-02-05 23:25:33,530 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [294741673] [2025-02-05 23:25:33,530 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-02-05 23:25:33,530 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-02-05 23:25:33,542 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 160 statements into 1 equivalence classes. [2025-02-05 23:25:33,611 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 160 of 160 statements. [2025-02-05 23:25:33,613 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-02-05 23:25:33,613 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-02-05 23:26:10,381 INFO L134 CoverageAnalysis]: Checked inductivity of 1104 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 1104 trivial. 0 not checked. [2025-02-05 23:26:10,381 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-02-05 23:26:10,381 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [294741673] [2025-02-05 23:26:10,381 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [294741673] provided 1 perfect and 0 imperfect interpolant sequences [2025-02-05 23:26:10,381 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-02-05 23:26:10,381 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [16] imperfect sequences [] total 16 [2025-02-05 23:26:10,381 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [597470403] [2025-02-05 23:26:10,381 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-02-05 23:26:10,382 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 16 states [2025-02-05 23:26:10,382 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-02-05 23:26:10,382 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 16 interpolants. [2025-02-05 23:26:10,382 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=57, Invalid=183, Unknown=0, NotChecked=0, Total=240 [2025-02-05 23:26:10,383 INFO L87 Difference]: Start difference. First operand 188 states and 289 transitions. Second operand has 16 states, 16 states have (on average 2.6875) internal successors, (43), 16 states have internal predecessors, (43), 1 states have call successors, (24), 1 states have call predecessors, (24), 1 states have return successors, (24), 1 states have call predecessors, (24), 1 states have call successors, (24) [2025-02-05 23:26:14,030 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-02-05 23:26:14,031 INFO L93 Difference]: Finished difference Result 438 states and 664 transitions. [2025-02-05 23:26:14,031 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 16 states. [2025-02-05 23:26:14,031 INFO L78 Accepts]: Start accepts. Automaton has has 16 states, 16 states have (on average 2.6875) internal successors, (43), 16 states have internal predecessors, (43), 1 states have call successors, (24), 1 states have call predecessors, (24), 1 states have return successors, (24), 1 states have call predecessors, (24), 1 states have call successors, (24) Word has length 160 [2025-02-05 23:26:14,032 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-02-05 23:26:14,035 INFO L225 Difference]: With dead ends: 438 [2025-02-05 23:26:14,035 INFO L226 Difference]: Without dead ends: 363 [2025-02-05 23:26:14,035 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 23 GetRequests, 5 SyntacticMatches, 0 SemanticMatches, 18 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 35 ImplicationChecksByTransitivity, 3.9s TimeCoverageRelationStatistics Valid=102, Invalid=278, Unknown=0, NotChecked=0, Total=380 [2025-02-05 23:26:14,036 INFO L435 NwaCegarLoop]: 86 mSDtfsCounter, 219 mSDsluCounter, 495 mSDsCounter, 0 mSdLazyCounter, 544 mSolverCounterSat, 11 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 1.7s Time, 0 mProtectedPredicate, 0 mProtectedAction, 219 SdHoareTripleChecker+Valid, 581 SdHoareTripleChecker+Invalid, 555 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 11 IncrementalHoareTripleChecker+Valid, 544 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 1.9s IncrementalHoareTripleChecker+Time [2025-02-05 23:26:14,036 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [219 Valid, 581 Invalid, 555 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [11 Valid, 544 Invalid, 0 Unknown, 0 Unchecked, 1.9s Time] [2025-02-05 23:26:14,037 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 363 states. [2025-02-05 23:26:14,062 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 363 to 226. [2025-02-05 23:26:14,063 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 226 states, 170 states have (on average 1.4176470588235295) internal successors, (241), 171 states have internal predecessors, (241), 52 states have call successors, (52), 3 states have call predecessors, (52), 3 states have return successors, (52), 51 states have call predecessors, (52), 52 states have call successors, (52) [2025-02-05 23:26:14,068 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 226 states to 226 states and 345 transitions. [2025-02-05 23:26:14,068 INFO L78 Accepts]: Start accepts. Automaton has 226 states and 345 transitions. Word has length 160 [2025-02-05 23:26:14,069 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-02-05 23:26:14,069 INFO L471 AbstractCegarLoop]: Abstraction has 226 states and 345 transitions. [2025-02-05 23:26:14,069 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 16 states, 16 states have (on average 2.6875) internal successors, (43), 16 states have internal predecessors, (43), 1 states have call successors, (24), 1 states have call predecessors, (24), 1 states have return successors, (24), 1 states have call predecessors, (24), 1 states have call successors, (24) [2025-02-05 23:26:14,069 INFO L276 IsEmpty]: Start isEmpty. Operand 226 states and 345 transitions. [2025-02-05 23:26:14,070 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 161 [2025-02-05 23:26:14,070 INFO L210 NwaCegarLoop]: Found error trace [2025-02-05 23:26:14,070 INFO L218 NwaCegarLoop]: trace histogram [24, 24, 24, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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 23:26:14,071 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable2 [2025-02-05 23:26:14,071 INFO L396 AbstractCegarLoop]: === Iteration 4 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-02-05 23:26:14,071 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-02-05 23:26:14,071 INFO L85 PathProgramCache]: Analyzing trace with hash -605782993, now seen corresponding path program 1 times [2025-02-05 23:26:14,071 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-02-05 23:26:14,071 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [101518814] [2025-02-05 23:26:14,071 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-02-05 23:26:14,071 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-02-05 23:26:14,085 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 160 statements into 1 equivalence classes. [2025-02-05 23:26:14,134 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 160 of 160 statements. [2025-02-05 23:26:14,135 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-02-05 23:26:14,135 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-02-05 23:26:18,133 INFO L134 CoverageAnalysis]: Checked inductivity of 1104 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 1104 trivial. 0 not checked. [2025-02-05 23:26:18,134 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-02-05 23:26:18,134 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [101518814] [2025-02-05 23:26:18,134 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [101518814] provided 1 perfect and 0 imperfect interpolant sequences [2025-02-05 23:26:18,134 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-02-05 23:26:18,134 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [16] imperfect sequences [] total 16 [2025-02-05 23:26:18,134 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [510407124] [2025-02-05 23:26:18,134 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-02-05 23:26:18,135 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 16 states [2025-02-05 23:26:18,135 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-02-05 23:26:18,136 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 16 interpolants. [2025-02-05 23:26:18,136 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=63, Invalid=177, Unknown=0, NotChecked=0, Total=240 [2025-02-05 23:26:18,136 INFO L87 Difference]: Start difference. First operand 226 states and 345 transitions. Second operand has 16 states, 16 states have (on average 2.6875) internal successors, (43), 16 states have internal predecessors, (43), 1 states have call successors, (24), 1 states have call predecessors, (24), 1 states have return successors, (24), 1 states have call predecessors, (24), 1 states have call successors, (24) [2025-02-05 23:26:19,319 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-02-05 23:26:19,319 INFO L93 Difference]: Finished difference Result 334 states and 485 transitions. [2025-02-05 23:26:19,319 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 20 states. [2025-02-05 23:26:19,320 INFO L78 Accepts]: Start accepts. Automaton has has 16 states, 16 states have (on average 2.6875) internal successors, (43), 16 states have internal predecessors, (43), 1 states have call successors, (24), 1 states have call predecessors, (24), 1 states have return successors, (24), 1 states have call predecessors, (24), 1 states have call successors, (24) Word has length 160 [2025-02-05 23:26:19,321 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-02-05 23:26:19,324 INFO L225 Difference]: With dead ends: 334 [2025-02-05 23:26:19,324 INFO L226 Difference]: Without dead ends: 332 [2025-02-05 23:26:19,325 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 27 GetRequests, 5 SyntacticMatches, 0 SemanticMatches, 22 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 80 ImplicationChecksByTransitivity, 1.0s TimeCoverageRelationStatistics Valid=131, Invalid=421, Unknown=0, NotChecked=0, Total=552 [2025-02-05 23:26:19,326 INFO L435 NwaCegarLoop]: 101 mSDtfsCounter, 356 mSDsluCounter, 569 mSDsCounter, 0 mSdLazyCounter, 704 mSolverCounterSat, 8 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.7s Time, 0 mProtectedPredicate, 0 mProtectedAction, 356 SdHoareTripleChecker+Valid, 670 SdHoareTripleChecker+Invalid, 712 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 8 IncrementalHoareTripleChecker+Valid, 704 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.8s IncrementalHoareTripleChecker+Time [2025-02-05 23:26:19,326 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [356 Valid, 670 Invalid, 712 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [8 Valid, 704 Invalid, 0 Unknown, 0 Unchecked, 0.8s Time] [2025-02-05 23:26:19,328 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 332 states. [2025-02-05 23:26:19,367 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 332 to 234. [2025-02-05 23:26:19,368 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 234 states, 178 states have (on average 1.4213483146067416) internal successors, (253), 179 states have internal predecessors, (253), 52 states have call successors, (52), 3 states have call predecessors, (52), 3 states have return successors, (52), 51 states have call predecessors, (52), 52 states have call successors, (52) [2025-02-05 23:26:19,370 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 234 states to 234 states and 357 transitions. [2025-02-05 23:26:19,374 INFO L78 Accepts]: Start accepts. Automaton has 234 states and 357 transitions. Word has length 160 [2025-02-05 23:26:19,375 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-02-05 23:26:19,375 INFO L471 AbstractCegarLoop]: Abstraction has 234 states and 357 transitions. [2025-02-05 23:26:19,375 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 16 states, 16 states have (on average 2.6875) internal successors, (43), 16 states have internal predecessors, (43), 1 states have call successors, (24), 1 states have call predecessors, (24), 1 states have return successors, (24), 1 states have call predecessors, (24), 1 states have call successors, (24) [2025-02-05 23:26:19,375 INFO L276 IsEmpty]: Start isEmpty. Operand 234 states and 357 transitions. [2025-02-05 23:26:19,376 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 161 [2025-02-05 23:26:19,376 INFO L210 NwaCegarLoop]: Found error trace [2025-02-05 23:26:19,376 INFO L218 NwaCegarLoop]: trace histogram [24, 24, 24, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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 23:26:19,377 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable3 [2025-02-05 23:26:19,377 INFO L396 AbstractCegarLoop]: === Iteration 5 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-02-05 23:26:19,377 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-02-05 23:26:19,377 INFO L85 PathProgramCache]: Analyzing trace with hash -604859472, now seen corresponding path program 1 times [2025-02-05 23:26:19,377 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-02-05 23:26:19,377 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1891798838] [2025-02-05 23:26:19,377 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-02-05 23:26:19,377 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-02-05 23:26:19,390 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 160 statements into 1 equivalence classes. [2025-02-05 23:26:19,421 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 160 of 160 statements. [2025-02-05 23:26:19,421 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-02-05 23:26:19,421 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-02-05 23:26:49,319 INFO L134 CoverageAnalysis]: Checked inductivity of 1104 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 1104 trivial. 0 not checked. [2025-02-05 23:26:49,319 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-02-05 23:26:49,319 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1891798838] [2025-02-05 23:26:49,319 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1891798838] provided 1 perfect and 0 imperfect interpolant sequences [2025-02-05 23:26:49,319 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-02-05 23:26:49,319 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [17] imperfect sequences [] total 17 [2025-02-05 23:26:49,319 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1624274733] [2025-02-05 23:26:49,319 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-02-05 23:26:49,320 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 17 states [2025-02-05 23:26:49,320 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-02-05 23:26:49,320 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 17 interpolants. [2025-02-05 23:26:49,320 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=73, Invalid=199, Unknown=0, NotChecked=0, Total=272 [2025-02-05 23:26:49,320 INFO L87 Difference]: Start difference. First operand 234 states and 357 transitions. Second operand has 17 states, 17 states have (on average 2.5294117647058822) internal successors, (43), 17 states have internal predecessors, (43), 1 states have call successors, (24), 1 states have call predecessors, (24), 1 states have return successors, (24), 1 states have call predecessors, (24), 1 states have call successors, (24) [2025-02-05 23:26:50,709 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-02-05 23:26:50,709 INFO L93 Difference]: Finished difference Result 321 states and 472 transitions. [2025-02-05 23:26:50,709 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 21 states. [2025-02-05 23:26:50,710 INFO L78 Accepts]: Start accepts. Automaton has has 17 states, 17 states have (on average 2.5294117647058822) internal successors, (43), 17 states have internal predecessors, (43), 1 states have call successors, (24), 1 states have call predecessors, (24), 1 states have return successors, (24), 1 states have call predecessors, (24), 1 states have call successors, (24) Word has length 160 [2025-02-05 23:26:50,710 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-02-05 23:26:50,712 INFO L225 Difference]: With dead ends: 321 [2025-02-05 23:26:50,712 INFO L226 Difference]: Without dead ends: 319 [2025-02-05 23:26:50,712 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 28 GetRequests, 5 SyntacticMatches, 0 SemanticMatches, 23 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 89 ImplicationChecksByTransitivity, 1.7s TimeCoverageRelationStatistics Valid=143, Invalid=457, Unknown=0, NotChecked=0, Total=600 [2025-02-05 23:26:50,713 INFO L435 NwaCegarLoop]: 105 mSDtfsCounter, 357 mSDsluCounter, 535 mSDsCounter, 0 mSdLazyCounter, 696 mSolverCounterSat, 11 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.7s Time, 0 mProtectedPredicate, 0 mProtectedAction, 357 SdHoareTripleChecker+Valid, 640 SdHoareTripleChecker+Invalid, 707 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 11 IncrementalHoareTripleChecker+Valid, 696 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.8s IncrementalHoareTripleChecker+Time [2025-02-05 23:26:50,714 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [357 Valid, 640 Invalid, 707 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [11 Valid, 696 Invalid, 0 Unknown, 0 Unchecked, 0.8s Time] [2025-02-05 23:26:50,715 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 319 states. [2025-02-05 23:26:50,742 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 319 to 231. [2025-02-05 23:26:50,743 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 231 states, 175 states have (on average 1.417142857142857) internal successors, (248), 176 states have internal predecessors, (248), 52 states have call successors, (52), 3 states have call predecessors, (52), 3 states have return successors, (52), 51 states have call predecessors, (52), 52 states have call successors, (52) [2025-02-05 23:26:50,744 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 231 states to 231 states and 352 transitions. [2025-02-05 23:26:50,747 INFO L78 Accepts]: Start accepts. Automaton has 231 states and 352 transitions. Word has length 160 [2025-02-05 23:26:50,748 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-02-05 23:26:50,748 INFO L471 AbstractCegarLoop]: Abstraction has 231 states and 352 transitions. [2025-02-05 23:26:50,748 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 17 states, 17 states have (on average 2.5294117647058822) internal successors, (43), 17 states have internal predecessors, (43), 1 states have call successors, (24), 1 states have call predecessors, (24), 1 states have return successors, (24), 1 states have call predecessors, (24), 1 states have call successors, (24) [2025-02-05 23:26:50,748 INFO L276 IsEmpty]: Start isEmpty. Operand 231 states and 352 transitions. [2025-02-05 23:26:50,749 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 161 [2025-02-05 23:26:50,751 INFO L210 NwaCegarLoop]: Found error trace [2025-02-05 23:26:50,752 INFO L218 NwaCegarLoop]: trace histogram [24, 24, 24, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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 23:26:50,752 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable4 [2025-02-05 23:26:50,752 INFO L396 AbstractCegarLoop]: === Iteration 6 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-02-05 23:26:50,752 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-02-05 23:26:50,752 INFO L85 PathProgramCache]: Analyzing trace with hash -1245399889, now seen corresponding path program 1 times [2025-02-05 23:26:50,752 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-02-05 23:26:50,752 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1706893302] [2025-02-05 23:26:50,752 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-02-05 23:26:50,752 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-02-05 23:26:50,762 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 160 statements into 1 equivalence classes. [2025-02-05 23:26:50,768 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 160 of 160 statements. [2025-02-05 23:26:50,768 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-02-05 23:26:50,768 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-02-05 23:26:50,794 INFO L134 CoverageAnalysis]: Checked inductivity of 1104 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 1104 trivial. 0 not checked. [2025-02-05 23:26:50,794 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-02-05 23:26:50,794 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1706893302] [2025-02-05 23:26:50,794 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1706893302] provided 1 perfect and 0 imperfect interpolant sequences [2025-02-05 23:26:50,794 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-02-05 23:26:50,794 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2025-02-05 23:26:50,795 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [800753011] [2025-02-05 23:26:50,795 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-02-05 23:26:50,796 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2025-02-05 23:26:50,796 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-02-05 23:26:50,796 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2025-02-05 23:26:50,796 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-02-05 23:26:50,796 INFO L87 Difference]: Start difference. First operand 231 states and 352 transitions. Second operand has 3 states, 3 states have (on average 14.333333333333334) internal successors, (43), 3 states have internal predecessors, (43), 1 states have call successors, (24), 1 states have call predecessors, (24), 1 states have return successors, (24), 1 states have call predecessors, (24), 1 states have call successors, (24) [2025-02-05 23:26:50,839 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-02-05 23:26:50,839 INFO L93 Difference]: Finished difference Result 481 states and 738 transitions. [2025-02-05 23:26:50,839 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2025-02-05 23:26:50,839 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 14.333333333333334) internal successors, (43), 3 states have internal predecessors, (43), 1 states have call successors, (24), 1 states have call predecessors, (24), 1 states have return successors, (24), 1 states have call predecessors, (24), 1 states have call successors, (24) Word has length 160 [2025-02-05 23:26:50,840 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-02-05 23:26:50,842 INFO L225 Difference]: With dead ends: 481 [2025-02-05 23:26:50,842 INFO L226 Difference]: Without dead ends: 343 [2025-02-05 23:26:50,842 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 23:26:50,843 INFO L435 NwaCegarLoop]: 213 mSDtfsCounter, 102 mSDsluCounter, 103 mSDsCounter, 0 mSdLazyCounter, 20 mSolverCounterSat, 11 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 102 SdHoareTripleChecker+Valid, 316 SdHoareTripleChecker+Invalid, 31 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 11 IncrementalHoareTripleChecker+Valid, 20 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2025-02-05 23:26:50,843 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [102 Valid, 316 Invalid, 31 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [11 Valid, 20 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2025-02-05 23:26:50,843 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 343 states. [2025-02-05 23:26:50,863 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 343 to 341. [2025-02-05 23:26:50,864 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 341 states, 255 states have (on average 1.3764705882352941) internal successors, (351), 257 states have internal predecessors, (351), 80 states have call successors, (80), 5 states have call predecessors, (80), 5 states have return successors, (80), 78 states have call predecessors, (80), 80 states have call successors, (80) [2025-02-05 23:26:50,866 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 341 states to 341 states and 511 transitions. [2025-02-05 23:26:50,866 INFO L78 Accepts]: Start accepts. Automaton has 341 states and 511 transitions. Word has length 160 [2025-02-05 23:26:50,868 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-02-05 23:26:50,868 INFO L471 AbstractCegarLoop]: Abstraction has 341 states and 511 transitions. [2025-02-05 23:26:50,868 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 14.333333333333334) internal successors, (43), 3 states have internal predecessors, (43), 1 states have call successors, (24), 1 states have call predecessors, (24), 1 states have return successors, (24), 1 states have call predecessors, (24), 1 states have call successors, (24) [2025-02-05 23:26:50,869 INFO L276 IsEmpty]: Start isEmpty. Operand 341 states and 511 transitions. [2025-02-05 23:26:50,870 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 161 [2025-02-05 23:26:50,870 INFO L210 NwaCegarLoop]: Found error trace [2025-02-05 23:26:50,870 INFO L218 NwaCegarLoop]: trace histogram [24, 24, 24, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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 23:26:50,870 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable5 [2025-02-05 23:26:50,870 INFO L396 AbstractCegarLoop]: === Iteration 7 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-02-05 23:26:50,870 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-02-05 23:26:50,871 INFO L85 PathProgramCache]: Analyzing trace with hash 1252616048, now seen corresponding path program 1 times [2025-02-05 23:26:50,871 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-02-05 23:26:50,871 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [72881888] [2025-02-05 23:26:50,871 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-02-05 23:26:50,871 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-02-05 23:26:50,877 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 160 statements into 1 equivalence classes. [2025-02-05 23:26:50,882 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 160 of 160 statements. [2025-02-05 23:26:50,883 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-02-05 23:26:50,883 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-02-05 23:26:50,939 INFO L134 CoverageAnalysis]: Checked inductivity of 1104 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 1104 trivial. 0 not checked. [2025-02-05 23:26:50,939 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-02-05 23:26:50,939 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [72881888] [2025-02-05 23:26:50,939 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [72881888] provided 1 perfect and 0 imperfect interpolant sequences [2025-02-05 23:26:50,939 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-02-05 23:26:50,939 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2025-02-05 23:26:50,939 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [619216256] [2025-02-05 23:26:50,939 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-02-05 23:26:50,940 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2025-02-05 23:26:50,940 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-02-05 23:26:50,940 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2025-02-05 23:26:50,940 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2025-02-05 23:26:50,940 INFO L87 Difference]: Start difference. First operand 341 states and 511 transitions. Second operand has 5 states, 5 states have (on average 8.6) internal successors, (43), 5 states have internal predecessors, (43), 1 states have call successors, (24), 1 states have call predecessors, (24), 1 states have return successors, (24), 1 states have call predecessors, (24), 1 states have call successors, (24) [2025-02-05 23:26:51,132 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-02-05 23:26:51,132 INFO L93 Difference]: Finished difference Result 719 states and 1062 transitions. [2025-02-05 23:26:51,133 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2025-02-05 23:26:51,133 INFO L78 Accepts]: Start accepts. Automaton has has 5 states, 5 states have (on average 8.6) internal successors, (43), 5 states have internal predecessors, (43), 1 states have call successors, (24), 1 states have call predecessors, (24), 1 states have return successors, (24), 1 states have call predecessors, (24), 1 states have call successors, (24) Word has length 160 [2025-02-05 23:26:51,133 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-02-05 23:26:51,135 INFO L225 Difference]: With dead ends: 719 [2025-02-05 23:26:51,135 INFO L226 Difference]: Without dead ends: 517 [2025-02-05 23:26:51,136 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 8 GetRequests, 3 SyntacticMatches, 0 SemanticMatches, 5 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=15, Invalid=27, Unknown=0, NotChecked=0, Total=42 [2025-02-05 23:26:51,137 INFO L435 NwaCegarLoop]: 138 mSDtfsCounter, 99 mSDsluCounter, 249 mSDsCounter, 0 mSdLazyCounter, 180 mSolverCounterSat, 13 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 99 SdHoareTripleChecker+Valid, 387 SdHoareTripleChecker+Invalid, 193 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 13 IncrementalHoareTripleChecker+Valid, 180 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.2s IncrementalHoareTripleChecker+Time [2025-02-05 23:26:51,138 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [99 Valid, 387 Invalid, 193 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [13 Valid, 180 Invalid, 0 Unknown, 0 Unchecked, 0.2s Time] [2025-02-05 23:26:51,139 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 517 states. [2025-02-05 23:26:51,166 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 517 to 466. [2025-02-05 23:26:51,167 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 466 states, 349 states have (on average 1.3696275071633237) internal successors, (478), 352 states have internal predecessors, (478), 108 states have call successors, (108), 8 states have call predecessors, (108), 8 states have return successors, (108), 105 states have call predecessors, (108), 108 states have call successors, (108) [2025-02-05 23:26:51,169 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 466 states to 466 states and 694 transitions. [2025-02-05 23:26:51,170 INFO L78 Accepts]: Start accepts. Automaton has 466 states and 694 transitions. Word has length 160 [2025-02-05 23:26:51,171 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-02-05 23:26:51,171 INFO L471 AbstractCegarLoop]: Abstraction has 466 states and 694 transitions. [2025-02-05 23:26:51,173 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 8.6) internal successors, (43), 5 states have internal predecessors, (43), 1 states have call successors, (24), 1 states have call predecessors, (24), 1 states have return successors, (24), 1 states have call predecessors, (24), 1 states have call successors, (24) [2025-02-05 23:26:51,173 INFO L276 IsEmpty]: Start isEmpty. Operand 466 states and 694 transitions. [2025-02-05 23:26:51,174 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 161 [2025-02-05 23:26:51,174 INFO L210 NwaCegarLoop]: Found error trace [2025-02-05 23:26:51,175 INFO L218 NwaCegarLoop]: trace histogram [24, 24, 24, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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 23:26:51,175 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable6 [2025-02-05 23:26:51,175 INFO L396 AbstractCegarLoop]: === Iteration 8 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-02-05 23:26:51,175 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-02-05 23:26:51,175 INFO L85 PathProgramCache]: Analyzing trace with hash 1381698767, now seen corresponding path program 1 times [2025-02-05 23:26:51,175 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-02-05 23:26:51,175 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1967249961] [2025-02-05 23:26:51,175 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-02-05 23:26:51,175 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-02-05 23:26:51,183 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 160 statements into 1 equivalence classes. [2025-02-05 23:26:51,204 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 160 of 160 statements. [2025-02-05 23:26:51,204 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-02-05 23:26:51,204 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-02-05 23:26:54,828 INFO L134 CoverageAnalysis]: Checked inductivity of 1104 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 1104 trivial. 0 not checked. [2025-02-05 23:26:54,828 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-02-05 23:26:54,828 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1967249961] [2025-02-05 23:26:54,828 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1967249961] provided 1 perfect and 0 imperfect interpolant sequences [2025-02-05 23:26:54,828 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-02-05 23:26:54,828 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [13] imperfect sequences [] total 13 [2025-02-05 23:26:54,828 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1203520262] [2025-02-05 23:26:54,828 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-02-05 23:26:54,829 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 13 states [2025-02-05 23:26:54,829 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-02-05 23:26:54,829 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 13 interpolants. [2025-02-05 23:26:54,829 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=27, Invalid=129, Unknown=0, NotChecked=0, Total=156 [2025-02-05 23:26:54,829 INFO L87 Difference]: Start difference. First operand 466 states and 694 transitions. Second operand has 13 states, 13 states have (on average 3.3076923076923075) internal successors, (43), 13 states have internal predecessors, (43), 5 states have call successors, (24), 1 states have call predecessors, (24), 1 states have return successors, (24), 5 states have call predecessors, (24), 5 states have call successors, (24) [2025-02-05 23:26:56,737 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-02-05 23:26:56,737 INFO L93 Difference]: Finished difference Result 1024 states and 1450 transitions. [2025-02-05 23:26:56,739 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 11 states. [2025-02-05 23:26:56,740 INFO L78 Accepts]: Start accepts. Automaton has has 13 states, 13 states have (on average 3.3076923076923075) internal successors, (43), 13 states have internal predecessors, (43), 5 states have call successors, (24), 1 states have call predecessors, (24), 1 states have return successors, (24), 5 states have call predecessors, (24), 5 states have call successors, (24) Word has length 160 [2025-02-05 23:26:56,740 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-02-05 23:26:56,744 INFO L225 Difference]: With dead ends: 1024 [2025-02-05 23:26:56,744 INFO L226 Difference]: Without dead ends: 732 [2025-02-05 23:26:56,746 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 33 GetRequests, 13 SyntacticMatches, 0 SemanticMatches, 20 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 47 ImplicationChecksByTransitivity, 1.2s TimeCoverageRelationStatistics Valid=134, Invalid=328, Unknown=0, NotChecked=0, Total=462 [2025-02-05 23:26:56,746 INFO L435 NwaCegarLoop]: 143 mSDtfsCounter, 1004 mSDsluCounter, 728 mSDsCounter, 0 mSdLazyCounter, 709 mSolverCounterSat, 282 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.9s Time, 0 mProtectedPredicate, 0 mProtectedAction, 1004 SdHoareTripleChecker+Valid, 871 SdHoareTripleChecker+Invalid, 991 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 282 IncrementalHoareTripleChecker+Valid, 709 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 1.0s IncrementalHoareTripleChecker+Time [2025-02-05 23:26:56,747 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [1004 Valid, 871 Invalid, 991 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [282 Valid, 709 Invalid, 0 Unknown, 0 Unchecked, 1.0s Time] [2025-02-05 23:26:56,748 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 732 states. [2025-02-05 23:26:56,785 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 732 to 489. [2025-02-05 23:26:56,786 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 489 states, 370 states have (on average 1.3594594594594596) internal successors, (503), 373 states have internal predecessors, (503), 106 states have call successors, (106), 12 states have call predecessors, (106), 12 states have return successors, (106), 103 states have call predecessors, (106), 106 states have call successors, (106) [2025-02-05 23:26:56,788 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 489 states to 489 states and 715 transitions. [2025-02-05 23:26:56,790 INFO L78 Accepts]: Start accepts. Automaton has 489 states and 715 transitions. Word has length 160 [2025-02-05 23:26:56,790 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-02-05 23:26:56,790 INFO L471 AbstractCegarLoop]: Abstraction has 489 states and 715 transitions. [2025-02-05 23:26:56,790 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 13 states, 13 states have (on average 3.3076923076923075) internal successors, (43), 13 states have internal predecessors, (43), 5 states have call successors, (24), 1 states have call predecessors, (24), 1 states have return successors, (24), 5 states have call predecessors, (24), 5 states have call successors, (24) [2025-02-05 23:26:56,790 INFO L276 IsEmpty]: Start isEmpty. Operand 489 states and 715 transitions. [2025-02-05 23:26:56,791 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 161 [2025-02-05 23:26:56,791 INFO L210 NwaCegarLoop]: Found error trace [2025-02-05 23:26:56,792 INFO L218 NwaCegarLoop]: trace histogram [24, 24, 24, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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 23:26:56,792 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable7 [2025-02-05 23:26:56,792 INFO L396 AbstractCegarLoop]: === Iteration 9 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-02-05 23:26:56,792 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-02-05 23:26:56,793 INFO L85 PathProgramCache]: Analyzing trace with hash -1579337583, now seen corresponding path program 1 times [2025-02-05 23:26:56,793 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-02-05 23:26:56,793 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1121333139] [2025-02-05 23:26:56,793 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-02-05 23:26:56,793 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-02-05 23:26:56,800 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 160 statements into 1 equivalence classes. [2025-02-05 23:26:56,809 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 160 of 160 statements. [2025-02-05 23:26:56,810 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-02-05 23:26:56,810 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-02-05 23:26:57,133 INFO L134 CoverageAnalysis]: Checked inductivity of 1104 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 1104 trivial. 0 not checked. [2025-02-05 23:26:57,133 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-02-05 23:26:57,134 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1121333139] [2025-02-05 23:26:57,134 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1121333139] provided 1 perfect and 0 imperfect interpolant sequences [2025-02-05 23:26:57,134 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-02-05 23:26:57,134 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [8] imperfect sequences [] total 8 [2025-02-05 23:26:57,134 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1914015501] [2025-02-05 23:26:57,134 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-02-05 23:26:57,134 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 8 states [2025-02-05 23:26:57,134 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-02-05 23:26:57,135 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2025-02-05 23:26:57,135 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=17, Invalid=39, Unknown=0, NotChecked=0, Total=56 [2025-02-05 23:26:57,135 INFO L87 Difference]: Start difference. First operand 489 states and 715 transitions. Second operand has 8 states, 8 states have (on average 5.375) internal successors, (43), 8 states have internal predecessors, (43), 3 states have call successors, (24), 1 states have call predecessors, (24), 1 states have return successors, (24), 3 states have call predecessors, (24), 3 states have call successors, (24) [2025-02-05 23:26:57,680 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-02-05 23:26:57,681 INFO L93 Difference]: Finished difference Result 1239 states and 1796 transitions. [2025-02-05 23:26:57,681 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2025-02-05 23:26:57,681 INFO L78 Accepts]: Start accepts. Automaton has has 8 states, 8 states have (on average 5.375) internal successors, (43), 8 states have internal predecessors, (43), 3 states have call successors, (24), 1 states have call predecessors, (24), 1 states have return successors, (24), 3 states have call predecessors, (24), 3 states have call successors, (24) Word has length 160 [2025-02-05 23:26:57,682 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-02-05 23:26:57,685 INFO L225 Difference]: With dead ends: 1239 [2025-02-05 23:26:57,686 INFO L226 Difference]: Without dead ends: 863 [2025-02-05 23:26:57,687 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 15 GetRequests, 5 SyntacticMatches, 0 SemanticMatches, 10 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 12 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=46, Invalid=86, Unknown=0, NotChecked=0, Total=132 [2025-02-05 23:26:57,687 INFO L435 NwaCegarLoop]: 191 mSDtfsCounter, 392 mSDsluCounter, 344 mSDsCounter, 0 mSdLazyCounter, 335 mSolverCounterSat, 125 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.3s Time, 0 mProtectedPredicate, 0 mProtectedAction, 392 SdHoareTripleChecker+Valid, 535 SdHoareTripleChecker+Invalid, 460 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 125 IncrementalHoareTripleChecker+Valid, 335 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.4s IncrementalHoareTripleChecker+Time [2025-02-05 23:26:57,687 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [392 Valid, 535 Invalid, 460 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [125 Valid, 335 Invalid, 0 Unknown, 0 Unchecked, 0.4s Time] [2025-02-05 23:26:57,688 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 863 states. [2025-02-05 23:26:57,743 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 863 to 755. [2025-02-05 23:26:57,744 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 755 states, 569 states have (on average 1.3304042179261863) internal successors, (757), 575 states have internal predecessors, (757), 166 states have call successors, (166), 19 states have call predecessors, (166), 19 states have return successors, (166), 160 states have call predecessors, (166), 166 states have call successors, (166) [2025-02-05 23:26:57,746 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 755 states to 755 states and 1089 transitions. [2025-02-05 23:26:57,748 INFO L78 Accepts]: Start accepts. Automaton has 755 states and 1089 transitions. Word has length 160 [2025-02-05 23:26:57,748 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-02-05 23:26:57,748 INFO L471 AbstractCegarLoop]: Abstraction has 755 states and 1089 transitions. [2025-02-05 23:26:57,748 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 8 states, 8 states have (on average 5.375) internal successors, (43), 8 states have internal predecessors, (43), 3 states have call successors, (24), 1 states have call predecessors, (24), 1 states have return successors, (24), 3 states have call predecessors, (24), 3 states have call successors, (24) [2025-02-05 23:26:57,748 INFO L276 IsEmpty]: Start isEmpty. Operand 755 states and 1089 transitions. [2025-02-05 23:26:57,749 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 162 [2025-02-05 23:26:57,749 INFO L210 NwaCegarLoop]: Found error trace [2025-02-05 23:26:57,749 INFO L218 NwaCegarLoop]: trace histogram [24, 24, 24, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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 23:26:57,750 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable8 [2025-02-05 23:26:57,750 INFO L396 AbstractCegarLoop]: === Iteration 10 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-02-05 23:26:57,751 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-02-05 23:26:57,751 INFO L85 PathProgramCache]: Analyzing trace with hash -1149750612, now seen corresponding path program 1 times [2025-02-05 23:26:57,751 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-02-05 23:26:57,751 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [150623625] [2025-02-05 23:26:57,751 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-02-05 23:26:57,751 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-02-05 23:26:57,758 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 161 statements into 1 equivalence classes. [2025-02-05 23:26:57,818 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 161 of 161 statements. [2025-02-05 23:26:57,818 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-02-05 23:26:57,818 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-02-05 23:26:58,008 INFO L134 CoverageAnalysis]: Checked inductivity of 1104 backedges. 30 proven. 39 refuted. 0 times theorem prover too weak. 1035 trivial. 0 not checked. [2025-02-05 23:26:58,009 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-02-05 23:26:58,009 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [150623625] [2025-02-05 23:26:58,009 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [150623625] provided 0 perfect and 1 imperfect interpolant sequences [2025-02-05 23:26:58,009 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1910297661] [2025-02-05 23:26:58,009 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-02-05 23:26:58,009 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-02-05 23:26:58,009 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 [2025-02-05 23:26:58,016 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 23:26:58,017 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 23:26:58,065 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 161 statements into 1 equivalence classes. [2025-02-05 23:26:58,104 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 161 of 161 statements. [2025-02-05 23:26:58,105 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-02-05 23:26:58,105 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-02-05 23:26:58,106 INFO L256 TraceCheckSpWp]: Trace formula consists of 385 conjuncts, 16 conjuncts are in the unsatisfiable core [2025-02-05 23:26:58,109 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-02-05 23:26:58,595 INFO L134 CoverageAnalysis]: Checked inductivity of 1104 backedges. 578 proven. 72 refuted. 0 times theorem prover too weak. 454 trivial. 0 not checked. [2025-02-05 23:26:58,596 INFO L312 TraceCheckSpWp]: Computing backward predicates... [2025-02-05 23:26:58,876 INFO L134 CoverageAnalysis]: Checked inductivity of 1104 backedges. 30 proven. 39 refuted. 0 times theorem prover too weak. 1035 trivial. 0 not checked. [2025-02-05 23:26:58,877 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1910297661] provided 0 perfect and 2 imperfect interpolant sequences [2025-02-05 23:26:58,877 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2025-02-05 23:26:58,877 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [8, 12, 9] total 23 [2025-02-05 23:26:58,877 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1373261254] [2025-02-05 23:26:58,877 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2025-02-05 23:26:58,878 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 23 states [2025-02-05 23:26:58,878 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-02-05 23:26:58,878 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 23 interpolants. [2025-02-05 23:26:58,878 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=88, Invalid=418, Unknown=0, NotChecked=0, Total=506 [2025-02-05 23:26:58,879 INFO L87 Difference]: Start difference. First operand 755 states and 1089 transitions. Second operand has 23 states, 23 states have (on average 4.739130434782608) internal successors, (109), 22 states have internal predecessors, (109), 6 states have call successors, (55), 3 states have call predecessors, (55), 5 states have return successors, (56), 6 states have call predecessors, (56), 6 states have call successors, (56)